2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation; either version 2 of the
8 * License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
24 * Tree building functions
27 void add_label(struct label **labels, char *label)
31 /* Make sure the label isn't already there */
32 for_each_label_withdel(*labels, new)
33 if (streq(new->label, label)) {
38 new = xmalloc(sizeof(*new));
39 memset(new, 0, sizeof(*new));
45 void delete_labels(struct label **labels)
49 for_each_label(*labels, label)
53 struct property *build_property(char *name, struct data val)
55 struct property *new = xmalloc(sizeof(*new));
57 memset(new, 0, sizeof(*new));
65 struct property *build_property_delete(char *name)
67 struct property *new = xmalloc(sizeof(*new));
69 memset(new, 0, sizeof(*new));
77 struct property *chain_property(struct property *first, struct property *list)
79 assert(first->next == NULL);
85 struct property *reverse_properties(struct property *first)
87 struct property *p = first;
88 struct property *head = NULL;
89 struct property *next;
100 struct node *build_node(struct property *proplist, struct node *children)
102 struct node *new = xmalloc(sizeof(*new));
105 memset(new, 0, sizeof(*new));
107 new->proplist = reverse_properties(proplist);
108 new->children = children;
110 for_each_child(new, child) {
117 struct node *build_node_delete(void)
119 struct node *new = xmalloc(sizeof(*new));
121 memset(new, 0, sizeof(*new));
128 struct node *name_node(struct node *node, char *name)
130 assert(node->name == NULL);
137 struct node *merge_nodes(struct node *old_node, struct node *new_node)
139 struct property *new_prop, *old_prop;
140 struct node *new_child, *old_child;
143 old_node->deleted = 0;
145 /* Add new node labels to old node */
146 for_each_label_withdel(new_node->labels, l)
147 add_label(&old_node->labels, l->label);
149 /* Move properties from the new node to the old node. If there
150 * is a collision, replace the old value with the new */
151 while (new_node->proplist) {
152 /* Pop the property off the list */
153 new_prop = new_node->proplist;
154 new_node->proplist = new_prop->next;
155 new_prop->next = NULL;
157 if (new_prop->deleted) {
158 delete_property_by_name(old_node, new_prop->name);
163 /* Look for a collision, set new value if there is */
164 for_each_property_withdel(old_node, old_prop) {
165 if (streq(old_prop->name, new_prop->name)) {
166 /* Add new labels to old property */
167 for_each_label_withdel(new_prop->labels, l)
168 add_label(&old_prop->labels, l->label);
170 old_prop->val = new_prop->val;
171 old_prop->deleted = 0;
178 /* if no collision occurred, add property to the old node. */
180 add_property(old_node, new_prop);
183 /* Move the override child nodes into the primary node. If
184 * there is a collision, then merge the nodes. */
185 while (new_node->children) {
186 /* Pop the child node off the list */
187 new_child = new_node->children;
188 new_node->children = new_child->next_sibling;
189 new_child->parent = NULL;
190 new_child->next_sibling = NULL;
192 if (new_child->deleted) {
193 delete_node_by_name(old_node, new_child->name);
198 /* Search for a collision. Merge if there is */
199 for_each_child_withdel(old_node, old_child) {
200 if (streq(old_child->name, new_child->name)) {
201 merge_nodes(old_child, new_child);
207 /* if no collision occurred, add child to the old node. */
209 add_child(old_node, new_child);
212 /* The new node contents are now merged into the old node. Free
219 void add_orphan_node(struct node *dt, struct node *new_node, char *ref)
221 static unsigned int next_orphan_fragment = 0;
224 struct data d = empty_data;
227 d = data_add_marker(d, REF_PHANDLE, ref);
228 d = data_append_integer(d, 0xffffffff, 32);
230 p = build_property("target", d);
232 xasprintf(&name, "fragment@%u",
233 next_orphan_fragment++);
234 name_node(new_node, "__overlay__");
235 node = build_node(p, new_node);
236 name_node(node, name);
241 struct node *chain_node(struct node *first, struct node *list)
243 assert(first->next_sibling == NULL);
245 first->next_sibling = list;
249 void add_property(struct node *node, struct property *prop)
262 void delete_property_by_name(struct node *node, char *name)
264 struct property *prop = node->proplist;
267 if (streq(prop->name, name)) {
268 delete_property(prop);
275 void delete_property(struct property *prop)
278 delete_labels(&prop->labels);
281 void add_child(struct node *parent, struct node *child)
285 child->next_sibling = NULL;
286 child->parent = parent;
288 p = &parent->children;
290 p = &((*p)->next_sibling);
295 void delete_node_by_name(struct node *parent, char *name)
297 struct node *node = parent->children;
300 if (streq(node->name, name)) {
304 node = node->next_sibling;
308 void delete_node(struct node *node)
310 struct property *prop;
314 for_each_child(node, child)
316 for_each_property(node, prop)
317 delete_property(prop);
318 delete_labels(&node->labels);
321 void append_to_property(struct node *node,
322 char *name, const void *data, int len)
327 p = get_property(node, name);
329 d = data_append_data(p->val, data, len);
332 d = data_append_data(empty_data, data, len);
333 p = build_property(name, d);
334 add_property(node, p);
338 struct reserve_info *build_reserve_entry(uint64_t address, uint64_t size)
340 struct reserve_info *new = xmalloc(sizeof(*new));
342 memset(new, 0, sizeof(*new));
344 new->address = address;
350 struct reserve_info *chain_reserve_entry(struct reserve_info *first,
351 struct reserve_info *list)
353 assert(first->next == NULL);
359 struct reserve_info *add_reserve_entry(struct reserve_info *list,
360 struct reserve_info *new)
362 struct reserve_info *last;
369 for (last = list; last->next; last = last->next)
377 struct dt_info *build_dt_info(unsigned int dtsflags,
378 struct reserve_info *reservelist,
379 struct node *tree, uint32_t boot_cpuid_phys)
383 dti = xmalloc(sizeof(*dti));
384 dti->dtsflags = dtsflags;
385 dti->reservelist = reservelist;
387 dti->boot_cpuid_phys = boot_cpuid_phys;
393 * Tree accessor functions
396 const char *get_unitname(struct node *node)
398 if (node->name[node->basenamelen] == '\0')
401 return node->name + node->basenamelen + 1;
404 struct property *get_property(struct node *node, const char *propname)
406 struct property *prop;
408 for_each_property(node, prop)
409 if (streq(prop->name, propname))
415 cell_t propval_cell(struct property *prop)
417 assert(prop->val.len == sizeof(cell_t));
418 return fdt32_to_cpu(*((fdt32_t *)prop->val.val));
421 cell_t propval_cell_n(struct property *prop, int n)
423 assert(prop->val.len / sizeof(cell_t) >= n);
424 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n));
427 struct property *get_property_by_label(struct node *tree, const char *label,
430 struct property *prop;
435 for_each_property(tree, prop) {
438 for_each_label(prop->labels, l)
439 if (streq(l->label, label))
443 for_each_child(tree, c) {
444 prop = get_property_by_label(c, label, node);
453 struct marker *get_marker_label(struct node *tree, const char *label,
454 struct node **node, struct property **prop)
462 for_each_property(tree, p) {
465 for_each_marker_of_type(m, LABEL)
466 if (streq(m->ref, label))
470 for_each_child(tree, c) {
471 m = get_marker_label(c, label, node, prop);
481 struct node *get_subnode(struct node *node, const char *nodename)
485 for_each_child(node, child)
486 if (streq(child->name, nodename))
492 struct node *get_node_by_path(struct node *tree, const char *path)
497 if (!path || ! (*path)) {
503 while (path[0] == '/')
506 p = strchr(path, '/');
508 for_each_child(tree, child) {
509 if (p && (strlen(child->name) == p-path) &&
510 strneq(path, child->name, p-path))
511 return get_node_by_path(child, p+1);
512 else if (!p && streq(path, child->name))
519 struct node *get_node_by_label(struct node *tree, const char *label)
521 struct node *child, *node;
524 assert(label && (strlen(label) > 0));
526 for_each_label(tree->labels, l)
527 if (streq(l->label, label))
530 for_each_child(tree, child) {
531 node = get_node_by_label(child, label);
539 struct node *get_node_by_phandle(struct node *tree, cell_t phandle)
541 struct node *child, *node;
543 assert((phandle != 0) && (phandle != -1));
545 if (tree->phandle == phandle) {
551 for_each_child(tree, child) {
552 node = get_node_by_phandle(child, phandle);
560 struct node *get_node_by_ref(struct node *tree, const char *ref)
564 else if (ref[0] == '/')
565 return get_node_by_path(tree, ref);
567 return get_node_by_label(tree, ref);
570 cell_t get_node_phandle(struct node *root, struct node *node)
572 static cell_t phandle = 1; /* FIXME: ick, static local */
574 if ((node->phandle != 0) && (node->phandle != -1))
575 return node->phandle;
577 while (get_node_by_phandle(root, phandle))
580 node->phandle = phandle;
582 if (!get_property(node, "linux,phandle")
583 && (phandle_format & PHANDLE_LEGACY))
585 build_property("linux,phandle",
586 data_append_cell(empty_data, phandle)));
588 if (!get_property(node, "phandle")
589 && (phandle_format & PHANDLE_EPAPR))
591 build_property("phandle",
592 data_append_cell(empty_data, phandle)));
594 /* If the node *does* have a phandle property, we must
595 * be dealing with a self-referencing phandle, which will be
596 * fixed up momentarily in the caller */
598 return node->phandle;
601 uint32_t guess_boot_cpuid(struct node *tree)
603 struct node *cpus, *bootcpu;
604 struct property *reg;
606 cpus = get_node_by_path(tree, "/cpus");
611 bootcpu = cpus->children;
615 reg = get_property(bootcpu, "reg");
616 if (!reg || (reg->val.len != sizeof(uint32_t)))
619 /* FIXME: Sanity check node? */
621 return propval_cell(reg);
624 static int cmp_reserve_info(const void *ax, const void *bx)
626 const struct reserve_info *a, *b;
628 a = *((const struct reserve_info * const *)ax);
629 b = *((const struct reserve_info * const *)bx);
631 if (a->address < b->address)
633 else if (a->address > b->address)
635 else if (a->size < b->size)
637 else if (a->size > b->size)
643 static void sort_reserve_entries(struct dt_info *dti)
645 struct reserve_info *ri, **tbl;
648 for (ri = dti->reservelist;
656 tbl = xmalloc(n * sizeof(*tbl));
658 for (ri = dti->reservelist;
663 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);
665 dti->reservelist = tbl[0];
666 for (i = 0; i < (n-1); i++)
667 tbl[i]->next = tbl[i+1];
668 tbl[n-1]->next = NULL;
673 static int cmp_prop(const void *ax, const void *bx)
675 const struct property *a, *b;
677 a = *((const struct property * const *)ax);
678 b = *((const struct property * const *)bx);
680 return strcmp(a->name, b->name);
683 static void sort_properties(struct node *node)
686 struct property *prop, **tbl;
688 for_each_property_withdel(node, prop)
694 tbl = xmalloc(n * sizeof(*tbl));
696 for_each_property_withdel(node, prop)
699 qsort(tbl, n, sizeof(*tbl), cmp_prop);
701 node->proplist = tbl[0];
702 for (i = 0; i < (n-1); i++)
703 tbl[i]->next = tbl[i+1];
704 tbl[n-1]->next = NULL;
709 static int cmp_subnode(const void *ax, const void *bx)
711 const struct node *a, *b;
713 a = *((const struct node * const *)ax);
714 b = *((const struct node * const *)bx);
716 return strcmp(a->name, b->name);
719 static void sort_subnodes(struct node *node)
722 struct node *subnode, **tbl;
724 for_each_child_withdel(node, subnode)
730 tbl = xmalloc(n * sizeof(*tbl));
732 for_each_child_withdel(node, subnode)
735 qsort(tbl, n, sizeof(*tbl), cmp_subnode);
737 node->children = tbl[0];
738 for (i = 0; i < (n-1); i++)
739 tbl[i]->next_sibling = tbl[i+1];
740 tbl[n-1]->next_sibling = NULL;
745 static void sort_node(struct node *node)
749 sort_properties(node);
751 for_each_child_withdel(node, c)
755 void sort_tree(struct dt_info *dti)
757 sort_reserve_entries(dti);
761 /* utility helper to avoid code duplication */
762 static struct node *build_and_name_child_node(struct node *parent, char *name)
766 node = build_node(NULL, NULL);
767 name_node(node, xstrdup(name));
768 add_child(parent, node);
773 static struct node *build_root_node(struct node *dt, char *name)
777 an = get_subnode(dt, name);
779 an = build_and_name_child_node(dt, name);
782 die("Could not build root node /%s\n", name);
787 static bool any_label_tree(struct dt_info *dti, struct node *node)
794 for_each_child(node, c)
795 if (any_label_tree(dti, c))
801 static void generate_label_tree_internal(struct dt_info *dti,
802 struct node *an, struct node *node,
805 struct node *dt = dti->dt;
810 /* if there are labels */
813 /* now add the label in the node */
814 for_each_label(node->labels, l) {
816 /* check whether the label already exists */
817 p = get_property(an, l->label);
819 fprintf(stderr, "WARNING: label %s already"
820 " exists in /%s", l->label,
826 p = build_property(l->label,
827 data_copy_mem(node->fullpath,
828 strlen(node->fullpath) + 1));
832 /* force allocation of a phandle for this node */
834 (void)get_node_phandle(dt, node);
837 for_each_child(node, c)
838 generate_label_tree_internal(dti, an, c, allocph);
841 static bool any_fixup_tree(struct dt_info *dti, struct node *node)
844 struct property *prop;
847 for_each_property(node, prop) {
848 m = prop->val.markers;
849 for_each_marker_of_type(m, REF_PHANDLE) {
850 if (!get_node_by_ref(dti->dt, m->ref))
855 for_each_child(node, c) {
856 if (any_fixup_tree(dti, c))
863 static void add_fixup_entry(struct dt_info *dti, struct node *fn,
864 struct node *node, struct property *prop,
869 /* m->ref can only be a REF_PHANDLE, but check anyway */
870 assert(m->type == REF_PHANDLE);
872 /* there shouldn't be any ':' in the arguments */
873 if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))
874 die("arguments should not contain ':'\n");
876 xasprintf(&entry, "%s:%s:%u",
877 node->fullpath, prop->name, m->offset);
878 append_to_property(fn, m->ref, entry, strlen(entry) + 1);
883 static void generate_fixups_tree_internal(struct dt_info *dti,
887 struct node *dt = dti->dt;
889 struct property *prop;
891 struct node *refnode;
893 for_each_property(node, prop) {
894 m = prop->val.markers;
895 for_each_marker_of_type(m, REF_PHANDLE) {
896 refnode = get_node_by_ref(dt, m->ref);
898 add_fixup_entry(dti, fn, node, prop, m);
902 for_each_child(node, c)
903 generate_fixups_tree_internal(dti, fn, c);
906 static bool any_local_fixup_tree(struct dt_info *dti, struct node *node)
909 struct property *prop;
912 for_each_property(node, prop) {
913 m = prop->val.markers;
914 for_each_marker_of_type(m, REF_PHANDLE) {
915 if (get_node_by_ref(dti->dt, m->ref))
920 for_each_child(node, c) {
921 if (any_local_fixup_tree(dti, c))
928 static void add_local_fixup_entry(struct dt_info *dti,
929 struct node *lfn, struct node *node,
930 struct property *prop, struct marker *m,
931 struct node *refnode)
933 struct node *wn, *nwn; /* local fixup node, walk node, new */
938 /* walk back retreiving depth */
940 for (wn = node; wn; wn = wn->parent)
943 /* allocate name array */
944 compp = xmalloc(sizeof(*compp) * depth);
946 /* store names in the array */
947 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--)
950 /* walk the path components creating nodes if they don't exist */
951 for (wn = lfn, i = 1; i < depth; i++, wn = nwn) {
952 /* if no node exists, create it */
953 nwn = get_subnode(wn, compp[i]);
955 nwn = build_and_name_child_node(wn, compp[i]);
960 value_32 = cpu_to_fdt32(m->offset);
961 append_to_property(wn, prop->name, &value_32, sizeof(value_32));
964 static void generate_local_fixups_tree_internal(struct dt_info *dti,
968 struct node *dt = dti->dt;
970 struct property *prop;
972 struct node *refnode;
974 for_each_property(node, prop) {
975 m = prop->val.markers;
976 for_each_marker_of_type(m, REF_PHANDLE) {
977 refnode = get_node_by_ref(dt, m->ref);
979 add_local_fixup_entry(dti, lfn, node, prop, m, refnode);
983 for_each_child(node, c)
984 generate_local_fixups_tree_internal(dti, lfn, c);
987 void generate_label_tree(struct dt_info *dti, char *name, bool allocph)
989 if (!any_label_tree(dti, dti->dt))
991 generate_label_tree_internal(dti, build_root_node(dti->dt, name),
995 void generate_fixups_tree(struct dt_info *dti, char *name)
997 if (!any_fixup_tree(dti, dti->dt))
999 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name),
1003 void generate_local_fixups_tree(struct dt_info *dti, char *name)
1005 if (!any_local_fixup_tree(dti, dti->dt))
1007 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name),