Loading...
1/*
2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
3 *
4 *
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.
9 *
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.
14 *
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
18 * USA
19 */
20
21#include "dtc.h"
22
23/*
24 * Tree building functions
25 */
26
27void add_label(struct label **labels, char *label)
28{
29 struct label *new;
30
31 /* Make sure the label isn't already there */
32 for_each_label(*labels, new)
33 if (streq(new->label, label))
34 return;
35
36 new = xmalloc(sizeof(*new));
37 new->label = label;
38 new->next = *labels;
39 *labels = new;
40}
41
42struct property *build_property(char *name, struct data val)
43{
44 struct property *new = xmalloc(sizeof(*new));
45
46 memset(new, 0, sizeof(*new));
47
48 new->name = name;
49 new->val = val;
50
51 return new;
52}
53
54struct property *chain_property(struct property *first, struct property *list)
55{
56 assert(first->next == NULL);
57
58 first->next = list;
59 return first;
60}
61
62struct property *reverse_properties(struct property *first)
63{
64 struct property *p = first;
65 struct property *head = NULL;
66 struct property *next;
67
68 while (p) {
69 next = p->next;
70 p->next = head;
71 head = p;
72 p = next;
73 }
74 return head;
75}
76
77struct node *build_node(struct property *proplist, struct node *children)
78{
79 struct node *new = xmalloc(sizeof(*new));
80 struct node *child;
81
82 memset(new, 0, sizeof(*new));
83
84 new->proplist = reverse_properties(proplist);
85 new->children = children;
86
87 for_each_child(new, child) {
88 child->parent = new;
89 }
90
91 return new;
92}
93
94struct node *name_node(struct node *node, char *name)
95{
96 assert(node->name == NULL);
97
98 node->name = name;
99
100 return node;
101}
102
103struct node *merge_nodes(struct node *old_node, struct node *new_node)
104{
105 struct property *new_prop, *old_prop;
106 struct node *new_child, *old_child;
107 struct label *l;
108
109 /* Add new node labels to old node */
110 for_each_label(new_node->labels, l)
111 add_label(&old_node->labels, l->label);
112
113 /* Move properties from the new node to the old node. If there
114 * is a collision, replace the old value with the new */
115 while (new_node->proplist) {
116 /* Pop the property off the list */
117 new_prop = new_node->proplist;
118 new_node->proplist = new_prop->next;
119 new_prop->next = NULL;
120
121 /* Look for a collision, set new value if there is */
122 for_each_property(old_node, old_prop) {
123 if (streq(old_prop->name, new_prop->name)) {
124 /* Add new labels to old property */
125 for_each_label(new_prop->labels, l)
126 add_label(&old_prop->labels, l->label);
127
128 old_prop->val = new_prop->val;
129 free(new_prop);
130 new_prop = NULL;
131 break;
132 }
133 }
134
135 /* if no collision occurred, add property to the old node. */
136 if (new_prop)
137 add_property(old_node, new_prop);
138 }
139
140 /* Move the override child nodes into the primary node. If
141 * there is a collision, then merge the nodes. */
142 while (new_node->children) {
143 /* Pop the child node off the list */
144 new_child = new_node->children;
145 new_node->children = new_child->next_sibling;
146 new_child->parent = NULL;
147 new_child->next_sibling = NULL;
148
149 /* Search for a collision. Merge if there is */
150 for_each_child(old_node, old_child) {
151 if (streq(old_child->name, new_child->name)) {
152 merge_nodes(old_child, new_child);
153 new_child = NULL;
154 break;
155 }
156 }
157
158 /* if no collision occurred, add child to the old node. */
159 if (new_child)
160 add_child(old_node, new_child);
161 }
162
163 /* The new node contents are now merged into the old node. Free
164 * the new node. */
165 free(new_node);
166
167 return old_node;
168}
169
170struct node *chain_node(struct node *first, struct node *list)
171{
172 assert(first->next_sibling == NULL);
173
174 first->next_sibling = list;
175 return first;
176}
177
178void add_property(struct node *node, struct property *prop)
179{
180 struct property **p;
181
182 prop->next = NULL;
183
184 p = &node->proplist;
185 while (*p)
186 p = &((*p)->next);
187
188 *p = prop;
189}
190
191void add_child(struct node *parent, struct node *child)
192{
193 struct node **p;
194
195 child->next_sibling = NULL;
196 child->parent = parent;
197
198 p = &parent->children;
199 while (*p)
200 p = &((*p)->next_sibling);
201
202 *p = child;
203}
204
205struct reserve_info *build_reserve_entry(uint64_t address, uint64_t size)
206{
207 struct reserve_info *new = xmalloc(sizeof(*new));
208
209 memset(new, 0, sizeof(*new));
210
211 new->re.address = address;
212 new->re.size = size;
213
214 return new;
215}
216
217struct reserve_info *chain_reserve_entry(struct reserve_info *first,
218 struct reserve_info *list)
219{
220 assert(first->next == NULL);
221
222 first->next = list;
223 return first;
224}
225
226struct reserve_info *add_reserve_entry(struct reserve_info *list,
227 struct reserve_info *new)
228{
229 struct reserve_info *last;
230
231 new->next = NULL;
232
233 if (! list)
234 return new;
235
236 for (last = list; last->next; last = last->next)
237 ;
238
239 last->next = new;
240
241 return list;
242}
243
244struct boot_info *build_boot_info(struct reserve_info *reservelist,
245 struct node *tree, uint32_t boot_cpuid_phys)
246{
247 struct boot_info *bi;
248
249 bi = xmalloc(sizeof(*bi));
250 bi->reservelist = reservelist;
251 bi->dt = tree;
252 bi->boot_cpuid_phys = boot_cpuid_phys;
253
254 return bi;
255}
256
257/*
258 * Tree accessor functions
259 */
260
261const char *get_unitname(struct node *node)
262{
263 if (node->name[node->basenamelen] == '\0')
264 return "";
265 else
266 return node->name + node->basenamelen + 1;
267}
268
269struct property *get_property(struct node *node, const char *propname)
270{
271 struct property *prop;
272
273 for_each_property(node, prop)
274 if (streq(prop->name, propname))
275 return prop;
276
277 return NULL;
278}
279
280cell_t propval_cell(struct property *prop)
281{
282 assert(prop->val.len == sizeof(cell_t));
283 return fdt32_to_cpu(*((cell_t *)prop->val.val));
284}
285
286struct property *get_property_by_label(struct node *tree, const char *label,
287 struct node **node)
288{
289 struct property *prop;
290 struct node *c;
291
292 *node = tree;
293
294 for_each_property(tree, prop) {
295 struct label *l;
296
297 for_each_label(prop->labels, l)
298 if (streq(l->label, label))
299 return prop;
300 }
301
302 for_each_child(tree, c) {
303 prop = get_property_by_label(c, label, node);
304 if (prop)
305 return prop;
306 }
307
308 *node = NULL;
309 return NULL;
310}
311
312struct marker *get_marker_label(struct node *tree, const char *label,
313 struct node **node, struct property **prop)
314{
315 struct marker *m;
316 struct property *p;
317 struct node *c;
318
319 *node = tree;
320
321 for_each_property(tree, p) {
322 *prop = p;
323 m = p->val.markers;
324 for_each_marker_of_type(m, LABEL)
325 if (streq(m->ref, label))
326 return m;
327 }
328
329 for_each_child(tree, c) {
330 m = get_marker_label(c, label, node, prop);
331 if (m)
332 return m;
333 }
334
335 *prop = NULL;
336 *node = NULL;
337 return NULL;
338}
339
340struct node *get_subnode(struct node *node, const char *nodename)
341{
342 struct node *child;
343
344 for_each_child(node, child)
345 if (streq(child->name, nodename))
346 return child;
347
348 return NULL;
349}
350
351struct node *get_node_by_path(struct node *tree, const char *path)
352{
353 const char *p;
354 struct node *child;
355
356 if (!path || ! (*path))
357 return tree;
358
359 while (path[0] == '/')
360 path++;
361
362 p = strchr(path, '/');
363
364 for_each_child(tree, child) {
365 if (p && strneq(path, child->name, p-path))
366 return get_node_by_path(child, p+1);
367 else if (!p && streq(path, child->name))
368 return child;
369 }
370
371 return NULL;
372}
373
374struct node *get_node_by_label(struct node *tree, const char *label)
375{
376 struct node *child, *node;
377 struct label *l;
378
379 assert(label && (strlen(label) > 0));
380
381 for_each_label(tree->labels, l)
382 if (streq(l->label, label))
383 return tree;
384
385 for_each_child(tree, child) {
386 node = get_node_by_label(child, label);
387 if (node)
388 return node;
389 }
390
391 return NULL;
392}
393
394struct node *get_node_by_phandle(struct node *tree, cell_t phandle)
395{
396 struct node *child, *node;
397
398 assert((phandle != 0) && (phandle != -1));
399
400 if (tree->phandle == phandle)
401 return tree;
402
403 for_each_child(tree, child) {
404 node = get_node_by_phandle(child, phandle);
405 if (node)
406 return node;
407 }
408
409 return NULL;
410}
411
412struct node *get_node_by_ref(struct node *tree, const char *ref)
413{
414 if (ref[0] == '/')
415 return get_node_by_path(tree, ref);
416 else
417 return get_node_by_label(tree, ref);
418}
419
420cell_t get_node_phandle(struct node *root, struct node *node)
421{
422 static cell_t phandle = 1; /* FIXME: ick, static local */
423
424 if ((node->phandle != 0) && (node->phandle != -1))
425 return node->phandle;
426
427 while (get_node_by_phandle(root, phandle))
428 phandle++;
429
430 node->phandle = phandle;
431
432 if (!get_property(node, "linux,phandle")
433 && (phandle_format & PHANDLE_LEGACY))
434 add_property(node,
435 build_property("linux,phandle",
436 data_append_cell(empty_data, phandle)));
437
438 if (!get_property(node, "phandle")
439 && (phandle_format & PHANDLE_EPAPR))
440 add_property(node,
441 build_property("phandle",
442 data_append_cell(empty_data, phandle)));
443
444 /* If the node *does* have a phandle property, we must
445 * be dealing with a self-referencing phandle, which will be
446 * fixed up momentarily in the caller */
447
448 return node->phandle;
449}
450
451uint32_t guess_boot_cpuid(struct node *tree)
452{
453 struct node *cpus, *bootcpu;
454 struct property *reg;
455
456 cpus = get_node_by_path(tree, "/cpus");
457 if (!cpus)
458 return 0;
459
460
461 bootcpu = cpus->children;
462 if (!bootcpu)
463 return 0;
464
465 reg = get_property(bootcpu, "reg");
466 if (!reg || (reg->val.len != sizeof(uint32_t)))
467 return 0;
468
469 /* FIXME: Sanity check node? */
470
471 return propval_cell(reg);
472}
473
474static int cmp_reserve_info(const void *ax, const void *bx)
475{
476 const struct reserve_info *a, *b;
477
478 a = *((const struct reserve_info * const *)ax);
479 b = *((const struct reserve_info * const *)bx);
480
481 if (a->re.address < b->re.address)
482 return -1;
483 else if (a->re.address > b->re.address)
484 return 1;
485 else if (a->re.size < b->re.size)
486 return -1;
487 else if (a->re.size > b->re.size)
488 return 1;
489 else
490 return 0;
491}
492
493static void sort_reserve_entries(struct boot_info *bi)
494{
495 struct reserve_info *ri, **tbl;
496 int n = 0, i = 0;
497
498 for (ri = bi->reservelist;
499 ri;
500 ri = ri->next)
501 n++;
502
503 if (n == 0)
504 return;
505
506 tbl = xmalloc(n * sizeof(*tbl));
507
508 for (ri = bi->reservelist;
509 ri;
510 ri = ri->next)
511 tbl[i++] = ri;
512
513 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);
514
515 bi->reservelist = tbl[0];
516 for (i = 0; i < (n-1); i++)
517 tbl[i]->next = tbl[i+1];
518 tbl[n-1]->next = NULL;
519
520 free(tbl);
521}
522
523static int cmp_prop(const void *ax, const void *bx)
524{
525 const struct property *a, *b;
526
527 a = *((const struct property * const *)ax);
528 b = *((const struct property * const *)bx);
529
530 return strcmp(a->name, b->name);
531}
532
533static void sort_properties(struct node *node)
534{
535 int n = 0, i = 0;
536 struct property *prop, **tbl;
537
538 for_each_property(node, prop)
539 n++;
540
541 if (n == 0)
542 return;
543
544 tbl = xmalloc(n * sizeof(*tbl));
545
546 for_each_property(node, prop)
547 tbl[i++] = prop;
548
549 qsort(tbl, n, sizeof(*tbl), cmp_prop);
550
551 node->proplist = tbl[0];
552 for (i = 0; i < (n-1); i++)
553 tbl[i]->next = tbl[i+1];
554 tbl[n-1]->next = NULL;
555
556 free(tbl);
557}
558
559static int cmp_subnode(const void *ax, const void *bx)
560{
561 const struct node *a, *b;
562
563 a = *((const struct node * const *)ax);
564 b = *((const struct node * const *)bx);
565
566 return strcmp(a->name, b->name);
567}
568
569static void sort_subnodes(struct node *node)
570{
571 int n = 0, i = 0;
572 struct node *subnode, **tbl;
573
574 for_each_child(node, subnode)
575 n++;
576
577 if (n == 0)
578 return;
579
580 tbl = xmalloc(n * sizeof(*tbl));
581
582 for_each_child(node, subnode)
583 tbl[i++] = subnode;
584
585 qsort(tbl, n, sizeof(*tbl), cmp_subnode);
586
587 node->children = tbl[0];
588 for (i = 0; i < (n-1); i++)
589 tbl[i]->next_sibling = tbl[i+1];
590 tbl[n-1]->next_sibling = NULL;
591
592 free(tbl);
593}
594
595static void sort_node(struct node *node)
596{
597 struct node *c;
598
599 sort_properties(node);
600 sort_subnodes(node);
601 for_each_child(node, c)
602 sort_node(c);
603}
604
605void sort_tree(struct boot_info *bi)
606{
607 sort_reserve_entries(bi);
608 sort_node(bi->dt);
609}
1/*
2 * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
3 *
4 *
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.
9 *
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.
14 *
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
18 * USA
19 */
20
21#include "dtc.h"
22
23/*
24 * Tree building functions
25 */
26
27void add_label(struct label **labels, char *label)
28{
29 struct label *new;
30
31 /* Make sure the label isn't already there */
32 for_each_label_withdel(*labels, new)
33 if (streq(new->label, label)) {
34 new->deleted = 0;
35 return;
36 }
37
38 new = xmalloc(sizeof(*new));
39 memset(new, 0, sizeof(*new));
40 new->label = label;
41 new->next = *labels;
42 *labels = new;
43}
44
45void delete_labels(struct label **labels)
46{
47 struct label *label;
48
49 for_each_label(*labels, label)
50 label->deleted = 1;
51}
52
53struct property *build_property(char *name, struct data val)
54{
55 struct property *new = xmalloc(sizeof(*new));
56
57 memset(new, 0, sizeof(*new));
58
59 new->name = name;
60 new->val = val;
61
62 return new;
63}
64
65struct property *build_property_delete(char *name)
66{
67 struct property *new = xmalloc(sizeof(*new));
68
69 memset(new, 0, sizeof(*new));
70
71 new->name = name;
72 new->deleted = 1;
73
74 return new;
75}
76
77struct property *chain_property(struct property *first, struct property *list)
78{
79 assert(first->next == NULL);
80
81 first->next = list;
82 return first;
83}
84
85struct property *reverse_properties(struct property *first)
86{
87 struct property *p = first;
88 struct property *head = NULL;
89 struct property *next;
90
91 while (p) {
92 next = p->next;
93 p->next = head;
94 head = p;
95 p = next;
96 }
97 return head;
98}
99
100struct node *build_node(struct property *proplist, struct node *children)
101{
102 struct node *new = xmalloc(sizeof(*new));
103 struct node *child;
104
105 memset(new, 0, sizeof(*new));
106
107 new->proplist = reverse_properties(proplist);
108 new->children = children;
109
110 for_each_child(new, child) {
111 child->parent = new;
112 }
113
114 return new;
115}
116
117struct node *build_node_delete(void)
118{
119 struct node *new = xmalloc(sizeof(*new));
120
121 memset(new, 0, sizeof(*new));
122
123 new->deleted = 1;
124
125 return new;
126}
127
128struct node *name_node(struct node *node, char *name)
129{
130 assert(node->name == NULL);
131
132 node->name = name;
133
134 return node;
135}
136
137struct node *merge_nodes(struct node *old_node, struct node *new_node)
138{
139 struct property *new_prop, *old_prop;
140 struct node *new_child, *old_child;
141 struct label *l;
142
143 old_node->deleted = 0;
144
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);
148
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;
156
157 if (new_prop->deleted) {
158 delete_property_by_name(old_node, new_prop->name);
159 free(new_prop);
160 continue;
161 }
162
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);
169
170 old_prop->val = new_prop->val;
171 old_prop->deleted = 0;
172 free(new_prop);
173 new_prop = NULL;
174 break;
175 }
176 }
177
178 /* if no collision occurred, add property to the old node. */
179 if (new_prop)
180 add_property(old_node, new_prop);
181 }
182
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;
191
192 if (new_child->deleted) {
193 delete_node_by_name(old_node, new_child->name);
194 free(new_child);
195 continue;
196 }
197
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);
202 new_child = NULL;
203 break;
204 }
205 }
206
207 /* if no collision occurred, add child to the old node. */
208 if (new_child)
209 add_child(old_node, new_child);
210 }
211
212 /* The new node contents are now merged into the old node. Free
213 * the new node. */
214 free(new_node);
215
216 return old_node;
217}
218
219struct node * add_orphan_node(struct node *dt, struct node *new_node, char *ref)
220{
221 static unsigned int next_orphan_fragment = 0;
222 struct node *node;
223 struct property *p;
224 struct data d = empty_data;
225 char *name;
226
227 d = data_add_marker(d, REF_PHANDLE, ref);
228 d = data_append_integer(d, 0xffffffff, 32);
229
230 p = build_property("target", d);
231
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);
237
238 add_child(dt, node);
239 return dt;
240}
241
242struct node *chain_node(struct node *first, struct node *list)
243{
244 assert(first->next_sibling == NULL);
245
246 first->next_sibling = list;
247 return first;
248}
249
250void add_property(struct node *node, struct property *prop)
251{
252 struct property **p;
253
254 prop->next = NULL;
255
256 p = &node->proplist;
257 while (*p)
258 p = &((*p)->next);
259
260 *p = prop;
261}
262
263void delete_property_by_name(struct node *node, char *name)
264{
265 struct property *prop = node->proplist;
266
267 while (prop) {
268 if (streq(prop->name, name)) {
269 delete_property(prop);
270 return;
271 }
272 prop = prop->next;
273 }
274}
275
276void delete_property(struct property *prop)
277{
278 prop->deleted = 1;
279 delete_labels(&prop->labels);
280}
281
282void add_child(struct node *parent, struct node *child)
283{
284 struct node **p;
285
286 child->next_sibling = NULL;
287 child->parent = parent;
288
289 p = &parent->children;
290 while (*p)
291 p = &((*p)->next_sibling);
292
293 *p = child;
294}
295
296void delete_node_by_name(struct node *parent, char *name)
297{
298 struct node *node = parent->children;
299
300 while (node) {
301 if (streq(node->name, name)) {
302 delete_node(node);
303 return;
304 }
305 node = node->next_sibling;
306 }
307}
308
309void delete_node(struct node *node)
310{
311 struct property *prop;
312 struct node *child;
313
314 node->deleted = 1;
315 for_each_child(node, child)
316 delete_node(child);
317 for_each_property(node, prop)
318 delete_property(prop);
319 delete_labels(&node->labels);
320}
321
322void append_to_property(struct node *node,
323 char *name, const void *data, int len)
324{
325 struct data d;
326 struct property *p;
327
328 p = get_property(node, name);
329 if (p) {
330 d = data_append_data(p->val, data, len);
331 p->val = d;
332 } else {
333 d = data_append_data(empty_data, data, len);
334 p = build_property(name, d);
335 add_property(node, p);
336 }
337}
338
339struct reserve_info *build_reserve_entry(uint64_t address, uint64_t size)
340{
341 struct reserve_info *new = xmalloc(sizeof(*new));
342
343 memset(new, 0, sizeof(*new));
344
345 new->address = address;
346 new->size = size;
347
348 return new;
349}
350
351struct reserve_info *chain_reserve_entry(struct reserve_info *first,
352 struct reserve_info *list)
353{
354 assert(first->next == NULL);
355
356 first->next = list;
357 return first;
358}
359
360struct reserve_info *add_reserve_entry(struct reserve_info *list,
361 struct reserve_info *new)
362{
363 struct reserve_info *last;
364
365 new->next = NULL;
366
367 if (! list)
368 return new;
369
370 for (last = list; last->next; last = last->next)
371 ;
372
373 last->next = new;
374
375 return list;
376}
377
378struct dt_info *build_dt_info(unsigned int dtsflags,
379 struct reserve_info *reservelist,
380 struct node *tree, uint32_t boot_cpuid_phys)
381{
382 struct dt_info *dti;
383
384 dti = xmalloc(sizeof(*dti));
385 dti->dtsflags = dtsflags;
386 dti->reservelist = reservelist;
387 dti->dt = tree;
388 dti->boot_cpuid_phys = boot_cpuid_phys;
389
390 return dti;
391}
392
393/*
394 * Tree accessor functions
395 */
396
397const char *get_unitname(struct node *node)
398{
399 if (node->name[node->basenamelen] == '\0')
400 return "";
401 else
402 return node->name + node->basenamelen + 1;
403}
404
405struct property *get_property(struct node *node, const char *propname)
406{
407 struct property *prop;
408
409 for_each_property(node, prop)
410 if (streq(prop->name, propname))
411 return prop;
412
413 return NULL;
414}
415
416cell_t propval_cell(struct property *prop)
417{
418 assert(prop->val.len == sizeof(cell_t));
419 return fdt32_to_cpu(*((fdt32_t *)prop->val.val));
420}
421
422cell_t propval_cell_n(struct property *prop, int n)
423{
424 assert(prop->val.len / sizeof(cell_t) >= n);
425 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n));
426}
427
428struct property *get_property_by_label(struct node *tree, const char *label,
429 struct node **node)
430{
431 struct property *prop;
432 struct node *c;
433
434 *node = tree;
435
436 for_each_property(tree, prop) {
437 struct label *l;
438
439 for_each_label(prop->labels, l)
440 if (streq(l->label, label))
441 return prop;
442 }
443
444 for_each_child(tree, c) {
445 prop = get_property_by_label(c, label, node);
446 if (prop)
447 return prop;
448 }
449
450 *node = NULL;
451 return NULL;
452}
453
454struct marker *get_marker_label(struct node *tree, const char *label,
455 struct node **node, struct property **prop)
456{
457 struct marker *m;
458 struct property *p;
459 struct node *c;
460
461 *node = tree;
462
463 for_each_property(tree, p) {
464 *prop = p;
465 m = p->val.markers;
466 for_each_marker_of_type(m, LABEL)
467 if (streq(m->ref, label))
468 return m;
469 }
470
471 for_each_child(tree, c) {
472 m = get_marker_label(c, label, node, prop);
473 if (m)
474 return m;
475 }
476
477 *prop = NULL;
478 *node = NULL;
479 return NULL;
480}
481
482struct node *get_subnode(struct node *node, const char *nodename)
483{
484 struct node *child;
485
486 for_each_child(node, child)
487 if (streq(child->name, nodename))
488 return child;
489
490 return NULL;
491}
492
493struct node *get_node_by_path(struct node *tree, const char *path)
494{
495 const char *p;
496 struct node *child;
497
498 if (!path || ! (*path)) {
499 if (tree->deleted)
500 return NULL;
501 return tree;
502 }
503
504 while (path[0] == '/')
505 path++;
506
507 p = strchr(path, '/');
508
509 for_each_child(tree, child) {
510 if (p && (strlen(child->name) == p-path) &&
511 strprefixeq(path, p - path, child->name))
512 return get_node_by_path(child, p+1);
513 else if (!p && streq(path, child->name))
514 return child;
515 }
516
517 return NULL;
518}
519
520struct node *get_node_by_label(struct node *tree, const char *label)
521{
522 struct node *child, *node;
523 struct label *l;
524
525 assert(label && (strlen(label) > 0));
526
527 for_each_label(tree->labels, l)
528 if (streq(l->label, label))
529 return tree;
530
531 for_each_child(tree, child) {
532 node = get_node_by_label(child, label);
533 if (node)
534 return node;
535 }
536
537 return NULL;
538}
539
540struct node *get_node_by_phandle(struct node *tree, cell_t phandle)
541{
542 struct node *child, *node;
543
544 if ((phandle == 0) || (phandle == -1)) {
545 assert(generate_fixups);
546 return NULL;
547 }
548
549 if (tree->phandle == phandle) {
550 if (tree->deleted)
551 return NULL;
552 return tree;
553 }
554
555 for_each_child(tree, child) {
556 node = get_node_by_phandle(child, phandle);
557 if (node)
558 return node;
559 }
560
561 return NULL;
562}
563
564struct node *get_node_by_ref(struct node *tree, const char *ref)
565{
566 if (streq(ref, "/"))
567 return tree;
568 else if (ref[0] == '/')
569 return get_node_by_path(tree, ref);
570 else
571 return get_node_by_label(tree, ref);
572}
573
574cell_t get_node_phandle(struct node *root, struct node *node)
575{
576 static cell_t phandle = 1; /* FIXME: ick, static local */
577
578 if ((node->phandle != 0) && (node->phandle != -1))
579 return node->phandle;
580
581 while (get_node_by_phandle(root, phandle))
582 phandle++;
583
584 node->phandle = phandle;
585
586 if (!get_property(node, "linux,phandle")
587 && (phandle_format & PHANDLE_LEGACY))
588 add_property(node,
589 build_property("linux,phandle",
590 data_append_cell(empty_data, phandle)));
591
592 if (!get_property(node, "phandle")
593 && (phandle_format & PHANDLE_EPAPR))
594 add_property(node,
595 build_property("phandle",
596 data_append_cell(empty_data, phandle)));
597
598 /* If the node *does* have a phandle property, we must
599 * be dealing with a self-referencing phandle, which will be
600 * fixed up momentarily in the caller */
601
602 return node->phandle;
603}
604
605uint32_t guess_boot_cpuid(struct node *tree)
606{
607 struct node *cpus, *bootcpu;
608 struct property *reg;
609
610 cpus = get_node_by_path(tree, "/cpus");
611 if (!cpus)
612 return 0;
613
614
615 bootcpu = cpus->children;
616 if (!bootcpu)
617 return 0;
618
619 reg = get_property(bootcpu, "reg");
620 if (!reg || (reg->val.len != sizeof(uint32_t)))
621 return 0;
622
623 /* FIXME: Sanity check node? */
624
625 return propval_cell(reg);
626}
627
628static int cmp_reserve_info(const void *ax, const void *bx)
629{
630 const struct reserve_info *a, *b;
631
632 a = *((const struct reserve_info * const *)ax);
633 b = *((const struct reserve_info * const *)bx);
634
635 if (a->address < b->address)
636 return -1;
637 else if (a->address > b->address)
638 return 1;
639 else if (a->size < b->size)
640 return -1;
641 else if (a->size > b->size)
642 return 1;
643 else
644 return 0;
645}
646
647static void sort_reserve_entries(struct dt_info *dti)
648{
649 struct reserve_info *ri, **tbl;
650 int n = 0, i = 0;
651
652 for (ri = dti->reservelist;
653 ri;
654 ri = ri->next)
655 n++;
656
657 if (n == 0)
658 return;
659
660 tbl = xmalloc(n * sizeof(*tbl));
661
662 for (ri = dti->reservelist;
663 ri;
664 ri = ri->next)
665 tbl[i++] = ri;
666
667 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);
668
669 dti->reservelist = tbl[0];
670 for (i = 0; i < (n-1); i++)
671 tbl[i]->next = tbl[i+1];
672 tbl[n-1]->next = NULL;
673
674 free(tbl);
675}
676
677static int cmp_prop(const void *ax, const void *bx)
678{
679 const struct property *a, *b;
680
681 a = *((const struct property * const *)ax);
682 b = *((const struct property * const *)bx);
683
684 return strcmp(a->name, b->name);
685}
686
687static void sort_properties(struct node *node)
688{
689 int n = 0, i = 0;
690 struct property *prop, **tbl;
691
692 for_each_property_withdel(node, prop)
693 n++;
694
695 if (n == 0)
696 return;
697
698 tbl = xmalloc(n * sizeof(*tbl));
699
700 for_each_property_withdel(node, prop)
701 tbl[i++] = prop;
702
703 qsort(tbl, n, sizeof(*tbl), cmp_prop);
704
705 node->proplist = tbl[0];
706 for (i = 0; i < (n-1); i++)
707 tbl[i]->next = tbl[i+1];
708 tbl[n-1]->next = NULL;
709
710 free(tbl);
711}
712
713static int cmp_subnode(const void *ax, const void *bx)
714{
715 const struct node *a, *b;
716
717 a = *((const struct node * const *)ax);
718 b = *((const struct node * const *)bx);
719
720 return strcmp(a->name, b->name);
721}
722
723static void sort_subnodes(struct node *node)
724{
725 int n = 0, i = 0;
726 struct node *subnode, **tbl;
727
728 for_each_child_withdel(node, subnode)
729 n++;
730
731 if (n == 0)
732 return;
733
734 tbl = xmalloc(n * sizeof(*tbl));
735
736 for_each_child_withdel(node, subnode)
737 tbl[i++] = subnode;
738
739 qsort(tbl, n, sizeof(*tbl), cmp_subnode);
740
741 node->children = tbl[0];
742 for (i = 0; i < (n-1); i++)
743 tbl[i]->next_sibling = tbl[i+1];
744 tbl[n-1]->next_sibling = NULL;
745
746 free(tbl);
747}
748
749static void sort_node(struct node *node)
750{
751 struct node *c;
752
753 sort_properties(node);
754 sort_subnodes(node);
755 for_each_child_withdel(node, c)
756 sort_node(c);
757}
758
759void sort_tree(struct dt_info *dti)
760{
761 sort_reserve_entries(dti);
762 sort_node(dti->dt);
763}
764
765/* utility helper to avoid code duplication */
766static struct node *build_and_name_child_node(struct node *parent, char *name)
767{
768 struct node *node;
769
770 node = build_node(NULL, NULL);
771 name_node(node, xstrdup(name));
772 add_child(parent, node);
773
774 return node;
775}
776
777static struct node *build_root_node(struct node *dt, char *name)
778{
779 struct node *an;
780
781 an = get_subnode(dt, name);
782 if (!an)
783 an = build_and_name_child_node(dt, name);
784
785 if (!an)
786 die("Could not build root node /%s\n", name);
787
788 return an;
789}
790
791static bool any_label_tree(struct dt_info *dti, struct node *node)
792{
793 struct node *c;
794
795 if (node->labels)
796 return true;
797
798 for_each_child(node, c)
799 if (any_label_tree(dti, c))
800 return true;
801
802 return false;
803}
804
805static void generate_label_tree_internal(struct dt_info *dti,
806 struct node *an, struct node *node,
807 bool allocph)
808{
809 struct node *dt = dti->dt;
810 struct node *c;
811 struct property *p;
812 struct label *l;
813
814 /* if there are labels */
815 if (node->labels) {
816
817 /* now add the label in the node */
818 for_each_label(node->labels, l) {
819
820 /* check whether the label already exists */
821 p = get_property(an, l->label);
822 if (p) {
823 fprintf(stderr, "WARNING: label %s already"
824 " exists in /%s", l->label,
825 an->name);
826 continue;
827 }
828
829 /* insert it */
830 p = build_property(l->label,
831 data_copy_mem(node->fullpath,
832 strlen(node->fullpath) + 1));
833 add_property(an, p);
834 }
835
836 /* force allocation of a phandle for this node */
837 if (allocph)
838 (void)get_node_phandle(dt, node);
839 }
840
841 for_each_child(node, c)
842 generate_label_tree_internal(dti, an, c, allocph);
843}
844
845static bool any_fixup_tree(struct dt_info *dti, struct node *node)
846{
847 struct node *c;
848 struct property *prop;
849 struct marker *m;
850
851 for_each_property(node, prop) {
852 m = prop->val.markers;
853 for_each_marker_of_type(m, REF_PHANDLE) {
854 if (!get_node_by_ref(dti->dt, m->ref))
855 return true;
856 }
857 }
858
859 for_each_child(node, c) {
860 if (any_fixup_tree(dti, c))
861 return true;
862 }
863
864 return false;
865}
866
867static void add_fixup_entry(struct dt_info *dti, struct node *fn,
868 struct node *node, struct property *prop,
869 struct marker *m)
870{
871 char *entry;
872
873 /* m->ref can only be a REF_PHANDLE, but check anyway */
874 assert(m->type == REF_PHANDLE);
875
876 /* there shouldn't be any ':' in the arguments */
877 if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))
878 die("arguments should not contain ':'\n");
879
880 xasprintf(&entry, "%s:%s:%u",
881 node->fullpath, prop->name, m->offset);
882 append_to_property(fn, m->ref, entry, strlen(entry) + 1);
883
884 free(entry);
885}
886
887static void generate_fixups_tree_internal(struct dt_info *dti,
888 struct node *fn,
889 struct node *node)
890{
891 struct node *dt = dti->dt;
892 struct node *c;
893 struct property *prop;
894 struct marker *m;
895 struct node *refnode;
896
897 for_each_property(node, prop) {
898 m = prop->val.markers;
899 for_each_marker_of_type(m, REF_PHANDLE) {
900 refnode = get_node_by_ref(dt, m->ref);
901 if (!refnode)
902 add_fixup_entry(dti, fn, node, prop, m);
903 }
904 }
905
906 for_each_child(node, c)
907 generate_fixups_tree_internal(dti, fn, c);
908}
909
910static bool any_local_fixup_tree(struct dt_info *dti, struct node *node)
911{
912 struct node *c;
913 struct property *prop;
914 struct marker *m;
915
916 for_each_property(node, prop) {
917 m = prop->val.markers;
918 for_each_marker_of_type(m, REF_PHANDLE) {
919 if (get_node_by_ref(dti->dt, m->ref))
920 return true;
921 }
922 }
923
924 for_each_child(node, c) {
925 if (any_local_fixup_tree(dti, c))
926 return true;
927 }
928
929 return false;
930}
931
932static void add_local_fixup_entry(struct dt_info *dti,
933 struct node *lfn, struct node *node,
934 struct property *prop, struct marker *m,
935 struct node *refnode)
936{
937 struct node *wn, *nwn; /* local fixup node, walk node, new */
938 fdt32_t value_32;
939 char **compp;
940 int i, depth;
941
942 /* walk back retreiving depth */
943 depth = 0;
944 for (wn = node; wn; wn = wn->parent)
945 depth++;
946
947 /* allocate name array */
948 compp = xmalloc(sizeof(*compp) * depth);
949
950 /* store names in the array */
951 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--)
952 compp[i] = wn->name;
953
954 /* walk the path components creating nodes if they don't exist */
955 for (wn = lfn, i = 1; i < depth; i++, wn = nwn) {
956 /* if no node exists, create it */
957 nwn = get_subnode(wn, compp[i]);
958 if (!nwn)
959 nwn = build_and_name_child_node(wn, compp[i]);
960 }
961
962 free(compp);
963
964 value_32 = cpu_to_fdt32(m->offset);
965 append_to_property(wn, prop->name, &value_32, sizeof(value_32));
966}
967
968static void generate_local_fixups_tree_internal(struct dt_info *dti,
969 struct node *lfn,
970 struct node *node)
971{
972 struct node *dt = dti->dt;
973 struct node *c;
974 struct property *prop;
975 struct marker *m;
976 struct node *refnode;
977
978 for_each_property(node, prop) {
979 m = prop->val.markers;
980 for_each_marker_of_type(m, REF_PHANDLE) {
981 refnode = get_node_by_ref(dt, m->ref);
982 if (refnode)
983 add_local_fixup_entry(dti, lfn, node, prop, m, refnode);
984 }
985 }
986
987 for_each_child(node, c)
988 generate_local_fixups_tree_internal(dti, lfn, c);
989}
990
991void generate_label_tree(struct dt_info *dti, char *name, bool allocph)
992{
993 if (!any_label_tree(dti, dti->dt))
994 return;
995 generate_label_tree_internal(dti, build_root_node(dti->dt, name),
996 dti->dt, allocph);
997}
998
999void generate_fixups_tree(struct dt_info *dti, char *name)
1000{
1001 if (!any_fixup_tree(dti, dti->dt))
1002 return;
1003 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name),
1004 dti->dt);
1005}
1006
1007void generate_local_fixups_tree(struct dt_info *dti, char *name)
1008{
1009 if (!any_local_fixup_tree(dti, dti->dt))
1010 return;
1011 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name),
1012 dti->dt);
1013}