[POWERPC] Allow duplicate lmb_reserve() calls
[firewire-audio.git] / arch / powerpc / kernel / prom.c
blob15ece3abfb379cf48ca15995ace46fb0804ff3e0
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>
56 #ifdef DEBUG
57 #define DBG(fmt...) printk(KERN_ERR fmt)
58 #else
59 #define DBG(fmt...)
60 #endif
63 static int __initdata dt_root_addr_cells;
64 static int __initdata dt_root_size_cells;
66 #ifdef CONFIG_PPC64
67 int __initdata iommu_is_off;
68 int __initdata iommu_force_on;
69 unsigned long tce_alloc_start, tce_alloc_end;
70 #endif
72 typedef u32 cell_t;
74 #if 0
75 static struct boot_param_header *initial_boot_params __initdata;
76 #else
77 struct boot_param_header *initial_boot_params;
78 #endif
80 static struct device_node *allnodes = NULL;
82 /* use when traversing tree through the allnext, child, sibling,
83 * or parent members of struct device_node.
85 static DEFINE_RWLOCK(devtree_lock);
87 /* export that to outside world */
88 struct device_node *of_chosen;
90 static inline char *find_flat_dt_string(u32 offset)
92 return ((char *)initial_boot_params) +
93 initial_boot_params->off_dt_strings + offset;
96 /**
97 * This function is used to scan the flattened device-tree, it is
98 * used to extract the memory informations at boot before we can
99 * unflatten the tree
101 int __init of_scan_flat_dt(int (*it)(unsigned long node,
102 const char *uname, int depth,
103 void *data),
104 void *data)
106 unsigned long p = ((unsigned long)initial_boot_params) +
107 initial_boot_params->off_dt_struct;
108 int rc = 0;
109 int depth = -1;
111 do {
112 u32 tag = *((u32 *)p);
113 char *pathp;
115 p += 4;
116 if (tag == OF_DT_END_NODE) {
117 depth --;
118 continue;
120 if (tag == OF_DT_NOP)
121 continue;
122 if (tag == OF_DT_END)
123 break;
124 if (tag == OF_DT_PROP) {
125 u32 sz = *((u32 *)p);
126 p += 8;
127 if (initial_boot_params->version < 0x10)
128 p = _ALIGN(p, sz >= 8 ? 8 : 4);
129 p += sz;
130 p = _ALIGN(p, 4);
131 continue;
133 if (tag != OF_DT_BEGIN_NODE) {
134 printk(KERN_WARNING "Invalid tag %x scanning flattened"
135 " device tree !\n", tag);
136 return -EINVAL;
138 depth++;
139 pathp = (char *)p;
140 p = _ALIGN(p + strlen(pathp) + 1, 4);
141 if ((*pathp) == '/') {
142 char *lp, *np;
143 for (lp = NULL, np = pathp; *np; np++)
144 if ((*np) == '/')
145 lp = np+1;
146 if (lp != NULL)
147 pathp = lp;
149 rc = it(p, pathp, depth, data);
150 if (rc != 0)
151 break;
152 } while(1);
154 return rc;
157 unsigned long __init of_get_flat_dt_root(void)
159 unsigned long p = ((unsigned long)initial_boot_params) +
160 initial_boot_params->off_dt_struct;
162 while(*((u32 *)p) == OF_DT_NOP)
163 p += 4;
164 BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE);
165 p += 4;
166 return _ALIGN(p + strlen((char *)p) + 1, 4);
170 * This function can be used within scan_flattened_dt callback to get
171 * access to properties
173 void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
174 unsigned long *size)
176 unsigned long p = node;
178 do {
179 u32 tag = *((u32 *)p);
180 u32 sz, noff;
181 const char *nstr;
183 p += 4;
184 if (tag == OF_DT_NOP)
185 continue;
186 if (tag != OF_DT_PROP)
187 return NULL;
189 sz = *((u32 *)p);
190 noff = *((u32 *)(p + 4));
191 p += 8;
192 if (initial_boot_params->version < 0x10)
193 p = _ALIGN(p, sz >= 8 ? 8 : 4);
195 nstr = find_flat_dt_string(noff);
196 if (nstr == NULL) {
197 printk(KERN_WARNING "Can't find property index"
198 " name !\n");
199 return NULL;
201 if (strcmp(name, nstr) == 0) {
202 if (size)
203 *size = sz;
204 return (void *)p;
206 p += sz;
207 p = _ALIGN(p, 4);
208 } while(1);
211 int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
213 const char* cp;
214 unsigned long cplen, l;
216 cp = of_get_flat_dt_prop(node, "compatible", &cplen);
217 if (cp == NULL)
218 return 0;
219 while (cplen > 0) {
220 if (strncasecmp(cp, compat, strlen(compat)) == 0)
221 return 1;
222 l = strlen(cp) + 1;
223 cp += l;
224 cplen -= l;
227 return 0;
230 static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
231 unsigned long align)
233 void *res;
235 *mem = _ALIGN(*mem, align);
236 res = (void *)*mem;
237 *mem += size;
239 return res;
242 static unsigned long __init unflatten_dt_node(unsigned long mem,
243 unsigned long *p,
244 struct device_node *dad,
245 struct device_node ***allnextpp,
246 unsigned long fpsize)
248 struct device_node *np;
249 struct property *pp, **prev_pp = NULL;
250 char *pathp;
251 u32 tag;
252 unsigned int l, allocl;
253 int has_name = 0;
254 int new_format = 0;
256 tag = *((u32 *)(*p));
257 if (tag != OF_DT_BEGIN_NODE) {
258 printk("Weird tag at start of node: %x\n", tag);
259 return mem;
261 *p += 4;
262 pathp = (char *)*p;
263 l = allocl = strlen(pathp) + 1;
264 *p = _ALIGN(*p + l, 4);
266 /* version 0x10 has a more compact unit name here instead of the full
267 * path. we accumulate the full path size using "fpsize", we'll rebuild
268 * it later. We detect this because the first character of the name is
269 * not '/'.
271 if ((*pathp) != '/') {
272 new_format = 1;
273 if (fpsize == 0) {
274 /* root node: special case. fpsize accounts for path
275 * plus terminating zero. root node only has '/', so
276 * fpsize should be 2, but we want to avoid the first
277 * level nodes to have two '/' so we use fpsize 1 here
279 fpsize = 1;
280 allocl = 2;
281 } else {
282 /* account for '/' and path size minus terminal 0
283 * already in 'l'
285 fpsize += l;
286 allocl = fpsize;
291 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
292 __alignof__(struct device_node));
293 if (allnextpp) {
294 memset(np, 0, sizeof(*np));
295 np->full_name = ((char*)np) + sizeof(struct device_node);
296 if (new_format) {
297 char *p = np->full_name;
298 /* rebuild full path for new format */
299 if (dad && dad->parent) {
300 strcpy(p, dad->full_name);
301 #ifdef DEBUG
302 if ((strlen(p) + l + 1) != allocl) {
303 DBG("%s: p: %d, l: %d, a: %d\n",
304 pathp, (int)strlen(p), l, allocl);
306 #endif
307 p += strlen(p);
309 *(p++) = '/';
310 memcpy(p, pathp, l);
311 } else
312 memcpy(np->full_name, pathp, l);
313 prev_pp = &np->properties;
314 **allnextpp = np;
315 *allnextpp = &np->allnext;
316 if (dad != NULL) {
317 np->parent = dad;
318 /* we temporarily use the next field as `last_child'*/
319 if (dad->next == 0)
320 dad->child = np;
321 else
322 dad->next->sibling = np;
323 dad->next = np;
325 kref_init(&np->kref);
327 while(1) {
328 u32 sz, noff;
329 char *pname;
331 tag = *((u32 *)(*p));
332 if (tag == OF_DT_NOP) {
333 *p += 4;
334 continue;
336 if (tag != OF_DT_PROP)
337 break;
338 *p += 4;
339 sz = *((u32 *)(*p));
340 noff = *((u32 *)((*p) + 4));
341 *p += 8;
342 if (initial_boot_params->version < 0x10)
343 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
345 pname = find_flat_dt_string(noff);
346 if (pname == NULL) {
347 printk("Can't find property name in list !\n");
348 break;
350 if (strcmp(pname, "name") == 0)
351 has_name = 1;
352 l = strlen(pname) + 1;
353 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
354 __alignof__(struct property));
355 if (allnextpp) {
356 if (strcmp(pname, "linux,phandle") == 0) {
357 np->node = *((u32 *)*p);
358 if (np->linux_phandle == 0)
359 np->linux_phandle = np->node;
361 if (strcmp(pname, "ibm,phandle") == 0)
362 np->linux_phandle = *((u32 *)*p);
363 pp->name = pname;
364 pp->length = sz;
365 pp->value = (void *)*p;
366 *prev_pp = pp;
367 prev_pp = &pp->next;
369 *p = _ALIGN((*p) + sz, 4);
371 /* with version 0x10 we may not have the name property, recreate
372 * it here from the unit name if absent
374 if (!has_name) {
375 char *p = pathp, *ps = pathp, *pa = NULL;
376 int sz;
378 while (*p) {
379 if ((*p) == '@')
380 pa = p;
381 if ((*p) == '/')
382 ps = p + 1;
383 p++;
385 if (pa < ps)
386 pa = p;
387 sz = (pa - ps) + 1;
388 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
389 __alignof__(struct property));
390 if (allnextpp) {
391 pp->name = "name";
392 pp->length = sz;
393 pp->value = (unsigned char *)(pp + 1);
394 *prev_pp = pp;
395 prev_pp = &pp->next;
396 memcpy(pp->value, ps, sz - 1);
397 ((char *)pp->value)[sz - 1] = 0;
398 DBG("fixed up name for %s -> %s\n", pathp, pp->value);
401 if (allnextpp) {
402 *prev_pp = NULL;
403 np->name = get_property(np, "name", NULL);
404 np->type = get_property(np, "device_type", NULL);
406 if (!np->name)
407 np->name = "<NULL>";
408 if (!np->type)
409 np->type = "<NULL>";
411 while (tag == OF_DT_BEGIN_NODE) {
412 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
413 tag = *((u32 *)(*p));
415 if (tag != OF_DT_END_NODE) {
416 printk("Weird tag at end of node: %x\n", tag);
417 return mem;
419 *p += 4;
420 return mem;
423 static int __init early_parse_mem(char *p)
425 if (!p)
426 return 1;
428 memory_limit = PAGE_ALIGN(memparse(p, &p));
429 DBG("memory limit = 0x%lx\n", memory_limit);
431 return 0;
433 early_param("mem", early_parse_mem);
436 * The device tree may be allocated below our memory limit, or inside the
437 * crash kernel region for kdump. If so, move it out now.
439 static void move_device_tree(void)
441 unsigned long start, size;
442 void *p;
444 DBG("-> move_device_tree\n");
446 start = __pa(initial_boot_params);
447 size = initial_boot_params->totalsize;
449 if ((memory_limit && (start + size) > memory_limit) ||
450 overlaps_crashkernel(start, size)) {
451 p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size));
452 memcpy(p, initial_boot_params, size);
453 initial_boot_params = (struct boot_param_header *)p;
454 DBG("Moved device tree to 0x%p\n", p);
457 DBG("<- move_device_tree\n");
461 * unflattens the device-tree passed by the firmware, creating the
462 * tree of struct device_node. It also fills the "name" and "type"
463 * pointers of the nodes so the normal device-tree walking functions
464 * can be used (this used to be done by finish_device_tree)
466 void __init unflatten_device_tree(void)
468 unsigned long start, mem, size;
469 struct device_node **allnextp = &allnodes;
471 DBG(" -> unflatten_device_tree()\n");
473 /* First pass, scan for size */
474 start = ((unsigned long)initial_boot_params) +
475 initial_boot_params->off_dt_struct;
476 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
477 size = (size | 3) + 1;
479 DBG(" size is %lx, allocating...\n", size);
481 /* Allocate memory for the expanded device tree */
482 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
483 mem = (unsigned long) __va(mem);
485 ((u32 *)mem)[size / 4] = 0xdeadbeef;
487 DBG(" unflattening %lx...\n", mem);
489 /* Second pass, do actual unflattening */
490 start = ((unsigned long)initial_boot_params) +
491 initial_boot_params->off_dt_struct;
492 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
493 if (*((u32 *)start) != OF_DT_END)
494 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
495 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
496 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
497 ((u32 *)mem)[size / 4] );
498 *allnextp = NULL;
500 /* Get pointer to OF "/chosen" node for use everywhere */
501 of_chosen = of_find_node_by_path("/chosen");
502 if (of_chosen == NULL)
503 of_chosen = of_find_node_by_path("/chosen@0");
505 DBG(" <- unflatten_device_tree()\n");
509 * ibm,pa-features is a per-cpu property that contains a string of
510 * attribute descriptors, each of which has a 2 byte header plus up
511 * to 254 bytes worth of processor attribute bits. First header
512 * byte specifies the number of bytes following the header.
513 * Second header byte is an "attribute-specifier" type, of which
514 * zero is the only currently-defined value.
515 * Implementation: Pass in the byte and bit offset for the feature
516 * that we are interested in. The function will return -1 if the
517 * pa-features property is missing, or a 1/0 to indicate if the feature
518 * is supported/not supported. Note that the bit numbers are
519 * big-endian to match the definition in PAPR.
521 static struct ibm_pa_feature {
522 unsigned long cpu_features; /* CPU_FTR_xxx bit */
523 unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */
524 unsigned char pabyte; /* byte number in ibm,pa-features */
525 unsigned char pabit; /* bit number (big-endian) */
526 unsigned char invert; /* if 1, pa bit set => clear feature */
527 } ibm_pa_features[] __initdata = {
528 {0, PPC_FEATURE_HAS_MMU, 0, 0, 0},
529 {0, PPC_FEATURE_HAS_FPU, 0, 1, 0},
530 {CPU_FTR_SLB, 0, 0, 2, 0},
531 {CPU_FTR_CTRL, 0, 0, 3, 0},
532 {CPU_FTR_NOEXECUTE, 0, 0, 6, 0},
533 {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1},
534 #if 0
535 /* put this back once we know how to test if firmware does 64k IO */
536 {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0},
537 #endif
538 {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0},
541 static void __init scan_features(unsigned long node, unsigned char *ftrs,
542 unsigned long tablelen,
543 struct ibm_pa_feature *fp,
544 unsigned long ft_size)
546 unsigned long i, len, bit;
548 /* find descriptor with type == 0 */
549 for (;;) {
550 if (tablelen < 3)
551 return;
552 len = 2 + ftrs[0];
553 if (tablelen < len)
554 return; /* descriptor 0 not found */
555 if (ftrs[1] == 0)
556 break;
557 tablelen -= len;
558 ftrs += len;
561 /* loop over bits we know about */
562 for (i = 0; i < ft_size; ++i, ++fp) {
563 if (fp->pabyte >= ftrs[0])
564 continue;
565 bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1;
566 if (bit ^ fp->invert) {
567 cur_cpu_spec->cpu_features |= fp->cpu_features;
568 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs;
569 } else {
570 cur_cpu_spec->cpu_features &= ~fp->cpu_features;
571 cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs;
576 static void __init check_cpu_pa_features(unsigned long node)
578 unsigned char *pa_ftrs;
579 unsigned long tablelen;
581 pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen);
582 if (pa_ftrs == NULL)
583 return;
585 scan_features(node, pa_ftrs, tablelen,
586 ibm_pa_features, ARRAY_SIZE(ibm_pa_features));
589 static struct feature_property {
590 const char *name;
591 u32 min_value;
592 unsigned long cpu_feature;
593 unsigned long cpu_user_ftr;
594 } feature_properties[] __initdata = {
595 #ifdef CONFIG_ALTIVEC
596 {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
597 {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
598 #endif /* CONFIG_ALTIVEC */
599 #ifdef CONFIG_PPC64
600 {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP},
601 {"ibm,purr", 1, CPU_FTR_PURR, 0},
602 {"ibm,spurr", 1, CPU_FTR_SPURR, 0},
603 #endif /* CONFIG_PPC64 */
606 static void __init check_cpu_feature_properties(unsigned long node)
608 unsigned long i;
609 struct feature_property *fp = feature_properties;
610 const u32 *prop;
612 for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) {
613 prop = of_get_flat_dt_prop(node, fp->name, NULL);
614 if (prop && *prop >= fp->min_value) {
615 cur_cpu_spec->cpu_features |= fp->cpu_feature;
616 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr;
621 static int __init early_init_dt_scan_cpus(unsigned long node,
622 const char *uname, int depth,
623 void *data)
625 static int logical_cpuid = 0;
626 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
627 const u32 *prop;
628 const u32 *intserv;
629 int i, nthreads;
630 unsigned long len;
631 int found = 0;
633 /* We are scanning "cpu" nodes only */
634 if (type == NULL || strcmp(type, "cpu") != 0)
635 return 0;
637 /* Get physical cpuid */
638 intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len);
639 if (intserv) {
640 nthreads = len / sizeof(int);
641 } else {
642 intserv = of_get_flat_dt_prop(node, "reg", NULL);
643 nthreads = 1;
647 * Now see if any of these threads match our boot cpu.
648 * NOTE: This must match the parsing done in smp_setup_cpu_maps.
650 for (i = 0; i < nthreads; i++) {
652 * version 2 of the kexec param format adds the phys cpuid of
653 * booted proc.
655 if (initial_boot_params && initial_boot_params->version >= 2) {
656 if (intserv[i] ==
657 initial_boot_params->boot_cpuid_phys) {
658 found = 1;
659 break;
661 } else {
663 * Check if it's the boot-cpu, set it's hw index now,
664 * unfortunately this format did not support booting
665 * off secondary threads.
667 if (of_get_flat_dt_prop(node,
668 "linux,boot-cpu", NULL) != NULL) {
669 found = 1;
670 break;
674 #ifdef CONFIG_SMP
675 /* logical cpu id is always 0 on UP kernels */
676 logical_cpuid++;
677 #endif
680 if (found) {
681 DBG("boot cpu: logical %d physical %d\n", logical_cpuid,
682 intserv[i]);
683 boot_cpuid = logical_cpuid;
684 set_hard_smp_processor_id(boot_cpuid, intserv[i]);
687 * PAPR defines "logical" PVR values for cpus that
688 * meet various levels of the architecture:
689 * 0x0f000001 Architecture version 2.04
690 * 0x0f000002 Architecture version 2.05
691 * If the cpu-version property in the cpu node contains
692 * such a value, we call identify_cpu again with the
693 * logical PVR value in order to use the cpu feature
694 * bits appropriate for the architecture level.
696 * A POWER6 partition in "POWER6 architected" mode
697 * uses the 0x0f000002 PVR value; in POWER5+ mode
698 * it uses 0x0f000001.
700 prop = of_get_flat_dt_prop(node, "cpu-version", NULL);
701 if (prop && (*prop & 0xff000000) == 0x0f000000)
702 identify_cpu(0, *prop);
705 check_cpu_feature_properties(node);
706 check_cpu_pa_features(node);
708 #ifdef CONFIG_PPC_PSERIES
709 if (nthreads > 1)
710 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
711 else
712 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
713 #endif
715 return 0;
718 static int __init early_init_dt_scan_chosen(unsigned long node,
719 const char *uname, int depth, void *data)
721 unsigned long *lprop;
722 unsigned long l;
723 char *p;
725 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
727 if (depth != 1 ||
728 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
729 return 0;
731 #ifdef CONFIG_PPC64
732 /* check if iommu is forced on or off */
733 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
734 iommu_is_off = 1;
735 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
736 iommu_force_on = 1;
737 #endif
739 /* mem=x on the command line is the preferred mechanism */
740 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
741 if (lprop)
742 memory_limit = *lprop;
744 #ifdef CONFIG_PPC64
745 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
746 if (lprop)
747 tce_alloc_start = *lprop;
748 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
749 if (lprop)
750 tce_alloc_end = *lprop;
751 #endif
753 #ifdef CONFIG_KEXEC
754 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL);
755 if (lprop)
756 crashk_res.start = *lprop;
758 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL);
759 if (lprop)
760 crashk_res.end = crashk_res.start + *lprop - 1;
761 #endif
763 /* Retreive command line */
764 p = of_get_flat_dt_prop(node, "bootargs", &l);
765 if (p != NULL && l > 0)
766 strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE));
768 #ifdef CONFIG_CMDLINE
769 if (p == NULL || l == 0 || (l == 1 && (*p) == 0))
770 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
771 #endif /* CONFIG_CMDLINE */
773 DBG("Command line is: %s\n", cmd_line);
775 /* break now */
776 return 1;
779 static int __init early_init_dt_scan_root(unsigned long node,
780 const char *uname, int depth, void *data)
782 u32 *prop;
784 if (depth != 0)
785 return 0;
787 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
788 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
789 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
791 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
792 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
793 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
795 /* break now */
796 return 1;
799 static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
801 cell_t *p = *cellp;
803 *cellp = p + s;
804 return of_read_ulong(p, s);
807 #ifdef CONFIG_PPC_PSERIES
809 * Interpret the ibm,dynamic-memory property in the
810 * /ibm,dynamic-reconfiguration-memory node.
811 * This contains a list of memory blocks along with NUMA affinity
812 * information.
814 static int __init early_init_dt_scan_drconf_memory(unsigned long node)
816 cell_t *dm, *ls;
817 unsigned long l, n;
818 unsigned long base, size, lmb_size, flags;
820 ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l);
821 if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t))
822 return 0;
823 lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls);
825 dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l);
826 if (dm == NULL || l < sizeof(cell_t))
827 return 0;
829 n = *dm++; /* number of entries */
830 if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t))
831 return 0;
833 for (; n != 0; --n) {
834 base = dt_mem_next_cell(dt_root_addr_cells, &dm);
835 flags = dm[3];
836 /* skip DRC index, pad, assoc. list index, flags */
837 dm += 4;
838 /* skip this block if the reserved bit is set in flags (0x80)
839 or if the block is not assigned to this partition (0x8) */
840 if ((flags & 0x80) || !(flags & 0x8))
841 continue;
842 size = lmb_size;
843 if (iommu_is_off) {
844 if (base >= 0x80000000ul)
845 continue;
846 if ((base + size) > 0x80000000ul)
847 size = 0x80000000ul - base;
849 lmb_add(base, size);
851 lmb_dump_all();
852 return 0;
854 #else
855 #define early_init_dt_scan_drconf_memory(node) 0
856 #endif /* CONFIG_PPC_PSERIES */
858 static int __init early_init_dt_scan_memory(unsigned long node,
859 const char *uname, int depth, void *data)
861 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
862 cell_t *reg, *endp;
863 unsigned long l;
865 /* Look for the ibm,dynamic-reconfiguration-memory node */
866 if (depth == 1 &&
867 strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0)
868 return early_init_dt_scan_drconf_memory(node);
870 /* We are scanning "memory" nodes only */
871 if (type == NULL) {
873 * The longtrail doesn't have a device_type on the
874 * /memory node, so look for the node called /memory@0.
876 if (depth != 1 || strcmp(uname, "memory@0") != 0)
877 return 0;
878 } else if (strcmp(type, "memory") != 0)
879 return 0;
881 reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l);
882 if (reg == NULL)
883 reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l);
884 if (reg == NULL)
885 return 0;
887 endp = reg + (l / sizeof(cell_t));
889 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
890 uname, l, reg[0], reg[1], reg[2], reg[3]);
892 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
893 unsigned long base, size;
895 base = dt_mem_next_cell(dt_root_addr_cells, &reg);
896 size = dt_mem_next_cell(dt_root_size_cells, &reg);
898 if (size == 0)
899 continue;
900 DBG(" - %lx , %lx\n", base, size);
901 #ifdef CONFIG_PPC64
902 if (iommu_is_off) {
903 if (base >= 0x80000000ul)
904 continue;
905 if ((base + size) > 0x80000000ul)
906 size = 0x80000000ul - base;
908 #endif
909 lmb_add(base, size);
911 return 0;
914 static void __init early_reserve_mem(void)
916 u64 base, size;
917 u64 *reserve_map;
918 unsigned long self_base;
919 unsigned long self_size;
921 reserve_map = (u64 *)(((unsigned long)initial_boot_params) +
922 initial_boot_params->off_mem_rsvmap);
924 /* before we do anything, lets reserve the dt blob */
925 self_base = __pa((unsigned long)initial_boot_params);
926 self_size = initial_boot_params->totalsize;
927 lmb_reserve(self_base, self_size);
929 #ifdef CONFIG_PPC32
931 * Handle the case where we might be booting from an old kexec
932 * image that setup the mem_rsvmap as pairs of 32-bit values
934 if (*reserve_map > 0xffffffffull) {
935 u32 base_32, size_32;
936 u32 *reserve_map_32 = (u32 *)reserve_map;
938 while (1) {
939 base_32 = *(reserve_map_32++);
940 size_32 = *(reserve_map_32++);
941 if (size_32 == 0)
942 break;
943 /* skip if the reservation is for the blob */
944 if (base_32 == self_base && size_32 == self_size)
945 continue;
946 DBG("reserving: %x -> %x\n", base_32, size_32);
947 lmb_reserve(base_32, size_32);
949 return;
951 #endif
952 while (1) {
953 base = *(reserve_map++);
954 size = *(reserve_map++);
955 if (size == 0)
956 break;
957 DBG("reserving: %llx -> %llx\n", base, size);
958 lmb_reserve(base, size);
961 #if 0
962 DBG("memory reserved, lmbs :\n");
963 lmb_dump_all();
964 #endif
967 void __init early_init_devtree(void *params)
969 DBG(" -> early_init_devtree()\n");
971 /* Setup flat device-tree pointer */
972 initial_boot_params = params;
974 #ifdef CONFIG_PPC_RTAS
975 /* Some machines might need RTAS info for debugging, grab it now. */
976 of_scan_flat_dt(early_init_dt_scan_rtas, NULL);
977 #endif
979 /* Retrieve various informations from the /chosen node of the
980 * device-tree, including the platform type, initrd location and
981 * size, TCE reserve, and more ...
983 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
985 /* Scan memory nodes and rebuild LMBs */
986 lmb_init();
987 of_scan_flat_dt(early_init_dt_scan_root, NULL);
988 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
990 /* Save command line for /proc/cmdline and then parse parameters */
991 strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE);
992 parse_early_param();
994 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
995 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
996 reserve_kdump_trampoline();
997 reserve_crashkernel();
998 early_reserve_mem();
1000 lmb_enforce_memory_limit(memory_limit);
1001 lmb_analyze();
1003 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1005 /* We may need to relocate the flat tree, do it now.
1006 * FIXME .. and the initrd too? */
1007 move_device_tree();
1009 DBG("Scanning CPUs ...\n");
1011 /* Retreive CPU related informations from the flat tree
1012 * (altivec support, boot CPU ID, ...)
1014 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
1016 DBG(" <- early_init_devtree()\n");
1019 #undef printk
1022 prom_n_addr_cells(struct device_node* np)
1024 const int *ip;
1025 do {
1026 if (np->parent)
1027 np = np->parent;
1028 ip = get_property(np, "#address-cells", NULL);
1029 if (ip != NULL)
1030 return *ip;
1031 } while (np->parent);
1032 /* No #address-cells property for the root node, default to 1 */
1033 return 1;
1035 EXPORT_SYMBOL(prom_n_addr_cells);
1038 prom_n_size_cells(struct device_node* np)
1040 const int* ip;
1041 do {
1042 if (np->parent)
1043 np = np->parent;
1044 ip = get_property(np, "#size-cells", NULL);
1045 if (ip != NULL)
1046 return *ip;
1047 } while (np->parent);
1048 /* No #size-cells property for the root node, default to 1 */
1049 return 1;
1051 EXPORT_SYMBOL(prom_n_size_cells);
1054 * Construct and return a list of the device_nodes with a given name.
1056 struct device_node *find_devices(const char *name)
1058 struct device_node *head, **prevp, *np;
1060 prevp = &head;
1061 for (np = allnodes; np != 0; np = np->allnext) {
1062 if (np->name != 0 && strcasecmp(np->name, name) == 0) {
1063 *prevp = np;
1064 prevp = &np->next;
1067 *prevp = NULL;
1068 return head;
1070 EXPORT_SYMBOL(find_devices);
1073 * Construct and return a list of the device_nodes with a given type.
1075 struct device_node *find_type_devices(const char *type)
1077 struct device_node *head, **prevp, *np;
1079 prevp = &head;
1080 for (np = allnodes; np != 0; np = np->allnext) {
1081 if (np->type != 0 && strcasecmp(np->type, type) == 0) {
1082 *prevp = np;
1083 prevp = &np->next;
1086 *prevp = NULL;
1087 return head;
1089 EXPORT_SYMBOL(find_type_devices);
1092 * Returns all nodes linked together
1094 struct device_node *find_all_nodes(void)
1096 struct device_node *head, **prevp, *np;
1098 prevp = &head;
1099 for (np = allnodes; np != 0; np = np->allnext) {
1100 *prevp = np;
1101 prevp = &np->next;
1103 *prevp = NULL;
1104 return head;
1106 EXPORT_SYMBOL(find_all_nodes);
1108 /** Checks if the given "compat" string matches one of the strings in
1109 * the device's "compatible" property
1111 int device_is_compatible(const struct device_node *device, const char *compat)
1113 const char* cp;
1114 int cplen, l;
1116 cp = get_property(device, "compatible", &cplen);
1117 if (cp == NULL)
1118 return 0;
1119 while (cplen > 0) {
1120 if (strncasecmp(cp, compat, strlen(compat)) == 0)
1121 return 1;
1122 l = strlen(cp) + 1;
1123 cp += l;
1124 cplen -= l;
1127 return 0;
1129 EXPORT_SYMBOL(device_is_compatible);
1133 * Indicates whether the root node has a given value in its
1134 * compatible property.
1136 int machine_is_compatible(const char *compat)
1138 struct device_node *root;
1139 int rc = 0;
1141 root = of_find_node_by_path("/");
1142 if (root) {
1143 rc = device_is_compatible(root, compat);
1144 of_node_put(root);
1146 return rc;
1148 EXPORT_SYMBOL(machine_is_compatible);
1151 * Construct and return a list of the device_nodes with a given type
1152 * and compatible property.
1154 struct device_node *find_compatible_devices(const char *type,
1155 const char *compat)
1157 struct device_node *head, **prevp, *np;
1159 prevp = &head;
1160 for (np = allnodes; np != 0; np = np->allnext) {
1161 if (type != NULL
1162 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1163 continue;
1164 if (device_is_compatible(np, compat)) {
1165 *prevp = np;
1166 prevp = &np->next;
1169 *prevp = NULL;
1170 return head;
1172 EXPORT_SYMBOL(find_compatible_devices);
1175 * Find the device_node with a given full_name.
1177 struct device_node *find_path_device(const char *path)
1179 struct device_node *np;
1181 for (np = allnodes; np != 0; np = np->allnext)
1182 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0)
1183 return np;
1184 return NULL;
1186 EXPORT_SYMBOL(find_path_device);
1188 /*******
1190 * New implementation of the OF "find" APIs, return a refcounted
1191 * object, call of_node_put() when done. The device tree and list
1192 * are protected by a rw_lock.
1194 * Note that property management will need some locking as well,
1195 * this isn't dealt with yet.
1197 *******/
1200 * of_find_node_by_name - Find a node by its "name" property
1201 * @from: The node to start searching from or NULL, the node
1202 * you pass will not be searched, only the next one
1203 * will; typically, you pass what the previous call
1204 * returned. of_node_put() will be called on it
1205 * @name: The name string to match against
1207 * Returns a node pointer with refcount incremented, use
1208 * of_node_put() on it when done.
1210 struct device_node *of_find_node_by_name(struct device_node *from,
1211 const char *name)
1213 struct device_node *np;
1215 read_lock(&devtree_lock);
1216 np = from ? from->allnext : allnodes;
1217 for (; np != NULL; np = np->allnext)
1218 if (np->name != NULL && strcasecmp(np->name, name) == 0
1219 && of_node_get(np))
1220 break;
1221 of_node_put(from);
1222 read_unlock(&devtree_lock);
1223 return np;
1225 EXPORT_SYMBOL(of_find_node_by_name);
1228 * of_find_node_by_type - Find a node by its "device_type" property
1229 * @from: The node to start searching from or NULL, the node
1230 * you pass will not be searched, only the next one
1231 * will; typically, you pass what the previous call
1232 * returned. of_node_put() will be called on it
1233 * @name: The type string to match against
1235 * Returns a node pointer with refcount incremented, use
1236 * of_node_put() on it when done.
1238 struct device_node *of_find_node_by_type(struct device_node *from,
1239 const char *type)
1241 struct device_node *np;
1243 read_lock(&devtree_lock);
1244 np = from ? from->allnext : allnodes;
1245 for (; np != 0; np = np->allnext)
1246 if (np->type != 0 && strcasecmp(np->type, type) == 0
1247 && of_node_get(np))
1248 break;
1249 of_node_put(from);
1250 read_unlock(&devtree_lock);
1251 return np;
1253 EXPORT_SYMBOL(of_find_node_by_type);
1256 * of_find_compatible_node - Find a node based on type and one of the
1257 * tokens in its "compatible" property
1258 * @from: The node to start searching from or NULL, the node
1259 * you pass will not be searched, only the next one
1260 * will; typically, you pass what the previous call
1261 * returned. of_node_put() will be called on it
1262 * @type: The type string to match "device_type" or NULL to ignore
1263 * @compatible: The string to match to one of the tokens in the device
1264 * "compatible" list.
1266 * Returns a node pointer with refcount incremented, use
1267 * of_node_put() on it when done.
1269 struct device_node *of_find_compatible_node(struct device_node *from,
1270 const char *type, const char *compatible)
1272 struct device_node *np;
1274 read_lock(&devtree_lock);
1275 np = from ? from->allnext : allnodes;
1276 for (; np != 0; np = np->allnext) {
1277 if (type != NULL
1278 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1279 continue;
1280 if (device_is_compatible(np, compatible) && of_node_get(np))
1281 break;
1283 of_node_put(from);
1284 read_unlock(&devtree_lock);
1285 return np;
1287 EXPORT_SYMBOL(of_find_compatible_node);
1290 * of_find_node_by_path - Find a node matching a full OF path
1291 * @path: The full path to match
1293 * Returns a node pointer with refcount incremented, use
1294 * of_node_put() on it when done.
1296 struct device_node *of_find_node_by_path(const char *path)
1298 struct device_node *np = allnodes;
1300 read_lock(&devtree_lock);
1301 for (; np != 0; np = np->allnext) {
1302 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1303 && of_node_get(np))
1304 break;
1306 read_unlock(&devtree_lock);
1307 return np;
1309 EXPORT_SYMBOL(of_find_node_by_path);
1312 * of_find_node_by_phandle - Find a node given a phandle
1313 * @handle: phandle of the node to find
1315 * Returns a node pointer with refcount incremented, use
1316 * of_node_put() on it when done.
1318 struct device_node *of_find_node_by_phandle(phandle handle)
1320 struct device_node *np;
1322 read_lock(&devtree_lock);
1323 for (np = allnodes; np != 0; np = np->allnext)
1324 if (np->linux_phandle == handle)
1325 break;
1326 of_node_get(np);
1327 read_unlock(&devtree_lock);
1328 return np;
1330 EXPORT_SYMBOL(of_find_node_by_phandle);
1333 * of_find_all_nodes - Get next node in global list
1334 * @prev: Previous node or NULL to start iteration
1335 * of_node_put() will be called on it
1337 * Returns a node pointer with refcount incremented, use
1338 * of_node_put() on it when done.
1340 struct device_node *of_find_all_nodes(struct device_node *prev)
1342 struct device_node *np;
1344 read_lock(&devtree_lock);
1345 np = prev ? prev->allnext : allnodes;
1346 for (; np != 0; np = np->allnext)
1347 if (of_node_get(np))
1348 break;
1349 of_node_put(prev);
1350 read_unlock(&devtree_lock);
1351 return np;
1353 EXPORT_SYMBOL(of_find_all_nodes);
1356 * of_get_parent - Get a node's parent if any
1357 * @node: Node to get parent
1359 * Returns a node pointer with refcount incremented, use
1360 * of_node_put() on it when done.
1362 struct device_node *of_get_parent(const struct device_node *node)
1364 struct device_node *np;
1366 if (!node)
1367 return NULL;
1369 read_lock(&devtree_lock);
1370 np = of_node_get(node->parent);
1371 read_unlock(&devtree_lock);
1372 return np;
1374 EXPORT_SYMBOL(of_get_parent);
1377 * of_get_next_child - Iterate a node childs
1378 * @node: parent node
1379 * @prev: previous child of the parent node, or NULL to get first
1381 * Returns a node pointer with refcount incremented, use
1382 * of_node_put() on it when done.
1384 struct device_node *of_get_next_child(const struct device_node *node,
1385 struct device_node *prev)
1387 struct device_node *next;
1389 read_lock(&devtree_lock);
1390 next = prev ? prev->sibling : node->child;
1391 for (; next != 0; next = next->sibling)
1392 if (of_node_get(next))
1393 break;
1394 of_node_put(prev);
1395 read_unlock(&devtree_lock);
1396 return next;
1398 EXPORT_SYMBOL(of_get_next_child);
1401 * of_node_get - Increment refcount of a node
1402 * @node: Node to inc refcount, NULL is supported to
1403 * simplify writing of callers
1405 * Returns node.
1407 struct device_node *of_node_get(struct device_node *node)
1409 if (node)
1410 kref_get(&node->kref);
1411 return node;
1413 EXPORT_SYMBOL(of_node_get);
1415 static inline struct device_node * kref_to_device_node(struct kref *kref)
1417 return container_of(kref, struct device_node, kref);
1421 * of_node_release - release a dynamically allocated node
1422 * @kref: kref element of the node to be released
1424 * In of_node_put() this function is passed to kref_put()
1425 * as the destructor.
1427 static void of_node_release(struct kref *kref)
1429 struct device_node *node = kref_to_device_node(kref);
1430 struct property *prop = node->properties;
1432 if (!OF_IS_DYNAMIC(node))
1433 return;
1434 while (prop) {
1435 struct property *next = prop->next;
1436 kfree(prop->name);
1437 kfree(prop->value);
1438 kfree(prop);
1439 prop = next;
1441 if (!prop) {
1442 prop = node->deadprops;
1443 node->deadprops = NULL;
1446 kfree(node->full_name);
1447 kfree(node->data);
1448 kfree(node);
1452 * of_node_put - Decrement refcount of a node
1453 * @node: Node to dec refcount, NULL is supported to
1454 * simplify writing of callers
1457 void of_node_put(struct device_node *node)
1459 if (node)
1460 kref_put(&node->kref, of_node_release);
1462 EXPORT_SYMBOL(of_node_put);
1465 * Plug a device node into the tree and global list.
1467 void of_attach_node(struct device_node *np)
1469 write_lock(&devtree_lock);
1470 np->sibling = np->parent->child;
1471 np->allnext = allnodes;
1472 np->parent->child = np;
1473 allnodes = np;
1474 write_unlock(&devtree_lock);
1478 * "Unplug" a node from the device tree. The caller must hold
1479 * a reference to the node. The memory associated with the node
1480 * is not freed until its refcount goes to zero.
1482 void of_detach_node(const struct device_node *np)
1484 struct device_node *parent;
1486 write_lock(&devtree_lock);
1488 parent = np->parent;
1490 if (allnodes == np)
1491 allnodes = np->allnext;
1492 else {
1493 struct device_node *prev;
1494 for (prev = allnodes;
1495 prev->allnext != np;
1496 prev = prev->allnext)
1498 prev->allnext = np->allnext;
1501 if (parent->child == np)
1502 parent->child = np->sibling;
1503 else {
1504 struct device_node *prevsib;
1505 for (prevsib = np->parent->child;
1506 prevsib->sibling != np;
1507 prevsib = prevsib->sibling)
1509 prevsib->sibling = np->sibling;
1512 write_unlock(&devtree_lock);
1515 #ifdef CONFIG_PPC_PSERIES
1517 * Fix up the uninitialized fields in a new device node:
1518 * name, type and pci-specific fields
1521 static int of_finish_dynamic_node(struct device_node *node)
1523 struct device_node *parent = of_get_parent(node);
1524 int err = 0;
1525 const phandle *ibm_phandle;
1527 node->name = get_property(node, "name", NULL);
1528 node->type = get_property(node, "device_type", NULL);
1530 if (!parent) {
1531 err = -ENODEV;
1532 goto out;
1535 /* We don't support that function on PowerMac, at least
1536 * not yet
1538 if (machine_is(powermac))
1539 return -ENODEV;
1541 /* fix up new node's linux_phandle field */
1542 if ((ibm_phandle = get_property(node, "ibm,phandle", NULL)))
1543 node->linux_phandle = *ibm_phandle;
1545 out:
1546 of_node_put(parent);
1547 return err;
1550 static int prom_reconfig_notifier(struct notifier_block *nb,
1551 unsigned long action, void *node)
1553 int err;
1555 switch (action) {
1556 case PSERIES_RECONFIG_ADD:
1557 err = of_finish_dynamic_node(node);
1558 if (err < 0) {
1559 printk(KERN_ERR "finish_node returned %d\n", err);
1560 err = NOTIFY_BAD;
1562 break;
1563 default:
1564 err = NOTIFY_DONE;
1565 break;
1567 return err;
1570 static struct notifier_block prom_reconfig_nb = {
1571 .notifier_call = prom_reconfig_notifier,
1572 .priority = 10, /* This one needs to run first */
1575 static int __init prom_reconfig_setup(void)
1577 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1579 __initcall(prom_reconfig_setup);
1580 #endif
1582 struct property *of_find_property(const struct device_node *np,
1583 const char *name,
1584 int *lenp)
1586 struct property *pp;
1588 read_lock(&devtree_lock);
1589 for (pp = np->properties; pp != 0; pp = pp->next)
1590 if (strcmp(pp->name, name) == 0) {
1591 if (lenp != 0)
1592 *lenp = pp->length;
1593 break;
1595 read_unlock(&devtree_lock);
1597 return pp;
1599 EXPORT_SYMBOL(of_find_property);
1602 * Find a property with a given name for a given node
1603 * and return the value.
1605 const void *get_property(const struct device_node *np, const char *name,
1606 int *lenp)
1608 struct property *pp = of_find_property(np,name,lenp);
1609 return pp ? pp->value : NULL;
1611 EXPORT_SYMBOL(get_property);
1614 * Add a property to a node
1616 int prom_add_property(struct device_node* np, struct property* prop)
1618 struct property **next;
1620 prop->next = NULL;
1621 write_lock(&devtree_lock);
1622 next = &np->properties;
1623 while (*next) {
1624 if (strcmp(prop->name, (*next)->name) == 0) {
1625 /* duplicate ! don't insert it */
1626 write_unlock(&devtree_lock);
1627 return -1;
1629 next = &(*next)->next;
1631 *next = prop;
1632 write_unlock(&devtree_lock);
1634 #ifdef CONFIG_PROC_DEVICETREE
1635 /* try to add to proc as well if it was initialized */
1636 if (np->pde)
1637 proc_device_tree_add_prop(np->pde, prop);
1638 #endif /* CONFIG_PROC_DEVICETREE */
1640 return 0;
1644 * Remove a property from a node. Note that we don't actually
1645 * remove it, since we have given out who-knows-how-many pointers
1646 * to the data using get-property. Instead we just move the property
1647 * to the "dead properties" list, so it won't be found any more.
1649 int prom_remove_property(struct device_node *np, struct property *prop)
1651 struct property **next;
1652 int found = 0;
1654 write_lock(&devtree_lock);
1655 next = &np->properties;
1656 while (*next) {
1657 if (*next == prop) {
1658 /* found the node */
1659 *next = prop->next;
1660 prop->next = np->deadprops;
1661 np->deadprops = prop;
1662 found = 1;
1663 break;
1665 next = &(*next)->next;
1667 write_unlock(&devtree_lock);
1669 if (!found)
1670 return -ENODEV;
1672 #ifdef CONFIG_PROC_DEVICETREE
1673 /* try to remove the proc node as well */
1674 if (np->pde)
1675 proc_device_tree_remove_prop(np->pde, prop);
1676 #endif /* CONFIG_PROC_DEVICETREE */
1678 return 0;
1682 * Update a property in a node. Note that we don't actually
1683 * remove it, since we have given out who-knows-how-many pointers
1684 * to the data using get-property. Instead we just move the property
1685 * to the "dead properties" list, and add the new property to the
1686 * property list
1688 int prom_update_property(struct device_node *np,
1689 struct property *newprop,
1690 struct property *oldprop)
1692 struct property **next;
1693 int found = 0;
1695 write_lock(&devtree_lock);
1696 next = &np->properties;
1697 while (*next) {
1698 if (*next == oldprop) {
1699 /* found the node */
1700 newprop->next = oldprop->next;
1701 *next = newprop;
1702 oldprop->next = np->deadprops;
1703 np->deadprops = oldprop;
1704 found = 1;
1705 break;
1707 next = &(*next)->next;
1709 write_unlock(&devtree_lock);
1711 if (!found)
1712 return -ENODEV;
1714 #ifdef CONFIG_PROC_DEVICETREE
1715 /* try to add to proc as well if it was initialized */
1716 if (np->pde)
1717 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1718 #endif /* CONFIG_PROC_DEVICETREE */
1720 return 0;
1724 /* Find the device node for a given logical cpu number, also returns the cpu
1725 * local thread number (index in ibm,interrupt-server#s) if relevant and
1726 * asked for (non NULL)
1728 struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
1730 int hardid;
1731 struct device_node *np;
1733 hardid = get_hard_smp_processor_id(cpu);
1735 for_each_node_by_type(np, "cpu") {
1736 const u32 *intserv;
1737 unsigned int plen, t;
1739 /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist
1740 * fallback to "reg" property and assume no threads
1742 intserv = get_property(np, "ibm,ppc-interrupt-server#s",
1743 &plen);
1744 if (intserv == NULL) {
1745 const u32 *reg = get_property(np, "reg", NULL);
1746 if (reg == NULL)
1747 continue;
1748 if (*reg == hardid) {
1749 if (thread)
1750 *thread = 0;
1751 return np;
1753 } else {
1754 plen /= sizeof(u32);
1755 for (t = 0; t < plen; t++) {
1756 if (hardid == intserv[t]) {
1757 if (thread)
1758 *thread = t;
1759 return np;
1764 return NULL;
1766 EXPORT_SYMBOL(of_get_cpu_node);
1768 #ifdef DEBUG
1769 static struct debugfs_blob_wrapper flat_dt_blob;
1771 static int __init export_flat_device_tree(void)
1773 struct dentry *d;
1775 d = debugfs_create_dir("powerpc", NULL);
1776 if (!d)
1777 return 1;
1779 flat_dt_blob.data = initial_boot_params;
1780 flat_dt_blob.size = initial_boot_params->totalsize;
1782 d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR,
1783 d, &flat_dt_blob);
1784 if (!d)
1785 return 1;
1787 return 0;
1789 __initcall(export_flat_device_tree);
1790 #endif