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)
60 struct pci_reg_property {
61 struct pci_address addr;
66 struct isa_reg_property {
73 typedef int interpret_func(struct device_node *, unsigned long *,
76 static int __initdata dt_root_addr_cells;
77 static int __initdata dt_root_size_cells;
80 static int __initdata iommu_is_off;
81 int __initdata iommu_force_on;
82 unsigned long tce_alloc_start, tce_alloc_end;
88 static struct boot_param_header *initial_boot_params __initdata;
90 struct boot_param_header *initial_boot_params;
93 static struct device_node *allnodes = NULL;
95 /* use when traversing tree through the allnext, child, sibling,
96 * or parent members of struct device_node.
98 static DEFINE_RWLOCK(devtree_lock);
100 /* export that to outside world */
101 struct device_node *of_chosen;
103 struct device_node *dflt_interrupt_controller;
104 int num_interrupt_controllers;
107 * Wrapper for allocating memory for various data that needs to be
108 * attached to device nodes as they are processed at boot or when
109 * added to the device tree later (e.g. DLPAR). At boot there is
110 * already a region reserved so we just increment *mem_start by size;
111 * otherwise we call kmalloc.
113 static void * prom_alloc(unsigned long size, unsigned long *mem_start)
118 return kmalloc(size, GFP_KERNEL);
126 * Find the device_node with a given phandle.
128 static struct device_node * find_phandle(phandle ph)
130 struct device_node *np;
132 for (np = allnodes; np != 0; np = np->allnext)
133 if (np->linux_phandle == ph)
139 * Find the interrupt parent of a node.
141 static struct device_node * __devinit intr_parent(struct device_node *p)
145 parp = (phandle *) get_property(p, "interrupt-parent", NULL);
148 p = find_phandle(*parp);
152 * On a powermac booted with BootX, we don't get to know the
153 * phandles for any nodes, so find_phandle will return NULL.
154 * Fortunately these machines only have one interrupt controller
155 * so there isn't in fact any ambiguity. -- paulus
157 if (num_interrupt_controllers == 1)
158 p = dflt_interrupt_controller;
163 * Find out the size of each entry of the interrupts property
166 int __devinit prom_n_intr_cells(struct device_node *np)
168 struct device_node *p;
171 for (p = np; (p = intr_parent(p)) != NULL; ) {
172 icp = (unsigned int *)
173 get_property(p, "#interrupt-cells", NULL);
176 if (get_property(p, "interrupt-controller", NULL) != NULL
177 || get_property(p, "interrupt-map", NULL) != NULL) {
178 printk("oops, node %s doesn't have #interrupt-cells\n",
184 printk("prom_n_intr_cells failed for %s\n", np->full_name);
190 * Map an interrupt from a device up to the platform interrupt
193 static int __devinit map_interrupt(unsigned int **irq, struct device_node **ictrler,
194 struct device_node *np, unsigned int *ints,
197 struct device_node *p, *ipar;
198 unsigned int *imap, *imask, *ip;
199 int i, imaplen, match;
200 int newintrc = 0, newaddrc = 0;
204 reg = (unsigned int *) get_property(np, "reg", NULL);
205 naddrc = prom_n_addr_cells(np);
208 if (get_property(p, "interrupt-controller", NULL) != NULL)
209 /* this node is an interrupt controller, stop here */
211 imap = (unsigned int *)
212 get_property(p, "interrupt-map", &imaplen);
217 imask = (unsigned int *)
218 get_property(p, "interrupt-map-mask", NULL);
220 printk("oops, %s has interrupt-map but no mask\n",
224 imaplen /= sizeof(unsigned int);
227 while (imaplen > 0 && !match) {
228 /* check the child-interrupt field */
230 for (i = 0; i < naddrc && match; ++i)
231 match = ((reg[i] ^ imap[i]) & imask[i]) == 0;
232 for (; i < naddrc + nintrc && match; ++i)
233 match = ((ints[i-naddrc] ^ imap[i]) & imask[i]) == 0;
234 imap += naddrc + nintrc;
235 imaplen -= naddrc + nintrc;
236 /* grab the interrupt parent */
237 ipar = find_phandle((phandle) *imap++);
239 if (ipar == NULL && num_interrupt_controllers == 1)
240 /* cope with BootX not giving us phandles */
241 ipar = dflt_interrupt_controller;
243 printk("oops, no int parent %x in map of %s\n",
244 imap[-1], p->full_name);
247 /* find the parent's # addr and intr cells */
248 ip = (unsigned int *)
249 get_property(ipar, "#interrupt-cells", NULL);
251 printk("oops, no #interrupt-cells on %s\n",
256 ip = (unsigned int *)
257 get_property(ipar, "#address-cells", NULL);
258 newaddrc = (ip == NULL)? 0: *ip;
259 imap += newaddrc + newintrc;
260 imaplen -= newaddrc + newintrc;
263 printk("oops, error decoding int-map on %s, len=%d\n",
264 p->full_name, imaplen);
269 printk("oops, no match in %s int-map for %s\n",
270 p->full_name, np->full_name);
277 ints = imap - nintrc;
282 printk("hmmm, int tree for %s doesn't have ctrler\n",
292 static unsigned char map_isa_senses[4] = {
293 IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE,
294 IRQ_SENSE_LEVEL | IRQ_POLARITY_POSITIVE,
295 IRQ_SENSE_EDGE | IRQ_POLARITY_NEGATIVE,
296 IRQ_SENSE_EDGE | IRQ_POLARITY_POSITIVE
299 static unsigned char map_mpic_senses[4] = {
300 IRQ_SENSE_EDGE | IRQ_POLARITY_POSITIVE,
301 IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE,
302 /* 2 seems to be used for the 8259 cascade... */
303 IRQ_SENSE_LEVEL | IRQ_POLARITY_POSITIVE,
304 IRQ_SENSE_EDGE | IRQ_POLARITY_NEGATIVE,
307 static int __devinit finish_node_interrupts(struct device_node *np,
308 unsigned long *mem_start,
312 int intlen, intrcells, intrcount;
314 unsigned int *irq, virq;
315 struct device_node *ic;
317 if (num_interrupt_controllers == 0) {
319 * Old machines just have a list of interrupt numbers
320 * and no interrupt-controller nodes.
322 ints = (unsigned int *) get_property(np, "AAPL,interrupts",
324 /* XXX old interpret_pci_props looked in parent too */
325 /* XXX old interpret_macio_props looked for interrupts
326 before AAPL,interrupts */
328 ints = (unsigned int *) get_property(np, "interrupts",
333 np->n_intrs = intlen / sizeof(unsigned int);
334 np->intrs = prom_alloc(np->n_intrs * sizeof(np->intrs[0]),
341 for (i = 0; i < np->n_intrs; ++i) {
342 np->intrs[i].line = *ints++;
343 np->intrs[i].sense = IRQ_SENSE_LEVEL
344 | IRQ_POLARITY_NEGATIVE;
349 ints = (unsigned int *) get_property(np, "interrupts", &intlen);
352 intrcells = prom_n_intr_cells(np);
353 intlen /= intrcells * sizeof(unsigned int);
355 np->intrs = prom_alloc(intlen * sizeof(*(np->intrs)), mem_start);
363 for (i = 0; i < intlen; ++i, ints += intrcells) {
364 n = map_interrupt(&irq, &ic, np, ints, intrcells);
368 /* don't map IRQ numbers under a cascaded 8259 controller */
369 if (ic && device_is_compatible(ic, "chrp,iic")) {
370 np->intrs[intrcount].line = irq[0];
371 sense = (n > 1)? (irq[1] & 3): 3;
372 np->intrs[intrcount].sense = map_isa_senses[sense];
374 virq = virt_irq_create_mapping(irq[0]);
376 if (virq == NO_IRQ) {
377 printk(KERN_CRIT "Could not allocate interrupt"
378 " number for %s\n", np->full_name);
382 np->intrs[intrcount].line = irq_offset_up(virq);
383 sense = (n > 1)? (irq[1] & 3): 1;
384 np->intrs[intrcount].sense = map_mpic_senses[sense];
388 /* We offset irq numbers for the u3 MPIC by 128 in PowerMac */
389 if (_machine == PLATFORM_POWERMAC && ic && ic->parent) {
390 char *name = get_property(ic->parent, "name", NULL);
391 if (name && !strcmp(name, "u3"))
392 np->intrs[intrcount].line += 128;
393 else if (!(name && !strcmp(name, "mac-io")))
394 /* ignore other cascaded controllers, such as
400 printk("hmmm, got %d intr cells for %s:", n,
402 for (j = 0; j < n; ++j)
403 printk(" %d", irq[j]);
408 np->n_intrs = intrcount;
413 static int __devinit interpret_pci_props(struct device_node *np,
414 unsigned long *mem_start,
415 int naddrc, int nsizec,
418 struct address_range *adr;
419 struct pci_reg_property *pci_addrs;
422 pci_addrs = (struct pci_reg_property *)
423 get_property(np, "assigned-addresses", &l);
427 n_addrs = l / sizeof(*pci_addrs);
429 adr = prom_alloc(n_addrs * sizeof(*adr), mem_start);
437 np->n_addrs = n_addrs;
439 for (i = 0; i < n_addrs; i++) {
440 adr[i].space = pci_addrs[i].addr.a_hi;
441 adr[i].address = pci_addrs[i].addr.a_lo |
442 ((u64)pci_addrs[i].addr.a_mid << 32);
443 adr[i].size = pci_addrs[i].size_lo;
449 static int __init interpret_dbdma_props(struct device_node *np,
450 unsigned long *mem_start,
451 int naddrc, int nsizec,
454 struct reg_property32 *rp;
455 struct address_range *adr;
456 unsigned long base_address;
458 struct device_node *db;
462 for (db = np->parent; db != NULL; db = db->parent) {
463 if (!strcmp(db->type, "dbdma") && db->n_addrs != 0) {
464 base_address = db->addrs[0].address;
470 rp = (struct reg_property32 *) get_property(np, "reg", &l);
471 if (rp != 0 && l >= sizeof(struct reg_property32)) {
473 adr = (struct address_range *) (*mem_start);
474 while ((l -= sizeof(struct reg_property32)) >= 0) {
477 adr[i].address = rp[i].address + base_address;
478 adr[i].size = rp[i].size;
484 (*mem_start) += i * sizeof(struct address_range);
490 static int __init interpret_macio_props(struct device_node *np,
491 unsigned long *mem_start,
492 int naddrc, int nsizec,
495 struct reg_property32 *rp;
496 struct address_range *adr;
497 unsigned long base_address;
499 struct device_node *db;
503 for (db = np->parent; db != NULL; db = db->parent) {
504 if (!strcmp(db->type, "mac-io") && db->n_addrs != 0) {
505 base_address = db->addrs[0].address;
511 rp = (struct reg_property32 *) get_property(np, "reg", &l);
512 if (rp != 0 && l >= sizeof(struct reg_property32)) {
514 adr = (struct address_range *) (*mem_start);
515 while ((l -= sizeof(struct reg_property32)) >= 0) {
518 adr[i].address = rp[i].address + base_address;
519 adr[i].size = rp[i].size;
525 (*mem_start) += i * sizeof(struct address_range);
531 static int __init interpret_isa_props(struct device_node *np,
532 unsigned long *mem_start,
533 int naddrc, int nsizec,
536 struct isa_reg_property *rp;
537 struct address_range *adr;
540 rp = (struct isa_reg_property *) get_property(np, "reg", &l);
541 if (rp != 0 && l >= sizeof(struct isa_reg_property)) {
543 adr = (struct address_range *) (*mem_start);
544 while ((l -= sizeof(struct isa_reg_property)) >= 0) {
546 adr[i].space = rp[i].space;
547 adr[i].address = rp[i].address;
548 adr[i].size = rp[i].size;
554 (*mem_start) += i * sizeof(struct address_range);
560 static int __init interpret_root_props(struct device_node *np,
561 unsigned long *mem_start,
562 int naddrc, int nsizec,
565 struct address_range *adr;
568 int rpsize = (naddrc + nsizec) * sizeof(unsigned int);
570 rp = (unsigned int *) get_property(np, "reg", &l);
571 if (rp != 0 && l >= rpsize) {
573 adr = (struct address_range *) (*mem_start);
574 while ((l -= rpsize) >= 0) {
577 adr[i].address = rp[naddrc - 1];
578 adr[i].size = rp[naddrc + nsizec - 1];
581 rp += naddrc + nsizec;
585 (*mem_start) += i * sizeof(struct address_range);
591 static int __devinit finish_node(struct device_node *np,
592 unsigned long *mem_start,
593 interpret_func *ifunc,
594 int naddrc, int nsizec,
597 struct device_node *child;
600 /* get the device addresses and interrupts */
602 rc = ifunc(np, mem_start, naddrc, nsizec, measure_only);
606 rc = finish_node_interrupts(np, mem_start, measure_only);
610 /* Look for #address-cells and #size-cells properties. */
611 ip = (int *) get_property(np, "#address-cells", NULL);
614 ip = (int *) get_property(np, "#size-cells", NULL);
618 if (!strcmp(np->name, "device-tree") || np->parent == NULL)
619 ifunc = interpret_root_props;
620 else if (np->type == 0)
622 else if (!strcmp(np->type, "pci") || !strcmp(np->type, "vci"))
623 ifunc = interpret_pci_props;
624 else if (!strcmp(np->type, "dbdma"))
625 ifunc = interpret_dbdma_props;
626 else if (!strcmp(np->type, "mac-io") || ifunc == interpret_macio_props)
627 ifunc = interpret_macio_props;
628 else if (!strcmp(np->type, "isa"))
629 ifunc = interpret_isa_props;
630 else if (!strcmp(np->name, "uni-n") || !strcmp(np->name, "u3"))
631 ifunc = interpret_root_props;
632 else if (!((ifunc == interpret_dbdma_props
633 || ifunc == interpret_macio_props)
634 && (!strcmp(np->type, "escc")
635 || !strcmp(np->type, "media-bay"))))
638 for (child = np->child; child != NULL; child = child->sibling) {
639 rc = finish_node(child, mem_start, ifunc,
640 naddrc, nsizec, measure_only);
648 static void __init scan_interrupt_controllers(void)
650 struct device_node *np;
655 for (np = allnodes; np != NULL; np = np->allnext) {
656 ic = get_property(np, "interrupt-controller", &iclen);
657 name = get_property(np, "name", NULL);
658 /* checking iclen makes sure we don't get a false
659 match on /chosen.interrupt_controller */
661 && strcmp(name, "interrupt-controller") == 0)
662 || (ic != NULL && iclen == 0
663 && strcmp(name, "AppleKiwi"))) {
665 dflt_interrupt_controller = np;
669 num_interrupt_controllers = n;
673 * finish_device_tree is called once things are running normally
674 * (i.e. with text and data mapped to the address they were linked at).
675 * It traverses the device tree and fills in some of the additional,
676 * fields in each node like {n_}addrs and {n_}intrs, the virt interrupt
677 * mapping is also initialized at this point.
679 void __init finish_device_tree(void)
681 unsigned long start, end, size = 0;
683 DBG(" -> finish_device_tree\n");
686 /* Initialize virtual IRQ map */
689 scan_interrupt_controllers();
692 * Finish device-tree (pre-parsing some properties etc...)
693 * We do this in 2 passes. One with "measure_only" set, which
694 * will only measure the amount of memory needed, then we can
695 * allocate that memory, and call finish_node again. However,
696 * we must be careful as most routines will fail nowadays when
697 * prom_alloc() returns 0, so we must make sure our first pass
698 * doesn't start at 0. We pre-initialize size to 16 for that
699 * reason and then remove those additional 16 bytes
702 finish_node(allnodes, &size, NULL, 0, 0, 1);
704 end = start = (unsigned long) __va(lmb_alloc(size, 128));
705 finish_node(allnodes, &end, NULL, 0, 0, 0);
706 BUG_ON(end != start + size);
708 DBG(" <- finish_device_tree\n");
711 static inline char *find_flat_dt_string(u32 offset)
713 return ((char *)initial_boot_params) +
714 initial_boot_params->off_dt_strings + offset;
718 * This function is used to scan the flattened device-tree, it is
719 * used to extract the memory informations at boot before we can
722 int __init of_scan_flat_dt(int (*it)(unsigned long node,
723 const char *uname, int depth,
727 unsigned long p = ((unsigned long)initial_boot_params) +
728 initial_boot_params->off_dt_struct;
733 u32 tag = *((u32 *)p);
737 if (tag == OF_DT_END_NODE) {
741 if (tag == OF_DT_NOP)
743 if (tag == OF_DT_END)
745 if (tag == OF_DT_PROP) {
746 u32 sz = *((u32 *)p);
748 if (initial_boot_params->version < 0x10)
749 p = _ALIGN(p, sz >= 8 ? 8 : 4);
754 if (tag != OF_DT_BEGIN_NODE) {
755 printk(KERN_WARNING "Invalid tag %x scanning flattened"
756 " device tree !\n", tag);
761 p = _ALIGN(p + strlen(pathp) + 1, 4);
762 if ((*pathp) == '/') {
764 for (lp = NULL, np = pathp; *np; np++)
770 rc = it(p, pathp, depth, data);
779 * This function can be used within scan_flattened_dt callback to get
780 * access to properties
782 void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
785 unsigned long p = node;
788 u32 tag = *((u32 *)p);
793 if (tag == OF_DT_NOP)
795 if (tag != OF_DT_PROP)
799 noff = *((u32 *)(p + 4));
801 if (initial_boot_params->version < 0x10)
802 p = _ALIGN(p, sz >= 8 ? 8 : 4);
804 nstr = find_flat_dt_string(noff);
806 printk(KERN_WARNING "Can't find property index"
810 if (strcmp(name, nstr) == 0) {
820 static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
825 *mem = _ALIGN(*mem, align);
832 static unsigned long __init unflatten_dt_node(unsigned long mem,
834 struct device_node *dad,
835 struct device_node ***allnextpp,
836 unsigned long fpsize)
838 struct device_node *np;
839 struct property *pp, **prev_pp = NULL;
842 unsigned int l, allocl;
846 tag = *((u32 *)(*p));
847 if (tag != OF_DT_BEGIN_NODE) {
848 printk("Weird tag at start of node: %x\n", tag);
853 l = allocl = strlen(pathp) + 1;
854 *p = _ALIGN(*p + l, 4);
856 /* version 0x10 has a more compact unit name here instead of the full
857 * path. we accumulate the full path size using "fpsize", we'll rebuild
858 * it later. We detect this because the first character of the name is
861 if ((*pathp) != '/') {
864 /* root node: special case. fpsize accounts for path
865 * plus terminating zero. root node only has '/', so
866 * fpsize should be 2, but we want to avoid the first
867 * level nodes to have two '/' so we use fpsize 1 here
872 /* account for '/' and path size minus terminal 0
881 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
882 __alignof__(struct device_node));
884 memset(np, 0, sizeof(*np));
885 np->full_name = ((char*)np) + sizeof(struct device_node);
887 char *p = np->full_name;
888 /* rebuild full path for new format */
889 if (dad && dad->parent) {
890 strcpy(p, dad->full_name);
892 if ((strlen(p) + l + 1) != allocl) {
893 DBG("%s: p: %d, l: %d, a: %d\n",
894 pathp, strlen(p), l, allocl);
902 memcpy(np->full_name, pathp, l);
903 prev_pp = &np->properties;
905 *allnextpp = &np->allnext;
908 /* we temporarily use the next field as `last_child'*/
912 dad->next->sibling = np;
915 kref_init(&np->kref);
921 tag = *((u32 *)(*p));
922 if (tag == OF_DT_NOP) {
926 if (tag != OF_DT_PROP)
930 noff = *((u32 *)((*p) + 4));
932 if (initial_boot_params->version < 0x10)
933 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
935 pname = find_flat_dt_string(noff);
937 printk("Can't find property name in list !\n");
940 if (strcmp(pname, "name") == 0)
942 l = strlen(pname) + 1;
943 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
944 __alignof__(struct property));
946 if (strcmp(pname, "linux,phandle") == 0) {
947 np->node = *((u32 *)*p);
948 if (np->linux_phandle == 0)
949 np->linux_phandle = np->node;
951 if (strcmp(pname, "ibm,phandle") == 0)
952 np->linux_phandle = *((u32 *)*p);
955 pp->value = (void *)*p;
959 *p = _ALIGN((*p) + sz, 4);
961 /* with version 0x10 we may not have the name property, recreate
962 * it here from the unit name if absent
965 char *p = pathp, *ps = pathp, *pa = NULL;
978 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
979 __alignof__(struct property));
983 pp->value = (unsigned char *)(pp + 1);
986 memcpy(pp->value, ps, sz - 1);
987 ((char *)pp->value)[sz - 1] = 0;
988 DBG("fixed up name for %s -> %s\n", pathp, pp->value);
993 np->name = get_property(np, "name", NULL);
994 np->type = get_property(np, "device_type", NULL);
1001 while (tag == OF_DT_BEGIN_NODE) {
1002 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
1003 tag = *((u32 *)(*p));
1005 if (tag != OF_DT_END_NODE) {
1006 printk("Weird tag at end of node: %x\n", tag);
1015 * unflattens the device-tree passed by the firmware, creating the
1016 * tree of struct device_node. It also fills the "name" and "type"
1017 * pointers of the nodes so the normal device-tree walking functions
1018 * can be used (this used to be done by finish_device_tree)
1020 void __init unflatten_device_tree(void)
1022 unsigned long start, mem, size;
1023 struct device_node **allnextp = &allnodes;
1027 DBG(" -> unflatten_device_tree()\n");
1029 /* First pass, scan for size */
1030 start = ((unsigned long)initial_boot_params) +
1031 initial_boot_params->off_dt_struct;
1032 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
1033 size = (size | 3) + 1;
1035 DBG(" size is %lx, allocating...\n", size);
1037 /* Allocate memory for the expanded device tree */
1038 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
1040 DBG("Couldn't allocate memory with lmb_alloc()!\n");
1041 panic("Couldn't allocate memory with lmb_alloc()!\n");
1043 mem = (unsigned long) __va(mem);
1045 ((u32 *)mem)[size / 4] = 0xdeadbeef;
1047 DBG(" unflattening %lx...\n", mem);
1049 /* Second pass, do actual unflattening */
1050 start = ((unsigned long)initial_boot_params) +
1051 initial_boot_params->off_dt_struct;
1052 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
1053 if (*((u32 *)start) != OF_DT_END)
1054 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
1055 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
1056 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
1057 ((u32 *)mem)[size / 4] );
1060 /* Get pointer to OF "/chosen" node for use everywhere */
1061 of_chosen = of_find_node_by_path("/chosen");
1062 if (of_chosen == NULL)
1063 of_chosen = of_find_node_by_path("/chosen@0");
1065 /* Retreive command line */
1066 if (of_chosen != NULL) {
1067 p = (char *)get_property(of_chosen, "bootargs", &l);
1068 if (p != NULL && l > 0)
1069 strlcpy(cmd_line, p, min(l, COMMAND_LINE_SIZE));
1071 #ifdef CONFIG_CMDLINE
1072 if (l == 0 || (l == 1 && (*p) == 0))
1073 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
1074 #endif /* CONFIG_CMDLINE */
1076 DBG("Command line is: %s\n", cmd_line);
1078 DBG(" <- unflatten_device_tree()\n");
1082 static int __init early_init_dt_scan_cpus(unsigned long node,
1083 const char *uname, int depth, void *data)
1087 char *type = of_get_flat_dt_prop(node, "device_type", &size);
1089 /* We are scanning "cpu" nodes only */
1090 if (type == NULL || strcmp(type, "cpu") != 0)
1094 boot_cpuid_phys = 0;
1095 if (initial_boot_params && initial_boot_params->version >= 2) {
1096 /* version 2 of the kexec param format adds the phys cpuid
1099 boot_cpuid_phys = initial_boot_params->boot_cpuid_phys;
1101 /* Check if it's the boot-cpu, set it's hw index now */
1102 if (of_get_flat_dt_prop(node,
1103 "linux,boot-cpu", NULL) != NULL) {
1104 prop = of_get_flat_dt_prop(node, "reg", NULL);
1106 boot_cpuid_phys = *prop;
1109 set_hard_smp_processor_id(0, boot_cpuid_phys);
1111 #ifdef CONFIG_ALTIVEC
1112 /* Check if we have a VMX and eventually update CPU features */
1113 prop = (u32 *)of_get_flat_dt_prop(node, "ibm,vmx", NULL);
1114 if (prop && (*prop) > 0) {
1115 cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC;
1116 cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC;
1119 /* Same goes for Apple's "altivec" property */
1120 prop = (u32 *)of_get_flat_dt_prop(node, "altivec", NULL);
1122 cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC;
1123 cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC;
1125 #endif /* CONFIG_ALTIVEC */
1127 #ifdef CONFIG_PPC_PSERIES
1129 * Check for an SMT capable CPU and set the CPU feature. We do
1130 * this by looking at the size of the ibm,ppc-interrupt-server#s
1133 prop = (u32 *)of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s",
1135 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
1136 if (prop && ((size / sizeof(u32)) > 1))
1137 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
1143 static int __init early_init_dt_scan_chosen(unsigned long node,
1144 const char *uname, int depth, void *data)
1147 unsigned long *lprop;
1149 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
1152 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
1155 /* get platform type */
1156 prop = (u32 *)of_get_flat_dt_prop(node, "linux,platform", NULL);
1159 #ifdef CONFIG_PPC_MULTIPLATFORM
1164 /* check if iommu is forced on or off */
1165 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
1167 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
1171 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
1173 memory_limit = *lprop;
1176 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
1178 tce_alloc_start = *lprop;
1179 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
1181 tce_alloc_end = *lprop;
1184 #ifdef CONFIG_PPC_RTAS
1185 /* To help early debugging via the front panel, we retreive a minimal
1186 * set of RTAS infos now if available
1189 u64 *basep, *entryp;
1191 basep = of_get_flat_dt_prop(node, "linux,rtas-base", NULL);
1192 entryp = of_get_flat_dt_prop(node, "linux,rtas-entry", NULL);
1193 prop = of_get_flat_dt_prop(node, "linux,rtas-size", NULL);
1194 if (basep && entryp && prop) {
1196 rtas.entry = *entryp;
1200 #endif /* CONFIG_PPC_RTAS */
1203 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL);
1205 crashk_res.start = *lprop;
1207 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL);
1209 crashk_res.end = crashk_res.start + *lprop - 1;
1216 static int __init early_init_dt_scan_root(unsigned long node,
1217 const char *uname, int depth, void *data)
1224 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
1225 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
1226 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
1228 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
1229 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
1230 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
1236 static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
1241 /* Ignore more than 2 cells */
1242 while (s > sizeof(unsigned long) / 4) {
1260 static int __init early_init_dt_scan_memory(unsigned long node,
1261 const char *uname, int depth, void *data)
1263 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
1267 /* We are scanning "memory" nodes only */
1270 * The longtrail doesn't have a device_type on the
1271 * /memory node, so look for the node called /memory@0.
1273 if (depth != 1 || strcmp(uname, "memory@0") != 0)
1275 } else if (strcmp(type, "memory") != 0)
1278 reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l);
1282 endp = reg + (l / sizeof(cell_t));
1284 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
1285 uname, l, reg[0], reg[1], reg[2], reg[3]);
1287 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
1288 unsigned long base, size;
1290 base = dt_mem_next_cell(dt_root_addr_cells, ®);
1291 size = dt_mem_next_cell(dt_root_size_cells, ®);
1295 DBG(" - %lx , %lx\n", base, size);
1298 if (base >= 0x80000000ul)
1300 if ((base + size) > 0x80000000ul)
1301 size = 0x80000000ul - base;
1304 lmb_add(base, size);
1309 static void __init early_reserve_mem(void)
1311 unsigned long base, size;
1312 unsigned long *reserve_map;
1314 reserve_map = (unsigned long *)(((unsigned long)initial_boot_params) +
1315 initial_boot_params->off_mem_rsvmap);
1317 base = *(reserve_map++);
1318 size = *(reserve_map++);
1321 DBG("reserving: %lx -> %lx\n", base, size);
1322 lmb_reserve(base, size);
1326 DBG("memory reserved, lmbs :\n");
1331 void __init early_init_devtree(void *params)
1333 DBG(" -> early_init_devtree()\n");
1335 /* Setup flat device-tree pointer */
1336 initial_boot_params = params;
1338 /* Retrieve various informations from the /chosen node of the
1339 * device-tree, including the platform type, initrd location and
1340 * size, TCE reserve, and more ...
1342 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
1344 /* Scan memory nodes and rebuild LMBs */
1346 of_scan_flat_dt(early_init_dt_scan_root, NULL);
1347 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
1348 lmb_enforce_memory_limit(memory_limit);
1351 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1353 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
1354 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
1355 #ifdef CONFIG_CRASH_DUMP
1356 lmb_reserve(0, KDUMP_RESERVE_LIMIT);
1358 early_reserve_mem();
1360 DBG("Scanning CPUs ...\n");
1362 /* Retreive CPU related informations from the flat tree
1363 * (altivec support, boot CPU ID, ...)
1365 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
1367 DBG(" <- early_init_devtree()\n");
1373 prom_n_addr_cells(struct device_node* np)
1379 ip = (int *) get_property(np, "#address-cells", NULL);
1382 } while (np->parent);
1383 /* No #address-cells property for the root node, default to 1 */
1386 EXPORT_SYMBOL(prom_n_addr_cells);
1389 prom_n_size_cells(struct device_node* np)
1395 ip = (int *) get_property(np, "#size-cells", NULL);
1398 } while (np->parent);
1399 /* No #size-cells property for the root node, default to 1 */
1402 EXPORT_SYMBOL(prom_n_size_cells);
1405 * Work out the sense (active-low level / active-high edge)
1406 * of each interrupt from the device tree.
1408 void __init prom_get_irq_senses(unsigned char *senses, int off, int max)
1410 struct device_node *np;
1413 /* default to level-triggered */
1414 memset(senses, IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE, max - off);
1416 for (np = allnodes; np != 0; np = np->allnext) {
1417 for (j = 0; j < np->n_intrs; j++) {
1418 i = np->intrs[j].line;
1419 if (i >= off && i < max)
1420 senses[i-off] = np->intrs[j].sense;
1426 * Construct and return a list of the device_nodes with a given name.
1428 struct device_node *find_devices(const char *name)
1430 struct device_node *head, **prevp, *np;
1433 for (np = allnodes; np != 0; np = np->allnext) {
1434 if (np->name != 0 && strcasecmp(np->name, name) == 0) {
1442 EXPORT_SYMBOL(find_devices);
1445 * Construct and return a list of the device_nodes with a given type.
1447 struct device_node *find_type_devices(const char *type)
1449 struct device_node *head, **prevp, *np;
1452 for (np = allnodes; np != 0; np = np->allnext) {
1453 if (np->type != 0 && strcasecmp(np->type, type) == 0) {
1461 EXPORT_SYMBOL(find_type_devices);
1464 * Returns all nodes linked together
1466 struct device_node *find_all_nodes(void)
1468 struct device_node *head, **prevp, *np;
1471 for (np = allnodes; np != 0; np = np->allnext) {
1478 EXPORT_SYMBOL(find_all_nodes);
1480 /** Checks if the given "compat" string matches one of the strings in
1481 * the device's "compatible" property
1483 int device_is_compatible(struct device_node *device, const char *compat)
1488 cp = (char *) get_property(device, "compatible", &cplen);
1492 if (strncasecmp(cp, compat, strlen(compat)) == 0)
1501 EXPORT_SYMBOL(device_is_compatible);
1505 * Indicates whether the root node has a given value in its
1506 * compatible property.
1508 int machine_is_compatible(const char *compat)
1510 struct device_node *root;
1513 root = of_find_node_by_path("/");
1515 rc = device_is_compatible(root, compat);
1520 EXPORT_SYMBOL(machine_is_compatible);
1523 * Construct and return a list of the device_nodes with a given type
1524 * and compatible property.
1526 struct device_node *find_compatible_devices(const char *type,
1529 struct device_node *head, **prevp, *np;
1532 for (np = allnodes; np != 0; np = np->allnext) {
1534 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1536 if (device_is_compatible(np, compat)) {
1544 EXPORT_SYMBOL(find_compatible_devices);
1547 * Find the device_node with a given full_name.
1549 struct device_node *find_path_device(const char *path)
1551 struct device_node *np;
1553 for (np = allnodes; np != 0; np = np->allnext)
1554 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0)
1558 EXPORT_SYMBOL(find_path_device);
1562 * New implementation of the OF "find" APIs, return a refcounted
1563 * object, call of_node_put() when done. The device tree and list
1564 * are protected by a rw_lock.
1566 * Note that property management will need some locking as well,
1567 * this isn't dealt with yet.
1572 * of_find_node_by_name - Find a node by its "name" property
1573 * @from: The node to start searching from or NULL, the node
1574 * you pass will not be searched, only the next one
1575 * will; typically, you pass what the previous call
1576 * returned. of_node_put() will be called on it
1577 * @name: The name string to match against
1579 * Returns a node pointer with refcount incremented, use
1580 * of_node_put() on it when done.
1582 struct device_node *of_find_node_by_name(struct device_node *from,
1585 struct device_node *np;
1587 read_lock(&devtree_lock);
1588 np = from ? from->allnext : allnodes;
1589 for (; np != 0; np = np->allnext)
1590 if (np->name != 0 && strcasecmp(np->name, name) == 0
1595 read_unlock(&devtree_lock);
1598 EXPORT_SYMBOL(of_find_node_by_name);
1601 * of_find_node_by_type - Find a node by its "device_type" property
1602 * @from: The node to start searching from or NULL, the node
1603 * you pass will not be searched, only the next one
1604 * will; typically, you pass what the previous call
1605 * returned. of_node_put() will be called on it
1606 * @name: The type string to match against
1608 * Returns a node pointer with refcount incremented, use
1609 * of_node_put() on it when done.
1611 struct device_node *of_find_node_by_type(struct device_node *from,
1614 struct device_node *np;
1616 read_lock(&devtree_lock);
1617 np = from ? from->allnext : allnodes;
1618 for (; np != 0; np = np->allnext)
1619 if (np->type != 0 && strcasecmp(np->type, type) == 0
1624 read_unlock(&devtree_lock);
1627 EXPORT_SYMBOL(of_find_node_by_type);
1630 * of_find_compatible_node - Find a node based on type and one of the
1631 * tokens in its "compatible" property
1632 * @from: The node to start searching from or NULL, the node
1633 * you pass will not be searched, only the next one
1634 * will; typically, you pass what the previous call
1635 * returned. of_node_put() will be called on it
1636 * @type: The type string to match "device_type" or NULL to ignore
1637 * @compatible: The string to match to one of the tokens in the device
1638 * "compatible" list.
1640 * Returns a node pointer with refcount incremented, use
1641 * of_node_put() on it when done.
1643 struct device_node *of_find_compatible_node(struct device_node *from,
1644 const char *type, const char *compatible)
1646 struct device_node *np;
1648 read_lock(&devtree_lock);
1649 np = from ? from->allnext : allnodes;
1650 for (; np != 0; np = np->allnext) {
1652 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1654 if (device_is_compatible(np, compatible) && of_node_get(np))
1659 read_unlock(&devtree_lock);
1662 EXPORT_SYMBOL(of_find_compatible_node);
1665 * of_find_node_by_path - Find a node matching a full OF path
1666 * @path: The full path to match
1668 * Returns a node pointer with refcount incremented, use
1669 * of_node_put() on it when done.
1671 struct device_node *of_find_node_by_path(const char *path)
1673 struct device_node *np = allnodes;
1675 read_lock(&devtree_lock);
1676 for (; np != 0; np = np->allnext) {
1677 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1681 read_unlock(&devtree_lock);
1684 EXPORT_SYMBOL(of_find_node_by_path);
1687 * of_find_node_by_phandle - Find a node given a phandle
1688 * @handle: phandle of the node to find
1690 * Returns a node pointer with refcount incremented, use
1691 * of_node_put() on it when done.
1693 struct device_node *of_find_node_by_phandle(phandle handle)
1695 struct device_node *np;
1697 read_lock(&devtree_lock);
1698 for (np = allnodes; np != 0; np = np->allnext)
1699 if (np->linux_phandle == handle)
1703 read_unlock(&devtree_lock);
1706 EXPORT_SYMBOL(of_find_node_by_phandle);
1709 * of_find_all_nodes - Get next node in global list
1710 * @prev: Previous node or NULL to start iteration
1711 * of_node_put() will be called on it
1713 * Returns a node pointer with refcount incremented, use
1714 * of_node_put() on it when done.
1716 struct device_node *of_find_all_nodes(struct device_node *prev)
1718 struct device_node *np;
1720 read_lock(&devtree_lock);
1721 np = prev ? prev->allnext : allnodes;
1722 for (; np != 0; np = np->allnext)
1723 if (of_node_get(np))
1727 read_unlock(&devtree_lock);
1730 EXPORT_SYMBOL(of_find_all_nodes);
1733 * of_get_parent - Get a node's parent if any
1734 * @node: Node to get parent
1736 * Returns a node pointer with refcount incremented, use
1737 * of_node_put() on it when done.
1739 struct device_node *of_get_parent(const struct device_node *node)
1741 struct device_node *np;
1746 read_lock(&devtree_lock);
1747 np = of_node_get(node->parent);
1748 read_unlock(&devtree_lock);
1751 EXPORT_SYMBOL(of_get_parent);
1754 * of_get_next_child - Iterate a node childs
1755 * @node: parent node
1756 * @prev: previous child of the parent node, or NULL to get first
1758 * Returns a node pointer with refcount incremented, use
1759 * of_node_put() on it when done.
1761 struct device_node *of_get_next_child(const struct device_node *node,
1762 struct device_node *prev)
1764 struct device_node *next;
1766 read_lock(&devtree_lock);
1767 next = prev ? prev->sibling : node->child;
1768 for (; next != 0; next = next->sibling)
1769 if (of_node_get(next))
1773 read_unlock(&devtree_lock);
1776 EXPORT_SYMBOL(of_get_next_child);
1779 * of_node_get - Increment refcount of a node
1780 * @node: Node to inc refcount, NULL is supported to
1781 * simplify writing of callers
1785 struct device_node *of_node_get(struct device_node *node)
1788 kref_get(&node->kref);
1791 EXPORT_SYMBOL(of_node_get);
1793 static inline struct device_node * kref_to_device_node(struct kref *kref)
1795 return container_of(kref, struct device_node, kref);
1799 * of_node_release - release a dynamically allocated node
1800 * @kref: kref element of the node to be released
1802 * In of_node_put() this function is passed to kref_put()
1803 * as the destructor.
1805 static void of_node_release(struct kref *kref)
1807 struct device_node *node = kref_to_device_node(kref);
1808 struct property *prop = node->properties;
1810 if (!OF_IS_DYNAMIC(node))
1813 struct property *next = prop->next;
1821 kfree(node->full_name);
1827 * of_node_put - Decrement refcount of a node
1828 * @node: Node to dec refcount, NULL is supported to
1829 * simplify writing of callers
1832 void of_node_put(struct device_node *node)
1835 kref_put(&node->kref, of_node_release);
1837 EXPORT_SYMBOL(of_node_put);
1840 * Plug a device node into the tree and global list.
1842 void of_attach_node(struct device_node *np)
1844 write_lock(&devtree_lock);
1845 np->sibling = np->parent->child;
1846 np->allnext = allnodes;
1847 np->parent->child = np;
1849 write_unlock(&devtree_lock);
1853 * "Unplug" a node from the device tree. The caller must hold
1854 * a reference to the node. The memory associated with the node
1855 * is not freed until its refcount goes to zero.
1857 void of_detach_node(const struct device_node *np)
1859 struct device_node *parent;
1861 write_lock(&devtree_lock);
1863 parent = np->parent;
1866 allnodes = np->allnext;
1868 struct device_node *prev;
1869 for (prev = allnodes;
1870 prev->allnext != np;
1871 prev = prev->allnext)
1873 prev->allnext = np->allnext;
1876 if (parent->child == np)
1877 parent->child = np->sibling;
1879 struct device_node *prevsib;
1880 for (prevsib = np->parent->child;
1881 prevsib->sibling != np;
1882 prevsib = prevsib->sibling)
1884 prevsib->sibling = np->sibling;
1887 write_unlock(&devtree_lock);
1890 #ifdef CONFIG_PPC_PSERIES
1892 * Fix up the uninitialized fields in a new device node:
1893 * name, type, n_addrs, addrs, n_intrs, intrs, and pci-specific fields
1895 * A lot of boot-time code is duplicated here, because functions such
1896 * as finish_node_interrupts, interpret_pci_props, etc. cannot use the
1899 * This should probably be split up into smaller chunks.
1902 static int of_finish_dynamic_node(struct device_node *node,
1903 unsigned long *unused1, int unused2,
1904 int unused3, int unused4)
1906 struct device_node *parent = of_get_parent(node);
1908 phandle *ibm_phandle;
1910 node->name = get_property(node, "name", NULL);
1911 node->type = get_property(node, "device_type", NULL);
1918 /* We don't support that function on PowerMac, at least
1921 if (_machine == PLATFORM_POWERMAC)
1924 /* fix up new node's linux_phandle field */
1925 if ((ibm_phandle = (unsigned int *)get_property(node, "ibm,phandle", NULL)))
1926 node->linux_phandle = *ibm_phandle;
1929 of_node_put(parent);
1933 static int prom_reconfig_notifier(struct notifier_block *nb,
1934 unsigned long action, void *node)
1939 case PSERIES_RECONFIG_ADD:
1940 err = finish_node(node, NULL, of_finish_dynamic_node, 0, 0, 0);
1942 printk(KERN_ERR "finish_node returned %d\n", err);
1953 static struct notifier_block prom_reconfig_nb = {
1954 .notifier_call = prom_reconfig_notifier,
1955 .priority = 10, /* This one needs to run first */
1958 static int __init prom_reconfig_setup(void)
1960 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1962 __initcall(prom_reconfig_setup);
1966 * Find a property with a given name for a given node
1967 * and return the value.
1969 unsigned char *get_property(struct device_node *np, const char *name,
1972 struct property *pp;
1974 for (pp = np->properties; pp != 0; pp = pp->next)
1975 if (strcmp(pp->name, name) == 0) {
1982 EXPORT_SYMBOL(get_property);
1985 * Add a property to a node
1987 int prom_add_property(struct device_node* np, struct property* prop)
1989 struct property **next;
1992 write_lock(&devtree_lock);
1993 next = &np->properties;
1995 if (strcmp(prop->name, (*next)->name) == 0) {
1996 /* duplicate ! don't insert it */
1997 write_unlock(&devtree_lock);
2000 next = &(*next)->next;
2003 write_unlock(&devtree_lock);
2005 #ifdef CONFIG_PROC_DEVICETREE
2006 /* try to add to proc as well if it was initialized */
2008 proc_device_tree_add_prop(np->pde, prop);
2009 #endif /* CONFIG_PROC_DEVICETREE */
2014 /* I quickly hacked that one, check against spec ! */
2015 static inline unsigned long
2016 bus_space_to_resource_flags(unsigned int bus_space)
2018 u8 space = (bus_space >> 24) & 0xf;
2022 return IORESOURCE_MEM;
2023 else if (space == 0x01)
2024 return IORESOURCE_IO;
2026 printk(KERN_WARNING "prom.c: bus_space_to_resource_flags(), space: %x\n",
2033 static struct resource *find_parent_pci_resource(struct pci_dev* pdev,
2034 struct address_range *range)
2039 /* Check this one */
2040 mask = bus_space_to_resource_flags(range->space);
2041 for (i=0; i<DEVICE_COUNT_RESOURCE; i++) {
2042 if ((pdev->resource[i].flags & mask) == mask &&
2043 pdev->resource[i].start <= range->address &&
2044 pdev->resource[i].end > range->address) {
2045 if ((range->address + range->size - 1) > pdev->resource[i].end) {
2046 /* Add better message */
2047 printk(KERN_WARNING "PCI/OF resource overlap !\n");
2053 if (i == DEVICE_COUNT_RESOURCE)
2055 return &pdev->resource[i];
2059 * Request an OF device resource. Currently handles child of PCI devices,
2060 * or other nodes attached to the root node. Ultimately, put some
2061 * link to resources in the OF node.
2063 struct resource *request_OF_resource(struct device_node* node, int index,
2064 const char* name_postfix)
2066 struct pci_dev* pcidev;
2067 u8 pci_bus, pci_devfn;
2068 unsigned long iomask;
2069 struct device_node* nd;
2070 struct resource* parent;
2071 struct resource *res = NULL;
2074 if (index >= node->n_addrs)
2077 /* Sanity check on bus space */
2078 iomask = bus_space_to_resource_flags(node->addrs[index].space);
2079 if (iomask & IORESOURCE_MEM)
2080 parent = &iomem_resource;
2081 else if (iomask & IORESOURCE_IO)
2082 parent = &ioport_resource;
2086 /* Find a PCI parent if any */
2090 if (!pci_device_from_OF_node(nd, &pci_bus, &pci_devfn))
2091 pcidev = pci_find_slot(pci_bus, pci_devfn);
2096 parent = find_parent_pci_resource(pcidev, &node->addrs[index]);
2098 printk(KERN_WARNING "request_OF_resource(%s), parent not found\n",
2103 res = __request_region(parent, node->addrs[index].address,
2104 node->addrs[index].size, NULL);
2107 nlen = strlen(node->name);
2108 plen = name_postfix ? strlen(name_postfix) : 0;
2109 res->name = (const char *)kmalloc(nlen+plen+1, GFP_KERNEL);
2111 strcpy((char *)res->name, node->name);
2113 strcpy((char *)res->name+nlen, name_postfix);
2119 EXPORT_SYMBOL(request_OF_resource);
2121 int release_OF_resource(struct device_node *node, int index)
2123 struct pci_dev* pcidev;
2124 u8 pci_bus, pci_devfn;
2125 unsigned long iomask, start, end;
2126 struct device_node* nd;
2127 struct resource* parent;
2128 struct resource *res = NULL;
2130 if (index >= node->n_addrs)
2133 /* Sanity check on bus space */
2134 iomask = bus_space_to_resource_flags(node->addrs[index].space);
2135 if (iomask & IORESOURCE_MEM)
2136 parent = &iomem_resource;
2137 else if (iomask & IORESOURCE_IO)
2138 parent = &ioport_resource;
2142 /* Find a PCI parent if any */
2146 if (!pci_device_from_OF_node(nd, &pci_bus, &pci_devfn))
2147 pcidev = pci_find_slot(pci_bus, pci_devfn);
2152 parent = find_parent_pci_resource(pcidev, &node->addrs[index]);
2154 printk(KERN_WARNING "release_OF_resource(%s), parent not found\n",
2159 /* Find us in the parent and its childs */
2160 res = parent->child;
2161 start = node->addrs[index].address;
2162 end = start + node->addrs[index].size - 1;
2164 if (res->start == start && res->end == end &&
2165 (res->flags & IORESOURCE_BUSY))
2167 if (res->start <= start && res->end >= end)
2179 release_resource(res);
2184 EXPORT_SYMBOL(release_OF_resource);
2185 #endif /* CONFIG_PCI */