blob: 6f32bebd8a9b6d74deb4b52bf2c6a65f357ee715 [file] [log] [blame]
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001/*
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>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100019#include <linux/kernel.h>
20#include <linux/string.h>
21#include <linux/init.h>
22#include <linux/threads.h>
23#include <linux/spinlock.h>
24#include <linux/types.h>
25#include <linux/pci.h>
26#include <linux/stringify.h>
27#include <linux/delay.h>
28#include <linux/initrd.h>
29#include <linux/bitops.h>
30#include <linux/module.h>
Michael Ellermandcee3032005-12-04 18:39:48 +110031#include <linux/kexec.h>
Michael Ellerman7a4571a2006-06-23 18:16:03 +100032#include <linux/debugfs.h>
Benjamin Herrenschmidt0ebfff12006-07-03 21:36:01 +100033#include <linux/irq.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100034
35#include <asm/prom.h>
36#include <asm/rtas.h>
37#include <asm/lmb.h>
38#include <asm/page.h>
39#include <asm/processor.h>
40#include <asm/irq.h>
41#include <asm/io.h>
Michael Ellerman0cc47462005-12-04 18:39:37 +110042#include <asm/kdump.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100043#include <asm/smp.h>
44#include <asm/system.h>
45#include <asm/mmu.h>
46#include <asm/pgtable.h>
47#include <asm/pci.h>
48#include <asm/iommu.h>
49#include <asm/btext.h>
50#include <asm/sections.h>
51#include <asm/machdep.h>
52#include <asm/pSeries_reconfig.h>
Paul Mackerras40ef8cb2005-10-10 22:50:37 +100053#include <asm/pci-bridge.h>
Michael Ellerman2babf5c2006-05-17 18:00:46 +100054#include <asm/kexec.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100055
56#ifdef DEBUG
57#define DBG(fmt...) printk(KERN_ERR fmt)
58#else
59#define DBG(fmt...)
60#endif
61
Paul Mackerras9b6b5632005-10-06 12:06:20 +100062
Paul Mackerras9b6b5632005-10-06 12:06:20 +100063static int __initdata dt_root_addr_cells;
64static int __initdata dt_root_size_cells;
65
66#ifdef CONFIG_PPC64
Olof Johansson28897732006-04-12 21:52:33 -050067int __initdata iommu_is_off;
Paul Mackerras9b6b5632005-10-06 12:06:20 +100068int __initdata iommu_force_on;
Paul Mackerrascf00a8d2005-10-31 13:07:02 +110069unsigned long tce_alloc_start, tce_alloc_end;
Paul Mackerras9b6b5632005-10-06 12:06:20 +100070#endif
71
72typedef u32 cell_t;
73
74#if 0
75static struct boot_param_header *initial_boot_params __initdata;
76#else
77struct boot_param_header *initial_boot_params;
78#endif
79
80static struct device_node *allnodes = NULL;
81
82/* use when traversing tree through the allnext, child, sibling,
83 * or parent members of struct device_node.
84 */
85static DEFINE_RWLOCK(devtree_lock);
86
87/* export that to outside world */
88struct device_node *of_chosen;
89
Paul Mackerras9b6b5632005-10-06 12:06:20 +100090static inline char *find_flat_dt_string(u32 offset)
91{
92 return ((char *)initial_boot_params) +
93 initial_boot_params->off_dt_strings + offset;
94}
95
96/**
97 * This function is used to scan the flattened device-tree, it is
98 * used to extract the memory informations at boot before we can
99 * unflatten the tree
100 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100101int __init of_scan_flat_dt(int (*it)(unsigned long node,
102 const char *uname, int depth,
103 void *data),
104 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000105{
106 unsigned long p = ((unsigned long)initial_boot_params) +
107 initial_boot_params->off_dt_struct;
108 int rc = 0;
109 int depth = -1;
110
111 do {
112 u32 tag = *((u32 *)p);
113 char *pathp;
114
115 p += 4;
116 if (tag == OF_DT_END_NODE) {
117 depth --;
118 continue;
119 }
120 if (tag == OF_DT_NOP)
121 continue;
122 if (tag == OF_DT_END)
123 break;
124 if (tag == OF_DT_PROP) {
125 u32 sz = *((u32 *)p);
126 p += 8;
127 if (initial_boot_params->version < 0x10)
128 p = _ALIGN(p, sz >= 8 ? 8 : 4);
129 p += sz;
130 p = _ALIGN(p, 4);
131 continue;
132 }
133 if (tag != OF_DT_BEGIN_NODE) {
134 printk(KERN_WARNING "Invalid tag %x scanning flattened"
135 " device tree !\n", tag);
136 return -EINVAL;
137 }
138 depth++;
139 pathp = (char *)p;
140 p = _ALIGN(p + strlen(pathp) + 1, 4);
141 if ((*pathp) == '/') {
142 char *lp, *np;
143 for (lp = NULL, np = pathp; *np; np++)
144 if ((*np) == '/')
145 lp = np+1;
146 if (lp != NULL)
147 pathp = lp;
148 }
149 rc = it(p, pathp, depth, data);
150 if (rc != 0)
151 break;
152 } while(1);
153
154 return rc;
155}
156
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100157unsigned long __init of_get_flat_dt_root(void)
158{
159 unsigned long p = ((unsigned long)initial_boot_params) +
160 initial_boot_params->off_dt_struct;
161
162 while(*((u32 *)p) == OF_DT_NOP)
163 p += 4;
164 BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE);
165 p += 4;
166 return _ALIGN(p + strlen((char *)p) + 1, 4);
167}
168
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000169/**
170 * This function can be used within scan_flattened_dt callback to get
171 * access to properties
172 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100173void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
174 unsigned long *size)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000175{
176 unsigned long p = node;
177
178 do {
179 u32 tag = *((u32 *)p);
180 u32 sz, noff;
181 const char *nstr;
182
183 p += 4;
184 if (tag == OF_DT_NOP)
185 continue;
186 if (tag != OF_DT_PROP)
187 return NULL;
188
189 sz = *((u32 *)p);
190 noff = *((u32 *)(p + 4));
191 p += 8;
192 if (initial_boot_params->version < 0x10)
193 p = _ALIGN(p, sz >= 8 ? 8 : 4);
194
195 nstr = find_flat_dt_string(noff);
196 if (nstr == NULL) {
197 printk(KERN_WARNING "Can't find property index"
198 " name !\n");
199 return NULL;
200 }
201 if (strcmp(name, nstr) == 0) {
202 if (size)
203 *size = sz;
204 return (void *)p;
205 }
206 p += sz;
207 p = _ALIGN(p, 4);
208 } while(1);
209}
210
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100211int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
212{
213 const char* cp;
214 unsigned long cplen, l;
215
216 cp = of_get_flat_dt_prop(node, "compatible", &cplen);
217 if (cp == NULL)
218 return 0;
219 while (cplen > 0) {
220 if (strncasecmp(cp, compat, strlen(compat)) == 0)
221 return 1;
222 l = strlen(cp) + 1;
223 cp += l;
224 cplen -= l;
225 }
226
227 return 0;
228}
229
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000230static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
231 unsigned long align)
232{
233 void *res;
234
235 *mem = _ALIGN(*mem, align);
236 res = (void *)*mem;
237 *mem += size;
238
239 return res;
240}
241
242static unsigned long __init unflatten_dt_node(unsigned long mem,
243 unsigned long *p,
244 struct device_node *dad,
245 struct device_node ***allnextpp,
246 unsigned long fpsize)
247{
248 struct device_node *np;
249 struct property *pp, **prev_pp = NULL;
250 char *pathp;
251 u32 tag;
252 unsigned int l, allocl;
253 int has_name = 0;
254 int new_format = 0;
255
256 tag = *((u32 *)(*p));
257 if (tag != OF_DT_BEGIN_NODE) {
258 printk("Weird tag at start of node: %x\n", tag);
259 return mem;
260 }
261 *p += 4;
262 pathp = (char *)*p;
263 l = allocl = strlen(pathp) + 1;
264 *p = _ALIGN(*p + l, 4);
265
266 /* version 0x10 has a more compact unit name here instead of the full
267 * path. we accumulate the full path size using "fpsize", we'll rebuild
268 * it later. We detect this because the first character of the name is
269 * not '/'.
270 */
271 if ((*pathp) != '/') {
272 new_format = 1;
273 if (fpsize == 0) {
274 /* root node: special case. fpsize accounts for path
275 * plus terminating zero. root node only has '/', so
276 * fpsize should be 2, but we want to avoid the first
277 * level nodes to have two '/' so we use fpsize 1 here
278 */
279 fpsize = 1;
280 allocl = 2;
281 } else {
282 /* account for '/' and path size minus terminal 0
283 * already in 'l'
284 */
285 fpsize += l;
286 allocl = fpsize;
287 }
288 }
289
290
291 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
292 __alignof__(struct device_node));
293 if (allnextpp) {
294 memset(np, 0, sizeof(*np));
295 np->full_name = ((char*)np) + sizeof(struct device_node);
296 if (new_format) {
297 char *p = np->full_name;
298 /* rebuild full path for new format */
299 if (dad && dad->parent) {
300 strcpy(p, dad->full_name);
301#ifdef DEBUG
302 if ((strlen(p) + l + 1) != allocl) {
303 DBG("%s: p: %d, l: %d, a: %d\n",
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100304 pathp, (int)strlen(p), l, allocl);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000305 }
306#endif
307 p += strlen(p);
308 }
309 *(p++) = '/';
310 memcpy(p, pathp, l);
311 } else
312 memcpy(np->full_name, pathp, l);
313 prev_pp = &np->properties;
314 **allnextpp = np;
315 *allnextpp = &np->allnext;
316 if (dad != NULL) {
317 np->parent = dad;
318 /* we temporarily use the next field as `last_child'*/
319 if (dad->next == 0)
320 dad->child = np;
321 else
322 dad->next->sibling = np;
323 dad->next = np;
324 }
325 kref_init(&np->kref);
326 }
327 while(1) {
328 u32 sz, noff;
329 char *pname;
330
331 tag = *((u32 *)(*p));
332 if (tag == OF_DT_NOP) {
333 *p += 4;
334 continue;
335 }
336 if (tag != OF_DT_PROP)
337 break;
338 *p += 4;
339 sz = *((u32 *)(*p));
340 noff = *((u32 *)((*p) + 4));
341 *p += 8;
342 if (initial_boot_params->version < 0x10)
343 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
344
345 pname = find_flat_dt_string(noff);
346 if (pname == NULL) {
347 printk("Can't find property name in list !\n");
348 break;
349 }
350 if (strcmp(pname, "name") == 0)
351 has_name = 1;
352 l = strlen(pname) + 1;
353 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
354 __alignof__(struct property));
355 if (allnextpp) {
356 if (strcmp(pname, "linux,phandle") == 0) {
357 np->node = *((u32 *)*p);
358 if (np->linux_phandle == 0)
359 np->linux_phandle = np->node;
360 }
361 if (strcmp(pname, "ibm,phandle") == 0)
362 np->linux_phandle = *((u32 *)*p);
363 pp->name = pname;
364 pp->length = sz;
365 pp->value = (void *)*p;
366 *prev_pp = pp;
367 prev_pp = &pp->next;
368 }
369 *p = _ALIGN((*p) + sz, 4);
370 }
371 /* with version 0x10 we may not have the name property, recreate
372 * it here from the unit name if absent
373 */
374 if (!has_name) {
375 char *p = pathp, *ps = pathp, *pa = NULL;
376 int sz;
377
378 while (*p) {
379 if ((*p) == '@')
380 pa = p;
381 if ((*p) == '/')
382 ps = p + 1;
383 p++;
384 }
385 if (pa < ps)
386 pa = p;
387 sz = (pa - ps) + 1;
388 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
389 __alignof__(struct property));
390 if (allnextpp) {
391 pp->name = "name";
392 pp->length = sz;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000393 pp->value = pp + 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000394 *prev_pp = pp;
395 prev_pp = &pp->next;
396 memcpy(pp->value, ps, sz - 1);
397 ((char *)pp->value)[sz - 1] = 0;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000398 DBG("fixed up name for %s -> %s\n", pathp,
399 (char *)pp->value);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000400 }
401 }
402 if (allnextpp) {
403 *prev_pp = NULL;
Stephen Rothwell0e56efc2007-04-03 10:54:01 +1000404 np->name = of_get_property(np, "name", NULL);
405 np->type = of_get_property(np, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000406
407 if (!np->name)
408 np->name = "<NULL>";
409 if (!np->type)
410 np->type = "<NULL>";
411 }
412 while (tag == OF_DT_BEGIN_NODE) {
413 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
414 tag = *((u32 *)(*p));
415 }
416 if (tag != OF_DT_END_NODE) {
417 printk("Weird tag at end of node: %x\n", tag);
418 return mem;
419 }
420 *p += 4;
421 return mem;
422}
423
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000424static int __init early_parse_mem(char *p)
425{
426 if (!p)
427 return 1;
428
429 memory_limit = PAGE_ALIGN(memparse(p, &p));
430 DBG("memory limit = 0x%lx\n", memory_limit);
431
432 return 0;
433}
434early_param("mem", early_parse_mem);
435
436/*
437 * The device tree may be allocated below our memory limit, or inside the
438 * crash kernel region for kdump. If so, move it out now.
439 */
440static void move_device_tree(void)
441{
442 unsigned long start, size;
443 void *p;
444
445 DBG("-> move_device_tree\n");
446
447 start = __pa(initial_boot_params);
448 size = initial_boot_params->totalsize;
449
450 if ((memory_limit && (start + size) > memory_limit) ||
451 overlaps_crashkernel(start, size)) {
452 p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size));
453 memcpy(p, initial_boot_params, size);
454 initial_boot_params = (struct boot_param_header *)p;
455 DBG("Moved device tree to 0x%p\n", p);
456 }
457
458 DBG("<- move_device_tree\n");
459}
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000460
461/**
462 * unflattens the device-tree passed by the firmware, creating the
463 * tree of struct device_node. It also fills the "name" and "type"
464 * pointers of the nodes so the normal device-tree walking functions
465 * can be used (this used to be done by finish_device_tree)
466 */
467void __init unflatten_device_tree(void)
468{
469 unsigned long start, mem, size;
470 struct device_node **allnextp = &allnodes;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000471
472 DBG(" -> unflatten_device_tree()\n");
473
474 /* First pass, scan for size */
475 start = ((unsigned long)initial_boot_params) +
476 initial_boot_params->off_dt_struct;
477 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
478 size = (size | 3) + 1;
479
480 DBG(" size is %lx, allocating...\n", size);
481
482 /* Allocate memory for the expanded device tree */
483 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000484 mem = (unsigned long) __va(mem);
485
486 ((u32 *)mem)[size / 4] = 0xdeadbeef;
487
488 DBG(" unflattening %lx...\n", mem);
489
490 /* Second pass, do actual unflattening */
491 start = ((unsigned long)initial_boot_params) +
492 initial_boot_params->off_dt_struct;
493 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
494 if (*((u32 *)start) != OF_DT_END)
495 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
496 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
497 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
498 ((u32 *)mem)[size / 4] );
499 *allnextp = NULL;
500
501 /* Get pointer to OF "/chosen" node for use everywhere */
502 of_chosen = of_find_node_by_path("/chosen");
Paul Mackerrasa575b802005-10-23 17:23:21 +1000503 if (of_chosen == NULL)
504 of_chosen = of_find_node_by_path("/chosen@0");
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000505
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000506 DBG(" <- unflatten_device_tree()\n");
507}
508
Paul Mackerrasd2058192006-05-03 23:04:37 +1000509/*
510 * ibm,pa-features is a per-cpu property that contains a string of
511 * attribute descriptors, each of which has a 2 byte header plus up
512 * to 254 bytes worth of processor attribute bits. First header
513 * byte specifies the number of bytes following the header.
514 * Second header byte is an "attribute-specifier" type, of which
515 * zero is the only currently-defined value.
516 * Implementation: Pass in the byte and bit offset for the feature
517 * that we are interested in. The function will return -1 if the
518 * pa-features property is missing, or a 1/0 to indicate if the feature
519 * is supported/not supported. Note that the bit numbers are
520 * big-endian to match the definition in PAPR.
521 */
522static struct ibm_pa_feature {
523 unsigned long cpu_features; /* CPU_FTR_xxx bit */
524 unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */
525 unsigned char pabyte; /* byte number in ibm,pa-features */
526 unsigned char pabit; /* bit number (big-endian) */
527 unsigned char invert; /* if 1, pa bit set => clear feature */
528} ibm_pa_features[] __initdata = {
529 {0, PPC_FEATURE_HAS_MMU, 0, 0, 0},
530 {0, PPC_FEATURE_HAS_FPU, 0, 1, 0},
531 {CPU_FTR_SLB, 0, 0, 2, 0},
532 {CPU_FTR_CTRL, 0, 0, 3, 0},
533 {CPU_FTR_NOEXECUTE, 0, 0, 6, 0},
534 {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1},
Paul Mackerrasbf72aeb2006-06-15 10:45:18 +1000535#if 0
536 /* put this back once we know how to test if firmware does 64k IO */
Paul Mackerrasd2058192006-05-03 23:04:37 +1000537 {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0},
Paul Mackerrasbf72aeb2006-06-15 10:45:18 +1000538#endif
Paul Mackerras339d76c2006-06-29 17:12:30 +1000539 {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0},
Paul Mackerrasd2058192006-05-03 23:04:37 +1000540};
541
Paul Mackerras974a76f2006-11-10 20:38:53 +1100542static void __init scan_features(unsigned long node, unsigned char *ftrs,
543 unsigned long tablelen,
544 struct ibm_pa_feature *fp,
545 unsigned long ft_size)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000546{
Paul Mackerras974a76f2006-11-10 20:38:53 +1100547 unsigned long i, len, bit;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000548
549 /* find descriptor with type == 0 */
550 for (;;) {
551 if (tablelen < 3)
552 return;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100553 len = 2 + ftrs[0];
Paul Mackerrasd2058192006-05-03 23:04:37 +1000554 if (tablelen < len)
555 return; /* descriptor 0 not found */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100556 if (ftrs[1] == 0)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000557 break;
558 tablelen -= len;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100559 ftrs += len;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000560 }
561
562 /* loop over bits we know about */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100563 for (i = 0; i < ft_size; ++i, ++fp) {
564 if (fp->pabyte >= ftrs[0])
Paul Mackerrasd2058192006-05-03 23:04:37 +1000565 continue;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100566 bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000567 if (bit ^ fp->invert) {
568 cur_cpu_spec->cpu_features |= fp->cpu_features;
569 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs;
570 } else {
571 cur_cpu_spec->cpu_features &= ~fp->cpu_features;
572 cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs;
573 }
574 }
575}
576
Paul Mackerras974a76f2006-11-10 20:38:53 +1100577static void __init check_cpu_pa_features(unsigned long node)
578{
579 unsigned char *pa_ftrs;
580 unsigned long tablelen;
581
582 pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen);
583 if (pa_ftrs == NULL)
584 return;
585
586 scan_features(node, pa_ftrs, tablelen,
587 ibm_pa_features, ARRAY_SIZE(ibm_pa_features));
588}
589
590static struct feature_property {
591 const char *name;
592 u32 min_value;
593 unsigned long cpu_feature;
594 unsigned long cpu_user_ftr;
595} feature_properties[] __initdata = {
596#ifdef CONFIG_ALTIVEC
597 {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
598 {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
599#endif /* CONFIG_ALTIVEC */
600#ifdef CONFIG_PPC64
601 {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP},
602 {"ibm,purr", 1, CPU_FTR_PURR, 0},
603 {"ibm,spurr", 1, CPU_FTR_SPURR, 0},
604#endif /* CONFIG_PPC64 */
605};
606
607static void __init check_cpu_feature_properties(unsigned long node)
608{
609 unsigned long i;
610 struct feature_property *fp = feature_properties;
611 const u32 *prop;
612
613 for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) {
614 prop = of_get_flat_dt_prop(node, fp->name, NULL);
615 if (prop && *prop >= fp->min_value) {
616 cur_cpu_spec->cpu_features |= fp->cpu_feature;
617 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr;
618 }
619 }
620}
621
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000622static int __init early_init_dt_scan_cpus(unsigned long node,
Anton Blanchard4df20462006-03-25 17:25:17 +1100623 const char *uname, int depth,
624 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000625{
Anton Blanchard4df20462006-03-25 17:25:17 +1100626 static int logical_cpuid = 0;
627 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100628 const u32 *prop;
629 const u32 *intserv;
Anton Blanchard4df20462006-03-25 17:25:17 +1100630 int i, nthreads;
631 unsigned long len;
632 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000633
634 /* We are scanning "cpu" nodes only */
635 if (type == NULL || strcmp(type, "cpu") != 0)
636 return 0;
637
Anton Blanchard4df20462006-03-25 17:25:17 +1100638 /* Get physical cpuid */
639 intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len);
640 if (intserv) {
641 nthreads = len / sizeof(int);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000642 } else {
Anton Blanchard4df20462006-03-25 17:25:17 +1100643 intserv = of_get_flat_dt_prop(node, "reg", NULL);
644 nthreads = 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000645 }
Anton Blanchard4df20462006-03-25 17:25:17 +1100646
647 /*
648 * Now see if any of these threads match our boot cpu.
649 * NOTE: This must match the parsing done in smp_setup_cpu_maps.
650 */
651 for (i = 0; i < nthreads; i++) {
652 /*
653 * version 2 of the kexec param format adds the phys cpuid of
654 * booted proc.
655 */
656 if (initial_boot_params && initial_boot_params->version >= 2) {
657 if (intserv[i] ==
658 initial_boot_params->boot_cpuid_phys) {
659 found = 1;
660 break;
661 }
662 } else {
663 /*
664 * Check if it's the boot-cpu, set it's hw index now,
665 * unfortunately this format did not support booting
666 * off secondary threads.
667 */
668 if (of_get_flat_dt_prop(node,
669 "linux,boot-cpu", NULL) != NULL) {
670 found = 1;
671 break;
672 }
673 }
674
675#ifdef CONFIG_SMP
676 /* logical cpu id is always 0 on UP kernels */
677 logical_cpuid++;
678#endif
679 }
680
681 if (found) {
682 DBG("boot cpu: logical %d physical %d\n", logical_cpuid,
683 intserv[i]);
684 boot_cpuid = logical_cpuid;
685 set_hard_smp_processor_id(boot_cpuid, intserv[i]);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100686
687 /*
688 * PAPR defines "logical" PVR values for cpus that
689 * meet various levels of the architecture:
690 * 0x0f000001 Architecture version 2.04
691 * 0x0f000002 Architecture version 2.05
692 * If the cpu-version property in the cpu node contains
693 * such a value, we call identify_cpu again with the
694 * logical PVR value in order to use the cpu feature
695 * bits appropriate for the architecture level.
696 *
697 * A POWER6 partition in "POWER6 architected" mode
698 * uses the 0x0f000002 PVR value; in POWER5+ mode
699 * it uses 0x0f000001.
700 */
701 prop = of_get_flat_dt_prop(node, "cpu-version", NULL);
702 if (prop && (*prop & 0xff000000) == 0x0f000000)
703 identify_cpu(0, *prop);
Anton Blanchard4df20462006-03-25 17:25:17 +1100704 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000705
Paul Mackerras974a76f2006-11-10 20:38:53 +1100706 check_cpu_feature_properties(node);
Paul Mackerrasd2058192006-05-03 23:04:37 +1000707 check_cpu_pa_features(node);
708
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000709#ifdef CONFIG_PPC_PSERIES
Anton Blanchard4df20462006-03-25 17:25:17 +1100710 if (nthreads > 1)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000711 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
Anton Blanchard4df20462006-03-25 17:25:17 +1100712 else
713 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000714#endif
715
716 return 0;
717}
718
Michael Ellerman40472a52007-05-10 17:06:30 +1000719#ifdef CONFIG_BLK_DEV_INITRD
720static void __init early_init_dt_check_for_initrd(unsigned long node)
721{
722 unsigned long l;
723 u32 *prop;
724
725 DBG("Looking for initrd properties... ");
726
727 prop = of_get_flat_dt_prop(node, "linux,initrd-start", &l);
728 if (prop) {
729 initrd_start = (unsigned long)__va(of_read_ulong(prop, l/4));
730
731 prop = of_get_flat_dt_prop(node, "linux,initrd-end", &l);
732 if (prop) {
733 initrd_end = (unsigned long)
734 __va(of_read_ulong(prop, l/4));
735 initrd_below_start_ok = 1;
736 } else {
737 initrd_start = 0;
738 }
739 }
740
741 DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end);
742}
743#else
744static inline void early_init_dt_check_for_initrd(unsigned long node)
745{
746}
747#endif /* CONFIG_BLK_DEV_INITRD */
748
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000749static int __init early_init_dt_scan_chosen(unsigned long node,
750 const char *uname, int depth, void *data)
751{
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000752 unsigned long *lprop;
Kumar Gala329dda02006-02-24 10:54:52 -0600753 unsigned long l;
754 char *p;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000755
756 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
757
Paul Mackerrasa575b802005-10-23 17:23:21 +1000758 if (depth != 1 ||
759 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000760 return 0;
761
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000762#ifdef CONFIG_PPC64
763 /* check if iommu is forced on or off */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100764 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000765 iommu_is_off = 1;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100766 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000767 iommu_force_on = 1;
768#endif
769
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000770 /* mem=x on the command line is the preferred mechanism */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100771 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000772 if (lprop)
773 memory_limit = *lprop;
774
775#ifdef CONFIG_PPC64
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100776 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000777 if (lprop)
778 tce_alloc_start = *lprop;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100779 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000780 if (lprop)
781 tce_alloc_end = *lprop;
782#endif
783
Michael Ellermandcee3032005-12-04 18:39:48 +1100784#ifdef CONFIG_KEXEC
785 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL);
786 if (lprop)
787 crashk_res.start = *lprop;
788
789 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL);
790 if (lprop)
791 crashk_res.end = crashk_res.start + *lprop - 1;
792#endif
793
Michael Ellerman40472a52007-05-10 17:06:30 +1000794 early_init_dt_check_for_initrd(node);
David Gibson30437b32007-02-28 14:12:29 +1100795
Kumar Gala329dda02006-02-24 10:54:52 -0600796 /* Retreive command line */
797 p = of_get_flat_dt_prop(node, "bootargs", &l);
798 if (p != NULL && l > 0)
799 strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE));
800
801#ifdef CONFIG_CMDLINE
Geoff Levandc1ce4642006-10-05 11:35:16 -0700802 if (p == NULL || l == 0 || (l == 1 && (*p) == 0))
Kumar Gala329dda02006-02-24 10:54:52 -0600803 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
804#endif /* CONFIG_CMDLINE */
805
806 DBG("Command line is: %s\n", cmd_line);
807
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000808 /* break now */
809 return 1;
810}
811
812static int __init early_init_dt_scan_root(unsigned long node,
813 const char *uname, int depth, void *data)
814{
815 u32 *prop;
816
817 if (depth != 0)
818 return 0;
819
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100820 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000821 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
822 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
823
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100824 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000825 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
826 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
827
828 /* break now */
829 return 1;
830}
831
832static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
833{
834 cell_t *p = *cellp;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000835
Paul Mackerrasa4dc7ff2006-09-19 14:06:27 +1000836 *cellp = p + s;
837 return of_read_ulong(p, s);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000838}
839
Paul Mackerras02045682006-11-29 22:27:42 +1100840#ifdef CONFIG_PPC_PSERIES
841/*
842 * Interpret the ibm,dynamic-memory property in the
843 * /ibm,dynamic-reconfiguration-memory node.
844 * This contains a list of memory blocks along with NUMA affinity
845 * information.
846 */
847static int __init early_init_dt_scan_drconf_memory(unsigned long node)
848{
849 cell_t *dm, *ls;
850 unsigned long l, n;
851 unsigned long base, size, lmb_size, flags;
852
853 ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l);
854 if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t))
855 return 0;
856 lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls);
857
858 dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l);
859 if (dm == NULL || l < sizeof(cell_t))
860 return 0;
861
862 n = *dm++; /* number of entries */
863 if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t))
864 return 0;
865
866 for (; n != 0; --n) {
867 base = dt_mem_next_cell(dt_root_addr_cells, &dm);
868 flags = dm[3];
869 /* skip DRC index, pad, assoc. list index, flags */
870 dm += 4;
871 /* skip this block if the reserved bit is set in flags (0x80)
872 or if the block is not assigned to this partition (0x8) */
873 if ((flags & 0x80) || !(flags & 0x8))
874 continue;
875 size = lmb_size;
876 if (iommu_is_off) {
877 if (base >= 0x80000000ul)
878 continue;
879 if ((base + size) > 0x80000000ul)
880 size = 0x80000000ul - base;
881 }
882 lmb_add(base, size);
883 }
884 lmb_dump_all();
885 return 0;
886}
887#else
888#define early_init_dt_scan_drconf_memory(node) 0
889#endif /* CONFIG_PPC_PSERIES */
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000890
891static int __init early_init_dt_scan_memory(unsigned long node,
892 const char *uname, int depth, void *data)
893{
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100894 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000895 cell_t *reg, *endp;
896 unsigned long l;
897
Paul Mackerras02045682006-11-29 22:27:42 +1100898 /* Look for the ibm,dynamic-reconfiguration-memory node */
899 if (depth == 1 &&
900 strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0)
901 return early_init_dt_scan_drconf_memory(node);
902
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000903 /* We are scanning "memory" nodes only */
Paul Mackerrasa23414b2005-11-10 12:00:55 +1100904 if (type == NULL) {
905 /*
906 * The longtrail doesn't have a device_type on the
907 * /memory node, so look for the node called /memory@0.
908 */
909 if (depth != 1 || strcmp(uname, "memory@0") != 0)
910 return 0;
911 } else if (strcmp(type, "memory") != 0)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000912 return 0;
913
Michael Ellermanba759482005-12-04 18:39:55 +1100914 reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l);
915 if (reg == NULL)
916 reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000917 if (reg == NULL)
918 return 0;
919
920 endp = reg + (l / sizeof(cell_t));
921
Michael Ellerman358c86f2005-11-03 15:39:09 +1100922 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000923 uname, l, reg[0], reg[1], reg[2], reg[3]);
924
925 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
926 unsigned long base, size;
927
928 base = dt_mem_next_cell(dt_root_addr_cells, &reg);
929 size = dt_mem_next_cell(dt_root_size_cells, &reg);
930
931 if (size == 0)
932 continue;
933 DBG(" - %lx , %lx\n", base, size);
934#ifdef CONFIG_PPC64
935 if (iommu_is_off) {
936 if (base >= 0x80000000ul)
937 continue;
938 if ((base + size) > 0x80000000ul)
939 size = 0x80000000ul - base;
940 }
941#endif
942 lmb_add(base, size);
943 }
944 return 0;
945}
946
947static void __init early_reserve_mem(void)
948{
Kumar Galacbbcf342006-01-11 17:57:13 -0600949 u64 base, size;
950 u64 *reserve_map;
Jon Loeliger8a300882006-06-17 17:51:09 -0500951 unsigned long self_base;
952 unsigned long self_size;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000953
Kumar Galacbbcf342006-01-11 17:57:13 -0600954 reserve_map = (u64 *)(((unsigned long)initial_boot_params) +
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000955 initial_boot_params->off_mem_rsvmap);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500956
957 /* before we do anything, lets reserve the dt blob */
Jon Loeliger8a300882006-06-17 17:51:09 -0500958 self_base = __pa((unsigned long)initial_boot_params);
959 self_size = initial_boot_params->totalsize;
960 lmb_reserve(self_base, self_size);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500961
David Gibson30437b32007-02-28 14:12:29 +1100962#ifdef CONFIG_BLK_DEV_INITRD
963 /* then reserve the initrd, if any */
964 if (initrd_start && (initrd_end > initrd_start))
965 lmb_reserve(__pa(initrd_start), initrd_end - initrd_start);
966#endif /* CONFIG_BLK_DEV_INITRD */
967
Kumar Galacbbcf342006-01-11 17:57:13 -0600968#ifdef CONFIG_PPC32
969 /*
970 * Handle the case where we might be booting from an old kexec
971 * image that setup the mem_rsvmap as pairs of 32-bit values
972 */
973 if (*reserve_map > 0xffffffffull) {
974 u32 base_32, size_32;
975 u32 *reserve_map_32 = (u32 *)reserve_map;
976
977 while (1) {
978 base_32 = *(reserve_map_32++);
979 size_32 = *(reserve_map_32++);
980 if (size_32 == 0)
981 break;
Jon Loeliger8a300882006-06-17 17:51:09 -0500982 /* skip if the reservation is for the blob */
983 if (base_32 == self_base && size_32 == self_size)
984 continue;
Kumar Gala329dda02006-02-24 10:54:52 -0600985 DBG("reserving: %x -> %x\n", base_32, size_32);
Kumar Galacbbcf342006-01-11 17:57:13 -0600986 lmb_reserve(base_32, size_32);
987 }
988 return;
989 }
990#endif
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000991 while (1) {
992 base = *(reserve_map++);
993 size = *(reserve_map++);
994 if (size == 0)
995 break;
Kumar Galacbbcf342006-01-11 17:57:13 -0600996 DBG("reserving: %llx -> %llx\n", base, size);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000997 lmb_reserve(base, size);
998 }
999
1000#if 0
1001 DBG("memory reserved, lmbs :\n");
1002 lmb_dump_all();
1003#endif
1004}
1005
1006void __init early_init_devtree(void *params)
1007{
Geoff Levand44348102007-06-16 08:06:14 +10001008 DBG(" -> early_init_devtree(%p)\n", params);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001009
1010 /* Setup flat device-tree pointer */
1011 initial_boot_params = params;
1012
Michael Ellerman458148c2006-06-23 18:20:13 +10001013#ifdef CONFIG_PPC_RTAS
1014 /* Some machines might need RTAS info for debugging, grab it now. */
1015 of_scan_flat_dt(early_init_dt_scan_rtas, NULL);
1016#endif
1017
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001018 /* Retrieve various informations from the /chosen node of the
1019 * device-tree, including the platform type, initrd location and
1020 * size, TCE reserve, and more ...
1021 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001022 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001023
1024 /* Scan memory nodes and rebuild LMBs */
1025 lmb_init();
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001026 of_scan_flat_dt(early_init_dt_scan_root, NULL);
1027 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001028
1029 /* Save command line for /proc/cmdline and then parse parameters */
Alon Bar-Levb8757b22007-02-12 00:54:17 -08001030 strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001031 parse_early_param();
1032
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001033 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
Michael Ellerman0cc47462005-12-04 18:39:37 +11001034 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
Michael Ellerman47310412006-05-17 18:00:49 +10001035 reserve_kdump_trampoline();
Michael Ellerman35dd5432006-05-18 11:16:11 +10001036 reserve_crashkernel();
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001037 early_reserve_mem();
1038
Michael Ellerman2babf5c2006-05-17 18:00:46 +10001039 lmb_enforce_memory_limit(memory_limit);
1040 lmb_analyze();
1041
1042 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1043
1044 /* We may need to relocate the flat tree, do it now.
1045 * FIXME .. and the initrd too? */
1046 move_device_tree();
1047
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001048 DBG("Scanning CPUs ...\n");
1049
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001050 /* Retreive CPU related informations from the flat tree
1051 * (altivec support, boot CPU ID, ...)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001052 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001053 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001054
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001055 DBG(" <- early_init_devtree()\n");
1056}
1057
1058#undef printk
1059
Stephen Rothwella8bda5d2007-04-03 10:56:50 +10001060int of_n_addr_cells(struct device_node* np)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001061{
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001062 const int *ip;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001063 do {
1064 if (np->parent)
1065 np = np->parent;
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001066 ip = of_get_property(np, "#address-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001067 if (ip != NULL)
1068 return *ip;
1069 } while (np->parent);
1070 /* No #address-cells property for the root node, default to 1 */
1071 return 1;
1072}
Stephen Rothwella8bda5d2007-04-03 10:56:50 +10001073EXPORT_SYMBOL(of_n_addr_cells);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001074
Stephen Rothwell9213fee2007-04-03 10:57:48 +10001075int of_n_size_cells(struct device_node* np)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001076{
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001077 const int* ip;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001078 do {
1079 if (np->parent)
1080 np = np->parent;
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001081 ip = of_get_property(np, "#size-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001082 if (ip != NULL)
1083 return *ip;
1084 } while (np->parent);
1085 /* No #size-cells property for the root node, default to 1 */
1086 return 1;
1087}
Stephen Rothwell9213fee2007-04-03 10:57:48 +10001088EXPORT_SYMBOL(of_n_size_cells);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001089
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001090/** Checks if the given "compat" string matches one of the strings in
1091 * the device's "compatible" property
1092 */
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001093int of_device_is_compatible(const struct device_node *device,
1094 const char *compat)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001095{
1096 const char* cp;
1097 int cplen, l;
1098
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001099 cp = of_get_property(device, "compatible", &cplen);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001100 if (cp == NULL)
1101 return 0;
1102 while (cplen > 0) {
1103 if (strncasecmp(cp, compat, strlen(compat)) == 0)
1104 return 1;
1105 l = strlen(cp) + 1;
1106 cp += l;
1107 cplen -= l;
1108 }
1109
1110 return 0;
1111}
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001112EXPORT_SYMBOL(of_device_is_compatible);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001113
1114
1115/**
1116 * Indicates whether the root node has a given value in its
1117 * compatible property.
1118 */
1119int machine_is_compatible(const char *compat)
1120{
1121 struct device_node *root;
1122 int rc = 0;
1123
1124 root = of_find_node_by_path("/");
1125 if (root) {
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001126 rc = of_device_is_compatible(root, compat);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001127 of_node_put(root);
1128 }
1129 return rc;
1130}
1131EXPORT_SYMBOL(machine_is_compatible);
1132
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001133/*******
1134 *
1135 * New implementation of the OF "find" APIs, return a refcounted
1136 * object, call of_node_put() when done. The device tree and list
1137 * are protected by a rw_lock.
1138 *
1139 * Note that property management will need some locking as well,
1140 * this isn't dealt with yet.
1141 *
1142 *******/
1143
1144/**
1145 * of_find_node_by_name - Find a node by its "name" property
1146 * @from: The node to start searching from or NULL, the node
1147 * you pass will not be searched, only the next one
1148 * will; typically, you pass what the previous call
1149 * returned. of_node_put() will be called on it
1150 * @name: The name string to match against
1151 *
1152 * Returns a node pointer with refcount incremented, use
1153 * of_node_put() on it when done.
1154 */
1155struct device_node *of_find_node_by_name(struct device_node *from,
1156 const char *name)
1157{
1158 struct device_node *np;
1159
1160 read_lock(&devtree_lock);
1161 np = from ? from->allnext : allnodes;
Olaf Hering090db7c2006-02-04 12:44:56 +01001162 for (; np != NULL; np = np->allnext)
1163 if (np->name != NULL && strcasecmp(np->name, name) == 0
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001164 && of_node_get(np))
1165 break;
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001166 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001167 read_unlock(&devtree_lock);
1168 return np;
1169}
1170EXPORT_SYMBOL(of_find_node_by_name);
1171
1172/**
1173 * of_find_node_by_type - Find a node by its "device_type" property
Michael Ellerman5169b8a2007-05-23 18:08:13 +10001174 * @from: The node to start searching from, or NULL to start searching
1175 * the entire device tree. The node you pass will not be
1176 * searched, only the next one will; typically, you pass
1177 * what the previous call returned. of_node_put() will be
1178 * called on from for you.
1179 * @type: The type string to match against
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001180 *
1181 * Returns a node pointer with refcount incremented, use
1182 * of_node_put() on it when done.
1183 */
1184struct device_node *of_find_node_by_type(struct device_node *from,
1185 const char *type)
1186{
1187 struct device_node *np;
1188
1189 read_lock(&devtree_lock);
1190 np = from ? from->allnext : allnodes;
1191 for (; np != 0; np = np->allnext)
1192 if (np->type != 0 && strcasecmp(np->type, type) == 0
1193 && of_node_get(np))
1194 break;
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001195 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001196 read_unlock(&devtree_lock);
1197 return np;
1198}
1199EXPORT_SYMBOL(of_find_node_by_type);
1200
1201/**
1202 * of_find_compatible_node - Find a node based on type and one of the
1203 * tokens in its "compatible" property
1204 * @from: The node to start searching from or NULL, the node
1205 * you pass will not be searched, only the next one
1206 * will; typically, you pass what the previous call
1207 * returned. of_node_put() will be called on it
1208 * @type: The type string to match "device_type" or NULL to ignore
1209 * @compatible: The string to match to one of the tokens in the device
1210 * "compatible" list.
1211 *
1212 * Returns a node pointer with refcount incremented, use
1213 * of_node_put() on it when done.
1214 */
1215struct device_node *of_find_compatible_node(struct device_node *from,
1216 const char *type, const char *compatible)
1217{
1218 struct device_node *np;
1219
1220 read_lock(&devtree_lock);
1221 np = from ? from->allnext : allnodes;
1222 for (; np != 0; np = np->allnext) {
1223 if (type != NULL
1224 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1225 continue;
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001226 if (of_device_is_compatible(np, compatible) && of_node_get(np))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001227 break;
1228 }
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001229 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001230 read_unlock(&devtree_lock);
1231 return np;
1232}
1233EXPORT_SYMBOL(of_find_compatible_node);
1234
1235/**
1236 * of_find_node_by_path - Find a node matching a full OF path
1237 * @path: The full path to match
1238 *
1239 * Returns a node pointer with refcount incremented, use
1240 * of_node_put() on it when done.
1241 */
1242struct device_node *of_find_node_by_path(const char *path)
1243{
1244 struct device_node *np = allnodes;
1245
1246 read_lock(&devtree_lock);
1247 for (; np != 0; np = np->allnext) {
1248 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1249 && of_node_get(np))
1250 break;
1251 }
1252 read_unlock(&devtree_lock);
1253 return np;
1254}
1255EXPORT_SYMBOL(of_find_node_by_path);
1256
1257/**
1258 * of_find_node_by_phandle - Find a node given a phandle
1259 * @handle: phandle of the node to find
1260 *
1261 * Returns a node pointer with refcount incremented, use
1262 * of_node_put() on it when done.
1263 */
1264struct device_node *of_find_node_by_phandle(phandle handle)
1265{
1266 struct device_node *np;
1267
1268 read_lock(&devtree_lock);
1269 for (np = allnodes; np != 0; np = np->allnext)
1270 if (np->linux_phandle == handle)
1271 break;
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001272 of_node_get(np);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001273 read_unlock(&devtree_lock);
1274 return np;
1275}
1276EXPORT_SYMBOL(of_find_node_by_phandle);
1277
1278/**
1279 * of_find_all_nodes - Get next node in global list
1280 * @prev: Previous node or NULL to start iteration
1281 * of_node_put() will be called on it
1282 *
1283 * Returns a node pointer with refcount incremented, use
1284 * of_node_put() on it when done.
1285 */
1286struct device_node *of_find_all_nodes(struct device_node *prev)
1287{
1288 struct device_node *np;
1289
1290 read_lock(&devtree_lock);
1291 np = prev ? prev->allnext : allnodes;
1292 for (; np != 0; np = np->allnext)
1293 if (of_node_get(np))
1294 break;
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001295 of_node_put(prev);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001296 read_unlock(&devtree_lock);
1297 return np;
1298}
1299EXPORT_SYMBOL(of_find_all_nodes);
1300
1301/**
1302 * of_get_parent - Get a node's parent if any
1303 * @node: Node to get parent
1304 *
1305 * Returns a node pointer with refcount incremented, use
1306 * of_node_put() on it when done.
1307 */
1308struct device_node *of_get_parent(const struct device_node *node)
1309{
1310 struct device_node *np;
1311
1312 if (!node)
1313 return NULL;
1314
1315 read_lock(&devtree_lock);
1316 np = of_node_get(node->parent);
1317 read_unlock(&devtree_lock);
1318 return np;
1319}
1320EXPORT_SYMBOL(of_get_parent);
1321
1322/**
1323 * of_get_next_child - Iterate a node childs
1324 * @node: parent node
1325 * @prev: previous child of the parent node, or NULL to get first
1326 *
1327 * Returns a node pointer with refcount incremented, use
1328 * of_node_put() on it when done.
1329 */
1330struct device_node *of_get_next_child(const struct device_node *node,
1331 struct device_node *prev)
1332{
1333 struct device_node *next;
1334
1335 read_lock(&devtree_lock);
1336 next = prev ? prev->sibling : node->child;
1337 for (; next != 0; next = next->sibling)
1338 if (of_node_get(next))
1339 break;
Mariusz Kozlowskib13740512007-01-02 12:31:47 +01001340 of_node_put(prev);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001341 read_unlock(&devtree_lock);
1342 return next;
1343}
1344EXPORT_SYMBOL(of_get_next_child);
1345
1346/**
1347 * of_node_get - Increment refcount of a node
1348 * @node: Node to inc refcount, NULL is supported to
1349 * simplify writing of callers
1350 *
1351 * Returns node.
1352 */
1353struct device_node *of_node_get(struct device_node *node)
1354{
1355 if (node)
1356 kref_get(&node->kref);
1357 return node;
1358}
1359EXPORT_SYMBOL(of_node_get);
1360
1361static inline struct device_node * kref_to_device_node(struct kref *kref)
1362{
1363 return container_of(kref, struct device_node, kref);
1364}
1365
1366/**
1367 * of_node_release - release a dynamically allocated node
1368 * @kref: kref element of the node to be released
1369 *
1370 * In of_node_put() this function is passed to kref_put()
1371 * as the destructor.
1372 */
1373static void of_node_release(struct kref *kref)
1374{
1375 struct device_node *node = kref_to_device_node(kref);
1376 struct property *prop = node->properties;
1377
1378 if (!OF_IS_DYNAMIC(node))
1379 return;
1380 while (prop) {
1381 struct property *next = prop->next;
1382 kfree(prop->name);
1383 kfree(prop->value);
1384 kfree(prop);
1385 prop = next;
Dave C Boutcher088186d2006-01-12 16:08:27 -06001386
1387 if (!prop) {
1388 prop = node->deadprops;
1389 node->deadprops = NULL;
1390 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001391 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001392 kfree(node->full_name);
1393 kfree(node->data);
1394 kfree(node);
1395}
1396
1397/**
1398 * of_node_put - Decrement refcount of a node
1399 * @node: Node to dec refcount, NULL is supported to
1400 * simplify writing of callers
1401 *
1402 */
1403void of_node_put(struct device_node *node)
1404{
1405 if (node)
1406 kref_put(&node->kref, of_node_release);
1407}
1408EXPORT_SYMBOL(of_node_put);
1409
1410/*
1411 * Plug a device node into the tree and global list.
1412 */
1413void of_attach_node(struct device_node *np)
1414{
1415 write_lock(&devtree_lock);
1416 np->sibling = np->parent->child;
1417 np->allnext = allnodes;
1418 np->parent->child = np;
1419 allnodes = np;
1420 write_unlock(&devtree_lock);
1421}
1422
1423/*
1424 * "Unplug" a node from the device tree. The caller must hold
1425 * a reference to the node. The memory associated with the node
1426 * is not freed until its refcount goes to zero.
1427 */
1428void of_detach_node(const struct device_node *np)
1429{
1430 struct device_node *parent;
1431
1432 write_lock(&devtree_lock);
1433
1434 parent = np->parent;
1435
1436 if (allnodes == np)
1437 allnodes = np->allnext;
1438 else {
1439 struct device_node *prev;
1440 for (prev = allnodes;
1441 prev->allnext != np;
1442 prev = prev->allnext)
1443 ;
1444 prev->allnext = np->allnext;
1445 }
1446
1447 if (parent->child == np)
1448 parent->child = np->sibling;
1449 else {
1450 struct device_node *prevsib;
1451 for (prevsib = np->parent->child;
1452 prevsib->sibling != np;
1453 prevsib = prevsib->sibling)
1454 ;
1455 prevsib->sibling = np->sibling;
1456 }
1457
1458 write_unlock(&devtree_lock);
1459}
1460
1461#ifdef CONFIG_PPC_PSERIES
1462/*
1463 * Fix up the uninitialized fields in a new device node:
Benjamin Herrenschmidt0ebfff12006-07-03 21:36:01 +10001464 * name, type and pci-specific fields
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001465 */
1466
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001467static int of_finish_dynamic_node(struct device_node *node)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001468{
1469 struct device_node *parent = of_get_parent(node);
1470 int err = 0;
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001471 const phandle *ibm_phandle;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001472
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001473 node->name = of_get_property(node, "name", NULL);
1474 node->type = of_get_property(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001475
Benjamin Herrenschmidt847f5972007-05-16 16:57:24 +10001476 if (!node->name)
1477 node->name = "<NULL>";
1478 if (!node->type)
1479 node->type = "<NULL>";
1480
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001481 if (!parent) {
1482 err = -ENODEV;
1483 goto out;
1484 }
1485
1486 /* We don't support that function on PowerMac, at least
1487 * not yet
1488 */
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +11001489 if (machine_is(powermac))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001490 return -ENODEV;
1491
1492 /* fix up new node's linux_phandle field */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001493 if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL)))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001494 node->linux_phandle = *ibm_phandle;
1495
1496out:
1497 of_node_put(parent);
1498 return err;
1499}
1500
1501static int prom_reconfig_notifier(struct notifier_block *nb,
1502 unsigned long action, void *node)
1503{
1504 int err;
1505
1506 switch (action) {
1507 case PSERIES_RECONFIG_ADD:
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001508 err = of_finish_dynamic_node(node);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001509 if (err < 0) {
1510 printk(KERN_ERR "finish_node returned %d\n", err);
1511 err = NOTIFY_BAD;
1512 }
1513 break;
1514 default:
1515 err = NOTIFY_DONE;
1516 break;
1517 }
1518 return err;
1519}
1520
1521static struct notifier_block prom_reconfig_nb = {
1522 .notifier_call = prom_reconfig_notifier,
1523 .priority = 10, /* This one needs to run first */
1524};
1525
1526static int __init prom_reconfig_setup(void)
1527{
1528 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1529}
1530__initcall(prom_reconfig_setup);
1531#endif
1532
Benjamin Herrenschmidte2100ef2006-10-20 11:49:54 +10001533struct property *of_find_property(const struct device_node *np,
1534 const char *name,
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001535 int *lenp)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001536{
1537 struct property *pp;
1538
Dave C Boutcher088186d2006-01-12 16:08:27 -06001539 read_lock(&devtree_lock);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001540 for (pp = np->properties; pp != 0; pp = pp->next)
1541 if (strcmp(pp->name, name) == 0) {
1542 if (lenp != 0)
1543 *lenp = pp->length;
Dave C Boutcher088186d2006-01-12 16:08:27 -06001544 break;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001545 }
Dave C Boutcher088186d2006-01-12 16:08:27 -06001546 read_unlock(&devtree_lock);
1547
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001548 return pp;
1549}
Dave Jonesae505172007-02-14 16:54:31 -05001550EXPORT_SYMBOL(of_find_property);
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001551
1552/*
1553 * Find a property with a given name for a given node
1554 * and return the value.
1555 */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001556const void *of_get_property(const struct device_node *np, const char *name,
Benjamin Herrenschmidte2100ef2006-10-20 11:49:54 +10001557 int *lenp)
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001558{
1559 struct property *pp = of_find_property(np,name,lenp);
Dave C Boutcher088186d2006-01-12 16:08:27 -06001560 return pp ? pp->value : NULL;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001561}
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001562EXPORT_SYMBOL(of_get_property);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001563
1564/*
1565 * Add a property to a node
1566 */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001567int prom_add_property(struct device_node* np, struct property* prop)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001568{
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001569 struct property **next;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001570
1571 prop->next = NULL;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001572 write_lock(&devtree_lock);
1573 next = &np->properties;
1574 while (*next) {
1575 if (strcmp(prop->name, (*next)->name) == 0) {
1576 /* duplicate ! don't insert it */
1577 write_unlock(&devtree_lock);
1578 return -1;
1579 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001580 next = &(*next)->next;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001581 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001582 *next = prop;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001583 write_unlock(&devtree_lock);
1584
Paul Mackerras799d6042005-11-10 13:37:51 +11001585#ifdef CONFIG_PROC_DEVICETREE
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001586 /* try to add to proc as well if it was initialized */
1587 if (np->pde)
1588 proc_device_tree_add_prop(np->pde, prop);
Paul Mackerras799d6042005-11-10 13:37:51 +11001589#endif /* CONFIG_PROC_DEVICETREE */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001590
1591 return 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001592}
1593
Dave C Boutcher088186d2006-01-12 16:08:27 -06001594/*
1595 * Remove a property from a node. Note that we don't actually
1596 * remove it, since we have given out who-knows-how-many pointers
1597 * to the data using get-property. Instead we just move the property
1598 * to the "dead properties" list, so it won't be found any more.
1599 */
1600int prom_remove_property(struct device_node *np, struct property *prop)
1601{
1602 struct property **next;
1603 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001604
Dave C Boutcher088186d2006-01-12 16:08:27 -06001605 write_lock(&devtree_lock);
1606 next = &np->properties;
1607 while (*next) {
1608 if (*next == prop) {
1609 /* found the node */
1610 *next = prop->next;
1611 prop->next = np->deadprops;
1612 np->deadprops = prop;
1613 found = 1;
1614 break;
1615 }
1616 next = &(*next)->next;
1617 }
1618 write_unlock(&devtree_lock);
1619
1620 if (!found)
1621 return -ENODEV;
1622
1623#ifdef CONFIG_PROC_DEVICETREE
1624 /* try to remove the proc node as well */
1625 if (np->pde)
1626 proc_device_tree_remove_prop(np->pde, prop);
1627#endif /* CONFIG_PROC_DEVICETREE */
1628
1629 return 0;
1630}
1631
1632/*
1633 * Update a property in a node. Note that we don't actually
1634 * remove it, since we have given out who-knows-how-many pointers
1635 * to the data using get-property. Instead we just move the property
1636 * to the "dead properties" list, and add the new property to the
1637 * property list
1638 */
1639int prom_update_property(struct device_node *np,
1640 struct property *newprop,
1641 struct property *oldprop)
1642{
1643 struct property **next;
1644 int found = 0;
1645
1646 write_lock(&devtree_lock);
1647 next = &np->properties;
1648 while (*next) {
1649 if (*next == oldprop) {
1650 /* found the node */
1651 newprop->next = oldprop->next;
1652 *next = newprop;
1653 oldprop->next = np->deadprops;
1654 np->deadprops = oldprop;
1655 found = 1;
1656 break;
1657 }
1658 next = &(*next)->next;
1659 }
1660 write_unlock(&devtree_lock);
1661
1662 if (!found)
1663 return -ENODEV;
1664
1665#ifdef CONFIG_PROC_DEVICETREE
1666 /* try to add to proc as well if it was initialized */
1667 if (np->pde)
1668 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1669#endif /* CONFIG_PROC_DEVICETREE */
1670
1671 return 0;
1672}
Michael Ellermanb68239e2006-02-03 19:05:47 +11001673
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001674
1675/* Find the device node for a given logical cpu number, also returns the cpu
1676 * local thread number (index in ibm,interrupt-server#s) if relevant and
1677 * asked for (non NULL)
1678 */
1679struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
1680{
1681 int hardid;
1682 struct device_node *np;
1683
1684 hardid = get_hard_smp_processor_id(cpu);
1685
1686 for_each_node_by_type(np, "cpu") {
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001687 const u32 *intserv;
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001688 unsigned int plen, t;
1689
1690 /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist
1691 * fallback to "reg" property and assume no threads
1692 */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001693 intserv = of_get_property(np, "ibm,ppc-interrupt-server#s",
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001694 &plen);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001695 if (intserv == NULL) {
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001696 const u32 *reg = of_get_property(np, "reg", NULL);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001697 if (reg == NULL)
1698 continue;
1699 if (*reg == hardid) {
1700 if (thread)
1701 *thread = 0;
1702 return np;
1703 }
1704 } else {
1705 plen /= sizeof(u32);
1706 for (t = 0; t < plen; t++) {
1707 if (hardid == intserv[t]) {
1708 if (thread)
1709 *thread = t;
1710 return np;
1711 }
1712 }
1713 }
1714 }
1715 return NULL;
1716}
Christian Krafft36ca4ba2006-10-24 18:39:45 +02001717EXPORT_SYMBOL(of_get_cpu_node);
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001718
1719#ifdef DEBUG
1720static struct debugfs_blob_wrapper flat_dt_blob;
1721
1722static int __init export_flat_device_tree(void)
1723{
1724 struct dentry *d;
1725
1726 d = debugfs_create_dir("powerpc", NULL);
1727 if (!d)
1728 return 1;
1729
1730 flat_dt_blob.data = initial_boot_params;
1731 flat_dt_blob.size = initial_boot_params->totalsize;
1732
1733 d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR,
1734 d, &flat_dt_blob);
1735 if (!d)
1736 return 1;
1737
1738 return 0;
1739}
1740__initcall(export_flat_device_tree);
1741#endif