Lines Matching +full:dt +full:- +full:node
1 // SPDX-License-Identifier: GPL-2.0-or-later
19 if (streq(new->label, label)) { in add_label()
20 new->deleted = 0; in add_label()
26 new->label = label; in add_label()
27 new->next = *labels; in add_label()
36 label->deleted = 1; in delete_labels()
46 new->name = xstrdup(name); in build_property()
47 new->val = val; in build_property()
48 new->srcpos = srcpos_copy(srcpos); in build_property()
59 new->name = xstrdup(name); in build_property_delete()
60 new->deleted = 1; in build_property_delete()
67 assert(first->next == NULL); in chain_property()
69 first->next = list; in chain_property()
80 next = p->next; in reverse_properties()
81 p->next = head; in reverse_properties()
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()
96 new->proplist = reverse_properties(proplist); in build_node()
97 new->children = children; in build_node()
98 new->srcpos = srcpos_copy(srcpos); in build_node()
101 child->parent = new; 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()
113 new->deleted = 1; in build_node_delete()
114 new->srcpos = srcpos_copy(srcpos); in build_node_delete()
119 struct node *name_node(struct node *node, const char *name) in name_node() argument
121 assert(node->name == NULL); in name_node()
123 node->name = xstrdup(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()
148 old_node->deleted = 0; in merge_nodes()
150 /* Add new node labels to old node */ in merge_nodes()
151 for_each_label_withdel(new_node->labels, l) in merge_nodes()
152 add_label(&old_node->labels, l->label); in merge_nodes()
154 /* Move properties from the new node to the old node. If there in merge_nodes()
156 while (new_node->proplist) { in merge_nodes()
158 new_prop = new_node->proplist; in merge_nodes()
159 new_node->proplist = new_prop->next; in merge_nodes()
160 new_prop->next = NULL; in merge_nodes()
162 if (new_prop->deleted) { in merge_nodes()
163 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
170 if (streq(old_prop->name, new_prop->name)) { in merge_nodes()
172 for_each_label_withdel(new_prop->labels, l) in merge_nodes()
173 add_label(&old_prop->labels, l->label); in merge_nodes()
175 old_prop->val = new_prop->val; in merge_nodes()
176 old_prop->deleted = 0; in merge_nodes()
177 free(old_prop->srcpos); in merge_nodes()
178 old_prop->srcpos = new_prop->srcpos; 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()
192 while (new_node->children) { in merge_nodes()
193 /* Pop the child node off the list */ in merge_nodes()
194 new_child = new_node->children; in merge_nodes()
195 new_node->children = new_child->next_sibling; in merge_nodes()
196 new_child->parent = NULL; in merge_nodes()
197 new_child->next_sibling = NULL; in merge_nodes()
199 if (new_child->deleted) { in merge_nodes()
200 delete_node_by_name(old_node, new_child->name); in merge_nodes()
207 if (streq(old_child->name, new_child->name)) { in merge_nodes()
214 /* if no collision occurred, add child to the old node. */ in merge_nodes()
219 old_node->srcpos = srcpos_extend(old_node->srcpos, new_node->srcpos); 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() argument
231 struct node *node; in add_orphan_node() local
240 p = build_property("target-path", d, NULL); in add_orphan_node()
251 node = build_node(p, new_node, NULL); in add_orphan_node()
252 name_node(node, name); in add_orphan_node()
255 add_child(dt, node); in add_orphan_node()
256 return dt; in add_orphan_node()
259 struct node *chain_node(struct node *first, struct node *list) in chain_node()
261 assert(first->next_sibling == NULL); in chain_node()
263 first->next_sibling = list; in chain_node()
267 void add_property(struct node *node, struct property *prop) in add_property() argument
271 prop->next = NULL; in add_property()
273 p = &node->proplist; in add_property()
275 p = &((*p)->next); in add_property()
280 void delete_property_by_name(struct node *node, char *name) in delete_property_by_name() argument
282 struct property *prop = node->proplist; in delete_property_by_name()
285 if (streq(prop->name, name)) { in delete_property_by_name()
289 prop = prop->next; in delete_property_by_name()
295 prop->deleted = 1; in delete_property()
296 delete_labels(&prop->labels); in delete_property()
299 void add_child(struct node *parent, struct node *child) in add_child()
301 struct node **p; in add_child()
303 child->next_sibling = NULL; in add_child()
304 child->parent = parent; in add_child()
306 p = &parent->children; in add_child()
308 p = &((*p)->next_sibling); in add_child()
313 void delete_node_by_name(struct node *parent, char *name) in delete_node_by_name()
315 struct node *node = parent->children; in delete_node_by_name() local
317 while (node) { in delete_node_by_name()
318 if (streq(node->name, name)) { in delete_node_by_name()
319 delete_node(node); in delete_node_by_name()
322 node = node->next_sibling; in delete_node_by_name()
326 void delete_node(struct node *node) in delete_node() argument
329 struct node *child; in delete_node()
331 node->deleted = 1; in delete_node()
332 for_each_child(node, child) in delete_node()
334 for_each_property(node, prop) in delete_node()
336 delete_labels(&node->labels); in delete_node()
339 void append_to_property(struct node *node, in append_to_property() argument
346 p = get_property(node, name); in append_to_property()
348 d = data_add_marker(p->val, type, name); in append_to_property()
350 p->val = d; in append_to_property()
355 add_property(node, p); in append_to_property()
365 new->address = address; in build_reserve_entry()
366 new->size = size; in build_reserve_entry()
374 assert(first->next == NULL); in chain_reserve_entry()
376 first->next = list; in chain_reserve_entry()
385 new->next = NULL; in add_reserve_entry()
390 for (last = list; last->next; last = last->next) in add_reserve_entry()
393 last->next = new; in add_reserve_entry()
400 struct node *tree, uint32_t boot_cpuid_phys) in build_dt_info()
405 dti->dtsflags = dtsflags; in build_dt_info()
406 dti->reservelist = reservelist; in build_dt_info()
407 dti->dt = tree; in build_dt_info()
408 dti->boot_cpuid_phys = boot_cpuid_phys; in build_dt_info()
417 const char *get_unitname(struct node *node) in get_unitname() argument
419 if (node->name[node->basenamelen] == '\0') in get_unitname()
422 return node->name + node->basenamelen + 1; in get_unitname()
425 struct property *get_property(struct node *node, const char *propname) in get_property() argument
429 for_each_property(node, prop) in get_property()
430 if (streq(prop->name, propname)) in get_property()
438 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
439 return fdt32_to_cpu(*((fdt32_t *)prop->val.val)); in propval_cell()
444 assert(prop->val.len / sizeof(cell_t) > n); in propval_cell_n()
445 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n)); in propval_cell_n()
448 struct property *get_property_by_label(struct node *tree, const char *label, in get_property_by_label()
449 struct node **node) in get_property_by_label() argument
452 struct node *c; in get_property_by_label()
454 *node = tree; in get_property_by_label()
459 for_each_label(prop->labels, l) in get_property_by_label()
460 if (streq(l->label, label)) in get_property_by_label()
465 prop = get_property_by_label(c, label, node); in get_property_by_label()
470 *node = NULL; in get_property_by_label()
474 struct marker *get_marker_label(struct node *tree, const char *label, in get_marker_label()
475 struct node **node, struct property **prop) in get_marker_label() argument
479 struct node *c; in get_marker_label()
481 *node = tree; in get_marker_label()
485 m = p->val.markers; in get_marker_label()
487 if (streq(m->ref, label)) in get_marker_label()
492 m = get_marker_label(c, label, node, prop); in get_marker_label()
498 *node = NULL; in get_marker_label()
502 struct node *get_subnode(struct node *node, const char *nodename) in get_subnode() argument
504 struct node *child; in get_subnode()
506 for_each_child(node, child) in get_subnode()
507 if (streq(child->name, nodename)) in get_subnode()
513 struct node *get_node_by_path(struct node *tree, const char *path) in get_node_by_path()
516 struct node *child; in get_node_by_path()
519 if (tree->deleted) in get_node_by_path()
530 if (p && strprefixeq(path, (size_t)(p - path), child->name)) in get_node_by_path()
532 else if (!p && streq(path, child->name)) in get_node_by_path()
539 struct node *get_node_by_label(struct node *tree, const char *label) in get_node_by_label()
541 struct node *child, *node; in get_node_by_label() local
546 for_each_label(tree->labels, l) in get_node_by_label()
547 if (streq(l->label, label)) in get_node_by_label()
551 node = get_node_by_label(child, label); in get_node_by_label()
552 if (node) in get_node_by_label()
553 return node; in get_node_by_label()
559 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
561 struct node *child, *node; in get_node_by_phandle() local
568 if (tree->phandle == phandle) { in get_node_by_phandle()
569 if (tree->deleted) in get_node_by_phandle()
575 node = get_node_by_phandle(child, phandle); in get_node_by_phandle()
576 if (node) in get_node_by_phandle()
577 return node; in get_node_by_phandle()
583 struct node *get_node_by_ref(struct node *tree, const char *ref) in get_node_by_ref()
585 struct node *target = tree; in get_node_by_ref()
601 buf = xstrndup(label, slash - label); in get_node_by_ref()
620 static void add_phandle_property(struct node *node, in add_phandle_property() argument
627 if (get_property(node, name)) in add_phandle_property()
631 d = data_append_cell(d, node->phandle); in add_phandle_property()
633 add_property(node, build_property(name, d, NULL)); in add_phandle_property()
636 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle() argument
640 if (phandle_is_valid(node->phandle)) in get_node_phandle()
641 return node->phandle; in get_node_phandle()
646 node->phandle = phandle; in get_node_phandle()
648 add_phandle_property(node, "linux,phandle", PHANDLE_LEGACY); in get_node_phandle()
649 add_phandle_property(node, "phandle", PHANDLE_EPAPR); in get_node_phandle()
651 /* If the node *does* have a phandle property, we must in get_node_phandle()
652 * be dealing with a self-referencing phandle, which will be in get_node_phandle()
655 return node->phandle; in get_node_phandle()
658 uint32_t guess_boot_cpuid(struct node *tree) in guess_boot_cpuid()
660 struct node *cpus, *bootcpu; in guess_boot_cpuid()
668 bootcpu = cpus->children; in guess_boot_cpuid()
673 if (!reg || (reg->val.len != sizeof(uint32_t))) in guess_boot_cpuid()
676 /* FIXME: Sanity check node? */ in guess_boot_cpuid()
688 if (a->address < b->address) in cmp_reserve_info()
689 return -1; in cmp_reserve_info()
690 else if (a->address > b->address) in cmp_reserve_info()
692 else if (a->size < b->size) in cmp_reserve_info()
693 return -1; in cmp_reserve_info()
694 else if (a->size > b->size) in cmp_reserve_info()
705 for (ri = dti->reservelist; in sort_reserve_entries()
707 ri = ri->next) in sort_reserve_entries()
715 for (ri = dti->reservelist; in sort_reserve_entries()
717 ri = ri->next) in sort_reserve_entries()
722 dti->reservelist = tbl[0]; in sort_reserve_entries()
723 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
724 tbl[i]->next = tbl[i+1]; in sort_reserve_entries()
725 tbl[n-1]->next = NULL; in sort_reserve_entries()
737 return strcmp(a->name, b->name); in cmp_prop()
740 static void sort_properties(struct node *node) in sort_properties() argument
745 for_each_property_withdel(node, prop) in sort_properties()
753 for_each_property_withdel(node, prop) in sort_properties()
758 node->proplist = tbl[0]; in sort_properties()
759 for (i = 0; i < (n-1); i++) in sort_properties()
760 tbl[i]->next = tbl[i+1]; in sort_properties()
761 tbl[n-1]->next = NULL; in sort_properties()
768 const struct node *a, *b; in cmp_subnode()
770 a = *((const struct node * const *)ax); in cmp_subnode()
771 b = *((const struct node * const *)bx); in cmp_subnode()
773 return strcmp(a->name, b->name); in cmp_subnode()
776 static void sort_subnodes(struct node *node) in sort_subnodes() argument
779 struct node *subnode, **tbl; in sort_subnodes()
781 for_each_child_withdel(node, subnode) in sort_subnodes()
789 for_each_child_withdel(node, subnode) in sort_subnodes()
794 node->children = tbl[0]; in sort_subnodes()
795 for (i = 0; i < (n-1); i++) in sort_subnodes()
796 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
797 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
802 static void sort_node(struct node *node) in sort_node() argument
804 struct node *c; in sort_node()
806 sort_properties(node); in sort_node()
807 sort_subnodes(node); in sort_node()
808 for_each_child_withdel(node, c) in sort_node()
815 sort_node(dti->dt); in sort_tree()
819 static struct node *build_and_name_child_node(struct node *parent, const char *name) in build_and_name_child_node()
821 struct node *node; in build_and_name_child_node() local
823 node = build_node(NULL, NULL, NULL); in build_and_name_child_node()
824 name_node(node, name); in build_and_name_child_node()
825 add_child(parent, node); in build_and_name_child_node()
827 return node; in build_and_name_child_node()
830 static struct node *build_root_node(struct node *dt, const char *name) in build_root_node() argument
832 struct node *an; in build_root_node()
834 an = get_subnode(dt, name); in build_root_node()
836 an = build_and_name_child_node(dt, name); in build_root_node()
839 die("Could not build root node /%s\n", name); in build_root_node()
844 static bool any_label_tree(struct dt_info *dti, struct node *node) in any_label_tree() argument
846 struct node *c; in any_label_tree()
848 if (node->labels) in any_label_tree()
851 for_each_child(node, c) in any_label_tree()
859 struct node *an, struct node *node, in generate_label_tree_internal() argument
862 struct node *dt = dti->dt; in generate_label_tree_internal() local
863 struct node *c; in generate_label_tree_internal()
868 if (node->labels) { in generate_label_tree_internal()
870 /* now add the label in the node */ in generate_label_tree_internal()
871 for_each_label(node->labels, l) { in generate_label_tree_internal()
874 p = get_property(an, l->label); in generate_label_tree_internal()
877 " exists in /%s", l->label, in generate_label_tree_internal()
878 an->name); in generate_label_tree_internal()
883 p = build_property(l->label, in generate_label_tree_internal()
884 data_copy_escape_string(node->fullpath, in generate_label_tree_internal()
885 strlen(node->fullpath)), in generate_label_tree_internal()
890 /* force allocation of a phandle for this node */ in generate_label_tree_internal()
892 (void)get_node_phandle(dt, node); in generate_label_tree_internal()
895 for_each_child(node, c) in generate_label_tree_internal()
899 static bool any_fixup_tree(struct dt_info *dti, struct node *node) in any_fixup_tree() argument
901 struct node *c; in any_fixup_tree()
905 for_each_property(node, prop) { in any_fixup_tree()
906 m = prop->val.markers; in any_fixup_tree()
908 if (!get_node_by_ref(dti->dt, m->ref)) in any_fixup_tree()
913 for_each_child(node, c) { in any_fixup_tree()
921 static void add_fixup_entry(struct dt_info *dti, struct node *fn, in add_fixup_entry()
922 struct node *node, struct property *prop, in add_fixup_entry() argument
927 /* m->ref can only be a REF_PHANDLE, but check anyway */ in add_fixup_entry()
928 assert(m->type == REF_PHANDLE); in add_fixup_entry()
932 if (strchr(m->ref, '/')) in add_fixup_entry()
934 m->ref); in add_fixup_entry()
937 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
941 node->fullpath, prop->name, m->offset); in add_fixup_entry()
942 append_to_property(fn, m->ref, entry, strlen(entry) + 1, TYPE_STRING); in add_fixup_entry()
948 struct node *fn, in generate_fixups_tree_internal()
949 struct node *node) in generate_fixups_tree_internal() argument
951 struct node *dt = dti->dt; in generate_fixups_tree_internal() local
952 struct node *c; in generate_fixups_tree_internal()
955 struct node *refnode; in generate_fixups_tree_internal()
957 for_each_property(node, prop) { in generate_fixups_tree_internal()
958 m = prop->val.markers; in generate_fixups_tree_internal()
960 refnode = get_node_by_ref(dt, m->ref); in generate_fixups_tree_internal()
962 add_fixup_entry(dti, fn, node, prop, m); in generate_fixups_tree_internal()
966 for_each_child(node, c) in generate_fixups_tree_internal()
970 static bool any_local_fixup_tree(struct dt_info *dti, struct node *node) in any_local_fixup_tree() argument
972 struct node *c; in any_local_fixup_tree()
976 for_each_property(node, prop) { in any_local_fixup_tree()
977 m = prop->val.markers; in any_local_fixup_tree()
979 if (get_node_by_ref(dti->dt, m->ref)) in any_local_fixup_tree()
984 for_each_child(node, c) { in any_local_fixup_tree()
993 struct node *lfn, struct node *node, in add_local_fixup_entry() argument
995 struct node *refnode) in add_local_fixup_entry()
997 struct node *wn, *nwn; /* local fixup node, walk node, new */ in add_local_fixup_entry()
1004 for (wn = node; wn; wn = wn->parent) in add_local_fixup_entry()
1011 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--) in add_local_fixup_entry()
1012 compp[i] = wn->name; in add_local_fixup_entry()
1016 /* if no node exists, create it */ in add_local_fixup_entry()
1024 value_32 = cpu_to_fdt32(m->offset); in add_local_fixup_entry()
1025 append_to_property(wn, prop->name, &value_32, sizeof(value_32), TYPE_UINT32); in add_local_fixup_entry()
1029 struct node *lfn, in generate_local_fixups_tree_internal()
1030 struct node *node) in generate_local_fixups_tree_internal() argument
1032 struct node *dt = dti->dt; in generate_local_fixups_tree_internal() local
1033 struct node *c; in generate_local_fixups_tree_internal()
1036 struct node *refnode; in generate_local_fixups_tree_internal()
1038 for_each_property(node, prop) { in generate_local_fixups_tree_internal()
1039 m = prop->val.markers; in generate_local_fixups_tree_internal()
1041 refnode = get_node_by_ref(dt, m->ref); in generate_local_fixups_tree_internal()
1043 add_local_fixup_entry(dti, lfn, node, prop, m, refnode); in generate_local_fixups_tree_internal()
1047 for_each_child(node, c) in generate_local_fixups_tree_internal()
1053 if (!any_label_tree(dti, dti->dt)) in generate_label_tree()
1055 generate_label_tree_internal(dti, build_root_node(dti->dt, name), in generate_label_tree()
1056 dti->dt, allocph); in generate_label_tree()
1061 if (!any_fixup_tree(dti, dti->dt)) in generate_fixups_tree()
1063 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_fixups_tree()
1064 dti->dt); in generate_fixups_tree()
1069 if (!any_local_fixup_tree(dti, dti->dt)) in generate_local_fixups_tree()
1071 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_local_fixups_tree()
1072 dti->dt); in generate_local_fixups_tree()