···11-/*22- * Procedures for interfacing to Open Firmware.33- *44- * Peter Bergner, IBM Corp. June 2001.55- * Copyright (C) 2001 Peter Bergner.66- * 77- * This program is free software; you can redistribute it and/or88- * modify it under the terms of the GNU General Public License99- * as published by the Free Software Foundation; either version1010- * 2 of the License, or (at your option) any later version.1111- */1212-1313-#include <linux/config.h>1414-#include <linux/kernel.h>1515-#include <linux/init.h>1616-#include <linux/bitops.h>1717-#include <asm/types.h>1818-#include <asm/page.h>1919-#include <asm/prom.h>2020-#include <asm/lmb.h>2121-#include <asm/abs_addr.h>2222-2323-struct lmb lmb;2424-2525-#undef DEBUG2626-2727-void lmb_dump_all(void)2828-{2929-#ifdef DEBUG3030- unsigned long i;3131-3232- udbg_printf("lmb_dump_all:\n");3333- udbg_printf(" memory.cnt = 0x%lx\n",3434- lmb.memory.cnt);3535- udbg_printf(" memory.size = 0x%lx\n",3636- lmb.memory.size);3737- for (i=0; i < lmb.memory.cnt ;i++) {3838- udbg_printf(" memory.region[0x%x].base = 0x%lx\n",3939- i, lmb.memory.region[i].base);4040- udbg_printf(" .size = 0x%lx\n",4141- lmb.memory.region[i].size);4242- }4343-4444- udbg_printf("\n reserved.cnt = 0x%lx\n",4545- lmb.reserved.cnt);4646- udbg_printf(" reserved.size = 0x%lx\n",4747- lmb.reserved.size);4848- for (i=0; i < lmb.reserved.cnt ;i++) {4949- udbg_printf(" reserved.region[0x%x].base = 0x%lx\n",5050- i, lmb.reserved.region[i].base);5151- udbg_printf(" .size = 0x%lx\n",5252- lmb.reserved.region[i].size);5353- }5454-#endif /* DEBUG */5555-}5656-5757-static unsigned long __init5858-lmb_addrs_overlap(unsigned long base1, unsigned long size1,5959- unsigned long base2, unsigned long size2)6060-{6161- return ((base1 < (base2+size2)) && (base2 < (base1+size1)));6262-}6363-6464-static long __init6565-lmb_addrs_adjacent(unsigned long base1, unsigned long size1,6666- unsigned long base2, unsigned long size2)6767-{6868- if (base2 == base1 + size1)6969- return 1;7070- else if (base1 == base2 + size2)7171- return -1;7272-7373- return 0;7474-}7575-7676-static long __init7777-lmb_regions_adjacent(struct lmb_region *rgn, unsigned long r1, unsigned long r2)7878-{7979- unsigned long base1 = rgn->region[r1].base;8080- unsigned long size1 = rgn->region[r1].size;8181- unsigned long base2 = rgn->region[r2].base;8282- unsigned long size2 = rgn->region[r2].size;8383-8484- return lmb_addrs_adjacent(base1, size1, base2, size2);8585-}8686-8787-/* Assumption: base addr of region 1 < base addr of region 2 */8888-static void __init8989-lmb_coalesce_regions(struct lmb_region *rgn, unsigned long r1, unsigned long r2)9090-{9191- unsigned long i;9292-9393- rgn->region[r1].size += rgn->region[r2].size;9494- for (i=r2; i < rgn->cnt-1; i++) {9595- rgn->region[i].base = rgn->region[i+1].base;9696- rgn->region[i].size = rgn->region[i+1].size;9797- }9898- rgn->cnt--;9999-}100100-101101-/* This routine called with relocation disabled. */102102-void __init103103-lmb_init(void)104104-{105105- /* Create a dummy zero size LMB which will get coalesced away later.106106- * This simplifies the lmb_add() code below...107107- */108108- lmb.memory.region[0].base = 0;109109- lmb.memory.region[0].size = 0;110110- lmb.memory.cnt = 1;111111-112112- /* Ditto. */113113- lmb.reserved.region[0].base = 0;114114- lmb.reserved.region[0].size = 0;115115- lmb.reserved.cnt = 1;116116-}117117-118118-/* This routine called with relocation disabled. */119119-void __init120120-lmb_analyze(void)121121-{122122- int i;123123-124124- lmb.memory.size = 0;125125-126126- for (i = 0; i < lmb.memory.cnt; i++)127127- lmb.memory.size += lmb.memory.region[i].size;128128-}129129-130130-/* This routine called with relocation disabled. */131131-static long __init132132-lmb_add_region(struct lmb_region *rgn, unsigned long base, unsigned long size)133133-{134134- unsigned long i, coalesced = 0;135135- long adjacent;136136-137137- /* First try and coalesce this LMB with another. */138138- for (i=0; i < rgn->cnt; i++) {139139- unsigned long rgnbase = rgn->region[i].base;140140- unsigned long rgnsize = rgn->region[i].size;141141-142142- adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);143143- if ( adjacent > 0 ) {144144- rgn->region[i].base -= size;145145- rgn->region[i].size += size;146146- coalesced++;147147- break;148148- }149149- else if ( adjacent < 0 ) {150150- rgn->region[i].size += size;151151- coalesced++;152152- break;153153- }154154- }155155-156156- if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {157157- lmb_coalesce_regions(rgn, i, i+1);158158- coalesced++;159159- }160160-161161- if ( coalesced ) {162162- return coalesced;163163- } else if ( rgn->cnt >= MAX_LMB_REGIONS ) {164164- return -1;165165- }166166-167167- /* Couldn't coalesce the LMB, so add it to the sorted table. */168168- for (i=rgn->cnt-1; i >= 0; i--) {169169- if (base < rgn->region[i].base) {170170- rgn->region[i+1].base = rgn->region[i].base;171171- rgn->region[i+1].size = rgn->region[i].size;172172- } else {173173- rgn->region[i+1].base = base;174174- rgn->region[i+1].size = size;175175- break;176176- }177177- }178178- rgn->cnt++;179179-180180- return 0;181181-}182182-183183-/* This routine called with relocation disabled. */184184-long __init185185-lmb_add(unsigned long base, unsigned long size)186186-{187187- struct lmb_region *_rgn = &(lmb.memory);188188-189189- /* On pSeries LPAR systems, the first LMB is our RMO region. */190190- if ( base == 0 )191191- lmb.rmo_size = size;192192-193193- return lmb_add_region(_rgn, base, size);194194-195195-}196196-197197-long __init198198-lmb_reserve(unsigned long base, unsigned long size)199199-{200200- struct lmb_region *_rgn = &(lmb.reserved);201201-202202- return lmb_add_region(_rgn, base, size);203203-}204204-205205-long __init206206-lmb_overlaps_region(struct lmb_region *rgn, unsigned long base, unsigned long size)207207-{208208- unsigned long i;209209-210210- for (i=0; i < rgn->cnt; i++) {211211- unsigned long rgnbase = rgn->region[i].base;212212- unsigned long rgnsize = rgn->region[i].size;213213- if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {214214- break;215215- }216216- }217217-218218- return (i < rgn->cnt) ? i : -1;219219-}220220-221221-unsigned long __init222222-lmb_alloc(unsigned long size, unsigned long align)223223-{224224- return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);225225-}226226-227227-unsigned long __init228228-lmb_alloc_base(unsigned long size, unsigned long align, unsigned long max_addr)229229-{230230- long i, j;231231- unsigned long base = 0;232232-233233- for (i=lmb.memory.cnt-1; i >= 0; i--) {234234- unsigned long lmbbase = lmb.memory.region[i].base;235235- unsigned long lmbsize = lmb.memory.region[i].size;236236-237237- if ( max_addr == LMB_ALLOC_ANYWHERE )238238- base = _ALIGN_DOWN(lmbbase+lmbsize-size, align);239239- else if ( lmbbase < max_addr )240240- base = _ALIGN_DOWN(min(lmbbase+lmbsize,max_addr)-size, align);241241- else242242- continue;243243-244244- while ( (lmbbase <= base) &&245245- ((j = lmb_overlaps_region(&lmb.reserved,base,size)) >= 0) ) {246246- base = _ALIGN_DOWN(lmb.reserved.region[j].base-size, align);247247- }248248-249249- if ( (base != 0) && (lmbbase <= base) )250250- break;251251- }252252-253253- if ( i < 0 )254254- return 0;255255-256256- lmb_add_region(&lmb.reserved, base, size);257257-258258- return base;259259-}260260-261261-/* You must call lmb_analyze() before this. */262262-unsigned long __init263263-lmb_phys_mem_size(void)264264-{265265- return lmb.memory.size;266266-}267267-268268-unsigned long __init269269-lmb_end_of_DRAM(void)270270-{271271- int idx = lmb.memory.cnt - 1;272272-273273- return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);274274-}275275-276276-/*277277- * Truncate the lmb list to memory_limit if it's set278278- * You must call lmb_analyze() after this.279279- */280280-void __init lmb_enforce_memory_limit(void)281281-{282282- extern unsigned long memory_limit;283283- unsigned long i, limit;284284-285285- if (! memory_limit)286286- return;287287-288288- limit = memory_limit;289289- for (i = 0; i < lmb.memory.cnt; i++) {290290- if (limit > lmb.memory.region[i].size) {291291- limit -= lmb.memory.region[i].size;292292- continue;293293- }294294-295295- lmb.memory.region[i].size = limit;296296- lmb.memory.cnt = i + 1;297297- break;298298- }299299-}
+3-2
arch/ppc64/kernel/prom.c
···7878extern struct rtas_t rtas;7979extern struct lmb lmb;8080extern unsigned long klimit;8181+extern unsigned long memory_limit;81828283static int __initdata dt_root_addr_cells;8384static int __initdata dt_root_size_cells;···10641063{10651064 u32 *prop;10661065 u64 *prop64;10671067- extern unsigned long memory_limit, tce_alloc_start, tce_alloc_end;10661066+ extern unsigned long tce_alloc_start, tce_alloc_end;1068106710691068 DBG("search \"chosen\", depth: %d, uname: %s\n", depth, uname);10701069···12381237 lmb_init();12391238 scan_flat_dt(early_init_dt_scan_root, NULL);12401239 scan_flat_dt(early_init_dt_scan_memory, NULL);12411241- lmb_enforce_memory_limit();12401240+ lmb_enforce_memory_limit(memory_limit);12421241 lmb_analyze();12431242 systemcfg->physicalMemorySize = lmb_phys_mem_size();12441243 lmb_reserve(0, __pa(klimit));
-81
include/asm-ppc64/lmb.h
···11-#ifndef _PPC64_LMB_H22-#define _PPC64_LMB_H33-44-/*55- * Definitions for talking to the Open Firmware PROM on66- * Power Macintosh computers.77- *88- * Copyright (C) 2001 Peter Bergner, IBM Corp.99- *1010- * This program is free software; you can redistribute it and/or1111- * modify it under the terms of the GNU General Public License1212- * as published by the Free Software Foundation; either version1313- * 2 of the License, or (at your option) any later version.1414- */1515-1616-#include <linux/init.h>1717-#include <asm/prom.h>1818-1919-#define MAX_LMB_REGIONS 1282020-2121-#define LMB_ALLOC_ANYWHERE 02222-2323-struct lmb_property {2424- unsigned long base;2525- unsigned long size;2626-};2727-2828-struct lmb_region {2929- unsigned long cnt;3030- unsigned long size;3131- struct lmb_property region[MAX_LMB_REGIONS+1];3232-};3333-3434-struct lmb {3535- unsigned long debug;3636- unsigned long rmo_size;3737- struct lmb_region memory;3838- struct lmb_region reserved;3939-};4040-4141-extern struct lmb lmb;4242-4343-extern void __init lmb_init(void);4444-extern void __init lmb_analyze(void);4545-extern long __init lmb_add(unsigned long, unsigned long);4646-extern long __init lmb_reserve(unsigned long, unsigned long);4747-extern unsigned long __init lmb_alloc(unsigned long, unsigned long);4848-extern unsigned long __init lmb_alloc_base(unsigned long, unsigned long,4949- unsigned long);5050-extern unsigned long __init lmb_phys_mem_size(void);5151-extern unsigned long __init lmb_end_of_DRAM(void);5252-extern unsigned long __init lmb_abs_to_phys(unsigned long);5353-extern void __init lmb_enforce_memory_limit(void);5454-5555-extern void lmb_dump_all(void);5656-5757-extern unsigned long io_hole_start;5858-5959-static inline unsigned long6060-lmb_size_bytes(struct lmb_region *type, unsigned long region_nr)6161-{6262- return type->region[region_nr].size;6363-}6464-static inline unsigned long6565-lmb_size_pages(struct lmb_region *type, unsigned long region_nr)6666-{6767- return lmb_size_bytes(type, region_nr) >> PAGE_SHIFT;6868-}6969-static inline unsigned long7070-lmb_start_pfn(struct lmb_region *type, unsigned long region_nr)7171-{7272- return type->region[region_nr].base >> PAGE_SHIFT;7373-}7474-static inline unsigned long7575-lmb_end_pfn(struct lmb_region *type, unsigned long region_nr)7676-{7777- return lmb_start_pfn(type, region_nr) +7878- lmb_size_pages(type, region_nr);7979-}8080-8181-#endif /* _PPC64_LMB_H */