blob: c17a5851bdb72fdd2255f578265f4e0fde240dd8 [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>
David S. Millerd9b2b2a2008-02-13 16:56:49 -080034#include <linux/lmb.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100035
36#include <asm/prom.h>
37#include <asm/rtas.h>
Paul Mackerras9b6b5632005-10-06 12:06:20 +100038#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
Stephen Rothwell1ef4d422007-04-24 17:57:33 +100080extern struct device_node *allnodes; /* temporary while merging */
Paul Mackerras9b6b5632005-10-06 12:06:20 +100081
Stephen Rothwell581b6052007-04-24 16:46:53 +100082extern rwlock_t devtree_lock; /* temporary while merging */
Paul Mackerras9b6b5632005-10-06 12:06:20 +100083
84/* export that to outside world */
85struct device_node *of_chosen;
86
Paul Mackerras9b6b5632005-10-06 12:06:20 +100087static inline char *find_flat_dt_string(u32 offset)
88{
89 return ((char *)initial_boot_params) +
90 initial_boot_params->off_dt_strings + offset;
91}
92
93/**
94 * This function is used to scan the flattened device-tree, it is
95 * used to extract the memory informations at boot before we can
96 * unflatten the tree
97 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +110098int __init of_scan_flat_dt(int (*it)(unsigned long node,
99 const char *uname, int depth,
100 void *data),
101 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000102{
103 unsigned long p = ((unsigned long)initial_boot_params) +
104 initial_boot_params->off_dt_struct;
105 int rc = 0;
106 int depth = -1;
107
108 do {
109 u32 tag = *((u32 *)p);
110 char *pathp;
111
112 p += 4;
113 if (tag == OF_DT_END_NODE) {
114 depth --;
115 continue;
116 }
117 if (tag == OF_DT_NOP)
118 continue;
119 if (tag == OF_DT_END)
120 break;
121 if (tag == OF_DT_PROP) {
122 u32 sz = *((u32 *)p);
123 p += 8;
124 if (initial_boot_params->version < 0x10)
125 p = _ALIGN(p, sz >= 8 ? 8 : 4);
126 p += sz;
127 p = _ALIGN(p, 4);
128 continue;
129 }
130 if (tag != OF_DT_BEGIN_NODE) {
131 printk(KERN_WARNING "Invalid tag %x scanning flattened"
132 " device tree !\n", tag);
133 return -EINVAL;
134 }
135 depth++;
136 pathp = (char *)p;
137 p = _ALIGN(p + strlen(pathp) + 1, 4);
138 if ((*pathp) == '/') {
139 char *lp, *np;
140 for (lp = NULL, np = pathp; *np; np++)
141 if ((*np) == '/')
142 lp = np+1;
143 if (lp != NULL)
144 pathp = lp;
145 }
146 rc = it(p, pathp, depth, data);
147 if (rc != 0)
148 break;
149 } while(1);
150
151 return rc;
152}
153
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100154unsigned long __init of_get_flat_dt_root(void)
155{
156 unsigned long p = ((unsigned long)initial_boot_params) +
157 initial_boot_params->off_dt_struct;
158
159 while(*((u32 *)p) == OF_DT_NOP)
160 p += 4;
161 BUG_ON (*((u32 *)p) != OF_DT_BEGIN_NODE);
162 p += 4;
163 return _ALIGN(p + strlen((char *)p) + 1, 4);
164}
165
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000166/**
167 * This function can be used within scan_flattened_dt callback to get
168 * access to properties
169 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100170void* __init of_get_flat_dt_prop(unsigned long node, const char *name,
171 unsigned long *size)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000172{
173 unsigned long p = node;
174
175 do {
176 u32 tag = *((u32 *)p);
177 u32 sz, noff;
178 const char *nstr;
179
180 p += 4;
181 if (tag == OF_DT_NOP)
182 continue;
183 if (tag != OF_DT_PROP)
184 return NULL;
185
186 sz = *((u32 *)p);
187 noff = *((u32 *)(p + 4));
188 p += 8;
189 if (initial_boot_params->version < 0x10)
190 p = _ALIGN(p, sz >= 8 ? 8 : 4);
191
192 nstr = find_flat_dt_string(noff);
193 if (nstr == NULL) {
194 printk(KERN_WARNING "Can't find property index"
195 " name !\n");
196 return NULL;
197 }
198 if (strcmp(name, nstr) == 0) {
199 if (size)
200 *size = sz;
201 return (void *)p;
202 }
203 p += sz;
204 p = _ALIGN(p, 4);
205 } while(1);
206}
207
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100208int __init of_flat_dt_is_compatible(unsigned long node, const char *compat)
209{
210 const char* cp;
211 unsigned long cplen, l;
212
213 cp = of_get_flat_dt_prop(node, "compatible", &cplen);
214 if (cp == NULL)
215 return 0;
216 while (cplen > 0) {
217 if (strncasecmp(cp, compat, strlen(compat)) == 0)
218 return 1;
219 l = strlen(cp) + 1;
220 cp += l;
221 cplen -= l;
222 }
223
224 return 0;
225}
226
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000227static void *__init unflatten_dt_alloc(unsigned long *mem, unsigned long size,
228 unsigned long align)
229{
230 void *res;
231
232 *mem = _ALIGN(*mem, align);
233 res = (void *)*mem;
234 *mem += size;
235
236 return res;
237}
238
239static unsigned long __init unflatten_dt_node(unsigned long mem,
240 unsigned long *p,
241 struct device_node *dad,
242 struct device_node ***allnextpp,
243 unsigned long fpsize)
244{
245 struct device_node *np;
246 struct property *pp, **prev_pp = NULL;
247 char *pathp;
248 u32 tag;
249 unsigned int l, allocl;
250 int has_name = 0;
251 int new_format = 0;
252
253 tag = *((u32 *)(*p));
254 if (tag != OF_DT_BEGIN_NODE) {
255 printk("Weird tag at start of node: %x\n", tag);
256 return mem;
257 }
258 *p += 4;
259 pathp = (char *)*p;
260 l = allocl = strlen(pathp) + 1;
261 *p = _ALIGN(*p + l, 4);
262
263 /* version 0x10 has a more compact unit name here instead of the full
264 * path. we accumulate the full path size using "fpsize", we'll rebuild
265 * it later. We detect this because the first character of the name is
266 * not '/'.
267 */
268 if ((*pathp) != '/') {
269 new_format = 1;
270 if (fpsize == 0) {
271 /* root node: special case. fpsize accounts for path
272 * plus terminating zero. root node only has '/', so
273 * fpsize should be 2, but we want to avoid the first
274 * level nodes to have two '/' so we use fpsize 1 here
275 */
276 fpsize = 1;
277 allocl = 2;
278 } else {
279 /* account for '/' and path size minus terminal 0
280 * already in 'l'
281 */
282 fpsize += l;
283 allocl = fpsize;
284 }
285 }
286
287
288 np = unflatten_dt_alloc(&mem, sizeof(struct device_node) + allocl,
289 __alignof__(struct device_node));
290 if (allnextpp) {
291 memset(np, 0, sizeof(*np));
292 np->full_name = ((char*)np) + sizeof(struct device_node);
293 if (new_format) {
294 char *p = np->full_name;
295 /* rebuild full path for new format */
296 if (dad && dad->parent) {
297 strcpy(p, dad->full_name);
298#ifdef DEBUG
299 if ((strlen(p) + l + 1) != allocl) {
300 DBG("%s: p: %d, l: %d, a: %d\n",
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +1100301 pathp, (int)strlen(p), l, allocl);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000302 }
303#endif
304 p += strlen(p);
305 }
306 *(p++) = '/';
307 memcpy(p, pathp, l);
308 } else
309 memcpy(np->full_name, pathp, l);
310 prev_pp = &np->properties;
311 **allnextpp = np;
312 *allnextpp = &np->allnext;
313 if (dad != NULL) {
314 np->parent = dad;
315 /* we temporarily use the next field as `last_child'*/
316 if (dad->next == 0)
317 dad->child = np;
318 else
319 dad->next->sibling = np;
320 dad->next = np;
321 }
322 kref_init(&np->kref);
323 }
324 while(1) {
325 u32 sz, noff;
326 char *pname;
327
328 tag = *((u32 *)(*p));
329 if (tag == OF_DT_NOP) {
330 *p += 4;
331 continue;
332 }
333 if (tag != OF_DT_PROP)
334 break;
335 *p += 4;
336 sz = *((u32 *)(*p));
337 noff = *((u32 *)((*p) + 4));
338 *p += 8;
339 if (initial_boot_params->version < 0x10)
340 *p = _ALIGN(*p, sz >= 8 ? 8 : 4);
341
342 pname = find_flat_dt_string(noff);
343 if (pname == NULL) {
344 printk("Can't find property name in list !\n");
345 break;
346 }
347 if (strcmp(pname, "name") == 0)
348 has_name = 1;
349 l = strlen(pname) + 1;
350 pp = unflatten_dt_alloc(&mem, sizeof(struct property),
351 __alignof__(struct property));
352 if (allnextpp) {
353 if (strcmp(pname, "linux,phandle") == 0) {
354 np->node = *((u32 *)*p);
355 if (np->linux_phandle == 0)
356 np->linux_phandle = np->node;
357 }
358 if (strcmp(pname, "ibm,phandle") == 0)
359 np->linux_phandle = *((u32 *)*p);
360 pp->name = pname;
361 pp->length = sz;
362 pp->value = (void *)*p;
363 *prev_pp = pp;
364 prev_pp = &pp->next;
365 }
366 *p = _ALIGN((*p) + sz, 4);
367 }
368 /* with version 0x10 we may not have the name property, recreate
369 * it here from the unit name if absent
370 */
371 if (!has_name) {
372 char *p = pathp, *ps = pathp, *pa = NULL;
373 int sz;
374
375 while (*p) {
376 if ((*p) == '@')
377 pa = p;
378 if ((*p) == '/')
379 ps = p + 1;
380 p++;
381 }
382 if (pa < ps)
383 pa = p;
384 sz = (pa - ps) + 1;
385 pp = unflatten_dt_alloc(&mem, sizeof(struct property) + sz,
386 __alignof__(struct property));
387 if (allnextpp) {
388 pp->name = "name";
389 pp->length = sz;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000390 pp->value = pp + 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000391 *prev_pp = pp;
392 prev_pp = &pp->next;
393 memcpy(pp->value, ps, sz - 1);
394 ((char *)pp->value)[sz - 1] = 0;
Stephen Rothwell1a381472007-04-03 10:58:52 +1000395 DBG("fixed up name for %s -> %s\n", pathp,
396 (char *)pp->value);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000397 }
398 }
399 if (allnextpp) {
400 *prev_pp = NULL;
Stephen Rothwell0e56efc2007-04-03 10:54:01 +1000401 np->name = of_get_property(np, "name", NULL);
402 np->type = of_get_property(np, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000403
404 if (!np->name)
405 np->name = "<NULL>";
406 if (!np->type)
407 np->type = "<NULL>";
408 }
409 while (tag == OF_DT_BEGIN_NODE) {
410 mem = unflatten_dt_node(mem, p, np, allnextpp, fpsize);
411 tag = *((u32 *)(*p));
412 }
413 if (tag != OF_DT_END_NODE) {
414 printk("Weird tag at end of node: %x\n", tag);
415 return mem;
416 }
417 *p += 4;
418 return mem;
419}
420
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000421static int __init early_parse_mem(char *p)
422{
423 if (!p)
424 return 1;
425
426 memory_limit = PAGE_ALIGN(memparse(p, &p));
427 DBG("memory limit = 0x%lx\n", memory_limit);
428
429 return 0;
430}
431early_param("mem", early_parse_mem);
432
Linas Vepstas3c607ce2007-09-07 03:47:29 +1000433/**
434 * move_device_tree - move tree to an unused area, if needed.
435 *
436 * The device tree may be allocated beyond our memory limit, or inside the
437 * crash kernel region for kdump. If so, move it out of the way.
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000438 */
439static void move_device_tree(void)
440{
441 unsigned long start, size;
442 void *p;
443
444 DBG("-> move_device_tree\n");
445
446 start = __pa(initial_boot_params);
447 size = initial_boot_params->totalsize;
448
449 if ((memory_limit && (start + size) > memory_limit) ||
450 overlaps_crashkernel(start, size)) {
451 p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size));
452 memcpy(p, initial_boot_params, size);
453 initial_boot_params = (struct boot_param_header *)p;
454 DBG("Moved device tree to 0x%p\n", p);
455 }
456
457 DBG("<- move_device_tree\n");
458}
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000459
460/**
461 * unflattens the device-tree passed by the firmware, creating the
462 * tree of struct device_node. It also fills the "name" and "type"
463 * pointers of the nodes so the normal device-tree walking functions
464 * can be used (this used to be done by finish_device_tree)
465 */
466void __init unflatten_device_tree(void)
467{
468 unsigned long start, mem, size;
469 struct device_node **allnextp = &allnodes;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000470
471 DBG(" -> unflatten_device_tree()\n");
472
473 /* First pass, scan for size */
474 start = ((unsigned long)initial_boot_params) +
475 initial_boot_params->off_dt_struct;
476 size = unflatten_dt_node(0, &start, NULL, NULL, 0);
477 size = (size | 3) + 1;
478
479 DBG(" size is %lx, allocating...\n", size);
480
481 /* Allocate memory for the expanded device tree */
482 mem = lmb_alloc(size + 4, __alignof__(struct device_node));
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000483 mem = (unsigned long) __va(mem);
484
485 ((u32 *)mem)[size / 4] = 0xdeadbeef;
486
487 DBG(" unflattening %lx...\n", mem);
488
489 /* Second pass, do actual unflattening */
490 start = ((unsigned long)initial_boot_params) +
491 initial_boot_params->off_dt_struct;
492 unflatten_dt_node(mem, &start, NULL, &allnextp, 0);
493 if (*((u32 *)start) != OF_DT_END)
494 printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start));
495 if (((u32 *)mem)[size / 4] != 0xdeadbeef)
496 printk(KERN_WARNING "End of tree marker overwritten: %08x\n",
497 ((u32 *)mem)[size / 4] );
498 *allnextp = NULL;
499
500 /* Get pointer to OF "/chosen" node for use everywhere */
501 of_chosen = of_find_node_by_path("/chosen");
Paul Mackerrasa575b802005-10-23 17:23:21 +1000502 if (of_chosen == NULL)
503 of_chosen = of_find_node_by_path("/chosen@0");
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000504
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000505 DBG(" <- unflatten_device_tree()\n");
506}
507
Paul Mackerrasd2058192006-05-03 23:04:37 +1000508/*
509 * ibm,pa-features is a per-cpu property that contains a string of
510 * attribute descriptors, each of which has a 2 byte header plus up
511 * to 254 bytes worth of processor attribute bits. First header
512 * byte specifies the number of bytes following the header.
513 * Second header byte is an "attribute-specifier" type, of which
514 * zero is the only currently-defined value.
515 * Implementation: Pass in the byte and bit offset for the feature
516 * that we are interested in. The function will return -1 if the
517 * pa-features property is missing, or a 1/0 to indicate if the feature
518 * is supported/not supported. Note that the bit numbers are
519 * big-endian to match the definition in PAPR.
520 */
521static struct ibm_pa_feature {
522 unsigned long cpu_features; /* CPU_FTR_xxx bit */
523 unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */
524 unsigned char pabyte; /* byte number in ibm,pa-features */
525 unsigned char pabit; /* bit number (big-endian) */
526 unsigned char invert; /* if 1, pa bit set => clear feature */
527} ibm_pa_features[] __initdata = {
528 {0, PPC_FEATURE_HAS_MMU, 0, 0, 0},
529 {0, PPC_FEATURE_HAS_FPU, 0, 1, 0},
530 {CPU_FTR_SLB, 0, 0, 2, 0},
531 {CPU_FTR_CTRL, 0, 0, 3, 0},
532 {CPU_FTR_NOEXECUTE, 0, 0, 6, 0},
533 {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1},
534 {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0},
Paul Mackerras339d76c2006-06-29 17:12:30 +1000535 {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0},
Paul Mackerrasd2058192006-05-03 23:04:37 +1000536};
537
Paul Mackerras974a76f2006-11-10 20:38:53 +1100538static void __init scan_features(unsigned long node, unsigned char *ftrs,
539 unsigned long tablelen,
540 struct ibm_pa_feature *fp,
541 unsigned long ft_size)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000542{
Paul Mackerras974a76f2006-11-10 20:38:53 +1100543 unsigned long i, len, bit;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000544
545 /* find descriptor with type == 0 */
546 for (;;) {
547 if (tablelen < 3)
548 return;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100549 len = 2 + ftrs[0];
Paul Mackerrasd2058192006-05-03 23:04:37 +1000550 if (tablelen < len)
551 return; /* descriptor 0 not found */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100552 if (ftrs[1] == 0)
Paul Mackerrasd2058192006-05-03 23:04:37 +1000553 break;
554 tablelen -= len;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100555 ftrs += len;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000556 }
557
558 /* loop over bits we know about */
Paul Mackerras974a76f2006-11-10 20:38:53 +1100559 for (i = 0; i < ft_size; ++i, ++fp) {
560 if (fp->pabyte >= ftrs[0])
Paul Mackerrasd2058192006-05-03 23:04:37 +1000561 continue;
Paul Mackerras974a76f2006-11-10 20:38:53 +1100562 bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1;
Paul Mackerrasd2058192006-05-03 23:04:37 +1000563 if (bit ^ fp->invert) {
564 cur_cpu_spec->cpu_features |= fp->cpu_features;
565 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs;
566 } else {
567 cur_cpu_spec->cpu_features &= ~fp->cpu_features;
568 cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs;
569 }
570 }
571}
572
Paul Mackerras974a76f2006-11-10 20:38:53 +1100573static void __init check_cpu_pa_features(unsigned long node)
574{
575 unsigned char *pa_ftrs;
576 unsigned long tablelen;
577
578 pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen);
579 if (pa_ftrs == NULL)
580 return;
581
582 scan_features(node, pa_ftrs, tablelen,
583 ibm_pa_features, ARRAY_SIZE(ibm_pa_features));
584}
585
Michael Neuling584f8b72007-12-06 17:24:48 +1100586#ifdef CONFIG_PPC64
587static void __init check_cpu_slb_size(unsigned long node)
588{
589 u32 *slb_size_ptr;
590
591 slb_size_ptr = of_get_flat_dt_prop(node, "ibm,slb-size", NULL);
592 if (slb_size_ptr != NULL) {
593 mmu_slb_size = *slb_size_ptr;
594 }
595}
596#else
597#define check_cpu_slb_size(node) do { } while(0)
598#endif
599
Paul Mackerras974a76f2006-11-10 20:38:53 +1100600static struct feature_property {
601 const char *name;
602 u32 min_value;
603 unsigned long cpu_feature;
604 unsigned long cpu_user_ftr;
605} feature_properties[] __initdata = {
606#ifdef CONFIG_ALTIVEC
607 {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
608 {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC},
609#endif /* CONFIG_ALTIVEC */
610#ifdef CONFIG_PPC64
611 {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP},
612 {"ibm,purr", 1, CPU_FTR_PURR, 0},
613 {"ibm,spurr", 1, CPU_FTR_SPURR, 0},
614#endif /* CONFIG_PPC64 */
615};
616
Valentine Barshak14b3d922007-12-22 03:24:02 +1100617#if defined(CONFIG_44x) && defined(CONFIG_PPC_FPU)
618static inline void identical_pvr_fixup(unsigned long node)
619{
620 unsigned int pvr;
621 char *model = of_get_flat_dt_prop(node, "model", NULL);
622
623 /*
624 * Since 440GR(x)/440EP(x) processors have the same pvr,
625 * we check the node path and set bit 28 in the cur_cpu_spec
626 * pvr for EP(x) processor version. This bit is always 0 in
627 * the "real" pvr. Then we call identify_cpu again with
628 * the new logical pvr to enable FPU support.
629 */
630 if (model && strstr(model, "440EP")) {
631 pvr = cur_cpu_spec->pvr_value | 0x8;
632 identify_cpu(0, pvr);
633 DBG("Using logical pvr %x for %s\n", pvr, model);
634 }
635}
636#else
637#define identical_pvr_fixup(node) do { } while(0)
638#endif
639
Paul Mackerras974a76f2006-11-10 20:38:53 +1100640static void __init check_cpu_feature_properties(unsigned long node)
641{
642 unsigned long i;
643 struct feature_property *fp = feature_properties;
644 const u32 *prop;
645
646 for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) {
647 prop = of_get_flat_dt_prop(node, fp->name, NULL);
648 if (prop && *prop >= fp->min_value) {
649 cur_cpu_spec->cpu_features |= fp->cpu_feature;
650 cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr;
651 }
652 }
653}
654
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000655static int __init early_init_dt_scan_cpus(unsigned long node,
Anton Blanchard4df20462006-03-25 17:25:17 +1100656 const char *uname, int depth,
657 void *data)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000658{
Anton Blanchard4df20462006-03-25 17:25:17 +1100659 static int logical_cpuid = 0;
660 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100661 const u32 *prop;
662 const u32 *intserv;
Anton Blanchard4df20462006-03-25 17:25:17 +1100663 int i, nthreads;
664 unsigned long len;
665 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000666
667 /* We are scanning "cpu" nodes only */
668 if (type == NULL || strcmp(type, "cpu") != 0)
669 return 0;
670
Anton Blanchard4df20462006-03-25 17:25:17 +1100671 /* Get physical cpuid */
672 intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len);
673 if (intserv) {
674 nthreads = len / sizeof(int);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000675 } else {
Anton Blanchard4df20462006-03-25 17:25:17 +1100676 intserv = of_get_flat_dt_prop(node, "reg", NULL);
677 nthreads = 1;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000678 }
Anton Blanchard4df20462006-03-25 17:25:17 +1100679
680 /*
681 * Now see if any of these threads match our boot cpu.
682 * NOTE: This must match the parsing done in smp_setup_cpu_maps.
683 */
684 for (i = 0; i < nthreads; i++) {
685 /*
686 * version 2 of the kexec param format adds the phys cpuid of
687 * booted proc.
688 */
689 if (initial_boot_params && initial_boot_params->version >= 2) {
690 if (intserv[i] ==
691 initial_boot_params->boot_cpuid_phys) {
692 found = 1;
693 break;
694 }
695 } else {
696 /*
697 * Check if it's the boot-cpu, set it's hw index now,
698 * unfortunately this format did not support booting
699 * off secondary threads.
700 */
701 if (of_get_flat_dt_prop(node,
702 "linux,boot-cpu", NULL) != NULL) {
703 found = 1;
704 break;
705 }
706 }
707
708#ifdef CONFIG_SMP
709 /* logical cpu id is always 0 on UP kernels */
710 logical_cpuid++;
711#endif
712 }
713
714 if (found) {
715 DBG("boot cpu: logical %d physical %d\n", logical_cpuid,
716 intserv[i]);
717 boot_cpuid = logical_cpuid;
718 set_hard_smp_processor_id(boot_cpuid, intserv[i]);
Paul Mackerras974a76f2006-11-10 20:38:53 +1100719
720 /*
721 * PAPR defines "logical" PVR values for cpus that
722 * meet various levels of the architecture:
723 * 0x0f000001 Architecture version 2.04
724 * 0x0f000002 Architecture version 2.05
725 * If the cpu-version property in the cpu node contains
726 * such a value, we call identify_cpu again with the
727 * logical PVR value in order to use the cpu feature
728 * bits appropriate for the architecture level.
729 *
730 * A POWER6 partition in "POWER6 architected" mode
731 * uses the 0x0f000002 PVR value; in POWER5+ mode
732 * it uses 0x0f000001.
733 */
734 prop = of_get_flat_dt_prop(node, "cpu-version", NULL);
735 if (prop && (*prop & 0xff000000) == 0x0f000000)
736 identify_cpu(0, *prop);
Valentine Barshak14b3d922007-12-22 03:24:02 +1100737
738 identical_pvr_fixup(node);
Anton Blanchard4df20462006-03-25 17:25:17 +1100739 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000740
Paul Mackerras974a76f2006-11-10 20:38:53 +1100741 check_cpu_feature_properties(node);
Paul Mackerrasd2058192006-05-03 23:04:37 +1000742 check_cpu_pa_features(node);
Michael Neuling584f8b72007-12-06 17:24:48 +1100743 check_cpu_slb_size(node);
Paul Mackerrasd2058192006-05-03 23:04:37 +1000744
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000745#ifdef CONFIG_PPC_PSERIES
Anton Blanchard4df20462006-03-25 17:25:17 +1100746 if (nthreads > 1)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000747 cur_cpu_spec->cpu_features |= CPU_FTR_SMT;
Anton Blanchard4df20462006-03-25 17:25:17 +1100748 else
749 cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000750#endif
751
752 return 0;
753}
754
Michael Ellerman40472a52007-05-10 17:06:30 +1000755#ifdef CONFIG_BLK_DEV_INITRD
756static void __init early_init_dt_check_for_initrd(unsigned long node)
757{
758 unsigned long l;
759 u32 *prop;
760
761 DBG("Looking for initrd properties... ");
762
763 prop = of_get_flat_dt_prop(node, "linux,initrd-start", &l);
764 if (prop) {
765 initrd_start = (unsigned long)__va(of_read_ulong(prop, l/4));
766
767 prop = of_get_flat_dt_prop(node, "linux,initrd-end", &l);
768 if (prop) {
769 initrd_end = (unsigned long)
770 __va(of_read_ulong(prop, l/4));
771 initrd_below_start_ok = 1;
772 } else {
773 initrd_start = 0;
774 }
775 }
776
777 DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end);
778}
779#else
780static inline void early_init_dt_check_for_initrd(unsigned long node)
781{
782}
783#endif /* CONFIG_BLK_DEV_INITRD */
784
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000785static int __init early_init_dt_scan_chosen(unsigned long node,
786 const char *uname, int depth, void *data)
787{
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000788 unsigned long *lprop;
Kumar Gala329dda02006-02-24 10:54:52 -0600789 unsigned long l;
790 char *p;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000791
792 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);
793
Paul Mackerrasa575b802005-10-23 17:23:21 +1000794 if (depth != 1 ||
795 (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0))
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000796 return 0;
797
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000798#ifdef CONFIG_PPC64
799 /* check if iommu is forced on or off */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100800 if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000801 iommu_is_off = 1;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100802 if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000803 iommu_force_on = 1;
804#endif
805
Michael Ellerman2babf5c2006-05-17 18:00:46 +1000806 /* mem=x on the command line is the preferred mechanism */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100807 lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000808 if (lprop)
809 memory_limit = *lprop;
810
811#ifdef CONFIG_PPC64
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100812 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000813 if (lprop)
814 tce_alloc_start = *lprop;
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100815 lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000816 if (lprop)
817 tce_alloc_end = *lprop;
818#endif
819
Michael Ellermandcee3032005-12-04 18:39:48 +1100820#ifdef CONFIG_KEXEC
Linas Vepstas70c6cc32007-09-07 03:46:15 +1000821 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL);
822 if (lprop)
823 crashk_res.start = *lprop;
Michael Ellermandcee3032005-12-04 18:39:48 +1100824
Linas Vepstas70c6cc32007-09-07 03:46:15 +1000825 lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL);
826 if (lprop)
827 crashk_res.end = crashk_res.start + *lprop - 1;
Michael Ellermandcee3032005-12-04 18:39:48 +1100828#endif
829
Michael Ellerman40472a52007-05-10 17:06:30 +1000830 early_init_dt_check_for_initrd(node);
David Gibson30437b32007-02-28 14:12:29 +1100831
Kumar Gala329dda02006-02-24 10:54:52 -0600832 /* Retreive command line */
833 p = of_get_flat_dt_prop(node, "bootargs", &l);
834 if (p != NULL && l > 0)
835 strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE));
836
837#ifdef CONFIG_CMDLINE
Geoff Levandc1ce4642006-10-05 11:35:16 -0700838 if (p == NULL || l == 0 || (l == 1 && (*p) == 0))
Kumar Gala329dda02006-02-24 10:54:52 -0600839 strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE);
840#endif /* CONFIG_CMDLINE */
841
842 DBG("Command line is: %s\n", cmd_line);
843
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000844 /* break now */
845 return 1;
846}
847
848static int __init early_init_dt_scan_root(unsigned long node,
849 const char *uname, int depth, void *data)
850{
851 u32 *prop;
852
853 if (depth != 0)
854 return 0;
855
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100856 prop = of_get_flat_dt_prop(node, "#size-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000857 dt_root_size_cells = (prop == NULL) ? 1 : *prop;
858 DBG("dt_root_size_cells = %x\n", dt_root_size_cells);
859
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100860 prop = of_get_flat_dt_prop(node, "#address-cells", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000861 dt_root_addr_cells = (prop == NULL) ? 2 : *prop;
862 DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells);
863
864 /* break now */
865 return 1;
866}
867
868static unsigned long __init dt_mem_next_cell(int s, cell_t **cellp)
869{
870 cell_t *p = *cellp;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000871
Paul Mackerrasa4dc7ff2006-09-19 14:06:27 +1000872 *cellp = p + s;
873 return of_read_ulong(p, s);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000874}
875
Paul Mackerras02045682006-11-29 22:27:42 +1100876#ifdef CONFIG_PPC_PSERIES
877/*
878 * Interpret the ibm,dynamic-memory property in the
879 * /ibm,dynamic-reconfiguration-memory node.
880 * This contains a list of memory blocks along with NUMA affinity
881 * information.
882 */
883static int __init early_init_dt_scan_drconf_memory(unsigned long node)
884{
885 cell_t *dm, *ls;
886 unsigned long l, n;
887 unsigned long base, size, lmb_size, flags;
888
889 ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l);
890 if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t))
891 return 0;
892 lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls);
893
894 dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l);
895 if (dm == NULL || l < sizeof(cell_t))
896 return 0;
897
898 n = *dm++; /* number of entries */
899 if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t))
900 return 0;
901
902 for (; n != 0; --n) {
903 base = dt_mem_next_cell(dt_root_addr_cells, &dm);
904 flags = dm[3];
905 /* skip DRC index, pad, assoc. list index, flags */
906 dm += 4;
907 /* skip this block if the reserved bit is set in flags (0x80)
908 or if the block is not assigned to this partition (0x8) */
909 if ((flags & 0x80) || !(flags & 0x8))
910 continue;
911 size = lmb_size;
912 if (iommu_is_off) {
913 if (base >= 0x80000000ul)
914 continue;
915 if ((base + size) > 0x80000000ul)
916 size = 0x80000000ul - base;
917 }
918 lmb_add(base, size);
919 }
920 lmb_dump_all();
921 return 0;
922}
923#else
924#define early_init_dt_scan_drconf_memory(node) 0
925#endif /* CONFIG_PPC_PSERIES */
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000926
927static int __init early_init_dt_scan_memory(unsigned long node,
928 const char *uname, int depth, void *data)
929{
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +1100930 char *type = of_get_flat_dt_prop(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000931 cell_t *reg, *endp;
932 unsigned long l;
933
Paul Mackerras02045682006-11-29 22:27:42 +1100934 /* Look for the ibm,dynamic-reconfiguration-memory node */
935 if (depth == 1 &&
936 strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0)
937 return early_init_dt_scan_drconf_memory(node);
938
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000939 /* We are scanning "memory" nodes only */
Paul Mackerrasa23414b2005-11-10 12:00:55 +1100940 if (type == NULL) {
941 /*
942 * The longtrail doesn't have a device_type on the
943 * /memory node, so look for the node called /memory@0.
944 */
945 if (depth != 1 || strcmp(uname, "memory@0") != 0)
946 return 0;
947 } else if (strcmp(type, "memory") != 0)
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000948 return 0;
949
Michael Ellermanba759482005-12-04 18:39:55 +1100950 reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l);
951 if (reg == NULL)
952 reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l);
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000953 if (reg == NULL)
954 return 0;
955
956 endp = reg + (l / sizeof(cell_t));
957
Michael Ellerman358c86f2005-11-03 15:39:09 +1100958 DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n",
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000959 uname, l, reg[0], reg[1], reg[2], reg[3]);
960
961 while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) {
962 unsigned long base, size;
963
964 base = dt_mem_next_cell(dt_root_addr_cells, &reg);
965 size = dt_mem_next_cell(dt_root_size_cells, &reg);
966
967 if (size == 0)
968 continue;
969 DBG(" - %lx , %lx\n", base, size);
970#ifdef CONFIG_PPC64
971 if (iommu_is_off) {
972 if (base >= 0x80000000ul)
973 continue;
974 if ((base + size) > 0x80000000ul)
975 size = 0x80000000ul - base;
976 }
977#endif
978 lmb_add(base, size);
979 }
980 return 0;
981}
982
983static void __init early_reserve_mem(void)
984{
Kumar Galacbbcf342006-01-11 17:57:13 -0600985 u64 base, size;
986 u64 *reserve_map;
Jon Loeliger8a300882006-06-17 17:51:09 -0500987 unsigned long self_base;
988 unsigned long self_size;
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000989
Kumar Galacbbcf342006-01-11 17:57:13 -0600990 reserve_map = (u64 *)(((unsigned long)initial_boot_params) +
Paul Mackerras9b6b5632005-10-06 12:06:20 +1000991 initial_boot_params->off_mem_rsvmap);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500992
993 /* before we do anything, lets reserve the dt blob */
Jon Loeliger8a300882006-06-17 17:51:09 -0500994 self_base = __pa((unsigned long)initial_boot_params);
995 self_size = initial_boot_params->totalsize;
996 lmb_reserve(self_base, self_size);
Jimi Xenidis4d1f3f22006-05-18 17:03:05 -0500997
David Gibson30437b32007-02-28 14:12:29 +1100998#ifdef CONFIG_BLK_DEV_INITRD
999 /* then reserve the initrd, if any */
1000 if (initrd_start && (initrd_end > initrd_start))
1001 lmb_reserve(__pa(initrd_start), initrd_end - initrd_start);
1002#endif /* CONFIG_BLK_DEV_INITRD */
1003
Kumar Galacbbcf342006-01-11 17:57:13 -06001004#ifdef CONFIG_PPC32
1005 /*
1006 * Handle the case where we might be booting from an old kexec
1007 * image that setup the mem_rsvmap as pairs of 32-bit values
1008 */
1009 if (*reserve_map > 0xffffffffull) {
1010 u32 base_32, size_32;
1011 u32 *reserve_map_32 = (u32 *)reserve_map;
1012
1013 while (1) {
1014 base_32 = *(reserve_map_32++);
1015 size_32 = *(reserve_map_32++);
1016 if (size_32 == 0)
1017 break;
Jon Loeliger8a300882006-06-17 17:51:09 -05001018 /* skip if the reservation is for the blob */
1019 if (base_32 == self_base && size_32 == self_size)
1020 continue;
Kumar Gala329dda02006-02-24 10:54:52 -06001021 DBG("reserving: %x -> %x\n", base_32, size_32);
Kumar Galacbbcf342006-01-11 17:57:13 -06001022 lmb_reserve(base_32, size_32);
1023 }
1024 return;
1025 }
1026#endif
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001027 while (1) {
1028 base = *(reserve_map++);
1029 size = *(reserve_map++);
1030 if (size == 0)
1031 break;
Kumar Galacbbcf342006-01-11 17:57:13 -06001032 DBG("reserving: %llx -> %llx\n", base, size);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001033 lmb_reserve(base, size);
1034 }
1035
1036#if 0
1037 DBG("memory reserved, lmbs :\n");
1038 lmb_dump_all();
1039#endif
1040}
1041
1042void __init early_init_devtree(void *params)
1043{
Geoff Levand44348102007-06-16 08:06:14 +10001044 DBG(" -> early_init_devtree(%p)\n", params);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001045
1046 /* Setup flat device-tree pointer */
1047 initial_boot_params = params;
1048
Michael Ellerman458148c2006-06-23 18:20:13 +10001049#ifdef CONFIG_PPC_RTAS
1050 /* Some machines might need RTAS info for debugging, grab it now. */
1051 of_scan_flat_dt(early_init_dt_scan_rtas, NULL);
1052#endif
1053
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001054 /* Retrieve various informations from the /chosen node of the
1055 * device-tree, including the platform type, initrd location and
1056 * size, TCE reserve, and more ...
1057 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001058 of_scan_flat_dt(early_init_dt_scan_chosen, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001059
1060 /* Scan memory nodes and rebuild LMBs */
1061 lmb_init();
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001062 of_scan_flat_dt(early_init_dt_scan_root, NULL);
1063 of_scan_flat_dt(early_init_dt_scan_memory, NULL);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001064
1065 /* Save command line for /proc/cmdline and then parse parameters */
Alon Bar-Levb8757b22007-02-12 00:54:17 -08001066 strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE);
Michael Ellerman846f77b2006-05-17 18:00:45 +10001067 parse_early_param();
1068
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001069 /* Reserve LMB regions used by kernel, initrd, dt, etc... */
Michael Ellerman0cc47462005-12-04 18:39:37 +11001070 lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START);
Michael Ellerman47310412006-05-17 18:00:49 +10001071 reserve_kdump_trampoline();
Michael Ellerman35dd5432006-05-18 11:16:11 +10001072 reserve_crashkernel();
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001073 early_reserve_mem();
1074
Michael Ellerman2babf5c2006-05-17 18:00:46 +10001075 lmb_enforce_memory_limit(memory_limit);
1076 lmb_analyze();
1077
1078 DBG("Phys. mem: %lx\n", lmb_phys_mem_size());
1079
1080 /* We may need to relocate the flat tree, do it now.
1081 * FIXME .. and the initrd too? */
1082 move_device_tree();
1083
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001084 DBG("Scanning CPUs ...\n");
1085
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001086 /* Retreive CPU related informations from the flat tree
1087 * (altivec support, boot CPU ID, ...)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001088 */
Benjamin Herrenschmidt3c726f82005-11-07 11:06:55 +11001089 of_scan_flat_dt(early_init_dt_scan_cpus, NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001090
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001091 DBG(" <- early_init_devtree()\n");
1092}
1093
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001094
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001095/**
1096 * Indicates whether the root node has a given value in its
1097 * compatible property.
1098 */
1099int machine_is_compatible(const char *compat)
1100{
1101 struct device_node *root;
1102 int rc = 0;
1103
1104 root = of_find_node_by_path("/");
1105 if (root) {
Stephen Rothwell7a92f742007-04-03 10:55:39 +10001106 rc = of_device_is_compatible(root, compat);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001107 of_node_put(root);
1108 }
1109 return rc;
1110}
1111EXPORT_SYMBOL(machine_is_compatible);
1112
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001113/*******
1114 *
1115 * New implementation of the OF "find" APIs, return a refcounted
1116 * object, call of_node_put() when done. The device tree and list
1117 * are protected by a rw_lock.
1118 *
1119 * Note that property management will need some locking as well,
1120 * this isn't dealt with yet.
1121 *
1122 *******/
1123
1124/**
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001125 * of_find_node_by_phandle - Find a node given a phandle
1126 * @handle: phandle of the node to find
1127 *
1128 * Returns a node pointer with refcount incremented, use
1129 * of_node_put() on it when done.
1130 */
1131struct device_node *of_find_node_by_phandle(phandle handle)
1132{
1133 struct device_node *np;
1134
1135 read_lock(&devtree_lock);
1136 for (np = allnodes; np != 0; np = np->allnext)
1137 if (np->linux_phandle == handle)
1138 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001139 of_node_get(np);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001140 read_unlock(&devtree_lock);
1141 return np;
1142}
1143EXPORT_SYMBOL(of_find_node_by_phandle);
1144
1145/**
1146 * of_find_all_nodes - Get next node in global list
1147 * @prev: Previous node or NULL to start iteration
1148 * of_node_put() will be called on it
1149 *
1150 * Returns a node pointer with refcount incremented, use
1151 * of_node_put() on it when done.
1152 */
1153struct device_node *of_find_all_nodes(struct device_node *prev)
1154{
1155 struct device_node *np;
1156
1157 read_lock(&devtree_lock);
1158 np = prev ? prev->allnext : allnodes;
1159 for (; np != 0; np = np->allnext)
1160 if (of_node_get(np))
1161 break;
Mariusz Kozlowskib1374052007-01-02 12:31:47 +01001162 of_node_put(prev);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001163 read_unlock(&devtree_lock);
1164 return np;
1165}
1166EXPORT_SYMBOL(of_find_all_nodes);
1167
1168/**
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001169 * of_node_get - Increment refcount of a node
1170 * @node: Node to inc refcount, NULL is supported to
1171 * simplify writing of callers
1172 *
1173 * Returns node.
1174 */
1175struct device_node *of_node_get(struct device_node *node)
1176{
1177 if (node)
1178 kref_get(&node->kref);
1179 return node;
1180}
1181EXPORT_SYMBOL(of_node_get);
1182
1183static inline struct device_node * kref_to_device_node(struct kref *kref)
1184{
1185 return container_of(kref, struct device_node, kref);
1186}
1187
1188/**
1189 * of_node_release - release a dynamically allocated node
1190 * @kref: kref element of the node to be released
1191 *
1192 * In of_node_put() this function is passed to kref_put()
1193 * as the destructor.
1194 */
1195static void of_node_release(struct kref *kref)
1196{
1197 struct device_node *node = kref_to_device_node(kref);
1198 struct property *prop = node->properties;
1199
Michael Ellerman6a2818562007-06-19 16:08:00 +10001200 /* We should never be releasing nodes that haven't been detached. */
1201 if (!of_node_check_flag(node, OF_DETACHED)) {
1202 printk("WARNING: Bad of_node_put() on %s\n", node->full_name);
1203 dump_stack();
1204 kref_init(&node->kref);
1205 return;
1206 }
1207
Michael Ellermand3b814b2007-06-19 16:07:58 +10001208 if (!of_node_check_flag(node, OF_DYNAMIC))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001209 return;
Michael Ellerman6a2818562007-06-19 16:08:00 +10001210
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001211 while (prop) {
1212 struct property *next = prop->next;
1213 kfree(prop->name);
1214 kfree(prop->value);
1215 kfree(prop);
1216 prop = next;
Dave C Boutcher088186d2006-01-12 16:08:27 -06001217
1218 if (!prop) {
1219 prop = node->deadprops;
1220 node->deadprops = NULL;
1221 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001222 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001223 kfree(node->full_name);
1224 kfree(node->data);
1225 kfree(node);
1226}
1227
1228/**
1229 * of_node_put - Decrement refcount of a node
1230 * @node: Node to dec refcount, NULL is supported to
1231 * simplify writing of callers
1232 *
1233 */
1234void of_node_put(struct device_node *node)
1235{
1236 if (node)
1237 kref_put(&node->kref, of_node_release);
1238}
1239EXPORT_SYMBOL(of_node_put);
1240
1241/*
1242 * Plug a device node into the tree and global list.
1243 */
1244void of_attach_node(struct device_node *np)
1245{
1246 write_lock(&devtree_lock);
1247 np->sibling = np->parent->child;
1248 np->allnext = allnodes;
1249 np->parent->child = np;
1250 allnodes = np;
1251 write_unlock(&devtree_lock);
1252}
1253
1254/*
1255 * "Unplug" a node from the device tree. The caller must hold
1256 * a reference to the node. The memory associated with the node
1257 * is not freed until its refcount goes to zero.
1258 */
Segher Boessenkool34f329d2007-07-20 15:58:38 +10001259void of_detach_node(struct device_node *np)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001260{
1261 struct device_node *parent;
1262
1263 write_lock(&devtree_lock);
1264
1265 parent = np->parent;
Michael Ellerman972d17c2007-06-19 16:07:56 +10001266 if (!parent)
1267 goto out_unlock;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001268
1269 if (allnodes == np)
1270 allnodes = np->allnext;
1271 else {
1272 struct device_node *prev;
1273 for (prev = allnodes;
1274 prev->allnext != np;
1275 prev = prev->allnext)
1276 ;
1277 prev->allnext = np->allnext;
1278 }
1279
1280 if (parent->child == np)
1281 parent->child = np->sibling;
1282 else {
1283 struct device_node *prevsib;
1284 for (prevsib = np->parent->child;
1285 prevsib->sibling != np;
1286 prevsib = prevsib->sibling)
1287 ;
1288 prevsib->sibling = np->sibling;
1289 }
1290
Michael Ellerman6a2818562007-06-19 16:08:00 +10001291 of_node_set_flag(np, OF_DETACHED);
1292
Michael Ellerman972d17c2007-06-19 16:07:56 +10001293out_unlock:
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001294 write_unlock(&devtree_lock);
1295}
1296
1297#ifdef CONFIG_PPC_PSERIES
1298/*
1299 * Fix up the uninitialized fields in a new device node:
Benjamin Herrenschmidt0ebfff12006-07-03 21:36:01 +10001300 * name, type and pci-specific fields
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001301 */
1302
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001303static int of_finish_dynamic_node(struct device_node *node)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001304{
1305 struct device_node *parent = of_get_parent(node);
1306 int err = 0;
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001307 const phandle *ibm_phandle;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001308
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001309 node->name = of_get_property(node, "name", NULL);
1310 node->type = of_get_property(node, "device_type", NULL);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001311
Benjamin Herrenschmidt847f5972007-05-16 16:57:24 +10001312 if (!node->name)
1313 node->name = "<NULL>";
1314 if (!node->type)
1315 node->type = "<NULL>";
1316
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001317 if (!parent) {
1318 err = -ENODEV;
1319 goto out;
1320 }
1321
1322 /* We don't support that function on PowerMac, at least
1323 * not yet
1324 */
Benjamin Herrenschmidte8222502006-03-28 23:15:54 +11001325 if (machine_is(powermac))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001326 return -ENODEV;
1327
1328 /* fix up new node's linux_phandle field */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001329 if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL)))
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001330 node->linux_phandle = *ibm_phandle;
1331
1332out:
1333 of_node_put(parent);
1334 return err;
1335}
1336
1337static int prom_reconfig_notifier(struct notifier_block *nb,
1338 unsigned long action, void *node)
1339{
1340 int err;
1341
1342 switch (action) {
1343 case PSERIES_RECONFIG_ADD:
Benjamin Herrenschmidtcc5d0182005-12-13 18:01:21 +11001344 err = of_finish_dynamic_node(node);
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001345 if (err < 0) {
1346 printk(KERN_ERR "finish_node returned %d\n", err);
1347 err = NOTIFY_BAD;
1348 }
1349 break;
1350 default:
1351 err = NOTIFY_DONE;
1352 break;
1353 }
1354 return err;
1355}
1356
1357static struct notifier_block prom_reconfig_nb = {
1358 .notifier_call = prom_reconfig_notifier,
1359 .priority = 10, /* This one needs to run first */
1360};
1361
1362static int __init prom_reconfig_setup(void)
1363{
1364 return pSeries_reconfig_notifier_register(&prom_reconfig_nb);
1365}
1366__initcall(prom_reconfig_setup);
1367#endif
1368
Dave C Boutcherecaa8b02006-01-12 16:09:29 -06001369/*
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001370 * Add a property to a node
1371 */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001372int prom_add_property(struct device_node* np, struct property* prop)
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001373{
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001374 struct property **next;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001375
1376 prop->next = NULL;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001377 write_lock(&devtree_lock);
1378 next = &np->properties;
1379 while (*next) {
1380 if (strcmp(prop->name, (*next)->name) == 0) {
1381 /* duplicate ! don't insert it */
1382 write_unlock(&devtree_lock);
1383 return -1;
1384 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001385 next = &(*next)->next;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001386 }
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001387 *next = prop;
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001388 write_unlock(&devtree_lock);
1389
Paul Mackerras799d6042005-11-10 13:37:51 +11001390#ifdef CONFIG_PROC_DEVICETREE
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001391 /* try to add to proc as well if it was initialized */
1392 if (np->pde)
1393 proc_device_tree_add_prop(np->pde, prop);
Paul Mackerras799d6042005-11-10 13:37:51 +11001394#endif /* CONFIG_PROC_DEVICETREE */
Benjamin Herrenschmidt183d0202005-11-07 14:29:02 +11001395
1396 return 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001397}
1398
Dave C Boutcher088186d2006-01-12 16:08:27 -06001399/*
1400 * Remove a property from a node. Note that we don't actually
1401 * remove it, since we have given out who-knows-how-many pointers
1402 * to the data using get-property. Instead we just move the property
1403 * to the "dead properties" list, so it won't be found any more.
1404 */
1405int prom_remove_property(struct device_node *np, struct property *prop)
1406{
1407 struct property **next;
1408 int found = 0;
Paul Mackerras9b6b5632005-10-06 12:06:20 +10001409
Dave C Boutcher088186d2006-01-12 16:08:27 -06001410 write_lock(&devtree_lock);
1411 next = &np->properties;
1412 while (*next) {
1413 if (*next == prop) {
1414 /* found the node */
1415 *next = prop->next;
1416 prop->next = np->deadprops;
1417 np->deadprops = prop;
1418 found = 1;
1419 break;
1420 }
1421 next = &(*next)->next;
1422 }
1423 write_unlock(&devtree_lock);
1424
1425 if (!found)
1426 return -ENODEV;
1427
1428#ifdef CONFIG_PROC_DEVICETREE
1429 /* try to remove the proc node as well */
1430 if (np->pde)
1431 proc_device_tree_remove_prop(np->pde, prop);
1432#endif /* CONFIG_PROC_DEVICETREE */
1433
1434 return 0;
1435}
1436
1437/*
1438 * Update a property in a node. Note that we don't actually
1439 * remove it, since we have given out who-knows-how-many pointers
1440 * to the data using get-property. Instead we just move the property
1441 * to the "dead properties" list, and add the new property to the
1442 * property list
1443 */
1444int prom_update_property(struct device_node *np,
1445 struct property *newprop,
1446 struct property *oldprop)
1447{
1448 struct property **next;
1449 int found = 0;
1450
1451 write_lock(&devtree_lock);
1452 next = &np->properties;
1453 while (*next) {
1454 if (*next == oldprop) {
1455 /* found the node */
1456 newprop->next = oldprop->next;
1457 *next = newprop;
1458 oldprop->next = np->deadprops;
1459 np->deadprops = oldprop;
1460 found = 1;
1461 break;
1462 }
1463 next = &(*next)->next;
1464 }
1465 write_unlock(&devtree_lock);
1466
1467 if (!found)
1468 return -ENODEV;
1469
1470#ifdef CONFIG_PROC_DEVICETREE
1471 /* try to add to proc as well if it was initialized */
1472 if (np->pde)
1473 proc_device_tree_update_prop(np->pde, newprop, oldprop);
1474#endif /* CONFIG_PROC_DEVICETREE */
1475
1476 return 0;
1477}
Michael Ellermanb68239e2006-02-03 19:05:47 +11001478
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001479
1480/* Find the device node for a given logical cpu number, also returns the cpu
1481 * local thread number (index in ibm,interrupt-server#s) if relevant and
1482 * asked for (non NULL)
1483 */
1484struct device_node *of_get_cpu_node(int cpu, unsigned int *thread)
1485{
1486 int hardid;
1487 struct device_node *np;
1488
1489 hardid = get_hard_smp_processor_id(cpu);
1490
1491 for_each_node_by_type(np, "cpu") {
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001492 const u32 *intserv;
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001493 unsigned int plen, t;
1494
1495 /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist
1496 * fallback to "reg" property and assume no threads
1497 */
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001498 intserv = of_get_property(np, "ibm,ppc-interrupt-server#s",
Jeremy Kerra7f67bd2006-07-12 15:35:54 +10001499 &plen);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001500 if (intserv == NULL) {
Stephen Rothwell0e56efc2007-04-03 10:54:01 +10001501 const u32 *reg = of_get_property(np, "reg", NULL);
Benjamin Herrenschmidtacf7d762006-06-19 20:33:16 +02001502 if (reg == NULL)
1503 continue;
1504 if (*reg == hardid) {
1505 if (thread)
1506 *thread = 0;
1507 return np;
1508 }
1509 } else {
1510 plen /= sizeof(u32);
1511 for (t = 0; t < plen; t++) {
1512 if (hardid == intserv[t]) {
1513 if (thread)
1514 *thread = t;
1515 return np;
1516 }
1517 }
1518 }
1519 }
1520 return NULL;
1521}
Christian Krafft36ca4ba2006-10-24 18:39:45 +02001522EXPORT_SYMBOL(of_get_cpu_node);
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001523
Michael Ellerman94a38072007-06-20 10:54:19 +10001524#if defined(CONFIG_DEBUG_FS) && defined(DEBUG)
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001525static struct debugfs_blob_wrapper flat_dt_blob;
1526
1527static int __init export_flat_device_tree(void)
1528{
1529 struct dentry *d;
1530
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001531 flat_dt_blob.data = initial_boot_params;
1532 flat_dt_blob.size = initial_boot_params->totalsize;
1533
1534 d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR,
Michael Ellerman94a38072007-06-20 10:54:19 +10001535 powerpc_debugfs_root, &flat_dt_blob);
Michael Ellerman7a4571a2006-06-23 18:16:03 +10001536 if (!d)
1537 return 1;
1538
1539 return 0;
1540}
1541__initcall(export_flat_device_tree);
1542#endif