Home
last modified time | relevance | path

Searched refs:labels (Results 1 – 6 of 6) sorted by relevance

/scripts/dtc/
A Dlivetree.c32 for_each_label_withdel(*labels, new) in add_label()
41 new->next = *labels; in add_label()
42 *labels = new; in add_label()
49 for_each_label(*labels, label) in delete_labels()
299 delete_labels(&prop->labels); in delete_property()
339 delete_labels(&node->labels); in delete_node()
459 for_each_label(prop->labels, l) in get_property_by_label()
547 for_each_label(tree->labels, l) in get_node_by_label()
841 if (node->labels) in any_label_tree()
861 if (node->labels) { in generate_label_tree_internal()
[all …]
A Dflattree.c55 void (*beginnode)(void *, struct label *labels);
56 void (*endnode)(void *, struct label *labels);
57 void (*property)(void *, struct label *labels);
97 static void bin_emit_endnode(void *e, struct label *labels) in bin_emit_endnode() argument
191 for_each_label(labels, l) { in asm_emit_beginnode()
206 for_each_label(labels, l) { in asm_emit_endnode()
217 for_each_label(labels, l) { in asm_emit_property()
261 emit->beginnode(etarget, tree->labels); in flatten_tree()
278 emit->property(etarget, prop->labels); in flatten_tree()
305 emit->endnode(etarget, tree->labels); in flatten_tree()
[all …]
A Ddtc.h149 struct label *labels; member
167 struct label *labels; member
194 void add_label(struct label **labels, char *label);
195 void delete_labels(struct label **labels);
244 struct label *labels; member
A Ddtc-parser.y162 add_label(&$2->labels, $1);
197 add_label(&target->labels, $2);
283 add_label(&$2->labels, $1);
558 add_label(&$2->labels, $1);
A Dtreesource.c243 for_each_label(tree->labels, l) in write_tree_source_node()
252 for_each_label(prop->labels, l) in write_tree_source_node()
274 for_each_label(re->labels, l) in dt_to_source()
A Dchecks.c427 for_each_label(node->labels, l) in check_duplicate_label_node()
433 for_each_label(prop->labels, l) in check_duplicate_label_node()

Completed in 16 milliseconds