Commit | Line | Data |
---|---|---|
9b6b563c PM |
1 | /* |
2 | * Procedures for creating, accessing and interpreting the device tree. | |
3 | * | |
4 | * Paul Mackerras August 1996. | |
5 | * Copyright (C) 1996-2005 Paul Mackerras. | |
6 | * | |
7 | * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. | |
8 | * {engebret|bergner}@us.ibm.com | |
9 | * | |
10 | * This program is free software; you can redistribute it and/or | |
11 | * modify it under the terms of the GNU General Public License | |
12 | * as published by the Free Software Foundation; either version | |
13 | * 2 of the License, or (at your option) any later version. | |
14 | */ | |
15 | ||
16 | #undef DEBUG | |
17 | ||
18 | #include <stdarg.h> | |
9b6b563c PM |
19 | #include <linux/kernel.h> |
20 | #include <linux/string.h> | |
21 | #include <linux/init.h> | |
22 | #include <linux/threads.h> | |
23 | #include <linux/spinlock.h> | |
24 | #include <linux/types.h> | |
25 | #include <linux/pci.h> | |
26 | #include <linux/stringify.h> | |
27 | #include <linux/delay.h> | |
28 | #include <linux/initrd.h> | |
29 | #include <linux/bitops.h> | |
30 | #include <linux/module.h> | |
dcee3036 | 31 | #include <linux/kexec.h> |
7a4571ae | 32 | #include <linux/debugfs.h> |
0ebfff14 | 33 | #include <linux/irq.h> |
9b6b563c PM |
34 | |
35 | #include <asm/prom.h> | |
36 | #include <asm/rtas.h> | |
37 | #include <asm/lmb.h> | |
38 | #include <asm/page.h> | |
39 | #include <asm/processor.h> | |
40 | #include <asm/irq.h> | |
41 | #include <asm/io.h> | |
0cc4746c | 42 | #include <asm/kdump.h> |
9b6b563c PM |
43 | #include <asm/smp.h> |
44 | #include <asm/system.h> | |
45 | #include <asm/mmu.h> | |
46 | #include <asm/pgtable.h> | |
47 | #include <asm/pci.h> | |
48 | #include <asm/iommu.h> | |
49 | #include <asm/btext.h> | |
50 | #include <asm/sections.h> | |
51 | #include <asm/machdep.h> | |
52 | #include <asm/pSeries_reconfig.h> | |
40ef8cbc | 53 | #include <asm/pci-bridge.h> |
2babf5c2 | 54 | #include <asm/kexec.h> |
94a3807c | 55 | #include <asm/system.h> |
9b6b563c PM |
56 | |
57 | #ifdef DEBUG | |
58 | #define DBG(fmt...) printk(KERN_ERR fmt) | |
59 | #else | |
60 | #define DBG(fmt...) | |
61 | #endif | |
62 | ||
9b6b563c | 63 | |
9b6b563c PM |
64 | static int __initdata dt_root_addr_cells; |
65 | static int __initdata dt_root_size_cells; | |
66 | ||
67 | #ifdef CONFIG_PPC64 | |
28897731 | 68 | int __initdata iommu_is_off; |
9b6b563c | 69 | int __initdata iommu_force_on; |
cf00a8d1 | 70 | unsigned long tce_alloc_start, tce_alloc_end; |
9b6b563c PM |
71 | #endif |
72 | ||
73 | typedef u32 cell_t; | |
74 | ||
75 | #if 0 | |
76 | static struct boot_param_header *initial_boot_params __initdata; | |
77 | #else | |
78 | struct boot_param_header *initial_boot_params; | |
79 | #endif | |
80 | ||
81 | static struct device_node *allnodes = NULL; | |
82 | ||
83 | /* use when traversing tree through the allnext, child, sibling, | |
84 | * or parent members of struct device_node. | |
85 | */ | |
86 | static DEFINE_RWLOCK(devtree_lock); | |
87 | ||
88 | /* export that to outside world */ | |
89 | struct device_node *of_chosen; | |
90 | ||
9b6b563c PM |
91 | static inline char *find_flat_dt_string(u32 offset) |
92 | { | |
93 | return ((char *)initial_boot_params) + | |
94 | initial_boot_params->off_dt_strings + offset; | |
95 | } | |
96 | ||
97 | /** | |
98 | * This function is used to scan the flattened device-tree, it is | |
99 | * used to extract the memory informations at boot before we can | |
100 | * unflatten the tree | |
101 | */ | |
3c726f8d BH |
102 | int __init of_scan_flat_dt(int (*it)(unsigned long node, |
103 | const char *uname, int depth, | |
104 | void *data), | |
105 | void *data) | |
9b6b563c PM |
106 | { |
107 | unsigned long p = ((unsigned long)initial_boot_params) + | |
108 | initial_boot_params->off_dt_struct; | |
109 | int rc = 0; | |
110 | int depth = -1; | |
111 | ||
112 | do { | |
113 | u32 tag = *((u32 *)p); | |
114 | char *pathp; | |
115 | ||
116 | p += 4; | |
117 | if (tag == OF_DT_END_NODE) { | |
118 | depth --; | |
119 | continue; | |
120 | } | |
121 | if (tag == OF_DT_NOP) | |
122 | continue; | |
123 | if (tag == OF_DT_END) | |
124 | break; | |
125 | if (tag == OF_DT_PROP) { | |
126 | u32 sz = *((u32 *)p); | |
127 | p += 8; | |
128 | if (initial_boot_params->version < 0x10) | |
129 | p = _ALIGN(p, sz >= 8 ? 8 : 4); | |
130 | p += sz; | |
131 | p = _ALIGN(p, 4); | |
132 | continue; | |
133 | } | |
134 | if (tag != OF_DT_BEGIN_NODE) { | |
135 | printk(KERN_WARNING "Invalid tag %x scanning flattened" | |
136 | " device tree !\n", tag); | |
137 | return -EINVAL; | |
138 | } | |
139 | depth++; | |
140 | pathp = (char *)p; | |
141 | p = _ALIGN(p + strlen(pathp) + 1, 4); | |
142 | if ((*pathp) == '/') { | |
143 | char *lp, *np; | |
144 | for (lp = NULL, np = pathp; *np; np++) | |
145 | if ((*np) == '/') | |
146 | lp = np+1; | |
147 | if (lp != NULL) | |
148 | pathp = lp; | |
149 | } | |
150 | rc = it(p, pathp, depth, data); | |
151 | if (rc != 0) | |
152 | break; | |
153 | } while(1); | |
154 | ||
155 | return rc; | |
156 | } | |
157 | ||
e8222502 BH |
158 | unsigned long __init of_get_flat_dt_root(void) |
159 | { | |
160 | unsigned long p = ((unsigned long)initial_boot_params) + | |
161 | initial_boot_params->off_dt_struct; | |
162 | ||
163 | while(*((u32 *)p) == OF_DT_NOP) | |
164 | p += 4; | |
165 | BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE); | |
166 | p += 4; | |
167 | return _ALIGN(p + strlen((char *)p) + 1, 4); | |
168 | } | |
169 | ||
9b6b563c PM |
170 | /** |
171 | * This function can be used within scan_flattened_dt callback to get | |
172 | * access to properties | |
173 | */ | |
3c726f8d BH |
174 | void* __init of_get_flat_dt_prop(unsigned long node, const char *name, |
175 | unsigned long *size) | |
9b6b563c PM |
176 | { |
177 | unsigned long p = node; | |
178 | ||
179 | do { | |
180 | u32 tag = *((u32 *)p); | |
181 | u32 sz, noff; | |
182 | const char *nstr; | |
183 | ||
184 | p += 4; | |
185 | if (tag == OF_DT_NOP) | |
186 | continue; | |
187 | if (tag != OF_DT_PROP) | |
188 | return NULL; | |
189 | ||
190 | sz = *((u32 *)p); | |
191 | noff = *((u32 *)(p + 4)); | |
192 | p += 8; | |
193 | if (initial_boot_params->version < 0x10) | |
194 | p = _ALIGN(p, sz >= 8 ? 8 : 4); | |
195 | ||
196 | nstr = find_flat_dt_string(noff); | |
197 | if (nstr == NULL) { | |
198 | printk(KERN_WARNING "Can't find property index" | |
199 | " name !\n"); | |
200 | return NULL; | |
201 | } | |
202 | if (strcmp(name, nstr) == 0) { | |
203 | if (size) | |
204 | *size = sz; | |
205 | return (void *)p; | |
206 | } | |
207 | p += sz; | |
208 | p = _ALIGN(p, 4); | |
209 | } while(1); | |
210 | } | |
211 | ||
e8222502 BH |
212 | int __init of_flat_dt_is_compatible(unsigned long node, const char *compat) |
213 | { | |
214 | const char* cp; | |
215 | unsigned long cplen, l; | |
216 | ||
217 | cp = of_get_flat_dt_prop(node, "compatible", &cplen); | |
218 | if (cp == NULL) | |
219 | return 0; | |
220 | while (cplen > 0) { | |
221 | if (strncasecmp(cp, compat, strlen(compat)) == 0) | |
222 | return 1; | |
223 | l = strlen(cp) + 1; | |
224 | cp += l; | |
225 | cplen -= l; | |
226 | } | |
227 | ||
228 | return 0; | |
229 | } | |
230 | ||
9b6b563c PM |
231 | static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size, |
232 | unsigned long align) | |
233 | { | |
234 | void *res; | |
235 | ||
236 | *mem = _ALIGN(*mem, align); | |
237 | res = (void *)*mem; | |
238 | *mem += size; | |
239 | ||
240 | return res; | |
241 | } | |
242 | ||
243 | static unsigned long __init unflatten_dt_node(unsigned long mem, | |
244 | unsigned long *p, | |
245 | struct device_node *dad, | |
246 | struct device_node ***allnextpp, | |
247 | unsigned long fpsize) | |
248 | { | |
249 | struct device_node *np; | |
250 | struct property *pp, **prev_pp = NULL; | |
251 | char *pathp; | |
252 | u32 tag; | |
253 | unsigned int l, allocl; | |
254 | int has_name = 0; | |
255 | int new_format = 0; | |
256 | ||
257 | tag = *((u32 *)(*p)); | |
258 | if (tag != OF_DT_BEGIN_NODE) { | |
259 | printk("Weird tag at start of node: %x\n", tag); | |
260 | return mem; | |
261 | } | |
262 | *p += 4; | |
263 | pathp = (char *)*p; | |
264 | l = allocl = strlen(pathp) + 1; | |
265 | *p = _ALIGN(*p + l, 4); | |
266 | ||
267 | /* version 0x10 has a more compact unit name here instead of the full | |
268 | * path. we accumulate the full path size using "fpsize", we'll rebuild | |
269 | * it later. We detect this because the first character of the name is | |
270 | * not '/'. | |
271 | */ | |
272 | if ((*pathp) != '/') { | |
273 | new_format = 1; | |
274 | if (fpsize == 0) { | |
275 | /* root node: special case. fpsize accounts for path | |
276 | * plus terminating zero. root node only has '/', so | |
277 | * fpsize should be 2, but we want to avoid the first | |
278 | * level nodes to have two '/' so we use fpsize 1 here | |
279 | */ | |
280 | fpsize = 1; | |
281 | allocl = 2; | |
282 | } else { | |
283 | /* account for '/' and path size minus terminal 0 | |
284 | * already in 'l' | |
285 | */ | |
286 | fpsize += l; | |
287 | allocl = fpsize; | |
288 | } | |
289 | } | |
290 | ||
291 | ||
292 | np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl, | |
293 | __alignof__(struct device_node)); | |
294 | if (allnextpp) { | |
295 | memset(np, 0, sizeof(*np)); | |
296 | np->full_name = ((char*)np) + sizeof(struct device_node); | |
297 | if (new_format) { | |
298 | char *p = np->full_name; | |
299 | /* rebuild full path for new format */ | |
300 | if (dad && dad->parent) { | |
301 | strcpy(p, dad->full_name); | |
302 | #ifdef DEBUG | |
303 | if ((strlen(p) + l + 1) != allocl) { | |
304 | DBG("%s: p: %d, l: %d, a: %d\n", | |
e8222502 | 305 | pathp, (int)strlen(p), l, allocl); |
9b6b563c PM |
306 | } |
307 | #endif | |
308 | p += strlen(p); | |
309 | } | |
310 | *(p++) = '/'; | |
311 | memcpy(p, pathp, l); | |
312 | } else | |
313 | memcpy(np->full_name, pathp, l); | |
314 | prev_pp = &np->properties; | |
315 | **allnextpp = np; | |
316 | *allnextpp = &np->allnext; | |
317 | if (dad != NULL) { | |
318 | np->parent = dad; | |
319 | /* we temporarily use the next field as `last_child'*/ | |
320 | if (dad->next == 0) | |
321 | dad->child = np; | |
322 | else | |
323 | dad->next->sibling = np; | |
324 | dad->next = np; | |
325 | } | |
326 | kref_init(&np->kref); | |
327 | } | |
328 | while(1) { | |
329 | u32 sz, noff; | |
330 | char *pname; | |
331 | ||
332 | tag = *((u32 *)(*p)); | |
333 | if (tag == OF_DT_NOP) { | |
334 | *p += 4; | |
335 | continue; | |
336 | } | |
337 | if (tag != OF_DT_PROP) | |
338 | break; | |
339 | *p += 4; | |
340 | sz = *((u32 *)(*p)); | |
341 | noff = *((u32 *)((*p) + 4)); | |
342 | *p += 8; | |
343 | if (initial_boot_params->version < 0x10) | |
344 | *p = _ALIGN(*p, sz >= 8 ? 8 : 4); | |
345 | ||
346 | pname = find_flat_dt_string(noff); | |
347 | if (pname == NULL) { | |
348 | printk("Can't find property name in list !\n"); | |
349 | break; | |
350 | } | |
351 | if (strcmp(pname, "name") == 0) | |
352 | has_name = 1; | |
353 | l = strlen(pname) + 1; | |
354 | pp = unflatten_dt_alloc(&mem, sizeof(struct property), | |
355 | __alignof__(struct property)); | |
356 | if (allnextpp) { | |
357 | if (strcmp(pname, "linux,phandle") == 0) { | |
358 | np->node = *((u32 *)*p); | |
359 | if (np->linux_phandle == 0) | |
360 | np->linux_phandle = np->node; | |
361 | } | |
362 | if (strcmp(pname, "ibm,phandle") == 0) | |
363 | np->linux_phandle = *((u32 *)*p); | |
364 | pp->name = pname; | |
365 | pp->length = sz; | |
366 | pp->value = (void *)*p; | |
367 | *prev_pp = pp; | |
368 | prev_pp = &pp->next; | |
369 | } | |
370 | *p = _ALIGN((*p) + sz, 4); | |
371 | } | |
372 | /* with version 0x10 we may not have the name property, recreate | |
373 | * it here from the unit name if absent | |
374 | */ | |
375 | if (!has_name) { | |
376 | char *p = pathp, *ps = pathp, *pa = NULL; | |
377 | int sz; | |
378 | ||
379 | while (*p) { | |
380 | if ((*p) == '@') | |
381 | pa = p; | |
382 | if ((*p) == '/') | |
383 | ps = p + 1; | |
384 | p++; | |
385 | } | |
386 | if (pa < ps) | |
387 | pa = p; | |
388 | sz = (pa - ps) + 1; | |
389 | pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz, | |
390 | __alignof__(struct property)); | |
391 | if (allnextpp) { | |
392 | pp->name = "name"; | |
393 | pp->length = sz; | |
1a38147e | 394 | pp->value = pp + 1; |
9b6b563c PM |
395 | *prev_pp = pp; |
396 | prev_pp = &pp->next; | |
397 | memcpy(pp->value, ps, sz - 1); | |
398 | ((char *)pp->value)[sz - 1] = 0; | |
1a38147e SR |
399 | DBG("fixed up name for %s -> %s\n", pathp, |
400 | (char *)pp->value); | |
9b6b563c PM |
401 | } |
402 | } | |
403 | if (allnextpp) { | |
404 | *prev_pp = NULL; | |
0e56efc7 SR |
405 | np->name = of_get_property(np, "name", NULL); |
406 | np->type = of_get_property(np, "device_type", NULL); | |
9b6b563c PM |
407 | |
408 | if (!np->name) | |
409 | np->name = "<NULL>"; | |
410 | if (!np->type) | |
411 | np->type = "<NULL>"; | |
412 | } | |
413 | while (tag == OF_DT_BEGIN_NODE) { | |
414 | mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize); | |
415 | tag = *((u32 *)(*p)); | |
416 | } | |
417 | if (tag != OF_DT_END_NODE) { | |
418 | printk("Weird tag at end of node: %x\n", tag); | |
419 | return mem; | |
420 | } | |
421 | *p += 4; | |
422 | return mem; | |
423 | } | |
424 | ||
2babf5c2 ME |
425 | static int __init early_parse_mem(char *p) |
426 | { | |
427 | if (!p) | |
428 | return 1; | |
429 | ||
430 | memory_limit = PAGE_ALIGN(memparse(p, &p)); | |
431 | DBG("memory limit = 0x%lx\n", memory_limit); | |
432 | ||
433 | return 0; | |
434 | } | |
435 | early_param("mem", early_parse_mem); | |
436 | ||
437 | /* | |
438 | * The device tree may be allocated below our memory limit, or inside the | |
439 | * crash kernel region for kdump. If so, move it out now. | |
440 | */ | |
441 | static void move_device_tree(void) | |
442 | { | |
443 | unsigned long start, size; | |
444 | void *p; | |
445 | ||
446 | DBG("-> move_device_tree\n"); | |
447 | ||
448 | start = __pa(initial_boot_params); | |
449 | size = initial_boot_params->totalsize; | |
450 | ||
451 | if ((memory_limit && (start + size) > memory_limit) || | |
452 | overlaps_crashkernel(start, size)) { | |
453 | p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size)); | |
454 | memcpy(p, initial_boot_params, size); | |
455 | initial_boot_params = (struct boot_param_header *)p; | |
456 | DBG("Moved device tree to 0x%p\n", p); | |
457 | } | |
458 | ||
459 | DBG("<- move_device_tree\n"); | |
460 | } | |
9b6b563c PM |
461 | |
462 | /** | |
463 | * unflattens the device-tree passed by the firmware, creating the | |
464 | * tree of struct device_node. It also fills the "name" and "type" | |
465 | * pointers of the nodes so the normal device-tree walking functions | |
466 | * can be used (this used to be done by finish_device_tree) | |
467 | */ | |
468 | void __init unflatten_device_tree(void) | |
469 | { | |
470 | unsigned long start, mem, size; | |
471 | struct device_node **allnextp = &allnodes; | |
9b6b563c PM |
472 | |
473 | DBG(" -> unflatten_device_tree()\n"); | |
474 | ||
475 | /* First pass, scan for size */ | |
476 | start = ((unsigned long)initial_boot_params) + | |
477 | initial_boot_params->off_dt_struct; | |
478 | size = unflatten_dt_node(0, &start, NULL, NULL, 0); | |
479 | size = (size | 3) + 1; | |
480 | ||
481 | DBG(" size is %lx, allocating...\n", size); | |
482 | ||
483 | /* Allocate memory for the expanded device tree */ | |
484 | mem = lmb_alloc(size + 4, __alignof__(struct device_node)); | |
9b6b563c PM |
485 | mem = (unsigned long) __va(mem); |
486 | ||
487 | ((u32 *)mem)[size / 4] = 0xdeadbeef; | |
488 | ||
489 | DBG(" unflattening %lx...\n", mem); | |
490 | ||
491 | /* Second pass, do actual unflattening */ | |
492 | start = ((unsigned long)initial_boot_params) + | |
493 | initial_boot_params->off_dt_struct; | |
494 | unflatten_dt_node(mem, &start, NULL, &allnextp, 0); | |
495 | if (*((u32 *)start) != OF_DT_END) | |
496 | printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start)); | |
497 | if (((u32 *)mem)[size / 4] != 0xdeadbeef) | |
498 | printk(KERN_WARNING "End of tree marker overwritten: %08x\n", | |
499 | ((u32 *)mem)[size / 4] ); | |
500 | *allnextp = NULL; | |
501 | ||
502 | /* Get pointer to OF "/chosen" node for use everywhere */ | |
503 | of_chosen = of_find_node_by_path("/chosen"); | |
a575b807 PM |
504 | if (of_chosen == NULL) |
505 | of_chosen = of_find_node_by_path("/chosen@0"); | |
9b6b563c | 506 | |
9b6b563c PM |
507 | DBG(" <- unflatten_device_tree()\n"); |
508 | } | |
509 | ||
d205819e PM |
510 | /* |
511 | * ibm,pa-features is a per-cpu property that contains a string of | |
512 | * attribute descriptors, each of which has a 2 byte header plus up | |
513 | * to 254 bytes worth of processor attribute bits. First header | |
514 | * byte specifies the number of bytes following the header. | |
515 | * Second header byte is an "attribute-specifier" type, of which | |
516 | * zero is the only currently-defined value. | |
517 | * Implementation: Pass in the byte and bit offset for the feature | |
518 | * that we are interested in. The function will return -1 if the | |
519 | * pa-features property is missing, or a 1/0 to indicate if the feature | |
520 | * is supported/not supported. Note that the bit numbers are | |
521 | * big-endian to match the definition in PAPR. | |
522 | */ | |
523 | static struct ibm_pa_feature { | |
524 | unsigned long cpu_features; /* CPU_FTR_xxx bit */ | |
525 | unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */ | |
526 | unsigned char pabyte; /* byte number in ibm,pa-features */ | |
527 | unsigned char pabit; /* bit number (big-endian) */ | |
528 | unsigned char invert; /* if 1, pa bit set => clear feature */ | |
529 | } ibm_pa_features[] __initdata = { | |
530 | {0, PPC_FEATURE_HAS_MMU, 0, 0, 0}, | |
531 | {0, PPC_FEATURE_HAS_FPU, 0, 1, 0}, | |
532 | {CPU_FTR_SLB, 0, 0, 2, 0}, | |
533 | {CPU_FTR_CTRL, 0, 0, 3, 0}, | |
534 | {CPU_FTR_NOEXECUTE, 0, 0, 6, 0}, | |
535 | {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1}, | |
bf72aeba PM |
536 | #if 0 |
537 | /* put this back once we know how to test if firmware does 64k IO */ | |
d205819e | 538 | {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0}, |
bf72aeba | 539 | #endif |
339d76c5 | 540 | {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0}, |
d205819e PM |
541 | }; |
542 | ||
974a76f5 PM |
543 | static void __init scan_features(unsigned long node, unsigned char *ftrs, |
544 | unsigned long tablelen, | |
545 | struct ibm_pa_feature *fp, | |
546 | unsigned long ft_size) | |
d205819e | 547 | { |
974a76f5 | 548 | unsigned long i, len, bit; |
d205819e PM |
549 | |
550 | /* find descriptor with type == 0 */ | |
551 | for (;;) { | |
552 | if (tablelen < 3) | |
553 | return; | |
974a76f5 | 554 | len = 2 + ftrs[0]; |
d205819e PM |
555 | if (tablelen < len) |
556 | return; /* descriptor 0 not found */ | |
974a76f5 | 557 | if (ftrs[1] == 0) |
d205819e PM |
558 | break; |
559 | tablelen -= len; | |
974a76f5 | 560 | ftrs += len; |
d205819e PM |
561 | } |
562 | ||
563 | /* loop over bits we know about */ | |
974a76f5 PM |
564 | for (i = 0; i < ft_size; ++i, ++fp) { |
565 | if (fp->pabyte >= ftrs[0]) | |
d205819e | 566 | continue; |
974a76f5 | 567 | bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1; |
d205819e PM |
568 | if (bit ^ fp->invert) { |
569 | cur_cpu_spec->cpu_features |= fp->cpu_features; | |
570 | cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs; | |
571 | } else { | |
572 | cur_cpu_spec->cpu_features &= ~fp->cpu_features; | |
573 | cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs; | |
574 | } | |
575 | } | |
576 | } | |
577 | ||
974a76f5 PM |
578 | static void __init check_cpu_pa_features(unsigned long node) |
579 | { | |
580 | unsigned char *pa_ftrs; | |
581 | unsigned long tablelen; | |
582 | ||
583 | pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen); | |
584 | if (pa_ftrs == NULL) | |
585 | return; | |
586 | ||
587 | scan_features(node, pa_ftrs, tablelen, | |
588 | ibm_pa_features, ARRAY_SIZE(ibm_pa_features)); | |
589 | } | |
590 | ||
591 | static struct feature_property { | |
592 | const char *name; | |
593 | u32 min_value; | |
594 | unsigned long cpu_feature; | |
595 | unsigned long cpu_user_ftr; | |
596 | } feature_properties[] __initdata = { | |
597 | #ifdef CONFIG_ALTIVEC | |
598 | {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC}, | |
599 | {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC}, | |
600 | #endif /* CONFIG_ALTIVEC */ | |
601 | #ifdef CONFIG_PPC64 | |
602 | {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP}, | |
603 | {"ibm,purr", 1, CPU_FTR_PURR, 0}, | |
604 | {"ibm,spurr", 1, CPU_FTR_SPURR, 0}, | |
605 | #endif /* CONFIG_PPC64 */ | |
606 | }; | |
607 | ||
608 | static void __init check_cpu_feature_properties(unsigned long node) | |
609 | { | |
610 | unsigned long i; | |
611 | struct feature_property *fp = feature_properties; | |
612 | const u32 *prop; | |
613 | ||
614 | for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) { | |
615 | prop = of_get_flat_dt_prop(node, fp->name, NULL); | |
616 | if (prop && *prop >= fp->min_value) { | |
617 | cur_cpu_spec->cpu_features |= fp->cpu_feature; | |
618 | cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr; | |
619 | } | |
620 | } | |
621 | } | |
622 | ||
9b6b563c | 623 | static int __init early_init_dt_scan_cpus(unsigned long node, |
4df20460 AB |
624 | const char *uname, int depth, |
625 | void *data) | |
9b6b563c | 626 | { |
4df20460 AB |
627 | static int logical_cpuid = 0; |
628 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); | |
974a76f5 PM |
629 | const u32 *prop; |
630 | const u32 *intserv; | |
4df20460 AB |
631 | int i, nthreads; |
632 | unsigned long len; | |
633 | int found = 0; | |
9b6b563c PM |
634 | |
635 | /* We are scanning "cpu" nodes only */ | |
636 | if (type == NULL || strcmp(type, "cpu") != 0) | |
637 | return 0; | |
638 | ||
4df20460 AB |
639 | /* Get physical cpuid */ |
640 | intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len); | |
641 | if (intserv) { | |
642 | nthreads = len / sizeof(int); | |
9b6b563c | 643 | } else { |
4df20460 AB |
644 | intserv = of_get_flat_dt_prop(node, "reg", NULL); |
645 | nthreads = 1; | |
646 | } | |
647 | ||
648 | /* | |
649 | * Now see if any of these threads match our boot cpu. | |
650 | * NOTE: This must match the parsing done in smp_setup_cpu_maps. | |
651 | */ | |
652 | for (i = 0; i < nthreads; i++) { | |
653 | /* | |
654 | * version 2 of the kexec param format adds the phys cpuid of | |
655 | * booted proc. | |
656 | */ | |
657 | if (initial_boot_params && initial_boot_params->version >= 2) { | |
658 | if (intserv[i] == | |
659 | initial_boot_params->boot_cpuid_phys) { | |
660 | found = 1; | |
661 | break; | |
662 | } | |
663 | } else { | |
664 | /* | |
665 | * Check if it's the boot-cpu, set it's hw index now, | |
666 | * unfortunately this format did not support booting | |
667 | * off secondary threads. | |
668 | */ | |
669 | if (of_get_flat_dt_prop(node, | |
3c726f8d | 670 | "linux,boot-cpu", NULL) != NULL) { |
4df20460 AB |
671 | found = 1; |
672 | break; | |
673 | } | |
9b6b563c | 674 | } |
4df20460 AB |
675 | |
676 | #ifdef CONFIG_SMP | |
677 | /* logical cpu id is always 0 on UP kernels */ | |
678 | logical_cpuid++; | |
679 | #endif | |
680 | } | |
681 | ||
682 | if (found) { | |
683 | DBG("boot cpu: logical %d physical %d\n", logical_cpuid, | |
684 | intserv[i]); | |
685 | boot_cpuid = logical_cpuid; | |
686 | set_hard_smp_processor_id(boot_cpuid, intserv[i]); | |
9b6b563c | 687 | |
974a76f5 PM |
688 | /* |
689 | * PAPR defines "logical" PVR values for cpus that | |
690 | * meet various levels of the architecture: | |
691 | * 0x0f000001 Architecture version 2.04 | |
692 | * 0x0f000002 Architecture version 2.05 | |
693 | * If the cpu-version property in the cpu node contains | |
694 | * such a value, we call identify_cpu again with the | |
695 | * logical PVR value in order to use the cpu feature | |
696 | * bits appropriate for the architecture level. | |
697 | * | |
698 | * A POWER6 partition in "POWER6 architected" mode | |
699 | * uses the 0x0f000002 PVR value; in POWER5+ mode | |
700 | * it uses 0x0f000001. | |
701 | */ | |
702 | prop = of_get_flat_dt_prop(node, "cpu-version", NULL); | |
703 | if (prop && (*prop & 0xff000000) == 0x0f000000) | |
704 | identify_cpu(0, *prop); | |
9b6b563c | 705 | } |
9b6b563c | 706 | |
974a76f5 | 707 | check_cpu_feature_properties(node); |
d205819e PM |
708 | check_cpu_pa_features(node); |
709 | ||
9b6b563c | 710 | #ifdef CONFIG_PPC_PSERIES |
4df20460 | 711 | if (nthreads > 1) |
9b6b563c | 712 | cur_cpu_spec->cpu_features |= CPU_FTR_SMT; |
4df20460 AB |
713 | else |
714 | cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT; | |
9b6b563c PM |
715 | #endif |
716 | ||
717 | return 0; | |
718 | } | |
719 | ||
40472a55 ME |
720 | #ifdef CONFIG_BLK_DEV_INITRD |
721 | static void __init early_init_dt_check_for_initrd(unsigned long node) | |
722 | { | |
723 | unsigned long l; | |
724 | u32 *prop; | |
725 | ||
726 | DBG("Looking for initrd properties... "); | |
727 | ||
728 | prop = of_get_flat_dt_prop(node, "linux,initrd-start", &l); | |
729 | if (prop) { | |
730 | initrd_start = (unsigned long)__va(of_read_ulong(prop, l/4)); | |
731 | ||
732 | prop = of_get_flat_dt_prop(node, "linux,initrd-end", &l); | |
733 | if (prop) { | |
734 | initrd_end = (unsigned long) | |
735 | __va(of_read_ulong(prop, l/4)); | |
736 | initrd_below_start_ok = 1; | |
737 | } else { | |
738 | initrd_start = 0; | |
739 | } | |
740 | } | |
741 | ||
742 | DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end); | |
743 | } | |
744 | #else | |
745 | static inline void early_init_dt_check_for_initrd(unsigned long node) | |
746 | { | |
747 | } | |
748 | #endif /* CONFIG_BLK_DEV_INITRD */ | |
749 | ||
9b6b563c PM |
750 | static int __init early_init_dt_scan_chosen(unsigned long node, |
751 | const char *uname, int depth, void *data) | |
752 | { | |
9b6b563c | 753 | unsigned long *lprop; |
329dda08 KG |
754 | unsigned long l; |
755 | char *p; | |
9b6b563c PM |
756 | |
757 | DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname); | |
758 | ||
a575b807 PM |
759 | if (depth != 1 || |
760 | (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0)) | |
9b6b563c PM |
761 | return 0; |
762 | ||
9b6b563c PM |
763 | #ifdef CONFIG_PPC64 |
764 | /* check if iommu is forced on or off */ | |
3c726f8d | 765 | if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL) |
9b6b563c | 766 | iommu_is_off = 1; |
3c726f8d | 767 | if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL) |
9b6b563c PM |
768 | iommu_force_on = 1; |
769 | #endif | |
770 | ||
2babf5c2 | 771 | /* mem=x on the command line is the preferred mechanism */ |
3c726f8d | 772 | lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL); |
9b6b563c PM |
773 | if (lprop) |
774 | memory_limit = *lprop; | |
775 | ||
776 | #ifdef CONFIG_PPC64 | |
3c726f8d | 777 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL); |
9b6b563c PM |
778 | if (lprop) |
779 | tce_alloc_start = *lprop; | |
3c726f8d | 780 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL); |
9b6b563c PM |
781 | if (lprop) |
782 | tce_alloc_end = *lprop; | |
783 | #endif | |
784 | ||
dcee3036 ME |
785 | #ifdef CONFIG_KEXEC |
786 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL); | |
787 | if (lprop) | |
788 | crashk_res.start = *lprop; | |
789 | ||
790 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL); | |
791 | if (lprop) | |
792 | crashk_res.end = crashk_res.start + *lprop - 1; | |
793 | #endif | |
794 | ||
40472a55 | 795 | early_init_dt_check_for_initrd(node); |
30437b3e | 796 | |
329dda08 KG |
797 | /* Retreive command line */ |
798 | p = of_get_flat_dt_prop(node, "bootargs", &l); | |
799 | if (p != NULL && l > 0) | |
800 | strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE)); | |
801 | ||
802 | #ifdef CONFIG_CMDLINE | |
c1ce464d | 803 | if (p == NULL || l == 0 || (l == 1 && (*p) == 0)) |
329dda08 KG |
804 | strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE); |
805 | #endif /* CONFIG_CMDLINE */ | |
806 | ||
807 | DBG("Command line is: %s\n", cmd_line); | |
808 | ||
9b6b563c PM |
809 | /* break now */ |
810 | return 1; | |
811 | } | |
812 | ||
813 | static int __init early_init_dt_scan_root(unsigned long node, | |
814 | const char *uname, int depth, void *data) | |
815 | { | |
816 | u32 *prop; | |
817 | ||
818 | if (depth != 0) | |
819 | return 0; | |
820 | ||
3c726f8d | 821 | prop = of_get_flat_dt_prop(node, "#size-cells", NULL); |
9b6b563c PM |
822 | dt_root_size_cells = (prop == NULL) ? 1 : *prop; |
823 | DBG("dt_root_size_cells = %x\n", dt_root_size_cells); | |
824 | ||
3c726f8d | 825 | prop = of_get_flat_dt_prop(node, "#address-cells", NULL); |
9b6b563c PM |
826 | dt_root_addr_cells = (prop == NULL) ? 2 : *prop; |
827 | DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells); | |
828 | ||
829 | /* break now */ | |
830 | return 1; | |
831 | } | |
832 | ||
833 | static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp) | |
834 | { | |
835 | cell_t *p = *cellp; | |
9b6b563c | 836 | |
a4dc7ff0 PM |
837 | *cellp = p + s; |
838 | return of_read_ulong(p, s); | |
9b6b563c PM |
839 | } |
840 | ||
0204568a PM |
841 | #ifdef CONFIG_PPC_PSERIES |
842 | /* | |
843 | * Interpret the ibm,dynamic-memory property in the | |
844 | * /ibm,dynamic-reconfiguration-memory node. | |
845 | * This contains a list of memory blocks along with NUMA affinity | |
846 | * information. | |
847 | */ | |
848 | static int __init early_init_dt_scan_drconf_memory(unsigned long node) | |
849 | { | |
850 | cell_t *dm, *ls; | |
851 | unsigned long l, n; | |
852 | unsigned long base, size, lmb_size, flags; | |
853 | ||
854 | ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l); | |
855 | if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t)) | |
856 | return 0; | |
857 | lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls); | |
858 | ||
859 | dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l); | |
860 | if (dm == NULL || l < sizeof(cell_t)) | |
861 | return 0; | |
862 | ||
863 | n = *dm++; /* number of entries */ | |
864 | if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t)) | |
865 | return 0; | |
866 | ||
867 | for (; n != 0; --n) { | |
868 | base = dt_mem_next_cell(dt_root_addr_cells, &dm); | |
869 | flags = dm[3]; | |
870 | /* skip DRC index, pad, assoc. list index, flags */ | |
871 | dm += 4; | |
872 | /* skip this block if the reserved bit is set in flags (0x80) | |
873 | or if the block is not assigned to this partition (0x8) */ | |
874 | if ((flags & 0x80) || !(flags & 0x8)) | |
875 | continue; | |
876 | size = lmb_size; | |
877 | if (iommu_is_off) { | |
878 | if (base >= 0x80000000ul) | |
879 | continue; | |
880 | if ((base + size) > 0x80000000ul) | |
881 | size = 0x80000000ul - base; | |
882 | } | |
883 | lmb_add(base, size); | |
884 | } | |
885 | lmb_dump_all(); | |
886 | return 0; | |
887 | } | |
888 | #else | |
889 | #define early_init_dt_scan_drconf_memory(node) 0 | |
890 | #endif /* CONFIG_PPC_PSERIES */ | |
9b6b563c PM |
891 | |
892 | static int __init early_init_dt_scan_memory(unsigned long node, | |
893 | const char *uname, int depth, void *data) | |
894 | { | |
3c726f8d | 895 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); |
9b6b563c PM |
896 | cell_t *reg, *endp; |
897 | unsigned long l; | |
898 | ||
0204568a PM |
899 | /* Look for the ibm,dynamic-reconfiguration-memory node */ |
900 | if (depth == 1 && | |
901 | strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0) | |
902 | return early_init_dt_scan_drconf_memory(node); | |
903 | ||
9b6b563c | 904 | /* We are scanning "memory" nodes only */ |
a23414be PM |
905 | if (type == NULL) { |
906 | /* | |
907 | * The longtrail doesn't have a device_type on the | |
908 | * /memory node, so look for the node called /memory@0. | |
909 | */ | |
910 | if (depth != 1 || strcmp(uname, "memory@0") != 0) | |
911 | return 0; | |
912 | } else if (strcmp(type, "memory") != 0) | |
9b6b563c PM |
913 | return 0; |
914 | ||
ba759485 ME |
915 | reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l); |
916 | if (reg == NULL) | |
917 | reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l); | |
9b6b563c PM |
918 | if (reg == NULL) |
919 | return 0; | |
920 | ||
921 | endp = reg + (l / sizeof(cell_t)); | |
922 | ||
358c86fd | 923 | DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n", |
9b6b563c PM |
924 | uname, l, reg[0], reg[1], reg[2], reg[3]); |
925 | ||
926 | while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) { | |
927 | unsigned long base, size; | |
928 | ||
929 | base = dt_mem_next_cell(dt_root_addr_cells, ®); | |
930 | size = dt_mem_next_cell(dt_root_size_cells, ®); | |
931 | ||
932 | if (size == 0) | |
933 | continue; | |
934 | DBG(" - %lx , %lx\n", base, size); | |
935 | #ifdef CONFIG_PPC64 | |
936 | if (iommu_is_off) { | |
937 | if (base >= 0x80000000ul) | |
938 | continue; | |
939 | if ((base + size) > 0x80000000ul) | |
940 | size = 0x80000000ul - base; | |
941 | } | |
942 | #endif | |
943 | lmb_add(base, size); | |
944 | } | |
945 | return 0; | |
946 | } | |
947 | ||
948 | static void __init early_reserve_mem(void) | |
949 | { | |
cbbcf340 KG |
950 | u64 base, size; |
951 | u64 *reserve_map; | |
8a300887 JL |
952 | unsigned long self_base; |
953 | unsigned long self_size; | |
9b6b563c | 954 | |
cbbcf340 | 955 | reserve_map = (u64 *)(((unsigned long)initial_boot_params) + |
9b6b563c | 956 | initial_boot_params->off_mem_rsvmap); |
4d1f3f25 JX |
957 | |
958 | /* before we do anything, lets reserve the dt blob */ | |
8a300887 JL |
959 | self_base = __pa((unsigned long)initial_boot_params); |
960 | self_size = initial_boot_params->totalsize; | |
961 | lmb_reserve(self_base, self_size); | |
4d1f3f25 | 962 | |
30437b3e DG |
963 | #ifdef CONFIG_BLK_DEV_INITRD |
964 | /* then reserve the initrd, if any */ | |
965 | if (initrd_start && (initrd_end > initrd_start)) | |
966 | lmb_reserve(__pa(initrd_start), initrd_end - initrd_start); | |
967 | #endif /* CONFIG_BLK_DEV_INITRD */ | |
968 | ||
cbbcf340 KG |
969 | #ifdef CONFIG_PPC32 |
970 | /* | |
971 | * Handle the case where we might be booting from an old kexec | |
972 | * image that setup the mem_rsvmap as pairs of 32-bit values | |
973 | */ | |
974 | if (*reserve_map > 0xffffffffull) { | |
975 | u32 base_32, size_32; | |
976 | u32 *reserve_map_32 = (u32 *)reserve_map; | |
977 | ||
978 | while (1) { | |
979 | base_32 = *(reserve_map_32++); | |
980 | size_32 = *(reserve_map_32++); | |
981 | if (size_32 == 0) | |
982 | break; | |
8a300887 JL |
983 | /* skip if the reservation is for the blob */ |
984 | if (base_32 == self_base && size_32 == self_size) | |
985 | continue; | |
329dda08 | 986 | DBG("reserving: %x -> %x\n", base_32, size_32); |
cbbcf340 KG |
987 | lmb_reserve(base_32, size_32); |
988 | } | |
989 | return; | |
990 | } | |
991 | #endif | |
9b6b563c PM |
992 | while (1) { |
993 | base = *(reserve_map++); | |
994 | size = *(reserve_map++); | |
995 | if (size == 0) | |
996 | break; | |
cbbcf340 | 997 | DBG("reserving: %llx -> %llx\n", base, size); |
9b6b563c PM |
998 | lmb_reserve(base, size); |
999 | } | |
1000 | ||
1001 | #if 0 | |
1002 | DBG("memory reserved, lmbs :\n"); | |
1003 | lmb_dump_all(); | |
1004 | #endif | |
1005 | } | |
1006 | ||
1007 | void __init early_init_devtree(void *params) | |
1008 | { | |
44348105 | 1009 | DBG(" -> early_init_devtree(%p)\n", params); |
9b6b563c PM |
1010 | |
1011 | /* Setup flat device-tree pointer */ | |
1012 | initial_boot_params = params; | |
1013 | ||
458148c0 ME |
1014 | #ifdef CONFIG_PPC_RTAS |
1015 | /* Some machines might need RTAS info for debugging, grab it now. */ | |
1016 | of_scan_flat_dt(early_init_dt_scan_rtas, NULL); | |
1017 | #endif | |
1018 | ||
9b6b563c PM |
1019 | /* Retrieve various informations from the /chosen node of the |
1020 | * device-tree, including the platform type, initrd location and | |
1021 | * size, TCE reserve, and more ... | |
1022 | */ | |
3c726f8d | 1023 | of_scan_flat_dt(early_init_dt_scan_chosen, NULL); |
9b6b563c PM |
1024 | |
1025 | /* Scan memory nodes and rebuild LMBs */ | |
1026 | lmb_init(); | |
3c726f8d BH |
1027 | of_scan_flat_dt(early_init_dt_scan_root, NULL); |
1028 | of_scan_flat_dt(early_init_dt_scan_memory, NULL); | |
846f77b0 ME |
1029 | |
1030 | /* Save command line for /proc/cmdline and then parse parameters */ | |
b8757b21 | 1031 | strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE); |
846f77b0 ME |
1032 | parse_early_param(); |
1033 | ||
9b6b563c | 1034 | /* Reserve LMB regions used by kernel, initrd, dt, etc... */ |
0cc4746c | 1035 | lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START); |
47310413 | 1036 | reserve_kdump_trampoline(); |
35dd5432 | 1037 | reserve_crashkernel(); |
9b6b563c PM |
1038 | early_reserve_mem(); |
1039 | ||
2babf5c2 ME |
1040 | lmb_enforce_memory_limit(memory_limit); |
1041 | lmb_analyze(); | |
1042 | ||
1043 | DBG("Phys. mem: %lx\n", lmb_phys_mem_size()); | |
1044 | ||
1045 | /* We may need to relocate the flat tree, do it now. | |
1046 | * FIXME .. and the initrd too? */ | |
1047 | move_device_tree(); | |
1048 | ||
9b6b563c PM |
1049 | DBG("Scanning CPUs ...\n"); |
1050 | ||
3c726f8d BH |
1051 | /* Retreive CPU related informations from the flat tree |
1052 | * (altivec support, boot CPU ID, ...) | |
9b6b563c | 1053 | */ |
3c726f8d | 1054 | of_scan_flat_dt(early_init_dt_scan_cpus, NULL); |
9b6b563c | 1055 | |
9b6b563c PM |
1056 | DBG(" <- early_init_devtree()\n"); |
1057 | } | |
1058 | ||
9b6b563c | 1059 | |
9b6b563c PM |
1060 | /** |
1061 | * Indicates whether the root node has a given value in its | |
1062 | * compatible property. | |
1063 | */ | |
1064 | int machine_is_compatible(const char *compat) | |
1065 | { | |
1066 | struct device_node *root; | |
1067 | int rc = 0; | |
1068 | ||
1069 | root = of_find_node_by_path("/"); | |
1070 | if (root) { | |
7a92f74f | 1071 | rc = of_device_is_compatible(root, compat); |
9b6b563c PM |
1072 | of_node_put(root); |
1073 | } | |
1074 | return rc; | |
1075 | } | |
1076 | EXPORT_SYMBOL(machine_is_compatible); | |
1077 | ||
9b6b563c PM |
1078 | /******* |
1079 | * | |
1080 | * New implementation of the OF "find" APIs, return a refcounted | |
1081 | * object, call of_node_put() when done. The device tree and list | |
1082 | * are protected by a rw_lock. | |
1083 | * | |
1084 | * Note that property management will need some locking as well, | |
1085 | * this isn't dealt with yet. | |
1086 | * | |
1087 | *******/ | |
1088 | ||
1089 | /** | |
1090 | * of_find_node_by_name - Find a node by its "name" property | |
1091 | * @from: The node to start searching from or NULL, the node | |
1092 | * you pass will not be searched, only the next one | |
1093 | * will; typically, you pass what the previous call | |
1094 | * returned. of_node_put() will be called on it | |
1095 | * @name: The name string to match against | |
1096 | * | |
1097 | * Returns a node pointer with refcount incremented, use | |
1098 | * of_node_put() on it when done. | |
1099 | */ | |
1100 | struct device_node *of_find_node_by_name(struct device_node *from, | |
1101 | const char *name) | |
1102 | { | |
1103 | struct device_node *np; | |
1104 | ||
1105 | read_lock(&devtree_lock); | |
1106 | np = from ? from->allnext : allnodes; | |
090db7c8 OH |
1107 | for (; np != NULL; np = np->allnext) |
1108 | if (np->name != NULL && strcasecmp(np->name, name) == 0 | |
9b6b563c PM |
1109 | && of_node_get(np)) |
1110 | break; | |
b1374051 | 1111 | of_node_put(from); |
9b6b563c PM |
1112 | read_unlock(&devtree_lock); |
1113 | return np; | |
1114 | } | |
1115 | EXPORT_SYMBOL(of_find_node_by_name); | |
1116 | ||
1117 | /** | |
1118 | * of_find_node_by_type - Find a node by its "device_type" property | |
5169b8a1 ME |
1119 | * @from: The node to start searching from, or NULL to start searching |
1120 | * the entire device tree. The node you pass will not be | |
1121 | * searched, only the next one will; typically, you pass | |
1122 | * what the previous call returned. of_node_put() will be | |
1123 | * called on from for you. | |
1124 | * @type: The type string to match against | |
9b6b563c PM |
1125 | * |
1126 | * Returns a node pointer with refcount incremented, use | |
1127 | * of_node_put() on it when done. | |
1128 | */ | |
1129 | struct device_node *of_find_node_by_type(struct device_node *from, | |
1130 | const char *type) | |
1131 | { | |
1132 | struct device_node *np; | |
1133 | ||
1134 | read_lock(&devtree_lock); | |
1135 | np = from ? from->allnext : allnodes; | |
1136 | for (; np != 0; np = np->allnext) | |
1137 | if (np->type != 0 && strcasecmp(np->type, type) == 0 | |
1138 | && of_node_get(np)) | |
1139 | break; | |
b1374051 | 1140 | of_node_put(from); |
9b6b563c PM |
1141 | read_unlock(&devtree_lock); |
1142 | return np; | |
1143 | } | |
1144 | EXPORT_SYMBOL(of_find_node_by_type); | |
1145 | ||
1146 | /** | |
1147 | * of_find_compatible_node - Find a node based on type and one of the | |
1148 | * tokens in its "compatible" property | |
1149 | * @from: The node to start searching from or NULL, the node | |
1150 | * you pass will not be searched, only the next one | |
1151 | * will; typically, you pass what the previous call | |
1152 | * returned. of_node_put() will be called on it | |
1153 | * @type: The type string to match "device_type" or NULL to ignore | |
1154 | * @compatible: The string to match to one of the tokens in the device | |
1155 | * "compatible" list. | |
1156 | * | |
1157 | * Returns a node pointer with refcount incremented, use | |
1158 | * of_node_put() on it when done. | |
1159 | */ | |
1160 | struct device_node *of_find_compatible_node(struct device_node *from, | |
1161 | const char *type, const char *compatible) | |
1162 | { | |
1163 | struct device_node *np; | |
1164 | ||
1165 | read_lock(&devtree_lock); | |
1166 | np = from ? from->allnext : allnodes; | |
1167 | for (; np != 0; np = np->allnext) { | |
1168 | if (type != NULL | |
1169 | && !(np->type != 0 && strcasecmp(np->type, type) == 0)) | |
1170 | continue; | |
7a92f74f | 1171 | if (of_device_is_compatible(np, compatible) && of_node_get(np)) |
9b6b563c PM |
1172 | break; |
1173 | } | |
b1374051 | 1174 | of_node_put(from); |
9b6b563c PM |
1175 | read_unlock(&devtree_lock); |
1176 | return np; | |
1177 | } | |
1178 | EXPORT_SYMBOL(of_find_compatible_node); | |
1179 | ||
1180 | /** | |
1181 | * of_find_node_by_path - Find a node matching a full OF path | |
1182 | * @path: The full path to match | |
1183 | * | |
1184 | * Returns a node pointer with refcount incremented, use | |
1185 | * of_node_put() on it when done. | |
1186 | */ | |
1187 | struct device_node *of_find_node_by_path(const char *path) | |
1188 | { | |
1189 | struct device_node *np = allnodes; | |
1190 | ||
1191 | read_lock(&devtree_lock); | |
1192 | for (; np != 0; np = np->allnext) { | |
1193 | if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0 | |
1194 | && of_node_get(np)) | |
1195 | break; | |
1196 | } | |
1197 | read_unlock(&devtree_lock); | |
1198 | return np; | |
1199 | } | |
1200 | EXPORT_SYMBOL(of_find_node_by_path); | |
1201 | ||
1202 | /** | |
1203 | * of_find_node_by_phandle - Find a node given a phandle | |
1204 | * @handle: phandle of the node to find | |
1205 | * | |
1206 | * Returns a node pointer with refcount incremented, use | |
1207 | * of_node_put() on it when done. | |
1208 | */ | |
1209 | struct device_node *of_find_node_by_phandle(phandle handle) | |
1210 | { | |
1211 | struct device_node *np; | |
1212 | ||
1213 | read_lock(&devtree_lock); | |
1214 | for (np = allnodes; np != 0; np = np->allnext) | |
1215 | if (np->linux_phandle == handle) | |
1216 | break; | |
b1374051 | 1217 | of_node_get(np); |
9b6b563c PM |
1218 | read_unlock(&devtree_lock); |
1219 | return np; | |
1220 | } | |
1221 | EXPORT_SYMBOL(of_find_node_by_phandle); | |
1222 | ||
1223 | /** | |
1224 | * of_find_all_nodes - Get next node in global list | |
1225 | * @prev: Previous node or NULL to start iteration | |
1226 | * of_node_put() will be called on it | |
1227 | * | |
1228 | * Returns a node pointer with refcount incremented, use | |
1229 | * of_node_put() on it when done. | |
1230 | */ | |
1231 | struct device_node *of_find_all_nodes(struct device_node *prev) | |
1232 | { | |
1233 | struct device_node *np; | |
1234 | ||
1235 | read_lock(&devtree_lock); | |
1236 | np = prev ? prev->allnext : allnodes; | |
1237 | for (; np != 0; np = np->allnext) | |
1238 | if (of_node_get(np)) | |
1239 | break; | |
b1374051 | 1240 | of_node_put(prev); |
9b6b563c PM |
1241 | read_unlock(&devtree_lock); |
1242 | return np; | |
1243 | } | |
1244 | EXPORT_SYMBOL(of_find_all_nodes); | |
1245 | ||
1246 | /** | |
1247 | * of_get_parent - Get a node's parent if any | |
1248 | * @node: Node to get parent | |
1249 | * | |
1250 | * Returns a node pointer with refcount incremented, use | |
1251 | * of_node_put() on it when done. | |
1252 | */ | |
1253 | struct device_node *of_get_parent(const struct device_node *node) | |
1254 | { | |
1255 | struct device_node *np; | |
1256 | ||
1257 | if (!node) | |
1258 | return NULL; | |
1259 | ||
1260 | read_lock(&devtree_lock); | |
1261 | np = of_node_get(node->parent); | |
1262 | read_unlock(&devtree_lock); | |
1263 | return np; | |
1264 | } | |
1265 | EXPORT_SYMBOL(of_get_parent); | |
1266 | ||
1267 | /** | |
1268 | * of_get_next_child - Iterate a node childs | |
1269 | * @node: parent node | |
1270 | * @prev: previous child of the parent node, or NULL to get first | |
1271 | * | |
1272 | * Returns a node pointer with refcount incremented, use | |
1273 | * of_node_put() on it when done. | |
1274 | */ | |
1275 | struct device_node *of_get_next_child(const struct device_node *node, | |
1276 | struct device_node *prev) | |
1277 | { | |
1278 | struct device_node *next; | |
1279 | ||
1280 | read_lock(&devtree_lock); | |
1281 | next = prev ? prev->sibling : node->child; | |
1282 | for (; next != 0; next = next->sibling) | |
1283 | if (of_node_get(next)) | |
1284 | break; | |
b1374051 | 1285 | of_node_put(prev); |
9b6b563c PM |
1286 | read_unlock(&devtree_lock); |
1287 | return next; | |
1288 | } | |
1289 | EXPORT_SYMBOL(of_get_next_child); | |
1290 | ||
1291 | /** | |
1292 | * of_node_get - Increment refcount of a node | |
1293 | * @node: Node to inc refcount, NULL is supported to | |
1294 | * simplify writing of callers | |
1295 | * | |
1296 | * Returns node. | |
1297 | */ | |
1298 | struct device_node *of_node_get(struct device_node *node) | |
1299 | { | |
1300 | if (node) | |
1301 | kref_get(&node->kref); | |
1302 | return node; | |
1303 | } | |
1304 | EXPORT_SYMBOL(of_node_get); | |
1305 | ||
1306 | static inline struct device_node * kref_to_device_node(struct kref *kref) | |
1307 | { | |
1308 | return container_of(kref, struct device_node, kref); | |
1309 | } | |
1310 | ||
1311 | /** | |
1312 | * of_node_release - release a dynamically allocated node | |
1313 | * @kref: kref element of the node to be released | |
1314 | * | |
1315 | * In of_node_put() this function is passed to kref_put() | |
1316 | * as the destructor. | |
1317 | */ | |
1318 | static void of_node_release(struct kref *kref) | |
1319 | { | |
1320 | struct device_node *node = kref_to_device_node(kref); | |
1321 | struct property *prop = node->properties; | |
1322 | ||
6a281856 ME |
1323 | /* We should never be releasing nodes that haven't been detached. */ |
1324 | if (!of_node_check_flag(node, OF_DETACHED)) { | |
1325 | printk("WARNING: Bad of_node_put() on %s\n", node->full_name); | |
1326 | dump_stack(); | |
1327 | kref_init(&node->kref); | |
1328 | return; | |
1329 | } | |
1330 | ||
d3b814bb | 1331 | if (!of_node_check_flag(node, OF_DYNAMIC)) |
9b6b563c | 1332 | return; |
6a281856 | 1333 | |
9b6b563c PM |
1334 | while (prop) { |
1335 | struct property *next = prop->next; | |
1336 | kfree(prop->name); | |
1337 | kfree(prop->value); | |
1338 | kfree(prop); | |
1339 | prop = next; | |
088186de DB |
1340 | |
1341 | if (!prop) { | |
1342 | prop = node->deadprops; | |
1343 | node->deadprops = NULL; | |
1344 | } | |
9b6b563c | 1345 | } |
9b6b563c PM |
1346 | kfree(node->full_name); |
1347 | kfree(node->data); | |
1348 | kfree(node); | |
1349 | } | |
1350 | ||
1351 | /** | |
1352 | * of_node_put - Decrement refcount of a node | |
1353 | * @node: Node to dec refcount, NULL is supported to | |
1354 | * simplify writing of callers | |
1355 | * | |
1356 | */ | |
1357 | void of_node_put(struct device_node *node) | |
1358 | { | |
1359 | if (node) | |
1360 | kref_put(&node->kref, of_node_release); | |
1361 | } | |
1362 | EXPORT_SYMBOL(of_node_put); | |
1363 | ||
1364 | /* | |
1365 | * Plug a device node into the tree and global list. | |
1366 | */ | |
1367 | void of_attach_node(struct device_node *np) | |
1368 | { | |
1369 | write_lock(&devtree_lock); | |
1370 | np->sibling = np->parent->child; | |
1371 | np->allnext = allnodes; | |
1372 | np->parent->child = np; | |
1373 | allnodes = np; | |
1374 | write_unlock(&devtree_lock); | |
1375 | } | |
1376 | ||
1377 | /* | |
1378 | * "Unplug" a node from the device tree. The caller must hold | |
1379 | * a reference to the node. The memory associated with the node | |
1380 | * is not freed until its refcount goes to zero. | |
1381 | */ | |
1382 | void of_detach_node(const struct device_node *np) | |
1383 | { | |
1384 | struct device_node *parent; | |
1385 | ||
1386 | write_lock(&devtree_lock); | |
1387 | ||
1388 | parent = np->parent; | |
972d17c9 ME |
1389 | if (!parent) |
1390 | goto out_unlock; | |
9b6b563c PM |
1391 | |
1392 | if (allnodes == np) | |
1393 | allnodes = np->allnext; | |
1394 | else { | |
1395 | struct device_node *prev; | |
1396 | for (prev = allnodes; | |
1397 | prev->allnext != np; | |
1398 | prev = prev->allnext) | |
1399 | ; | |
1400 | prev->allnext = np->allnext; | |
1401 | } | |
1402 | ||
1403 | if (parent->child == np) | |
1404 | parent->child = np->sibling; | |
1405 | else { | |
1406 | struct device_node *prevsib; | |
1407 | for (prevsib = np->parent->child; | |
1408 | prevsib->sibling != np; | |
1409 | prevsib = prevsib->sibling) | |
1410 | ; | |
1411 | prevsib->sibling = np->sibling; | |
1412 | } | |
1413 | ||
6a281856 ME |
1414 | of_node_set_flag(np, OF_DETACHED); |
1415 | ||
972d17c9 | 1416 | out_unlock: |
9b6b563c PM |
1417 | write_unlock(&devtree_lock); |
1418 | } | |
1419 | ||
1420 | #ifdef CONFIG_PPC_PSERIES | |
1421 | /* | |
1422 | * Fix up the uninitialized fields in a new device node: | |
0ebfff14 | 1423 | * name, type and pci-specific fields |
9b6b563c PM |
1424 | */ |
1425 | ||
cc5d0189 | 1426 | static int of_finish_dynamic_node(struct device_node *node) |
9b6b563c PM |
1427 | { |
1428 | struct device_node *parent = of_get_parent(node); | |
1429 | int err = 0; | |
a7f67bdf | 1430 | const phandle *ibm_phandle; |
9b6b563c | 1431 | |
0e56efc7 SR |
1432 | node->name = of_get_property(node, "name", NULL); |
1433 | node->type = of_get_property(node, "device_type", NULL); | |
9b6b563c | 1434 | |
847f5976 BH |
1435 | if (!node->name) |
1436 | node->name = "<NULL>"; | |
1437 | if (!node->type) | |
1438 | node->type = "<NULL>"; | |
1439 | ||
9b6b563c PM |
1440 | if (!parent) { |
1441 | err = -ENODEV; | |
1442 | goto out; | |
1443 | } | |
1444 | ||
1445 | /* We don't support that function on PowerMac, at least | |
1446 | * not yet | |
1447 | */ | |
e8222502 | 1448 | if (machine_is(powermac)) |
9b6b563c PM |
1449 | return -ENODEV; |
1450 | ||
1451 | /* fix up new node's linux_phandle field */ | |
0e56efc7 | 1452 | if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL))) |
9b6b563c PM |
1453 | node->linux_phandle = *ibm_phandle; |
1454 | ||
1455 | out: | |
1456 | of_node_put(parent); | |
1457 | return err; | |
1458 | } | |
1459 | ||
1460 | static int prom_reconfig_notifier(struct notifier_block *nb, | |
1461 | unsigned long action, void *node) | |
1462 | { | |
1463 | int err; | |
1464 | ||
1465 | switch (action) { | |
1466 | case PSERIES_RECONFIG_ADD: | |
cc5d0189 | 1467 | err = of_finish_dynamic_node(node); |
9b6b563c PM |
1468 | if (err < 0) { |
1469 | printk(KERN_ERR "finish_node returned %d\n", err); | |
1470 | err = NOTIFY_BAD; | |
1471 | } | |
1472 | break; | |
1473 | default: | |
1474 | err = NOTIFY_DONE; | |
1475 | break; | |
1476 | } | |
1477 | return err; | |
1478 | } | |
1479 | ||
1480 | static struct notifier_block prom_reconfig_nb = { | |
1481 | .notifier_call = prom_reconfig_notifier, | |
1482 | .priority = 10, /* This one needs to run first */ | |
1483 | }; | |
1484 | ||
1485 | static int __init prom_reconfig_setup(void) | |
1486 | { | |
1487 | return pSeries_reconfig_notifier_register(&prom_reconfig_nb); | |
1488 | } | |
1489 | __initcall(prom_reconfig_setup); | |
1490 | #endif | |
1491 | ||
e2100efb BH |
1492 | struct property *of_find_property(const struct device_node *np, |
1493 | const char *name, | |
ecaa8b0f | 1494 | int *lenp) |
9b6b563c PM |
1495 | { |
1496 | struct property *pp; | |
1497 | ||
088186de | 1498 | read_lock(&devtree_lock); |
9b6b563c PM |
1499 | for (pp = np->properties; pp != 0; pp = pp->next) |
1500 | if (strcmp(pp->name, name) == 0) { | |
1501 | if (lenp != 0) | |
1502 | *lenp = pp->length; | |
088186de | 1503 | break; |
9b6b563c | 1504 | } |
088186de DB |
1505 | read_unlock(&devtree_lock); |
1506 | ||
ecaa8b0f DB |
1507 | return pp; |
1508 | } | |
ae50517e | 1509 | EXPORT_SYMBOL(of_find_property); |
ecaa8b0f | 1510 | |
9b6b563c PM |
1511 | /* |
1512 | * Add a property to a node | |
1513 | */ | |
183d0202 | 1514 | int prom_add_property(struct device_node* np, struct property* prop) |
9b6b563c | 1515 | { |
183d0202 | 1516 | struct property **next; |
9b6b563c PM |
1517 | |
1518 | prop->next = NULL; | |
183d0202 BH |
1519 | write_lock(&devtree_lock); |
1520 | next = &np->properties; | |
1521 | while (*next) { | |
1522 | if (strcmp(prop->name, (*next)->name) == 0) { | |
1523 | /* duplicate ! don't insert it */ | |
1524 | write_unlock(&devtree_lock); | |
1525 | return -1; | |
1526 | } | |
9b6b563c | 1527 | next = &(*next)->next; |
183d0202 | 1528 | } |
9b6b563c | 1529 | *next = prop; |
183d0202 BH |
1530 | write_unlock(&devtree_lock); |
1531 | ||
799d6046 | 1532 | #ifdef CONFIG_PROC_DEVICETREE |
183d0202 BH |
1533 | /* try to add to proc as well if it was initialized */ |
1534 | if (np->pde) | |
1535 | proc_device_tree_add_prop(np->pde, prop); | |
799d6046 | 1536 | #endif /* CONFIG_PROC_DEVICETREE */ |
183d0202 BH |
1537 | |
1538 | return 0; | |
9b6b563c PM |
1539 | } |
1540 | ||
088186de DB |
1541 | /* |
1542 | * Remove a property from a node. Note that we don't actually | |
1543 | * remove it, since we have given out who-knows-how-many pointers | |
1544 | * to the data using get-property. Instead we just move the property | |
1545 | * to the "dead properties" list, so it won't be found any more. | |
1546 | */ | |
1547 | int prom_remove_property(struct device_node *np, struct property *prop) | |
1548 | { | |
1549 | struct property **next; | |
1550 | int found = 0; | |
1551 | ||
1552 | write_lock(&devtree_lock); | |
1553 | next = &np->properties; | |
1554 | while (*next) { | |
1555 | if (*next == prop) { | |
1556 | /* found the node */ | |
1557 | *next = prop->next; | |
1558 | prop->next = np->deadprops; | |
1559 | np->deadprops = prop; | |
1560 | found = 1; | |
1561 | break; | |
1562 | } | |
1563 | next = &(*next)->next; | |
1564 | } | |
1565 | write_unlock(&devtree_lock); | |
1566 | ||
1567 | if (!found) | |
1568 | return -ENODEV; | |
1569 | ||
1570 | #ifdef CONFIG_PROC_DEVICETREE | |
1571 | /* try to remove the proc node as well */ | |
1572 | if (np->pde) | |
1573 | proc_device_tree_remove_prop(np->pde, prop); | |
1574 | #endif /* CONFIG_PROC_DEVICETREE */ | |
1575 | ||
1576 | return 0; | |
1577 | } | |
1578 | ||
1579 | /* | |
1580 | * Update a property in a node. Note that we don't actually | |
1581 | * remove it, since we have given out who-knows-how-many pointers | |
1582 | * to the data using get-property. Instead we just move the property | |
1583 | * to the "dead properties" list, and add the new property to the | |
1584 | * property list | |
1585 | */ | |
1586 | int prom_update_property(struct device_node *np, | |
1587 | struct property *newprop, | |
1588 | struct property *oldprop) | |
1589 | { | |
1590 | struct property **next; | |
1591 | int found = 0; | |
1592 | ||
1593 | write_lock(&devtree_lock); | |
1594 | next = &np->properties; | |
1595 | while (*next) { | |
1596 | if (*next == oldprop) { | |
1597 | /* found the node */ | |
1598 | newprop->next = oldprop->next; | |
1599 | *next = newprop; | |
1600 | oldprop->next = np->deadprops; | |
1601 | np->deadprops = oldprop; | |
1602 | found = 1; | |
1603 | break; | |
1604 | } | |
1605 | next = &(*next)->next; | |
1606 | } | |
1607 | write_unlock(&devtree_lock); | |
1608 | ||
1609 | if (!found) | |
1610 | return -ENODEV; | |
9b6b563c | 1611 | |
088186de DB |
1612 | #ifdef CONFIG_PROC_DEVICETREE |
1613 | /* try to add to proc as well if it was initialized */ | |
1614 | if (np->pde) | |
1615 | proc_device_tree_update_prop(np->pde, newprop, oldprop); | |
1616 | #endif /* CONFIG_PROC_DEVICETREE */ | |
1617 | ||
1618 | return 0; | |
1619 | } | |
b68239ee | 1620 | |
acf7d768 BH |
1621 | |
1622 | /* Find the device node for a given logical cpu number, also returns the cpu | |
1623 | * local thread number (index in ibm,interrupt-server#s) if relevant and | |
1624 | * asked for (non NULL) | |
1625 | */ | |
1626 | struct device_node *of_get_cpu_node(int cpu, unsigned int *thread) | |
1627 | { | |
1628 | int hardid; | |
1629 | struct device_node *np; | |
1630 | ||
1631 | hardid = get_hard_smp_processor_id(cpu); | |
1632 | ||
1633 | for_each_node_by_type(np, "cpu") { | |
a7f67bdf | 1634 | const u32 *intserv; |
acf7d768 BH |
1635 | unsigned int plen, t; |
1636 | ||
1637 | /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist | |
1638 | * fallback to "reg" property and assume no threads | |
1639 | */ | |
0e56efc7 | 1640 | intserv = of_get_property(np, "ibm,ppc-interrupt-server#s", |
a7f67bdf | 1641 | &plen); |
acf7d768 | 1642 | if (intserv == NULL) { |
0e56efc7 | 1643 | const u32 *reg = of_get_property(np, "reg", NULL); |
acf7d768 BH |
1644 | if (reg == NULL) |
1645 | continue; | |
1646 | if (*reg == hardid) { | |
1647 | if (thread) | |
1648 | *thread = 0; | |
1649 | return np; | |
1650 | } | |
1651 | } else { | |
1652 | plen /= sizeof(u32); | |
1653 | for (t = 0; t < plen; t++) { | |
1654 | if (hardid == intserv[t]) { | |
1655 | if (thread) | |
1656 | *thread = t; | |
1657 | return np; | |
1658 | } | |
1659 | } | |
1660 | } | |
1661 | } | |
1662 | return NULL; | |
1663 | } | |
36ca4ba4 | 1664 | EXPORT_SYMBOL(of_get_cpu_node); |
7a4571ae | 1665 | |
94a3807c | 1666 | #if defined(CONFIG_DEBUG_FS) && defined(DEBUG) |
7a4571ae ME |
1667 | static struct debugfs_blob_wrapper flat_dt_blob; |
1668 | ||
1669 | static int __init export_flat_device_tree(void) | |
1670 | { | |
1671 | struct dentry *d; | |
1672 | ||
7a4571ae ME |
1673 | flat_dt_blob.data = initial_boot_params; |
1674 | flat_dt_blob.size = initial_boot_params->totalsize; | |
1675 | ||
1676 | d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR, | |
94a3807c | 1677 | powerpc_debugfs_root, &flat_dt_blob); |
7a4571ae ME |
1678 | if (!d) |
1679 | return 1; | |
1680 | ||
1681 | return 0; | |
1682 | } | |
1683 | __initcall(export_flat_device_tree); | |
1684 | #endif |