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>
37 #include <asm/processor.h>
41 #include <asm/system.h>
43 #include <asm/pgtable.h>
45 #include <asm/iommu.h>
46 #include <asm/btext.h>
47 #include <asm/sections.h>
48 #include <asm/machdep.h>
49 #include <asm/pSeries_reconfig.h>
50 #include <asm/pci-bridge.h>
52 #include <asm/systemcfg.h>
56 #define DBG(fmt...) printk(KERN_ERR fmt)
61 struct pci_reg_property {
62 struct pci_address addr;
67 struct isa_reg_property {
74 typedef int interpret_func(struct device_node *, unsigned long *,
77 extern struct rtas_t rtas;
78 extern struct lmb lmb;
79 extern unsigned long klimit;
81 static unsigned long memory_limit;
83 static int __initdata dt_root_addr_cells;
84 static int __initdata dt_root_size_cells;
87 static int __initdata iommu_is_off;
88 int __initdata iommu_force_on;
89 extern unsigned long tce_alloc_start, tce_alloc_end;
95 static struct boot_param_header *initial_boot_params __initdata;
97 struct boot_param_header *initial_boot_params;
100 static struct device_node *allnodes = NULL;
102 /* use when traversing tree through the allnext, child, sibling,
103 * or parent members of struct device_node.
105 static DEFINE_RWLOCK(devtree_lock);
107 /* export that to outside world */
108 struct device_node *of_chosen;
110 struct device_node *dflt_interrupt_controller;
111 int num_interrupt_controllers;
114 * Wrapper for allocating memory for various data that needs to be
115 * attached to device nodes as they are processed at boot or when
116 * added to the device tree later (e.g. DLPAR). At boot there is
117 * already a region reserved so we just increment *mem_start by size;
118 * otherwise we call kmalloc.
120 static void * prom_alloc(unsigned long size, unsigned long *mem_start)
125 return kmalloc(size, GFP_KERNEL);
133 * Find the device_node with a given phandle.
135 static struct device_node * find_phandle(phandle ph)
137 struct device_node *np;
139 for (np = allnodes; np != 0; np = np->allnext)
140 if (np->linux_phandle == ph)
146 * Find the interrupt parent of a node.
148 static struct device_node * __devinit intr_parent(struct device_node *p)
152 parp = (phandle *) get_property(p, "interrupt-parent", NULL);
155 p = find_phandle(*parp);
159 * On a powermac booted with BootX, we don't get to know the
160 * phandles for any nodes, so find_phandle will return NULL.
161 * Fortunately these machines only have one interrupt controller
162 * so there isn't in fact any ambiguity. -- paulus
164 if (num_interrupt_controllers == 1)
165 p = dflt_interrupt_controller;
170 * Find out the size of each entry of the interrupts property
173 int __devinit prom_n_intr_cells(struct device_node *np)
175 struct device_node *p;
178 for (p = np; (p = intr_parent(p)) != NULL; ) {
179 icp = (unsigned int *)
180 get_property(p, "#interrupt-cells", NULL);
183 if (get_property(p, "interrupt-controller", NULL) != NULL
184 || get_property(p, "interrupt-map", NULL) != NULL) {
185 printk("oops, node %s doesn't have #interrupt-cells\n",
191 printk("prom_n_intr_cells failed for %s\n", np->full_name);
197 * Map an interrupt from a device up to the platform interrupt
200 static int __devinit map_interrupt(unsigned int **irq, struct device_node **ictrler,
201 struct device_node *np, unsigned int *ints,
204 struct device_node *p, *ipar;
205 unsigned int *imap, *imask, *ip;
206 int i, imaplen, match;
207 int newintrc = 0, newaddrc = 0;
211 reg = (unsigned int *) get_property(np, "reg", NULL);
212 naddrc = prom_n_addr_cells(np);
215 if (get_property(p, "interrupt-controller", NULL) != NULL)
216 /* this node is an interrupt controller, stop here */
218 imap = (unsigned int *)
219 get_property(p, "interrupt-map", &imaplen);
224 imask = (unsigned int *)
225 get_property(p, "interrupt-map-mask", NULL);
227 printk("oops, %s has interrupt-map but no mask\n",
231 imaplen /= sizeof(unsigned int);
234 while (imaplen > 0 && !match) {
235 /* check the child-interrupt field */
237 for (i = 0; i < naddrc && match; ++i)
238 match = ((reg[i] ^ imap[i]) & imask[i]) == 0;
239 for (; i < naddrc + nintrc && match; ++i)
240 match = ((ints[i-naddrc] ^ imap[i]) & imask[i]) == 0;
241 imap += naddrc + nintrc;
242 imaplen -= naddrc + nintrc;
243 /* grab the interrupt parent */
244 ipar = find_phandle((phandle) *imap++);
246 if (ipar == NULL && num_interrupt_controllers == 1)
247 /* cope with BootX not giving us phandles */
248 ipar = dflt_interrupt_controller;
250 printk("oops, no int parent %x in map of %s\n",
251 imap[-1], p->full_name);
254 /* find the parent's # addr and intr cells */
255 ip = (unsigned int *)
256 get_property(ipar, "#interrupt-cells", NULL);
258 printk("oops, no #interrupt-cells on %s\n",
263 ip = (unsigned int *)
264 get_property(ipar, "#address-cells", NULL);
265 newaddrc = (ip == NULL)? 0: *ip;
266 imap += newaddrc + newintrc;
267 imaplen -= newaddrc + newintrc;
270 printk("oops, error decoding int-map on %s, len=%d\n",
271 p->full_name, imaplen);
276 printk("oops, no match in %s int-map for %s\n",
277 p->full_name, np->full_name);
284 ints = imap - nintrc;
289 printk("hmmm, int tree for %s doesn't have ctrler\n",
299 static int __devinit finish_node_interrupts(struct device_node *np,
300 unsigned long *mem_start,
304 int intlen, intrcells, intrcount;
306 unsigned int *irq, virq;
307 struct device_node *ic;
309 if (num_interrupt_controllers == 0) {
311 * Old machines just have a list of interrupt numbers
312 * and no interrupt-controller nodes.
314 ints = (unsigned int *) get_property(np, "AAPL,interrupts",
316 /* XXX old interpret_pci_props looked in parent too */
317 /* XXX old interpret_macio_props looked for interrupts
318 before AAPL,interrupts */
320 ints = (unsigned int *) get_property(np, "interrupts",
325 np->n_intrs = intlen / sizeof(unsigned int);
326 np->intrs = prom_alloc(np->n_intrs * sizeof(np->intrs[0]),
333 for (i = 0; i < np->n_intrs; ++i) {
334 np->intrs[i].line = *ints++;
335 np->intrs[i].sense = 1;
340 ints = (unsigned int *) get_property(np, "interrupts", &intlen);
343 intrcells = prom_n_intr_cells(np);
344 intlen /= intrcells * sizeof(unsigned int);
346 np->intrs = prom_alloc(intlen * sizeof(*(np->intrs)), mem_start);
354 for (i = 0; i < intlen; ++i, ints += intrcells) {
355 n = map_interrupt(&irq, &ic, np, ints, intrcells);
359 /* don't map IRQ numbers under a cascaded 8259 controller */
360 if (ic && device_is_compatible(ic, "chrp,iic")) {
361 np->intrs[intrcount].line = irq[0];
364 virq = virt_irq_create_mapping(irq[0]);
365 if (virq == NO_IRQ) {
366 printk(KERN_CRIT "Could not allocate interrupt"
367 " number for %s\n", np->full_name);
370 virq = irq_offset_up(virq);
374 np->intrs[intrcount].line = virq;
378 /* We offset irq numbers for the u3 MPIC by 128 in PowerMac */
379 if (systemcfg->platform == PLATFORM_POWERMAC && ic && ic->parent) {
380 char *name = get_property(ic->parent, "name", NULL);
381 if (name && !strcmp(name, "u3"))
382 np->intrs[intrcount].line += 128;
383 else if (!(name && !strcmp(name, "mac-io")))
384 /* ignore other cascaded controllers, such as
389 np->intrs[intrcount].sense = 1;
391 np->intrs[intrcount].sense = irq[1];
393 printk("hmmm, got %d intr cells for %s:", n,
395 for (j = 0; j < n; ++j)
396 printk(" %d", irq[j]);
401 np->n_intrs = intrcount;
406 static int __devinit interpret_pci_props(struct device_node *np,
407 unsigned long *mem_start,
408 int naddrc, int nsizec,
411 struct address_range *adr;
412 struct pci_reg_property *pci_addrs;
415 pci_addrs = (struct pci_reg_property *)
416 get_property(np, "assigned-addresses", &l);
420 n_addrs = l / sizeof(*pci_addrs);
422 adr = prom_alloc(n_addrs * sizeof(*adr), mem_start);
430 np->n_addrs = n_addrs;
432 for (i = 0; i < n_addrs; i++) {
433 adr[i].space = pci_addrs[i].addr.a_hi;
434 adr[i].address = pci_addrs[i].addr.a_lo |
435 ((u64)pci_addrs[i].addr.a_mid << 32);
436 adr[i].size = pci_addrs[i].size_lo;
442 static int __init interpret_dbdma_props(struct device_node *np,
443 unsigned long *mem_start,
444 int naddrc, int nsizec,
447 struct reg_property32 *rp;
448 struct address_range *adr;
449 unsigned long base_address;
451 struct device_node *db;
455 for (db = np->parent; db != NULL; db = db->parent) {
456 if (!strcmp(db->type, "dbdma") && db->n_addrs != 0) {
457 base_address = db->addrs[0].address;
463 rp = (struct reg_property32 *) get_property(np, "reg", &l);
464 if (rp != 0 && l >= sizeof(struct reg_property32)) {
466 adr = (struct address_range *) (*mem_start);
467 while ((l -= sizeof(struct reg_property32)) >= 0) {
470 adr[i].address = rp[i].address + base_address;
471 adr[i].size = rp[i].size;
477 (*mem_start) += i * sizeof(struct address_range);
483 static int __init interpret_macio_props(struct device_node *np,
484 unsigned long *mem_start,
485 int naddrc, int nsizec,
488 struct reg_property32 *rp;
489 struct address_range *adr;
490 unsigned long base_address;
492 struct device_node *db;
496 for (db = np->parent; db != NULL; db = db->parent) {
497 if (!strcmp(db->type, "mac-io") && db->n_addrs != 0) {
498 base_address = db->addrs[0].address;
504 rp = (struct reg_property32 *) get_property(np, "reg", &l);
505 if (rp != 0 && l >= sizeof(struct reg_property32)) {
507 adr = (struct address_range *) (*mem_start);
508 while ((l -= sizeof(struct reg_property32)) >= 0) {
511 adr[i].address = rp[i].address + base_address;
512 adr[i].size = rp[i].size;
518 (*mem_start) += i * sizeof(struct address_range);
524 static int __init interpret_isa_props(struct device_node *np,
525 unsigned long *mem_start,
526 int naddrc, int nsizec,
529 struct isa_reg_property *rp;
530 struct address_range *adr;
533 rp = (struct isa_reg_property *) get_property(np, "reg", &l);
534 if (rp != 0 && l >= sizeof(struct isa_reg_property)) {
536 adr = (struct address_range *) (*mem_start);
537 while ((l -= sizeof(struct isa_reg_property)) >= 0) {
539 adr[i].space = rp[i].space;
540 adr[i].address = rp[i].address;
541 adr[i].size = rp[i].size;
547 (*mem_start) += i * sizeof(struct address_range);
553 static int __init interpret_root_props(struct device_node *np,
554 unsigned long *mem_start,
555 int naddrc, int nsizec,
558 struct address_range *adr;
561 int rpsize = (naddrc + nsizec) * sizeof(unsigned int);
563 rp = (unsigned int *) get_property(np, "reg", &l);
564 if (rp != 0 && l >= rpsize) {
566 adr = (struct address_range *) (*mem_start);
567 while ((l -= rpsize) >= 0) {
570 adr[i].address = rp[naddrc - 1];
571 adr[i].size = rp[naddrc + nsizec - 1];
574 rp += naddrc + nsizec;
578 (*mem_start) += i * sizeof(struct address_range);
584 static int __devinit finish_node(struct device_node *np,
585 unsigned long *mem_start,
586 interpret_func *ifunc,
587 int naddrc, int nsizec,
590 struct device_node *child;
593 /* get the device addresses and interrupts */
595 rc = ifunc(np, mem_start, naddrc, nsizec, measure_only);
599 rc = finish_node_interrupts(np, mem_start, measure_only);
603 /* Look for #address-cells and #size-cells properties. */
604 ip = (int *) get_property(np, "#address-cells", NULL);
607 ip = (int *) get_property(np, "#size-cells", NULL);
611 if (!strcmp(np->name, "device-tree") || np->parent == NULL)
612 ifunc = interpret_root_props;
613 else if (np->type == 0)
615 else if (!strcmp(np->type, "pci") || !strcmp(np->type, "vci"))
616 ifunc = interpret_pci_props;
617 else if (!strcmp(np->type, "dbdma"))
618 ifunc = interpret_dbdma_props;
619 else if (!strcmp(np->type, "mac-io") || ifunc == interpret_macio_props)
620 ifunc = interpret_macio_props;
621 else if (!strcmp(np->type, "isa"))
622 ifunc = interpret_isa_props;
623 else if (!strcmp(np->name, "uni-n") || !strcmp(np->name, "u3"))
624 ifunc = interpret_root_props;
625 else if (!((ifunc == interpret_dbdma_props
626 || ifunc == interpret_macio_props)
627 && (!strcmp(np->type, "escc")
628 || !strcmp(np->type, "media-bay"))))
631 for (child = np->child; child != NULL; child = child->sibling) {
632 rc = finish_node(child, mem_start, ifunc,
633 naddrc, nsizec, measure_only);
641 static void __init scan_interrupt_controllers(void)
643 struct device_node *np;
648 for (np = allnodes; np != NULL; np = np->allnext) {
649 ic = get_property(np, "interrupt-controller", &iclen);
650 name = get_property(np, "name", NULL);
651 /* checking iclen makes sure we don't get a false
652 match on /chosen.interrupt_controller */
654 && strcmp(name, "interrupt-controller") == 0)
655 || (ic != NULL && iclen == 0
656 && strcmp(name, "AppleKiwi"))) {
658 dflt_interrupt_controller = np;
662 num_interrupt_controllers = n;
666 * finish_device_tree is called once things are running normally
667 * (i.e. with text and data mapped to the address they were linked at).
668 * It traverses the device tree and fills in some of the additional,
669 * fields in each node like {n_}addrs and {n_}intrs, the virt interrupt
670 * mapping is also initialized at this point.
672 void __init finish_device_tree(void)
674 unsigned long start, end, size = 0;
676 DBG(" -> finish_device_tree\n");
679 /* Initialize virtual IRQ map */
682 scan_interrupt_controllers();
685 * Finish device-tree (pre-parsing some properties etc...)
686 * We do this in 2 passes. One with "measure_only" set, which
687 * will only measure the amount of memory needed, then we can
688 * allocate that memory, and call finish_node again. However,
689 * we must be careful as most routines will fail nowadays when
690 * prom_alloc() returns 0, so we must make sure our first pass
691 * doesn't start at 0. We pre-initialize size to 16 for that
692 * reason and then remove those additional 16 bytes
695 finish_node(allnodes, &size, NULL, 0, 0, 1);
697 end = start = (unsigned long) __va(lmb_alloc(size, 128));
698 finish_node(allnodes, &end, NULL, 0, 0, 0);
699 BUG_ON(end != start + size);
701 DBG(" <- finish_device_tree\n");
704 static inline char *find_flat_dt_string(u32 offset)
706 return ((char *)initial_boot_params) +
707 initial_boot_params->off_dt_strings + offset;
711 * This function is used to scan the flattened device-tree, it is
712 * used to extract the memory informations at boot before we can
715 static int __init scan_flat_dt(int (*it)(unsigned long node,
716 const char *uname, int depth,
720 unsigned long p = ((unsigned long)initial_boot_params) +
721 initial_boot_params->off_dt_struct;
726 u32 tag = *((u32 *)p);
730 if (tag == OF_DT_END_NODE) {
734 if (tag == OF_DT_NOP)
736 if (tag == OF_DT_END)
738 if (tag == OF_DT_PROP) {
739 u32 sz = *((u32 *)p);
741 if (initial_boot_params->version < 0x10)
742 p = _ALIGN(p, sz >= 8 ? 8 : 4);
747 if (tag != OF_DT_BEGIN_NODE) {
748 printk(KERN_WARNING "Invalid tag %x scanning flattened"
749 " device tree !\n", tag);
754 p = _ALIGN(p + strlen(pathp) + 1, 4);
755 if ((*pathp) == '/') {
757 for (lp = NULL, np = pathp; *np; np++)
763 rc = it(p, pathp, depth, data);
772 * This function can be used within scan_flattened_dt callback to get
773 * access to properties
775 static void* __init get_flat_dt_prop(unsigned long node, const char *name,
778 unsigned long p = node;
781 u32 tag = *((u32 *)p);
786 if (tag == OF_DT_NOP)
788 if (tag != OF_DT_PROP)
792 noff = *((u32 *)(p + 4));
794 if (initial_boot_params->version < 0x10)
795 p = _ALIGN(p, sz >= 8 ? 8 : 4);
797 nstr = find_flat_dt_string(noff);
799 printk(KERN_WARNING "Can't find property index"
803 if (strcmp(name, nstr) == 0) {
813 static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
818 *mem = _ALIGN(*mem, align);
825 static unsigned long __init unflatten_dt_node(unsigned long mem,
827 struct device_node *dad,
828 struct device_node ***allnextpp,
829 unsigned long fpsize)
831 struct device_node *np;
832 struct property *pp, **prev_pp = NULL;
835 unsigned int l, allocl;
839 tag = *((u32 *)(*p));
840 if (tag != OF_DT_BEGIN_NODE) {
841 printk("Weird tag at start of node: %x\n", tag);
846 l = allocl = strlen(pathp) + 1;
847 *p = _ALIGN(*p + l, 4);
849 /* version 0x10 has a more compact unit name here instead of the full
850 * path. we accumulate the full path size using "fpsize", we'll rebuild
851 * it later. We detect this because the first character of the name is
854 if ((*pathp) != '/') {
857 /* root node: special case. fpsize accounts for path
858 * plus terminating zero. root node only has '/', so
859 * fpsize should be 2, but we want to avoid the first
860 * level nodes to have two '/' so we use fpsize 1 here
865 /* account for '/' and path size minus terminal 0
874 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
875 __alignof__(struct device_node));
877 memset(np, 0, sizeof(*np));
878 np->full_name = ((char*)np) + sizeof(struct device_node);
880 char *p = np->full_name;
881 /* rebuild full path for new format */
882 if (dad && dad->parent) {
883 strcpy(p, dad->full_name);
885 if ((strlen(p) + l + 1) != allocl) {
886 DBG("%s: p: %d, l: %d, a: %d\n",
887 pathp, strlen(p), l, allocl);
895 memcpy(np->full_name, pathp, l);
896 prev_pp = &np->properties;
898 *allnextpp = &np->allnext;
901 /* we temporarily use the next field as `last_child'*/
905 dad->next->sibling = np;
908 kref_init(&np->kref);
914 tag = *((u32 *)(*p));
915 if (tag == OF_DT_NOP) {
919 if (tag != OF_DT_PROP)
923 noff = *((u32 *)((*p) + 4));
925 if (initial_boot_params->version < 0x10)
926 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
928 pname = find_flat_dt_string(noff);
930 printk("Can't find property name in list !\n");
933 if (strcmp(pname, "name") == 0)
935 l = strlen(pname) + 1;
936 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
937 __alignof__(struct property));
939 if (strcmp(pname, "linux,phandle") == 0) {
940 np->node = *((u32 *)*p);
941 if (np->linux_phandle == 0)
942 np->linux_phandle = np->node;
944 if (strcmp(pname, "ibm,phandle") == 0)
945 np->linux_phandle = *((u32 *)*p);
948 pp->value = (void *)*p;
952 *p = _ALIGN((*p) + sz, 4);
954 /* with version 0x10 we may not have the name property, recreate
955 * it here from the unit name if absent
958 char *p = pathp, *ps = pathp, *pa = NULL;
971 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
972 __alignof__(struct property));
976 pp->value = (unsigned char *)(pp + 1);
979 memcpy(pp->value, ps, sz - 1);
980 ((char *)pp->value)[sz - 1] = 0;
981 DBG("fixed up name for %s -> %s\n", pathp, pp->value);
986 np->name = get_property(np, "name", NULL);
987 np->type = get_property(np, "device_type", NULL);
994 while (tag == OF_DT_BEGIN_NODE) {
995 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
996 tag = *((u32 *)(*p));
998 if (tag != OF_DT_END_NODE) {
999 printk("Weird tag at end of node: %x\n", tag);
1008 * unflattens the device-tree passed by the firmware, creating the
1009 * tree of struct device_node. It also fills the "name" and "type"
1010 * pointers of the nodes so the normal device-tree walking functions
1011 * can be used (this used to be done by finish_device_tree)
1013 void __init unflatten_device_tree(void)
1015 unsigned long start, mem, size;
1016 struct device_node **allnextp = &allnodes;
1020 DBG(" -> unflatten_device_tree()\n");
1022 /* First pass, scan for size */
1023 start = ((unsigned long)initial_boot_params) +
1024 initial_boot_params->off_dt_struct;
1025 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
1026 size = (size | 3) + 1;
1028 DBG(" size is %lx, allocating...\n", size);
1030 /* Allocate memory for the expanded device tree */
1031 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
1033 DBG("Couldn't allocate memory with lmb_alloc()!\n");
1034 panic("Couldn't allocate memory with lmb_alloc()!\n");
1036 mem = (unsigned long) __va(mem);
1038 ((u32 *)mem)[size / 4] = 0xdeadbeef;
1040 DBG(" unflattening %lx...\n", mem);
1042 /* Second pass, do actual unflattening */
1043 start = ((unsigned long)initial_boot_params) +
1044 initial_boot_params->off_dt_struct;
1045 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
1046 if (*((u32 *)start) != OF_DT_END)
1047 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
1048 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
1049 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
1050 ((u32 *)mem)[size / 4] );
1053 /* Get pointer to OF "/chosen" node for use everywhere */
1054 of_chosen = of_find_node_by_path("/chosen");
1055 if (of_chosen == NULL)
1056 of_chosen = of_find_node_by_path("/chosen@0");
1058 /* Retreive command line */
1059 if (of_chosen != NULL) {
1060 p = (char *)get_property(of_chosen, "bootargs", &l);
1061 if (p != NULL && l > 0)
1062 strlcpy(cmd_line, p, min(l, COMMAND_LINE_SIZE));
1064 #ifdef CONFIG_CMDLINE
1065 if (l == 0 || (l == 1 && (*p) == 0))
1066 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
1067 #endif /* CONFIG_CMDLINE */
1069 DBG("Command line is: %s\n", cmd_line);
1071 DBG(" <- unflatten_device_tree()\n");
1075 static int __init early_init_dt_scan_cpus(unsigned long node,
1076 const char *uname, int depth, void *data)
1078 char *type = get_flat_dt_prop(node, "device_type", NULL);
1080 unsigned long size = 0;
1082 /* We are scanning "cpu" nodes only */
1083 if (type == NULL || strcmp(type, "cpu") != 0)
1086 #ifdef CONFIG_PPC_PSERIES
1087 /* On LPAR, look for the first ibm,pft-size property for the hash table size
1089 if (systemcfg->platform == PLATFORM_PSERIES_LPAR && ppc64_pft_size == 0) {
1091 pft_size = get_flat_dt_prop(node, "ibm,pft-size", NULL);
1092 if (pft_size != NULL) {
1093 /* pft_size[0] is the NUMA CEC cookie */
1094 ppc64_pft_size = pft_size[1];
1100 if (initial_boot_params && initial_boot_params->version >= 2) {
1101 /* version 2 of the kexec param format adds the phys cpuid
1104 boot_cpuid_phys = initial_boot_params->boot_cpuid_phys;
1107 /* Check if it's the boot-cpu, set it's hw index in paca now */
1108 if (get_flat_dt_prop(node, "linux,boot-cpu", NULL) != NULL) {
1109 prop = get_flat_dt_prop(node, "reg", NULL);
1110 set_hard_smp_processor_id(0, prop == NULL ? 0 : *prop);
1111 boot_cpuid_phys = get_hard_smp_processor_id(0);
1116 #ifdef CONFIG_ALTIVEC
1117 /* Check if we have a VMX and eventually update CPU features */
1118 prop = (u32 *)get_flat_dt_prop(node, "ibm,vmx", &size);
1119 if (prop && (*prop) > 0) {
1120 cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC;
1121 cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC;
1124 /* Same goes for Apple's "altivec" property */
1125 prop = (u32 *)get_flat_dt_prop(node, "altivec", NULL);
1127 cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC;
1128 cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC;
1130 #endif /* CONFIG_ALTIVEC */
1132 #ifdef CONFIG_PPC_PSERIES
1134 * Check for an SMT capable CPU and set the CPU feature. We do
1135 * this by looking at the size of the ibm,ppc-interrupt-server#s
1138 prop = (u32 *)get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s",
1140 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
1141 if (prop && ((size / sizeof(u32)) > 1))
1142 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
1148 static int __init early_init_dt_scan_chosen(unsigned long node,
1149 const char *uname, int depth, void *data)
1152 unsigned long *lprop;
1154 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
1157 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
1160 /* get platform type */
1161 prop = (u32 *)get_flat_dt_prop(node, "linux,platform", NULL);
1165 systemcfg->platform = *prop;
1167 #ifdef CONFIG_PPC_MULTIPLATFORM
1173 /* check if iommu is forced on or off */
1174 if (get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
1176 if (get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
1180 lprop = get_flat_dt_prop(node, "linux,memory-limit", NULL);
1182 memory_limit = *lprop;
1185 lprop = get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
1187 tce_alloc_start = *lprop;
1188 lprop = get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
1190 tce_alloc_end = *lprop;
1193 #ifdef CONFIG_PPC_RTAS
1194 /* To help early debugging via the front panel, we retreive a minimal
1195 * set of RTAS infos now if available
1198 u64 *basep, *entryp;
1200 basep = get_flat_dt_prop(node, "linux,rtas-base", NULL);
1201 entryp = get_flat_dt_prop(node, "linux,rtas-entry", NULL);
1202 prop = get_flat_dt_prop(node, "linux,rtas-size", NULL);
1203 if (basep && entryp && prop) {
1205 rtas.entry = *entryp;
1209 #endif /* CONFIG_PPC_RTAS */
1215 static int __init early_init_dt_scan_root(unsigned long node,
1216 const char *uname, int depth, void *data)
1223 prop = get_flat_dt_prop(node, "#size-cells", NULL);
1224 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
1225 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
1227 prop = get_flat_dt_prop(node, "#address-cells", NULL);
1228 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
1229 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
1235 static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
1240 /* Ignore more than 2 cells */
1241 while (s > sizeof(unsigned long) / 4) {
1259 static int __init early_init_dt_scan_memory(unsigned long node,
1260 const char *uname, int depth, void *data)
1262 char *type = get_flat_dt_prop(node, "device_type", NULL);
1266 /* We are scanning "memory" nodes only */
1267 if (type == NULL || strcmp(type, "memory") != 0)
1270 reg = (cell_t *)get_flat_dt_prop(node, "reg", &l);
1274 endp = reg + (l / sizeof(cell_t));
1276 DBG("memory scan node %s ..., reg size %ld, data: %x %x %x %x, ...\n",
1277 uname, l, reg[0], reg[1], reg[2], reg[3]);
1279 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
1280 unsigned long base, size;
1282 base = dt_mem_next_cell(dt_root_addr_cells, ®);
1283 size = dt_mem_next_cell(dt_root_size_cells, ®);
1287 DBG(" - %lx , %lx\n", base, size);
1290 if (base >= 0x80000000ul)
1292 if ((base + size) > 0x80000000ul)
1293 size = 0x80000000ul - base;
1296 lmb_add(base, size);
1301 static void __init early_reserve_mem(void)
1303 unsigned long base, size;
1304 unsigned long *reserve_map;
1306 reserve_map = (unsigned long *)(((unsigned long)initial_boot_params) +
1307 initial_boot_params->off_mem_rsvmap);
1309 base = *(reserve_map++);
1310 size = *(reserve_map++);
1313 DBG("reserving: %lx -> %lx\n", base, size);
1314 lmb_reserve(base, size);
1318 DBG("memory reserved, lmbs :\n");
1323 void __init early_init_devtree(void *params)
1325 DBG(" -> early_init_devtree()\n");
1327 /* Setup flat device-tree pointer */
1328 initial_boot_params = params;
1330 /* Retrieve various informations from the /chosen node of the
1331 * device-tree, including the platform type, initrd location and
1332 * size, TCE reserve, and more ...
1334 scan_flat_dt(early_init_dt_scan_chosen, NULL);
1336 /* Scan memory nodes and rebuild LMBs */
1338 scan_flat_dt(early_init_dt_scan_root, NULL);
1339 scan_flat_dt(early_init_dt_scan_memory, NULL);
1340 lmb_enforce_memory_limit(memory_limit);
1343 systemcfg->physicalMemorySize = lmb_phys_mem_size();
1345 lmb_reserve(0, __pa(klimit));
1347 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1349 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
1350 early_reserve_mem();
1352 DBG("Scanning CPUs ...\n");
1354 /* Retreive hash table size from flattened tree plus other
1355 * CPU related informations (altivec support, boot CPU ID, ...)
1357 scan_flat_dt(early_init_dt_scan_cpus, NULL);
1359 DBG(" <- early_init_devtree()\n");
1365 prom_n_addr_cells(struct device_node* np)
1371 ip = (int *) get_property(np, "#address-cells", NULL);
1374 } while (np->parent);
1375 /* No #address-cells property for the root node, default to 1 */
1380 prom_n_size_cells(struct device_node* np)
1386 ip = (int *) get_property(np, "#size-cells", NULL);
1389 } while (np->parent);
1390 /* No #size-cells property for the root node, default to 1 */
1395 * Work out the sense (active-low level / active-high edge)
1396 * of each interrupt from the device tree.
1398 void __init prom_get_irq_senses(unsigned char *senses, int off, int max)
1400 struct device_node *np;
1403 /* default to level-triggered */
1404 memset(senses, 1, max - off);
1406 for (np = allnodes; np != 0; np = np->allnext) {
1407 for (j = 0; j < np->n_intrs; j++) {
1408 i = np->intrs[j].line;
1409 if (i >= off && i < max)
1410 senses[i-off] = np->intrs[j].sense ?
1411 IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE :
1412 IRQ_SENSE_EDGE | IRQ_POLARITY_POSITIVE;
1418 * Construct and return a list of the device_nodes with a given name.
1420 struct device_node *find_devices(const char *name)
1422 struct device_node *head, **prevp, *np;
1425 for (np = allnodes; np != 0; np = np->allnext) {
1426 if (np->name != 0 && strcasecmp(np->name, name) == 0) {
1434 EXPORT_SYMBOL(find_devices);
1437 * Construct and return a list of the device_nodes with a given type.
1439 struct device_node *find_type_devices(const char *type)
1441 struct device_node *head, **prevp, *np;
1444 for (np = allnodes; np != 0; np = np->allnext) {
1445 if (np->type != 0 && strcasecmp(np->type, type) == 0) {
1453 EXPORT_SYMBOL(find_type_devices);
1456 * Returns all nodes linked together
1458 struct device_node *find_all_nodes(void)
1460 struct device_node *head, **prevp, *np;
1463 for (np = allnodes; np != 0; np = np->allnext) {
1470 EXPORT_SYMBOL(find_all_nodes);
1472 /** Checks if the given "compat" string matches one of the strings in
1473 * the device's "compatible" property
1475 int device_is_compatible(struct device_node *device, const char *compat)
1480 cp = (char *) get_property(device, "compatible", &cplen);
1484 if (strncasecmp(cp, compat, strlen(compat)) == 0)
1493 EXPORT_SYMBOL(device_is_compatible);
1497 * Indicates whether the root node has a given value in its
1498 * compatible property.
1500 int machine_is_compatible(const char *compat)
1502 struct device_node *root;
1505 root = of_find_node_by_path("/");
1507 rc = device_is_compatible(root, compat);
1512 EXPORT_SYMBOL(machine_is_compatible);
1515 * Construct and return a list of the device_nodes with a given type
1516 * and compatible property.
1518 struct device_node *find_compatible_devices(const char *type,
1521 struct device_node *head, **prevp, *np;
1524 for (np = allnodes; np != 0; np = np->allnext) {
1526 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1528 if (device_is_compatible(np, compat)) {
1536 EXPORT_SYMBOL(find_compatible_devices);
1539 * Find the device_node with a given full_name.
1541 struct device_node *find_path_device(const char *path)
1543 struct device_node *np;
1545 for (np = allnodes; np != 0; np = np->allnext)
1546 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0)
1550 EXPORT_SYMBOL(find_path_device);
1554 * New implementation of the OF "find" APIs, return a refcounted
1555 * object, call of_node_put() when done. The device tree and list
1556 * are protected by a rw_lock.
1558 * Note that property management will need some locking as well,
1559 * this isn't dealt with yet.
1564 * of_find_node_by_name - Find a node by its "name" property
1565 * @from: The node to start searching from or NULL, the node
1566 * you pass will not be searched, only the next one
1567 * will; typically, you pass what the previous call
1568 * returned. of_node_put() will be called on it
1569 * @name: The name string to match against
1571 * Returns a node pointer with refcount incremented, use
1572 * of_node_put() on it when done.
1574 struct device_node *of_find_node_by_name(struct device_node *from,
1577 struct device_node *np;
1579 read_lock(&devtree_lock);
1580 np = from ? from->allnext : allnodes;
1581 for (; np != 0; np = np->allnext)
1582 if (np->name != 0 && strcasecmp(np->name, name) == 0
1587 read_unlock(&devtree_lock);
1590 EXPORT_SYMBOL(of_find_node_by_name);
1593 * of_find_node_by_type - Find a node by its "device_type" property
1594 * @from: The node to start searching from or NULL, the node
1595 * you pass will not be searched, only the next one
1596 * will; typically, you pass what the previous call
1597 * returned. of_node_put() will be called on it
1598 * @name: The type string to match against
1600 * Returns a node pointer with refcount incremented, use
1601 * of_node_put() on it when done.
1603 struct device_node *of_find_node_by_type(struct device_node *from,
1606 struct device_node *np;
1608 read_lock(&devtree_lock);
1609 np = from ? from->allnext : allnodes;
1610 for (; np != 0; np = np->allnext)
1611 if (np->type != 0 && strcasecmp(np->type, type) == 0
1616 read_unlock(&devtree_lock);
1619 EXPORT_SYMBOL(of_find_node_by_type);
1622 * of_find_compatible_node - Find a node based on type and one of the
1623 * tokens in its "compatible" property
1624 * @from: The node to start searching from or NULL, the node
1625 * you pass will not be searched, only the next one
1626 * will; typically, you pass what the previous call
1627 * returned. of_node_put() will be called on it
1628 * @type: The type string to match "device_type" or NULL to ignore
1629 * @compatible: The string to match to one of the tokens in the device
1630 * "compatible" list.
1632 * Returns a node pointer with refcount incremented, use
1633 * of_node_put() on it when done.
1635 struct device_node *of_find_compatible_node(struct device_node *from,
1636 const char *type, const char *compatible)
1638 struct device_node *np;
1640 read_lock(&devtree_lock);
1641 np = from ? from->allnext : allnodes;
1642 for (; np != 0; np = np->allnext) {
1644 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1646 if (device_is_compatible(np, compatible) && of_node_get(np))
1651 read_unlock(&devtree_lock);
1654 EXPORT_SYMBOL(of_find_compatible_node);
1657 * of_find_node_by_path - Find a node matching a full OF path
1658 * @path: The full path to match
1660 * Returns a node pointer with refcount incremented, use
1661 * of_node_put() on it when done.
1663 struct device_node *of_find_node_by_path(const char *path)
1665 struct device_node *np = allnodes;
1667 read_lock(&devtree_lock);
1668 for (; np != 0; np = np->allnext) {
1669 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1673 read_unlock(&devtree_lock);
1676 EXPORT_SYMBOL(of_find_node_by_path);
1679 * of_find_node_by_phandle - Find a node given a phandle
1680 * @handle: phandle of the node to find
1682 * Returns a node pointer with refcount incremented, use
1683 * of_node_put() on it when done.
1685 struct device_node *of_find_node_by_phandle(phandle handle)
1687 struct device_node *np;
1689 read_lock(&devtree_lock);
1690 for (np = allnodes; np != 0; np = np->allnext)
1691 if (np->linux_phandle == handle)
1695 read_unlock(&devtree_lock);
1698 EXPORT_SYMBOL(of_find_node_by_phandle);
1701 * of_find_all_nodes - Get next node in global list
1702 * @prev: Previous node or NULL to start iteration
1703 * of_node_put() will be called on it
1705 * Returns a node pointer with refcount incremented, use
1706 * of_node_put() on it when done.
1708 struct device_node *of_find_all_nodes(struct device_node *prev)
1710 struct device_node *np;
1712 read_lock(&devtree_lock);
1713 np = prev ? prev->allnext : allnodes;
1714 for (; np != 0; np = np->allnext)
1715 if (of_node_get(np))
1719 read_unlock(&devtree_lock);
1722 EXPORT_SYMBOL(of_find_all_nodes);
1725 * of_get_parent - Get a node's parent if any
1726 * @node: Node to get parent
1728 * Returns a node pointer with refcount incremented, use
1729 * of_node_put() on it when done.
1731 struct device_node *of_get_parent(const struct device_node *node)
1733 struct device_node *np;
1738 read_lock(&devtree_lock);
1739 np = of_node_get(node->parent);
1740 read_unlock(&devtree_lock);
1743 EXPORT_SYMBOL(of_get_parent);
1746 * of_get_next_child - Iterate a node childs
1747 * @node: parent node
1748 * @prev: previous child of the parent node, or NULL to get first
1750 * Returns a node pointer with refcount incremented, use
1751 * of_node_put() on it when done.
1753 struct device_node *of_get_next_child(const struct device_node *node,
1754 struct device_node *prev)
1756 struct device_node *next;
1758 read_lock(&devtree_lock);
1759 next = prev ? prev->sibling : node->child;
1760 for (; next != 0; next = next->sibling)
1761 if (of_node_get(next))
1765 read_unlock(&devtree_lock);
1768 EXPORT_SYMBOL(of_get_next_child);
1771 * of_node_get - Increment refcount of a node
1772 * @node: Node to inc refcount, NULL is supported to
1773 * simplify writing of callers
1777 struct device_node *of_node_get(struct device_node *node)
1780 kref_get(&node->kref);
1783 EXPORT_SYMBOL(of_node_get);
1785 static inline struct device_node * kref_to_device_node(struct kref *kref)
1787 return container_of(kref, struct device_node, kref);
1791 * of_node_release - release a dynamically allocated node
1792 * @kref: kref element of the node to be released
1794 * In of_node_put() this function is passed to kref_put()
1795 * as the destructor.
1797 static void of_node_release(struct kref *kref)
1799 struct device_node *node = kref_to_device_node(kref);
1800 struct property *prop = node->properties;
1802 if (!OF_IS_DYNAMIC(node))
1805 struct property *next = prop->next;
1813 kfree(node->full_name);
1819 * of_node_put - Decrement refcount of a node
1820 * @node: Node to dec refcount, NULL is supported to
1821 * simplify writing of callers
1824 void of_node_put(struct device_node *node)
1827 kref_put(&node->kref, of_node_release);
1829 EXPORT_SYMBOL(of_node_put);
1832 * Plug a device node into the tree and global list.
1834 void of_attach_node(struct device_node *np)
1836 write_lock(&devtree_lock);
1837 np->sibling = np->parent->child;
1838 np->allnext = allnodes;
1839 np->parent->child = np;
1841 write_unlock(&devtree_lock);
1845 * "Unplug" a node from the device tree. The caller must hold
1846 * a reference to the node. The memory associated with the node
1847 * is not freed until its refcount goes to zero.
1849 void of_detach_node(const struct device_node *np)
1851 struct device_node *parent;
1853 write_lock(&devtree_lock);
1855 parent = np->parent;
1858 allnodes = np->allnext;
1860 struct device_node *prev;
1861 for (prev = allnodes;
1862 prev->allnext != np;
1863 prev = prev->allnext)
1865 prev->allnext = np->allnext;
1868 if (parent->child == np)
1869 parent->child = np->sibling;
1871 struct device_node *prevsib;
1872 for (prevsib = np->parent->child;
1873 prevsib->sibling != np;
1874 prevsib = prevsib->sibling)
1876 prevsib->sibling = np->sibling;
1879 write_unlock(&devtree_lock);
1882 #ifdef CONFIG_PPC_PSERIES
1884 * Fix up the uninitialized fields in a new device node:
1885 * name, type, n_addrs, addrs, n_intrs, intrs, and pci-specific fields
1887 * A lot of boot-time code is duplicated here, because functions such
1888 * as finish_node_interrupts, interpret_pci_props, etc. cannot use the
1891 * This should probably be split up into smaller chunks.
1894 static int of_finish_dynamic_node(struct device_node *node,
1895 unsigned long *unused1, int unused2,
1896 int unused3, int unused4)
1898 struct device_node *parent = of_get_parent(node);
1900 phandle *ibm_phandle;
1902 node->name = get_property(node, "name", NULL);
1903 node->type = get_property(node, "device_type", NULL);
1910 /* We don't support that function on PowerMac, at least
1913 if (systemcfg->platform == PLATFORM_POWERMAC)
1916 /* fix up new node's linux_phandle field */
1917 if ((ibm_phandle = (unsigned int *)get_property(node, "ibm,phandle", NULL)))
1918 node->linux_phandle = *ibm_phandle;
1921 of_node_put(parent);
1925 static int prom_reconfig_notifier(struct notifier_block *nb,
1926 unsigned long action, void *node)
1931 case PSERIES_RECONFIG_ADD:
1932 err = finish_node(node, NULL, of_finish_dynamic_node, 0, 0, 0);
1934 printk(KERN_ERR "finish_node returned %d\n", err);
1945 static struct notifier_block prom_reconfig_nb = {
1946 .notifier_call = prom_reconfig_notifier,
1947 .priority = 10, /* This one needs to run first */
1950 static int __init prom_reconfig_setup(void)
1952 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1954 __initcall(prom_reconfig_setup);
1958 * Find a property with a given name for a given node
1959 * and return the value.
1961 unsigned char *get_property(struct device_node *np, const char *name,
1964 struct property *pp;
1966 for (pp = np->properties; pp != 0; pp = pp->next)
1967 if (strcmp(pp->name, name) == 0) {
1974 EXPORT_SYMBOL(get_property);
1977 * Add a property to a node
1979 void prom_add_property(struct device_node* np, struct property* prop)
1981 struct property **next = &np->properties;
1985 next = &(*next)->next;
1989 /* I quickly hacked that one, check against spec ! */
1990 static inline unsigned long
1991 bus_space_to_resource_flags(unsigned int bus_space)
1993 u8 space = (bus_space >> 24) & 0xf;
1997 return IORESOURCE_MEM;
1998 else if (space == 0x01)
1999 return IORESOURCE_IO;
2001 printk(KERN_WARNING "prom.c: bus_space_to_resource_flags(), space: %x\n",
2008 static struct resource *find_parent_pci_resource(struct pci_dev* pdev,
2009 struct address_range *range)
2014 /* Check this one */
2015 mask = bus_space_to_resource_flags(range->space);
2016 for (i=0; i<DEVICE_COUNT_RESOURCE; i++) {
2017 if ((pdev->resource[i].flags & mask) == mask &&
2018 pdev->resource[i].start <= range->address &&
2019 pdev->resource[i].end > range->address) {
2020 if ((range->address + range->size - 1) > pdev->resource[i].end) {
2021 /* Add better message */
2022 printk(KERN_WARNING "PCI/OF resource overlap !\n");
2028 if (i == DEVICE_COUNT_RESOURCE)
2030 return &pdev->resource[i];
2034 * Request an OF device resource. Currently handles child of PCI devices,
2035 * or other nodes attached to the root node. Ultimately, put some
2036 * link to resources in the OF node.
2038 struct resource *request_OF_resource(struct device_node* node, int index,
2039 const char* name_postfix)
2041 struct pci_dev* pcidev;
2042 u8 pci_bus, pci_devfn;
2043 unsigned long iomask;
2044 struct device_node* nd;
2045 struct resource* parent;
2046 struct resource *res = NULL;
2049 if (index >= node->n_addrs)
2052 /* Sanity check on bus space */
2053 iomask = bus_space_to_resource_flags(node->addrs[index].space);
2054 if (iomask & IORESOURCE_MEM)
2055 parent = &iomem_resource;
2056 else if (iomask & IORESOURCE_IO)
2057 parent = &ioport_resource;
2061 /* Find a PCI parent if any */
2065 if (!pci_device_from_OF_node(nd, &pci_bus, &pci_devfn))
2066 pcidev = pci_find_slot(pci_bus, pci_devfn);
2071 parent = find_parent_pci_resource(pcidev, &node->addrs[index]);
2073 printk(KERN_WARNING "request_OF_resource(%s), parent not found\n",
2078 res = __request_region(parent, node->addrs[index].address,
2079 node->addrs[index].size, NULL);
2082 nlen = strlen(node->name);
2083 plen = name_postfix ? strlen(name_postfix) : 0;
2084 res->name = (const char *)kmalloc(nlen+plen+1, GFP_KERNEL);
2086 strcpy((char *)res->name, node->name);
2088 strcpy((char *)res->name+nlen, name_postfix);
2094 EXPORT_SYMBOL(request_OF_resource);
2096 int release_OF_resource(struct device_node *node, int index)
2098 struct pci_dev* pcidev;
2099 u8 pci_bus, pci_devfn;
2100 unsigned long iomask, start, end;
2101 struct device_node* nd;
2102 struct resource* parent;
2103 struct resource *res = NULL;
2105 if (index >= node->n_addrs)
2108 /* Sanity check on bus space */
2109 iomask = bus_space_to_resource_flags(node->addrs[index].space);
2110 if (iomask & IORESOURCE_MEM)
2111 parent = &iomem_resource;
2112 else if (iomask & IORESOURCE_IO)
2113 parent = &ioport_resource;
2117 /* Find a PCI parent if any */
2121 if (!pci_device_from_OF_node(nd, &pci_bus, &pci_devfn))
2122 pcidev = pci_find_slot(pci_bus, pci_devfn);
2127 parent = find_parent_pci_resource(pcidev, &node->addrs[index]);
2129 printk(KERN_WARNING "release_OF_resource(%s), parent not found\n",
2134 /* Find us in the parent and its childs */
2135 res = parent->child;
2136 start = node->addrs[index].address;
2137 end = start + node->addrs[index].size - 1;
2139 if (res->start == start && res->end == end &&
2140 (res->flags & IORESOURCE_BUSY))
2142 if (res->start <= start && res->end >= end)
2154 release_resource(res);
2159 EXPORT_SYMBOL(release_OF_resource);
2160 #endif /* CONFIG_PCI */