Start split out of common open firmware code
[usb.git] / arch / powerpc / kernel / prom.c
blob6c9419a4d70ad531ad37e7e5062cf3b226728bac
1 /*
2 * Procedures for creating, accessing and interpreting the device tree.
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
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.
16 #undef DEBUG
18 #include <stdarg.h>
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>
31 #include <linux/kexec.h>
32 #include <linux/debugfs.h>
33 #include <linux/irq.h>
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>
42 #include <asm/kdump.h>
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>
53 #include <asm/pci-bridge.h>
54 #include <asm/kexec.h>
55 #include <asm/system.h>
57 #ifdef DEBUG
58 #define DBG(fmt...) printk(KERN_ERR fmt)
59 #else
60 #define DBG(fmt...)
61 #endif
64 static int __initdata dt_root_addr_cells;
65 static int __initdata dt_root_size_cells;
67 #ifdef CONFIG_PPC64
68 int __initdata iommu_is_off;
69 int __initdata iommu_force_on;
70 unsigned long tce_alloc_start, tce_alloc_end;
71 #endif
73 typedef u32 cell_t;
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
81 static struct device_node *allnodes = NULL;
83 /* use when traversing tree through the allnext, child, sibling,
84 * or parent members of struct device_node.
86 static DEFINE_RWLOCK(devtree_lock);
88 /* export that to outside world */
89 struct device_node *of_chosen;
91 static inline char *find_flat_dt_string(u32 offset)
93 return ((char *)initial_boot_params) +
94 initial_boot_params->off_dt_strings + offset;
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
102 int __init of_scan_flat_dt(int (*it)(unsigned long node,
103 const char *uname, int depth,
104 void *data),
105 void *data)
107 unsigned long p = ((unsigned long)initial_boot_params) +
108 initial_boot_params->off_dt_struct;
109 int rc = 0;
110 int depth = -1;
112 do {
113 u32 tag = *((u32 *)p);
114 char *pathp;
116 p += 4;
117 if (tag == OF_DT_END_NODE) {
118 depth --;
119 continue;
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;
134 if (tag != OF_DT_BEGIN_NODE) {
135 printk(KERN_WARNING "Invalid tag %x scanning flattened"
136 " device tree !\n", tag);
137 return -EINVAL;
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;
150 rc = it(p, pathp, depth, data);
151 if (rc != 0)
152 break;
153 } while(1);
155 return rc;
158 unsigned long __init of_get_flat_dt_root(void)
160 unsigned long p = ((unsigned long)initial_boot_params) +
161 initial_boot_params->off_dt_struct;
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);
171 * This function can be used within scan_flattened_dt callback to get
172 * access to properties
174 void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
175 unsigned long *size)
177 unsigned long p = node;
179 do {
180 u32 tag = *((u32 *)p);
181 u32 sz, noff;
182 const char *nstr;
184 p += 4;
185 if (tag == OF_DT_NOP)
186 continue;
187 if (tag != OF_DT_PROP)
188 return NULL;
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);
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;
202 if (strcmp(name, nstr) == 0) {
203 if (size)
204 *size = sz;
205 return (void *)p;
207 p += sz;
208 p = _ALIGN(p, 4);
209 } while(1);
212 int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
214 const char* cp;
215 unsigned long cplen, l;
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;
228 return 0;
231 static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
232 unsigned long align)
234 void *res;
236 *mem = _ALIGN(*mem, align);
237 res = (void *)*mem;
238 *mem += size;
240 return res;
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)
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;
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;
262 *p += 4;
263 pathp = (char *)*p;
264 l = allocl = strlen(pathp) + 1;
265 *p = _ALIGN(*p + l, 4);
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 '/'.
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
280 fpsize = 1;
281 allocl = 2;
282 } else {
283 /* account for '/' and path size minus terminal 0
284 * already in 'l'
286 fpsize += l;
287 allocl = fpsize;
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",
305 pathp, (int)strlen(p), l, allocl);
307 #endif
308 p += strlen(p);
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;
326 kref_init(&np->kref);
328 while(1) {
329 u32 sz, noff;
330 char *pname;
332 tag = *((u32 *)(*p));
333 if (tag == OF_DT_NOP) {
334 *p += 4;
335 continue;
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);
346 pname = find_flat_dt_string(noff);
347 if (pname == NULL) {
348 printk("Can't find property name in list !\n");
349 break;
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;
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;
370 *p = _ALIGN((*p) + sz, 4);
372 /* with version 0x10 we may not have the name property, recreate
373 * it here from the unit name if absent
375 if (!has_name) {
376 char *p = pathp, *ps = pathp, *pa = NULL;
377 int sz;
379 while (*p) {
380 if ((*p) == '@')
381 pa = p;
382 if ((*p) == '/')
383 ps = p + 1;
384 p++;
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;
394 pp->value = pp + 1;
395 *prev_pp = pp;
396 prev_pp = &pp->next;
397 memcpy(pp->value, ps, sz - 1);
398 ((char *)pp->value)[sz - 1] = 0;
399 DBG("fixed up name for %s -> %s\n", pathp,
400 (char *)pp->value);
403 if (allnextpp) {
404 *prev_pp = NULL;
405 np->name = of_get_property(np, "name", NULL);
406 np->type = of_get_property(np, "device_type", NULL);
408 if (!np->name)
409 np->name = "<NULL>";
410 if (!np->type)
411 np->type = "<NULL>";
413 while (tag == OF_DT_BEGIN_NODE) {
414 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
415 tag = *((u32 *)(*p));
417 if (tag != OF_DT_END_NODE) {
418 printk("Weird tag at end of node: %x\n", tag);
419 return mem;
421 *p += 4;
422 return mem;
425 static int __init early_parse_mem(char *p)
427 if (!p)
428 return 1;
430 memory_limit = PAGE_ALIGN(memparse(p, &p));
431 DBG("memory limit = 0x%lx\n", memory_limit);
433 return 0;
435 early_param("mem", early_parse_mem);
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.
441 static void move_device_tree(void)
443 unsigned long start, size;
444 void *p;
446 DBG("-> move_device_tree\n");
448 start = __pa(initial_boot_params);
449 size = initial_boot_params->totalsize;
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);
459 DBG("<- move_device_tree\n");
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)
468 void __init unflatten_device_tree(void)
470 unsigned long start, mem, size;
471 struct device_node **allnextp = &allnodes;
473 DBG(" -> unflatten_device_tree()\n");
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;
481 DBG(" size is %lx, allocating...\n", size);
483 /* Allocate memory for the expanded device tree */
484 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
485 mem = (unsigned long) __va(mem);
487 ((u32 *)mem)[size / 4] = 0xdeadbeef;
489 DBG(" unflattening %lx...\n", mem);
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;
502 /* Get pointer to OF "/chosen" node for use everywhere */
503 of_chosen = of_find_node_by_path("/chosen");
504 if (of_chosen == NULL)
505 of_chosen = of_find_node_by_path("/chosen@0");
507 DBG(" <- unflatten_device_tree()\n");
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.
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},
536 #if 0
537 /* put this back once we know how to test if firmware does 64k IO */
538 {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0},
539 #endif
540 {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0},
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)
548 unsigned long i, len, bit;
550 /* find descriptor with type == 0 */
551 for (;;) {
552 if (tablelen < 3)
553 return;
554 len = 2 + ftrs[0];
555 if (tablelen < len)
556 return; /* descriptor 0 not found */
557 if (ftrs[1] == 0)
558 break;
559 tablelen -= len;
560 ftrs += len;
563 /* loop over bits we know about */
564 for (i = 0; i < ft_size; ++i, ++fp) {
565 if (fp->pabyte >= ftrs[0])
566 continue;
567 bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1;
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;
578 static void __init check_cpu_pa_features(unsigned long node)
580 unsigned char *pa_ftrs;
581 unsigned long tablelen;
583 pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen);
584 if (pa_ftrs == NULL)
585 return;
587 scan_features(node, pa_ftrs, tablelen,
588 ibm_pa_features, ARRAY_SIZE(ibm_pa_features));
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 */
608 static void __init check_cpu_feature_properties(unsigned long node)
610 unsigned long i;
611 struct feature_property *fp = feature_properties;
612 const u32 *prop;
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;
623 static int __init early_init_dt_scan_cpus(unsigned long node,
624 const char *uname, int depth,
625 void *data)
627 static int logical_cpuid = 0;
628 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
629 const u32 *prop;
630 const u32 *intserv;
631 int i, nthreads;
632 unsigned long len;
633 int found = 0;
635 /* We are scanning "cpu" nodes only */
636 if (type == NULL || strcmp(type, "cpu") != 0)
637 return 0;
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);
643 } else {
644 intserv = of_get_flat_dt_prop(node, "reg", NULL);
645 nthreads = 1;
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.
652 for (i = 0; i < nthreads; i++) {
654 * version 2 of the kexec param format adds the phys cpuid of
655 * booted proc.
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;
663 } else {
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.
669 if (of_get_flat_dt_prop(node,
670 "linux,boot-cpu", NULL) != NULL) {
671 found = 1;
672 break;
676 #ifdef CONFIG_SMP
677 /* logical cpu id is always 0 on UP kernels */
678 logical_cpuid++;
679 #endif
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]);
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.
698 * A POWER6 partition in "POWER6 architected" mode
699 * uses the 0x0f000002 PVR value; in POWER5+ mode
700 * it uses 0x0f000001.
702 prop = of_get_flat_dt_prop(node, "cpu-version", NULL);
703 if (prop && (*prop & 0xff000000) == 0x0f000000)
704 identify_cpu(0, *prop);
707 check_cpu_feature_properties(node);
708 check_cpu_pa_features(node);
710 #ifdef CONFIG_PPC_PSERIES
711 if (nthreads > 1)
712 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
713 else
714 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
715 #endif
717 return 0;
720 #ifdef CONFIG_BLK_DEV_INITRD
721 static void __init early_init_dt_check_for_initrd(unsigned long node)
723 unsigned long l;
724 u32 *prop;
726 DBG("Looking for initrd properties... ");
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));
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;
742 DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end);
744 #else
745 static inline void early_init_dt_check_for_initrd(unsigned long node)
748 #endif /* CONFIG_BLK_DEV_INITRD */
750 static int __init early_init_dt_scan_chosen(unsigned long node,
751 const char *uname, int depth, void *data)
753 unsigned long *lprop;
754 unsigned long l;
755 char *p;
757 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
759 if (depth != 1 ||
760 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
761 return 0;
763 #ifdef CONFIG_PPC64
764 /* check if iommu is forced on or off */
765 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
766 iommu_is_off = 1;
767 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
768 iommu_force_on = 1;
769 #endif
771 /* mem=x on the command line is the preferred mechanism */
772 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
773 if (lprop)
774 memory_limit = *lprop;
776 #ifdef CONFIG_PPC64
777 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
778 if (lprop)
779 tce_alloc_start = *lprop;
780 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
781 if (lprop)
782 tce_alloc_end = *lprop;
783 #endif
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;
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
795 early_init_dt_check_for_initrd(node);
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));
802 #ifdef CONFIG_CMDLINE
803 if (p == NULL || l == 0 || (l == 1 && (*p) == 0))
804 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
805 #endif /* CONFIG_CMDLINE */
807 DBG("Command line is: %s\n", cmd_line);
809 /* break now */
810 return 1;
813 static int __init early_init_dt_scan_root(unsigned long node,
814 const char *uname, int depth, void *data)
816 u32 *prop;
818 if (depth != 0)
819 return 0;
821 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
822 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
823 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
825 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
826 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
827 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
829 /* break now */
830 return 1;
833 static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
835 cell_t *p = *cellp;
837 *cellp = p + s;
838 return of_read_ulong(p, s);
841 #ifdef CONFIG_PPC_PSERIES
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.
848 static int __init early_init_dt_scan_drconf_memory(unsigned long node)
850 cell_t *dm, *ls;
851 unsigned long l, n;
852 unsigned long base, size, lmb_size, flags;
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);
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;
863 n = *dm++; /* number of entries */
864 if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t))
865 return 0;
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;
883 lmb_add(base, size);
885 lmb_dump_all();
886 return 0;
888 #else
889 #define early_init_dt_scan_drconf_memory(node) 0
890 #endif /* CONFIG_PPC_PSERIES */
892 static int __init early_init_dt_scan_memory(unsigned long node,
893 const char *uname, int depth, void *data)
895 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
896 cell_t *reg, *endp;
897 unsigned long l;
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);
904 /* We are scanning "memory" nodes only */
905 if (type == NULL) {
907 * The longtrail doesn't have a device_type on the
908 * /memory node, so look for the node called /memory@0.
910 if (depth != 1 || strcmp(uname, "memory@0") != 0)
911 return 0;
912 } else if (strcmp(type, "memory") != 0)
913 return 0;
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);
918 if (reg == NULL)
919 return 0;
921 endp = reg + (l / sizeof(cell_t));
923 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
924 uname, l, reg[0], reg[1], reg[2], reg[3]);
926 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
927 unsigned long base, size;
929 base = dt_mem_next_cell(dt_root_addr_cells, &reg);
930 size = dt_mem_next_cell(dt_root_size_cells, &reg);
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;
942 #endif
943 lmb_add(base, size);
945 return 0;
948 static void __init early_reserve_mem(void)
950 u64 base, size;
951 u64 *reserve_map;
952 unsigned long self_base;
953 unsigned long self_size;
955 reserve_map = (u64 *)(((unsigned long)initial_boot_params) +
956 initial_boot_params->off_mem_rsvmap);
958 /* before we do anything, lets reserve the dt blob */
959 self_base = __pa((unsigned long)initial_boot_params);
960 self_size = initial_boot_params->totalsize;
961 lmb_reserve(self_base, self_size);
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 */
969 #ifdef CONFIG_PPC32
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
974 if (*reserve_map > 0xffffffffull) {
975 u32 base_32, size_32;
976 u32 *reserve_map_32 = (u32 *)reserve_map;
978 while (1) {
979 base_32 = *(reserve_map_32++);
980 size_32 = *(reserve_map_32++);
981 if (size_32 == 0)
982 break;
983 /* skip if the reservation is for the blob */
984 if (base_32 == self_base && size_32 == self_size)
985 continue;
986 DBG("reserving: %x -> %x\n", base_32, size_32);
987 lmb_reserve(base_32, size_32);
989 return;
991 #endif
992 while (1) {
993 base = *(reserve_map++);
994 size = *(reserve_map++);
995 if (size == 0)
996 break;
997 DBG("reserving: %llx -> %llx\n", base, size);
998 lmb_reserve(base, size);
1001 #if 0
1002 DBG("memory reserved, lmbs :\n");
1003 lmb_dump_all();
1004 #endif
1007 void __init early_init_devtree(void *params)
1009 DBG(" -> early_init_devtree(%p)\n", params);
1011 /* Setup flat device-tree pointer */
1012 initial_boot_params = params;
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
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 ...
1023 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
1025 /* Scan memory nodes and rebuild LMBs */
1026 lmb_init();
1027 of_scan_flat_dt(early_init_dt_scan_root, NULL);
1028 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
1030 /* Save command line for /proc/cmdline and then parse parameters */
1031 strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE);
1032 parse_early_param();
1034 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
1035 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
1036 reserve_kdump_trampoline();
1037 reserve_crashkernel();
1038 early_reserve_mem();
1040 lmb_enforce_memory_limit(memory_limit);
1041 lmb_analyze();
1043 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1045 /* We may need to relocate the flat tree, do it now.
1046 * FIXME .. and the initrd too? */
1047 move_device_tree();
1049 DBG("Scanning CPUs ...\n");
1051 /* Retreive CPU related informations from the flat tree
1052 * (altivec support, boot CPU ID, ...)
1054 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
1056 DBG(" <- early_init_devtree()\n");
1060 /** Checks if the given "compat" string matches one of the strings in
1061 * the device's "compatible" property
1063 int of_device_is_compatible(const struct device_node *device,
1064 const char *compat)
1066 const char* cp;
1067 int cplen, l;
1069 cp = of_get_property(device, "compatible", &cplen);
1070 if (cp == NULL)
1071 return 0;
1072 while (cplen > 0) {
1073 if (strncasecmp(cp, compat, strlen(compat)) == 0)
1074 return 1;
1075 l = strlen(cp) + 1;
1076 cp += l;
1077 cplen -= l;
1080 return 0;
1082 EXPORT_SYMBOL(of_device_is_compatible);
1086 * Indicates whether the root node has a given value in its
1087 * compatible property.
1089 int machine_is_compatible(const char *compat)
1091 struct device_node *root;
1092 int rc = 0;
1094 root = of_find_node_by_path("/");
1095 if (root) {
1096 rc = of_device_is_compatible(root, compat);
1097 of_node_put(root);
1099 return rc;
1101 EXPORT_SYMBOL(machine_is_compatible);
1103 /*******
1105 * New implementation of the OF "find" APIs, return a refcounted
1106 * object, call of_node_put() when done. The device tree and list
1107 * are protected by a rw_lock.
1109 * Note that property management will need some locking as well,
1110 * this isn't dealt with yet.
1112 *******/
1115 * of_find_node_by_name - Find a node by its "name" property
1116 * @from: The node to start searching from or NULL, the node
1117 * you pass will not be searched, only the next one
1118 * will; typically, you pass what the previous call
1119 * returned. of_node_put() will be called on it
1120 * @name: The name string to match against
1122 * Returns a node pointer with refcount incremented, use
1123 * of_node_put() on it when done.
1125 struct device_node *of_find_node_by_name(struct device_node *from,
1126 const char *name)
1128 struct device_node *np;
1130 read_lock(&devtree_lock);
1131 np = from ? from->allnext : allnodes;
1132 for (; np != NULL; np = np->allnext)
1133 if (np->name != NULL && strcasecmp(np->name, name) == 0
1134 && of_node_get(np))
1135 break;
1136 of_node_put(from);
1137 read_unlock(&devtree_lock);
1138 return np;
1140 EXPORT_SYMBOL(of_find_node_by_name);
1143 * of_find_node_by_type - Find a node by its "device_type" property
1144 * @from: The node to start searching from, or NULL to start searching
1145 * the entire device tree. The node you pass will not be
1146 * searched, only the next one will; typically, you pass
1147 * what the previous call returned. of_node_put() will be
1148 * called on from for you.
1149 * @type: The type string to match against
1151 * Returns a node pointer with refcount incremented, use
1152 * of_node_put() on it when done.
1154 struct device_node *of_find_node_by_type(struct device_node *from,
1155 const char *type)
1157 struct device_node *np;
1159 read_lock(&devtree_lock);
1160 np = from ? from->allnext : allnodes;
1161 for (; np != 0; np = np->allnext)
1162 if (np->type != 0 && strcasecmp(np->type, type) == 0
1163 && of_node_get(np))
1164 break;
1165 of_node_put(from);
1166 read_unlock(&devtree_lock);
1167 return np;
1169 EXPORT_SYMBOL(of_find_node_by_type);
1172 * of_find_compatible_node - Find a node based on type and one of the
1173 * tokens in its "compatible" property
1174 * @from: The node to start searching from or NULL, the node
1175 * you pass will not be searched, only the next one
1176 * will; typically, you pass what the previous call
1177 * returned. of_node_put() will be called on it
1178 * @type: The type string to match "device_type" or NULL to ignore
1179 * @compatible: The string to match to one of the tokens in the device
1180 * "compatible" list.
1182 * Returns a node pointer with refcount incremented, use
1183 * of_node_put() on it when done.
1185 struct device_node *of_find_compatible_node(struct device_node *from,
1186 const char *type, const char *compatible)
1188 struct device_node *np;
1190 read_lock(&devtree_lock);
1191 np = from ? from->allnext : allnodes;
1192 for (; np != 0; np = np->allnext) {
1193 if (type != NULL
1194 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1195 continue;
1196 if (of_device_is_compatible(np, compatible) && of_node_get(np))
1197 break;
1199 of_node_put(from);
1200 read_unlock(&devtree_lock);
1201 return np;
1203 EXPORT_SYMBOL(of_find_compatible_node);
1206 * of_find_node_by_path - Find a node matching a full OF path
1207 * @path: The full path to match
1209 * Returns a node pointer with refcount incremented, use
1210 * of_node_put() on it when done.
1212 struct device_node *of_find_node_by_path(const char *path)
1214 struct device_node *np = allnodes;
1216 read_lock(&devtree_lock);
1217 for (; np != 0; np = np->allnext) {
1218 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1219 && of_node_get(np))
1220 break;
1222 read_unlock(&devtree_lock);
1223 return np;
1225 EXPORT_SYMBOL(of_find_node_by_path);
1228 * of_find_node_by_phandle - Find a node given a phandle
1229 * @handle: phandle of the node to find
1231 * Returns a node pointer with refcount incremented, use
1232 * of_node_put() on it when done.
1234 struct device_node *of_find_node_by_phandle(phandle handle)
1236 struct device_node *np;
1238 read_lock(&devtree_lock);
1239 for (np = allnodes; np != 0; np = np->allnext)
1240 if (np->linux_phandle == handle)
1241 break;
1242 of_node_get(np);
1243 read_unlock(&devtree_lock);
1244 return np;
1246 EXPORT_SYMBOL(of_find_node_by_phandle);
1249 * of_find_all_nodes - Get next node in global list
1250 * @prev: Previous node or NULL to start iteration
1251 * of_node_put() will be called on it
1253 * Returns a node pointer with refcount incremented, use
1254 * of_node_put() on it when done.
1256 struct device_node *of_find_all_nodes(struct device_node *prev)
1258 struct device_node *np;
1260 read_lock(&devtree_lock);
1261 np = prev ? prev->allnext : allnodes;
1262 for (; np != 0; np = np->allnext)
1263 if (of_node_get(np))
1264 break;
1265 of_node_put(prev);
1266 read_unlock(&devtree_lock);
1267 return np;
1269 EXPORT_SYMBOL(of_find_all_nodes);
1272 * of_get_parent - Get a node's parent if any
1273 * @node: Node to get parent
1275 * Returns a node pointer with refcount incremented, use
1276 * of_node_put() on it when done.
1278 struct device_node *of_get_parent(const struct device_node *node)
1280 struct device_node *np;
1282 if (!node)
1283 return NULL;
1285 read_lock(&devtree_lock);
1286 np = of_node_get(node->parent);
1287 read_unlock(&devtree_lock);
1288 return np;
1290 EXPORT_SYMBOL(of_get_parent);
1293 * of_get_next_child - Iterate a node childs
1294 * @node: parent node
1295 * @prev: previous child of the parent node, or NULL to get first
1297 * Returns a node pointer with refcount incremented, use
1298 * of_node_put() on it when done.
1300 struct device_node *of_get_next_child(const struct device_node *node,
1301 struct device_node *prev)
1303 struct device_node *next;
1305 read_lock(&devtree_lock);
1306 next = prev ? prev->sibling : node->child;
1307 for (; next != 0; next = next->sibling)
1308 if (of_node_get(next))
1309 break;
1310 of_node_put(prev);
1311 read_unlock(&devtree_lock);
1312 return next;
1314 EXPORT_SYMBOL(of_get_next_child);
1317 * of_node_get - Increment refcount of a node
1318 * @node: Node to inc refcount, NULL is supported to
1319 * simplify writing of callers
1321 * Returns node.
1323 struct device_node *of_node_get(struct device_node *node)
1325 if (node)
1326 kref_get(&node->kref);
1327 return node;
1329 EXPORT_SYMBOL(of_node_get);
1331 static inline struct device_node * kref_to_device_node(struct kref *kref)
1333 return container_of(kref, struct device_node, kref);
1337 * of_node_release - release a dynamically allocated node
1338 * @kref: kref element of the node to be released
1340 * In of_node_put() this function is passed to kref_put()
1341 * as the destructor.
1343 static void of_node_release(struct kref *kref)
1345 struct device_node *node = kref_to_device_node(kref);
1346 struct property *prop = node->properties;
1348 /* We should never be releasing nodes that haven't been detached. */
1349 if (!of_node_check_flag(node, OF_DETACHED)) {
1350 printk("WARNING: Bad of_node_put() on %s\n", node->full_name);
1351 dump_stack();
1352 kref_init(&node->kref);
1353 return;
1356 if (!of_node_check_flag(node, OF_DYNAMIC))
1357 return;
1359 while (prop) {
1360 struct property *next = prop->next;
1361 kfree(prop->name);
1362 kfree(prop->value);
1363 kfree(prop);
1364 prop = next;
1366 if (!prop) {
1367 prop = node->deadprops;
1368 node->deadprops = NULL;
1371 kfree(node->full_name);
1372 kfree(node->data);
1373 kfree(node);
1377 * of_node_put - Decrement refcount of a node
1378 * @node: Node to dec refcount, NULL is supported to
1379 * simplify writing of callers
1382 void of_node_put(struct device_node *node)
1384 if (node)
1385 kref_put(&node->kref, of_node_release);
1387 EXPORT_SYMBOL(of_node_put);
1390 * Plug a device node into the tree and global list.
1392 void of_attach_node(struct device_node *np)
1394 write_lock(&devtree_lock);
1395 np->sibling = np->parent->child;
1396 np->allnext = allnodes;
1397 np->parent->child = np;
1398 allnodes = np;
1399 write_unlock(&devtree_lock);
1403 * "Unplug" a node from the device tree. The caller must hold
1404 * a reference to the node. The memory associated with the node
1405 * is not freed until its refcount goes to zero.
1407 void of_detach_node(const struct device_node *np)
1409 struct device_node *parent;
1411 write_lock(&devtree_lock);
1413 parent = np->parent;
1414 if (!parent)
1415 goto out_unlock;
1417 if (allnodes == np)
1418 allnodes = np->allnext;
1419 else {
1420 struct device_node *prev;
1421 for (prev = allnodes;
1422 prev->allnext != np;
1423 prev = prev->allnext)
1425 prev->allnext = np->allnext;
1428 if (parent->child == np)
1429 parent->child = np->sibling;
1430 else {
1431 struct device_node *prevsib;
1432 for (prevsib = np->parent->child;
1433 prevsib->sibling != np;
1434 prevsib = prevsib->sibling)
1436 prevsib->sibling = np->sibling;
1439 of_node_set_flag(np, OF_DETACHED);
1441 out_unlock:
1442 write_unlock(&devtree_lock);
1445 #ifdef CONFIG_PPC_PSERIES
1447 * Fix up the uninitialized fields in a new device node:
1448 * name, type and pci-specific fields
1451 static int of_finish_dynamic_node(struct device_node *node)
1453 struct device_node *parent = of_get_parent(node);
1454 int err = 0;
1455 const phandle *ibm_phandle;
1457 node->name = of_get_property(node, "name", NULL);
1458 node->type = of_get_property(node, "device_type", NULL);
1460 if (!node->name)
1461 node->name = "<NULL>";
1462 if (!node->type)
1463 node->type = "<NULL>";
1465 if (!parent) {
1466 err = -ENODEV;
1467 goto out;
1470 /* We don't support that function on PowerMac, at least
1471 * not yet
1473 if (machine_is(powermac))
1474 return -ENODEV;
1476 /* fix up new node's linux_phandle field */
1477 if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL)))
1478 node->linux_phandle = *ibm_phandle;
1480 out:
1481 of_node_put(parent);
1482 return err;
1485 static int prom_reconfig_notifier(struct notifier_block *nb,
1486 unsigned long action, void *node)
1488 int err;
1490 switch (action) {
1491 case PSERIES_RECONFIG_ADD:
1492 err = of_finish_dynamic_node(node);
1493 if (err < 0) {
1494 printk(KERN_ERR "finish_node returned %d\n", err);
1495 err = NOTIFY_BAD;
1497 break;
1498 default:
1499 err = NOTIFY_DONE;
1500 break;
1502 return err;
1505 static struct notifier_block prom_reconfig_nb = {
1506 .notifier_call = prom_reconfig_notifier,
1507 .priority = 10, /* This one needs to run first */
1510 static int __init prom_reconfig_setup(void)
1512 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1514 __initcall(prom_reconfig_setup);
1515 #endif
1517 struct property *of_find_property(const struct device_node *np,
1518 const char *name,
1519 int *lenp)
1521 struct property *pp;
1523 read_lock(&devtree_lock);
1524 for (pp = np->properties; pp != 0; pp = pp->next)
1525 if (strcmp(pp->name, name) == 0) {
1526 if (lenp != 0)
1527 *lenp = pp->length;
1528 break;
1530 read_unlock(&devtree_lock);
1532 return pp;
1534 EXPORT_SYMBOL(of_find_property);
1537 * Add a property to a node
1539 int prom_add_property(struct device_node* np, struct property* prop)
1541 struct property **next;
1543 prop->next = NULL;
1544 write_lock(&devtree_lock);
1545 next = &np->properties;
1546 while (*next) {
1547 if (strcmp(prop->name, (*next)->name) == 0) {
1548 /* duplicate ! don't insert it */
1549 write_unlock(&devtree_lock);
1550 return -1;
1552 next = &(*next)->next;
1554 *next = prop;
1555 write_unlock(&devtree_lock);
1557 #ifdef CONFIG_PROC_DEVICETREE
1558 /* try to add to proc as well if it was initialized */
1559 if (np->pde)
1560 proc_device_tree_add_prop(np->pde, prop);
1561 #endif /* CONFIG_PROC_DEVICETREE */
1563 return 0;
1567 * Remove a property from a node. Note that we don't actually
1568 * remove it, since we have given out who-knows-how-many pointers
1569 * to the data using get-property. Instead we just move the property
1570 * to the "dead properties" list, so it won't be found any more.
1572 int prom_remove_property(struct device_node *np, struct property *prop)
1574 struct property **next;
1575 int found = 0;
1577 write_lock(&devtree_lock);
1578 next = &np->properties;
1579 while (*next) {
1580 if (*next == prop) {
1581 /* found the node */
1582 *next = prop->next;
1583 prop->next = np->deadprops;
1584 np->deadprops = prop;
1585 found = 1;
1586 break;
1588 next = &(*next)->next;
1590 write_unlock(&devtree_lock);
1592 if (!found)
1593 return -ENODEV;
1595 #ifdef CONFIG_PROC_DEVICETREE
1596 /* try to remove the proc node as well */
1597 if (np->pde)
1598 proc_device_tree_remove_prop(np->pde, prop);
1599 #endif /* CONFIG_PROC_DEVICETREE */
1601 return 0;
1605 * Update a property in a node. Note that we don't actually
1606 * remove it, since we have given out who-knows-how-many pointers
1607 * to the data using get-property. Instead we just move the property
1608 * to the "dead properties" list, and add the new property to the
1609 * property list
1611 int prom_update_property(struct device_node *np,
1612 struct property *newprop,
1613 struct property *oldprop)
1615 struct property **next;
1616 int found = 0;
1618 write_lock(&devtree_lock);
1619 next = &np->properties;
1620 while (*next) {
1621 if (*next == oldprop) {
1622 /* found the node */
1623 newprop->next = oldprop->next;
1624 *next = newprop;
1625 oldprop->next = np->deadprops;
1626 np->deadprops = oldprop;
1627 found = 1;
1628 break;
1630 next = &(*next)->next;
1632 write_unlock(&devtree_lock);
1634 if (!found)
1635 return -ENODEV;
1637 #ifdef CONFIG_PROC_DEVICETREE
1638 /* try to add to proc as well if it was initialized */
1639 if (np->pde)
1640 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1641 #endif /* CONFIG_PROC_DEVICETREE */
1643 return 0;
1647 /* Find the device node for a given logical cpu number, also returns the cpu
1648 * local thread number (index in ibm,interrupt-server#s) if relevant and
1649 * asked for (non NULL)
1651 struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
1653 int hardid;
1654 struct device_node *np;
1656 hardid = get_hard_smp_processor_id(cpu);
1658 for_each_node_by_type(np, "cpu") {
1659 const u32 *intserv;
1660 unsigned int plen, t;
1662 /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist
1663 * fallback to "reg" property and assume no threads
1665 intserv = of_get_property(np, "ibm,ppc-interrupt-server#s",
1666 &plen);
1667 if (intserv == NULL) {
1668 const u32 *reg = of_get_property(np, "reg", NULL);
1669 if (reg == NULL)
1670 continue;
1671 if (*reg == hardid) {
1672 if (thread)
1673 *thread = 0;
1674 return np;
1676 } else {
1677 plen /= sizeof(u32);
1678 for (t = 0; t < plen; t++) {
1679 if (hardid == intserv[t]) {
1680 if (thread)
1681 *thread = t;
1682 return np;
1687 return NULL;
1689 EXPORT_SYMBOL(of_get_cpu_node);
1691 #if defined(CONFIG_DEBUG_FS) && defined(DEBUG)
1692 static struct debugfs_blob_wrapper flat_dt_blob;
1694 static int __init export_flat_device_tree(void)
1696 struct dentry *d;
1698 flat_dt_blob.data = initial_boot_params;
1699 flat_dt_blob.size = initial_boot_params->totalsize;
1701 d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR,
1702 powerpc_debugfs_root, &flat_dt_blob);
1703 if (!d)
1704 return 1;
1706 return 0;
1708 __initcall(export_flat_device_tree);
1709 #endif