blob: 3f6238d96a5d4eba65284e46dc4ddd49ac82fde1 [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>
Michael Ellerman94a38072007-06-20 10:54:19 +100055#include <asm/system.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100056
57#ifdef DEBUG
58#define DBG(fmt...) printk(KERN_ERR fmt)
59#else
60#define DBG(fmt...)
61#endif
62
Paul Mackerras9b6b5632005-10-06 12:06:20 +100063
Paul Mackerras9b6b5632005-10-06 12:06:20 +100064static int __initdata dt_root_addr_cells;
65static int __initdata dt_root_size_cells;
66
67#ifdef CONFIG_PPC64
Olof Johansson28897732006-04-12 21:52:33 -050068int __initdata iommu_is_off;
Paul Mackerras9b6b5632005-10-06 12:06:20 +100069int __initdata iommu_force_on;
Paul Mackerrascf00a8d2005-10-31 13:07:02 +110070unsigned long tce_alloc_start, tce_alloc_end;
Paul Mackerras9b6b5632005-10-06 12:06:20 +100071#endif
72
73typedef u32 cell_t;
74
75#if 0
76static struct boot_param_header *initial_boot_params __initdata;
77#else
78struct boot_param_header *initial_boot_params;
79#endif
80
81static struct device_node *allnodes = NULL;
82
Stephen Rothwell581b6052007-04-24 16:46:53 +100083extern rwlock_t devtree_lock; /* temporary while merging */
Paul Mackerras9b6b5632005-10-06 12:06:20 +100084
85/* export that to outside world */
86struct device_node *of_chosen;
87
Paul Mackerras9b6b5632005-10-06 12:06:20 +100088static inline char *find_flat_dt_string(u32 offset)
89{
90 return ((char *)initial_boot_params) +
91 initial_boot_params->off_dt_strings + offset;
92}
93
94/**
95 * This function is used to scan the flattened device-tree, it is
96 * used to extract the memory informations at boot before we can
97 * unflatten the tree
98 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110099int __init of_scan_flat_dt(int (*it)(unsigned long node,
100 const char *uname, int depth,
101 void *data),
102 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000103{
104 unsigned long p = ((unsigned long)initial_boot_params) +
105 initial_boot_params->off_dt_struct;
106 int rc = 0;
107 int depth = -1;
108
109 do {
110 u32 tag = *((u32 *)p);
111 char *pathp;
112
113 p += 4;
114 if (tag == OF_DT_END_NODE) {
115 depth --;
116 continue;
117 }
118 if (tag == OF_DT_NOP)
119 continue;
120 if (tag == OF_DT_END)
121 break;
122 if (tag == OF_DT_PROP) {
123 u32 sz = *((u32 *)p);
124 p += 8;
125 if (initial_boot_params->version < 0x10)
126 p = _ALIGN(p, sz >= 8 ? 8 : 4);
127 p += sz;
128 p = _ALIGN(p, 4);
129 continue;
130 }
131 if (tag != OF_DT_BEGIN_NODE) {
132 printk(KERN_WARNING "Invalid tag %x scanning flattened"
133 " device tree !\n", tag);
134 return -EINVAL;
135 }
136 depth++;
137 pathp = (char *)p;
138 p = _ALIGN(p + strlen(pathp) + 1, 4);
139 if ((*pathp) == '/') {
140 char *lp, *np;
141 for (lp = NULL, np = pathp; *np; np++)
142 if ((*np) == '/')
143 lp = np+1;
144 if (lp != NULL)
145 pathp = lp;
146 }
147 rc = it(p, pathp, depth, data);
148 if (rc != 0)
149 break;
150 } while(1);
151
152 return rc;
153}
154
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100155unsigned long __init of_get_flat_dt_root(void)
156{
157 unsigned long p = ((unsigned long)initial_boot_params) +
158 initial_boot_params->off_dt_struct;
159
160 while(*((u32 *)p) == OF_DT_NOP)
161 p += 4;
162 BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE);
163 p += 4;
164 return _ALIGN(p + strlen((char *)p) + 1, 4);
165}
166
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000167/**
168 * This function can be used within scan_flattened_dt callback to get
169 * access to properties
170 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100171void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
172 unsigned long *size)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000173{
174 unsigned long p = node;
175
176 do {
177 u32 tag = *((u32 *)p);
178 u32 sz, noff;
179 const char *nstr;
180
181 p += 4;
182 if (tag == OF_DT_NOP)
183 continue;
184 if (tag != OF_DT_PROP)
185 return NULL;
186
187 sz = *((u32 *)p);
188 noff = *((u32 *)(p + 4));
189 p += 8;
190 if (initial_boot_params->version < 0x10)
191 p = _ALIGN(p, sz >= 8 ? 8 : 4);
192
193 nstr = find_flat_dt_string(noff);
194 if (nstr == NULL) {
195 printk(KERN_WARNING "Can't find property index"
196 " name !\n");
197 return NULL;
198 }
199 if (strcmp(name, nstr) == 0) {
200 if (size)
201 *size = sz;
202 return (void *)p;
203 }
204 p += sz;
205 p = _ALIGN(p, 4);
206 } while(1);
207}
208
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100209int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
210{
211 const char* cp;
212 unsigned long cplen, l;
213
214 cp = of_get_flat_dt_prop(node, "compatible", &cplen);
215 if (cp == NULL)
216 return 0;
217 while (cplen > 0) {
218 if (strncasecmp(cp, compat, strlen(compat)) == 0)
219 return 1;
220 l = strlen(cp) + 1;
221 cp += l;
222 cplen -= l;
223 }
224
225 return 0;
226}
227
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000228static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
229 unsigned long align)
230{
231 void *res;
232
233 *mem = _ALIGN(*mem, align);
234 res = (void *)*mem;
235 *mem += size;
236
237 return res;
238}
239
240static unsigned long __init unflatten_dt_node(unsigned long mem,
241 unsigned long *p,
242 struct device_node *dad,
243 struct device_node ***allnextpp,
244 unsigned long fpsize)
245{
246 struct device_node *np;
247 struct property *pp, **prev_pp = NULL;
248 char *pathp;
249 u32 tag;
250 unsigned int l, allocl;
251 int has_name = 0;
252 int new_format = 0;
253
254 tag = *((u32 *)(*p));
255 if (tag != OF_DT_BEGIN_NODE) {
256 printk("Weird tag at start of node: %x\n", tag);
257 return mem;
258 }
259 *p += 4;
260 pathp = (char *)*p;
261 l = allocl = strlen(pathp) + 1;
262 *p = _ALIGN(*p + l, 4);
263
264 /* version 0x10 has a more compact unit name here instead of the full
265 * path. we accumulate the full path size using "fpsize", we'll rebuild
266 * it later. We detect this because the first character of the name is
267 * not '/'.
268 */
269 if ((*pathp) != '/') {
270 new_format = 1;
271 if (fpsize == 0) {
272 /* root node: special case. fpsize accounts for path
273 * plus terminating zero. root node only has '/', so
274 * fpsize should be 2, but we want to avoid the first
275 * level nodes to have two '/' so we use fpsize 1 here
276 */
277 fpsize = 1;
278 allocl = 2;
279 } else {
280 /* account for '/' and path size minus terminal 0
281 * already in 'l'
282 */
283 fpsize += l;
284 allocl = fpsize;
285 }
286 }
287
288
289 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
290 __alignof__(struct device_node));
291 if (allnextpp) {
292 memset(np, 0, sizeof(*np));
293 np->full_name = ((char*)np) + sizeof(struct device_node);
294 if (new_format) {
295 char *p = np->full_name;
296 /* rebuild full path for new format */
297 if (dad && dad->parent) {
298 strcpy(p, dad->full_name);
299#ifdef DEBUG
300 if ((strlen(p) + l + 1) != allocl) {
301 DBG("%s: p: %d, l: %d, a: %d\n",
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100302 pathp, (int)strlen(p), l, allocl);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000303 }
304#endif
305 p += strlen(p);
306 }
307 *(p++) = '/';
308 memcpy(p, pathp, l);
309 } else
310 memcpy(np->full_name, pathp, l);
311 prev_pp = &np->properties;
312 **allnextpp = np;
313 *allnextpp = &np->allnext;
314 if (dad != NULL) {
315 np->parent = dad;
316 /* we temporarily use the next field as `last_child'*/
317 if (dad->next == 0)
318 dad->child = np;
319 else
320 dad->next->sibling = np;
321 dad->next = np;
322 }
323 kref_init(&np->kref);
324 }
325 while(1) {
326 u32 sz, noff;
327 char *pname;
328
329 tag = *((u32 *)(*p));
330 if (tag == OF_DT_NOP) {
331 *p += 4;
332 continue;
333 }
334 if (tag != OF_DT_PROP)
335 break;
336 *p += 4;
337 sz = *((u32 *)(*p));
338 noff = *((u32 *)((*p) + 4));
339 *p += 8;
340 if (initial_boot_params->version < 0x10)
341 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
342
343 pname = find_flat_dt_string(noff);
344 if (pname == NULL) {
345 printk("Can't find property name in list !\n");
346 break;
347 }
348 if (strcmp(pname, "name") == 0)
349 has_name = 1;
350 l = strlen(pname) + 1;
351 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
352 __alignof__(struct property));
353 if (allnextpp) {
354 if (strcmp(pname, "linux,phandle") == 0) {
355 np->node = *((u32 *)*p);
356 if (np->linux_phandle == 0)
357 np->linux_phandle = np->node;
358 }
359 if (strcmp(pname, "ibm,phandle") == 0)
360 np->linux_phandle = *((u32 *)*p);
361 pp->name = pname;
362 pp->length = sz;
363 pp->value = (void *)*p;
364 *prev_pp = pp;
365 prev_pp = &pp->next;
366 }
367 *p = _ALIGN((*p) + sz, 4);
368 }
369 /* with version 0x10 we may not have the name property, recreate
370 * it here from the unit name if absent
371 */
372 if (!has_name) {
373 char *p = pathp, *ps = pathp, *pa = NULL;
374 int sz;
375
376 while (*p) {
377 if ((*p) == '@')
378 pa = p;
379 if ((*p) == '/')
380 ps = p + 1;
381 p++;
382 }
383 if (pa < ps)
384 pa = p;
385 sz = (pa - ps) + 1;
386 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
387 __alignof__(struct property));
388 if (allnextpp) {
389 pp->name = "name";
390 pp->length = sz;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000391 pp->value = pp + 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000392 *prev_pp = pp;
393 prev_pp = &pp->next;
394 memcpy(pp->value, ps, sz - 1);
395 ((char *)pp->value)[sz - 1] = 0;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000396 DBG("fixed up name for %s -> %s\n", pathp,
397 (char *)pp->value);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000398 }
399 }
400 if (allnextpp) {
401 *prev_pp = NULL;
Stephen Rothwell0e56efc2007-04-03 10:54:01 +1000402 np->name = of_get_property(np, "name", NULL);
403 np->type = of_get_property(np, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000404
405 if (!np->name)
406 np->name = "<NULL>";
407 if (!np->type)
408 np->type = "<NULL>";
409 }
410 while (tag == OF_DT_BEGIN_NODE) {
411 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
412 tag = *((u32 *)(*p));
413 }
414 if (tag != OF_DT_END_NODE) {
415 printk("Weird tag at end of node: %x\n", tag);
416 return mem;
417 }
418 *p += 4;
419 return mem;
420}
421
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000422static int __init early_parse_mem(char *p)
423{
424 if (!p)
425 return 1;
426
427 memory_limit = PAGE_ALIGN(memparse(p, &p));
428 DBG("memory limit = 0x%lx\n", memory_limit);
429
430 return 0;
431}
432early_param("mem", early_parse_mem);
433
434/*
435 * The device tree may be allocated below our memory limit, or inside the
436 * crash kernel region for kdump. If so, move it out now.
437 */
438static void move_device_tree(void)
439{
440 unsigned long start, size;
441 void *p;
442
443 DBG("-> move_device_tree\n");
444
445 start = __pa(initial_boot_params);
446 size = initial_boot_params->totalsize;
447
448 if ((memory_limit && (start + size) > memory_limit) ||
449 overlaps_crashkernel(start, size)) {
450 p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size));
451 memcpy(p, initial_boot_params, size);
452 initial_boot_params = (struct boot_param_header *)p;
453 DBG("Moved device tree to 0x%p\n", p);
454 }
455
456 DBG("<- move_device_tree\n");
457}
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000458
459/**
460 * unflattens the device-tree passed by the firmware, creating the
461 * tree of struct device_node. It also fills the "name" and "type"
462 * pointers of the nodes so the normal device-tree walking functions
463 * can be used (this used to be done by finish_device_tree)
464 */
465void __init unflatten_device_tree(void)
466{
467 unsigned long start, mem, size;
468 struct device_node **allnextp = &allnodes;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000469
470 DBG(" -> unflatten_device_tree()\n");
471
472 /* First pass, scan for size */
473 start = ((unsigned long)initial_boot_params) +
474 initial_boot_params->off_dt_struct;
475 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
476 size = (size | 3) + 1;
477
478 DBG(" size is %lx, allocating...\n", size);
479
480 /* Allocate memory for the expanded device tree */
481 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000482 mem = (unsigned long) __va(mem);
483
484 ((u32 *)mem)[size / 4] = 0xdeadbeef;
485
486 DBG(" unflattening %lx...\n", mem);
487
488 /* Second pass, do actual unflattening */
489 start = ((unsigned long)initial_boot_params) +
490 initial_boot_params->off_dt_struct;
491 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
492 if (*((u32 *)start) != OF_DT_END)
493 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
494 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
495 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
496 ((u32 *)mem)[size / 4] );
497 *allnextp = NULL;
498
499 /* Get pointer to OF "/chosen" node for use everywhere */
500 of_chosen = of_find_node_by_path("/chosen");
Paul Mackerrasa575b802005-10-23 17:23:21 +1000501 if (of_chosen == NULL)
502 of_chosen = of_find_node_by_path("/chosen@0");
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000503
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000504 DBG(" <- unflatten_device_tree()\n");
505}
506
Paul Mackerrasd2058192006-05-03 23:04:37 +1000507/*
508 * ibm,pa-features is a per-cpu property that contains a string of
509 * attribute descriptors, each of which has a 2 byte header plus up
510 * to 254 bytes worth of processor attribute bits. First header
511 * byte specifies the number of bytes following the header.
512 * Second header byte is an "attribute-specifier" type, of which
513 * zero is the only currently-defined value.
514 * Implementation: Pass in the byte and bit offset for the feature
515 * that we are interested in. The function will return -1 if the
516 * pa-features property is missing, or a 1/0 to indicate if the feature
517 * is supported/not supported. Note that the bit numbers are
518 * big-endian to match the definition in PAPR.
519 */
520static struct ibm_pa_feature {
521 unsigned long cpu_features; /* CPU_FTR_xxx bit */
522 unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */
523 unsigned char pabyte; /* byte number in ibm,pa-features */
524 unsigned char pabit; /* bit number (big-endian) */
525 unsigned char invert; /* if 1, pa bit set => clear feature */
526} ibm_pa_features[] __initdata = {
527 {0, PPC_FEATURE_HAS_MMU, 0, 0, 0},
528 {0, PPC_FEATURE_HAS_FPU, 0, 1, 0},
529 {CPU_FTR_SLB, 0, 0, 2, 0},
530 {CPU_FTR_CTRL, 0, 0, 3, 0},
531 {CPU_FTR_NOEXECUTE, 0, 0, 6, 0},
532 {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1},
Paul Mackerrasbf72aeb2006-06-15 10:45:18 +1000533#if 0
534 /* put this back once we know how to test if firmware does 64k IO */
Paul Mackerrasd2058192006-05-03 23:04:37 +1000535 {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0},
Paul Mackerrasbf72aeb2006-06-15 10:45:18 +1000536#endif
Paul Mackerras339d76c2006-06-29 17:12:30 +1000537 {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0},
Paul Mackerrasd2058192006-05-03 23:04:37 +1000538};
539
Paul Mackerras974a76f2006-11-10 20:38:53 +1100540static void __init scan_features(unsigned long node, unsigned char *ftrs,
541 unsigned long tablelen,
542 struct ibm_pa_feature *fp,
543 unsigned long ft_size)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000544{
Paul Mackerras974a76f2006-11-10 20:38:53 +1100545 unsigned long i, len, bit;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000546
547 /* find descriptor with type == 0 */
548 for (;;) {
549 if (tablelen < 3)
550 return;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100551 len = 2 + ftrs[0];
Paul Mackerrasd2058192006-05-03 23:04:37 +1000552 if (tablelen < len)
553 return; /* descriptor 0 not found */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100554 if (ftrs[1] == 0)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000555 break;
556 tablelen -= len;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100557 ftrs += len;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000558 }
559
560 /* loop over bits we know about */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100561 for (i = 0; i < ft_size; ++i, ++fp) {
562 if (fp->pabyte >= ftrs[0])
Paul Mackerrasd2058192006-05-03 23:04:37 +1000563 continue;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100564 bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000565 if (bit ^ fp->invert) {
566 cur_cpu_spec->cpu_features |= fp->cpu_features;
567 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs;
568 } else {
569 cur_cpu_spec->cpu_features &= ~fp->cpu_features;
570 cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs;
571 }
572 }
573}
574
Paul Mackerras974a76f2006-11-10 20:38:53 +1100575static void __init check_cpu_pa_features(unsigned long node)
576{
577 unsigned char *pa_ftrs;
578 unsigned long tablelen;
579
580 pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen);
581 if (pa_ftrs == NULL)
582 return;
583
584 scan_features(node, pa_ftrs, tablelen,
585 ibm_pa_features, ARRAY_SIZE(ibm_pa_features));
586}
587
588static struct feature_property {
589 const char *name;
590 u32 min_value;
591 unsigned long cpu_feature;
592 unsigned long cpu_user_ftr;
593} feature_properties[] __initdata = {
594#ifdef CONFIG_ALTIVEC
595 {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
596 {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
597#endif /* CONFIG_ALTIVEC */
598#ifdef CONFIG_PPC64
599 {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP},
600 {"ibm,purr", 1, CPU_FTR_PURR, 0},
601 {"ibm,spurr", 1, CPU_FTR_SPURR, 0},
602#endif /* CONFIG_PPC64 */
603};
604
605static void __init check_cpu_feature_properties(unsigned long node)
606{
607 unsigned long i;
608 struct feature_property *fp = feature_properties;
609 const u32 *prop;
610
611 for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) {
612 prop = of_get_flat_dt_prop(node, fp->name, NULL);
613 if (prop && *prop >= fp->min_value) {
614 cur_cpu_spec->cpu_features |= fp->cpu_feature;
615 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr;
616 }
617 }
618}
619
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000620static int __init early_init_dt_scan_cpus(unsigned long node,
Anton Blanchard4df20462006-03-25 17:25:17 +1100621 const char *uname, int depth,
622 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000623{
Anton Blanchard4df20462006-03-25 17:25:17 +1100624 static int logical_cpuid = 0;
625 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100626 const u32 *prop;
627 const u32 *intserv;
Anton Blanchard4df20462006-03-25 17:25:17 +1100628 int i, nthreads;
629 unsigned long len;
630 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000631
632 /* We are scanning "cpu" nodes only */
633 if (type == NULL || strcmp(type, "cpu") != 0)
634 return 0;
635
Anton Blanchard4df20462006-03-25 17:25:17 +1100636 /* Get physical cpuid */
637 intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len);
638 if (intserv) {
639 nthreads = len / sizeof(int);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000640 } else {
Anton Blanchard4df20462006-03-25 17:25:17 +1100641 intserv = of_get_flat_dt_prop(node, "reg", NULL);
642 nthreads = 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000643 }
Anton Blanchard4df20462006-03-25 17:25:17 +1100644
645 /*
646 * Now see if any of these threads match our boot cpu.
647 * NOTE: This must match the parsing done in smp_setup_cpu_maps.
648 */
649 for (i = 0; i < nthreads; i++) {
650 /*
651 * version 2 of the kexec param format adds the phys cpuid of
652 * booted proc.
653 */
654 if (initial_boot_params && initial_boot_params->version >= 2) {
655 if (intserv[i] ==
656 initial_boot_params->boot_cpuid_phys) {
657 found = 1;
658 break;
659 }
660 } else {
661 /*
662 * Check if it's the boot-cpu, set it's hw index now,
663 * unfortunately this format did not support booting
664 * off secondary threads.
665 */
666 if (of_get_flat_dt_prop(node,
667 "linux,boot-cpu", NULL) != NULL) {
668 found = 1;
669 break;
670 }
671 }
672
673#ifdef CONFIG_SMP
674 /* logical cpu id is always 0 on UP kernels */
675 logical_cpuid++;
676#endif
677 }
678
679 if (found) {
680 DBG("boot cpu: logical %d physical %d\n", logical_cpuid,
681 intserv[i]);
682 boot_cpuid = logical_cpuid;
683 set_hard_smp_processor_id(boot_cpuid, intserv[i]);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100684
685 /*
686 * PAPR defines "logical" PVR values for cpus that
687 * meet various levels of the architecture:
688 * 0x0f000001 Architecture version 2.04
689 * 0x0f000002 Architecture version 2.05
690 * If the cpu-version property in the cpu node contains
691 * such a value, we call identify_cpu again with the
692 * logical PVR value in order to use the cpu feature
693 * bits appropriate for the architecture level.
694 *
695 * A POWER6 partition in "POWER6 architected" mode
696 * uses the 0x0f000002 PVR value; in POWER5+ mode
697 * it uses 0x0f000001.
698 */
699 prop = of_get_flat_dt_prop(node, "cpu-version", NULL);
700 if (prop && (*prop & 0xff000000) == 0x0f000000)
701 identify_cpu(0, *prop);
Anton Blanchard4df20462006-03-25 17:25:17 +1100702 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000703
Paul Mackerras974a76f2006-11-10 20:38:53 +1100704 check_cpu_feature_properties(node);
Paul Mackerrasd2058192006-05-03 23:04:37 +1000705 check_cpu_pa_features(node);
706
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000707#ifdef CONFIG_PPC_PSERIES
Anton Blanchard4df20462006-03-25 17:25:17 +1100708 if (nthreads > 1)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000709 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
Anton Blanchard4df20462006-03-25 17:25:17 +1100710 else
711 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000712#endif
713
714 return 0;
715}
716
Michael Ellerman40472a52007-05-10 17:06:30 +1000717#ifdef CONFIG_BLK_DEV_INITRD
718static void __init early_init_dt_check_for_initrd(unsigned long node)
719{
720 unsigned long l;
721 u32 *prop;
722
723 DBG("Looking for initrd properties... ");
724
725 prop = of_get_flat_dt_prop(node, "linux,initrd-start", &l);
726 if (prop) {
727 initrd_start = (unsigned long)__va(of_read_ulong(prop, l/4));
728
729 prop = of_get_flat_dt_prop(node, "linux,initrd-end", &l);
730 if (prop) {
731 initrd_end = (unsigned long)
732 __va(of_read_ulong(prop, l/4));
733 initrd_below_start_ok = 1;
734 } else {
735 initrd_start = 0;
736 }
737 }
738
739 DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end);
740}
741#else
742static inline void early_init_dt_check_for_initrd(unsigned long node)
743{
744}
745#endif /* CONFIG_BLK_DEV_INITRD */
746
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000747static int __init early_init_dt_scan_chosen(unsigned long node,
748 const char *uname, int depth, void *data)
749{
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000750 unsigned long *lprop;
Kumar Gala329dda02006-02-24 10:54:52 -0600751 unsigned long l;
752 char *p;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000753
754 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
755
Paul Mackerrasa575b802005-10-23 17:23:21 +1000756 if (depth != 1 ||
757 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000758 return 0;
759
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000760#ifdef CONFIG_PPC64
761 /* check if iommu is forced on or off */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100762 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000763 iommu_is_off = 1;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100764 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000765 iommu_force_on = 1;
766#endif
767
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000768 /* mem=x on the command line is the preferred mechanism */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100769 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000770 if (lprop)
771 memory_limit = *lprop;
772
773#ifdef CONFIG_PPC64
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100774 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000775 if (lprop)
776 tce_alloc_start = *lprop;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100777 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000778 if (lprop)
779 tce_alloc_end = *lprop;
780#endif
781
Michael Ellermandcee3032005-12-04 18:39:48 +1100782#ifdef CONFIG_KEXEC
783 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL);
784 if (lprop)
785 crashk_res.start = *lprop;
786
787 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL);
788 if (lprop)
789 crashk_res.end = crashk_res.start + *lprop - 1;
790#endif
791
Michael Ellerman40472a52007-05-10 17:06:30 +1000792 early_init_dt_check_for_initrd(node);
David Gibson30437b32007-02-28 14:12:29 +1100793
Kumar Gala329dda02006-02-24 10:54:52 -0600794 /* Retreive command line */
795 p = of_get_flat_dt_prop(node, "bootargs", &l);
796 if (p != NULL && l > 0)
797 strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE));
798
799#ifdef CONFIG_CMDLINE
Geoff Levandc1ce4642006-10-05 11:35:16 -0700800 if (p == NULL || l == 0 || (l == 1 && (*p) == 0))
Kumar Gala329dda02006-02-24 10:54:52 -0600801 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
802#endif /* CONFIG_CMDLINE */
803
804 DBG("Command line is: %s\n", cmd_line);
805
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000806 /* break now */
807 return 1;
808}
809
810static int __init early_init_dt_scan_root(unsigned long node,
811 const char *uname, int depth, void *data)
812{
813 u32 *prop;
814
815 if (depth != 0)
816 return 0;
817
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100818 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000819 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
820 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
821
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100822 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000823 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
824 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
825
826 /* break now */
827 return 1;
828}
829
830static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
831{
832 cell_t *p = *cellp;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000833
Paul Mackerrasa4dc7ff2006-09-19 14:06:27 +1000834 *cellp = p + s;
835 return of_read_ulong(p, s);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000836}
837
Paul Mackerras02045682006-11-29 22:27:42 +1100838#ifdef CONFIG_PPC_PSERIES
839/*
840 * Interpret the ibm,dynamic-memory property in the
841 * /ibm,dynamic-reconfiguration-memory node.
842 * This contains a list of memory blocks along with NUMA affinity
843 * information.
844 */
845static int __init early_init_dt_scan_drconf_memory(unsigned long node)
846{
847 cell_t *dm, *ls;
848 unsigned long l, n;
849 unsigned long base, size, lmb_size, flags;
850
851 ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l);
852 if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t))
853 return 0;
854 lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls);
855
856 dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l);
857 if (dm == NULL || l < sizeof(cell_t))
858 return 0;
859
860 n = *dm++; /* number of entries */
861 if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t))
862 return 0;
863
864 for (; n != 0; --n) {
865 base = dt_mem_next_cell(dt_root_addr_cells, &dm);
866 flags = dm[3];
867 /* skip DRC index, pad, assoc. list index, flags */
868 dm += 4;
869 /* skip this block if the reserved bit is set in flags (0x80)
870 or if the block is not assigned to this partition (0x8) */
871 if ((flags & 0x80) || !(flags & 0x8))
872 continue;
873 size = lmb_size;
874 if (iommu_is_off) {
875 if (base >= 0x80000000ul)
876 continue;
877 if ((base + size) > 0x80000000ul)
878 size = 0x80000000ul - base;
879 }
880 lmb_add(base, size);
881 }
882 lmb_dump_all();
883 return 0;
884}
885#else
886#define early_init_dt_scan_drconf_memory(node) 0
887#endif /* CONFIG_PPC_PSERIES */
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000888
889static int __init early_init_dt_scan_memory(unsigned long node,
890 const char *uname, int depth, void *data)
891{
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100892 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000893 cell_t *reg, *endp;
894 unsigned long l;
895
Paul Mackerras02045682006-11-29 22:27:42 +1100896 /* Look for the ibm,dynamic-reconfiguration-memory node */
897 if (depth == 1 &&
898 strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0)
899 return early_init_dt_scan_drconf_memory(node);
900
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000901 /* We are scanning "memory" nodes only */
Paul Mackerrasa23414b2005-11-10 12:00:55 +1100902 if (type == NULL) {
903 /*
904 * The longtrail doesn't have a device_type on the
905 * /memory node, so look for the node called /memory@0.
906 */
907 if (depth != 1 || strcmp(uname, "memory@0") != 0)
908 return 0;
909 } else if (strcmp(type, "memory") != 0)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000910 return 0;
911
Michael Ellermanba759482005-12-04 18:39:55 +1100912 reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l);
913 if (reg == NULL)
914 reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000915 if (reg == NULL)
916 return 0;
917
918 endp = reg + (l / sizeof(cell_t));
919
Michael Ellerman358c86f2005-11-03 15:39:09 +1100920 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000921 uname, l, reg[0], reg[1], reg[2], reg[3]);
922
923 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
924 unsigned long base, size;
925
926 base = dt_mem_next_cell(dt_root_addr_cells, &reg);
927 size = dt_mem_next_cell(dt_root_size_cells, &reg);
928
929 if (size == 0)
930 continue;
931 DBG(" - %lx , %lx\n", base, size);
932#ifdef CONFIG_PPC64
933 if (iommu_is_off) {
934 if (base >= 0x80000000ul)
935 continue;
936 if ((base + size) > 0x80000000ul)
937 size = 0x80000000ul - base;
938 }
939#endif
940 lmb_add(base, size);
941 }
942 return 0;
943}
944
945static void __init early_reserve_mem(void)
946{
Kumar Galacbbcf342006-01-11 17:57:13 -0600947 u64 base, size;
948 u64 *reserve_map;
Jon Loeliger8a300882006-06-17 17:51:09 -0500949 unsigned long self_base;
950 unsigned long self_size;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000951
Kumar Galacbbcf342006-01-11 17:57:13 -0600952 reserve_map = (u64 *)(((unsigned long)initial_boot_params) +
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000953 initial_boot_params->off_mem_rsvmap);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500954
955 /* before we do anything, lets reserve the dt blob */
Jon Loeliger8a300882006-06-17 17:51:09 -0500956 self_base = __pa((unsigned long)initial_boot_params);
957 self_size = initial_boot_params->totalsize;
958 lmb_reserve(self_base, self_size);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500959
David Gibson30437b32007-02-28 14:12:29 +1100960#ifdef CONFIG_BLK_DEV_INITRD
961 /* then reserve the initrd, if any */
962 if (initrd_start && (initrd_end > initrd_start))
963 lmb_reserve(__pa(initrd_start), initrd_end - initrd_start);
964#endif /* CONFIG_BLK_DEV_INITRD */
965
Kumar Galacbbcf342006-01-11 17:57:13 -0600966#ifdef CONFIG_PPC32
967 /*
968 * Handle the case where we might be booting from an old kexec
969 * image that setup the mem_rsvmap as pairs of 32-bit values
970 */
971 if (*reserve_map > 0xffffffffull) {
972 u32 base_32, size_32;
973 u32 *reserve_map_32 = (u32 *)reserve_map;
974
975 while (1) {
976 base_32 = *(reserve_map_32++);
977 size_32 = *(reserve_map_32++);
978 if (size_32 == 0)
979 break;
Jon Loeliger8a300882006-06-17 17:51:09 -0500980 /* skip if the reservation is for the blob */
981 if (base_32 == self_base && size_32 == self_size)
982 continue;
Kumar Gala329dda02006-02-24 10:54:52 -0600983 DBG("reserving: %x -> %x\n", base_32, size_32);
Kumar Galacbbcf342006-01-11 17:57:13 -0600984 lmb_reserve(base_32, size_32);
985 }
986 return;
987 }
988#endif
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000989 while (1) {
990 base = *(reserve_map++);
991 size = *(reserve_map++);
992 if (size == 0)
993 break;
Kumar Galacbbcf342006-01-11 17:57:13 -0600994 DBG("reserving: %llx -> %llx\n", base, size);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000995 lmb_reserve(base, size);
996 }
997
998#if 0
999 DBG("memory reserved, lmbs :\n");
1000 lmb_dump_all();
1001#endif
1002}
1003
1004void __init early_init_devtree(void *params)
1005{
Geoff Levand44348102007-06-16 08:06:14 +10001006 DBG(" -> early_init_devtree(%p)\n", params);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001007
1008 /* Setup flat device-tree pointer */
1009 initial_boot_params = params;
1010
Michael Ellerman458148c2006-06-23 18:20:13 +10001011#ifdef CONFIG_PPC_RTAS
1012 /* Some machines might need RTAS info for debugging, grab it now. */
1013 of_scan_flat_dt(early_init_dt_scan_rtas, NULL);
1014#endif
1015
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001016 /* Retrieve various informations from the /chosen node of the
1017 * device-tree, including the platform type, initrd location and
1018 * size, TCE reserve, and more ...
1019 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001020 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001021
1022 /* Scan memory nodes and rebuild LMBs */
1023 lmb_init();
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001024 of_scan_flat_dt(early_init_dt_scan_root, NULL);
1025 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001026
1027 /* Save command line for /proc/cmdline and then parse parameters */
Alon Bar-Levb8757b22007-02-12 00:54:17 -08001028 strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001029 parse_early_param();
1030
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001031 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
Michael Ellerman0cc47462005-12-04 18:39:37 +11001032 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
Michael Ellerman47310412006-05-17 18:00:49 +10001033 reserve_kdump_trampoline();
Michael Ellerman35dd5432006-05-18 11:16:11 +10001034 reserve_crashkernel();
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001035 early_reserve_mem();
1036
Michael Ellerman2babf5c2006-05-17 18:00:46 +10001037 lmb_enforce_memory_limit(memory_limit);
1038 lmb_analyze();
1039
1040 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1041
1042 /* We may need to relocate the flat tree, do it now.
1043 * FIXME .. and the initrd too? */
1044 move_device_tree();
1045
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001046 DBG("Scanning CPUs ...\n");
1047
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001048 /* Retreive CPU related informations from the flat tree
1049 * (altivec support, boot CPU ID, ...)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001050 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001051 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001052
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001053 DBG(" <- early_init_devtree()\n");
1054}
1055
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001056
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001057/**
1058 * Indicates whether the root node has a given value in its
1059 * compatible property.
1060 */
1061int machine_is_compatible(const char *compat)
1062{
1063 struct device_node *root;
1064 int rc = 0;
1065
1066 root = of_find_node_by_path("/");
1067 if (root) {
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001068 rc = of_device_is_compatible(root, compat);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001069 of_node_put(root);
1070 }
1071 return rc;
1072}
1073EXPORT_SYMBOL(machine_is_compatible);
1074
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001075/*******
1076 *
1077 * New implementation of the OF "find" APIs, return a refcounted
1078 * object, call of_node_put() when done. The device tree and list
1079 * are protected by a rw_lock.
1080 *
1081 * Note that property management will need some locking as well,
1082 * this isn't dealt with yet.
1083 *
1084 *******/
1085
1086/**
1087 * of_find_node_by_name - Find a node by its "name" property
1088 * @from: The node to start searching from or NULL, the node
1089 * you pass will not be searched, only the next one
1090 * will; typically, you pass what the previous call
1091 * returned. of_node_put() will be called on it
1092 * @name: The name string to match against
1093 *
1094 * Returns a node pointer with refcount incremented, use
1095 * of_node_put() on it when done.
1096 */
1097struct device_node *of_find_node_by_name(struct device_node *from,
1098 const char *name)
1099{
1100 struct device_node *np;
1101
1102 read_lock(&devtree_lock);
1103 np = from ? from->allnext : allnodes;
Olaf Hering090db7c2006-02-04 12:44:56 +01001104 for (; np != NULL; np = np->allnext)
1105 if (np->name != NULL && strcasecmp(np->name, name) == 0
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001106 && of_node_get(np))
1107 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001108 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001109 read_unlock(&devtree_lock);
1110 return np;
1111}
1112EXPORT_SYMBOL(of_find_node_by_name);
1113
1114/**
1115 * of_find_node_by_type - Find a node by its "device_type" property
Michael Ellerman5169b8a2007-05-23 18:08:13 +10001116 * @from: The node to start searching from, or NULL to start searching
1117 * the entire device tree. The node you pass will not be
1118 * searched, only the next one will; typically, you pass
1119 * what the previous call returned. of_node_put() will be
1120 * called on from for you.
1121 * @type: The type string to match against
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001122 *
1123 * Returns a node pointer with refcount incremented, use
1124 * of_node_put() on it when done.
1125 */
1126struct device_node *of_find_node_by_type(struct device_node *from,
1127 const char *type)
1128{
1129 struct device_node *np;
1130
1131 read_lock(&devtree_lock);
1132 np = from ? from->allnext : allnodes;
1133 for (; np != 0; np = np->allnext)
1134 if (np->type != 0 && strcasecmp(np->type, type) == 0
1135 && of_node_get(np))
1136 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001137 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001138 read_unlock(&devtree_lock);
1139 return np;
1140}
1141EXPORT_SYMBOL(of_find_node_by_type);
1142
1143/**
1144 * of_find_compatible_node - Find a node based on type and one of the
1145 * tokens in its "compatible" 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 * @type: The type string to match "device_type" or NULL to ignore
1151 * @compatible: The string to match to one of the tokens in the device
1152 * "compatible" list.
1153 *
1154 * Returns a node pointer with refcount incremented, use
1155 * of_node_put() on it when done.
1156 */
1157struct device_node *of_find_compatible_node(struct device_node *from,
1158 const char *type, const char *compatible)
1159{
1160 struct device_node *np;
1161
1162 read_lock(&devtree_lock);
1163 np = from ? from->allnext : allnodes;
1164 for (; np != 0; np = np->allnext) {
1165 if (type != NULL
1166 && !(np->type != 0 && strcasecmp(np->type, type) == 0))
1167 continue;
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001168 if (of_device_is_compatible(np, compatible) && of_node_get(np))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001169 break;
1170 }
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001171 of_node_put(from);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001172 read_unlock(&devtree_lock);
1173 return np;
1174}
1175EXPORT_SYMBOL(of_find_compatible_node);
1176
1177/**
1178 * of_find_node_by_path - Find a node matching a full OF path
1179 * @path: The full path to match
1180 *
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_path(const char *path)
1185{
1186 struct device_node *np = allnodes;
1187
1188 read_lock(&devtree_lock);
1189 for (; np != 0; np = np->allnext) {
1190 if (np->full_name != 0 && strcasecmp(np->full_name, path) == 0
1191 && of_node_get(np))
1192 break;
1193 }
1194 read_unlock(&devtree_lock);
1195 return np;
1196}
1197EXPORT_SYMBOL(of_find_node_by_path);
1198
1199/**
1200 * of_find_node_by_phandle - Find a node given a phandle
1201 * @handle: phandle of the node to find
1202 *
1203 * Returns a node pointer with refcount incremented, use
1204 * of_node_put() on it when done.
1205 */
1206struct device_node *of_find_node_by_phandle(phandle handle)
1207{
1208 struct device_node *np;
1209
1210 read_lock(&devtree_lock);
1211 for (np = allnodes; np != 0; np = np->allnext)
1212 if (np->linux_phandle == handle)
1213 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001214 of_node_get(np);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001215 read_unlock(&devtree_lock);
1216 return np;
1217}
1218EXPORT_SYMBOL(of_find_node_by_phandle);
1219
1220/**
1221 * of_find_all_nodes - Get next node in global list
1222 * @prev: Previous node or NULL to start iteration
1223 * of_node_put() will be called on it
1224 *
1225 * Returns a node pointer with refcount incremented, use
1226 * of_node_put() on it when done.
1227 */
1228struct device_node *of_find_all_nodes(struct device_node *prev)
1229{
1230 struct device_node *np;
1231
1232 read_lock(&devtree_lock);
1233 np = prev ? prev->allnext : allnodes;
1234 for (; np != 0; np = np->allnext)
1235 if (of_node_get(np))
1236 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001237 of_node_put(prev);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001238 read_unlock(&devtree_lock);
1239 return np;
1240}
1241EXPORT_SYMBOL(of_find_all_nodes);
1242
1243/**
1244 * of_get_parent - Get a node's parent if any
1245 * @node: Node to get parent
1246 *
1247 * Returns a node pointer with refcount incremented, use
1248 * of_node_put() on it when done.
1249 */
1250struct device_node *of_get_parent(const struct device_node *node)
1251{
1252 struct device_node *np;
1253
1254 if (!node)
1255 return NULL;
1256
1257 read_lock(&devtree_lock);
1258 np = of_node_get(node->parent);
1259 read_unlock(&devtree_lock);
1260 return np;
1261}
1262EXPORT_SYMBOL(of_get_parent);
1263
1264/**
1265 * of_get_next_child - Iterate a node childs
1266 * @node: parent node
1267 * @prev: previous child of the parent node, or NULL to get first
1268 *
1269 * Returns a node pointer with refcount incremented, use
1270 * of_node_put() on it when done.
1271 */
1272struct device_node *of_get_next_child(const struct device_node *node,
1273 struct device_node *prev)
1274{
1275 struct device_node *next;
1276
1277 read_lock(&devtree_lock);
1278 next = prev ? prev->sibling : node->child;
1279 for (; next != 0; next = next->sibling)
1280 if (of_node_get(next))
1281 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001282 of_node_put(prev);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001283 read_unlock(&devtree_lock);
1284 return next;
1285}
1286EXPORT_SYMBOL(of_get_next_child);
1287
1288/**
1289 * of_node_get - Increment refcount of a node
1290 * @node: Node to inc refcount, NULL is supported to
1291 * simplify writing of callers
1292 *
1293 * Returns node.
1294 */
1295struct device_node *of_node_get(struct device_node *node)
1296{
1297 if (node)
1298 kref_get(&node->kref);
1299 return node;
1300}
1301EXPORT_SYMBOL(of_node_get);
1302
1303static inline struct device_node * kref_to_device_node(struct kref *kref)
1304{
1305 return container_of(kref, struct device_node, kref);
1306}
1307
1308/**
1309 * of_node_release - release a dynamically allocated node
1310 * @kref: kref element of the node to be released
1311 *
1312 * In of_node_put() this function is passed to kref_put()
1313 * as the destructor.
1314 */
1315static void of_node_release(struct kref *kref)
1316{
1317 struct device_node *node = kref_to_device_node(kref);
1318 struct property *prop = node->properties;
1319
Michael Ellerman6a2818562007-06-19 16:08:00 +10001320 /* We should never be releasing nodes that haven't been detached. */
1321 if (!of_node_check_flag(node, OF_DETACHED)) {
1322 printk("WARNING: Bad of_node_put() on %s\n", node->full_name);
1323 dump_stack();
1324 kref_init(&node->kref);
1325 return;
1326 }
1327
Michael Ellermand3b814b2007-06-19 16:07:58 +10001328 if (!of_node_check_flag(node, OF_DYNAMIC))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001329 return;
Michael Ellerman6a2818562007-06-19 16:08:00 +10001330
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001331 while (prop) {
1332 struct property *next = prop->next;
1333 kfree(prop->name);
1334 kfree(prop->value);
1335 kfree(prop);
1336 prop = next;
Dave C Boutcher088186d2006-01-12 16:08:27 -06001337
1338 if (!prop) {
1339 prop = node->deadprops;
1340 node->deadprops = NULL;
1341 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001342 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001343 kfree(node->full_name);
1344 kfree(node->data);
1345 kfree(node);
1346}
1347
1348/**
1349 * of_node_put - Decrement refcount of a node
1350 * @node: Node to dec refcount, NULL is supported to
1351 * simplify writing of callers
1352 *
1353 */
1354void of_node_put(struct device_node *node)
1355{
1356 if (node)
1357 kref_put(&node->kref, of_node_release);
1358}
1359EXPORT_SYMBOL(of_node_put);
1360
1361/*
1362 * Plug a device node into the tree and global list.
1363 */
1364void of_attach_node(struct device_node *np)
1365{
1366 write_lock(&devtree_lock);
1367 np->sibling = np->parent->child;
1368 np->allnext = allnodes;
1369 np->parent->child = np;
1370 allnodes = np;
1371 write_unlock(&devtree_lock);
1372}
1373
1374/*
1375 * "Unplug" a node from the device tree. The caller must hold
1376 * a reference to the node. The memory associated with the node
1377 * is not freed until its refcount goes to zero.
1378 */
1379void of_detach_node(const struct device_node *np)
1380{
1381 struct device_node *parent;
1382
1383 write_lock(&devtree_lock);
1384
1385 parent = np->parent;
Michael Ellerman972d17c2007-06-19 16:07:56 +10001386 if (!parent)
1387 goto out_unlock;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001388
1389 if (allnodes == np)
1390 allnodes = np->allnext;
1391 else {
1392 struct device_node *prev;
1393 for (prev = allnodes;
1394 prev->allnext != np;
1395 prev = prev->allnext)
1396 ;
1397 prev->allnext = np->allnext;
1398 }
1399
1400 if (parent->child == np)
1401 parent->child = np->sibling;
1402 else {
1403 struct device_node *prevsib;
1404 for (prevsib = np->parent->child;
1405 prevsib->sibling != np;
1406 prevsib = prevsib->sibling)
1407 ;
1408 prevsib->sibling = np->sibling;
1409 }
1410
Michael Ellerman6a2818562007-06-19 16:08:00 +10001411 of_node_set_flag(np, OF_DETACHED);
1412
Michael Ellerman972d17c2007-06-19 16:07:56 +10001413out_unlock:
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001414 write_unlock(&devtree_lock);
1415}
1416
1417#ifdef CONFIG_PPC_PSERIES
1418/*
1419 * Fix up the uninitialized fields in a new device node:
Benjamin Herrenschmidt0ebfff12006-07-03 21:36:01 +10001420 * name, type and pci-specific fields
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001421 */
1422
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001423static int of_finish_dynamic_node(struct device_node *node)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001424{
1425 struct device_node *parent = of_get_parent(node);
1426 int err = 0;
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001427 const phandle *ibm_phandle;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001428
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001429 node->name = of_get_property(node, "name", NULL);
1430 node->type = of_get_property(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001431
Benjamin Herrenschmidt847f5972007-05-16 16:57:24 +10001432 if (!node->name)
1433 node->name = "<NULL>";
1434 if (!node->type)
1435 node->type = "<NULL>";
1436
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001437 if (!parent) {
1438 err = -ENODEV;
1439 goto out;
1440 }
1441
1442 /* We don't support that function on PowerMac, at least
1443 * not yet
1444 */
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +11001445 if (machine_is(powermac))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001446 return -ENODEV;
1447
1448 /* fix up new node's linux_phandle field */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001449 if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL)))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001450 node->linux_phandle = *ibm_phandle;
1451
1452out:
1453 of_node_put(parent);
1454 return err;
1455}
1456
1457static int prom_reconfig_notifier(struct notifier_block *nb,
1458 unsigned long action, void *node)
1459{
1460 int err;
1461
1462 switch (action) {
1463 case PSERIES_RECONFIG_ADD:
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001464 err = of_finish_dynamic_node(node);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001465 if (err < 0) {
1466 printk(KERN_ERR "finish_node returned %d\n", err);
1467 err = NOTIFY_BAD;
1468 }
1469 break;
1470 default:
1471 err = NOTIFY_DONE;
1472 break;
1473 }
1474 return err;
1475}
1476
1477static struct notifier_block prom_reconfig_nb = {
1478 .notifier_call = prom_reconfig_notifier,
1479 .priority = 10, /* This one needs to run first */
1480};
1481
1482static int __init prom_reconfig_setup(void)
1483{
1484 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1485}
1486__initcall(prom_reconfig_setup);
1487#endif
1488
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001489/*
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001490 * Add a property to a node
1491 */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001492int prom_add_property(struct device_node* np, struct property* prop)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001493{
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001494 struct property **next;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001495
1496 prop->next = NULL;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001497 write_lock(&devtree_lock);
1498 next = &np->properties;
1499 while (*next) {
1500 if (strcmp(prop->name, (*next)->name) == 0) {
1501 /* duplicate ! don't insert it */
1502 write_unlock(&devtree_lock);
1503 return -1;
1504 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001505 next = &(*next)->next;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001506 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001507 *next = prop;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001508 write_unlock(&devtree_lock);
1509
Paul Mackerras799d6042005-11-10 13:37:51 +11001510#ifdef CONFIG_PROC_DEVICETREE
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001511 /* try to add to proc as well if it was initialized */
1512 if (np->pde)
1513 proc_device_tree_add_prop(np->pde, prop);
Paul Mackerras799d6042005-11-10 13:37:51 +11001514#endif /* CONFIG_PROC_DEVICETREE */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001515
1516 return 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001517}
1518
Dave C Boutcher088186d2006-01-12 16:08:27 -06001519/*
1520 * Remove a property from a node. Note that we don't actually
1521 * remove it, since we have given out who-knows-how-many pointers
1522 * to the data using get-property. Instead we just move the property
1523 * to the "dead properties" list, so it won't be found any more.
1524 */
1525int prom_remove_property(struct device_node *np, struct property *prop)
1526{
1527 struct property **next;
1528 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001529
Dave C Boutcher088186d2006-01-12 16:08:27 -06001530 write_lock(&devtree_lock);
1531 next = &np->properties;
1532 while (*next) {
1533 if (*next == prop) {
1534 /* found the node */
1535 *next = prop->next;
1536 prop->next = np->deadprops;
1537 np->deadprops = prop;
1538 found = 1;
1539 break;
1540 }
1541 next = &(*next)->next;
1542 }
1543 write_unlock(&devtree_lock);
1544
1545 if (!found)
1546 return -ENODEV;
1547
1548#ifdef CONFIG_PROC_DEVICETREE
1549 /* try to remove the proc node as well */
1550 if (np->pde)
1551 proc_device_tree_remove_prop(np->pde, prop);
1552#endif /* CONFIG_PROC_DEVICETREE */
1553
1554 return 0;
1555}
1556
1557/*
1558 * Update a property in a node. Note that we don't actually
1559 * remove it, since we have given out who-knows-how-many pointers
1560 * to the data using get-property. Instead we just move the property
1561 * to the "dead properties" list, and add the new property to the
1562 * property list
1563 */
1564int prom_update_property(struct device_node *np,
1565 struct property *newprop,
1566 struct property *oldprop)
1567{
1568 struct property **next;
1569 int found = 0;
1570
1571 write_lock(&devtree_lock);
1572 next = &np->properties;
1573 while (*next) {
1574 if (*next == oldprop) {
1575 /* found the node */
1576 newprop->next = oldprop->next;
1577 *next = newprop;
1578 oldprop->next = np->deadprops;
1579 np->deadprops = oldprop;
1580 found = 1;
1581 break;
1582 }
1583 next = &(*next)->next;
1584 }
1585 write_unlock(&devtree_lock);
1586
1587 if (!found)
1588 return -ENODEV;
1589
1590#ifdef CONFIG_PROC_DEVICETREE
1591 /* try to add to proc as well if it was initialized */
1592 if (np->pde)
1593 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1594#endif /* CONFIG_PROC_DEVICETREE */
1595
1596 return 0;
1597}
Michael Ellermanb68239e2006-02-03 19:05:47 +11001598
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001599
1600/* Find the device node for a given logical cpu number, also returns the cpu
1601 * local thread number (index in ibm,interrupt-server#s) if relevant and
1602 * asked for (non NULL)
1603 */
1604struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
1605{
1606 int hardid;
1607 struct device_node *np;
1608
1609 hardid = get_hard_smp_processor_id(cpu);
1610
1611 for_each_node_by_type(np, "cpu") {
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001612 const u32 *intserv;
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001613 unsigned int plen, t;
1614
1615 /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist
1616 * fallback to "reg" property and assume no threads
1617 */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001618 intserv = of_get_property(np, "ibm,ppc-interrupt-server#s",
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001619 &plen);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001620 if (intserv == NULL) {
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001621 const u32 *reg = of_get_property(np, "reg", NULL);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001622 if (reg == NULL)
1623 continue;
1624 if (*reg == hardid) {
1625 if (thread)
1626 *thread = 0;
1627 return np;
1628 }
1629 } else {
1630 plen /= sizeof(u32);
1631 for (t = 0; t < plen; t++) {
1632 if (hardid == intserv[t]) {
1633 if (thread)
1634 *thread = t;
1635 return np;
1636 }
1637 }
1638 }
1639 }
1640 return NULL;
1641}
Christian Krafft36ca4ba2006-10-24 18:39:45 +02001642EXPORT_SYMBOL(of_get_cpu_node);
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001643
Michael Ellerman94a38072007-06-20 10:54:19 +10001644#if defined(CONFIG_DEBUG_FS) && defined(DEBUG)
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001645static struct debugfs_blob_wrapper flat_dt_blob;
1646
1647static int __init export_flat_device_tree(void)
1648{
1649 struct dentry *d;
1650
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001651 flat_dt_blob.data = initial_boot_params;
1652 flat_dt_blob.size = initial_boot_params->totalsize;
1653
1654 d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR,
Michael Ellerman94a38072007-06-20 10:54:19 +10001655 powerpc_debugfs_root, &flat_dt_blob);
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001656 if (!d)
1657 return 1;
1658
1659 return 0;
1660}
1661__initcall(export_flat_device_tree);
1662#endif