Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1 | /* |
| 2 | * Procedures for creating, accessing and interpreting the device tree. |
| 3 | * |
| 4 | * Paul Mackerras August 1996. |
| 5 | * Copyright (C) 1996-2005 Paul Mackerras. |
| 6 | * |
| 7 | * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. |
| 8 | * {engebret|bergner}@us.ibm.com |
| 9 | * |
| 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. |
| 14 | */ |
| 15 | |
| 16 | #undef DEBUG |
| 17 | |
| 18 | #include <stdarg.h> |
| 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> |
Michael Ellerman | dcee303 | 2005-12-04 18:39:48 +1100 | [diff] [blame] | 32 | #include <linux/kexec.h> |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 33 | |
| 34 | #include <asm/prom.h> |
| 35 | #include <asm/rtas.h> |
| 36 | #include <asm/lmb.h> |
| 37 | #include <asm/page.h> |
| 38 | #include <asm/processor.h> |
| 39 | #include <asm/irq.h> |
| 40 | #include <asm/io.h> |
Michael Ellerman | 0cc4746 | 2005-12-04 18:39:37 +1100 | [diff] [blame] | 41 | #include <asm/kdump.h> |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 42 | #include <asm/smp.h> |
| 43 | #include <asm/system.h> |
| 44 | #include <asm/mmu.h> |
| 45 | #include <asm/pgtable.h> |
| 46 | #include <asm/pci.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> |
Paul Mackerras | 40ef8cb | 2005-10-10 22:50:37 +1000 | [diff] [blame] | 52 | #include <asm/pci-bridge.h> |
Michael Ellerman | 2babf5c | 2006-05-17 18:00:46 +1000 | [diff] [blame] | 53 | #include <asm/kexec.h> |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 54 | |
| 55 | #ifdef DEBUG |
| 56 | #define DBG(fmt...) printk(KERN_ERR fmt) |
| 57 | #else |
| 58 | #define DBG(fmt...) |
| 59 | #endif |
| 60 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 61 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 62 | static int __initdata dt_root_addr_cells; |
| 63 | static int __initdata dt_root_size_cells; |
| 64 | |
| 65 | #ifdef CONFIG_PPC64 |
Olof Johansson | 2889773 | 2006-04-12 21:52:33 -0500 | [diff] [blame] | 66 | int __initdata iommu_is_off; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 67 | int __initdata iommu_force_on; |
Paul Mackerras | cf00a8d | 2005-10-31 13:07:02 +1100 | [diff] [blame] | 68 | unsigned long tce_alloc_start, tce_alloc_end; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 69 | #endif |
| 70 | |
| 71 | typedef u32 cell_t; |
| 72 | |
| 73 | #if 0 |
| 74 | static struct boot_param_header *initial_boot_params __initdata; |
| 75 | #else |
| 76 | struct boot_param_header *initial_boot_params; |
| 77 | #endif |
| 78 | |
| 79 | static struct device_node *allnodes = NULL; |
| 80 | |
| 81 | /* use when traversing tree through the allnext, child, sibling, |
| 82 | * or parent members of struct device_node. |
| 83 | */ |
| 84 | static DEFINE_RWLOCK(devtree_lock); |
| 85 | |
| 86 | /* export that to outside world */ |
| 87 | struct device_node *of_chosen; |
| 88 | |
| 89 | struct device_node *dflt_interrupt_controller; |
| 90 | int num_interrupt_controllers; |
| 91 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 92 | /* |
| 93 | * Wrapper for allocating memory for various data that needs to be |
| 94 | * attached to device nodes as they are processed at boot or when |
| 95 | * added to the device tree later (e.g. DLPAR). At boot there is |
| 96 | * already a region reserved so we just increment *mem_start by size; |
| 97 | * otherwise we call kmalloc. |
| 98 | */ |
| 99 | static void * prom_alloc(unsigned long size, unsigned long *mem_start) |
| 100 | { |
| 101 | unsigned long tmp; |
| 102 | |
| 103 | if (!mem_start) |
| 104 | return kmalloc(size, GFP_KERNEL); |
| 105 | |
| 106 | tmp = *mem_start; |
| 107 | *mem_start += size; |
| 108 | return (void *)tmp; |
| 109 | } |
| 110 | |
| 111 | /* |
| 112 | * Find the device_node with a given phandle. |
| 113 | */ |
| 114 | static struct device_node * find_phandle(phandle ph) |
| 115 | { |
| 116 | struct device_node *np; |
| 117 | |
| 118 | for (np = allnodes; np != 0; np = np->allnext) |
| 119 | if (np->linux_phandle == ph) |
| 120 | return np; |
| 121 | return NULL; |
| 122 | } |
| 123 | |
| 124 | /* |
| 125 | * Find the interrupt parent of a node. |
| 126 | */ |
| 127 | static struct device_node * __devinit intr_parent(struct device_node *p) |
| 128 | { |
| 129 | phandle *parp; |
| 130 | |
| 131 | parp = (phandle *) get_property(p, "interrupt-parent", NULL); |
| 132 | if (parp == NULL) |
| 133 | return p->parent; |
| 134 | p = find_phandle(*parp); |
| 135 | if (p != NULL) |
| 136 | return p; |
| 137 | /* |
| 138 | * On a powermac booted with BootX, we don't get to know the |
| 139 | * phandles for any nodes, so find_phandle will return NULL. |
| 140 | * Fortunately these machines only have one interrupt controller |
| 141 | * so there isn't in fact any ambiguity. -- paulus |
| 142 | */ |
| 143 | if (num_interrupt_controllers == 1) |
| 144 | p = dflt_interrupt_controller; |
| 145 | return p; |
| 146 | } |
| 147 | |
| 148 | /* |
| 149 | * Find out the size of each entry of the interrupts property |
| 150 | * for a node. |
| 151 | */ |
| 152 | int __devinit prom_n_intr_cells(struct device_node *np) |
| 153 | { |
| 154 | struct device_node *p; |
| 155 | unsigned int *icp; |
| 156 | |
| 157 | for (p = np; (p = intr_parent(p)) != NULL; ) { |
| 158 | icp = (unsigned int *) |
| 159 | get_property(p, "#interrupt-cells", NULL); |
| 160 | if (icp != NULL) |
| 161 | return *icp; |
| 162 | if (get_property(p, "interrupt-controller", NULL) != NULL |
| 163 | || get_property(p, "interrupt-map", NULL) != NULL) { |
| 164 | printk("oops, node %s doesn't have #interrupt-cells\n", |
| 165 | p->full_name); |
| 166 | return 1; |
| 167 | } |
| 168 | } |
| 169 | #ifdef DEBUG_IRQ |
| 170 | printk("prom_n_intr_cells failed for %s\n", np->full_name); |
| 171 | #endif |
| 172 | return 1; |
| 173 | } |
| 174 | |
| 175 | /* |
| 176 | * Map an interrupt from a device up to the platform interrupt |
| 177 | * descriptor. |
| 178 | */ |
| 179 | static int __devinit map_interrupt(unsigned int **irq, struct device_node **ictrler, |
| 180 | struct device_node *np, unsigned int *ints, |
| 181 | int nintrc) |
| 182 | { |
| 183 | struct device_node *p, *ipar; |
| 184 | unsigned int *imap, *imask, *ip; |
| 185 | int i, imaplen, match; |
| 186 | int newintrc = 0, newaddrc = 0; |
| 187 | unsigned int *reg; |
| 188 | int naddrc; |
| 189 | |
| 190 | reg = (unsigned int *) get_property(np, "reg", NULL); |
| 191 | naddrc = prom_n_addr_cells(np); |
| 192 | p = intr_parent(np); |
| 193 | while (p != NULL) { |
| 194 | if (get_property(p, "interrupt-controller", NULL) != NULL) |
| 195 | /* this node is an interrupt controller, stop here */ |
| 196 | break; |
| 197 | imap = (unsigned int *) |
| 198 | get_property(p, "interrupt-map", &imaplen); |
| 199 | if (imap == NULL) { |
| 200 | p = intr_parent(p); |
| 201 | continue; |
| 202 | } |
| 203 | imask = (unsigned int *) |
| 204 | get_property(p, "interrupt-map-mask", NULL); |
| 205 | if (imask == NULL) { |
| 206 | printk("oops, %s has interrupt-map but no mask\n", |
| 207 | p->full_name); |
| 208 | return 0; |
| 209 | } |
| 210 | imaplen /= sizeof(unsigned int); |
| 211 | match = 0; |
| 212 | ipar = NULL; |
| 213 | while (imaplen > 0 && !match) { |
| 214 | /* check the child-interrupt field */ |
| 215 | match = 1; |
| 216 | for (i = 0; i < naddrc && match; ++i) |
| 217 | match = ((reg[i] ^ imap[i]) & imask[i]) == 0; |
| 218 | for (; i < naddrc + nintrc && match; ++i) |
| 219 | match = ((ints[i-naddrc] ^ imap[i]) & imask[i]) == 0; |
| 220 | imap += naddrc + nintrc; |
| 221 | imaplen -= naddrc + nintrc; |
| 222 | /* grab the interrupt parent */ |
| 223 | ipar = find_phandle((phandle) *imap++); |
| 224 | --imaplen; |
| 225 | if (ipar == NULL && num_interrupt_controllers == 1) |
| 226 | /* cope with BootX not giving us phandles */ |
| 227 | ipar = dflt_interrupt_controller; |
| 228 | if (ipar == NULL) { |
| 229 | printk("oops, no int parent %x in map of %s\n", |
| 230 | imap[-1], p->full_name); |
| 231 | return 0; |
| 232 | } |
| 233 | /* find the parent's # addr and intr cells */ |
| 234 | ip = (unsigned int *) |
| 235 | get_property(ipar, "#interrupt-cells", NULL); |
| 236 | if (ip == NULL) { |
| 237 | printk("oops, no #interrupt-cells on %s\n", |
| 238 | ipar->full_name); |
| 239 | return 0; |
| 240 | } |
| 241 | newintrc = *ip; |
| 242 | ip = (unsigned int *) |
| 243 | get_property(ipar, "#address-cells", NULL); |
| 244 | newaddrc = (ip == NULL)? 0: *ip; |
| 245 | imap += newaddrc + newintrc; |
| 246 | imaplen -= newaddrc + newintrc; |
| 247 | } |
| 248 | if (imaplen < 0) { |
| 249 | printk("oops, error decoding int-map on %s, len=%d\n", |
| 250 | p->full_name, imaplen); |
| 251 | return 0; |
| 252 | } |
| 253 | if (!match) { |
| 254 | #ifdef DEBUG_IRQ |
| 255 | printk("oops, no match in %s int-map for %s\n", |
| 256 | p->full_name, np->full_name); |
| 257 | #endif |
| 258 | return 0; |
| 259 | } |
| 260 | p = ipar; |
| 261 | naddrc = newaddrc; |
| 262 | nintrc = newintrc; |
| 263 | ints = imap - nintrc; |
| 264 | reg = ints - naddrc; |
| 265 | } |
| 266 | if (p == NULL) { |
| 267 | #ifdef DEBUG_IRQ |
| 268 | printk("hmmm, int tree for %s doesn't have ctrler\n", |
| 269 | np->full_name); |
| 270 | #endif |
| 271 | return 0; |
| 272 | } |
| 273 | *irq = ints; |
| 274 | *ictrler = p; |
| 275 | return nintrc; |
| 276 | } |
| 277 | |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 278 | static unsigned char map_isa_senses[4] = { |
| 279 | IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE, |
| 280 | IRQ_SENSE_LEVEL | IRQ_POLARITY_POSITIVE, |
| 281 | IRQ_SENSE_EDGE | IRQ_POLARITY_NEGATIVE, |
| 282 | IRQ_SENSE_EDGE | IRQ_POLARITY_POSITIVE |
| 283 | }; |
| 284 | |
| 285 | static unsigned char map_mpic_senses[4] = { |
| 286 | IRQ_SENSE_EDGE | IRQ_POLARITY_POSITIVE, |
| 287 | IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE, |
| 288 | /* 2 seems to be used for the 8259 cascade... */ |
| 289 | IRQ_SENSE_LEVEL | IRQ_POLARITY_POSITIVE, |
| 290 | IRQ_SENSE_EDGE | IRQ_POLARITY_NEGATIVE, |
| 291 | }; |
| 292 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 293 | static int __devinit finish_node_interrupts(struct device_node *np, |
| 294 | unsigned long *mem_start, |
| 295 | int measure_only) |
| 296 | { |
| 297 | unsigned int *ints; |
| 298 | int intlen, intrcells, intrcount; |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 299 | int i, j, n, sense; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 300 | unsigned int *irq, virq; |
| 301 | struct device_node *ic; |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 302 | int trace = 0; |
| 303 | |
| 304 | //#define TRACE(fmt...) do { if (trace) { printk(fmt); mdelay(1000); } } while(0) |
| 305 | #define TRACE(fmt...) |
| 306 | |
| 307 | if (!strcmp(np->name, "smu-doorbell")) |
| 308 | trace = 1; |
| 309 | |
| 310 | TRACE("Finishing SMU doorbell ! num_interrupt_controllers = %d\n", |
| 311 | num_interrupt_controllers); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 312 | |
Paul Mackerras | a575b80 | 2005-10-23 17:23:21 +1000 | [diff] [blame] | 313 | if (num_interrupt_controllers == 0) { |
| 314 | /* |
| 315 | * Old machines just have a list of interrupt numbers |
| 316 | * and no interrupt-controller nodes. |
| 317 | */ |
| 318 | ints = (unsigned int *) get_property(np, "AAPL,interrupts", |
| 319 | &intlen); |
| 320 | /* XXX old interpret_pci_props looked in parent too */ |
| 321 | /* XXX old interpret_macio_props looked for interrupts |
| 322 | before AAPL,interrupts */ |
| 323 | if (ints == NULL) |
| 324 | ints = (unsigned int *) get_property(np, "interrupts", |
| 325 | &intlen); |
| 326 | if (ints == NULL) |
| 327 | return 0; |
| 328 | |
| 329 | np->n_intrs = intlen / sizeof(unsigned int); |
| 330 | np->intrs = prom_alloc(np->n_intrs * sizeof(np->intrs[0]), |
| 331 | mem_start); |
| 332 | if (!np->intrs) |
| 333 | return -ENOMEM; |
| 334 | if (measure_only) |
| 335 | return 0; |
| 336 | |
| 337 | for (i = 0; i < np->n_intrs; ++i) { |
| 338 | np->intrs[i].line = *ints++; |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 339 | np->intrs[i].sense = IRQ_SENSE_LEVEL |
| 340 | | IRQ_POLARITY_NEGATIVE; |
Paul Mackerras | a575b80 | 2005-10-23 17:23:21 +1000 | [diff] [blame] | 341 | } |
| 342 | return 0; |
| 343 | } |
| 344 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 345 | ints = (unsigned int *) get_property(np, "interrupts", &intlen); |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 346 | TRACE("ints=%p, intlen=%d\n", ints, intlen); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 347 | if (ints == NULL) |
| 348 | return 0; |
| 349 | intrcells = prom_n_intr_cells(np); |
| 350 | intlen /= intrcells * sizeof(unsigned int); |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 351 | TRACE("intrcells=%d, new intlen=%d\n", intrcells, intlen); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 352 | np->intrs = prom_alloc(intlen * sizeof(*(np->intrs)), mem_start); |
| 353 | if (!np->intrs) |
| 354 | return -ENOMEM; |
| 355 | |
| 356 | if (measure_only) |
| 357 | return 0; |
| 358 | |
| 359 | intrcount = 0; |
| 360 | for (i = 0; i < intlen; ++i, ints += intrcells) { |
| 361 | n = map_interrupt(&irq, &ic, np, ints, intrcells); |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 362 | TRACE("map, irq=%d, ic=%p, n=%d\n", irq, ic, n); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 363 | if (n <= 0) |
| 364 | continue; |
| 365 | |
| 366 | /* don't map IRQ numbers under a cascaded 8259 controller */ |
| 367 | if (ic && device_is_compatible(ic, "chrp,iic")) { |
| 368 | np->intrs[intrcount].line = irq[0]; |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 369 | sense = (n > 1)? (irq[1] & 3): 3; |
| 370 | np->intrs[intrcount].sense = map_isa_senses[sense]; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 371 | } else { |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 372 | virq = virt_irq_create_mapping(irq[0]); |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 373 | TRACE("virq=%d\n", virq); |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 374 | #ifdef CONFIG_PPC64 |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 375 | if (virq == NO_IRQ) { |
| 376 | printk(KERN_CRIT "Could not allocate interrupt" |
| 377 | " number for %s\n", np->full_name); |
| 378 | continue; |
| 379 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 380 | #endif |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 381 | np->intrs[intrcount].line = irq_offset_up(virq); |
| 382 | sense = (n > 1)? (irq[1] & 3): 1; |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 383 | |
| 384 | /* Apple uses bits in there in a different way, let's |
| 385 | * only keep the real sense bit on macs |
| 386 | */ |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 387 | if (machine_is(powermac)) |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 388 | sense &= 0x1; |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 389 | np->intrs[intrcount].sense = map_mpic_senses[sense]; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 390 | } |
| 391 | |
| 392 | #ifdef CONFIG_PPC64 |
| 393 | /* We offset irq numbers for the u3 MPIC by 128 in PowerMac */ |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 394 | if (machine_is(powermac) && ic && ic->parent) { |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 395 | char *name = get_property(ic->parent, "name", NULL); |
| 396 | if (name && !strcmp(name, "u3")) |
| 397 | np->intrs[intrcount].line += 128; |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 398 | else if (!(name && (!strcmp(name, "mac-io") || |
| 399 | !strcmp(name, "u4")))) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 400 | /* ignore other cascaded controllers, such as |
| 401 | the k2-sata-root */ |
| 402 | break; |
| 403 | } |
Benjamin Herrenschmidt | 1beb6a7 | 2005-12-14 13:10:10 +1100 | [diff] [blame] | 404 | #endif /* CONFIG_PPC64 */ |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 405 | if (n > 2) { |
| 406 | printk("hmmm, got %d intr cells for %s:", n, |
| 407 | np->full_name); |
| 408 | for (j = 0; j < n; ++j) |
| 409 | printk(" %d", irq[j]); |
| 410 | printk("\n"); |
| 411 | } |
| 412 | ++intrcount; |
| 413 | } |
| 414 | np->n_intrs = intrcount; |
| 415 | |
| 416 | return 0; |
| 417 | } |
| 418 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 419 | static int __devinit finish_node(struct device_node *np, |
| 420 | unsigned long *mem_start, |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 421 | int measure_only) |
| 422 | { |
| 423 | struct device_node *child; |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 424 | int rc = 0; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 425 | |
| 426 | rc = finish_node_interrupts(np, mem_start, measure_only); |
| 427 | if (rc) |
| 428 | goto out; |
| 429 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 430 | for (child = np->child; child != NULL; child = child->sibling) { |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 431 | rc = finish_node(child, mem_start, measure_only); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 432 | if (rc) |
| 433 | goto out; |
| 434 | } |
| 435 | out: |
| 436 | return rc; |
| 437 | } |
| 438 | |
| 439 | static void __init scan_interrupt_controllers(void) |
| 440 | { |
| 441 | struct device_node *np; |
| 442 | int n = 0; |
| 443 | char *name, *ic; |
| 444 | int iclen; |
| 445 | |
| 446 | for (np = allnodes; np != NULL; np = np->allnext) { |
| 447 | ic = get_property(np, "interrupt-controller", &iclen); |
| 448 | name = get_property(np, "name", NULL); |
| 449 | /* checking iclen makes sure we don't get a false |
| 450 | match on /chosen.interrupt_controller */ |
| 451 | if ((name != NULL |
| 452 | && strcmp(name, "interrupt-controller") == 0) |
| 453 | || (ic != NULL && iclen == 0 |
| 454 | && strcmp(name, "AppleKiwi"))) { |
| 455 | if (n == 0) |
| 456 | dflt_interrupt_controller = np; |
| 457 | ++n; |
| 458 | } |
| 459 | } |
| 460 | num_interrupt_controllers = n; |
| 461 | } |
| 462 | |
| 463 | /** |
| 464 | * finish_device_tree is called once things are running normally |
| 465 | * (i.e. with text and data mapped to the address they were linked at). |
| 466 | * It traverses the device tree and fills in some of the additional, |
| 467 | * fields in each node like {n_}addrs and {n_}intrs, the virt interrupt |
| 468 | * mapping is also initialized at this point. |
| 469 | */ |
| 470 | void __init finish_device_tree(void) |
| 471 | { |
| 472 | unsigned long start, end, size = 0; |
| 473 | |
| 474 | DBG(" -> finish_device_tree\n"); |
| 475 | |
| 476 | #ifdef CONFIG_PPC64 |
| 477 | /* Initialize virtual IRQ map */ |
| 478 | virt_irq_init(); |
| 479 | #endif |
| 480 | scan_interrupt_controllers(); |
| 481 | |
| 482 | /* |
| 483 | * Finish device-tree (pre-parsing some properties etc...) |
| 484 | * We do this in 2 passes. One with "measure_only" set, which |
| 485 | * will only measure the amount of memory needed, then we can |
| 486 | * allocate that memory, and call finish_node again. However, |
| 487 | * we must be careful as most routines will fail nowadays when |
| 488 | * prom_alloc() returns 0, so we must make sure our first pass |
| 489 | * doesn't start at 0. We pre-initialize size to 16 for that |
| 490 | * reason and then remove those additional 16 bytes |
| 491 | */ |
| 492 | size = 16; |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 493 | finish_node(allnodes, &size, 1); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 494 | size -= 16; |
Michael Ellerman | fa93895 | 2006-01-25 21:31:25 +1300 | [diff] [blame] | 495 | |
| 496 | if (0 == size) |
| 497 | end = start = 0; |
| 498 | else |
| 499 | end = start = (unsigned long)__va(lmb_alloc(size, 128)); |
| 500 | |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 501 | finish_node(allnodes, &end, 0); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 502 | BUG_ON(end != start + size); |
| 503 | |
| 504 | DBG(" <- finish_device_tree\n"); |
| 505 | } |
| 506 | |
| 507 | static inline char *find_flat_dt_string(u32 offset) |
| 508 | { |
| 509 | return ((char *)initial_boot_params) + |
| 510 | initial_boot_params->off_dt_strings + offset; |
| 511 | } |
| 512 | |
| 513 | /** |
| 514 | * This function is used to scan the flattened device-tree, it is |
| 515 | * used to extract the memory informations at boot before we can |
| 516 | * unflatten the tree |
| 517 | */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 518 | int __init of_scan_flat_dt(int (*it)(unsigned long node, |
| 519 | const char *uname, int depth, |
| 520 | void *data), |
| 521 | void *data) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 522 | { |
| 523 | unsigned long p = ((unsigned long)initial_boot_params) + |
| 524 | initial_boot_params->off_dt_struct; |
| 525 | int rc = 0; |
| 526 | int depth = -1; |
| 527 | |
| 528 | do { |
| 529 | u32 tag = *((u32 *)p); |
| 530 | char *pathp; |
| 531 | |
| 532 | p += 4; |
| 533 | if (tag == OF_DT_END_NODE) { |
| 534 | depth --; |
| 535 | continue; |
| 536 | } |
| 537 | if (tag == OF_DT_NOP) |
| 538 | continue; |
| 539 | if (tag == OF_DT_END) |
| 540 | break; |
| 541 | if (tag == OF_DT_PROP) { |
| 542 | u32 sz = *((u32 *)p); |
| 543 | p += 8; |
| 544 | if (initial_boot_params->version < 0x10) |
| 545 | p = _ALIGN(p, sz >= 8 ? 8 : 4); |
| 546 | p += sz; |
| 547 | p = _ALIGN(p, 4); |
| 548 | continue; |
| 549 | } |
| 550 | if (tag != OF_DT_BEGIN_NODE) { |
| 551 | printk(KERN_WARNING "Invalid tag %x scanning flattened" |
| 552 | " device tree !\n", tag); |
| 553 | return -EINVAL; |
| 554 | } |
| 555 | depth++; |
| 556 | pathp = (char *)p; |
| 557 | p = _ALIGN(p + strlen(pathp) + 1, 4); |
| 558 | if ((*pathp) == '/') { |
| 559 | char *lp, *np; |
| 560 | for (lp = NULL, np = pathp; *np; np++) |
| 561 | if ((*np) == '/') |
| 562 | lp = np+1; |
| 563 | if (lp != NULL) |
| 564 | pathp = lp; |
| 565 | } |
| 566 | rc = it(p, pathp, depth, data); |
| 567 | if (rc != 0) |
| 568 | break; |
| 569 | } while(1); |
| 570 | |
| 571 | return rc; |
| 572 | } |
| 573 | |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 574 | unsigned long __init of_get_flat_dt_root(void) |
| 575 | { |
| 576 | unsigned long p = ((unsigned long)initial_boot_params) + |
| 577 | initial_boot_params->off_dt_struct; |
| 578 | |
| 579 | while(*((u32 *)p) == OF_DT_NOP) |
| 580 | p += 4; |
| 581 | BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE); |
| 582 | p += 4; |
| 583 | return _ALIGN(p + strlen((char *)p) + 1, 4); |
| 584 | } |
| 585 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 586 | /** |
| 587 | * This function can be used within scan_flattened_dt callback to get |
| 588 | * access to properties |
| 589 | */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 590 | void* __init of_get_flat_dt_prop(unsigned long node, const char *name, |
| 591 | unsigned long *size) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 592 | { |
| 593 | unsigned long p = node; |
| 594 | |
| 595 | do { |
| 596 | u32 tag = *((u32 *)p); |
| 597 | u32 sz, noff; |
| 598 | const char *nstr; |
| 599 | |
| 600 | p += 4; |
| 601 | if (tag == OF_DT_NOP) |
| 602 | continue; |
| 603 | if (tag != OF_DT_PROP) |
| 604 | return NULL; |
| 605 | |
| 606 | sz = *((u32 *)p); |
| 607 | noff = *((u32 *)(p + 4)); |
| 608 | p += 8; |
| 609 | if (initial_boot_params->version < 0x10) |
| 610 | p = _ALIGN(p, sz >= 8 ? 8 : 4); |
| 611 | |
| 612 | nstr = find_flat_dt_string(noff); |
| 613 | if (nstr == NULL) { |
| 614 | printk(KERN_WARNING "Can't find property index" |
| 615 | " name !\n"); |
| 616 | return NULL; |
| 617 | } |
| 618 | if (strcmp(name, nstr) == 0) { |
| 619 | if (size) |
| 620 | *size = sz; |
| 621 | return (void *)p; |
| 622 | } |
| 623 | p += sz; |
| 624 | p = _ALIGN(p, 4); |
| 625 | } while(1); |
| 626 | } |
| 627 | |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 628 | int __init of_flat_dt_is_compatible(unsigned long node, const char *compat) |
| 629 | { |
| 630 | const char* cp; |
| 631 | unsigned long cplen, l; |
| 632 | |
| 633 | cp = of_get_flat_dt_prop(node, "compatible", &cplen); |
| 634 | if (cp == NULL) |
| 635 | return 0; |
| 636 | while (cplen > 0) { |
| 637 | if (strncasecmp(cp, compat, strlen(compat)) == 0) |
| 638 | return 1; |
| 639 | l = strlen(cp) + 1; |
| 640 | cp += l; |
| 641 | cplen -= l; |
| 642 | } |
| 643 | |
| 644 | return 0; |
| 645 | } |
| 646 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 647 | static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size, |
| 648 | unsigned long align) |
| 649 | { |
| 650 | void *res; |
| 651 | |
| 652 | *mem = _ALIGN(*mem, align); |
| 653 | res = (void *)*mem; |
| 654 | *mem += size; |
| 655 | |
| 656 | return res; |
| 657 | } |
| 658 | |
| 659 | static unsigned long __init unflatten_dt_node(unsigned long mem, |
| 660 | unsigned long *p, |
| 661 | struct device_node *dad, |
| 662 | struct device_node ***allnextpp, |
| 663 | unsigned long fpsize) |
| 664 | { |
| 665 | struct device_node *np; |
| 666 | struct property *pp, **prev_pp = NULL; |
| 667 | char *pathp; |
| 668 | u32 tag; |
| 669 | unsigned int l, allocl; |
| 670 | int has_name = 0; |
| 671 | int new_format = 0; |
| 672 | |
| 673 | tag = *((u32 *)(*p)); |
| 674 | if (tag != OF_DT_BEGIN_NODE) { |
| 675 | printk("Weird tag at start of node: %x\n", tag); |
| 676 | return mem; |
| 677 | } |
| 678 | *p += 4; |
| 679 | pathp = (char *)*p; |
| 680 | l = allocl = strlen(pathp) + 1; |
| 681 | *p = _ALIGN(*p + l, 4); |
| 682 | |
| 683 | /* version 0x10 has a more compact unit name here instead of the full |
| 684 | * path. we accumulate the full path size using "fpsize", we'll rebuild |
| 685 | * it later. We detect this because the first character of the name is |
| 686 | * not '/'. |
| 687 | */ |
| 688 | if ((*pathp) != '/') { |
| 689 | new_format = 1; |
| 690 | if (fpsize == 0) { |
| 691 | /* root node: special case. fpsize accounts for path |
| 692 | * plus terminating zero. root node only has '/', so |
| 693 | * fpsize should be 2, but we want to avoid the first |
| 694 | * level nodes to have two '/' so we use fpsize 1 here |
| 695 | */ |
| 696 | fpsize = 1; |
| 697 | allocl = 2; |
| 698 | } else { |
| 699 | /* account for '/' and path size minus terminal 0 |
| 700 | * already in 'l' |
| 701 | */ |
| 702 | fpsize += l; |
| 703 | allocl = fpsize; |
| 704 | } |
| 705 | } |
| 706 | |
| 707 | |
| 708 | np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl, |
| 709 | __alignof__(struct device_node)); |
| 710 | if (allnextpp) { |
| 711 | memset(np, 0, sizeof(*np)); |
| 712 | np->full_name = ((char*)np) + sizeof(struct device_node); |
| 713 | if (new_format) { |
| 714 | char *p = np->full_name; |
| 715 | /* rebuild full path for new format */ |
| 716 | if (dad && dad->parent) { |
| 717 | strcpy(p, dad->full_name); |
| 718 | #ifdef DEBUG |
| 719 | if ((strlen(p) + l + 1) != allocl) { |
| 720 | DBG("%s: p: %d, l: %d, a: %d\n", |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 721 | pathp, (int)strlen(p), l, allocl); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 722 | } |
| 723 | #endif |
| 724 | p += strlen(p); |
| 725 | } |
| 726 | *(p++) = '/'; |
| 727 | memcpy(p, pathp, l); |
| 728 | } else |
| 729 | memcpy(np->full_name, pathp, l); |
| 730 | prev_pp = &np->properties; |
| 731 | **allnextpp = np; |
| 732 | *allnextpp = &np->allnext; |
| 733 | if (dad != NULL) { |
| 734 | np->parent = dad; |
| 735 | /* we temporarily use the next field as `last_child'*/ |
| 736 | if (dad->next == 0) |
| 737 | dad->child = np; |
| 738 | else |
| 739 | dad->next->sibling = np; |
| 740 | dad->next = np; |
| 741 | } |
| 742 | kref_init(&np->kref); |
| 743 | } |
| 744 | while(1) { |
| 745 | u32 sz, noff; |
| 746 | char *pname; |
| 747 | |
| 748 | tag = *((u32 *)(*p)); |
| 749 | if (tag == OF_DT_NOP) { |
| 750 | *p += 4; |
| 751 | continue; |
| 752 | } |
| 753 | if (tag != OF_DT_PROP) |
| 754 | break; |
| 755 | *p += 4; |
| 756 | sz = *((u32 *)(*p)); |
| 757 | noff = *((u32 *)((*p) + 4)); |
| 758 | *p += 8; |
| 759 | if (initial_boot_params->version < 0x10) |
| 760 | *p = _ALIGN(*p, sz >= 8 ? 8 : 4); |
| 761 | |
| 762 | pname = find_flat_dt_string(noff); |
| 763 | if (pname == NULL) { |
| 764 | printk("Can't find property name in list !\n"); |
| 765 | break; |
| 766 | } |
| 767 | if (strcmp(pname, "name") == 0) |
| 768 | has_name = 1; |
| 769 | l = strlen(pname) + 1; |
| 770 | pp = unflatten_dt_alloc(&mem, sizeof(struct property), |
| 771 | __alignof__(struct property)); |
| 772 | if (allnextpp) { |
| 773 | if (strcmp(pname, "linux,phandle") == 0) { |
| 774 | np->node = *((u32 *)*p); |
| 775 | if (np->linux_phandle == 0) |
| 776 | np->linux_phandle = np->node; |
| 777 | } |
| 778 | if (strcmp(pname, "ibm,phandle") == 0) |
| 779 | np->linux_phandle = *((u32 *)*p); |
| 780 | pp->name = pname; |
| 781 | pp->length = sz; |
| 782 | pp->value = (void *)*p; |
| 783 | *prev_pp = pp; |
| 784 | prev_pp = &pp->next; |
| 785 | } |
| 786 | *p = _ALIGN((*p) + sz, 4); |
| 787 | } |
| 788 | /* with version 0x10 we may not have the name property, recreate |
| 789 | * it here from the unit name if absent |
| 790 | */ |
| 791 | if (!has_name) { |
| 792 | char *p = pathp, *ps = pathp, *pa = NULL; |
| 793 | int sz; |
| 794 | |
| 795 | while (*p) { |
| 796 | if ((*p) == '@') |
| 797 | pa = p; |
| 798 | if ((*p) == '/') |
| 799 | ps = p + 1; |
| 800 | p++; |
| 801 | } |
| 802 | if (pa < ps) |
| 803 | pa = p; |
| 804 | sz = (pa - ps) + 1; |
| 805 | pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz, |
| 806 | __alignof__(struct property)); |
| 807 | if (allnextpp) { |
| 808 | pp->name = "name"; |
| 809 | pp->length = sz; |
| 810 | pp->value = (unsigned char *)(pp + 1); |
| 811 | *prev_pp = pp; |
| 812 | prev_pp = &pp->next; |
| 813 | memcpy(pp->value, ps, sz - 1); |
| 814 | ((char *)pp->value)[sz - 1] = 0; |
| 815 | DBG("fixed up name for %s -> %s\n", pathp, pp->value); |
| 816 | } |
| 817 | } |
| 818 | if (allnextpp) { |
| 819 | *prev_pp = NULL; |
| 820 | np->name = get_property(np, "name", NULL); |
| 821 | np->type = get_property(np, "device_type", NULL); |
| 822 | |
| 823 | if (!np->name) |
| 824 | np->name = "<NULL>"; |
| 825 | if (!np->type) |
| 826 | np->type = "<NULL>"; |
| 827 | } |
| 828 | while (tag == OF_DT_BEGIN_NODE) { |
| 829 | mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize); |
| 830 | tag = *((u32 *)(*p)); |
| 831 | } |
| 832 | if (tag != OF_DT_END_NODE) { |
| 833 | printk("Weird tag at end of node: %x\n", tag); |
| 834 | return mem; |
| 835 | } |
| 836 | *p += 4; |
| 837 | return mem; |
| 838 | } |
| 839 | |
Michael Ellerman | 2babf5c | 2006-05-17 18:00:46 +1000 | [diff] [blame] | 840 | static int __init early_parse_mem(char *p) |
| 841 | { |
| 842 | if (!p) |
| 843 | return 1; |
| 844 | |
| 845 | memory_limit = PAGE_ALIGN(memparse(p, &p)); |
| 846 | DBG("memory limit = 0x%lx\n", memory_limit); |
| 847 | |
| 848 | return 0; |
| 849 | } |
| 850 | early_param("mem", early_parse_mem); |
| 851 | |
| 852 | /* |
| 853 | * The device tree may be allocated below our memory limit, or inside the |
| 854 | * crash kernel region for kdump. If so, move it out now. |
| 855 | */ |
| 856 | static void move_device_tree(void) |
| 857 | { |
| 858 | unsigned long start, size; |
| 859 | void *p; |
| 860 | |
| 861 | DBG("-> move_device_tree\n"); |
| 862 | |
| 863 | start = __pa(initial_boot_params); |
| 864 | size = initial_boot_params->totalsize; |
| 865 | |
| 866 | if ((memory_limit && (start + size) > memory_limit) || |
| 867 | overlaps_crashkernel(start, size)) { |
| 868 | p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size)); |
| 869 | memcpy(p, initial_boot_params, size); |
| 870 | initial_boot_params = (struct boot_param_header *)p; |
| 871 | DBG("Moved device tree to 0x%p\n", p); |
| 872 | } |
| 873 | |
| 874 | DBG("<- move_device_tree\n"); |
| 875 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 876 | |
| 877 | /** |
| 878 | * unflattens the device-tree passed by the firmware, creating the |
| 879 | * tree of struct device_node. It also fills the "name" and "type" |
| 880 | * pointers of the nodes so the normal device-tree walking functions |
| 881 | * can be used (this used to be done by finish_device_tree) |
| 882 | */ |
| 883 | void __init unflatten_device_tree(void) |
| 884 | { |
| 885 | unsigned long start, mem, size; |
| 886 | struct device_node **allnextp = &allnodes; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 887 | |
| 888 | DBG(" -> unflatten_device_tree()\n"); |
| 889 | |
| 890 | /* First pass, scan for size */ |
| 891 | start = ((unsigned long)initial_boot_params) + |
| 892 | initial_boot_params->off_dt_struct; |
| 893 | size = unflatten_dt_node(0, &start, NULL, NULL, 0); |
| 894 | size = (size | 3) + 1; |
| 895 | |
| 896 | DBG(" size is %lx, allocating...\n", size); |
| 897 | |
| 898 | /* Allocate memory for the expanded device tree */ |
| 899 | mem = lmb_alloc(size + 4, __alignof__(struct device_node)); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 900 | mem = (unsigned long) __va(mem); |
| 901 | |
| 902 | ((u32 *)mem)[size / 4] = 0xdeadbeef; |
| 903 | |
| 904 | DBG(" unflattening %lx...\n", mem); |
| 905 | |
| 906 | /* Second pass, do actual unflattening */ |
| 907 | start = ((unsigned long)initial_boot_params) + |
| 908 | initial_boot_params->off_dt_struct; |
| 909 | unflatten_dt_node(mem, &start, NULL, &allnextp, 0); |
| 910 | if (*((u32 *)start) != OF_DT_END) |
| 911 | printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start)); |
| 912 | if (((u32 *)mem)[size / 4] != 0xdeadbeef) |
| 913 | printk(KERN_WARNING "End of tree marker overwritten: %08x\n", |
| 914 | ((u32 *)mem)[size / 4] ); |
| 915 | *allnextp = NULL; |
| 916 | |
| 917 | /* Get pointer to OF "/chosen" node for use everywhere */ |
| 918 | of_chosen = of_find_node_by_path("/chosen"); |
Paul Mackerras | a575b80 | 2005-10-23 17:23:21 +1000 | [diff] [blame] | 919 | if (of_chosen == NULL) |
| 920 | of_chosen = of_find_node_by_path("/chosen@0"); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 921 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 922 | DBG(" <- unflatten_device_tree()\n"); |
| 923 | } |
| 924 | |
Paul Mackerras | d205819 | 2006-05-03 23:04:37 +1000 | [diff] [blame] | 925 | /* |
| 926 | * ibm,pa-features is a per-cpu property that contains a string of |
| 927 | * attribute descriptors, each of which has a 2 byte header plus up |
| 928 | * to 254 bytes worth of processor attribute bits. First header |
| 929 | * byte specifies the number of bytes following the header. |
| 930 | * Second header byte is an "attribute-specifier" type, of which |
| 931 | * zero is the only currently-defined value. |
| 932 | * Implementation: Pass in the byte and bit offset for the feature |
| 933 | * that we are interested in. The function will return -1 if the |
| 934 | * pa-features property is missing, or a 1/0 to indicate if the feature |
| 935 | * is supported/not supported. Note that the bit numbers are |
| 936 | * big-endian to match the definition in PAPR. |
| 937 | */ |
| 938 | static struct ibm_pa_feature { |
| 939 | unsigned long cpu_features; /* CPU_FTR_xxx bit */ |
| 940 | unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */ |
| 941 | unsigned char pabyte; /* byte number in ibm,pa-features */ |
| 942 | unsigned char pabit; /* bit number (big-endian) */ |
| 943 | unsigned char invert; /* if 1, pa bit set => clear feature */ |
| 944 | } ibm_pa_features[] __initdata = { |
| 945 | {0, PPC_FEATURE_HAS_MMU, 0, 0, 0}, |
| 946 | {0, PPC_FEATURE_HAS_FPU, 0, 1, 0}, |
| 947 | {CPU_FTR_SLB, 0, 0, 2, 0}, |
| 948 | {CPU_FTR_CTRL, 0, 0, 3, 0}, |
| 949 | {CPU_FTR_NOEXECUTE, 0, 0, 6, 0}, |
| 950 | {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1}, |
Paul Mackerras | bf72aeb | 2006-06-15 10:45:18 +1000 | [diff] [blame] | 951 | #if 0 |
| 952 | /* put this back once we know how to test if firmware does 64k IO */ |
Paul Mackerras | d205819 | 2006-05-03 23:04:37 +1000 | [diff] [blame] | 953 | {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0}, |
Paul Mackerras | bf72aeb | 2006-06-15 10:45:18 +1000 | [diff] [blame] | 954 | #endif |
Paul Mackerras | d205819 | 2006-05-03 23:04:37 +1000 | [diff] [blame] | 955 | }; |
| 956 | |
| 957 | static void __init check_cpu_pa_features(unsigned long node) |
| 958 | { |
| 959 | unsigned char *pa_ftrs; |
| 960 | unsigned long len, tablelen, i, bit; |
| 961 | |
| 962 | pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen); |
| 963 | if (pa_ftrs == NULL) |
| 964 | return; |
| 965 | |
| 966 | /* find descriptor with type == 0 */ |
| 967 | for (;;) { |
| 968 | if (tablelen < 3) |
| 969 | return; |
| 970 | len = 2 + pa_ftrs[0]; |
| 971 | if (tablelen < len) |
| 972 | return; /* descriptor 0 not found */ |
| 973 | if (pa_ftrs[1] == 0) |
| 974 | break; |
| 975 | tablelen -= len; |
| 976 | pa_ftrs += len; |
| 977 | } |
| 978 | |
| 979 | /* loop over bits we know about */ |
| 980 | for (i = 0; i < ARRAY_SIZE(ibm_pa_features); ++i) { |
| 981 | struct ibm_pa_feature *fp = &ibm_pa_features[i]; |
| 982 | |
| 983 | if (fp->pabyte >= pa_ftrs[0]) |
| 984 | continue; |
| 985 | bit = (pa_ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1; |
| 986 | if (bit ^ fp->invert) { |
| 987 | cur_cpu_spec->cpu_features |= fp->cpu_features; |
| 988 | cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs; |
| 989 | } else { |
| 990 | cur_cpu_spec->cpu_features &= ~fp->cpu_features; |
| 991 | cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs; |
| 992 | } |
| 993 | } |
| 994 | } |
| 995 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 996 | static int __init early_init_dt_scan_cpus(unsigned long node, |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 997 | const char *uname, int depth, |
| 998 | void *data) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 999 | { |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1000 | static int logical_cpuid = 0; |
| 1001 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); |
Stephen Rothwell | 4d177fb | 2006-03-28 17:14:44 +1100 | [diff] [blame] | 1002 | #ifdef CONFIG_ALTIVEC |
| 1003 | u32 *prop; |
| 1004 | #endif |
| 1005 | u32 *intserv; |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1006 | int i, nthreads; |
| 1007 | unsigned long len; |
| 1008 | int found = 0; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1009 | |
| 1010 | /* We are scanning "cpu" nodes only */ |
| 1011 | if (type == NULL || strcmp(type, "cpu") != 0) |
| 1012 | return 0; |
| 1013 | |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1014 | /* Get physical cpuid */ |
| 1015 | intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len); |
| 1016 | if (intserv) { |
| 1017 | nthreads = len / sizeof(int); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1018 | } else { |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1019 | intserv = of_get_flat_dt_prop(node, "reg", NULL); |
| 1020 | nthreads = 1; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1021 | } |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1022 | |
| 1023 | /* |
| 1024 | * Now see if any of these threads match our boot cpu. |
| 1025 | * NOTE: This must match the parsing done in smp_setup_cpu_maps. |
| 1026 | */ |
| 1027 | for (i = 0; i < nthreads; i++) { |
| 1028 | /* |
| 1029 | * version 2 of the kexec param format adds the phys cpuid of |
| 1030 | * booted proc. |
| 1031 | */ |
| 1032 | if (initial_boot_params && initial_boot_params->version >= 2) { |
| 1033 | if (intserv[i] == |
| 1034 | initial_boot_params->boot_cpuid_phys) { |
| 1035 | found = 1; |
| 1036 | break; |
| 1037 | } |
| 1038 | } else { |
| 1039 | /* |
| 1040 | * Check if it's the boot-cpu, set it's hw index now, |
| 1041 | * unfortunately this format did not support booting |
| 1042 | * off secondary threads. |
| 1043 | */ |
| 1044 | if (of_get_flat_dt_prop(node, |
| 1045 | "linux,boot-cpu", NULL) != NULL) { |
| 1046 | found = 1; |
| 1047 | break; |
| 1048 | } |
| 1049 | } |
| 1050 | |
| 1051 | #ifdef CONFIG_SMP |
| 1052 | /* logical cpu id is always 0 on UP kernels */ |
| 1053 | logical_cpuid++; |
| 1054 | #endif |
| 1055 | } |
| 1056 | |
| 1057 | if (found) { |
| 1058 | DBG("boot cpu: logical %d physical %d\n", logical_cpuid, |
| 1059 | intserv[i]); |
| 1060 | boot_cpuid = logical_cpuid; |
| 1061 | set_hard_smp_processor_id(boot_cpuid, intserv[i]); |
| 1062 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1063 | |
| 1064 | #ifdef CONFIG_ALTIVEC |
| 1065 | /* Check if we have a VMX and eventually update CPU features */ |
Stephen Rothwell | 676e249 | 2005-11-10 14:16:21 +1100 | [diff] [blame] | 1066 | prop = (u32 *)of_get_flat_dt_prop(node, "ibm,vmx", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1067 | if (prop && (*prop) > 0) { |
| 1068 | cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC; |
| 1069 | cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC; |
| 1070 | } |
| 1071 | |
| 1072 | /* Same goes for Apple's "altivec" property */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1073 | prop = (u32 *)of_get_flat_dt_prop(node, "altivec", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1074 | if (prop) { |
| 1075 | cur_cpu_spec->cpu_features |= CPU_FTR_ALTIVEC; |
| 1076 | cur_cpu_spec->cpu_user_features |= PPC_FEATURE_HAS_ALTIVEC; |
| 1077 | } |
| 1078 | #endif /* CONFIG_ALTIVEC */ |
| 1079 | |
Paul Mackerras | d205819 | 2006-05-03 23:04:37 +1000 | [diff] [blame] | 1080 | check_cpu_pa_features(node); |
| 1081 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1082 | #ifdef CONFIG_PPC_PSERIES |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1083 | if (nthreads > 1) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1084 | cur_cpu_spec->cpu_features |= CPU_FTR_SMT; |
Anton Blanchard | 4df2046 | 2006-03-25 17:25:17 +1100 | [diff] [blame] | 1085 | else |
| 1086 | cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1087 | #endif |
| 1088 | |
| 1089 | return 0; |
| 1090 | } |
| 1091 | |
| 1092 | static int __init early_init_dt_scan_chosen(unsigned long node, |
| 1093 | const char *uname, int depth, void *data) |
| 1094 | { |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1095 | unsigned long *lprop; |
Kumar Gala | 329dda0 | 2006-02-24 10:54:52 -0600 | [diff] [blame] | 1096 | unsigned long l; |
| 1097 | char *p; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1098 | |
| 1099 | DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname); |
| 1100 | |
Paul Mackerras | a575b80 | 2005-10-23 17:23:21 +1000 | [diff] [blame] | 1101 | if (depth != 1 || |
| 1102 | (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0)) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1103 | return 0; |
| 1104 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1105 | #ifdef CONFIG_PPC64 |
| 1106 | /* check if iommu is forced on or off */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1107 | if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1108 | iommu_is_off = 1; |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1109 | if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1110 | iommu_force_on = 1; |
| 1111 | #endif |
| 1112 | |
Michael Ellerman | 2babf5c | 2006-05-17 18:00:46 +1000 | [diff] [blame] | 1113 | /* mem=x on the command line is the preferred mechanism */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1114 | lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1115 | if (lprop) |
| 1116 | memory_limit = *lprop; |
| 1117 | |
| 1118 | #ifdef CONFIG_PPC64 |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1119 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1120 | if (lprop) |
| 1121 | tce_alloc_start = *lprop; |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1122 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1123 | if (lprop) |
| 1124 | tce_alloc_end = *lprop; |
| 1125 | #endif |
| 1126 | |
| 1127 | #ifdef CONFIG_PPC_RTAS |
Adrian Bunk | 943ffb5 | 2006-01-10 00:10:13 +0100 | [diff] [blame] | 1128 | /* To help early debugging via the front panel, we retrieve a minimal |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1129 | * set of RTAS infos now if available |
| 1130 | */ |
| 1131 | { |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 1132 | u64 *basep, *entryp, *sizep; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1133 | |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1134 | basep = of_get_flat_dt_prop(node, "linux,rtas-base", NULL); |
| 1135 | entryp = of_get_flat_dt_prop(node, "linux,rtas-entry", NULL); |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 1136 | sizep = of_get_flat_dt_prop(node, "linux,rtas-size", NULL); |
| 1137 | if (basep && entryp && sizep) { |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1138 | rtas.base = *basep; |
| 1139 | rtas.entry = *entryp; |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 1140 | rtas.size = *sizep; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1141 | } |
| 1142 | } |
| 1143 | #endif /* CONFIG_PPC_RTAS */ |
| 1144 | |
Michael Ellerman | dcee303 | 2005-12-04 18:39:48 +1100 | [diff] [blame] | 1145 | #ifdef CONFIG_KEXEC |
| 1146 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL); |
| 1147 | if (lprop) |
| 1148 | crashk_res.start = *lprop; |
| 1149 | |
| 1150 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL); |
| 1151 | if (lprop) |
| 1152 | crashk_res.end = crashk_res.start + *lprop - 1; |
| 1153 | #endif |
| 1154 | |
Kumar Gala | 329dda0 | 2006-02-24 10:54:52 -0600 | [diff] [blame] | 1155 | /* Retreive command line */ |
| 1156 | p = of_get_flat_dt_prop(node, "bootargs", &l); |
| 1157 | if (p != NULL && l > 0) |
| 1158 | strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE)); |
| 1159 | |
| 1160 | #ifdef CONFIG_CMDLINE |
| 1161 | if (l == 0 || (l == 1 && (*p) == 0)) |
| 1162 | strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE); |
| 1163 | #endif /* CONFIG_CMDLINE */ |
| 1164 | |
| 1165 | DBG("Command line is: %s\n", cmd_line); |
| 1166 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1167 | /* break now */ |
| 1168 | return 1; |
| 1169 | } |
| 1170 | |
| 1171 | static int __init early_init_dt_scan_root(unsigned long node, |
| 1172 | const char *uname, int depth, void *data) |
| 1173 | { |
| 1174 | u32 *prop; |
| 1175 | |
| 1176 | if (depth != 0) |
| 1177 | return 0; |
| 1178 | |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1179 | prop = of_get_flat_dt_prop(node, "#size-cells", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1180 | dt_root_size_cells = (prop == NULL) ? 1 : *prop; |
| 1181 | DBG("dt_root_size_cells = %x\n", dt_root_size_cells); |
| 1182 | |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1183 | prop = of_get_flat_dt_prop(node, "#address-cells", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1184 | dt_root_addr_cells = (prop == NULL) ? 2 : *prop; |
| 1185 | DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells); |
| 1186 | |
| 1187 | /* break now */ |
| 1188 | return 1; |
| 1189 | } |
| 1190 | |
| 1191 | static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp) |
| 1192 | { |
| 1193 | cell_t *p = *cellp; |
| 1194 | unsigned long r; |
| 1195 | |
| 1196 | /* Ignore more than 2 cells */ |
| 1197 | while (s > sizeof(unsigned long) / 4) { |
| 1198 | p++; |
| 1199 | s--; |
| 1200 | } |
| 1201 | r = *p++; |
| 1202 | #ifdef CONFIG_PPC64 |
| 1203 | if (s > 1) { |
| 1204 | r <<= 32; |
| 1205 | r |= *(p++); |
| 1206 | s--; |
| 1207 | } |
| 1208 | #endif |
| 1209 | |
| 1210 | *cellp = p; |
| 1211 | return r; |
| 1212 | } |
| 1213 | |
| 1214 | |
| 1215 | static int __init early_init_dt_scan_memory(unsigned long node, |
| 1216 | const char *uname, int depth, void *data) |
| 1217 | { |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1218 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1219 | cell_t *reg, *endp; |
| 1220 | unsigned long l; |
| 1221 | |
| 1222 | /* We are scanning "memory" nodes only */ |
Paul Mackerras | a23414b | 2005-11-10 12:00:55 +1100 | [diff] [blame] | 1223 | if (type == NULL) { |
| 1224 | /* |
| 1225 | * The longtrail doesn't have a device_type on the |
| 1226 | * /memory node, so look for the node called /memory@0. |
| 1227 | */ |
| 1228 | if (depth != 1 || strcmp(uname, "memory@0") != 0) |
| 1229 | return 0; |
| 1230 | } else if (strcmp(type, "memory") != 0) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1231 | return 0; |
| 1232 | |
Michael Ellerman | ba75948 | 2005-12-04 18:39:55 +1100 | [diff] [blame] | 1233 | reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l); |
| 1234 | if (reg == NULL) |
| 1235 | reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1236 | if (reg == NULL) |
| 1237 | return 0; |
| 1238 | |
| 1239 | endp = reg + (l / sizeof(cell_t)); |
| 1240 | |
Michael Ellerman | 358c86f | 2005-11-03 15:39:09 +1100 | [diff] [blame] | 1241 | DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n", |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1242 | uname, l, reg[0], reg[1], reg[2], reg[3]); |
| 1243 | |
| 1244 | while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) { |
| 1245 | unsigned long base, size; |
| 1246 | |
| 1247 | base = dt_mem_next_cell(dt_root_addr_cells, ®); |
| 1248 | size = dt_mem_next_cell(dt_root_size_cells, ®); |
| 1249 | |
| 1250 | if (size == 0) |
| 1251 | continue; |
| 1252 | DBG(" - %lx , %lx\n", base, size); |
| 1253 | #ifdef CONFIG_PPC64 |
| 1254 | if (iommu_is_off) { |
| 1255 | if (base >= 0x80000000ul) |
| 1256 | continue; |
| 1257 | if ((base + size) > 0x80000000ul) |
| 1258 | size = 0x80000000ul - base; |
| 1259 | } |
| 1260 | #endif |
| 1261 | lmb_add(base, size); |
| 1262 | } |
| 1263 | return 0; |
| 1264 | } |
| 1265 | |
| 1266 | static void __init early_reserve_mem(void) |
| 1267 | { |
Kumar Gala | cbbcf34 | 2006-01-11 17:57:13 -0600 | [diff] [blame] | 1268 | u64 base, size; |
| 1269 | u64 *reserve_map; |
Jon Loeliger | 8a30088 | 2006-06-17 17:51:09 -0500 | [diff] [blame^] | 1270 | unsigned long self_base; |
| 1271 | unsigned long self_size; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1272 | |
Kumar Gala | cbbcf34 | 2006-01-11 17:57:13 -0600 | [diff] [blame] | 1273 | reserve_map = (u64 *)(((unsigned long)initial_boot_params) + |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1274 | initial_boot_params->off_mem_rsvmap); |
Jimi Xenidis | 4d1f3f2 | 2006-05-18 17:03:05 -0500 | [diff] [blame] | 1275 | |
| 1276 | /* before we do anything, lets reserve the dt blob */ |
Jon Loeliger | 8a30088 | 2006-06-17 17:51:09 -0500 | [diff] [blame^] | 1277 | self_base = __pa((unsigned long)initial_boot_params); |
| 1278 | self_size = initial_boot_params->totalsize; |
| 1279 | lmb_reserve(self_base, self_size); |
Jimi Xenidis | 4d1f3f2 | 2006-05-18 17:03:05 -0500 | [diff] [blame] | 1280 | |
Kumar Gala | cbbcf34 | 2006-01-11 17:57:13 -0600 | [diff] [blame] | 1281 | #ifdef CONFIG_PPC32 |
| 1282 | /* |
| 1283 | * Handle the case where we might be booting from an old kexec |
| 1284 | * image that setup the mem_rsvmap as pairs of 32-bit values |
| 1285 | */ |
| 1286 | if (*reserve_map > 0xffffffffull) { |
| 1287 | u32 base_32, size_32; |
| 1288 | u32 *reserve_map_32 = (u32 *)reserve_map; |
| 1289 | |
| 1290 | while (1) { |
| 1291 | base_32 = *(reserve_map_32++); |
| 1292 | size_32 = *(reserve_map_32++); |
| 1293 | if (size_32 == 0) |
| 1294 | break; |
Jon Loeliger | 8a30088 | 2006-06-17 17:51:09 -0500 | [diff] [blame^] | 1295 | /* skip if the reservation is for the blob */ |
| 1296 | if (base_32 == self_base && size_32 == self_size) |
| 1297 | continue; |
Kumar Gala | 329dda0 | 2006-02-24 10:54:52 -0600 | [diff] [blame] | 1298 | DBG("reserving: %x -> %x\n", base_32, size_32); |
Kumar Gala | cbbcf34 | 2006-01-11 17:57:13 -0600 | [diff] [blame] | 1299 | lmb_reserve(base_32, size_32); |
| 1300 | } |
| 1301 | return; |
| 1302 | } |
| 1303 | #endif |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1304 | while (1) { |
| 1305 | base = *(reserve_map++); |
| 1306 | size = *(reserve_map++); |
| 1307 | if (size == 0) |
| 1308 | break; |
Jon Loeliger | 8a30088 | 2006-06-17 17:51:09 -0500 | [diff] [blame^] | 1309 | /* skip if the reservation is for the blob */ |
| 1310 | if (base == self_base && size == self_size) |
| 1311 | continue; |
Kumar Gala | cbbcf34 | 2006-01-11 17:57:13 -0600 | [diff] [blame] | 1312 | DBG("reserving: %llx -> %llx\n", base, size); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1313 | lmb_reserve(base, size); |
| 1314 | } |
| 1315 | |
| 1316 | #if 0 |
| 1317 | DBG("memory reserved, lmbs :\n"); |
| 1318 | lmb_dump_all(); |
| 1319 | #endif |
| 1320 | } |
| 1321 | |
| 1322 | void __init early_init_devtree(void *params) |
| 1323 | { |
| 1324 | DBG(" -> early_init_devtree()\n"); |
| 1325 | |
| 1326 | /* Setup flat device-tree pointer */ |
| 1327 | initial_boot_params = params; |
| 1328 | |
| 1329 | /* Retrieve various informations from the /chosen node of the |
| 1330 | * device-tree, including the platform type, initrd location and |
| 1331 | * size, TCE reserve, and more ... |
| 1332 | */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1333 | of_scan_flat_dt(early_init_dt_scan_chosen, NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1334 | |
| 1335 | /* Scan memory nodes and rebuild LMBs */ |
| 1336 | lmb_init(); |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1337 | of_scan_flat_dt(early_init_dt_scan_root, NULL); |
| 1338 | of_scan_flat_dt(early_init_dt_scan_memory, NULL); |
Michael Ellerman | 846f77b | 2006-05-17 18:00:45 +1000 | [diff] [blame] | 1339 | |
| 1340 | /* Save command line for /proc/cmdline and then parse parameters */ |
| 1341 | strlcpy(saved_command_line, cmd_line, COMMAND_LINE_SIZE); |
| 1342 | parse_early_param(); |
| 1343 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1344 | /* Reserve LMB regions used by kernel, initrd, dt, etc... */ |
Michael Ellerman | 0cc4746 | 2005-12-04 18:39:37 +1100 | [diff] [blame] | 1345 | lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START); |
Michael Ellerman | 4731041 | 2006-05-17 18:00:49 +1000 | [diff] [blame] | 1346 | reserve_kdump_trampoline(); |
Michael Ellerman | 35dd543 | 2006-05-18 11:16:11 +1000 | [diff] [blame] | 1347 | reserve_crashkernel(); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1348 | early_reserve_mem(); |
| 1349 | |
Michael Ellerman | 2babf5c | 2006-05-17 18:00:46 +1000 | [diff] [blame] | 1350 | lmb_enforce_memory_limit(memory_limit); |
| 1351 | lmb_analyze(); |
| 1352 | |
| 1353 | DBG("Phys. mem: %lx\n", lmb_phys_mem_size()); |
| 1354 | |
| 1355 | /* We may need to relocate the flat tree, do it now. |
| 1356 | * FIXME .. and the initrd too? */ |
| 1357 | move_device_tree(); |
| 1358 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1359 | DBG("Scanning CPUs ...\n"); |
| 1360 | |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1361 | /* Retreive CPU related informations from the flat tree |
| 1362 | * (altivec support, boot CPU ID, ...) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1363 | */ |
Benjamin Herrenschmidt | 3c726f8 | 2005-11-07 11:06:55 +1100 | [diff] [blame] | 1364 | of_scan_flat_dt(early_init_dt_scan_cpus, NULL); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1365 | |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1366 | DBG(" <- early_init_devtree()\n"); |
| 1367 | } |
| 1368 | |
| 1369 | #undef printk |
| 1370 | |
| 1371 | int |
| 1372 | prom_n_addr_cells(struct device_node* np) |
| 1373 | { |
| 1374 | int* ip; |
| 1375 | do { |
| 1376 | if (np->parent) |
| 1377 | np = np->parent; |
| 1378 | ip = (int *) get_property(np, "#address-cells", NULL); |
| 1379 | if (ip != NULL) |
| 1380 | return *ip; |
| 1381 | } while (np->parent); |
| 1382 | /* No #address-cells property for the root node, default to 1 */ |
| 1383 | return 1; |
| 1384 | } |
Paul Mackerras | 1dfc677 | 2005-11-14 17:30:40 +1100 | [diff] [blame] | 1385 | EXPORT_SYMBOL(prom_n_addr_cells); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1386 | |
| 1387 | int |
| 1388 | prom_n_size_cells(struct device_node* np) |
| 1389 | { |
| 1390 | int* ip; |
| 1391 | do { |
| 1392 | if (np->parent) |
| 1393 | np = np->parent; |
| 1394 | ip = (int *) get_property(np, "#size-cells", NULL); |
| 1395 | if (ip != NULL) |
| 1396 | return *ip; |
| 1397 | } while (np->parent); |
| 1398 | /* No #size-cells property for the root node, default to 1 */ |
| 1399 | return 1; |
| 1400 | } |
Paul Mackerras | 1dfc677 | 2005-11-14 17:30:40 +1100 | [diff] [blame] | 1401 | EXPORT_SYMBOL(prom_n_size_cells); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1402 | |
| 1403 | /** |
| 1404 | * Work out the sense (active-low level / active-high edge) |
| 1405 | * of each interrupt from the device tree. |
| 1406 | */ |
| 1407 | void __init prom_get_irq_senses(unsigned char *senses, int off, int max) |
| 1408 | { |
| 1409 | struct device_node *np; |
| 1410 | int i, j; |
| 1411 | |
| 1412 | /* default to level-triggered */ |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 1413 | memset(senses, IRQ_SENSE_LEVEL | IRQ_POLARITY_NEGATIVE, max - off); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1414 | |
| 1415 | for (np = allnodes; np != 0; np = np->allnext) { |
| 1416 | for (j = 0; j < np->n_intrs; j++) { |
| 1417 | i = np->intrs[j].line; |
| 1418 | if (i >= off && i < max) |
Paul Mackerras | 6d0124f | 2005-10-26 17:19:06 +1000 | [diff] [blame] | 1419 | senses[i-off] = np->intrs[j].sense; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1420 | } |
| 1421 | } |
| 1422 | } |
| 1423 | |
| 1424 | /** |
| 1425 | * Construct and return a list of the device_nodes with a given name. |
| 1426 | */ |
| 1427 | struct device_node *find_devices(const char *name) |
| 1428 | { |
| 1429 | struct device_node *head, **prevp, *np; |
| 1430 | |
| 1431 | prevp = &head; |
| 1432 | for (np = allnodes; np != 0; np = np->allnext) { |
| 1433 | if (np->name != 0 && strcasecmp(np->name, name) == 0) { |
| 1434 | *prevp = np; |
| 1435 | prevp = &np->next; |
| 1436 | } |
| 1437 | } |
| 1438 | *prevp = NULL; |
| 1439 | return head; |
| 1440 | } |
| 1441 | EXPORT_SYMBOL(find_devices); |
| 1442 | |
| 1443 | /** |
| 1444 | * Construct and return a list of the device_nodes with a given type. |
| 1445 | */ |
| 1446 | struct device_node *find_type_devices(const char *type) |
| 1447 | { |
| 1448 | struct device_node *head, **prevp, *np; |
| 1449 | |
| 1450 | prevp = &head; |
| 1451 | for (np = allnodes; np != 0; np = np->allnext) { |
| 1452 | if (np->type != 0 && strcasecmp(np->type, type) == 0) { |
| 1453 | *prevp = np; |
| 1454 | prevp = &np->next; |
| 1455 | } |
| 1456 | } |
| 1457 | *prevp = NULL; |
| 1458 | return head; |
| 1459 | } |
| 1460 | EXPORT_SYMBOL(find_type_devices); |
| 1461 | |
| 1462 | /** |
| 1463 | * Returns all nodes linked together |
| 1464 | */ |
| 1465 | struct device_node *find_all_nodes(void) |
| 1466 | { |
| 1467 | struct device_node *head, **prevp, *np; |
| 1468 | |
| 1469 | prevp = &head; |
| 1470 | for (np = allnodes; np != 0; np = np->allnext) { |
| 1471 | *prevp = np; |
| 1472 | prevp = &np->next; |
| 1473 | } |
| 1474 | *prevp = NULL; |
| 1475 | return head; |
| 1476 | } |
| 1477 | EXPORT_SYMBOL(find_all_nodes); |
| 1478 | |
| 1479 | /** Checks if the given "compat" string matches one of the strings in |
| 1480 | * the device's "compatible" property |
| 1481 | */ |
| 1482 | int device_is_compatible(struct device_node *device, const char *compat) |
| 1483 | { |
| 1484 | const char* cp; |
| 1485 | int cplen, l; |
| 1486 | |
| 1487 | cp = (char *) get_property(device, "compatible", &cplen); |
| 1488 | if (cp == NULL) |
| 1489 | return 0; |
| 1490 | while (cplen > 0) { |
| 1491 | if (strncasecmp(cp, compat, strlen(compat)) == 0) |
| 1492 | return 1; |
| 1493 | l = strlen(cp) + 1; |
| 1494 | cp += l; |
| 1495 | cplen -= l; |
| 1496 | } |
| 1497 | |
| 1498 | return 0; |
| 1499 | } |
| 1500 | EXPORT_SYMBOL(device_is_compatible); |
| 1501 | |
| 1502 | |
| 1503 | /** |
| 1504 | * Indicates whether the root node has a given value in its |
| 1505 | * compatible property. |
| 1506 | */ |
| 1507 | int machine_is_compatible(const char *compat) |
| 1508 | { |
| 1509 | struct device_node *root; |
| 1510 | int rc = 0; |
| 1511 | |
| 1512 | root = of_find_node_by_path("/"); |
| 1513 | if (root) { |
| 1514 | rc = device_is_compatible(root, compat); |
| 1515 | of_node_put(root); |
| 1516 | } |
| 1517 | return rc; |
| 1518 | } |
| 1519 | EXPORT_SYMBOL(machine_is_compatible); |
| 1520 | |
| 1521 | /** |
| 1522 | * Construct and return a list of the device_nodes with a given type |
| 1523 | * and compatible property. |
| 1524 | */ |
| 1525 | struct device_node *find_compatible_devices(const char *type, |
| 1526 | const char *compat) |
| 1527 | { |
| 1528 | struct device_node *head, **prevp, *np; |
| 1529 | |
| 1530 | prevp = &head; |
| 1531 | for (np = allnodes; np != 0; np = np->allnext) { |
| 1532 | if (type != NULL |
| 1533 | && !(np->type != 0 && strcasecmp(np->type, type) == 0)) |
| 1534 | continue; |
| 1535 | if (device_is_compatible(np, compat)) { |
| 1536 | *prevp = np; |
| 1537 | prevp = &np->next; |
| 1538 | } |
| 1539 | } |
| 1540 | *prevp = NULL; |
| 1541 | return head; |
| 1542 | } |
| 1543 | EXPORT_SYMBOL(find_compatible_devices); |
| 1544 | |
| 1545 | /** |
| 1546 | * Find the device_node with a given full_name. |
| 1547 | */ |
| 1548 | struct device_node *find_path_device(const char *path) |
| 1549 | { |
| 1550 | struct device_node *np; |
| 1551 | |
| 1552 | for (np = allnodes; np != 0; np = np->allnext) |
| 1553 | if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0) |
| 1554 | return np; |
| 1555 | return NULL; |
| 1556 | } |
| 1557 | EXPORT_SYMBOL(find_path_device); |
| 1558 | |
| 1559 | /******* |
| 1560 | * |
| 1561 | * New implementation of the OF "find" APIs, return a refcounted |
| 1562 | * object, call of_node_put() when done. The device tree and list |
| 1563 | * are protected by a rw_lock. |
| 1564 | * |
| 1565 | * Note that property management will need some locking as well, |
| 1566 | * this isn't dealt with yet. |
| 1567 | * |
| 1568 | *******/ |
| 1569 | |
| 1570 | /** |
| 1571 | * of_find_node_by_name - Find a node by its "name" property |
| 1572 | * @from: The node to start searching from or NULL, the node |
| 1573 | * you pass will not be searched, only the next one |
| 1574 | * will; typically, you pass what the previous call |
| 1575 | * returned. of_node_put() will be called on it |
| 1576 | * @name: The name string to match against |
| 1577 | * |
| 1578 | * Returns a node pointer with refcount incremented, use |
| 1579 | * of_node_put() on it when done. |
| 1580 | */ |
| 1581 | struct device_node *of_find_node_by_name(struct device_node *from, |
| 1582 | const char *name) |
| 1583 | { |
| 1584 | struct device_node *np; |
| 1585 | |
| 1586 | read_lock(&devtree_lock); |
| 1587 | np = from ? from->allnext : allnodes; |
Olaf Hering | 090db7c | 2006-02-04 12:44:56 +0100 | [diff] [blame] | 1588 | for (; np != NULL; np = np->allnext) |
| 1589 | if (np->name != NULL && strcasecmp(np->name, name) == 0 |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1590 | && of_node_get(np)) |
| 1591 | break; |
| 1592 | if (from) |
| 1593 | of_node_put(from); |
| 1594 | read_unlock(&devtree_lock); |
| 1595 | return np; |
| 1596 | } |
| 1597 | EXPORT_SYMBOL(of_find_node_by_name); |
| 1598 | |
| 1599 | /** |
| 1600 | * of_find_node_by_type - Find a node by its "device_type" property |
| 1601 | * @from: The node to start searching from or NULL, the node |
| 1602 | * you pass will not be searched, only the next one |
| 1603 | * will; typically, you pass what the previous call |
| 1604 | * returned. of_node_put() will be called on it |
| 1605 | * @name: The type string to match against |
| 1606 | * |
| 1607 | * Returns a node pointer with refcount incremented, use |
| 1608 | * of_node_put() on it when done. |
| 1609 | */ |
| 1610 | struct device_node *of_find_node_by_type(struct device_node *from, |
| 1611 | const char *type) |
| 1612 | { |
| 1613 | struct device_node *np; |
| 1614 | |
| 1615 | read_lock(&devtree_lock); |
| 1616 | np = from ? from->allnext : allnodes; |
| 1617 | for (; np != 0; np = np->allnext) |
| 1618 | if (np->type != 0 && strcasecmp(np->type, type) == 0 |
| 1619 | && of_node_get(np)) |
| 1620 | break; |
| 1621 | if (from) |
| 1622 | of_node_put(from); |
| 1623 | read_unlock(&devtree_lock); |
| 1624 | return np; |
| 1625 | } |
| 1626 | EXPORT_SYMBOL(of_find_node_by_type); |
| 1627 | |
| 1628 | /** |
| 1629 | * of_find_compatible_node - Find a node based on type and one of the |
| 1630 | * tokens in its "compatible" property |
| 1631 | * @from: The node to start searching from or NULL, the node |
| 1632 | * you pass will not be searched, only the next one |
| 1633 | * will; typically, you pass what the previous call |
| 1634 | * returned. of_node_put() will be called on it |
| 1635 | * @type: The type string to match "device_type" or NULL to ignore |
| 1636 | * @compatible: The string to match to one of the tokens in the device |
| 1637 | * "compatible" list. |
| 1638 | * |
| 1639 | * Returns a node pointer with refcount incremented, use |
| 1640 | * of_node_put() on it when done. |
| 1641 | */ |
| 1642 | struct device_node *of_find_compatible_node(struct device_node *from, |
| 1643 | const char *type, const char *compatible) |
| 1644 | { |
| 1645 | struct device_node *np; |
| 1646 | |
| 1647 | read_lock(&devtree_lock); |
| 1648 | np = from ? from->allnext : allnodes; |
| 1649 | for (; np != 0; np = np->allnext) { |
| 1650 | if (type != NULL |
| 1651 | && !(np->type != 0 && strcasecmp(np->type, type) == 0)) |
| 1652 | continue; |
| 1653 | if (device_is_compatible(np, compatible) && of_node_get(np)) |
| 1654 | break; |
| 1655 | } |
| 1656 | if (from) |
| 1657 | of_node_put(from); |
| 1658 | read_unlock(&devtree_lock); |
| 1659 | return np; |
| 1660 | } |
| 1661 | EXPORT_SYMBOL(of_find_compatible_node); |
| 1662 | |
| 1663 | /** |
| 1664 | * of_find_node_by_path - Find a node matching a full OF path |
| 1665 | * @path: The full path to match |
| 1666 | * |
| 1667 | * Returns a node pointer with refcount incremented, use |
| 1668 | * of_node_put() on it when done. |
| 1669 | */ |
| 1670 | struct device_node *of_find_node_by_path(const char *path) |
| 1671 | { |
| 1672 | struct device_node *np = allnodes; |
| 1673 | |
| 1674 | read_lock(&devtree_lock); |
| 1675 | for (; np != 0; np = np->allnext) { |
| 1676 | if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0 |
| 1677 | && of_node_get(np)) |
| 1678 | break; |
| 1679 | } |
| 1680 | read_unlock(&devtree_lock); |
| 1681 | return np; |
| 1682 | } |
| 1683 | EXPORT_SYMBOL(of_find_node_by_path); |
| 1684 | |
| 1685 | /** |
| 1686 | * of_find_node_by_phandle - Find a node given a phandle |
| 1687 | * @handle: phandle of the node to find |
| 1688 | * |
| 1689 | * Returns a node pointer with refcount incremented, use |
| 1690 | * of_node_put() on it when done. |
| 1691 | */ |
| 1692 | struct device_node *of_find_node_by_phandle(phandle handle) |
| 1693 | { |
| 1694 | struct device_node *np; |
| 1695 | |
| 1696 | read_lock(&devtree_lock); |
| 1697 | for (np = allnodes; np != 0; np = np->allnext) |
| 1698 | if (np->linux_phandle == handle) |
| 1699 | break; |
| 1700 | if (np) |
| 1701 | of_node_get(np); |
| 1702 | read_unlock(&devtree_lock); |
| 1703 | return np; |
| 1704 | } |
| 1705 | EXPORT_SYMBOL(of_find_node_by_phandle); |
| 1706 | |
| 1707 | /** |
| 1708 | * of_find_all_nodes - Get next node in global list |
| 1709 | * @prev: Previous node or NULL to start iteration |
| 1710 | * of_node_put() will be called on it |
| 1711 | * |
| 1712 | * Returns a node pointer with refcount incremented, use |
| 1713 | * of_node_put() on it when done. |
| 1714 | */ |
| 1715 | struct device_node *of_find_all_nodes(struct device_node *prev) |
| 1716 | { |
| 1717 | struct device_node *np; |
| 1718 | |
| 1719 | read_lock(&devtree_lock); |
| 1720 | np = prev ? prev->allnext : allnodes; |
| 1721 | for (; np != 0; np = np->allnext) |
| 1722 | if (of_node_get(np)) |
| 1723 | break; |
| 1724 | if (prev) |
| 1725 | of_node_put(prev); |
| 1726 | read_unlock(&devtree_lock); |
| 1727 | return np; |
| 1728 | } |
| 1729 | EXPORT_SYMBOL(of_find_all_nodes); |
| 1730 | |
| 1731 | /** |
| 1732 | * of_get_parent - Get a node's parent if any |
| 1733 | * @node: Node to get parent |
| 1734 | * |
| 1735 | * Returns a node pointer with refcount incremented, use |
| 1736 | * of_node_put() on it when done. |
| 1737 | */ |
| 1738 | struct device_node *of_get_parent(const struct device_node *node) |
| 1739 | { |
| 1740 | struct device_node *np; |
| 1741 | |
| 1742 | if (!node) |
| 1743 | return NULL; |
| 1744 | |
| 1745 | read_lock(&devtree_lock); |
| 1746 | np = of_node_get(node->parent); |
| 1747 | read_unlock(&devtree_lock); |
| 1748 | return np; |
| 1749 | } |
| 1750 | EXPORT_SYMBOL(of_get_parent); |
| 1751 | |
| 1752 | /** |
| 1753 | * of_get_next_child - Iterate a node childs |
| 1754 | * @node: parent node |
| 1755 | * @prev: previous child of the parent node, or NULL to get first |
| 1756 | * |
| 1757 | * Returns a node pointer with refcount incremented, use |
| 1758 | * of_node_put() on it when done. |
| 1759 | */ |
| 1760 | struct device_node *of_get_next_child(const struct device_node *node, |
| 1761 | struct device_node *prev) |
| 1762 | { |
| 1763 | struct device_node *next; |
| 1764 | |
| 1765 | read_lock(&devtree_lock); |
| 1766 | next = prev ? prev->sibling : node->child; |
| 1767 | for (; next != 0; next = next->sibling) |
| 1768 | if (of_node_get(next)) |
| 1769 | break; |
| 1770 | if (prev) |
| 1771 | of_node_put(prev); |
| 1772 | read_unlock(&devtree_lock); |
| 1773 | return next; |
| 1774 | } |
| 1775 | EXPORT_SYMBOL(of_get_next_child); |
| 1776 | |
| 1777 | /** |
| 1778 | * of_node_get - Increment refcount of a node |
| 1779 | * @node: Node to inc refcount, NULL is supported to |
| 1780 | * simplify writing of callers |
| 1781 | * |
| 1782 | * Returns node. |
| 1783 | */ |
| 1784 | struct device_node *of_node_get(struct device_node *node) |
| 1785 | { |
| 1786 | if (node) |
| 1787 | kref_get(&node->kref); |
| 1788 | return node; |
| 1789 | } |
| 1790 | EXPORT_SYMBOL(of_node_get); |
| 1791 | |
| 1792 | static inline struct device_node * kref_to_device_node(struct kref *kref) |
| 1793 | { |
| 1794 | return container_of(kref, struct device_node, kref); |
| 1795 | } |
| 1796 | |
| 1797 | /** |
| 1798 | * of_node_release - release a dynamically allocated node |
| 1799 | * @kref: kref element of the node to be released |
| 1800 | * |
| 1801 | * In of_node_put() this function is passed to kref_put() |
| 1802 | * as the destructor. |
| 1803 | */ |
| 1804 | static void of_node_release(struct kref *kref) |
| 1805 | { |
| 1806 | struct device_node *node = kref_to_device_node(kref); |
| 1807 | struct property *prop = node->properties; |
| 1808 | |
| 1809 | if (!OF_IS_DYNAMIC(node)) |
| 1810 | return; |
| 1811 | while (prop) { |
| 1812 | struct property *next = prop->next; |
| 1813 | kfree(prop->name); |
| 1814 | kfree(prop->value); |
| 1815 | kfree(prop); |
| 1816 | prop = next; |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 1817 | |
| 1818 | if (!prop) { |
| 1819 | prop = node->deadprops; |
| 1820 | node->deadprops = NULL; |
| 1821 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1822 | } |
| 1823 | kfree(node->intrs); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1824 | kfree(node->full_name); |
| 1825 | kfree(node->data); |
| 1826 | kfree(node); |
| 1827 | } |
| 1828 | |
| 1829 | /** |
| 1830 | * of_node_put - Decrement refcount of a node |
| 1831 | * @node: Node to dec refcount, NULL is supported to |
| 1832 | * simplify writing of callers |
| 1833 | * |
| 1834 | */ |
| 1835 | void of_node_put(struct device_node *node) |
| 1836 | { |
| 1837 | if (node) |
| 1838 | kref_put(&node->kref, of_node_release); |
| 1839 | } |
| 1840 | EXPORT_SYMBOL(of_node_put); |
| 1841 | |
| 1842 | /* |
| 1843 | * Plug a device node into the tree and global list. |
| 1844 | */ |
| 1845 | void of_attach_node(struct device_node *np) |
| 1846 | { |
| 1847 | write_lock(&devtree_lock); |
| 1848 | np->sibling = np->parent->child; |
| 1849 | np->allnext = allnodes; |
| 1850 | np->parent->child = np; |
| 1851 | allnodes = np; |
| 1852 | write_unlock(&devtree_lock); |
| 1853 | } |
| 1854 | |
| 1855 | /* |
| 1856 | * "Unplug" a node from the device tree. The caller must hold |
| 1857 | * a reference to the node. The memory associated with the node |
| 1858 | * is not freed until its refcount goes to zero. |
| 1859 | */ |
| 1860 | void of_detach_node(const struct device_node *np) |
| 1861 | { |
| 1862 | struct device_node *parent; |
| 1863 | |
| 1864 | write_lock(&devtree_lock); |
| 1865 | |
| 1866 | parent = np->parent; |
| 1867 | |
| 1868 | if (allnodes == np) |
| 1869 | allnodes = np->allnext; |
| 1870 | else { |
| 1871 | struct device_node *prev; |
| 1872 | for (prev = allnodes; |
| 1873 | prev->allnext != np; |
| 1874 | prev = prev->allnext) |
| 1875 | ; |
| 1876 | prev->allnext = np->allnext; |
| 1877 | } |
| 1878 | |
| 1879 | if (parent->child == np) |
| 1880 | parent->child = np->sibling; |
| 1881 | else { |
| 1882 | struct device_node *prevsib; |
| 1883 | for (prevsib = np->parent->child; |
| 1884 | prevsib->sibling != np; |
| 1885 | prevsib = prevsib->sibling) |
| 1886 | ; |
| 1887 | prevsib->sibling = np->sibling; |
| 1888 | } |
| 1889 | |
| 1890 | write_unlock(&devtree_lock); |
| 1891 | } |
| 1892 | |
| 1893 | #ifdef CONFIG_PPC_PSERIES |
| 1894 | /* |
| 1895 | * Fix up the uninitialized fields in a new device node: |
| 1896 | * name, type, n_addrs, addrs, n_intrs, intrs, and pci-specific fields |
| 1897 | * |
| 1898 | * A lot of boot-time code is duplicated here, because functions such |
| 1899 | * as finish_node_interrupts, interpret_pci_props, etc. cannot use the |
| 1900 | * slab allocator. |
| 1901 | * |
| 1902 | * This should probably be split up into smaller chunks. |
| 1903 | */ |
| 1904 | |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 1905 | static int of_finish_dynamic_node(struct device_node *node) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1906 | { |
| 1907 | struct device_node *parent = of_get_parent(node); |
| 1908 | int err = 0; |
| 1909 | phandle *ibm_phandle; |
| 1910 | |
| 1911 | node->name = get_property(node, "name", NULL); |
| 1912 | node->type = get_property(node, "device_type", NULL); |
| 1913 | |
| 1914 | if (!parent) { |
| 1915 | err = -ENODEV; |
| 1916 | goto out; |
| 1917 | } |
| 1918 | |
| 1919 | /* We don't support that function on PowerMac, at least |
| 1920 | * not yet |
| 1921 | */ |
Benjamin Herrenschmidt | e822250 | 2006-03-28 23:15:54 +1100 | [diff] [blame] | 1922 | if (machine_is(powermac)) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1923 | return -ENODEV; |
| 1924 | |
| 1925 | /* fix up new node's linux_phandle field */ |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 1926 | if ((ibm_phandle = (unsigned int *)get_property(node, |
| 1927 | "ibm,phandle", NULL))) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1928 | node->linux_phandle = *ibm_phandle; |
| 1929 | |
| 1930 | out: |
| 1931 | of_node_put(parent); |
| 1932 | return err; |
| 1933 | } |
| 1934 | |
| 1935 | static int prom_reconfig_notifier(struct notifier_block *nb, |
| 1936 | unsigned long action, void *node) |
| 1937 | { |
| 1938 | int err; |
| 1939 | |
| 1940 | switch (action) { |
| 1941 | case PSERIES_RECONFIG_ADD: |
Benjamin Herrenschmidt | cc5d018 | 2005-12-13 18:01:21 +1100 | [diff] [blame] | 1942 | err = of_finish_dynamic_node(node); |
| 1943 | if (!err) |
| 1944 | finish_node(node, NULL, 0); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1945 | if (err < 0) { |
| 1946 | printk(KERN_ERR "finish_node returned %d\n", err); |
| 1947 | err = NOTIFY_BAD; |
| 1948 | } |
| 1949 | break; |
| 1950 | default: |
| 1951 | err = NOTIFY_DONE; |
| 1952 | break; |
| 1953 | } |
| 1954 | return err; |
| 1955 | } |
| 1956 | |
| 1957 | static struct notifier_block prom_reconfig_nb = { |
| 1958 | .notifier_call = prom_reconfig_notifier, |
| 1959 | .priority = 10, /* This one needs to run first */ |
| 1960 | }; |
| 1961 | |
| 1962 | static int __init prom_reconfig_setup(void) |
| 1963 | { |
| 1964 | return pSeries_reconfig_notifier_register(&prom_reconfig_nb); |
| 1965 | } |
| 1966 | __initcall(prom_reconfig_setup); |
| 1967 | #endif |
| 1968 | |
Dave C Boutcher | ecaa8b0 | 2006-01-12 16:09:29 -0600 | [diff] [blame] | 1969 | struct property *of_find_property(struct device_node *np, const char *name, |
| 1970 | int *lenp) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1971 | { |
| 1972 | struct property *pp; |
| 1973 | |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 1974 | read_lock(&devtree_lock); |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1975 | for (pp = np->properties; pp != 0; pp = pp->next) |
| 1976 | if (strcmp(pp->name, name) == 0) { |
| 1977 | if (lenp != 0) |
| 1978 | *lenp = pp->length; |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 1979 | break; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1980 | } |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 1981 | read_unlock(&devtree_lock); |
| 1982 | |
Dave C Boutcher | ecaa8b0 | 2006-01-12 16:09:29 -0600 | [diff] [blame] | 1983 | return pp; |
| 1984 | } |
| 1985 | |
| 1986 | /* |
| 1987 | * Find a property with a given name for a given node |
| 1988 | * and return the value. |
| 1989 | */ |
| 1990 | unsigned char *get_property(struct device_node *np, const char *name, |
| 1991 | int *lenp) |
| 1992 | { |
| 1993 | struct property *pp = of_find_property(np,name,lenp); |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 1994 | return pp ? pp->value : NULL; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 1995 | } |
| 1996 | EXPORT_SYMBOL(get_property); |
| 1997 | |
| 1998 | /* |
| 1999 | * Add a property to a node |
| 2000 | */ |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2001 | int prom_add_property(struct device_node* np, struct property* prop) |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2002 | { |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2003 | struct property **next; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2004 | |
| 2005 | prop->next = NULL; |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2006 | write_lock(&devtree_lock); |
| 2007 | next = &np->properties; |
| 2008 | while (*next) { |
| 2009 | if (strcmp(prop->name, (*next)->name) == 0) { |
| 2010 | /* duplicate ! don't insert it */ |
| 2011 | write_unlock(&devtree_lock); |
| 2012 | return -1; |
| 2013 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2014 | next = &(*next)->next; |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2015 | } |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2016 | *next = prop; |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2017 | write_unlock(&devtree_lock); |
| 2018 | |
Paul Mackerras | 799d604 | 2005-11-10 13:37:51 +1100 | [diff] [blame] | 2019 | #ifdef CONFIG_PROC_DEVICETREE |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2020 | /* try to add to proc as well if it was initialized */ |
| 2021 | if (np->pde) |
| 2022 | proc_device_tree_add_prop(np->pde, prop); |
Paul Mackerras | 799d604 | 2005-11-10 13:37:51 +1100 | [diff] [blame] | 2023 | #endif /* CONFIG_PROC_DEVICETREE */ |
Benjamin Herrenschmidt | 183d020 | 2005-11-07 14:29:02 +1100 | [diff] [blame] | 2024 | |
| 2025 | return 0; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2026 | } |
| 2027 | |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 2028 | /* |
| 2029 | * Remove a property from a node. Note that we don't actually |
| 2030 | * remove it, since we have given out who-knows-how-many pointers |
| 2031 | * to the data using get-property. Instead we just move the property |
| 2032 | * to the "dead properties" list, so it won't be found any more. |
| 2033 | */ |
| 2034 | int prom_remove_property(struct device_node *np, struct property *prop) |
| 2035 | { |
| 2036 | struct property **next; |
| 2037 | int found = 0; |
Paul Mackerras | 9b6b563 | 2005-10-06 12:06:20 +1000 | [diff] [blame] | 2038 | |
Dave C Boutcher | 088186d | 2006-01-12 16:08:27 -0600 | [diff] [blame] | 2039 | write_lock(&devtree_lock); |
| 2040 | next = &np->properties; |
| 2041 | while (*next) { |
| 2042 | if (*next == prop) { |
| 2043 | /* found the node */ |
| 2044 | *next = prop->next; |
| 2045 | prop->next = np->deadprops; |
| 2046 | np->deadprops = prop; |
| 2047 | found = 1; |
| 2048 | break; |
| 2049 | } |
| 2050 | next = &(*next)->next; |
| 2051 | } |
| 2052 | write_unlock(&devtree_lock); |
| 2053 | |
| 2054 | if (!found) |
| 2055 | return -ENODEV; |
| 2056 | |
| 2057 | #ifdef CONFIG_PROC_DEVICETREE |
| 2058 | /* try to remove the proc node as well */ |
| 2059 | if (np->pde) |
| 2060 | proc_device_tree_remove_prop(np->pde, prop); |
| 2061 | #endif /* CONFIG_PROC_DEVICETREE */ |
| 2062 | |
| 2063 | return 0; |
| 2064 | } |
| 2065 | |
| 2066 | /* |
| 2067 | * Update a property in a node. Note that we don't actually |
| 2068 | * remove it, since we have given out who-knows-how-many pointers |
| 2069 | * to the data using get-property. Instead we just move the property |
| 2070 | * to the "dead properties" list, and add the new property to the |
| 2071 | * property list |
| 2072 | */ |
| 2073 | int prom_update_property(struct device_node *np, |
| 2074 | struct property *newprop, |
| 2075 | struct property *oldprop) |
| 2076 | { |
| 2077 | struct property **next; |
| 2078 | int found = 0; |
| 2079 | |
| 2080 | write_lock(&devtree_lock); |
| 2081 | next = &np->properties; |
| 2082 | while (*next) { |
| 2083 | if (*next == oldprop) { |
| 2084 | /* found the node */ |
| 2085 | newprop->next = oldprop->next; |
| 2086 | *next = newprop; |
| 2087 | oldprop->next = np->deadprops; |
| 2088 | np->deadprops = oldprop; |
| 2089 | found = 1; |
| 2090 | break; |
| 2091 | } |
| 2092 | next = &(*next)->next; |
| 2093 | } |
| 2094 | write_unlock(&devtree_lock); |
| 2095 | |
| 2096 | if (!found) |
| 2097 | return -ENODEV; |
| 2098 | |
| 2099 | #ifdef CONFIG_PROC_DEVICETREE |
| 2100 | /* try to add to proc as well if it was initialized */ |
| 2101 | if (np->pde) |
| 2102 | proc_device_tree_update_prop(np->pde, newprop, oldprop); |
| 2103 | #endif /* CONFIG_PROC_DEVICETREE */ |
| 2104 | |
| 2105 | return 0; |
| 2106 | } |
Michael Ellerman | b68239e | 2006-02-03 19:05:47 +1100 | [diff] [blame] | 2107 | |