]>
Commit | Line | Data |
---|---|---|
9b6b563c PM |
1 | /* |
2 | * Procedures for creating, accessing and interpreting the device tree. | |
3 | * | |
4 | * Paul Mackerras August 1996. | |
5 | * Copyright (C) 1996-2005 Paul Mackerras. | |
6 | * | |
7 | * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner. | |
8 | * {engebret|bergner}@us.ibm.com | |
9 | * | |
10 | * This program is free software; you can redistribute it and/or | |
11 | * modify it under the terms of the GNU General Public License | |
12 | * as published by the Free Software Foundation; either version | |
13 | * 2 of the License, or (at your option) any later version. | |
14 | */ | |
15 | ||
16 | #undef DEBUG | |
17 | ||
18 | #include <stdarg.h> | |
9b6b563c PM |
19 | #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> | |
dcee3036 | 31 | #include <linux/kexec.h> |
7a4571ae | 32 | #include <linux/debugfs.h> |
0ebfff14 | 33 | #include <linux/irq.h> |
d9b2b2a2 | 34 | #include <linux/lmb.h> |
9b6b563c PM |
35 | |
36 | #include <asm/prom.h> | |
37 | #include <asm/rtas.h> | |
9b6b563c PM |
38 | #include <asm/page.h> |
39 | #include <asm/processor.h> | |
40 | #include <asm/irq.h> | |
41 | #include <asm/io.h> | |
0cc4746c | 42 | #include <asm/kdump.h> |
9b6b563c PM |
43 | #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> | |
40ef8cbc | 53 | #include <asm/pci-bridge.h> |
6ac26c8a | 54 | #include <asm/phyp_dump.h> |
2babf5c2 | 55 | #include <asm/kexec.h> |
9b6b563c PM |
56 | |
57 | #ifdef DEBUG | |
58 | #define DBG(fmt...) printk(KERN_ERR fmt) | |
59 | #else | |
60 | #define DBG(fmt...) | |
61 | #endif | |
62 | ||
9b6b563c | 63 | |
9b6b563c PM |
64 | static int __initdata dt_root_addr_cells; |
65 | static int __initdata dt_root_size_cells; | |
66 | ||
67 | #ifdef CONFIG_PPC64 | |
28897731 | 68 | int __initdata iommu_is_off; |
9b6b563c | 69 | int __initdata iommu_force_on; |
cf00a8d1 | 70 | unsigned long tce_alloc_start, tce_alloc_end; |
9b6b563c PM |
71 | #endif |
72 | ||
73 | typedef u32 cell_t; | |
74 | ||
75 | #if 0 | |
76 | static struct boot_param_header *initial_boot_params __initdata; | |
77 | #else | |
78 | struct boot_param_header *initial_boot_params; | |
79 | #endif | |
80 | ||
1ef4d424 | 81 | extern struct device_node *allnodes; /* temporary while merging */ |
9b6b563c | 82 | |
581b605a | 83 | extern rwlock_t devtree_lock; /* temporary while merging */ |
9b6b563c PM |
84 | |
85 | /* export that to outside world */ | |
86 | struct device_node *of_chosen; | |
87 | ||
9b6b563c PM |
88 | static 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 | */ | |
3c726f8d BH |
99 | int __init of_scan_flat_dt(int (*it)(unsigned long node, |
100 | const char *uname, int depth, | |
101 | void *data), | |
102 | void *data) | |
9b6b563c PM |
103 | { |
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 | ||
e8222502 BH |
155 | unsigned 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 | ||
9b6b563c PM |
167 | /** |
168 | * This function can be used within scan_flattened_dt callback to get | |
169 | * access to properties | |
170 | */ | |
3c726f8d BH |
171 | void* __init of_get_flat_dt_prop(unsigned long node, const char *name, |
172 | unsigned long *size) | |
9b6b563c PM |
173 | { |
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 | ||
e8222502 BH |
209 | int __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 | ||
9b6b563c PM |
228 | static 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 | ||
240 | static 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", | |
e8222502 | 302 | pathp, (int)strlen(p), l, allocl); |
9b6b563c PM |
303 | } |
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; | |
1a38147e | 391 | pp->value = pp + 1; |
9b6b563c PM |
392 | *prev_pp = pp; |
393 | prev_pp = &pp->next; | |
394 | memcpy(pp->value, ps, sz - 1); | |
395 | ((char *)pp->value)[sz - 1] = 0; | |
1a38147e SR |
396 | DBG("fixed up name for %s -> %s\n", pathp, |
397 | (char *)pp->value); | |
9b6b563c PM |
398 | } |
399 | } | |
400 | if (allnextpp) { | |
401 | *prev_pp = NULL; | |
0e56efc7 SR |
402 | np->name = of_get_property(np, "name", NULL); |
403 | np->type = of_get_property(np, "device_type", NULL); | |
9b6b563c PM |
404 | |
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 | ||
2babf5c2 ME |
422 | static 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 | } | |
432 | early_param("mem", early_parse_mem); | |
433 | ||
3c607ce2 LV |
434 | /** |
435 | * move_device_tree - move tree to an unused area, if needed. | |
436 | * | |
437 | * The device tree may be allocated beyond our memory limit, or inside the | |
438 | * crash kernel region for kdump. If so, move it out of the way. | |
2babf5c2 ME |
439 | */ |
440 | static void move_device_tree(void) | |
441 | { | |
442 | unsigned long start, size; | |
443 | void *p; | |
444 | ||
445 | DBG("-> move_device_tree\n"); | |
446 | ||
447 | start = __pa(initial_boot_params); | |
448 | size = initial_boot_params->totalsize; | |
449 | ||
450 | if ((memory_limit && (start + size) > memory_limit) || | |
451 | overlaps_crashkernel(start, size)) { | |
452 | p = __va(lmb_alloc_base(size, PAGE_SIZE, lmb.rmo_size)); | |
453 | memcpy(p, initial_boot_params, size); | |
454 | initial_boot_params = (struct boot_param_header *)p; | |
455 | DBG("Moved device tree to 0x%p\n", p); | |
456 | } | |
457 | ||
458 | DBG("<- move_device_tree\n"); | |
459 | } | |
9b6b563c PM |
460 | |
461 | /** | |
462 | * unflattens the device-tree passed by the firmware, creating the | |
463 | * tree of struct device_node. It also fills the "name" and "type" | |
464 | * pointers of the nodes so the normal device-tree walking functions | |
465 | * can be used (this used to be done by finish_device_tree) | |
466 | */ | |
467 | void __init unflatten_device_tree(void) | |
468 | { | |
469 | unsigned long start, mem, size; | |
470 | struct device_node **allnextp = &allnodes; | |
9b6b563c PM |
471 | |
472 | DBG(" -> unflatten_device_tree()\n"); | |
473 | ||
474 | /* First pass, scan for size */ | |
475 | start = ((unsigned long)initial_boot_params) + | |
476 | initial_boot_params->off_dt_struct; | |
477 | size = unflatten_dt_node(0, &start, NULL, NULL, 0); | |
478 | size = (size | 3) + 1; | |
479 | ||
480 | DBG(" size is %lx, allocating...\n", size); | |
481 | ||
482 | /* Allocate memory for the expanded device tree */ | |
483 | mem = lmb_alloc(size + 4, __alignof__(struct device_node)); | |
9b6b563c PM |
484 | mem = (unsigned long) __va(mem); |
485 | ||
486 | ((u32 *)mem)[size / 4] = 0xdeadbeef; | |
487 | ||
488 | DBG(" unflattening %lx...\n", mem); | |
489 | ||
490 | /* Second pass, do actual unflattening */ | |
491 | start = ((unsigned long)initial_boot_params) + | |
492 | initial_boot_params->off_dt_struct; | |
493 | unflatten_dt_node(mem, &start, NULL, &allnextp, 0); | |
494 | if (*((u32 *)start) != OF_DT_END) | |
495 | printk(KERN_WARNING "Weird tag at end of tree: %08x\n", *((u32 *)start)); | |
496 | if (((u32 *)mem)[size / 4] != 0xdeadbeef) | |
497 | printk(KERN_WARNING "End of tree marker overwritten: %08x\n", | |
498 | ((u32 *)mem)[size / 4] ); | |
499 | *allnextp = NULL; | |
500 | ||
501 | /* Get pointer to OF "/chosen" node for use everywhere */ | |
502 | of_chosen = of_find_node_by_path("/chosen"); | |
a575b807 PM |
503 | if (of_chosen == NULL) |
504 | of_chosen = of_find_node_by_path("/chosen@0"); | |
9b6b563c | 505 | |
9b6b563c PM |
506 | DBG(" <- unflatten_device_tree()\n"); |
507 | } | |
508 | ||
d205819e PM |
509 | /* |
510 | * ibm,pa-features is a per-cpu property that contains a string of | |
511 | * attribute descriptors, each of which has a 2 byte header plus up | |
512 | * to 254 bytes worth of processor attribute bits. First header | |
513 | * byte specifies the number of bytes following the header. | |
514 | * Second header byte is an "attribute-specifier" type, of which | |
515 | * zero is the only currently-defined value. | |
516 | * Implementation: Pass in the byte and bit offset for the feature | |
517 | * that we are interested in. The function will return -1 if the | |
518 | * pa-features property is missing, or a 1/0 to indicate if the feature | |
519 | * is supported/not supported. Note that the bit numbers are | |
520 | * big-endian to match the definition in PAPR. | |
521 | */ | |
522 | static struct ibm_pa_feature { | |
523 | unsigned long cpu_features; /* CPU_FTR_xxx bit */ | |
524 | unsigned int cpu_user_ftrs; /* PPC_FEATURE_xxx bit */ | |
525 | unsigned char pabyte; /* byte number in ibm,pa-features */ | |
526 | unsigned char pabit; /* bit number (big-endian) */ | |
527 | unsigned char invert; /* if 1, pa bit set => clear feature */ | |
528 | } ibm_pa_features[] __initdata = { | |
529 | {0, PPC_FEATURE_HAS_MMU, 0, 0, 0}, | |
530 | {0, PPC_FEATURE_HAS_FPU, 0, 1, 0}, | |
531 | {CPU_FTR_SLB, 0, 0, 2, 0}, | |
532 | {CPU_FTR_CTRL, 0, 0, 3, 0}, | |
533 | {CPU_FTR_NOEXECUTE, 0, 0, 6, 0}, | |
534 | {CPU_FTR_NODSISRALIGN, 0, 1, 1, 1}, | |
535 | {CPU_FTR_CI_LARGE_PAGE, 0, 1, 2, 0}, | |
339d76c5 | 536 | {CPU_FTR_REAL_LE, PPC_FEATURE_TRUE_LE, 5, 0, 0}, |
d205819e PM |
537 | }; |
538 | ||
974a76f5 PM |
539 | static void __init scan_features(unsigned long node, unsigned char *ftrs, |
540 | unsigned long tablelen, | |
541 | struct ibm_pa_feature *fp, | |
542 | unsigned long ft_size) | |
d205819e | 543 | { |
974a76f5 | 544 | unsigned long i, len, bit; |
d205819e PM |
545 | |
546 | /* find descriptor with type == 0 */ | |
547 | for (;;) { | |
548 | if (tablelen < 3) | |
549 | return; | |
974a76f5 | 550 | len = 2 + ftrs[0]; |
d205819e PM |
551 | if (tablelen < len) |
552 | return; /* descriptor 0 not found */ | |
974a76f5 | 553 | if (ftrs[1] == 0) |
d205819e PM |
554 | break; |
555 | tablelen -= len; | |
974a76f5 | 556 | ftrs += len; |
d205819e PM |
557 | } |
558 | ||
559 | /* loop over bits we know about */ | |
974a76f5 PM |
560 | for (i = 0; i < ft_size; ++i, ++fp) { |
561 | if (fp->pabyte >= ftrs[0]) | |
d205819e | 562 | continue; |
974a76f5 | 563 | bit = (ftrs[2 + fp->pabyte] >> (7 - fp->pabit)) & 1; |
d205819e PM |
564 | if (bit ^ fp->invert) { |
565 | cur_cpu_spec->cpu_features |= fp->cpu_features; | |
566 | cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftrs; | |
567 | } else { | |
568 | cur_cpu_spec->cpu_features &= ~fp->cpu_features; | |
569 | cur_cpu_spec->cpu_user_features &= ~fp->cpu_user_ftrs; | |
570 | } | |
571 | } | |
572 | } | |
573 | ||
974a76f5 PM |
574 | static void __init check_cpu_pa_features(unsigned long node) |
575 | { | |
576 | unsigned char *pa_ftrs; | |
577 | unsigned long tablelen; | |
578 | ||
579 | pa_ftrs = of_get_flat_dt_prop(node, "ibm,pa-features", &tablelen); | |
580 | if (pa_ftrs == NULL) | |
581 | return; | |
582 | ||
583 | scan_features(node, pa_ftrs, tablelen, | |
584 | ibm_pa_features, ARRAY_SIZE(ibm_pa_features)); | |
585 | } | |
586 | ||
584f8b71 MN |
587 | #ifdef CONFIG_PPC64 |
588 | static void __init check_cpu_slb_size(unsigned long node) | |
589 | { | |
590 | u32 *slb_size_ptr; | |
591 | ||
592 | slb_size_ptr = of_get_flat_dt_prop(node, "ibm,slb-size", NULL); | |
593 | if (slb_size_ptr != NULL) { | |
594 | mmu_slb_size = *slb_size_ptr; | |
595 | } | |
596 | } | |
597 | #else | |
598 | #define check_cpu_slb_size(node) do { } while(0) | |
599 | #endif | |
600 | ||
974a76f5 PM |
601 | static struct feature_property { |
602 | const char *name; | |
603 | u32 min_value; | |
604 | unsigned long cpu_feature; | |
605 | unsigned long cpu_user_ftr; | |
606 | } feature_properties[] __initdata = { | |
607 | #ifdef CONFIG_ALTIVEC | |
608 | {"altivec", 0, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC}, | |
609 | {"ibm,vmx", 1, CPU_FTR_ALTIVEC, PPC_FEATURE_HAS_ALTIVEC}, | |
610 | #endif /* CONFIG_ALTIVEC */ | |
611 | #ifdef CONFIG_PPC64 | |
612 | {"ibm,dfp", 1, 0, PPC_FEATURE_HAS_DFP}, | |
613 | {"ibm,purr", 1, CPU_FTR_PURR, 0}, | |
614 | {"ibm,spurr", 1, CPU_FTR_SPURR, 0}, | |
615 | #endif /* CONFIG_PPC64 */ | |
616 | }; | |
617 | ||
14b3d926 VB |
618 | #if defined(CONFIG_44x) && defined(CONFIG_PPC_FPU) |
619 | static inline void identical_pvr_fixup(unsigned long node) | |
620 | { | |
621 | unsigned int pvr; | |
622 | char *model = of_get_flat_dt_prop(node, "model", NULL); | |
623 | ||
624 | /* | |
625 | * Since 440GR(x)/440EP(x) processors have the same pvr, | |
626 | * we check the node path and set bit 28 in the cur_cpu_spec | |
627 | * pvr for EP(x) processor version. This bit is always 0 in | |
628 | * the "real" pvr. Then we call identify_cpu again with | |
629 | * the new logical pvr to enable FPU support. | |
630 | */ | |
631 | if (model && strstr(model, "440EP")) { | |
632 | pvr = cur_cpu_spec->pvr_value | 0x8; | |
633 | identify_cpu(0, pvr); | |
634 | DBG("Using logical pvr %x for %s\n", pvr, model); | |
635 | } | |
636 | } | |
637 | #else | |
638 | #define identical_pvr_fixup(node) do { } while(0) | |
639 | #endif | |
640 | ||
974a76f5 PM |
641 | static void __init check_cpu_feature_properties(unsigned long node) |
642 | { | |
643 | unsigned long i; | |
644 | struct feature_property *fp = feature_properties; | |
645 | const u32 *prop; | |
646 | ||
647 | for (i = 0; i < ARRAY_SIZE(feature_properties); ++i, ++fp) { | |
648 | prop = of_get_flat_dt_prop(node, fp->name, NULL); | |
649 | if (prop && *prop >= fp->min_value) { | |
650 | cur_cpu_spec->cpu_features |= fp->cpu_feature; | |
651 | cur_cpu_spec->cpu_user_features |= fp->cpu_user_ftr; | |
652 | } | |
653 | } | |
654 | } | |
655 | ||
9b6b563c | 656 | static int __init early_init_dt_scan_cpus(unsigned long node, |
4df20460 AB |
657 | const char *uname, int depth, |
658 | void *data) | |
9b6b563c | 659 | { |
4df20460 AB |
660 | static int logical_cpuid = 0; |
661 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); | |
974a76f5 PM |
662 | const u32 *prop; |
663 | const u32 *intserv; | |
4df20460 AB |
664 | int i, nthreads; |
665 | unsigned long len; | |
666 | int found = 0; | |
9b6b563c PM |
667 | |
668 | /* We are scanning "cpu" nodes only */ | |
669 | if (type == NULL || strcmp(type, "cpu") != 0) | |
670 | return 0; | |
671 | ||
4df20460 AB |
672 | /* Get physical cpuid */ |
673 | intserv = of_get_flat_dt_prop(node, "ibm,ppc-interrupt-server#s", &len); | |
674 | if (intserv) { | |
675 | nthreads = len / sizeof(int); | |
9b6b563c | 676 | } else { |
4df20460 AB |
677 | intserv = of_get_flat_dt_prop(node, "reg", NULL); |
678 | nthreads = 1; | |
679 | } | |
680 | ||
681 | /* | |
682 | * Now see if any of these threads match our boot cpu. | |
683 | * NOTE: This must match the parsing done in smp_setup_cpu_maps. | |
684 | */ | |
685 | for (i = 0; i < nthreads; i++) { | |
686 | /* | |
687 | * version 2 of the kexec param format adds the phys cpuid of | |
688 | * booted proc. | |
689 | */ | |
690 | if (initial_boot_params && initial_boot_params->version >= 2) { | |
691 | if (intserv[i] == | |
692 | initial_boot_params->boot_cpuid_phys) { | |
693 | found = 1; | |
694 | break; | |
695 | } | |
696 | } else { | |
697 | /* | |
698 | * Check if it's the boot-cpu, set it's hw index now, | |
699 | * unfortunately this format did not support booting | |
700 | * off secondary threads. | |
701 | */ | |
702 | if (of_get_flat_dt_prop(node, | |
3c726f8d | 703 | "linux,boot-cpu", NULL) != NULL) { |
4df20460 AB |
704 | found = 1; |
705 | break; | |
706 | } | |
9b6b563c | 707 | } |
4df20460 AB |
708 | |
709 | #ifdef CONFIG_SMP | |
710 | /* logical cpu id is always 0 on UP kernels */ | |
711 | logical_cpuid++; | |
712 | #endif | |
713 | } | |
714 | ||
715 | if (found) { | |
716 | DBG("boot cpu: logical %d physical %d\n", logical_cpuid, | |
717 | intserv[i]); | |
718 | boot_cpuid = logical_cpuid; | |
719 | set_hard_smp_processor_id(boot_cpuid, intserv[i]); | |
9b6b563c | 720 | |
974a76f5 PM |
721 | /* |
722 | * PAPR defines "logical" PVR values for cpus that | |
723 | * meet various levels of the architecture: | |
724 | * 0x0f000001 Architecture version 2.04 | |
725 | * 0x0f000002 Architecture version 2.05 | |
726 | * If the cpu-version property in the cpu node contains | |
727 | * such a value, we call identify_cpu again with the | |
728 | * logical PVR value in order to use the cpu feature | |
729 | * bits appropriate for the architecture level. | |
730 | * | |
731 | * A POWER6 partition in "POWER6 architected" mode | |
732 | * uses the 0x0f000002 PVR value; in POWER5+ mode | |
733 | * it uses 0x0f000001. | |
734 | */ | |
735 | prop = of_get_flat_dt_prop(node, "cpu-version", NULL); | |
736 | if (prop && (*prop & 0xff000000) == 0x0f000000) | |
737 | identify_cpu(0, *prop); | |
14b3d926 VB |
738 | |
739 | identical_pvr_fixup(node); | |
9b6b563c | 740 | } |
9b6b563c | 741 | |
974a76f5 | 742 | check_cpu_feature_properties(node); |
d205819e | 743 | check_cpu_pa_features(node); |
584f8b71 | 744 | check_cpu_slb_size(node); |
d205819e | 745 | |
9b6b563c | 746 | #ifdef CONFIG_PPC_PSERIES |
4df20460 | 747 | if (nthreads > 1) |
9b6b563c | 748 | cur_cpu_spec->cpu_features |= CPU_FTR_SMT; |
4df20460 AB |
749 | else |
750 | cur_cpu_spec->cpu_features &= ~CPU_FTR_SMT; | |
9b6b563c PM |
751 | #endif |
752 | ||
753 | return 0; | |
754 | } | |
755 | ||
40472a55 ME |
756 | #ifdef CONFIG_BLK_DEV_INITRD |
757 | static void __init early_init_dt_check_for_initrd(unsigned long node) | |
758 | { | |
759 | unsigned long l; | |
760 | u32 *prop; | |
761 | ||
762 | DBG("Looking for initrd properties... "); | |
763 | ||
764 | prop = of_get_flat_dt_prop(node, "linux,initrd-start", &l); | |
765 | if (prop) { | |
766 | initrd_start = (unsigned long)__va(of_read_ulong(prop, l/4)); | |
767 | ||
768 | prop = of_get_flat_dt_prop(node, "linux,initrd-end", &l); | |
769 | if (prop) { | |
770 | initrd_end = (unsigned long) | |
771 | __va(of_read_ulong(prop, l/4)); | |
772 | initrd_below_start_ok = 1; | |
773 | } else { | |
774 | initrd_start = 0; | |
775 | } | |
776 | } | |
777 | ||
778 | DBG("initrd_start=0x%lx initrd_end=0x%lx\n", initrd_start, initrd_end); | |
779 | } | |
780 | #else | |
781 | static inline void early_init_dt_check_for_initrd(unsigned long node) | |
782 | { | |
783 | } | |
784 | #endif /* CONFIG_BLK_DEV_INITRD */ | |
785 | ||
9b6b563c PM |
786 | static int __init early_init_dt_scan_chosen(unsigned long node, |
787 | const char *uname, int depth, void *data) | |
788 | { | |
9b6b563c | 789 | unsigned long *lprop; |
329dda08 KG |
790 | unsigned long l; |
791 | char *p; | |
9b6b563c PM |
792 | |
793 | DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname); | |
794 | ||
a575b807 PM |
795 | if (depth != 1 || |
796 | (strcmp(uname, "chosen") != 0 && strcmp(uname, "chosen@0") != 0)) | |
9b6b563c PM |
797 | return 0; |
798 | ||
9b6b563c PM |
799 | #ifdef CONFIG_PPC64 |
800 | /* check if iommu is forced on or off */ | |
3c726f8d | 801 | if (of_get_flat_dt_prop(node, "linux,iommu-off", NULL) != NULL) |
9b6b563c | 802 | iommu_is_off = 1; |
3c726f8d | 803 | if (of_get_flat_dt_prop(node, "linux,iommu-force-on", NULL) != NULL) |
9b6b563c PM |
804 | iommu_force_on = 1; |
805 | #endif | |
806 | ||
2babf5c2 | 807 | /* mem=x on the command line is the preferred mechanism */ |
3c726f8d | 808 | lprop = of_get_flat_dt_prop(node, "linux,memory-limit", NULL); |
9b6b563c PM |
809 | if (lprop) |
810 | memory_limit = *lprop; | |
811 | ||
812 | #ifdef CONFIG_PPC64 | |
3c726f8d | 813 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-start", NULL); |
9b6b563c PM |
814 | if (lprop) |
815 | tce_alloc_start = *lprop; | |
3c726f8d | 816 | lprop = of_get_flat_dt_prop(node, "linux,tce-alloc-end", NULL); |
9b6b563c PM |
817 | if (lprop) |
818 | tce_alloc_end = *lprop; | |
819 | #endif | |
820 | ||
dcee3036 | 821 | #ifdef CONFIG_KEXEC |
70c6cc37 LV |
822 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-base", NULL); |
823 | if (lprop) | |
824 | crashk_res.start = *lprop; | |
dcee3036 | 825 | |
70c6cc37 LV |
826 | lprop = (u64*)of_get_flat_dt_prop(node, "linux,crashkernel-size", NULL); |
827 | if (lprop) | |
828 | crashk_res.end = crashk_res.start + *lprop - 1; | |
dcee3036 ME |
829 | #endif |
830 | ||
40472a55 | 831 | early_init_dt_check_for_initrd(node); |
30437b3e | 832 | |
329dda08 KG |
833 | /* Retreive command line */ |
834 | p = of_get_flat_dt_prop(node, "bootargs", &l); | |
835 | if (p != NULL && l > 0) | |
836 | strlcpy(cmd_line, p, min((int)l, COMMAND_LINE_SIZE)); | |
837 | ||
838 | #ifdef CONFIG_CMDLINE | |
c1ce464d | 839 | if (p == NULL || l == 0 || (l == 1 && (*p) == 0)) |
329dda08 KG |
840 | strlcpy(cmd_line, CONFIG_CMDLINE, COMMAND_LINE_SIZE); |
841 | #endif /* CONFIG_CMDLINE */ | |
842 | ||
843 | DBG("Command line is: %s\n", cmd_line); | |
844 | ||
9b6b563c PM |
845 | /* break now */ |
846 | return 1; | |
847 | } | |
848 | ||
849 | static int __init early_init_dt_scan_root(unsigned long node, | |
850 | const char *uname, int depth, void *data) | |
851 | { | |
852 | u32 *prop; | |
853 | ||
854 | if (depth != 0) | |
855 | return 0; | |
856 | ||
3c726f8d | 857 | prop = of_get_flat_dt_prop(node, "#size-cells", NULL); |
9b6b563c PM |
858 | dt_root_size_cells = (prop == NULL) ? 1 : *prop; |
859 | DBG("dt_root_size_cells = %x\n", dt_root_size_cells); | |
860 | ||
3c726f8d | 861 | prop = of_get_flat_dt_prop(node, "#address-cells", NULL); |
9b6b563c PM |
862 | dt_root_addr_cells = (prop == NULL) ? 2 : *prop; |
863 | DBG("dt_root_addr_cells = %x\n", dt_root_addr_cells); | |
864 | ||
865 | /* break now */ | |
866 | return 1; | |
867 | } | |
868 | ||
abe76885 | 869 | static u64 __init dt_mem_next_cell(int s, cell_t **cellp) |
9b6b563c PM |
870 | { |
871 | cell_t *p = *cellp; | |
9b6b563c | 872 | |
a4dc7ff0 | 873 | *cellp = p + s; |
abe76885 | 874 | return of_read_number(p, s); |
9b6b563c PM |
875 | } |
876 | ||
0204568a PM |
877 | #ifdef CONFIG_PPC_PSERIES |
878 | /* | |
879 | * Interpret the ibm,dynamic-memory property in the | |
880 | * /ibm,dynamic-reconfiguration-memory node. | |
881 | * This contains a list of memory blocks along with NUMA affinity | |
882 | * information. | |
883 | */ | |
884 | static int __init early_init_dt_scan_drconf_memory(unsigned long node) | |
885 | { | |
886 | cell_t *dm, *ls; | |
abe76885 BB |
887 | unsigned long l, n, flags; |
888 | u64 base, size, lmb_size; | |
0204568a PM |
889 | |
890 | ls = (cell_t *)of_get_flat_dt_prop(node, "ibm,lmb-size", &l); | |
891 | if (ls == NULL || l < dt_root_size_cells * sizeof(cell_t)) | |
892 | return 0; | |
893 | lmb_size = dt_mem_next_cell(dt_root_size_cells, &ls); | |
894 | ||
895 | dm = (cell_t *)of_get_flat_dt_prop(node, "ibm,dynamic-memory", &l); | |
896 | if (dm == NULL || l < sizeof(cell_t)) | |
897 | return 0; | |
898 | ||
899 | n = *dm++; /* number of entries */ | |
900 | if (l < (n * (dt_root_addr_cells + 4) + 1) * sizeof(cell_t)) | |
901 | return 0; | |
902 | ||
903 | for (; n != 0; --n) { | |
904 | base = dt_mem_next_cell(dt_root_addr_cells, &dm); | |
905 | flags = dm[3]; | |
906 | /* skip DRC index, pad, assoc. list index, flags */ | |
907 | dm += 4; | |
908 | /* skip this block if the reserved bit is set in flags (0x80) | |
909 | or if the block is not assigned to this partition (0x8) */ | |
910 | if ((flags & 0x80) || !(flags & 0x8)) | |
911 | continue; | |
912 | size = lmb_size; | |
913 | if (iommu_is_off) { | |
914 | if (base >= 0x80000000ul) | |
915 | continue; | |
916 | if ((base + size) > 0x80000000ul) | |
917 | size = 0x80000000ul - base; | |
918 | } | |
919 | lmb_add(base, size); | |
920 | } | |
921 | lmb_dump_all(); | |
922 | return 0; | |
923 | } | |
924 | #else | |
925 | #define early_init_dt_scan_drconf_memory(node) 0 | |
926 | #endif /* CONFIG_PPC_PSERIES */ | |
9b6b563c PM |
927 | |
928 | static int __init early_init_dt_scan_memory(unsigned long node, | |
929 | const char *uname, int depth, void *data) | |
930 | { | |
3c726f8d | 931 | char *type = of_get_flat_dt_prop(node, "device_type", NULL); |
9b6b563c PM |
932 | cell_t *reg, *endp; |
933 | unsigned long l; | |
934 | ||
0204568a PM |
935 | /* Look for the ibm,dynamic-reconfiguration-memory node */ |
936 | if (depth == 1 && | |
937 | strcmp(uname, "ibm,dynamic-reconfiguration-memory") == 0) | |
938 | return early_init_dt_scan_drconf_memory(node); | |
939 | ||
9b6b563c | 940 | /* We are scanning "memory" nodes only */ |
a23414be PM |
941 | if (type == NULL) { |
942 | /* | |
943 | * The longtrail doesn't have a device_type on the | |
944 | * /memory node, so look for the node called /memory@0. | |
945 | */ | |
946 | if (depth != 1 || strcmp(uname, "memory@0") != 0) | |
947 | return 0; | |
948 | } else if (strcmp(type, "memory") != 0) | |
9b6b563c PM |
949 | return 0; |
950 | ||
ba759485 ME |
951 | reg = (cell_t *)of_get_flat_dt_prop(node, "linux,usable-memory", &l); |
952 | if (reg == NULL) | |
953 | reg = (cell_t *)of_get_flat_dt_prop(node, "reg", &l); | |
9b6b563c PM |
954 | if (reg == NULL) |
955 | return 0; | |
956 | ||
957 | endp = reg + (l / sizeof(cell_t)); | |
958 | ||
358c86fd | 959 | DBG("memory scan node %s, reg size %ld, data: %x %x %x %x,\n", |
9b6b563c PM |
960 | uname, l, reg[0], reg[1], reg[2], reg[3]); |
961 | ||
962 | while ((endp - reg) >= (dt_root_addr_cells + dt_root_size_cells)) { | |
abe76885 | 963 | u64 base, size; |
9b6b563c PM |
964 | |
965 | base = dt_mem_next_cell(dt_root_addr_cells, ®); | |
966 | size = dt_mem_next_cell(dt_root_size_cells, ®); | |
967 | ||
968 | if (size == 0) | |
969 | continue; | |
abe76885 BB |
970 | DBG(" - %llx , %llx\n", (unsigned long long)base, |
971 | (unsigned long long)size); | |
9b6b563c PM |
972 | #ifdef CONFIG_PPC64 |
973 | if (iommu_is_off) { | |
974 | if (base >= 0x80000000ul) | |
975 | continue; | |
976 | if ((base + size) > 0x80000000ul) | |
977 | size = 0x80000000ul - base; | |
978 | } | |
979 | #endif | |
980 | lmb_add(base, size); | |
981 | } | |
982 | return 0; | |
983 | } | |
984 | ||
985 | static void __init early_reserve_mem(void) | |
986 | { | |
cbbcf340 KG |
987 | u64 base, size; |
988 | u64 *reserve_map; | |
8a300887 JL |
989 | unsigned long self_base; |
990 | unsigned long self_size; | |
9b6b563c | 991 | |
cbbcf340 | 992 | reserve_map = (u64 *)(((unsigned long)initial_boot_params) + |
9b6b563c | 993 | initial_boot_params->off_mem_rsvmap); |
4d1f3f25 JX |
994 | |
995 | /* before we do anything, lets reserve the dt blob */ | |
8a300887 JL |
996 | self_base = __pa((unsigned long)initial_boot_params); |
997 | self_size = initial_boot_params->totalsize; | |
998 | lmb_reserve(self_base, self_size); | |
4d1f3f25 | 999 | |
30437b3e DG |
1000 | #ifdef CONFIG_BLK_DEV_INITRD |
1001 | /* then reserve the initrd, if any */ | |
1002 | if (initrd_start && (initrd_end > initrd_start)) | |
1003 | lmb_reserve(__pa(initrd_start), initrd_end - initrd_start); | |
1004 | #endif /* CONFIG_BLK_DEV_INITRD */ | |
1005 | ||
cbbcf340 KG |
1006 | #ifdef CONFIG_PPC32 |
1007 | /* | |
1008 | * Handle the case where we might be booting from an old kexec | |
1009 | * image that setup the mem_rsvmap as pairs of 32-bit values | |
1010 | */ | |
1011 | if (*reserve_map > 0xffffffffull) { | |
1012 | u32 base_32, size_32; | |
1013 | u32 *reserve_map_32 = (u32 *)reserve_map; | |
1014 | ||
1015 | while (1) { | |
1016 | base_32 = *(reserve_map_32++); | |
1017 | size_32 = *(reserve_map_32++); | |
1018 | if (size_32 == 0) | |
1019 | break; | |
8a300887 JL |
1020 | /* skip if the reservation is for the blob */ |
1021 | if (base_32 == self_base && size_32 == self_size) | |
1022 | continue; | |
329dda08 | 1023 | DBG("reserving: %x -> %x\n", base_32, size_32); |
cbbcf340 KG |
1024 | lmb_reserve(base_32, size_32); |
1025 | } | |
1026 | return; | |
1027 | } | |
1028 | #endif | |
9b6b563c PM |
1029 | while (1) { |
1030 | base = *(reserve_map++); | |
1031 | size = *(reserve_map++); | |
1032 | if (size == 0) | |
1033 | break; | |
cbbcf340 | 1034 | DBG("reserving: %llx -> %llx\n", base, size); |
9b6b563c PM |
1035 | lmb_reserve(base, size); |
1036 | } | |
1037 | ||
1038 | #if 0 | |
1039 | DBG("memory reserved, lmbs :\n"); | |
1040 | lmb_dump_all(); | |
1041 | #endif | |
1042 | } | |
1043 | ||
6ac26c8a MA |
1044 | #ifdef CONFIG_PHYP_DUMP |
1045 | /** | |
1046 | * phyp_dump_reserve_mem() - reserve all not-yet-dumped mmemory | |
1047 | * | |
1048 | * This routine may reserve memory regions in the kernel only | |
1049 | * if the system is supported and a dump was taken in last | |
1050 | * boot instance or if the hardware is supported and the | |
1051 | * scratch area needs to be setup. In other instances it returns | |
1052 | * without reserving anything. The memory in case of dump being | |
1053 | * active is freed when the dump is collected (by userland tools). | |
1054 | */ | |
1055 | static void __init phyp_dump_reserve_mem(void) | |
1056 | { | |
1057 | unsigned long base, size; | |
1058 | if (!phyp_dump_info->phyp_dump_configured) { | |
1059 | printk(KERN_ERR "Phyp-dump not supported on this hardware\n"); | |
1060 | return; | |
1061 | } | |
1062 | ||
654f596d MA |
1063 | if (!phyp_dump_info->phyp_dump_at_boot) { |
1064 | printk(KERN_INFO "Phyp-dump disabled at boot time\n"); | |
1065 | return; | |
1066 | } | |
1067 | ||
6ac26c8a MA |
1068 | if (phyp_dump_info->phyp_dump_is_active) { |
1069 | /* Reserve *everything* above RMR.Area freed by userland tools*/ | |
1070 | base = PHYP_DUMP_RMR_END; | |
1071 | size = lmb_end_of_DRAM() - base; | |
1072 | ||
1073 | /* XXX crashed_ram_end is wrong, since it may be beyond | |
1074 | * the memory_limit, it will need to be adjusted. */ | |
1075 | lmb_reserve(base, size); | |
1076 | ||
1077 | phyp_dump_info->init_reserve_start = base; | |
1078 | phyp_dump_info->init_reserve_size = size; | |
1079 | } else { | |
1080 | size = phyp_dump_info->cpu_state_size + | |
1081 | phyp_dump_info->hpte_region_size + | |
1082 | PHYP_DUMP_RMR_END; | |
1083 | base = lmb_end_of_DRAM() - size; | |
1084 | lmb_reserve(base, size); | |
1085 | phyp_dump_info->init_reserve_start = base; | |
1086 | phyp_dump_info->init_reserve_size = size; | |
1087 | } | |
1088 | } | |
1089 | #else | |
1090 | static inline void __init phyp_dump_reserve_mem(void) {} | |
1091 | #endif /* CONFIG_PHYP_DUMP && CONFIG_PPC_RTAS */ | |
1092 | ||
1093 | ||
9b6b563c PM |
1094 | void __init early_init_devtree(void *params) |
1095 | { | |
44348105 | 1096 | DBG(" -> early_init_devtree(%p)\n", params); |
9b6b563c PM |
1097 | |
1098 | /* Setup flat device-tree pointer */ | |
1099 | initial_boot_params = params; | |
1100 | ||
458148c0 ME |
1101 | #ifdef CONFIG_PPC_RTAS |
1102 | /* Some machines might need RTAS info for debugging, grab it now. */ | |
1103 | of_scan_flat_dt(early_init_dt_scan_rtas, NULL); | |
1104 | #endif | |
1105 | ||
6ac26c8a MA |
1106 | #ifdef CONFIG_PHYP_DUMP |
1107 | /* scan tree to see if dump occured during last boot */ | |
1108 | of_scan_flat_dt(early_init_dt_scan_phyp_dump, NULL); | |
1109 | #endif | |
1110 | ||
9b6b563c PM |
1111 | /* Retrieve various informations from the /chosen node of the |
1112 | * device-tree, including the platform type, initrd location and | |
1113 | * size, TCE reserve, and more ... | |
1114 | */ | |
3c726f8d | 1115 | of_scan_flat_dt(early_init_dt_scan_chosen, NULL); |
9b6b563c PM |
1116 | |
1117 | /* Scan memory nodes and rebuild LMBs */ | |
1118 | lmb_init(); | |
3c726f8d BH |
1119 | of_scan_flat_dt(early_init_dt_scan_root, NULL); |
1120 | of_scan_flat_dt(early_init_dt_scan_memory, NULL); | |
846f77b0 ME |
1121 | |
1122 | /* Save command line for /proc/cmdline and then parse parameters */ | |
b8757b21 | 1123 | strlcpy(boot_command_line, cmd_line, COMMAND_LINE_SIZE); |
846f77b0 ME |
1124 | parse_early_param(); |
1125 | ||
9b6b563c | 1126 | /* Reserve LMB regions used by kernel, initrd, dt, etc... */ |
0cc4746c | 1127 | lmb_reserve(PHYSICAL_START, __pa(klimit) - PHYSICAL_START); |
47310413 | 1128 | reserve_kdump_trampoline(); |
35dd5432 | 1129 | reserve_crashkernel(); |
9b6b563c | 1130 | early_reserve_mem(); |
6ac26c8a | 1131 | phyp_dump_reserve_mem(); |
9b6b563c | 1132 | |
2babf5c2 ME |
1133 | lmb_enforce_memory_limit(memory_limit); |
1134 | lmb_analyze(); | |
1135 | ||
1136 | DBG("Phys. mem: %lx\n", lmb_phys_mem_size()); | |
1137 | ||
1138 | /* We may need to relocate the flat tree, do it now. | |
1139 | * FIXME .. and the initrd too? */ | |
1140 | move_device_tree(); | |
1141 | ||
9b6b563c PM |
1142 | DBG("Scanning CPUs ...\n"); |
1143 | ||
3c726f8d BH |
1144 | /* Retreive CPU related informations from the flat tree |
1145 | * (altivec support, boot CPU ID, ...) | |
9b6b563c | 1146 | */ |
3c726f8d | 1147 | of_scan_flat_dt(early_init_dt_scan_cpus, NULL); |
9b6b563c | 1148 | |
9b6b563c PM |
1149 | DBG(" <- early_init_devtree()\n"); |
1150 | } | |
1151 | ||
9b6b563c | 1152 | |
9b6b563c PM |
1153 | /** |
1154 | * Indicates whether the root node has a given value in its | |
1155 | * compatible property. | |
1156 | */ | |
1157 | int machine_is_compatible(const char *compat) | |
1158 | { | |
1159 | struct device_node *root; | |
1160 | int rc = 0; | |
1161 | ||
1162 | root = of_find_node_by_path("/"); | |
1163 | if (root) { | |
7a92f74f | 1164 | rc = of_device_is_compatible(root, compat); |
9b6b563c PM |
1165 | of_node_put(root); |
1166 | } | |
1167 | return rc; | |
1168 | } | |
1169 | EXPORT_SYMBOL(machine_is_compatible); | |
1170 | ||
9b6b563c PM |
1171 | /******* |
1172 | * | |
1173 | * New implementation of the OF "find" APIs, return a refcounted | |
1174 | * object, call of_node_put() when done. The device tree and list | |
1175 | * are protected by a rw_lock. | |
1176 | * | |
1177 | * Note that property management will need some locking as well, | |
1178 | * this isn't dealt with yet. | |
1179 | * | |
1180 | *******/ | |
1181 | ||
9b6b563c PM |
1182 | /** |
1183 | * of_find_node_by_phandle - Find a node given a phandle | |
1184 | * @handle: phandle of the node to find | |
1185 | * | |
1186 | * Returns a node pointer with refcount incremented, use | |
1187 | * of_node_put() on it when done. | |
1188 | */ | |
1189 | struct device_node *of_find_node_by_phandle(phandle handle) | |
1190 | { | |
1191 | struct device_node *np; | |
1192 | ||
1193 | read_lock(&devtree_lock); | |
1194 | for (np = allnodes; np != 0; np = np->allnext) | |
1195 | if (np->linux_phandle == handle) | |
1196 | break; | |
b1374051 | 1197 | of_node_get(np); |
9b6b563c PM |
1198 | read_unlock(&devtree_lock); |
1199 | return np; | |
1200 | } | |
1201 | EXPORT_SYMBOL(of_find_node_by_phandle); | |
1202 | ||
1203 | /** | |
1204 | * of_find_all_nodes - Get next node in global list | |
1205 | * @prev: Previous node or NULL to start iteration | |
1206 | * of_node_put() will be called on it | |
1207 | * | |
1208 | * Returns a node pointer with refcount incremented, use | |
1209 | * of_node_put() on it when done. | |
1210 | */ | |
1211 | struct device_node *of_find_all_nodes(struct device_node *prev) | |
1212 | { | |
1213 | struct device_node *np; | |
1214 | ||
1215 | read_lock(&devtree_lock); | |
1216 | np = prev ? prev->allnext : allnodes; | |
1217 | for (; np != 0; np = np->allnext) | |
1218 | if (of_node_get(np)) | |
1219 | break; | |
b1374051 | 1220 | of_node_put(prev); |
9b6b563c PM |
1221 | read_unlock(&devtree_lock); |
1222 | return np; | |
1223 | } | |
1224 | EXPORT_SYMBOL(of_find_all_nodes); | |
1225 | ||
9b6b563c PM |
1226 | /** |
1227 | * of_node_get - Increment refcount of a node | |
1228 | * @node: Node to inc refcount, NULL is supported to | |
1229 | * simplify writing of callers | |
1230 | * | |
1231 | * Returns node. | |
1232 | */ | |
1233 | struct device_node *of_node_get(struct device_node *node) | |
1234 | { | |
1235 | if (node) | |
1236 | kref_get(&node->kref); | |
1237 | return node; | |
1238 | } | |
1239 | EXPORT_SYMBOL(of_node_get); | |
1240 | ||
1241 | static inline struct device_node * kref_to_device_node(struct kref *kref) | |
1242 | { | |
1243 | return container_of(kref, struct device_node, kref); | |
1244 | } | |
1245 | ||
1246 | /** | |
1247 | * of_node_release - release a dynamically allocated node | |
1248 | * @kref: kref element of the node to be released | |
1249 | * | |
1250 | * In of_node_put() this function is passed to kref_put() | |
1251 | * as the destructor. | |
1252 | */ | |
1253 | static void of_node_release(struct kref *kref) | |
1254 | { | |
1255 | struct device_node *node = kref_to_device_node(kref); | |
1256 | struct property *prop = node->properties; | |
1257 | ||
6a281856 ME |
1258 | /* We should never be releasing nodes that haven't been detached. */ |
1259 | if (!of_node_check_flag(node, OF_DETACHED)) { | |
1260 | printk("WARNING: Bad of_node_put() on %s\n", node->full_name); | |
1261 | dump_stack(); | |
1262 | kref_init(&node->kref); | |
1263 | return; | |
1264 | } | |
1265 | ||
d3b814bb | 1266 | if (!of_node_check_flag(node, OF_DYNAMIC)) |
9b6b563c | 1267 | return; |
6a281856 | 1268 | |
9b6b563c PM |
1269 | while (prop) { |
1270 | struct property *next = prop->next; | |
1271 | kfree(prop->name); | |
1272 | kfree(prop->value); | |
1273 | kfree(prop); | |
1274 | prop = next; | |
088186de DB |
1275 | |
1276 | if (!prop) { | |
1277 | prop = node->deadprops; | |
1278 | node->deadprops = NULL; | |
1279 | } | |
9b6b563c | 1280 | } |
9b6b563c PM |
1281 | kfree(node->full_name); |
1282 | kfree(node->data); | |
1283 | kfree(node); | |
1284 | } | |
1285 | ||
1286 | /** | |
1287 | * of_node_put - Decrement refcount of a node | |
1288 | * @node: Node to dec refcount, NULL is supported to | |
1289 | * simplify writing of callers | |
1290 | * | |
1291 | */ | |
1292 | void of_node_put(struct device_node *node) | |
1293 | { | |
1294 | if (node) | |
1295 | kref_put(&node->kref, of_node_release); | |
1296 | } | |
1297 | EXPORT_SYMBOL(of_node_put); | |
1298 | ||
1299 | /* | |
1300 | * Plug a device node into the tree and global list. | |
1301 | */ | |
1302 | void of_attach_node(struct device_node *np) | |
1303 | { | |
1304 | write_lock(&devtree_lock); | |
1305 | np->sibling = np->parent->child; | |
1306 | np->allnext = allnodes; | |
1307 | np->parent->child = np; | |
1308 | allnodes = np; | |
1309 | write_unlock(&devtree_lock); | |
1310 | } | |
1311 | ||
1312 | /* | |
1313 | * "Unplug" a node from the device tree. The caller must hold | |
1314 | * a reference to the node. The memory associated with the node | |
1315 | * is not freed until its refcount goes to zero. | |
1316 | */ | |
34f329db | 1317 | void of_detach_node(struct device_node *np) |
9b6b563c PM |
1318 | { |
1319 | struct device_node *parent; | |
1320 | ||
1321 | write_lock(&devtree_lock); | |
1322 | ||
1323 | parent = np->parent; | |
972d17c9 ME |
1324 | if (!parent) |
1325 | goto out_unlock; | |
9b6b563c PM |
1326 | |
1327 | if (allnodes == np) | |
1328 | allnodes = np->allnext; | |
1329 | else { | |
1330 | struct device_node *prev; | |
1331 | for (prev = allnodes; | |
1332 | prev->allnext != np; | |
1333 | prev = prev->allnext) | |
1334 | ; | |
1335 | prev->allnext = np->allnext; | |
1336 | } | |
1337 | ||
1338 | if (parent->child == np) | |
1339 | parent->child = np->sibling; | |
1340 | else { | |
1341 | struct device_node *prevsib; | |
1342 | for (prevsib = np->parent->child; | |
1343 | prevsib->sibling != np; | |
1344 | prevsib = prevsib->sibling) | |
1345 | ; | |
1346 | prevsib->sibling = np->sibling; | |
1347 | } | |
1348 | ||
6a281856 ME |
1349 | of_node_set_flag(np, OF_DETACHED); |
1350 | ||
972d17c9 | 1351 | out_unlock: |
9b6b563c PM |
1352 | write_unlock(&devtree_lock); |
1353 | } | |
1354 | ||
1355 | #ifdef CONFIG_PPC_PSERIES | |
1356 | /* | |
1357 | * Fix up the uninitialized fields in a new device node: | |
0ebfff14 | 1358 | * name, type and pci-specific fields |
9b6b563c PM |
1359 | */ |
1360 | ||
cc5d0189 | 1361 | static int of_finish_dynamic_node(struct device_node *node) |
9b6b563c PM |
1362 | { |
1363 | struct device_node *parent = of_get_parent(node); | |
1364 | int err = 0; | |
a7f67bdf | 1365 | const phandle *ibm_phandle; |
9b6b563c | 1366 | |
0e56efc7 SR |
1367 | node->name = of_get_property(node, "name", NULL); |
1368 | node->type = of_get_property(node, "device_type", NULL); | |
9b6b563c | 1369 | |
847f5976 BH |
1370 | if (!node->name) |
1371 | node->name = "<NULL>"; | |
1372 | if (!node->type) | |
1373 | node->type = "<NULL>"; | |
1374 | ||
9b6b563c PM |
1375 | if (!parent) { |
1376 | err = -ENODEV; | |
1377 | goto out; | |
1378 | } | |
1379 | ||
1380 | /* We don't support that function on PowerMac, at least | |
1381 | * not yet | |
1382 | */ | |
e8222502 | 1383 | if (machine_is(powermac)) |
9b6b563c PM |
1384 | return -ENODEV; |
1385 | ||
1386 | /* fix up new node's linux_phandle field */ | |
0e56efc7 | 1387 | if ((ibm_phandle = of_get_property(node, "ibm,phandle", NULL))) |
9b6b563c PM |
1388 | node->linux_phandle = *ibm_phandle; |
1389 | ||
1390 | out: | |
1391 | of_node_put(parent); | |
1392 | return err; | |
1393 | } | |
1394 | ||
1395 | static int prom_reconfig_notifier(struct notifier_block *nb, | |
1396 | unsigned long action, void *node) | |
1397 | { | |
1398 | int err; | |
1399 | ||
1400 | switch (action) { | |
1401 | case PSERIES_RECONFIG_ADD: | |
cc5d0189 | 1402 | err = of_finish_dynamic_node(node); |
9b6b563c PM |
1403 | if (err < 0) { |
1404 | printk(KERN_ERR "finish_node returned %d\n", err); | |
1405 | err = NOTIFY_BAD; | |
1406 | } | |
1407 | break; | |
1408 | default: | |
1409 | err = NOTIFY_DONE; | |
1410 | break; | |
1411 | } | |
1412 | return err; | |
1413 | } | |
1414 | ||
1415 | static struct notifier_block prom_reconfig_nb = { | |
1416 | .notifier_call = prom_reconfig_notifier, | |
1417 | .priority = 10, /* This one needs to run first */ | |
1418 | }; | |
1419 | ||
1420 | static int __init prom_reconfig_setup(void) | |
1421 | { | |
1422 | return pSeries_reconfig_notifier_register(&prom_reconfig_nb); | |
1423 | } | |
1424 | __initcall(prom_reconfig_setup); | |
1425 | #endif | |
1426 | ||
9b6b563c PM |
1427 | /* |
1428 | * Add a property to a node | |
1429 | */ | |
183d0202 | 1430 | int prom_add_property(struct device_node* np, struct property* prop) |
9b6b563c | 1431 | { |
183d0202 | 1432 | struct property **next; |
9b6b563c PM |
1433 | |
1434 | prop->next = NULL; | |
183d0202 BH |
1435 | write_lock(&devtree_lock); |
1436 | next = &np->properties; | |
1437 | while (*next) { | |
1438 | if (strcmp(prop->name, (*next)->name) == 0) { | |
1439 | /* duplicate ! don't insert it */ | |
1440 | write_unlock(&devtree_lock); | |
1441 | return -1; | |
1442 | } | |
9b6b563c | 1443 | next = &(*next)->next; |
183d0202 | 1444 | } |
9b6b563c | 1445 | *next = prop; |
183d0202 BH |
1446 | write_unlock(&devtree_lock); |
1447 | ||
799d6046 | 1448 | #ifdef CONFIG_PROC_DEVICETREE |
183d0202 BH |
1449 | /* try to add to proc as well if it was initialized */ |
1450 | if (np->pde) | |
1451 | proc_device_tree_add_prop(np->pde, prop); | |
799d6046 | 1452 | #endif /* CONFIG_PROC_DEVICETREE */ |
183d0202 BH |
1453 | |
1454 | return 0; | |
9b6b563c PM |
1455 | } |
1456 | ||
088186de DB |
1457 | /* |
1458 | * Remove a property from a node. Note that we don't actually | |
1459 | * remove it, since we have given out who-knows-how-many pointers | |
1460 | * to the data using get-property. Instead we just move the property | |
1461 | * to the "dead properties" list, so it won't be found any more. | |
1462 | */ | |
1463 | int prom_remove_property(struct device_node *np, struct property *prop) | |
1464 | { | |
1465 | struct property **next; | |
1466 | int found = 0; | |
1467 | ||
1468 | write_lock(&devtree_lock); | |
1469 | next = &np->properties; | |
1470 | while (*next) { | |
1471 | if (*next == prop) { | |
1472 | /* found the node */ | |
1473 | *next = prop->next; | |
1474 | prop->next = np->deadprops; | |
1475 | np->deadprops = prop; | |
1476 | found = 1; | |
1477 | break; | |
1478 | } | |
1479 | next = &(*next)->next; | |
1480 | } | |
1481 | write_unlock(&devtree_lock); | |
1482 | ||
1483 | if (!found) | |
1484 | return -ENODEV; | |
1485 | ||
1486 | #ifdef CONFIG_PROC_DEVICETREE | |
1487 | /* try to remove the proc node as well */ | |
1488 | if (np->pde) | |
1489 | proc_device_tree_remove_prop(np->pde, prop); | |
1490 | #endif /* CONFIG_PROC_DEVICETREE */ | |
1491 | ||
1492 | return 0; | |
1493 | } | |
1494 | ||
1495 | /* | |
1496 | * Update a property in a node. Note that we don't actually | |
1497 | * remove it, since we have given out who-knows-how-many pointers | |
1498 | * to the data using get-property. Instead we just move the property | |
1499 | * to the "dead properties" list, and add the new property to the | |
1500 | * property list | |
1501 | */ | |
1502 | int prom_update_property(struct device_node *np, | |
1503 | struct property *newprop, | |
1504 | struct property *oldprop) | |
1505 | { | |
1506 | struct property **next; | |
1507 | int found = 0; | |
1508 | ||
1509 | write_lock(&devtree_lock); | |
1510 | next = &np->properties; | |
1511 | while (*next) { | |
1512 | if (*next == oldprop) { | |
1513 | /* found the node */ | |
1514 | newprop->next = oldprop->next; | |
1515 | *next = newprop; | |
1516 | oldprop->next = np->deadprops; | |
1517 | np->deadprops = oldprop; | |
1518 | found = 1; | |
1519 | break; | |
1520 | } | |
1521 | next = &(*next)->next; | |
1522 | } | |
1523 | write_unlock(&devtree_lock); | |
1524 | ||
1525 | if (!found) | |
1526 | return -ENODEV; | |
9b6b563c | 1527 | |
088186de DB |
1528 | #ifdef CONFIG_PROC_DEVICETREE |
1529 | /* try to add to proc as well if it was initialized */ | |
1530 | if (np->pde) | |
1531 | proc_device_tree_update_prop(np->pde, newprop, oldprop); | |
1532 | #endif /* CONFIG_PROC_DEVICETREE */ | |
1533 | ||
1534 | return 0; | |
1535 | } | |
b68239ee | 1536 | |
acf7d768 BH |
1537 | |
1538 | /* Find the device node for a given logical cpu number, also returns the cpu | |
1539 | * local thread number (index in ibm,interrupt-server#s) if relevant and | |
1540 | * asked for (non NULL) | |
1541 | */ | |
1542 | struct device_node *of_get_cpu_node(int cpu, unsigned int *thread) | |
1543 | { | |
1544 | int hardid; | |
1545 | struct device_node *np; | |
1546 | ||
1547 | hardid = get_hard_smp_processor_id(cpu); | |
1548 | ||
1549 | for_each_node_by_type(np, "cpu") { | |
a7f67bdf | 1550 | const u32 *intserv; |
acf7d768 BH |
1551 | unsigned int plen, t; |
1552 | ||
1553 | /* Check for ibm,ppc-interrupt-server#s. If it doesn't exist | |
1554 | * fallback to "reg" property and assume no threads | |
1555 | */ | |
0e56efc7 | 1556 | intserv = of_get_property(np, "ibm,ppc-interrupt-server#s", |
a7f67bdf | 1557 | &plen); |
acf7d768 | 1558 | if (intserv == NULL) { |
0e56efc7 | 1559 | const u32 *reg = of_get_property(np, "reg", NULL); |
acf7d768 BH |
1560 | if (reg == NULL) |
1561 | continue; | |
1562 | if (*reg == hardid) { | |
1563 | if (thread) | |
1564 | *thread = 0; | |
1565 | return np; | |
1566 | } | |
1567 | } else { | |
1568 | plen /= sizeof(u32); | |
1569 | for (t = 0; t < plen; t++) { | |
1570 | if (hardid == intserv[t]) { | |
1571 | if (thread) | |
1572 | *thread = t; | |
1573 | return np; | |
1574 | } | |
1575 | } | |
1576 | } | |
1577 | } | |
1578 | return NULL; | |
1579 | } | |
36ca4ba4 | 1580 | EXPORT_SYMBOL(of_get_cpu_node); |
7a4571ae | 1581 | |
94a3807c | 1582 | #if defined(CONFIG_DEBUG_FS) && defined(DEBUG) |
7a4571ae ME |
1583 | static struct debugfs_blob_wrapper flat_dt_blob; |
1584 | ||
1585 | static int __init export_flat_device_tree(void) | |
1586 | { | |
1587 | struct dentry *d; | |
1588 | ||
7a4571ae ME |
1589 | flat_dt_blob.data = initial_boot_params; |
1590 | flat_dt_blob.size = initial_boot_params->totalsize; | |
1591 | ||
1592 | d = debugfs_create_blob("flat-device-tree", S_IFREG | S_IRUSR, | |
94a3807c | 1593 | powerpc_debugfs_root, &flat_dt_blob); |
7a4571ae ME |
1594 | if (!d) |
1595 | return 1; | |
1596 | ||
1597 | return 0; | |
1598 | } | |
1599 | __initcall(export_flat_device_tree); | |
1600 | #endif |