Lines Matching full:node
88 struct node *build_node(struct property *proplist, struct node *children, in build_node()
91 struct node *new = xmalloc(sizeof(*new)); in build_node()
92 struct node *child; in build_node()
107 struct node *build_node_delete(struct srcpos *srcpos) in build_node_delete()
109 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
119 struct node *name_node(struct node *node, char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = name; in name_node()
125 return node; in name_node()
128 struct node *omit_node_if_unused(struct node *node) in omit_node_if_unused() argument
130 node->omit_if_unused = 1; in omit_node_if_unused()
132 return node; in omit_node_if_unused()
135 struct node *reference_node(struct node *node) in reference_node() argument
137 node->is_referenced = 1; in reference_node()
139 return node; in reference_node()
142 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
145 struct node *new_child, *old_child; in merge_nodes()
150 /* Add new node labels to old node */ in merge_nodes()
154 /* Move properties from the new node to the old node. If there in merge_nodes()
185 /* if no collision occurred, add property to the old node. */ in merge_nodes()
190 /* Move the override child nodes into the primary node. If in merge_nodes()
193 /* Pop the child node off the list */ in merge_nodes()
214 /* if no collision occurred, add child to the old node. */ in merge_nodes()
221 /* The new node contents are now merged into the old node. Free in merge_nodes()
222 * the new node. */ in merge_nodes()
228 struct node * add_orphan_node(struct node *dt, struct node *new_node, char *ref) in add_orphan_node()
231 struct node *node; in add_orphan_node() local
251 node = build_node(p, new_node, NULL); in add_orphan_node()
252 name_node(node, name); in add_orphan_node()
254 add_child(dt, node); in add_orphan_node()
258 struct node *chain_node(struct node *first, struct node *list) in chain_node()
266 void add_property(struct node *node, struct property *prop) in add_property() argument
272 p = &node->proplist; in add_property()
279 void delete_property_by_name(struct node *node, char *name) in delete_property_by_name() argument
281 struct property *prop = node->proplist; in delete_property_by_name()
298 void add_child(struct node *parent, struct node *child) in add_child()
300 struct node **p; in add_child()
312 void delete_node_by_name(struct node *parent, char *name) in delete_node_by_name()
314 struct node *node = parent->children; in delete_node_by_name() local
316 while (node) { in delete_node_by_name()
317 if (streq(node->name, name)) { in delete_node_by_name()
318 delete_node(node); in delete_node_by_name()
321 node = node->next_sibling; in delete_node_by_name()
325 void delete_node(struct node *node) in delete_node() argument
328 struct node *child; in delete_node()
330 node->deleted = 1; in delete_node()
331 for_each_child(node, child) in delete_node()
333 for_each_property(node, prop) in delete_node()
335 delete_labels(&node->labels); in delete_node()
338 void append_to_property(struct node *node, in append_to_property() argument
345 p = get_property(node, name); in append_to_property()
354 add_property(node, p); in append_to_property()
399 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info()
416 const char *get_unitname(struct node *node) in get_unitname() argument
418 if (node->name[node->basenamelen] == '\0') in get_unitname()
421 return node->name + node->basenamelen + 1; in get_unitname()
424 struct property *get_property(struct node *node, const char *propname) in get_property() argument
428 for_each_property(node, prop) in get_property()
447 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label()
448 struct node **node) in get_property_by_label() argument
451 struct node *c; in get_property_by_label()
453 *node = tree; in get_property_by_label()
464 prop = get_property_by_label(c, label, node); in get_property_by_label()
469 *node = NULL; in get_property_by_label()
473 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label()
474 struct node **node, struct property **prop) in get_marker_label() argument
478 struct node *c; in get_marker_label()
480 *node = tree; in get_marker_label()
491 m = get_marker_label(c, label, node, prop); in get_marker_label()
497 *node = NULL; in get_marker_label()
501 struct node *get_subnode(struct node *node, const char *nodename) in get_subnode() argument
503 struct node *child; in get_subnode()
505 for_each_child(node, child) in get_subnode()
512 struct node *get_node_by_path(struct node *tree, const char *path) in get_node_by_path()
515 struct node *child; in get_node_by_path()
538 struct node *get_node_by_label(struct node *tree, const char *label) in get_node_by_label()
540 struct node *child, *node; in get_node_by_label() local
550 node = get_node_by_label(child, label); in get_node_by_label()
551 if (node) in get_node_by_label()
552 return node; in get_node_by_label()
558 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
560 struct node *child, *node; in get_node_by_phandle() local
574 node = get_node_by_phandle(child, phandle); in get_node_by_phandle()
575 if (node) in get_node_by_phandle()
576 return node; in get_node_by_phandle()
582 struct node *get_node_by_ref(struct node *tree, const char *ref) in get_node_by_ref()
592 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle() argument
597 if ((node->phandle != 0) && (node->phandle != -1)) in get_node_phandle()
598 return node->phandle; in get_node_phandle()
603 node->phandle = phandle; in get_node_phandle()
608 if (!get_property(node, "linux,phandle") in get_node_phandle()
610 add_property(node, build_property("linux,phandle", d, NULL)); in get_node_phandle()
612 if (!get_property(node, "phandle") in get_node_phandle()
614 add_property(node, build_property("phandle", d, NULL)); in get_node_phandle()
616 /* If the node *does* have a phandle property, we must in get_node_phandle()
620 return node->phandle; in get_node_phandle()
623 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
625 struct node *cpus, *bootcpu; in guess_boot_cpuid()
641 /* FIXME: Sanity check node? */ in guess_boot_cpuid()
705 static void sort_properties(struct node *node) in sort_properties() argument
710 for_each_property_withdel(node, prop) in sort_properties()
718 for_each_property_withdel(node, prop) in sort_properties()
723 node->proplist = tbl[0]; in sort_properties()
733 const struct node *a, *b; in cmp_subnode()
735 a = *((const struct node * const *)ax); in cmp_subnode()
736 b = *((const struct node * const *)bx); in cmp_subnode()
741 static void sort_subnodes(struct node *node) in sort_subnodes() argument
744 struct node *subnode, **tbl; in sort_subnodes()
746 for_each_child_withdel(node, subnode) in sort_subnodes()
754 for_each_child_withdel(node, subnode) in sort_subnodes()
759 node->children = tbl[0]; in sort_subnodes()
767 static void sort_node(struct node *node) in sort_node() argument
769 struct node *c; in sort_node()
771 sort_properties(node); in sort_node()
772 sort_subnodes(node); in sort_node()
773 for_each_child_withdel(node, c) in sort_node()
784 static struct node *build_and_name_child_node(struct node *parent, char *name) in build_and_name_child_node()
786 struct node *node; in build_and_name_child_node() local
788 node = build_node(NULL, NULL, NULL); in build_and_name_child_node()
789 name_node(node, xstrdup(name)); in build_and_name_child_node()
790 add_child(parent, node); in build_and_name_child_node()
792 return node; in build_and_name_child_node()
795 static struct node *build_root_node(struct node *dt, char *name) in build_root_node()
797 struct node *an; in build_root_node()
804 die("Could not build root node /%s\n", name); in build_root_node()
809 static bool any_label_tree(struct dt_info *dti, struct node *node) in any_label_tree() argument
811 struct node *c; in any_label_tree()
813 if (node->labels) in any_label_tree()
816 for_each_child(node, c) in any_label_tree()
824 struct node *an, struct node *node, in generate_label_tree_internal() argument
827 struct node *dt = dti->dt; in generate_label_tree_internal()
828 struct node *c; in generate_label_tree_internal()
833 if (node->labels) { in generate_label_tree_internal()
835 /* now add the label in the node */ in generate_label_tree_internal()
836 for_each_label(node->labels, l) { in generate_label_tree_internal()
849 data_copy_escape_string(node->fullpath, in generate_label_tree_internal()
850 strlen(node->fullpath)), in generate_label_tree_internal()
855 /* force allocation of a phandle for this node */ in generate_label_tree_internal()
857 (void)get_node_phandle(dt, node); in generate_label_tree_internal()
860 for_each_child(node, c) in generate_label_tree_internal()
864 static bool any_fixup_tree(struct dt_info *dti, struct node *node) in any_fixup_tree() argument
866 struct node *c; in any_fixup_tree()
870 for_each_property(node, prop) { in any_fixup_tree()
878 for_each_child(node, c) { in any_fixup_tree()
886 static void add_fixup_entry(struct dt_info *dti, struct node *fn, in add_fixup_entry()
887 struct node *node, struct property *prop, in add_fixup_entry() argument
896 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
900 node->fullpath, prop->name, m->offset); in add_fixup_entry()
907 struct node *fn, in generate_fixups_tree_internal()
908 struct node *node) in generate_fixups_tree_internal() argument
910 struct node *dt = dti->dt; in generate_fixups_tree_internal()
911 struct node *c; in generate_fixups_tree_internal()
914 struct node *refnode; in generate_fixups_tree_internal()
916 for_each_property(node, prop) { in generate_fixups_tree_internal()
921 add_fixup_entry(dti, fn, node, prop, m); in generate_fixups_tree_internal()
925 for_each_child(node, c) in generate_fixups_tree_internal()
929 static bool any_local_fixup_tree(struct dt_info *dti, struct node *node) in any_local_fixup_tree() argument
931 struct node *c; in any_local_fixup_tree()
935 for_each_property(node, prop) { in any_local_fixup_tree()
943 for_each_child(node, c) { in any_local_fixup_tree()
952 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
954 struct node *refnode) in add_local_fixup_entry()
956 struct node *wn, *nwn; /* local fixup node, walk node, new */ in add_local_fixup_entry()
963 for (wn = node; wn; wn = wn->parent) in add_local_fixup_entry()
970 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--) in add_local_fixup_entry()
975 /* if no node exists, create it */ in add_local_fixup_entry()
988 struct node *lfn, in generate_local_fixups_tree_internal()
989 struct node *node) in generate_local_fixups_tree_internal() argument
991 struct node *dt = dti->dt; in generate_local_fixups_tree_internal()
992 struct node *c; in generate_local_fixups_tree_internal()
995 struct node *refnode; in generate_local_fixups_tree_internal()
997 for_each_property(node, prop) { in generate_local_fixups_tree_internal()
1002 add_local_fixup_entry(dti, lfn, node, prop, m, refnode); in generate_local_fixups_tree_internal()
1006 for_each_child(node, c) in generate_local_fixups_tree_internal()