2 * Procedures for creating, accessing and interpreting the device tree.
4 * Paul Mackerras August 1996.
5 * Copyright (C) 1996-2005 Paul Mackerras.
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.
19 #include <linux/config.h>
20 #include <linux/kernel.h>
21 #include <linux/string.h>
22 #include <linux/init.h>
23 #include <linux/threads.h>
24 #include <linux/spinlock.h>
25 #include <linux/types.h>
26 #include <linux/pci.h>
27 #include <linux/stringify.h>
28 #include <linux/delay.h>
29 #include <linux/initrd.h>
30 #include <linux/bitops.h>
31 #include <linux/module.h>
32 #include <linux/kexec.h>
38 #include <asm/processor.h>
41 #include <asm/kdump.h>
43 #include <asm/system.h>
45 #include <asm/pgtable.h>
47 #include <asm/iommu.h>
48 #include <asm/btext.h>
49 #include <asm/sections.h>
50 #include <asm/machdep.h>
51 #include <asm/pSeries_reconfig.h>
52 #include <asm/pci-bridge.h>
55 #define DBG(fmt...) printk(KERN_ERR fmt)
61 static int __initdata dt_root_addr_cells
;
62 static int __initdata dt_root_size_cells
;
65 static int __initdata iommu_is_off
;
66 int __initdata iommu_force_on
;
67 unsigned long tce_alloc_start
, tce_alloc_end
;
73 static struct boot_param_header
*initial_boot_params __initdata
;
75 struct boot_param_header
*initial_boot_params
;
78 static struct device_node
*allnodes
= NULL
;
80 /* use when traversing tree through the allnext, child, sibling,
81 * or parent members of struct device_node.
83 static DEFINE_RWLOCK(devtree_lock
);
85 /* export that to outside world */
86 struct device_node
*of_chosen
;
88 struct device_node
*dflt_interrupt_controller
;
89 int num_interrupt_controllers
;
92 * Wrapper for allocating memory for various data that needs to be
93 * attached to device nodes as they are processed at boot or when
94 * added to the device tree later (e.g. DLPAR). At boot there is
95 * already a region reserved so we just increment *mem_start by size;
96 * otherwise we call kmalloc.
98 static void * prom_alloc(unsigned long size
, unsigned long *mem_start
)
103 return kmalloc(size
, GFP_KERNEL
);
111 * Find the device_node with a given phandle.
113 static struct device_node
* find_phandle(phandle ph
)
115 struct device_node
*np
;
117 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
118 if (np
->linux_phandle
== ph
)
124 * Find the interrupt parent of a node.
126 static struct device_node
* __devinit
intr_parent(struct device_node
*p
)
130 parp
= (phandle
*) get_property(p
, "interrupt-parent", NULL
);
133 p
= find_phandle(*parp
);
137 * On a powermac booted with BootX, we don't get to know the
138 * phandles for any nodes, so find_phandle will return NULL.
139 * Fortunately these machines only have one interrupt controller
140 * so there isn't in fact any ambiguity. -- paulus
142 if (num_interrupt_controllers
== 1)
143 p
= dflt_interrupt_controller
;
148 * Find out the size of each entry of the interrupts property
151 int __devinit
prom_n_intr_cells(struct device_node
*np
)
153 struct device_node
*p
;
156 for (p
= np
; (p
= intr_parent(p
)) != NULL
; ) {
157 icp
= (unsigned int *)
158 get_property(p
, "#interrupt-cells", NULL
);
161 if (get_property(p
, "interrupt-controller", NULL
) != NULL
162 || get_property(p
, "interrupt-map", NULL
) != NULL
) {
163 printk("oops, node %s doesn't have #interrupt-cells\n",
169 printk("prom_n_intr_cells failed for %s\n", np
->full_name
);
175 * Map an interrupt from a device up to the platform interrupt
178 static int __devinit
map_interrupt(unsigned int **irq
, struct device_node
**ictrler
,
179 struct device_node
*np
, unsigned int *ints
,
182 struct device_node
*p
, *ipar
;
183 unsigned int *imap
, *imask
, *ip
;
184 int i
, imaplen
, match
;
185 int newintrc
= 0, newaddrc
= 0;
189 reg
= (unsigned int *) get_property(np
, "reg", NULL
);
190 naddrc
= prom_n_addr_cells(np
);
193 if (get_property(p
, "interrupt-controller", NULL
) != NULL
)
194 /* this node is an interrupt controller, stop here */
196 imap
= (unsigned int *)
197 get_property(p
, "interrupt-map", &imaplen
);
202 imask
= (unsigned int *)
203 get_property(p
, "interrupt-map-mask", NULL
);
205 printk("oops, %s has interrupt-map but no mask\n",
209 imaplen
/= sizeof(unsigned int);
212 while (imaplen
> 0 && !match
) {
213 /* check the child-interrupt field */
215 for (i
= 0; i
< naddrc
&& match
; ++i
)
216 match
= ((reg
[i
] ^ imap
[i
]) & imask
[i
]) == 0;
217 for (; i
< naddrc
+ nintrc
&& match
; ++i
)
218 match
= ((ints
[i
-naddrc
] ^ imap
[i
]) & imask
[i
]) == 0;
219 imap
+= naddrc
+ nintrc
;
220 imaplen
-= naddrc
+ nintrc
;
221 /* grab the interrupt parent */
222 ipar
= find_phandle((phandle
) *imap
++);
224 if (ipar
== NULL
&& num_interrupt_controllers
== 1)
225 /* cope with BootX not giving us phandles */
226 ipar
= dflt_interrupt_controller
;
228 printk("oops, no int parent %x in map of %s\n",
229 imap
[-1], p
->full_name
);
232 /* find the parent's # addr and intr cells */
233 ip
= (unsigned int *)
234 get_property(ipar
, "#interrupt-cells", NULL
);
236 printk("oops, no #interrupt-cells on %s\n",
241 ip
= (unsigned int *)
242 get_property(ipar
, "#address-cells", NULL
);
243 newaddrc
= (ip
== NULL
)? 0: *ip
;
244 imap
+= newaddrc
+ newintrc
;
245 imaplen
-= newaddrc
+ newintrc
;
248 printk("oops, error decoding int-map on %s, len=%d\n",
249 p
->full_name
, imaplen
);
254 printk("oops, no match in %s int-map for %s\n",
255 p
->full_name
, np
->full_name
);
262 ints
= imap
- nintrc
;
267 printk("hmmm, int tree for %s doesn't have ctrler\n",
277 static unsigned char map_isa_senses
[4] = {
278 IRQ_SENSE_LEVEL
| IRQ_POLARITY_NEGATIVE
,
279 IRQ_SENSE_LEVEL
| IRQ_POLARITY_POSITIVE
,
280 IRQ_SENSE_EDGE
| IRQ_POLARITY_NEGATIVE
,
281 IRQ_SENSE_EDGE
| IRQ_POLARITY_POSITIVE
284 static unsigned char map_mpic_senses
[4] = {
285 IRQ_SENSE_EDGE
| IRQ_POLARITY_POSITIVE
,
286 IRQ_SENSE_LEVEL
| IRQ_POLARITY_NEGATIVE
,
287 /* 2 seems to be used for the 8259 cascade... */
288 IRQ_SENSE_LEVEL
| IRQ_POLARITY_POSITIVE
,
289 IRQ_SENSE_EDGE
| IRQ_POLARITY_NEGATIVE
,
292 static int __devinit
finish_node_interrupts(struct device_node
*np
,
293 unsigned long *mem_start
,
297 int intlen
, intrcells
, intrcount
;
299 unsigned int *irq
, virq
;
300 struct device_node
*ic
;
303 //#define TRACE(fmt...) do { if (trace) { printk(fmt); mdelay(1000); } } while(0)
304 #define TRACE(fmt...)
306 if (!strcmp(np
->name
, "smu-doorbell"))
309 TRACE("Finishing SMU doorbell ! num_interrupt_controllers = %d\n",
310 num_interrupt_controllers
);
312 if (num_interrupt_controllers
== 0) {
314 * Old machines just have a list of interrupt numbers
315 * and no interrupt-controller nodes.
317 ints
= (unsigned int *) get_property(np
, "AAPL,interrupts",
319 /* XXX old interpret_pci_props looked in parent too */
320 /* XXX old interpret_macio_props looked for interrupts
321 before AAPL,interrupts */
323 ints
= (unsigned int *) get_property(np
, "interrupts",
328 np
->n_intrs
= intlen
/ sizeof(unsigned int);
329 np
->intrs
= prom_alloc(np
->n_intrs
* sizeof(np
->intrs
[0]),
336 for (i
= 0; i
< np
->n_intrs
; ++i
) {
337 np
->intrs
[i
].line
= *ints
++;
338 np
->intrs
[i
].sense
= IRQ_SENSE_LEVEL
339 | IRQ_POLARITY_NEGATIVE
;
344 ints
= (unsigned int *) get_property(np
, "interrupts", &intlen
);
345 TRACE("ints=%p, intlen=%d\n", ints
, intlen
);
348 intrcells
= prom_n_intr_cells(np
);
349 intlen
/= intrcells
* sizeof(unsigned int);
350 TRACE("intrcells=%d, new intlen=%d\n", intrcells
, intlen
);
351 np
->intrs
= prom_alloc(intlen
* sizeof(*(np
->intrs
)), mem_start
);
359 for (i
= 0; i
< intlen
; ++i
, ints
+= intrcells
) {
360 n
= map_interrupt(&irq
, &ic
, np
, ints
, intrcells
);
361 TRACE("map, irq=%d, ic=%p, n=%d\n", irq
, ic
, n
);
365 /* don't map IRQ numbers under a cascaded 8259 controller */
366 if (ic
&& device_is_compatible(ic
, "chrp,iic")) {
367 np
->intrs
[intrcount
].line
= irq
[0];
368 sense
= (n
> 1)? (irq
[1] & 3): 3;
369 np
->intrs
[intrcount
].sense
= map_isa_senses
[sense
];
371 virq
= virt_irq_create_mapping(irq
[0]);
372 TRACE("virq=%d\n", virq
);
374 if (virq
== NO_IRQ
) {
375 printk(KERN_CRIT
"Could not allocate interrupt"
376 " number for %s\n", np
->full_name
);
380 np
->intrs
[intrcount
].line
= irq_offset_up(virq
);
381 sense
= (n
> 1)? (irq
[1] & 3): 1;
383 /* Apple uses bits in there in a different way, let's
384 * only keep the real sense bit on macs
386 if (_machine
== PLATFORM_POWERMAC
)
388 np
->intrs
[intrcount
].sense
= map_mpic_senses
[sense
];
392 /* We offset irq numbers for the u3 MPIC by 128 in PowerMac */
393 if (_machine
== PLATFORM_POWERMAC
&& ic
&& ic
->parent
) {
394 char *name
= get_property(ic
->parent
, "name", NULL
);
395 if (name
&& !strcmp(name
, "u3"))
396 np
->intrs
[intrcount
].line
+= 128;
397 else if (!(name
&& (!strcmp(name
, "mac-io") ||
398 !strcmp(name
, "u4"))))
399 /* ignore other cascaded controllers, such as
403 #endif /* CONFIG_PPC64 */
405 printk("hmmm, got %d intr cells for %s:", n
,
407 for (j
= 0; j
< n
; ++j
)
408 printk(" %d", irq
[j
]);
413 np
->n_intrs
= intrcount
;
418 static int __devinit
finish_node(struct device_node
*np
,
419 unsigned long *mem_start
,
422 struct device_node
*child
;
425 rc
= finish_node_interrupts(np
, mem_start
, measure_only
);
429 for (child
= np
->child
; child
!= NULL
; child
= child
->sibling
) {
430 rc
= finish_node(child
, mem_start
, measure_only
);
438 static void __init
scan_interrupt_controllers(void)
440 struct device_node
*np
;
445 for (np
= allnodes
; np
!= NULL
; np
= np
->allnext
) {
446 ic
= get_property(np
, "interrupt-controller", &iclen
);
447 name
= get_property(np
, "name", NULL
);
448 /* checking iclen makes sure we don't get a false
449 match on /chosen.interrupt_controller */
451 && strcmp(name
, "interrupt-controller") == 0)
452 || (ic
!= NULL
&& iclen
== 0
453 && strcmp(name
, "AppleKiwi"))) {
455 dflt_interrupt_controller
= np
;
459 num_interrupt_controllers
= n
;
463 * finish_device_tree is called once things are running normally
464 * (i.e. with text and data mapped to the address they were linked at).
465 * It traverses the device tree and fills in some of the additional,
466 * fields in each node like {n_}addrs and {n_}intrs, the virt interrupt
467 * mapping is also initialized at this point.
469 void __init
finish_device_tree(void)
471 unsigned long start
, end
, size
= 0;
473 DBG(" -> finish_device_tree\n");
476 /* Initialize virtual IRQ map */
479 scan_interrupt_controllers();
482 * Finish device-tree (pre-parsing some properties etc...)
483 * We do this in 2 passes. One with "measure_only" set, which
484 * will only measure the amount of memory needed, then we can
485 * allocate that memory, and call finish_node again. However,
486 * we must be careful as most routines will fail nowadays when
487 * prom_alloc() returns 0, so we must make sure our first pass
488 * doesn't start at 0. We pre-initialize size to 16 for that
489 * reason and then remove those additional 16 bytes
492 finish_node(allnodes
, &size
, 1);
498 end
= start
= (unsigned long)__va(lmb_alloc(size
, 128));
500 finish_node(allnodes
, &end
, 0);
501 BUG_ON(end
!= start
+ size
);
503 DBG(" <- finish_device_tree\n");
506 static inline char *find_flat_dt_string(u32 offset
)
508 return ((char *)initial_boot_params
) +
509 initial_boot_params
->off_dt_strings
+ offset
;
513 * This function is used to scan the flattened device-tree, it is
514 * used to extract the memory informations at boot before we can
517 int __init
of_scan_flat_dt(int (*it
)(unsigned long node
,
518 const char *uname
, int depth
,
522 unsigned long p
= ((unsigned long)initial_boot_params
) +
523 initial_boot_params
->off_dt_struct
;
528 u32 tag
= *((u32
*)p
);
532 if (tag
== OF_DT_END_NODE
) {
536 if (tag
== OF_DT_NOP
)
538 if (tag
== OF_DT_END
)
540 if (tag
== OF_DT_PROP
) {
541 u32 sz
= *((u32
*)p
);
543 if (initial_boot_params
->version
< 0x10)
544 p
= _ALIGN(p
, sz
>= 8 ? 8 : 4);
549 if (tag
!= OF_DT_BEGIN_NODE
) {
550 printk(KERN_WARNING
"Invalid tag %x scanning flattened"
551 " device tree !\n", tag
);
556 p
= _ALIGN(p
+ strlen(pathp
) + 1, 4);
557 if ((*pathp
) == '/') {
559 for (lp
= NULL
, np
= pathp
; *np
; np
++)
565 rc
= it(p
, pathp
, depth
, data
);
574 * This function can be used within scan_flattened_dt callback to get
575 * access to properties
577 void* __init
of_get_flat_dt_prop(unsigned long node
, const char *name
,
580 unsigned long p
= node
;
583 u32 tag
= *((u32
*)p
);
588 if (tag
== OF_DT_NOP
)
590 if (tag
!= OF_DT_PROP
)
594 noff
= *((u32
*)(p
+ 4));
596 if (initial_boot_params
->version
< 0x10)
597 p
= _ALIGN(p
, sz
>= 8 ? 8 : 4);
599 nstr
= find_flat_dt_string(noff
);
601 printk(KERN_WARNING
"Can't find property index"
605 if (strcmp(name
, nstr
) == 0) {
615 static void *__init
unflatten_dt_alloc(unsigned long *mem
, unsigned long size
,
620 *mem
= _ALIGN(*mem
, align
);
627 static unsigned long __init
unflatten_dt_node(unsigned long mem
,
629 struct device_node
*dad
,
630 struct device_node
***allnextpp
,
631 unsigned long fpsize
)
633 struct device_node
*np
;
634 struct property
*pp
, **prev_pp
= NULL
;
637 unsigned int l
, allocl
;
641 tag
= *((u32
*)(*p
));
642 if (tag
!= OF_DT_BEGIN_NODE
) {
643 printk("Weird tag at start of node: %x\n", tag
);
648 l
= allocl
= strlen(pathp
) + 1;
649 *p
= _ALIGN(*p
+ l
, 4);
651 /* version 0x10 has a more compact unit name here instead of the full
652 * path. we accumulate the full path size using "fpsize", we'll rebuild
653 * it later. We detect this because the first character of the name is
656 if ((*pathp
) != '/') {
659 /* root node: special case. fpsize accounts for path
660 * plus terminating zero. root node only has '/', so
661 * fpsize should be 2, but we want to avoid the first
662 * level nodes to have two '/' so we use fpsize 1 here
667 /* account for '/' and path size minus terminal 0
676 np
= unflatten_dt_alloc(&mem
, sizeof(struct device_node
) + allocl
,
677 __alignof__(struct device_node
));
679 memset(np
, 0, sizeof(*np
));
680 np
->full_name
= ((char*)np
) + sizeof(struct device_node
);
682 char *p
= np
->full_name
;
683 /* rebuild full path for new format */
684 if (dad
&& dad
->parent
) {
685 strcpy(p
, dad
->full_name
);
687 if ((strlen(p
) + l
+ 1) != allocl
) {
688 DBG("%s: p: %d, l: %d, a: %d\n",
689 pathp
, strlen(p
), l
, allocl
);
697 memcpy(np
->full_name
, pathp
, l
);
698 prev_pp
= &np
->properties
;
700 *allnextpp
= &np
->allnext
;
703 /* we temporarily use the next field as `last_child'*/
707 dad
->next
->sibling
= np
;
710 kref_init(&np
->kref
);
716 tag
= *((u32
*)(*p
));
717 if (tag
== OF_DT_NOP
) {
721 if (tag
!= OF_DT_PROP
)
725 noff
= *((u32
*)((*p
) + 4));
727 if (initial_boot_params
->version
< 0x10)
728 *p
= _ALIGN(*p
, sz
>= 8 ? 8 : 4);
730 pname
= find_flat_dt_string(noff
);
732 printk("Can't find property name in list !\n");
735 if (strcmp(pname
, "name") == 0)
737 l
= strlen(pname
) + 1;
738 pp
= unflatten_dt_alloc(&mem
, sizeof(struct property
),
739 __alignof__(struct property
));
741 if (strcmp(pname
, "linux,phandle") == 0) {
742 np
->node
= *((u32
*)*p
);
743 if (np
->linux_phandle
== 0)
744 np
->linux_phandle
= np
->node
;
746 if (strcmp(pname
, "ibm,phandle") == 0)
747 np
->linux_phandle
= *((u32
*)*p
);
750 pp
->value
= (void *)*p
;
754 *p
= _ALIGN((*p
) + sz
, 4);
756 /* with version 0x10 we may not have the name property, recreate
757 * it here from the unit name if absent
760 char *p
= pathp
, *ps
= pathp
, *pa
= NULL
;
773 pp
= unflatten_dt_alloc(&mem
, sizeof(struct property
) + sz
,
774 __alignof__(struct property
));
778 pp
->value
= (unsigned char *)(pp
+ 1);
781 memcpy(pp
->value
, ps
, sz
- 1);
782 ((char *)pp
->value
)[sz
- 1] = 0;
783 DBG("fixed up name for %s -> %s\n", pathp
, pp
->value
);
788 np
->name
= get_property(np
, "name", NULL
);
789 np
->type
= get_property(np
, "device_type", NULL
);
796 while (tag
== OF_DT_BEGIN_NODE
) {
797 mem
= unflatten_dt_node(mem
, p
, np
, allnextpp
, fpsize
);
798 tag
= *((u32
*)(*p
));
800 if (tag
!= OF_DT_END_NODE
) {
801 printk("Weird tag at end of node: %x\n", tag
);
810 * unflattens the device-tree passed by the firmware, creating the
811 * tree of struct device_node. It also fills the "name" and "type"
812 * pointers of the nodes so the normal device-tree walking functions
813 * can be used (this used to be done by finish_device_tree)
815 void __init
unflatten_device_tree(void)
817 unsigned long start
, mem
, size
;
818 struct device_node
**allnextp
= &allnodes
;
820 DBG(" -> unflatten_device_tree()\n");
822 /* First pass, scan for size */
823 start
= ((unsigned long)initial_boot_params
) +
824 initial_boot_params
->off_dt_struct
;
825 size
= unflatten_dt_node(0, &start
, NULL
, NULL
, 0);
826 size
= (size
| 3) + 1;
828 DBG(" size is %lx, allocating...\n", size
);
830 /* Allocate memory for the expanded device tree */
831 mem
= lmb_alloc(size
+ 4, __alignof__(struct device_node
));
832 mem
= (unsigned long) __va(mem
);
834 ((u32
*)mem
)[size
/ 4] = 0xdeadbeef;
836 DBG(" unflattening %lx...\n", mem
);
838 /* Second pass, do actual unflattening */
839 start
= ((unsigned long)initial_boot_params
) +
840 initial_boot_params
->off_dt_struct
;
841 unflatten_dt_node(mem
, &start
, NULL
, &allnextp
, 0);
842 if (*((u32
*)start
) != OF_DT_END
)
843 printk(KERN_WARNING
"Weird tag at end of tree: %08x\n", *((u32
*)start
));
844 if (((u32
*)mem
)[size
/ 4] != 0xdeadbeef)
845 printk(KERN_WARNING
"End of tree marker overwritten: %08x\n",
846 ((u32
*)mem
)[size
/ 4] );
849 /* Get pointer to OF "/chosen" node for use everywhere */
850 of_chosen
= of_find_node_by_path("/chosen");
851 if (of_chosen
== NULL
)
852 of_chosen
= of_find_node_by_path("/chosen@0");
854 DBG(" <- unflatten_device_tree()\n");
857 static int __init
early_init_dt_scan_cpus(unsigned long node
,
858 const char *uname
, int depth
,
861 static int logical_cpuid
= 0;
862 char *type
= of_get_flat_dt_prop(node
, "device_type", NULL
);
868 /* We are scanning "cpu" nodes only */
869 if (type
== NULL
|| strcmp(type
, "cpu") != 0)
872 /* Get physical cpuid */
873 intserv
= of_get_flat_dt_prop(node
, "ibm,ppc-interrupt-server#s", &len
);
875 nthreads
= len
/ sizeof(int);
877 intserv
= of_get_flat_dt_prop(node
, "reg", NULL
);
882 * Now see if any of these threads match our boot cpu.
883 * NOTE: This must match the parsing done in smp_setup_cpu_maps.
885 for (i
= 0; i
< nthreads
; i
++) {
887 * version 2 of the kexec param format adds the phys cpuid of
890 if (initial_boot_params
&& initial_boot_params
->version
>= 2) {
892 initial_boot_params
->boot_cpuid_phys
) {
898 * Check if it's the boot-cpu, set it's hw index now,
899 * unfortunately this format did not support booting
900 * off secondary threads.
902 if (of_get_flat_dt_prop(node
,
903 "linux,boot-cpu", NULL
) != NULL
) {
910 /* logical cpu id is always 0 on UP kernels */
916 DBG("boot cpu: logical %d physical %d\n", logical_cpuid
,
918 boot_cpuid
= logical_cpuid
;
919 set_hard_smp_processor_id(boot_cpuid
, intserv
[i
]);
922 #ifdef CONFIG_ALTIVEC
923 /* Check if we have a VMX and eventually update CPU features */
924 prop
= (u32
*)of_get_flat_dt_prop(node
, "ibm,vmx", NULL
);
925 if (prop
&& (*prop
) > 0) {
926 cur_cpu_spec
->cpu_features
|= CPU_FTR_ALTIVEC
;
927 cur_cpu_spec
->cpu_user_features
|= PPC_FEATURE_HAS_ALTIVEC
;
930 /* Same goes for Apple's "altivec" property */
931 prop
= (u32
*)of_get_flat_dt_prop(node
, "altivec", NULL
);
933 cur_cpu_spec
->cpu_features
|= CPU_FTR_ALTIVEC
;
934 cur_cpu_spec
->cpu_user_features
|= PPC_FEATURE_HAS_ALTIVEC
;
936 #endif /* CONFIG_ALTIVEC */
938 #ifdef CONFIG_PPC_PSERIES
940 cur_cpu_spec
->cpu_features
|= CPU_FTR_SMT
;
942 cur_cpu_spec
->cpu_features
&= ~CPU_FTR_SMT
;
948 static int __init
early_init_dt_scan_chosen(unsigned long node
,
949 const char *uname
, int depth
, void *data
)
952 unsigned long *lprop
;
956 DBG("search \"chosen\", depth: %d, uname: %s\n", depth
, uname
);
959 (strcmp(uname
, "chosen") != 0 && strcmp(uname
, "chosen@0") != 0))
962 /* get platform type */
963 prop
= (u32
*)of_get_flat_dt_prop(node
, "linux,platform", NULL
);
966 #ifdef CONFIG_PPC_MULTIPLATFORM
971 /* check if iommu is forced on or off */
972 if (of_get_flat_dt_prop(node
, "linux,iommu-off", NULL
) != NULL
)
974 if (of_get_flat_dt_prop(node
, "linux,iommu-force-on", NULL
) != NULL
)
978 lprop
= of_get_flat_dt_prop(node
, "linux,memory-limit", NULL
);
980 memory_limit
= *lprop
;
983 lprop
= of_get_flat_dt_prop(node
, "linux,tce-alloc-start", NULL
);
985 tce_alloc_start
= *lprop
;
986 lprop
= of_get_flat_dt_prop(node
, "linux,tce-alloc-end", NULL
);
988 tce_alloc_end
= *lprop
;
991 #ifdef CONFIG_PPC_RTAS
992 /* To help early debugging via the front panel, we retrieve a minimal
993 * set of RTAS infos now if available
998 basep
= of_get_flat_dt_prop(node
, "linux,rtas-base", NULL
);
999 entryp
= of_get_flat_dt_prop(node
, "linux,rtas-entry", NULL
);
1000 prop
= of_get_flat_dt_prop(node
, "linux,rtas-size", NULL
);
1001 if (basep
&& entryp
&& prop
) {
1003 rtas
.entry
= *entryp
;
1007 #endif /* CONFIG_PPC_RTAS */
1010 lprop
= (u64
*)of_get_flat_dt_prop(node
, "linux,crashkernel-base", NULL
);
1012 crashk_res
.start
= *lprop
;
1014 lprop
= (u64
*)of_get_flat_dt_prop(node
, "linux,crashkernel-size", NULL
);
1016 crashk_res
.end
= crashk_res
.start
+ *lprop
- 1;
1019 /* Retreive command line */
1020 p
= of_get_flat_dt_prop(node
, "bootargs", &l
);
1021 if (p
!= NULL
&& l
> 0)
1022 strlcpy(cmd_line
, p
, min((int)l
, COMMAND_LINE_SIZE
));
1024 #ifdef CONFIG_CMDLINE
1025 if (l
== 0 || (l
== 1 && (*p
) == 0))
1026 strlcpy(cmd_line
, CONFIG_CMDLINE
, COMMAND_LINE_SIZE
);
1027 #endif /* CONFIG_CMDLINE */
1029 DBG("Command line is: %s\n", cmd_line
);
1031 if (strstr(cmd_line
, "mem=")) {
1033 unsigned long maxmem
= 0;
1035 for (q
= cmd_line
; (p
= strstr(q
, "mem=")) != 0; ) {
1037 if (p
> cmd_line
&& p
[-1] != ' ')
1039 maxmem
= simple_strtoul(q
, &q
, 0);
1040 if (*q
== 'k' || *q
== 'K') {
1043 } else if (*q
== 'm' || *q
== 'M') {
1046 } else if (*q
== 'g' || *q
== 'G') {
1051 memory_limit
= maxmem
;
1058 static int __init
early_init_dt_scan_root(unsigned long node
,
1059 const char *uname
, int depth
, void *data
)
1066 prop
= of_get_flat_dt_prop(node
, "#size-cells", NULL
);
1067 dt_root_size_cells
= (prop
== NULL
) ? 1 : *prop
;
1068 DBG("dt_root_size_cells = %x\n", dt_root_size_cells
);
1070 prop
= of_get_flat_dt_prop(node
, "#address-cells", NULL
);
1071 dt_root_addr_cells
= (prop
== NULL
) ? 2 : *prop
;
1072 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells
);
1078 static unsigned long __init
dt_mem_next_cell(int s
, cell_t
**cellp
)
1083 /* Ignore more than 2 cells */
1084 while (s
> sizeof(unsigned long) / 4) {
1102 static int __init
early_init_dt_scan_memory(unsigned long node
,
1103 const char *uname
, int depth
, void *data
)
1105 char *type
= of_get_flat_dt_prop(node
, "device_type", NULL
);
1109 /* We are scanning "memory" nodes only */
1112 * The longtrail doesn't have a device_type on the
1113 * /memory node, so look for the node called /memory@0.
1115 if (depth
!= 1 || strcmp(uname
, "memory@0") != 0)
1117 } else if (strcmp(type
, "memory") != 0)
1120 reg
= (cell_t
*)of_get_flat_dt_prop(node
, "linux,usable-memory", &l
);
1122 reg
= (cell_t
*)of_get_flat_dt_prop(node
, "reg", &l
);
1126 endp
= reg
+ (l
/ sizeof(cell_t
));
1128 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
1129 uname
, l
, reg
[0], reg
[1], reg
[2], reg
[3]);
1131 while ((endp
- reg
) >= (dt_root_addr_cells
+ dt_root_size_cells
)) {
1132 unsigned long base
, size
;
1134 base
= dt_mem_next_cell(dt_root_addr_cells
, ®
);
1135 size
= dt_mem_next_cell(dt_root_size_cells
, ®
);
1139 DBG(" - %lx , %lx\n", base
, size
);
1142 if (base
>= 0x80000000ul
)
1144 if ((base
+ size
) > 0x80000000ul
)
1145 size
= 0x80000000ul
- base
;
1148 lmb_add(base
, size
);
1153 static void __init
early_reserve_mem(void)
1158 reserve_map
= (u64
*)(((unsigned long)initial_boot_params
) +
1159 initial_boot_params
->off_mem_rsvmap
);
1162 * Handle the case where we might be booting from an old kexec
1163 * image that setup the mem_rsvmap as pairs of 32-bit values
1165 if (*reserve_map
> 0xffffffffull
) {
1166 u32 base_32
, size_32
;
1167 u32
*reserve_map_32
= (u32
*)reserve_map
;
1170 base_32
= *(reserve_map_32
++);
1171 size_32
= *(reserve_map_32
++);
1174 DBG("reserving: %x -> %x\n", base_32
, size_32
);
1175 lmb_reserve(base_32
, size_32
);
1181 base
= *(reserve_map
++);
1182 size
= *(reserve_map
++);
1185 DBG("reserving: %llx -> %llx\n", base
, size
);
1186 lmb_reserve(base
, size
);
1190 DBG("memory reserved, lmbs :\n");
1195 void __init
early_init_devtree(void *params
)
1197 DBG(" -> early_init_devtree()\n");
1199 /* Setup flat device-tree pointer */
1200 initial_boot_params
= params
;
1202 /* Retrieve various informations from the /chosen node of the
1203 * device-tree, including the platform type, initrd location and
1204 * size, TCE reserve, and more ...
1206 of_scan_flat_dt(early_init_dt_scan_chosen
, NULL
);
1208 /* Scan memory nodes and rebuild LMBs */
1210 of_scan_flat_dt(early_init_dt_scan_root
, NULL
);
1211 of_scan_flat_dt(early_init_dt_scan_memory
, NULL
);
1212 lmb_enforce_memory_limit(memory_limit
);
1215 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1217 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
1218 lmb_reserve(PHYSICAL_START
, __pa(klimit
) - PHYSICAL_START
);
1219 #ifdef CONFIG_CRASH_DUMP
1220 lmb_reserve(0, KDUMP_RESERVE_LIMIT
);
1222 early_reserve_mem();
1224 DBG("Scanning CPUs ...\n");
1226 /* Retreive CPU related informations from the flat tree
1227 * (altivec support, boot CPU ID, ...)
1229 of_scan_flat_dt(early_init_dt_scan_cpus
, NULL
);
1231 DBG(" <- early_init_devtree()\n");
1237 prom_n_addr_cells(struct device_node
* np
)
1243 ip
= (int *) get_property(np
, "#address-cells", NULL
);
1246 } while (np
->parent
);
1247 /* No #address-cells property for the root node, default to 1 */
1250 EXPORT_SYMBOL(prom_n_addr_cells
);
1253 prom_n_size_cells(struct device_node
* np
)
1259 ip
= (int *) get_property(np
, "#size-cells", NULL
);
1262 } while (np
->parent
);
1263 /* No #size-cells property for the root node, default to 1 */
1266 EXPORT_SYMBOL(prom_n_size_cells
);
1269 * Work out the sense (active-low level / active-high edge)
1270 * of each interrupt from the device tree.
1272 void __init
prom_get_irq_senses(unsigned char *senses
, int off
, int max
)
1274 struct device_node
*np
;
1277 /* default to level-triggered */
1278 memset(senses
, IRQ_SENSE_LEVEL
| IRQ_POLARITY_NEGATIVE
, max
- off
);
1280 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1281 for (j
= 0; j
< np
->n_intrs
; j
++) {
1282 i
= np
->intrs
[j
].line
;
1283 if (i
>= off
&& i
< max
)
1284 senses
[i
-off
] = np
->intrs
[j
].sense
;
1290 * Construct and return a list of the device_nodes with a given name.
1292 struct device_node
*find_devices(const char *name
)
1294 struct device_node
*head
, **prevp
, *np
;
1297 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1298 if (np
->name
!= 0 && strcasecmp(np
->name
, name
) == 0) {
1306 EXPORT_SYMBOL(find_devices
);
1309 * Construct and return a list of the device_nodes with a given type.
1311 struct device_node
*find_type_devices(const char *type
)
1313 struct device_node
*head
, **prevp
, *np
;
1316 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1317 if (np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0) {
1325 EXPORT_SYMBOL(find_type_devices
);
1328 * Returns all nodes linked together
1330 struct device_node
*find_all_nodes(void)
1332 struct device_node
*head
, **prevp
, *np
;
1335 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1342 EXPORT_SYMBOL(find_all_nodes
);
1344 /** Checks if the given "compat" string matches one of the strings in
1345 * the device's "compatible" property
1347 int device_is_compatible(struct device_node
*device
, const char *compat
)
1352 cp
= (char *) get_property(device
, "compatible", &cplen
);
1356 if (strncasecmp(cp
, compat
, strlen(compat
)) == 0)
1365 EXPORT_SYMBOL(device_is_compatible
);
1369 * Indicates whether the root node has a given value in its
1370 * compatible property.
1372 int machine_is_compatible(const char *compat
)
1374 struct device_node
*root
;
1377 root
= of_find_node_by_path("/");
1379 rc
= device_is_compatible(root
, compat
);
1384 EXPORT_SYMBOL(machine_is_compatible
);
1387 * Construct and return a list of the device_nodes with a given type
1388 * and compatible property.
1390 struct device_node
*find_compatible_devices(const char *type
,
1393 struct device_node
*head
, **prevp
, *np
;
1396 for (np
= allnodes
; np
!= 0; np
= np
->allnext
) {
1398 && !(np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0))
1400 if (device_is_compatible(np
, compat
)) {
1408 EXPORT_SYMBOL(find_compatible_devices
);
1411 * Find the device_node with a given full_name.
1413 struct device_node
*find_path_device(const char *path
)
1415 struct device_node
*np
;
1417 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
1418 if (np
->full_name
!= 0 && strcasecmp(np
->full_name
, path
) == 0)
1422 EXPORT_SYMBOL(find_path_device
);
1426 * New implementation of the OF "find" APIs, return a refcounted
1427 * object, call of_node_put() when done. The device tree and list
1428 * are protected by a rw_lock.
1430 * Note that property management will need some locking as well,
1431 * this isn't dealt with yet.
1436 * of_find_node_by_name - Find a node by its "name" property
1437 * @from: The node to start searching from or NULL, the node
1438 * you pass will not be searched, only the next one
1439 * will; typically, you pass what the previous call
1440 * returned. of_node_put() will be called on it
1441 * @name: The name string to match against
1443 * Returns a node pointer with refcount incremented, use
1444 * of_node_put() on it when done.
1446 struct device_node
*of_find_node_by_name(struct device_node
*from
,
1449 struct device_node
*np
;
1451 read_lock(&devtree_lock
);
1452 np
= from
? from
->allnext
: allnodes
;
1453 for (; np
!= NULL
; np
= np
->allnext
)
1454 if (np
->name
!= NULL
&& strcasecmp(np
->name
, name
) == 0
1459 read_unlock(&devtree_lock
);
1462 EXPORT_SYMBOL(of_find_node_by_name
);
1465 * of_find_node_by_type - Find a node by its "device_type" property
1466 * @from: The node to start searching from or NULL, the node
1467 * you pass will not be searched, only the next one
1468 * will; typically, you pass what the previous call
1469 * returned. of_node_put() will be called on it
1470 * @name: The type string to match against
1472 * Returns a node pointer with refcount incremented, use
1473 * of_node_put() on it when done.
1475 struct device_node
*of_find_node_by_type(struct device_node
*from
,
1478 struct device_node
*np
;
1480 read_lock(&devtree_lock
);
1481 np
= from
? from
->allnext
: allnodes
;
1482 for (; np
!= 0; np
= np
->allnext
)
1483 if (np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0
1488 read_unlock(&devtree_lock
);
1491 EXPORT_SYMBOL(of_find_node_by_type
);
1494 * of_find_compatible_node - Find a node based on type and one of the
1495 * tokens in its "compatible" property
1496 * @from: The node to start searching from or NULL, the node
1497 * you pass will not be searched, only the next one
1498 * will; typically, you pass what the previous call
1499 * returned. of_node_put() will be called on it
1500 * @type: The type string to match "device_type" or NULL to ignore
1501 * @compatible: The string to match to one of the tokens in the device
1502 * "compatible" list.
1504 * Returns a node pointer with refcount incremented, use
1505 * of_node_put() on it when done.
1507 struct device_node
*of_find_compatible_node(struct device_node
*from
,
1508 const char *type
, const char *compatible
)
1510 struct device_node
*np
;
1512 read_lock(&devtree_lock
);
1513 np
= from
? from
->allnext
: allnodes
;
1514 for (; np
!= 0; np
= np
->allnext
) {
1516 && !(np
->type
!= 0 && strcasecmp(np
->type
, type
) == 0))
1518 if (device_is_compatible(np
, compatible
) && of_node_get(np
))
1523 read_unlock(&devtree_lock
);
1526 EXPORT_SYMBOL(of_find_compatible_node
);
1529 * of_find_node_by_path - Find a node matching a full OF path
1530 * @path: The full path to match
1532 * Returns a node pointer with refcount incremented, use
1533 * of_node_put() on it when done.
1535 struct device_node
*of_find_node_by_path(const char *path
)
1537 struct device_node
*np
= allnodes
;
1539 read_lock(&devtree_lock
);
1540 for (; np
!= 0; np
= np
->allnext
) {
1541 if (np
->full_name
!= 0 && strcasecmp(np
->full_name
, path
) == 0
1545 read_unlock(&devtree_lock
);
1548 EXPORT_SYMBOL(of_find_node_by_path
);
1551 * of_find_node_by_phandle - Find a node given a phandle
1552 * @handle: phandle of the node to find
1554 * Returns a node pointer with refcount incremented, use
1555 * of_node_put() on it when done.
1557 struct device_node
*of_find_node_by_phandle(phandle handle
)
1559 struct device_node
*np
;
1561 read_lock(&devtree_lock
);
1562 for (np
= allnodes
; np
!= 0; np
= np
->allnext
)
1563 if (np
->linux_phandle
== handle
)
1567 read_unlock(&devtree_lock
);
1570 EXPORT_SYMBOL(of_find_node_by_phandle
);
1573 * of_find_all_nodes - Get next node in global list
1574 * @prev: Previous node or NULL to start iteration
1575 * of_node_put() will be called on it
1577 * Returns a node pointer with refcount incremented, use
1578 * of_node_put() on it when done.
1580 struct device_node
*of_find_all_nodes(struct device_node
*prev
)
1582 struct device_node
*np
;
1584 read_lock(&devtree_lock
);
1585 np
= prev
? prev
->allnext
: allnodes
;
1586 for (; np
!= 0; np
= np
->allnext
)
1587 if (of_node_get(np
))
1591 read_unlock(&devtree_lock
);
1594 EXPORT_SYMBOL(of_find_all_nodes
);
1597 * of_get_parent - Get a node's parent if any
1598 * @node: Node to get parent
1600 * Returns a node pointer with refcount incremented, use
1601 * of_node_put() on it when done.
1603 struct device_node
*of_get_parent(const struct device_node
*node
)
1605 struct device_node
*np
;
1610 read_lock(&devtree_lock
);
1611 np
= of_node_get(node
->parent
);
1612 read_unlock(&devtree_lock
);
1615 EXPORT_SYMBOL(of_get_parent
);
1618 * of_get_next_child - Iterate a node childs
1619 * @node: parent node
1620 * @prev: previous child of the parent node, or NULL to get first
1622 * Returns a node pointer with refcount incremented, use
1623 * of_node_put() on it when done.
1625 struct device_node
*of_get_next_child(const struct device_node
*node
,
1626 struct device_node
*prev
)
1628 struct device_node
*next
;
1630 read_lock(&devtree_lock
);
1631 next
= prev
? prev
->sibling
: node
->child
;
1632 for (; next
!= 0; next
= next
->sibling
)
1633 if (of_node_get(next
))
1637 read_unlock(&devtree_lock
);
1640 EXPORT_SYMBOL(of_get_next_child
);
1643 * of_node_get - Increment refcount of a node
1644 * @node: Node to inc refcount, NULL is supported to
1645 * simplify writing of callers
1649 struct device_node
*of_node_get(struct device_node
*node
)
1652 kref_get(&node
->kref
);
1655 EXPORT_SYMBOL(of_node_get
);
1657 static inline struct device_node
* kref_to_device_node(struct kref
*kref
)
1659 return container_of(kref
, struct device_node
, kref
);
1663 * of_node_release - release a dynamically allocated node
1664 * @kref: kref element of the node to be released
1666 * In of_node_put() this function is passed to kref_put()
1667 * as the destructor.
1669 static void of_node_release(struct kref
*kref
)
1671 struct device_node
*node
= kref_to_device_node(kref
);
1672 struct property
*prop
= node
->properties
;
1674 if (!OF_IS_DYNAMIC(node
))
1677 struct property
*next
= prop
->next
;
1684 prop
= node
->deadprops
;
1685 node
->deadprops
= NULL
;
1689 kfree(node
->full_name
);
1695 * of_node_put - Decrement refcount of a node
1696 * @node: Node to dec refcount, NULL is supported to
1697 * simplify writing of callers
1700 void of_node_put(struct device_node
*node
)
1703 kref_put(&node
->kref
, of_node_release
);
1705 EXPORT_SYMBOL(of_node_put
);
1708 * Plug a device node into the tree and global list.
1710 void of_attach_node(struct device_node
*np
)
1712 write_lock(&devtree_lock
);
1713 np
->sibling
= np
->parent
->child
;
1714 np
->allnext
= allnodes
;
1715 np
->parent
->child
= np
;
1717 write_unlock(&devtree_lock
);
1721 * "Unplug" a node from the device tree. The caller must hold
1722 * a reference to the node. The memory associated with the node
1723 * is not freed until its refcount goes to zero.
1725 void of_detach_node(const struct device_node
*np
)
1727 struct device_node
*parent
;
1729 write_lock(&devtree_lock
);
1731 parent
= np
->parent
;
1734 allnodes
= np
->allnext
;
1736 struct device_node
*prev
;
1737 for (prev
= allnodes
;
1738 prev
->allnext
!= np
;
1739 prev
= prev
->allnext
)
1741 prev
->allnext
= np
->allnext
;
1744 if (parent
->child
== np
)
1745 parent
->child
= np
->sibling
;
1747 struct device_node
*prevsib
;
1748 for (prevsib
= np
->parent
->child
;
1749 prevsib
->sibling
!= np
;
1750 prevsib
= prevsib
->sibling
)
1752 prevsib
->sibling
= np
->sibling
;
1755 write_unlock(&devtree_lock
);
1758 #ifdef CONFIG_PPC_PSERIES
1760 * Fix up the uninitialized fields in a new device node:
1761 * name, type, n_addrs, addrs, n_intrs, intrs, and pci-specific fields
1763 * A lot of boot-time code is duplicated here, because functions such
1764 * as finish_node_interrupts, interpret_pci_props, etc. cannot use the
1767 * This should probably be split up into smaller chunks.
1770 static int of_finish_dynamic_node(struct device_node
*node
)
1772 struct device_node
*parent
= of_get_parent(node
);
1774 phandle
*ibm_phandle
;
1776 node
->name
= get_property(node
, "name", NULL
);
1777 node
->type
= get_property(node
, "device_type", NULL
);
1784 /* We don't support that function on PowerMac, at least
1787 if (_machine
== PLATFORM_POWERMAC
)
1790 /* fix up new node's linux_phandle field */
1791 if ((ibm_phandle
= (unsigned int *)get_property(node
,
1792 "ibm,phandle", NULL
)))
1793 node
->linux_phandle
= *ibm_phandle
;
1796 of_node_put(parent
);
1800 static int prom_reconfig_notifier(struct notifier_block
*nb
,
1801 unsigned long action
, void *node
)
1806 case PSERIES_RECONFIG_ADD
:
1807 err
= of_finish_dynamic_node(node
);
1809 finish_node(node
, NULL
, 0);
1811 printk(KERN_ERR
"finish_node returned %d\n", err
);
1822 static struct notifier_block prom_reconfig_nb
= {
1823 .notifier_call
= prom_reconfig_notifier
,
1824 .priority
= 10, /* This one needs to run first */
1827 static int __init
prom_reconfig_setup(void)
1829 return pSeries_reconfig_notifier_register(&prom_reconfig_nb
);
1831 __initcall(prom_reconfig_setup
);
1834 struct property
*of_find_property(struct device_node
*np
, const char *name
,
1837 struct property
*pp
;
1839 read_lock(&devtree_lock
);
1840 for (pp
= np
->properties
; pp
!= 0; pp
= pp
->next
)
1841 if (strcmp(pp
->name
, name
) == 0) {
1846 read_unlock(&devtree_lock
);
1852 * Find a property with a given name for a given node
1853 * and return the value.
1855 unsigned char *get_property(struct device_node
*np
, const char *name
,
1858 struct property
*pp
= of_find_property(np
,name
,lenp
);
1859 return pp
? pp
->value
: NULL
;
1861 EXPORT_SYMBOL(get_property
);
1864 * Add a property to a node
1866 int prom_add_property(struct device_node
* np
, struct property
* prop
)
1868 struct property
**next
;
1871 write_lock(&devtree_lock
);
1872 next
= &np
->properties
;
1874 if (strcmp(prop
->name
, (*next
)->name
) == 0) {
1875 /* duplicate ! don't insert it */
1876 write_unlock(&devtree_lock
);
1879 next
= &(*next
)->next
;
1882 write_unlock(&devtree_lock
);
1884 #ifdef CONFIG_PROC_DEVICETREE
1885 /* try to add to proc as well if it was initialized */
1887 proc_device_tree_add_prop(np
->pde
, prop
);
1888 #endif /* CONFIG_PROC_DEVICETREE */
1894 * Remove a property from a node. Note that we don't actually
1895 * remove it, since we have given out who-knows-how-many pointers
1896 * to the data using get-property. Instead we just move the property
1897 * to the "dead properties" list, so it won't be found any more.
1899 int prom_remove_property(struct device_node
*np
, struct property
*prop
)
1901 struct property
**next
;
1904 write_lock(&devtree_lock
);
1905 next
= &np
->properties
;
1907 if (*next
== prop
) {
1908 /* found the node */
1910 prop
->next
= np
->deadprops
;
1911 np
->deadprops
= prop
;
1915 next
= &(*next
)->next
;
1917 write_unlock(&devtree_lock
);
1922 #ifdef CONFIG_PROC_DEVICETREE
1923 /* try to remove the proc node as well */
1925 proc_device_tree_remove_prop(np
->pde
, prop
);
1926 #endif /* CONFIG_PROC_DEVICETREE */
1932 * Update a property in a node. Note that we don't actually
1933 * remove it, since we have given out who-knows-how-many pointers
1934 * to the data using get-property. Instead we just move the property
1935 * to the "dead properties" list, and add the new property to the
1938 int prom_update_property(struct device_node
*np
,
1939 struct property
*newprop
,
1940 struct property
*oldprop
)
1942 struct property
**next
;
1945 write_lock(&devtree_lock
);
1946 next
= &np
->properties
;
1948 if (*next
== oldprop
) {
1949 /* found the node */
1950 newprop
->next
= oldprop
->next
;
1952 oldprop
->next
= np
->deadprops
;
1953 np
->deadprops
= oldprop
;
1957 next
= &(*next
)->next
;
1959 write_unlock(&devtree_lock
);
1964 #ifdef CONFIG_PROC_DEVICETREE
1965 /* try to add to proc as well if it was initialized */
1967 proc_device_tree_update_prop(np
->pde
, newprop
, oldprop
);
1968 #endif /* CONFIG_PROC_DEVICETREE */
1974 /* We may have allocated the flat device tree inside the crash kernel region
1975 * in prom_init. If so we need to move it out into regular memory. */
1976 void kdump_move_device_tree(void)
1978 unsigned long start
, end
;
1979 struct boot_param_header
*new;
1981 start
= __pa((unsigned long)initial_boot_params
);
1982 end
= start
+ initial_boot_params
->totalsize
;
1984 if (end
< crashk_res
.start
|| start
> crashk_res
.end
)
1987 new = (struct boot_param_header
*)
1988 __va(lmb_alloc(initial_boot_params
->totalsize
, PAGE_SIZE
));
1990 memcpy(new, initial_boot_params
, initial_boot_params
->totalsize
);
1992 initial_boot_params
= new;
1994 DBG("Flat device tree blob moved to %p\n", initial_boot_params
);
1996 /* XXX should we unreserve the old DT? */
1998 #endif /* CONFIG_KEXEC */