Lines Matching +full:child +full:- +full:node
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
33 if (streq(new->label, label)) { in add_label()
34 new->deleted = 0; in add_label()
40 new->label = label; in add_label()
41 new->next = *labels; in add_label()
50 label->deleted = 1; in delete_labels()
59 new->name = name; in build_property()
60 new->val = val; in build_property()
71 new->name = name; in build_property_delete()
72 new->deleted = 1; in build_property_delete()
79 assert(first->next == NULL); in chain_property()
81 first->next = list; in chain_property()
92 next = p->next; in reverse_properties()
93 p->next = head; in reverse_properties()
100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node() local
107 new->proplist = reverse_properties(proplist); in build_node()
108 new->children = children; in build_node()
110 for_each_child(new, child) { in build_node()
111 child->parent = new; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
123 new->deleted = 1; in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
140 struct node *new_child, *old_child; in merge_nodes()
143 old_node->deleted = 0; in merge_nodes()
145 /* Add new node labels to old node */ in merge_nodes()
146 for_each_label_withdel(new_node->labels, l) in merge_nodes()
147 add_label(&old_node->labels, l->label); in merge_nodes()
149 /* Move properties from the new node to the old node. If there in merge_nodes()
151 while (new_node->proplist) { in merge_nodes()
153 new_prop = new_node->proplist; in merge_nodes()
154 new_node->proplist = new_prop->next; in merge_nodes()
155 new_prop->next = NULL; in merge_nodes()
157 if (new_prop->deleted) { in merge_nodes()
158 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
165 if (streq(old_prop->name, new_prop->name)) { in merge_nodes()
167 for_each_label_withdel(new_prop->labels, l) in merge_nodes()
168 add_label(&old_prop->labels, l->label); in merge_nodes()
170 old_prop->val = new_prop->val; in merge_nodes()
171 old_prop->deleted = 0; in merge_nodes()
178 /* if no collision occurred, add property to the old node. */ in merge_nodes()
183 /* Move the override child nodes into the primary node. If in merge_nodes()
185 while (new_node->children) { in merge_nodes()
186 /* Pop the child node off the list */ in merge_nodes()
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
189 new_child->parent = NULL; in merge_nodes()
190 new_child->next_sibling = NULL; in merge_nodes()
192 if (new_child->deleted) { in merge_nodes()
193 delete_node_by_name(old_node, new_child->name); in merge_nodes()
200 if (streq(old_child->name, new_child->name)) { in merge_nodes()
207 /* if no collision occurred, add child to the old node. */ in merge_nodes()
212 /* The new node contents are now merged into the old node. Free in merge_nodes()
213 * the new node. */ in merge_nodes()
219 void add_orphan_node(struct node *dt, struct node *new_node, char *ref) in add_orphan_node()
222 struct node *node; in add_orphan_node() local
235 node = build_node(p, new_node); in add_orphan_node()
236 name_node(node, name); in add_orphan_node()
238 add_child(dt, node); in add_orphan_node()
241 struct node *chain_node(struct node *first, struct node *list) in chain_node()
243 assert(first->next_sibling == NULL); in chain_node()
245 first->next_sibling = list; in chain_node()
249 void add_property(struct node *node, struct property *prop) in add_property() argument
253 prop->next = NULL; in add_property()
255 p = &node->proplist; in add_property()
257 p = &((*p)->next); in add_property()
262 void delete_property_by_name(struct node *node, char *name) in delete_property_by_name() argument
264 struct property *prop = node->proplist; in delete_property_by_name()
267 if (streq(prop->name, name)) { in delete_property_by_name()
271 prop = prop->next; in delete_property_by_name()
277 prop->deleted = 1; in delete_property()
278 delete_labels(&prop->labels); in delete_property()
281 void add_child(struct node *parent, struct node *child) in add_child() argument
283 struct node **p; in add_child()
285 child->next_sibling = NULL; in add_child()
286 child->parent = parent; in add_child()
288 p = &parent->children; in add_child()
290 p = &((*p)->next_sibling); in add_child()
292 *p = child; in add_child()
295 void delete_node_by_name(struct node *parent, char *name) in delete_node_by_name()
297 struct node *node = parent->children; in delete_node_by_name() local
299 while (node) { in delete_node_by_name()
300 if (streq(node->name, name)) { in delete_node_by_name()
301 delete_node(node); in delete_node_by_name()
304 node = node->next_sibling; in delete_node_by_name()
308 void delete_node(struct node *node) in delete_node() argument
311 struct node *child; in delete_node() local
313 node->deleted = 1; in delete_node()
314 for_each_child(node, child) in delete_node()
315 delete_node(child); in delete_node()
316 for_each_property(node, prop) in delete_node()
318 delete_labels(&node->labels); in delete_node()
321 void append_to_property(struct node *node, in append_to_property() argument
327 p = get_property(node, name); in append_to_property()
329 d = data_append_data(p->val, data, len); in append_to_property()
330 p->val = d; in append_to_property()
334 add_property(node, p); in append_to_property()
344 new->address = address; in build_reserve_entry()
345 new->size = size; in build_reserve_entry()
353 assert(first->next == NULL); in chain_reserve_entry()
355 first->next = list; in chain_reserve_entry()
364 new->next = NULL; in add_reserve_entry()
369 for (last = list; last->next; last = last->next) in add_reserve_entry()
372 last->next = new; in add_reserve_entry()
379 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info()
384 dti->dtsflags = dtsflags; in build_dt_info()
385 dti->reservelist = reservelist; in build_dt_info()
386 dti->dt = tree; in build_dt_info()
387 dti->boot_cpuid_phys = boot_cpuid_phys; in build_dt_info()
396 const char *get_unitname(struct node *node) in get_unitname() argument
398 if (node->name[node->basenamelen] == '\0') in get_unitname()
401 return node->name + node->basenamelen + 1; in get_unitname()
404 struct property *get_property(struct node *node, const char *propname) in get_property() argument
408 for_each_property(node, prop) in get_property()
409 if (streq(prop->name, propname)) in get_property()
417 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
418 return fdt32_to_cpu(*((fdt32_t *)prop->val.val)); in propval_cell()
423 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
424 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n)); in propval_cell_n()
427 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label()
428 struct node **node) in get_property_by_label() argument
431 struct node *c; in get_property_by_label()
433 *node = tree; in get_property_by_label()
438 for_each_label(prop->labels, l) in get_property_by_label()
439 if (streq(l->label, label)) in get_property_by_label()
444 prop = get_property_by_label(c, label, node); in get_property_by_label()
449 *node = NULL; in get_property_by_label()
453 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label()
454 struct node **node, struct property **prop) in get_marker_label() argument
458 struct node *c; in get_marker_label()
460 *node = tree; in get_marker_label()
464 m = p->val.markers; in get_marker_label()
466 if (streq(m->ref, label)) in get_marker_label()
471 m = get_marker_label(c, label, node, prop); in get_marker_label()
477 *node = NULL; in get_marker_label()
481 struct node *get_subnode(struct node *node, const char *nodename) in get_subnode() argument
483 struct node *child; in get_subnode() local
485 for_each_child(node, child) in get_subnode()
486 if (streq(child->name, nodename)) in get_subnode()
487 return child; in get_subnode()
492 struct node *get_node_by_path(struct node *tree, const char *path) in get_node_by_path()
495 struct node *child; in get_node_by_path() local
498 if (tree->deleted) in get_node_by_path()
508 for_each_child(tree, child) { in get_node_by_path()
509 if (p && (strlen(child->name) == p-path) && in get_node_by_path()
510 strneq(path, child->name, p-path)) in get_node_by_path()
511 return get_node_by_path(child, p+1); in get_node_by_path()
512 else if (!p && streq(path, child->name)) in get_node_by_path()
513 return child; in get_node_by_path()
519 struct node *get_node_by_label(struct node *tree, const char *label) in get_node_by_label()
521 struct node *child, *node; in get_node_by_label() local
526 for_each_label(tree->labels, l) in get_node_by_label()
527 if (streq(l->label, label)) in get_node_by_label()
530 for_each_child(tree, child) { in get_node_by_label()
531 node = get_node_by_label(child, label); in get_node_by_label()
532 if (node) in get_node_by_label()
533 return node; in get_node_by_label()
539 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
541 struct node *child, *node; in get_node_by_phandle() local
543 assert((phandle != 0) && (phandle != -1)); in get_node_by_phandle()
545 if (tree->phandle == phandle) { in get_node_by_phandle()
546 if (tree->deleted) in get_node_by_phandle()
551 for_each_child(tree, child) { in get_node_by_phandle()
552 node = get_node_by_phandle(child, phandle); in get_node_by_phandle()
553 if (node) in get_node_by_phandle()
554 return node; in get_node_by_phandle()
560 struct node *get_node_by_ref(struct node *tree, const char *ref) in get_node_by_ref()
570 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle() argument
574 if ((node->phandle != 0) && (node->phandle != -1)) in get_node_phandle()
575 return node->phandle; in get_node_phandle()
580 node->phandle = phandle; in get_node_phandle()
582 if (!get_property(node, "linux,phandle") in get_node_phandle()
584 add_property(node, in get_node_phandle()
588 if (!get_property(node, "phandle") in get_node_phandle()
590 add_property(node, in get_node_phandle()
594 /* If the node *does* have a phandle property, we must in get_node_phandle()
595 * be dealing with a self-referencing phandle, which will be in get_node_phandle()
598 return node->phandle; in get_node_phandle()
601 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
603 struct node *cpus, *bootcpu; in guess_boot_cpuid()
611 bootcpu = cpus->children; in guess_boot_cpuid()
616 if (!reg || (reg->val.len != sizeof(uint32_t))) in guess_boot_cpuid()
619 /* FIXME: Sanity check node? */ in guess_boot_cpuid()
631 if (a->address < b->address) in cmp_reserve_info()
632 return -1; in cmp_reserve_info()
633 else if (a->address > b->address) in cmp_reserve_info()
635 else if (a->size < b->size) in cmp_reserve_info()
636 return -1; in cmp_reserve_info()
637 else if (a->size > b->size) in cmp_reserve_info()
648 for (ri = dti->reservelist; in sort_reserve_entries()
650 ri = ri->next) in sort_reserve_entries()
658 for (ri = dti->reservelist; in sort_reserve_entries()
660 ri = ri->next) in sort_reserve_entries()
665 dti->reservelist = tbl[0]; in sort_reserve_entries()
666 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
667 tbl[i]->next = tbl[i+1]; in sort_reserve_entries()
668 tbl[n-1]->next = NULL; in sort_reserve_entries()
680 return strcmp(a->name, b->name); in cmp_prop()
683 static void sort_properties(struct node *node) in sort_properties() argument
688 for_each_property_withdel(node, prop) in sort_properties()
696 for_each_property_withdel(node, prop) in sort_properties()
701 node->proplist = tbl[0]; in sort_properties()
702 for (i = 0; i < (n-1); i++) in sort_properties()
703 tbl[i]->next = tbl[i+1]; in sort_properties()
704 tbl[n-1]->next = NULL; in sort_properties()
711 const struct node *a, *b; in cmp_subnode()
713 a = *((const struct node * const *)ax); in cmp_subnode()
714 b = *((const struct node * const *)bx); in cmp_subnode()
716 return strcmp(a->name, b->name); in cmp_subnode()
719 static void sort_subnodes(struct node *node) in sort_subnodes() argument
722 struct node *subnode, **tbl; in sort_subnodes()
724 for_each_child_withdel(node, subnode) in sort_subnodes()
732 for_each_child_withdel(node, subnode) in sort_subnodes()
737 node->children = tbl[0]; in sort_subnodes()
738 for (i = 0; i < (n-1); i++) in sort_subnodes()
739 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
740 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
745 static void sort_node(struct node *node) in sort_node() argument
747 struct node *c; in sort_node()
749 sort_properties(node); in sort_node()
750 sort_subnodes(node); in sort_node()
751 for_each_child_withdel(node, c) in sort_node()
758 sort_node(dti->dt); in sort_tree()
762 static struct node *build_and_name_child_node(struct node *parent, char *name) in build_and_name_child_node()
764 struct node *node; in build_and_name_child_node() local
766 node = build_node(NULL, NULL); in build_and_name_child_node()
767 name_node(node, xstrdup(name)); in build_and_name_child_node()
768 add_child(parent, node); in build_and_name_child_node()
770 return node; in build_and_name_child_node()
773 static struct node *build_root_node(struct node *dt, char *name) in build_root_node()
775 struct node *an; in build_root_node()
782 die("Could not build root node /%s\n", name); in build_root_node()
787 static bool any_label_tree(struct dt_info *dti, struct node *node) in any_label_tree() argument
789 struct node *c; in any_label_tree()
791 if (node->labels) in any_label_tree()
794 for_each_child(node, c) in any_label_tree()
802 struct node *an, struct node *node, in generate_label_tree_internal() argument
805 struct node *dt = dti->dt; in generate_label_tree_internal()
806 struct node *c; in generate_label_tree_internal()
811 if (node->labels) { in generate_label_tree_internal()
813 /* now add the label in the node */ in generate_label_tree_internal()
814 for_each_label(node->labels, l) { in generate_label_tree_internal()
817 p = get_property(an, l->label); in generate_label_tree_internal()
820 " exists in /%s", l->label, in generate_label_tree_internal()
821 an->name); in generate_label_tree_internal()
826 p = build_property(l->label, in generate_label_tree_internal()
827 data_copy_mem(node->fullpath, in generate_label_tree_internal()
828 strlen(node->fullpath) + 1)); in generate_label_tree_internal()
832 /* force allocation of a phandle for this node */ in generate_label_tree_internal()
834 (void)get_node_phandle(dt, node); in generate_label_tree_internal()
837 for_each_child(node, c) in generate_label_tree_internal()
841 static bool any_fixup_tree(struct dt_info *dti, struct node *node) in any_fixup_tree() argument
843 struct node *c; in any_fixup_tree()
847 for_each_property(node, prop) { in any_fixup_tree()
848 m = prop->val.markers; in any_fixup_tree()
850 if (!get_node_by_ref(dti->dt, m->ref)) in any_fixup_tree()
855 for_each_child(node, c) { in any_fixup_tree()
863 static void add_fixup_entry(struct dt_info *dti, struct node *fn, in add_fixup_entry()
864 struct node *node, struct property *prop, in add_fixup_entry() argument
869 /* m->ref can only be a REF_PHANDLE, but check anyway */ in add_fixup_entry()
870 assert(m->type == REF_PHANDLE); in add_fixup_entry()
873 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
877 node->fullpath, prop->name, m->offset); in add_fixup_entry()
878 append_to_property(fn, m->ref, entry, strlen(entry) + 1); in add_fixup_entry()
884 struct node *fn, in generate_fixups_tree_internal()
885 struct node *node) in generate_fixups_tree_internal() argument
887 struct node *dt = dti->dt; in generate_fixups_tree_internal()
888 struct node *c; in generate_fixups_tree_internal()
891 struct node *refnode; in generate_fixups_tree_internal()
893 for_each_property(node, prop) { in generate_fixups_tree_internal()
894 m = prop->val.markers; in generate_fixups_tree_internal()
896 refnode = get_node_by_ref(dt, m->ref); in generate_fixups_tree_internal()
898 add_fixup_entry(dti, fn, node, prop, m); in generate_fixups_tree_internal()
902 for_each_child(node, c) in generate_fixups_tree_internal()
906 static bool any_local_fixup_tree(struct dt_info *dti, struct node *node) in any_local_fixup_tree() argument
908 struct node *c; in any_local_fixup_tree()
912 for_each_property(node, prop) { in any_local_fixup_tree()
913 m = prop->val.markers; in any_local_fixup_tree()
915 if (get_node_by_ref(dti->dt, m->ref)) in any_local_fixup_tree()
920 for_each_child(node, c) { in any_local_fixup_tree()
929 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
931 struct node *refnode) in add_local_fixup_entry()
933 struct node *wn, *nwn; /* local fixup node, walk node, new */ in add_local_fixup_entry()
940 for (wn = node; wn; wn = wn->parent) in add_local_fixup_entry()
947 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--) in add_local_fixup_entry()
948 compp[i] = wn->name; in add_local_fixup_entry()
952 /* if no node exists, create it */ in add_local_fixup_entry()
960 value_32 = cpu_to_fdt32(m->offset); in add_local_fixup_entry()
961 append_to_property(wn, prop->name, &value_32, sizeof(value_32)); in add_local_fixup_entry()
965 struct node *lfn, in generate_local_fixups_tree_internal()
966 struct node *node) in generate_local_fixups_tree_internal() argument
968 struct node *dt = dti->dt; in generate_local_fixups_tree_internal()
969 struct node *c; in generate_local_fixups_tree_internal()
972 struct node *refnode; in generate_local_fixups_tree_internal()
974 for_each_property(node, prop) { in generate_local_fixups_tree_internal()
975 m = prop->val.markers; in generate_local_fixups_tree_internal()
977 refnode = get_node_by_ref(dt, m->ref); in generate_local_fixups_tree_internal()
979 add_local_fixup_entry(dti, lfn, node, prop, m, refnode); in generate_local_fixups_tree_internal()
983 for_each_child(node, c) in generate_local_fixups_tree_internal()
989 if (!any_label_tree(dti, dti->dt)) in generate_label_tree()
991 generate_label_tree_internal(dti, build_root_node(dti->dt, name), in generate_label_tree()
992 dti->dt, allocph); in generate_label_tree()
997 if (!any_fixup_tree(dti, dti->dt)) in generate_fixups_tree()
999 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_fixups_tree()
1000 dti->dt); in generate_fixups_tree()
1005 if (!any_local_fixup_tree(dti, dti->dt)) in generate_local_fixups_tree()
1007 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_local_fixups_tree()
1008 dti->dt); in generate_local_fixups_tree()