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