2 * Procedures for interfacing to Open Firmware.
4 * Paul Mackerras August 1996.
5 * Copyright (C) 1996-2005 Paul Mackerras.
7 * Adapted for 64bit PowerPC by Dave Engebretsen and Peter Bergner.
8 * {engebret|bergner}@us.ibm.com
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.
19 #include <linux/config.h>
20 #include <linux/kernel.h>
21 #include <linux/string.h>
22 #include <linux/init.h>
23 #include <linux/threads.h>
24 #include <linux/spinlock.h>
25 #include <linux/types.h>
26 #include <linux/pci.h>
27 #include <linux/proc_fs.h>
28 #include <linux/stringify.h>
29 #include <linux/delay.h>
30 #include <linux/initrd.h>
31 #include <linux/bitops.h>
35 #include <asm/processor.h>
39 #include <asm/system.h>
41 #include <asm/pgtable.h>
43 #include <asm/iommu.h>
44 #include <asm/bootinfo.h>
45 #include <asm/btext.h>
46 #include <asm/sections.h>
47 #include <asm/machdep.h>
49 #ifdef CONFIG_LOGO_LINUX_CLUT224
50 #include <linux/linux_logo.h>
51 extern const struct linux_logo logo_linux_clut224;
55 * Properties whose value is longer than this get excluded from our
56 * copy of the device tree. This value does need to be big enough to
57 * ensure that we don't lose things like the interrupt-map property
58 * on a PCI-PCI bridge.
60 #define MAX_PROPERTY_LENGTH (1UL * 1024 * 1024)
63 * Eventually bump that one up
65 #define DEVTREE_CHUNK_SIZE 0x100000
68 * This is the size of the local memory reserve map that gets copied
69 * into the boot params passed to the kernel. That size is totally
70 * flexible as the kernel just reads the list until it encounters an
71 * entry with size 0, so it can be changed without breaking binary
74 #define MEM_RESERVE_MAP_SIZE 8
77 * prom_init() is called very early on, before the kernel text
78 * and data have been mapped to KERNELBASE. At this point the code
79 * is running at whatever address it has been loaded at.
80 * On ppc32 we compile with -mrelocatable, which means that references
81 * to extern and static variables get relocated automatically.
82 * On ppc64 we have to relocate the references explicitly with
83 * RELOC. (Note that strings count as static variables.)
85 * Because OF may have mapped I/O devices into the area starting at
86 * KERNELBASE, particularly on CHRP machines, we can't safely call
87 * OF once the kernel has been mapped to KERNELBASE. Therefore all
88 * OF calls must be done within prom_init().
90 * ADDR is used in calls to call_prom. The 4th and following
91 * arguments to call_prom should be 32-bit values.
92 * On ppc64, 64 bit values are truncated to 32 bits (and
93 * fortunately don't get interpreted as two arguments).
96 #define RELOC(x) (*PTRRELOC(&(x)))
97 #define ADDR(x) (u32) add_reloc_offset((unsigned long)(x))
100 #define ADDR(x) (u32) (x)
103 #define PROM_BUG() do { \
104 prom_printf("kernel BUG at %s line 0x%x!\n", \
105 RELOC(__FILE__), __LINE__); \
106 __asm__ __volatile__(".long " BUG_ILLEGAL_INSTR); \
110 #define prom_debug(x...) prom_printf(x)
112 #define prom_debug(x...)
116 #define PLATFORM_POWERMAC _MACH_Pmac
117 #define PLATFORM_CHRP _MACH_chrp
121 typedef u32 prom_arg_t;
138 struct mem_map_entry {
145 extern void __start(unsigned long r3, unsigned long r4, unsigned long r5);
148 extern int enter_prom(struct prom_args *args, unsigned long entry);
150 static inline int enter_prom(struct prom_args *args, unsigned long entry)
152 return ((int (*)(struct prom_args *))entry)(args);
156 extern void copy_and_flush(unsigned long dest, unsigned long src,
157 unsigned long size, unsigned long offset);
160 static struct prom_t __initdata prom;
162 static unsigned long prom_entry __initdata;
164 #define PROM_SCRATCH_SIZE 256
166 static char __initdata of_stdout_device[256];
167 static char __initdata prom_scratch[PROM_SCRATCH_SIZE];
169 static unsigned long __initdata dt_header_start;
170 static unsigned long __initdata dt_struct_start, dt_struct_end;
171 static unsigned long __initdata dt_string_start, dt_string_end;
173 static unsigned long __initdata prom_initrd_start, prom_initrd_end;
176 static int __initdata iommu_force_on;
177 static int __initdata ppc64_iommu_off;
178 static unsigned long __initdata prom_tce_alloc_start;
179 static unsigned long __initdata prom_tce_alloc_end;
182 static int __initdata of_platform;
184 static char __initdata prom_cmd_line[COMMAND_LINE_SIZE];
186 static unsigned long __initdata prom_memory_limit;
188 static unsigned long __initdata alloc_top;
189 static unsigned long __initdata alloc_top_high;
190 static unsigned long __initdata alloc_bottom;
191 static unsigned long __initdata rmo_top;
192 static unsigned long __initdata ram_top;
194 static struct mem_map_entry __initdata mem_reserve_map[MEM_RESERVE_MAP_SIZE];
195 static int __initdata mem_reserve_cnt;
197 static cell_t __initdata regbuf[1024];
200 #define MAX_CPU_THREADS 2
206 unsigned int threadid;
207 } hmt_thread_data[NR_CPUS];
208 #endif /* CONFIG_HMT */
211 * Error results ... some OF calls will return "-1" on error, some
212 * will return 0, some will return either. To simplify, here are
213 * macros to use with any ihandle or phandle return value to check if
217 #define PROM_ERROR (-1u)
218 #define PHANDLE_VALID(p) ((p) != 0 && (p) != PROM_ERROR)
219 #define IHANDLE_VALID(i) ((i) != 0 && (i) != PROM_ERROR)
222 /* This is the one and *ONLY* place where we actually call open
226 static int __init call_prom(const char *service, int nargs, int nret, ...)
229 struct prom_args args;
232 args.service = ADDR(service);
236 va_start(list, nret);
237 for (i = 0; i < nargs; i++)
238 args.args[i] = va_arg(list, prom_arg_t);
241 for (i = 0; i < nret; i++)
242 args.args[nargs+i] = 0;
244 if (enter_prom(&args, RELOC(prom_entry)) < 0)
247 return (nret > 0) ? args.args[nargs] : 0;
250 static int __init call_prom_ret(const char *service, int nargs, int nret,
251 prom_arg_t *rets, ...)
254 struct prom_args args;
257 args.service = ADDR(service);
261 va_start(list, rets);
262 for (i = 0; i < nargs; i++)
263 args.args[i] = va_arg(list, prom_arg_t);
266 for (i = 0; i < nret; i++)
269 if (enter_prom(&args, RELOC(prom_entry)) < 0)
273 for (i = 1; i < nret; ++i)
274 rets[i-1] = args.args[nargs+i];
276 return (nret > 0) ? args.args[nargs] : 0;
280 static void __init prom_print(const char *msg)
283 struct prom_t *_prom = &RELOC(prom);
285 if (_prom->stdout == 0)
288 for (p = msg; *p != 0; p = q) {
289 for (q = p; *q != 0 && *q != '\n'; ++q)
292 call_prom("write", 3, 1, _prom->stdout, p, q - p);
296 call_prom("write", 3, 1, _prom->stdout, ADDR("\r\n"), 2);
301 static void __init prom_print_hex(unsigned long val)
303 int i, nibbles = sizeof(val)*2;
304 char buf[sizeof(val)*2+1];
305 struct prom_t *_prom = &RELOC(prom);
307 for (i = nibbles-1; i >= 0; i--) {
308 buf[i] = (val & 0xf) + '0';
310 buf[i] += ('a'-'0'-10);
314 call_prom("write", 3, 1, _prom->stdout, buf, nibbles);
318 static void __init prom_printf(const char *format, ...)
320 const char *p, *q, *s;
323 struct prom_t *_prom = &RELOC(prom);
325 va_start(args, format);
327 format = PTRRELOC(format);
329 for (p = format; *p != 0; p = q) {
330 for (q = p; *q != 0 && *q != '\n' && *q != '%'; ++q)
333 call_prom("write", 3, 1, _prom->stdout, p, q - p);
338 call_prom("write", 3, 1, _prom->stdout,
348 s = va_arg(args, const char *);
353 v = va_arg(args, unsigned long);
361 static unsigned int __init prom_claim(unsigned long virt, unsigned long size,
365 struct prom_t *_prom = &RELOC(prom);
367 ret = call_prom("claim", 3, 1, (prom_arg_t)virt, (prom_arg_t)size,
369 if (ret != -1 && _prom->mmumap != 0)
370 /* old pmacs need us to map as well */
371 call_prom("call-method", 6, 1,
372 ADDR("map"), _prom->mmumap, 0, size, virt, virt);
376 static void __init __attribute__((noreturn)) prom_panic(const char *reason)
379 reason = PTRRELOC(reason);
382 /* ToDo: should put up an SRC here on p/iSeries */
383 call_prom("exit", 0, 0);
385 for (;;) /* should never get here */
390 static int __init prom_next_node(phandle *nodep)
394 if ((node = *nodep) != 0
395 && (*nodep = call_prom("child", 1, 1, node)) != 0)
397 if ((*nodep = call_prom("peer", 1, 1, node)) != 0)
400 if ((node = call_prom("parent", 1, 1, node)) == 0)
402 if ((*nodep = call_prom("peer", 1, 1, node)) != 0)
407 static int __init prom_getprop(phandle node, const char *pname,
408 void *value, size_t valuelen)
410 return call_prom("getprop", 4, 1, node, ADDR(pname),
411 (u32)(unsigned long) value, (u32) valuelen);
414 static int __init prom_getproplen(phandle node, const char *pname)
416 return call_prom("getproplen", 2, 1, node, ADDR(pname));
419 static int __init prom_setprop(phandle node, const char *pname,
420 void *value, size_t valuelen)
422 return call_prom("setprop", 4, 1, node, ADDR(pname),
423 (u32)(unsigned long) value, (u32) valuelen);
426 /* We can't use the standard versions because of RELOC headaches. */
427 #define isxdigit(c) (('0' <= (c) && (c) <= '9') \
428 || ('a' <= (c) && (c) <= 'f') \
429 || ('A' <= (c) && (c) <= 'F'))
431 #define isdigit(c) ('0' <= (c) && (c) <= '9')
432 #define islower(c) ('a' <= (c) && (c) <= 'z')
433 #define toupper(c) (islower(c) ? ((c) - 'a' + 'A') : (c))
435 unsigned long prom_strtoul(const char *cp, const char **endp)
437 unsigned long result = 0, base = 10, value;
442 if (toupper(*cp) == 'X') {
448 while (isxdigit(*cp) &&
449 (value = isdigit(*cp) ? *cp - '0' : toupper(*cp) - 'A' + 10) < base) {
450 result = result * base + value;
460 unsigned long prom_memparse(const char *ptr, const char **retptr)
462 unsigned long ret = prom_strtoul(ptr, retptr);
466 * We can't use a switch here because GCC *may* generate a
467 * jump table which won't work, because we're not running at
468 * the address we're linked at.
470 if ('G' == **retptr || 'g' == **retptr)
473 if ('M' == **retptr || 'm' == **retptr)
476 if ('K' == **retptr || 'k' == **retptr)
488 * Early parsing of the command line passed to the kernel, used for
489 * "mem=x" and the options that affect the iommu
491 static void __init early_cmdline_parse(void)
493 struct prom_t *_prom = &RELOC(prom);
497 RELOC(prom_cmd_line[0]) = 0;
498 p = RELOC(prom_cmd_line);
499 if ((long)_prom->chosen > 0)
500 l = prom_getprop(_prom->chosen, "bootargs", p, COMMAND_LINE_SIZE-1);
501 #ifdef CONFIG_CMDLINE
502 if (l == 0) /* dbl check */
503 strlcpy(RELOC(prom_cmd_line),
504 RELOC(CONFIG_CMDLINE), sizeof(prom_cmd_line));
505 #endif /* CONFIG_CMDLINE */
506 prom_printf("command line: %s\n", RELOC(prom_cmd_line));
509 opt = strstr(RELOC(prom_cmd_line), RELOC("iommu="));
511 prom_printf("iommu opt is: %s\n", opt);
513 while (*opt && *opt == ' ')
515 if (!strncmp(opt, RELOC("off"), 3))
516 RELOC(ppc64_iommu_off) = 1;
517 else if (!strncmp(opt, RELOC("force"), 5))
518 RELOC(iommu_force_on) = 1;
522 opt = strstr(RELOC(prom_cmd_line), RELOC("mem="));
525 RELOC(prom_memory_limit) = prom_memparse(opt, (const char **)&opt);
527 /* Align to 16 MB == size of ppc64 large page */
528 RELOC(prom_memory_limit) = ALIGN(RELOC(prom_memory_limit), 0x1000000);
533 #ifdef CONFIG_PPC_PSERIES
535 * To tell the firmware what our capabilities are, we have to pass
536 * it a fake 32-bit ELF header containing a couple of PT_NOTE sections
537 * that contain structures that contain the actual values.
539 static struct fake_elf {
546 char name[8]; /* "PowerPC" */
560 char name[24]; /* "IBM,RPA-Client-Config" */
574 .e_ident = { 0x7f, 'E', 'L', 'F',
575 ELFCLASS32, ELFDATA2MSB, EV_CURRENT },
576 .e_type = ET_EXEC, /* yeah right */
578 .e_version = EV_CURRENT,
579 .e_phoff = offsetof(struct fake_elf, phdr),
580 .e_phentsize = sizeof(Elf32_Phdr),
586 .p_offset = offsetof(struct fake_elf, chrpnote),
587 .p_filesz = sizeof(struct chrpnote)
590 .p_offset = offsetof(struct fake_elf, rpanote),
591 .p_filesz = sizeof(struct rpanote)
595 .namesz = sizeof("PowerPC"),
596 .descsz = sizeof(struct chrpdesc),
600 .real_mode = ~0U, /* ~0 means "don't care" */
609 .namesz = sizeof("IBM,RPA-Client-Config"),
610 .descsz = sizeof(struct rpadesc),
612 .name = "IBM,RPA-Client-Config",
615 .min_rmo_size = 64, /* in megabytes */
616 .min_rmo_percent = 0,
617 .max_pft_size = 48, /* 2^48 bytes max PFT size */
625 static void __init prom_send_capabilities(void)
629 elfloader = call_prom("open", 1, 1, ADDR("/packages/elf-loader"));
630 if (elfloader == 0) {
631 prom_printf("couldn't open /packages/elf-loader\n");
634 call_prom("call-method", 3, 1, ADDR("process-elf-header"),
635 elfloader, ADDR(&fake_elf));
636 call_prom("close", 1, 0, elfloader);
641 * Memory allocation strategy... our layout is normally:
643 * at 14Mb or more we have vmlinux, then a gap and initrd. In some
644 * rare cases, initrd might end up being before the kernel though.
645 * We assume this won't override the final kernel at 0, we have no
646 * provision to handle that in this version, but it should hopefully
649 * alloc_top is set to the top of RMO, eventually shrink down if the
652 * alloc_bottom is set to the top of kernel/initrd
654 * from there, allocations are done this way : rtas is allocated
655 * topmost, and the device-tree is allocated from the bottom. We try
656 * to grow the device-tree allocation as we progress. If we can't,
657 * then we fail, we don't currently have a facility to restart
658 * elsewhere, but that shouldn't be necessary.
660 * Note that calls to reserve_mem have to be done explicitly, memory
661 * allocated with either alloc_up or alloc_down isn't automatically
667 * Allocates memory in the RMO upward from the kernel/initrd
669 * When align is 0, this is a special case, it means to allocate in place
670 * at the current location of alloc_bottom or fail (that is basically
671 * extending the previous allocation). Used for the device-tree flattening
673 static unsigned long __init alloc_up(unsigned long size, unsigned long align)
675 unsigned long base = RELOC(alloc_bottom);
676 unsigned long addr = 0;
679 base = _ALIGN_UP(base, align);
680 prom_debug("alloc_up(%x, %x)\n", size, align);
681 if (RELOC(ram_top) == 0)
682 prom_panic("alloc_up() called with mem not initialized\n");
685 base = _ALIGN_UP(RELOC(alloc_bottom), align);
687 base = RELOC(alloc_bottom);
689 for(; (base + size) <= RELOC(alloc_top);
690 base = _ALIGN_UP(base + 0x100000, align)) {
691 prom_debug(" trying: 0x%x\n\r", base);
692 addr = (unsigned long)prom_claim(base, size, 0);
693 if (addr != PROM_ERROR && addr != 0)
701 RELOC(alloc_bottom) = addr;
703 prom_debug(" -> %x\n", addr);
704 prom_debug(" alloc_bottom : %x\n", RELOC(alloc_bottom));
705 prom_debug(" alloc_top : %x\n", RELOC(alloc_top));
706 prom_debug(" alloc_top_hi : %x\n", RELOC(alloc_top_high));
707 prom_debug(" rmo_top : %x\n", RELOC(rmo_top));
708 prom_debug(" ram_top : %x\n", RELOC(ram_top));
714 * Allocates memory downward, either from top of RMO, or if highmem
715 * is set, from the top of RAM. Note that this one doesn't handle
716 * failures. It does claim memory if highmem is not set.
718 static unsigned long __init alloc_down(unsigned long size, unsigned long align,
721 unsigned long base, addr = 0;
723 prom_debug("alloc_down(%x, %x, %s)\n", size, align,
724 highmem ? RELOC("(high)") : RELOC("(low)"));
725 if (RELOC(ram_top) == 0)
726 prom_panic("alloc_down() called with mem not initialized\n");
729 /* Carve out storage for the TCE table. */
730 addr = _ALIGN_DOWN(RELOC(alloc_top_high) - size, align);
731 if (addr <= RELOC(alloc_bottom))
733 /* Will we bump into the RMO ? If yes, check out that we
734 * didn't overlap existing allocations there, if we did,
735 * we are dead, we must be the first in town !
737 if (addr < RELOC(rmo_top)) {
738 /* Good, we are first */
739 if (RELOC(alloc_top) == RELOC(rmo_top))
740 RELOC(alloc_top) = RELOC(rmo_top) = addr;
744 RELOC(alloc_top_high) = addr;
748 base = _ALIGN_DOWN(RELOC(alloc_top) - size, align);
749 for (; base > RELOC(alloc_bottom);
750 base = _ALIGN_DOWN(base - 0x100000, align)) {
751 prom_debug(" trying: 0x%x\n\r", base);
752 addr = (unsigned long)prom_claim(base, size, 0);
753 if (addr != PROM_ERROR && addr != 0)
759 RELOC(alloc_top) = addr;
762 prom_debug(" -> %x\n", addr);
763 prom_debug(" alloc_bottom : %x\n", RELOC(alloc_bottom));
764 prom_debug(" alloc_top : %x\n", RELOC(alloc_top));
765 prom_debug(" alloc_top_hi : %x\n", RELOC(alloc_top_high));
766 prom_debug(" rmo_top : %x\n", RELOC(rmo_top));
767 prom_debug(" ram_top : %x\n", RELOC(ram_top));
775 static unsigned long __init prom_next_cell(int s, cell_t **cellp)
780 /* Ignore more than 2 cells */
781 while (s > sizeof(unsigned long) / 4) {
797 * Very dumb function for adding to the memory reserve list, but
798 * we don't need anything smarter at this point
800 * XXX Eventually check for collisions. They should NEVER happen.
801 * If problems seem to show up, it would be a good start to track
804 static void reserve_mem(unsigned long base, unsigned long size)
806 unsigned long top = base + size;
807 unsigned long cnt = RELOC(mem_reserve_cnt);
812 /* We need to always keep one empty entry so that we
813 * have our terminator with "size" set to 0 since we are
814 * dumb and just copy this entire array to the boot params
816 base = _ALIGN_DOWN(base, PAGE_SIZE);
817 top = _ALIGN_UP(top, PAGE_SIZE);
820 if (cnt >= (MEM_RESERVE_MAP_SIZE - 1))
821 prom_panic("Memory reserve map exhausted !\n");
822 RELOC(mem_reserve_map)[cnt].base = base;
823 RELOC(mem_reserve_map)[cnt].size = size;
824 RELOC(mem_reserve_cnt) = cnt + 1;
828 * Initialize memory allocation mecanism, parse "memory" nodes and
829 * obtain that way the top of memory and RMO to setup out local allocator
831 static void __init prom_init_mem(void)
834 char *path, type[64];
837 struct prom_t *_prom = &RELOC(prom);
841 * We iterate the memory nodes to find
842 * 1) top of RMO (first node)
846 prom_getprop(_prom->root, "#address-cells", &rac, sizeof(rac));
848 prom_getprop(_prom->root, "#size-cells", &rsc, sizeof(rsc));
849 prom_debug("root_addr_cells: %x\n", (unsigned long) rac);
850 prom_debug("root_size_cells: %x\n", (unsigned long) rsc);
852 prom_debug("scanning memory:\n");
853 path = RELOC(prom_scratch);
855 for (node = 0; prom_next_node(&node); ) {
857 prom_getprop(node, "device_type", type, sizeof(type));
861 * CHRP Longtrail machines have no device_type
862 * on the memory node, so check the name instead...
864 prom_getprop(node, "name", type, sizeof(type));
866 if (strcmp(type, RELOC("memory")))
869 plen = prom_getprop(node, "reg", RELOC(regbuf), sizeof(regbuf));
870 if (plen > sizeof(regbuf)) {
871 prom_printf("memory node too large for buffer !\n");
872 plen = sizeof(regbuf);
875 endp = p + (plen / sizeof(cell_t));
878 memset(path, 0, PROM_SCRATCH_SIZE);
879 call_prom("package-to-path", 3, 1, node, path, PROM_SCRATCH_SIZE-1);
880 prom_debug(" node %s :\n", path);
881 #endif /* DEBUG_PROM */
883 while ((endp - p) >= (rac + rsc)) {
884 unsigned long base, size;
886 base = prom_next_cell(rac, &p);
887 size = prom_next_cell(rsc, &p);
891 prom_debug(" %x %x\n", base, size);
893 RELOC(rmo_top) = size;
894 if ((base + size) > RELOC(ram_top))
895 RELOC(ram_top) = base + size;
899 RELOC(alloc_bottom) = PAGE_ALIGN((unsigned long)&RELOC(_end) + 0x4000);
901 /* Check if we have an initrd after the kernel, if we do move our bottom
904 if (RELOC(prom_initrd_start)) {
905 if (RELOC(prom_initrd_end) > RELOC(alloc_bottom))
906 RELOC(alloc_bottom) = PAGE_ALIGN(RELOC(prom_initrd_end));
910 * If prom_memory_limit is set we reduce the upper limits *except* for
911 * alloc_top_high. This must be the real top of RAM so we can put
915 RELOC(alloc_top_high) = RELOC(ram_top);
917 if (RELOC(prom_memory_limit)) {
918 if (RELOC(prom_memory_limit) <= RELOC(alloc_bottom)) {
919 prom_printf("Ignoring mem=%x <= alloc_bottom.\n",
920 RELOC(prom_memory_limit));
921 RELOC(prom_memory_limit) = 0;
922 } else if (RELOC(prom_memory_limit) >= RELOC(ram_top)) {
923 prom_printf("Ignoring mem=%x >= ram_top.\n",
924 RELOC(prom_memory_limit));
925 RELOC(prom_memory_limit) = 0;
927 RELOC(ram_top) = RELOC(prom_memory_limit);
928 RELOC(rmo_top) = min(RELOC(rmo_top), RELOC(prom_memory_limit));
933 * Setup our top alloc point, that is top of RMO or top of
934 * segment 0 when running non-LPAR.
935 * Some RS64 machines have buggy firmware where claims up at
936 * 1GB fail. Cap at 768MB as a workaround.
937 * Since 768MB is plenty of room, and we need to cap to something
938 * reasonable on 32-bit, cap at 768MB on all machines.
941 RELOC(rmo_top) = RELOC(ram_top);
942 RELOC(rmo_top) = min(0x30000000ul, RELOC(rmo_top));
943 RELOC(alloc_top) = RELOC(rmo_top);
945 prom_printf("memory layout at init:\n");
946 prom_printf(" memory_limit : %x (16 MB aligned)\n", RELOC(prom_memory_limit));
947 prom_printf(" alloc_bottom : %x\n", RELOC(alloc_bottom));
948 prom_printf(" alloc_top : %x\n", RELOC(alloc_top));
949 prom_printf(" alloc_top_hi : %x\n", RELOC(alloc_top_high));
950 prom_printf(" rmo_top : %x\n", RELOC(rmo_top));
951 prom_printf(" ram_top : %x\n", RELOC(ram_top));
956 * Allocate room for and instantiate RTAS
958 static void __init prom_instantiate_rtas(void)
965 prom_debug("prom_instantiate_rtas: start...\n");
967 rtas_node = call_prom("finddevice", 1, 1, ADDR("/rtas"));
968 prom_debug("rtas_node: %x\n", rtas_node);
969 if (!PHANDLE_VALID(rtas_node))
972 prom_getprop(rtas_node, "rtas-size", &size, sizeof(size));
976 base = alloc_down(size, PAGE_SIZE, 0);
978 prom_printf("RTAS allocation failed !\n");
982 rtas_inst = call_prom("open", 1, 1, ADDR("/rtas"));
983 if (!IHANDLE_VALID(rtas_inst)) {
984 prom_printf("opening rtas package failed");
988 prom_printf("instantiating rtas at 0x%x ...", base);
990 if (call_prom_ret("call-method", 3, 2, &entry,
991 ADDR("instantiate-rtas"),
992 rtas_inst, base) == PROM_ERROR
994 prom_printf(" failed\n");
997 prom_printf(" done\n");
999 reserve_mem(base, size);
1001 prom_setprop(rtas_node, "linux,rtas-base", &base, sizeof(base));
1002 prom_setprop(rtas_node, "linux,rtas-entry", &entry, sizeof(entry));
1004 prom_debug("rtas base = 0x%x\n", base);
1005 prom_debug("rtas entry = 0x%x\n", entry);
1006 prom_debug("rtas size = 0x%x\n", (long)size);
1008 prom_debug("prom_instantiate_rtas: end...\n");
1013 * Allocate room for and initialize TCE tables
1015 static void __init prom_initialize_tce_table(void)
1019 char compatible[64], type[64], model[64];
1020 char *path = RELOC(prom_scratch);
1022 u32 minalign, minsize;
1023 u64 tce_entry, *tce_entryp;
1024 u64 local_alloc_top, local_alloc_bottom;
1027 if (RELOC(ppc64_iommu_off))
1030 prom_debug("starting prom_initialize_tce_table\n");
1032 /* Cache current top of allocs so we reserve a single block */
1033 local_alloc_top = RELOC(alloc_top_high);
1034 local_alloc_bottom = local_alloc_top;
1036 /* Search all nodes looking for PHBs. */
1037 for (node = 0; prom_next_node(&node); ) {
1041 prom_getprop(node, "compatible",
1042 compatible, sizeof(compatible));
1043 prom_getprop(node, "device_type", type, sizeof(type));
1044 prom_getprop(node, "model", model, sizeof(model));
1046 if ((type[0] == 0) || (strstr(type, RELOC("pci")) == NULL))
1049 /* Keep the old logic in tack to avoid regression. */
1050 if (compatible[0] != 0) {
1051 if ((strstr(compatible, RELOC("python")) == NULL) &&
1052 (strstr(compatible, RELOC("Speedwagon")) == NULL) &&
1053 (strstr(compatible, RELOC("Winnipeg")) == NULL))
1055 } else if (model[0] != 0) {
1056 if ((strstr(model, RELOC("ython")) == NULL) &&
1057 (strstr(model, RELOC("peedwagon")) == NULL) &&
1058 (strstr(model, RELOC("innipeg")) == NULL))
1062 if (prom_getprop(node, "tce-table-minalign", &minalign,
1063 sizeof(minalign)) == PROM_ERROR)
1065 if (prom_getprop(node, "tce-table-minsize", &minsize,
1066 sizeof(minsize)) == PROM_ERROR)
1067 minsize = 4UL << 20;
1070 * Even though we read what OF wants, we just set the table
1071 * size to 4 MB. This is enough to map 2GB of PCI DMA space.
1072 * By doing this, we avoid the pitfalls of trying to DMA to
1073 * MMIO space and the DMA alias hole.
1075 * On POWER4, firmware sets the TCE region by assuming
1076 * each TCE table is 8MB. Using this memory for anything
1077 * else will impact performance, so we always allocate 8MB.
1080 if (__is_processor(PV_POWER4) || __is_processor(PV_POWER4p))
1081 minsize = 8UL << 20;
1083 minsize = 4UL << 20;
1085 /* Align to the greater of the align or size */
1086 align = max(minalign, minsize);
1087 base = alloc_down(minsize, align, 1);
1089 prom_panic("ERROR, cannot find space for TCE table.\n");
1090 if (base < local_alloc_bottom)
1091 local_alloc_bottom = base;
1093 /* Save away the TCE table attributes for later use. */
1094 prom_setprop(node, "linux,tce-base", &base, sizeof(base));
1095 prom_setprop(node, "linux,tce-size", &minsize, sizeof(minsize));
1097 /* It seems OF doesn't null-terminate the path :-( */
1098 memset(path, 0, sizeof(path));
1099 /* Call OF to setup the TCE hardware */
1100 if (call_prom("package-to-path", 3, 1, node,
1101 path, PROM_SCRATCH_SIZE-1) == PROM_ERROR) {
1102 prom_printf("package-to-path failed\n");
1105 prom_debug("TCE table: %s\n", path);
1106 prom_debug("\tnode = 0x%x\n", node);
1107 prom_debug("\tbase = 0x%x\n", base);
1108 prom_debug("\tsize = 0x%x\n", minsize);
1110 /* Initialize the table to have a one-to-one mapping
1111 * over the allocated size.
1113 tce_entryp = (unsigned long *)base;
1114 for (i = 0; i < (minsize >> 3) ;tce_entryp++, i++) {
1115 tce_entry = (i << PAGE_SHIFT);
1117 *tce_entryp = tce_entry;
1120 prom_printf("opening PHB %s", path);
1121 phb_node = call_prom("open", 1, 1, path);
1123 prom_printf("... failed\n");
1125 prom_printf("... done\n");
1127 call_prom("call-method", 6, 0, ADDR("set-64-bit-addressing"),
1128 phb_node, -1, minsize,
1129 (u32) base, (u32) (base >> 32));
1130 call_prom("close", 1, 0, phb_node);
1133 reserve_mem(local_alloc_bottom, local_alloc_top - local_alloc_bottom);
1135 if (RELOC(prom_memory_limit)) {
1137 * We align the start to a 16MB boundary so we can map
1138 * the TCE area using large pages if possible.
1139 * The end should be the top of RAM so no need to align it.
1141 RELOC(prom_tce_alloc_start) = _ALIGN_DOWN(local_alloc_bottom,
1143 RELOC(prom_tce_alloc_end) = local_alloc_top;
1146 /* Flag the first invalid entry */
1147 prom_debug("ending prom_initialize_tce_table\n");
1152 * With CHRP SMP we need to use the OF to start the other processors.
1153 * We can't wait until smp_boot_cpus (the OF is trashed by then)
1154 * so we have to put the processors into a holding pattern controlled
1155 * by the kernel (not OF) before we destroy the OF.
1157 * This uses a chunk of low memory, puts some holding pattern
1158 * code there and sends the other processors off to there until
1159 * smp_boot_cpus tells them to do something. The holding pattern
1160 * checks that address until its cpu # is there, when it is that
1161 * cpu jumps to __secondary_start(). smp_boot_cpus() takes care
1162 * of setting those values.
1164 * We also use physical address 0x4 here to tell when a cpu
1165 * is in its holding pattern code.
1169 extern void __secondary_hold(void);
1170 extern unsigned long __secondary_hold_spinloop;
1171 extern unsigned long __secondary_hold_acknowledge;
1174 * We want to reference the copy of __secondary_hold_* in the
1175 * 0 - 0x100 address range
1177 #define LOW_ADDR(x) (((unsigned long) &(x)) & 0xff)
1179 static void __init prom_hold_cpus(void)
1186 unsigned int interrupt_server[MAX_CPU_THREADS];
1187 unsigned int cpu_threads, hw_cpu_num;
1189 struct prom_t *_prom = &RELOC(prom);
1190 unsigned long *spinloop
1191 = (void *) LOW_ADDR(__secondary_hold_spinloop);
1192 unsigned long *acknowledge
1193 = (void *) LOW_ADDR(__secondary_hold_acknowledge);
1195 /* __secondary_hold is actually a descriptor, not the text address */
1196 unsigned long secondary_hold
1197 = __pa(*PTRRELOC((unsigned long *)__secondary_hold));
1199 unsigned long secondary_hold = LOW_ADDR(__secondary_hold);
1202 prom_debug("prom_hold_cpus: start...\n");
1203 prom_debug(" 1) spinloop = 0x%x\n", (unsigned long)spinloop);
1204 prom_debug(" 1) *spinloop = 0x%x\n", *spinloop);
1205 prom_debug(" 1) acknowledge = 0x%x\n",
1206 (unsigned long)acknowledge);
1207 prom_debug(" 1) *acknowledge = 0x%x\n", *acknowledge);
1208 prom_debug(" 1) secondary_hold = 0x%x\n", secondary_hold);
1210 /* Set the common spinloop variable, so all of the secondary cpus
1211 * will block when they are awakened from their OF spinloop.
1212 * This must occur for both SMP and non SMP kernels, since OF will
1213 * be trashed when we move the kernel.
1218 for (i = 0; i < NR_CPUS; i++)
1219 RELOC(hmt_thread_data)[i].pir = 0xdeadbeef;
1222 for (node = 0; prom_next_node(&node); ) {
1224 prom_getprop(node, "device_type", type, sizeof(type));
1225 if (strcmp(type, RELOC("cpu")) != 0)
1228 /* Skip non-configured cpus. */
1229 if (prom_getprop(node, "status", type, sizeof(type)) > 0)
1230 if (strcmp(type, RELOC("okay")) != 0)
1234 prom_getprop(node, "reg", ®, sizeof(reg));
1236 prom_debug("\ncpuid = 0x%x\n", cpuid);
1237 prom_debug("cpu hw idx = 0x%x\n", reg);
1239 /* Init the acknowledge var which will be reset by
1240 * the secondary cpu when it awakens from its OF
1243 *acknowledge = (unsigned long)-1;
1245 propsize = prom_getprop(node, "ibm,ppc-interrupt-server#s",
1247 sizeof(interrupt_server));
1249 /* no property. old hardware has no SMT */
1251 interrupt_server[0] = reg; /* fake it with phys id */
1253 /* We have a threaded processor */
1254 cpu_threads = propsize / sizeof(u32);
1255 if (cpu_threads > MAX_CPU_THREADS) {
1256 prom_printf("SMT: too many threads!\n"
1257 "SMT: found %x, max is %x\n",
1258 cpu_threads, MAX_CPU_THREADS);
1259 cpu_threads = 1; /* ToDo: panic? */
1263 hw_cpu_num = interrupt_server[0];
1264 if (hw_cpu_num != _prom->cpu) {
1265 /* Primary Thread of non-boot cpu */
1266 prom_printf("%x : starting cpu hw idx %x... ", cpuid, reg);
1267 call_prom("start-cpu", 3, 0, node,
1268 secondary_hold, reg);
1270 for (i = 0; (i < 100000000) &&
1271 (*acknowledge == ((unsigned long)-1)); i++ )
1274 if (*acknowledge == reg)
1275 prom_printf("done\n");
1277 prom_printf("failed: %x\n", *acknowledge);
1281 prom_printf("%x : boot cpu %x\n", cpuid, reg);
1282 #endif /* CONFIG_SMP */
1284 /* Reserve cpu #s for secondary threads. They start later. */
1285 cpuid += cpu_threads;
1288 /* Only enable HMT on processors that provide support. */
1289 if (__is_processor(PV_PULSAR) ||
1290 __is_processor(PV_ICESTAR) ||
1291 __is_processor(PV_SSTAR)) {
1292 prom_printf(" starting secondary threads\n");
1294 for (i = 0; i < NR_CPUS; i += 2) {
1299 unsigned long pir = mfspr(SPRN_PIR);
1300 if (__is_processor(PV_PULSAR)) {
1301 RELOC(hmt_thread_data)[i].pir =
1304 RELOC(hmt_thread_data)[i].pir =
1310 prom_printf("Processor is not HMT capable\n");
1314 if (cpuid > NR_CPUS)
1315 prom_printf("WARNING: maximum CPUs (" __stringify(NR_CPUS)
1316 ") exceeded: ignoring extras\n");
1318 prom_debug("prom_hold_cpus: end...\n");
1322 static void __init prom_init_client_services(unsigned long pp)
1324 struct prom_t *_prom = &RELOC(prom);
1326 /* Get a handle to the prom entry point before anything else */
1327 RELOC(prom_entry) = pp;
1329 /* get a handle for the stdout device */
1330 _prom->chosen = call_prom("finddevice", 1, 1, ADDR("/chosen"));
1331 if (!PHANDLE_VALID(_prom->chosen))
1332 prom_panic("cannot find chosen"); /* msg won't be printed :( */
1334 /* get device tree root */
1335 _prom->root = call_prom("finddevice", 1, 1, ADDR("/"));
1336 if (!PHANDLE_VALID(_prom->root))
1337 prom_panic("cannot find device tree root"); /* msg won't be printed :( */
1344 * For really old powermacs, we need to map things we claim.
1345 * For that, we need the ihandle of the mmu.
1347 static void __init prom_find_mmu(void)
1349 struct prom_t *_prom = &RELOC(prom);
1353 oprom = call_prom("finddevice", 1, 1, ADDR("/openprom"));
1354 if (!PHANDLE_VALID(oprom))
1356 if (prom_getprop(oprom, "model", version, sizeof(version)) <= 0)
1358 version[sizeof(version) - 1] = 0;
1359 prom_printf("OF version is '%s'\n", version);
1360 /* XXX might need to add other versions here */
1361 if (strcmp(version, "Open Firmware, 1.0.5") != 0)
1363 prom_getprop(_prom->chosen, "mmu", &_prom->mmumap,
1364 sizeof(_prom->mmumap));
1367 #define prom_find_mmu()
1370 static void __init prom_init_stdout(void)
1372 struct prom_t *_prom = &RELOC(prom);
1373 char *path = RELOC(of_stdout_device);
1377 if (prom_getprop(_prom->chosen, "stdout", &val, sizeof(val)) <= 0)
1378 prom_panic("cannot find stdout");
1380 _prom->stdout = val;
1382 /* Get the full OF pathname of the stdout device */
1383 memset(path, 0, 256);
1384 call_prom("instance-to-path", 3, 1, _prom->stdout, path, 255);
1385 val = call_prom("instance-to-package", 1, 1, _prom->stdout);
1386 prom_setprop(_prom->chosen, "linux,stdout-package", &val, sizeof(val));
1387 prom_printf("OF stdout device is: %s\n", RELOC(of_stdout_device));
1388 prom_setprop(_prom->chosen, "linux,stdout-path",
1389 RELOC(of_stdout_device), strlen(RELOC(of_stdout_device))+1);
1391 /* If it's a display, note it */
1392 memset(type, 0, sizeof(type));
1393 prom_getprop(val, "device_type", type, sizeof(type));
1394 if (strcmp(type, RELOC("display")) == 0)
1395 prom_setprop(val, "linux,boot-display", NULL, 0);
1398 static void __init prom_close_stdin(void)
1400 struct prom_t *_prom = &RELOC(prom);
1403 if (prom_getprop(_prom->chosen, "stdin", &val, sizeof(val)) > 0)
1404 call_prom("close", 1, 0, val);
1407 static int __init prom_find_machine_type(void)
1409 struct prom_t *_prom = &RELOC(prom);
1414 len = prom_getprop(_prom->root, "compatible",
1415 compat, sizeof(compat)-1);
1419 char *p = &compat[i];
1423 if (strstr(p, RELOC("Power Macintosh")) ||
1424 strstr(p, RELOC("MacRISC")))
1425 return PLATFORM_POWERMAC;
1427 if (strstr(p, RELOC("Momentum,Maple")))
1428 return PLATFORM_MAPLE;
1434 /* Default to pSeries. We need to know if we are running LPAR */
1435 rtas = call_prom("finddevice", 1, 1, ADDR("/rtas"));
1436 if (PHANDLE_VALID(rtas)) {
1437 int x = prom_getproplen(rtas, "ibm,hypertas-functions");
1438 if (x != PROM_ERROR) {
1439 prom_printf("Hypertas detected, assuming LPAR !\n");
1440 return PLATFORM_PSERIES_LPAR;
1443 return PLATFORM_PSERIES;
1445 return PLATFORM_CHRP;
1449 static int __init prom_set_color(ihandle ih, int i, int r, int g, int b)
1451 return call_prom("call-method", 6, 1, ADDR("color!"), ih, i, b, g, r);
1455 * If we have a display that we don't know how to drive,
1456 * we will want to try to execute OF's open method for it
1457 * later. However, OF will probably fall over if we do that
1458 * we've taken over the MMU.
1459 * So we check whether we will need to open the display,
1460 * and if so, open it now.
1462 static void __init prom_check_displays(void)
1464 char type[16], *path;
1469 static unsigned char default_colors[] = {
1487 const unsigned char *clut;
1489 prom_printf("Looking for displays\n");
1490 for (node = 0; prom_next_node(&node); ) {
1491 memset(type, 0, sizeof(type));
1492 prom_getprop(node, "device_type", type, sizeof(type));
1493 if (strcmp(type, RELOC("display")) != 0)
1496 /* It seems OF doesn't null-terminate the path :-( */
1497 path = RELOC(prom_scratch);
1498 memset(path, 0, PROM_SCRATCH_SIZE);
1501 * leave some room at the end of the path for appending extra
1504 if (call_prom("package-to-path", 3, 1, node, path,
1505 PROM_SCRATCH_SIZE-10) == PROM_ERROR)
1507 prom_printf("found display : %s, opening ... ", path);
1509 ih = call_prom("open", 1, 1, path);
1511 prom_printf("failed\n");
1516 prom_printf("done\n");
1517 prom_setprop(node, "linux,opened", NULL, 0);
1519 /* Setup a usable color table when the appropriate
1520 * method is available. Should update this to set-colors */
1521 clut = RELOC(default_colors);
1522 for (i = 0; i < 32; i++, clut += 3)
1523 if (prom_set_color(ih, i, clut[0], clut[1],
1527 #ifdef CONFIG_LOGO_LINUX_CLUT224
1528 clut = PTRRELOC(RELOC(logo_linux_clut224.clut));
1529 for (i = 0; i < RELOC(logo_linux_clut224.clutsize); i++, clut += 3)
1530 if (prom_set_color(ih, i + 32, clut[0], clut[1],
1533 #endif /* CONFIG_LOGO_LINUX_CLUT224 */
1538 /* Return (relocated) pointer to this much memory: moves initrd if reqd. */
1539 static void __init *make_room(unsigned long *mem_start, unsigned long *mem_end,
1540 unsigned long needed, unsigned long align)
1544 *mem_start = _ALIGN(*mem_start, align);
1545 while ((*mem_start + needed) > *mem_end) {
1546 unsigned long room, chunk;
1548 prom_debug("Chunk exhausted, claiming more at %x...\n",
1549 RELOC(alloc_bottom));
1550 room = RELOC(alloc_top) - RELOC(alloc_bottom);
1551 if (room > DEVTREE_CHUNK_SIZE)
1552 room = DEVTREE_CHUNK_SIZE;
1553 if (room < PAGE_SIZE)
1554 prom_panic("No memory for flatten_device_tree (no room)");
1555 chunk = alloc_up(room, 0);
1557 prom_panic("No memory for flatten_device_tree (claim failed)");
1558 *mem_end = RELOC(alloc_top);
1561 ret = (void *)*mem_start;
1562 *mem_start += needed;
1567 #define dt_push_token(token, mem_start, mem_end) \
1568 do { *((u32 *)make_room(mem_start, mem_end, 4, 4)) = token; } while(0)
1570 static unsigned long __init dt_find_string(char *str)
1574 s = os = (char *)RELOC(dt_string_start);
1576 while (s < (char *)RELOC(dt_string_end)) {
1577 if (strcmp(s, str) == 0)
1585 * The Open Firmware 1275 specification states properties must be 31 bytes or
1586 * less, however not all firmwares obey this. Make it 64 bytes to be safe.
1588 #define MAX_PROPERTY_NAME 64
1590 static void __init scan_dt_build_strings(phandle node,
1591 unsigned long *mem_start,
1592 unsigned long *mem_end)
1594 char *prev_name, *namep, *sstart;
1598 sstart = (char *)RELOC(dt_string_start);
1600 /* get and store all property names */
1601 prev_name = RELOC("");
1603 /* 64 is max len of name including nul. */
1604 namep = make_room(mem_start, mem_end, MAX_PROPERTY_NAME, 1);
1605 if (call_prom("nextprop", 3, 1, node, prev_name, namep) != 1) {
1606 /* No more nodes: unwind alloc */
1607 *mem_start = (unsigned long)namep;
1612 if (strcmp(namep, RELOC("name")) == 0) {
1613 *mem_start = (unsigned long)namep;
1614 prev_name = RELOC("name");
1617 /* get/create string entry */
1618 soff = dt_find_string(namep);
1620 *mem_start = (unsigned long)namep;
1621 namep = sstart + soff;
1623 /* Trim off some if we can */
1624 *mem_start = (unsigned long)namep + strlen(namep) + 1;
1625 RELOC(dt_string_end) = *mem_start;
1630 /* do all our children */
1631 child = call_prom("child", 1, 1, node);
1632 while (child != 0) {
1633 scan_dt_build_strings(child, mem_start, mem_end);
1634 child = call_prom("peer", 1, 1, child);
1638 static void __init scan_dt_build_struct(phandle node, unsigned long *mem_start,
1639 unsigned long *mem_end)
1642 char *namep, *prev_name, *sstart, *p, *ep, *lp, *path;
1644 unsigned char *valp;
1645 static char pname[MAX_PROPERTY_NAME];
1648 dt_push_token(OF_DT_BEGIN_NODE, mem_start, mem_end);
1650 /* get the node's full name */
1651 namep = (char *)*mem_start;
1652 room = *mem_end - *mem_start;
1655 l = call_prom("package-to-path", 3, 1, node, namep, room);
1657 /* Didn't fit? Get more room. */
1659 if (l >= *mem_end - *mem_start)
1660 namep = make_room(mem_start, mem_end, l+1, 1);
1661 call_prom("package-to-path", 3, 1, node, namep, l);
1665 /* Fixup an Apple bug where they have bogus \0 chars in the
1666 * middle of the path in some properties, and extract
1667 * the unit name (everything after the last '/').
1669 for (lp = p = namep, ep = namep + l; p < ep; p++) {
1676 *mem_start = _ALIGN((unsigned long)lp + 1, 4);
1679 /* get it again for debugging */
1680 path = RELOC(prom_scratch);
1681 memset(path, 0, PROM_SCRATCH_SIZE);
1682 call_prom("package-to-path", 3, 1, node, path, PROM_SCRATCH_SIZE-1);
1684 /* get and store all properties */
1685 prev_name = RELOC("");
1686 sstart = (char *)RELOC(dt_string_start);
1688 if (call_prom("nextprop", 3, 1, node, prev_name,
1693 if (strcmp(RELOC(pname), RELOC("name")) == 0) {
1694 prev_name = RELOC("name");
1698 /* find string offset */
1699 soff = dt_find_string(RELOC(pname));
1701 prom_printf("WARNING: Can't find string index for"
1702 " <%s>, node %s\n", RELOC(pname), path);
1705 prev_name = sstart + soff;
1708 l = call_prom("getproplen", 2, 1, node, RELOC(pname));
1711 if (l == PROM_ERROR)
1713 if (l > MAX_PROPERTY_LENGTH) {
1714 prom_printf("WARNING: ignoring large property ");
1715 /* It seems OF doesn't null-terminate the path :-( */
1716 prom_printf("[%s] ", path);
1717 prom_printf("%s length 0x%x\n", RELOC(pname), l);
1721 /* push property head */
1722 dt_push_token(OF_DT_PROP, mem_start, mem_end);
1723 dt_push_token(l, mem_start, mem_end);
1724 dt_push_token(soff, mem_start, mem_end);
1726 /* push property content */
1727 valp = make_room(mem_start, mem_end, l, 4);
1728 call_prom("getprop", 4, 1, node, RELOC(pname), valp, l);
1729 *mem_start = _ALIGN(*mem_start, 4);
1732 /* Add a "linux,phandle" property. */
1733 soff = dt_find_string(RELOC("linux,phandle"));
1735 prom_printf("WARNING: Can't find string index for"
1736 " <linux-phandle> node %s\n", path);
1738 dt_push_token(OF_DT_PROP, mem_start, mem_end);
1739 dt_push_token(4, mem_start, mem_end);
1740 dt_push_token(soff, mem_start, mem_end);
1741 valp = make_room(mem_start, mem_end, 4, 4);
1742 *(u32 *)valp = node;
1745 /* do all our children */
1746 child = call_prom("child", 1, 1, node);
1747 while (child != 0) {
1748 scan_dt_build_struct(child, mem_start, mem_end);
1749 child = call_prom("peer", 1, 1, child);
1752 dt_push_token(OF_DT_END_NODE, mem_start, mem_end);
1755 static void __init flatten_device_tree(void)
1758 unsigned long mem_start, mem_end, room;
1759 struct boot_param_header *hdr;
1760 struct prom_t *_prom = &RELOC(prom);
1765 * Check how much room we have between alloc top & bottom (+/- a
1766 * few pages), crop to 4Mb, as this is our "chuck" size
1768 room = RELOC(alloc_top) - RELOC(alloc_bottom) - 0x4000;
1769 if (room > DEVTREE_CHUNK_SIZE)
1770 room = DEVTREE_CHUNK_SIZE;
1771 prom_debug("starting device tree allocs at %x\n", RELOC(alloc_bottom));
1773 /* Now try to claim that */
1774 mem_start = (unsigned long)alloc_up(room, PAGE_SIZE);
1776 prom_panic("Can't allocate initial device-tree chunk\n");
1777 mem_end = RELOC(alloc_top);
1779 /* Get root of tree */
1780 root = call_prom("peer", 1, 1, (phandle)0);
1781 if (root == (phandle)0)
1782 prom_panic ("couldn't get device tree root\n");
1784 /* Build header and make room for mem rsv map */
1785 mem_start = _ALIGN(mem_start, 4);
1786 hdr = make_room(&mem_start, &mem_end,
1787 sizeof(struct boot_param_header), 4);
1788 RELOC(dt_header_start) = (unsigned long)hdr;
1789 rsvmap = make_room(&mem_start, &mem_end, sizeof(mem_reserve_map), 8);
1791 /* Start of strings */
1792 mem_start = PAGE_ALIGN(mem_start);
1793 RELOC(dt_string_start) = mem_start;
1794 mem_start += 4; /* hole */
1796 /* Add "linux,phandle" in there, we'll need it */
1797 namep = make_room(&mem_start, &mem_end, 16, 1);
1798 strcpy(namep, RELOC("linux,phandle"));
1799 mem_start = (unsigned long)namep + strlen(namep) + 1;
1801 /* Build string array */
1802 prom_printf("Building dt strings...\n");
1803 scan_dt_build_strings(root, &mem_start, &mem_end);
1804 RELOC(dt_string_end) = mem_start;
1806 /* Build structure */
1807 mem_start = PAGE_ALIGN(mem_start);
1808 RELOC(dt_struct_start) = mem_start;
1809 prom_printf("Building dt structure...\n");
1810 scan_dt_build_struct(root, &mem_start, &mem_end);
1811 dt_push_token(OF_DT_END, &mem_start, &mem_end);
1812 RELOC(dt_struct_end) = PAGE_ALIGN(mem_start);
1815 hdr->boot_cpuid_phys = _prom->cpu;
1816 hdr->magic = OF_DT_HEADER;
1817 hdr->totalsize = RELOC(dt_struct_end) - RELOC(dt_header_start);
1818 hdr->off_dt_struct = RELOC(dt_struct_start) - RELOC(dt_header_start);
1819 hdr->off_dt_strings = RELOC(dt_string_start) - RELOC(dt_header_start);
1820 hdr->dt_strings_size = RELOC(dt_string_end) - RELOC(dt_string_start);
1821 hdr->off_mem_rsvmap = ((unsigned long)rsvmap) - RELOC(dt_header_start);
1822 hdr->version = OF_DT_VERSION;
1823 /* Version 16 is not backward compatible */
1824 hdr->last_comp_version = 0x10;
1826 /* Reserve the whole thing and copy the reserve map in, we
1827 * also bump mem_reserve_cnt to cause further reservations to
1828 * fail since it's too late.
1830 reserve_mem(RELOC(dt_header_start), hdr->totalsize);
1831 memcpy(rsvmap, RELOC(mem_reserve_map), sizeof(mem_reserve_map));
1836 prom_printf("reserved memory map:\n");
1837 for (i = 0; i < RELOC(mem_reserve_cnt); i++)
1838 prom_printf(" %x - %x\n",
1839 RELOC(mem_reserve_map)[i].base,
1840 RELOC(mem_reserve_map)[i].size);
1843 RELOC(mem_reserve_cnt) = MEM_RESERVE_MAP_SIZE;
1845 prom_printf("Device tree strings 0x%x -> 0x%x\n",
1846 RELOC(dt_string_start), RELOC(dt_string_end));
1847 prom_printf("Device tree struct 0x%x -> 0x%x\n",
1848 RELOC(dt_struct_start), RELOC(dt_struct_end));
1853 static void __init fixup_device_tree(void)
1855 #if defined(CONFIG_PPC64) && defined(CONFIG_PPC_PMAC)
1856 phandle u3, i2c, mpic;
1861 /* Some G5s have a missing interrupt definition, fix it up here */
1862 u3 = call_prom("finddevice", 1, 1, ADDR("/u3@0,f8000000"));
1863 if (!PHANDLE_VALID(u3))
1865 i2c = call_prom("finddevice", 1, 1, ADDR("/u3@0,f8000000/i2c@f8001000"));
1866 if (!PHANDLE_VALID(i2c))
1868 mpic = call_prom("finddevice", 1, 1, ADDR("/u3@0,f8000000/mpic@f8040000"));
1869 if (!PHANDLE_VALID(mpic))
1872 /* check if proper rev of u3 */
1873 if (prom_getprop(u3, "device-rev", &u3_rev, sizeof(u3_rev))
1876 if (u3_rev != 0x35 && u3_rev != 0x37)
1878 /* does it need fixup ? */
1879 if (prom_getproplen(i2c, "interrupts") > 0)
1882 prom_printf("fixing up bogus interrupts for u3 i2c...\n");
1884 /* interrupt on this revision of u3 is number 0 and level */
1887 prom_setprop(i2c, "interrupts", &interrupts, sizeof(interrupts));
1889 prom_setprop(i2c, "interrupt-parent", &parent, sizeof(parent));
1894 static void __init prom_find_boot_cpu(void)
1896 struct prom_t *_prom = &RELOC(prom);
1902 if (prom_getprop(_prom->chosen, "cpu", &prom_cpu, sizeof(prom_cpu)) <= 0)
1905 cpu_pkg = call_prom("instance-to-package", 1, 1, prom_cpu);
1907 prom_getprop(cpu_pkg, "reg", &getprop_rval, sizeof(getprop_rval));
1908 _prom->cpu = getprop_rval;
1910 prom_debug("Booting CPU hw index = 0x%x\n", _prom->cpu);
1913 static void __init prom_check_initrd(unsigned long r3, unsigned long r4)
1915 #ifdef CONFIG_BLK_DEV_INITRD
1916 struct prom_t *_prom = &RELOC(prom);
1918 if (r3 && r4 && r4 != 0xdeadbeef) {
1921 RELOC(prom_initrd_start) = (r3 >= KERNELBASE) ? __pa(r3) : r3;
1922 RELOC(prom_initrd_end) = RELOC(prom_initrd_start) + r4;
1924 val = RELOC(prom_initrd_start);
1925 prom_setprop(_prom->chosen, "linux,initrd-start", &val,
1927 val = RELOC(prom_initrd_end);
1928 prom_setprop(_prom->chosen, "linux,initrd-end", &val,
1931 reserve_mem(RELOC(prom_initrd_start),
1932 RELOC(prom_initrd_end) - RELOC(prom_initrd_start));
1934 prom_debug("initrd_start=0x%x\n", RELOC(prom_initrd_start));
1935 prom_debug("initrd_end=0x%x\n", RELOC(prom_initrd_end));
1937 #endif /* CONFIG_BLK_DEV_INITRD */
1941 * We enter here early on, when the Open Firmware prom is still
1942 * handling exceptions and the MMU hash table for us.
1945 unsigned long __init prom_init(unsigned long r3, unsigned long r4,
1947 unsigned long r6, unsigned long r7)
1949 struct prom_t *_prom;
1952 unsigned long offset = reloc_offset();
1958 _prom = &RELOC(prom);
1961 * First zero the BSS
1963 memset(&RELOC(__bss_start), 0, __bss_stop - __bss_start);
1966 * Init interface to Open Firmware, get some node references,
1969 prom_init_client_services(pp);
1972 * Init prom stdout device
1977 * See if this OF is old enough that we need to do explicit maps
1982 * Check for an initrd
1984 prom_check_initrd(r3, r4);
1987 * Get default machine type. At this point, we do not differentiate
1988 * between pSeries SMP and pSeries LPAR
1990 RELOC(of_platform) = prom_find_machine_type();
1991 getprop_rval = RELOC(of_platform);
1992 prom_setprop(_prom->chosen, "linux,platform",
1993 &getprop_rval, sizeof(getprop_rval));
1995 #ifdef CONFIG_PPC_PSERIES
1997 * On pSeries, inform the firmware about our capabilities
1999 if (RELOC(of_platform) & PLATFORM_PSERIES)
2000 prom_send_capabilities();
2004 * On pSeries and BPA, copy the CPU hold code
2006 if (RELOC(of_platform) != PLATFORM_POWERMAC)
2007 copy_and_flush(0, KERNELBASE + offset, 0x100, 0);
2010 * Do early parsing of command line
2012 early_cmdline_parse();
2015 * Initialize memory management within prom_init
2020 * Determine which cpu is actually running right _now_
2022 prom_find_boot_cpu();
2025 * Initialize display devices
2027 prom_check_displays();
2031 * Initialize IOMMU (TCE tables) on pSeries. Do that before anything else
2032 * that uses the allocator, we need to make sure we get the top of memory
2033 * available for us here...
2035 if (RELOC(of_platform) == PLATFORM_PSERIES)
2036 prom_initialize_tce_table();
2040 * On non-powermacs, try to instantiate RTAS and puts all CPUs
2041 * in spin-loops. PowerMacs don't have a working RTAS and use
2042 * a different way to spin CPUs
2044 if (RELOC(of_platform) != PLATFORM_POWERMAC) {
2045 prom_instantiate_rtas();
2050 * Fill in some infos for use by the kernel later on
2052 if (RELOC(prom_memory_limit))
2053 prom_setprop(_prom->chosen, "linux,memory-limit",
2054 &RELOC(prom_memory_limit),
2055 sizeof(prom_memory_limit));
2057 if (RELOC(ppc64_iommu_off))
2058 prom_setprop(_prom->chosen, "linux,iommu-off", NULL, 0);
2060 if (RELOC(iommu_force_on))
2061 prom_setprop(_prom->chosen, "linux,iommu-force-on", NULL, 0);
2063 if (RELOC(prom_tce_alloc_start)) {
2064 prom_setprop(_prom->chosen, "linux,tce-alloc-start",
2065 &RELOC(prom_tce_alloc_start),
2066 sizeof(prom_tce_alloc_start));
2067 prom_setprop(_prom->chosen, "linux,tce-alloc-end",
2068 &RELOC(prom_tce_alloc_end),
2069 sizeof(prom_tce_alloc_end));
2074 * Fixup any known bugs in the device-tree
2076 fixup_device_tree();
2079 * Now finally create the flattened device-tree
2081 prom_printf("copying OF device tree ...\n");
2082 flatten_device_tree();
2084 /* in case stdin is USB and still active on IBM machines... */
2088 * Call OF "quiesce" method to shut down pending DMA's from
2091 prom_printf("Calling quiesce ...\n");
2092 call_prom("quiesce", 0, 0);
2095 * And finally, call the kernel passing it the flattened device
2096 * tree and NULL as r5, thus triggering the new entry point which
2097 * is common to us and kexec
2099 hdr = RELOC(dt_header_start);
2100 prom_printf("returning from prom_init\n");
2101 prom_debug("->dt_header_start=0x%x\n", hdr);
2104 reloc_got2(-offset);
2107 __start(hdr, KERNELBASE + offset, 0);