blob: 764bf23c7103ff2de7ffcecff581910df8ae517e [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Handle the memory map.
3 * The functions here do the job until bootmem takes over.
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -07004 *
5 * Getting sanitize_e820_map() in sync with i386 version by applying change:
6 * - Provisions for empty E820 memory regions (reported by certain BIOSes).
7 * Alex Achenbach <xela@slit.de>, December 2002.
8 * Venkatesh Pallipadi <venkatesh.pallipadi@intel.com>
9 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070010 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070011#include <linux/kernel.h>
12#include <linux/types.h>
13#include <linux/init.h>
14#include <linux/bootmem.h>
15#include <linux/ioport.h>
16#include <linux/string.h>
Eric W. Biederman5f5609d2005-06-25 14:58:04 -070017#include <linux/kexec.h>
Andrew Mortonb9491ac2005-09-16 19:27:54 -070018#include <linux/module.h>
19
Andrew Morton1a91023a2006-07-10 04:43:49 -070020#include <asm/pgtable.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <asm/page.h>
22#include <asm/e820.h>
23#include <asm/proto.h>
24#include <asm/bootsetup.h>
Andi Kleen2bc04142005-11-05 17:25:53 +010025#include <asm/sections.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070026
27/*
28 * PFN of last memory page.
29 */
30unsigned long end_pfn;
Andi Kleenf3591ff2005-09-13 11:35:28 +020031EXPORT_SYMBOL(end_pfn);
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
33/*
34 * end_pfn only includes RAM, while end_pfn_map includes all e820 entries.
35 * The direct mapping extends to end_pfn_map, so that we can directly access
36 * apertures, ACPI and other tables without having to play with fixmaps.
37 */
38unsigned long end_pfn_map;
39
40/*
41 * Last pfn which the user wants to use.
42 */
43unsigned long end_user_pfn = MAXMEM>>PAGE_SHIFT;
44
45extern struct resource code_resource, data_resource;
46
47/* Check for some hardcoded bad areas that early boot is not allowed to touch */
48static inline int bad_addr(unsigned long *addrp, unsigned long size)
49{
50 unsigned long addr = *addrp, last = addr + size;
51
52 /* various gunk below that needed for SMP startup */
53 if (addr < 0x8000) {
54 *addrp = 0x8000;
55 return 1;
56 }
57
58 /* direct mapping tables of the kernel */
59 if (last >= table_start<<PAGE_SHIFT && addr < table_end<<PAGE_SHIFT) {
60 *addrp = table_end << PAGE_SHIFT;
61 return 1;
62 }
63
64 /* initrd */
65#ifdef CONFIG_BLK_DEV_INITRD
66 if (LOADER_TYPE && INITRD_START && last >= INITRD_START &&
67 addr < INITRD_START+INITRD_SIZE) {
68 *addrp = INITRD_START + INITRD_SIZE;
69 return 1;
70 }
71#endif
72 /* kernel code + 640k memory hole (later should not be needed, but
73 be paranoid for now) */
Andi Kleenceee8822006-08-30 19:37:12 +020074 if (last >= 640*1024 && addr < 1024*1024) {
75 *addrp = 1024*1024;
76 return 1;
77 }
78 if (last >= __pa_symbol(&_text) && last < __pa_symbol(&_end)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070079 *addrp = __pa_symbol(&_end);
80 return 1;
81 }
Andi Kleenac71d122006-05-08 15:17:28 +020082
83 if (last >= ebda_addr && addr < ebda_addr + ebda_size) {
84 *addrp = ebda_addr + ebda_size;
85 return 1;
86 }
87
Linus Torvalds1da177e2005-04-16 15:20:36 -070088 /* XXX ramdisk image here? */
89 return 0;
90}
91
Arjan van de Ven95222362006-04-07 19:49:27 +020092/*
93 * This function checks if any part of the range <start,end> is mapped
94 * with type.
95 */
Arjan van de Veneee5a9f2006-04-07 19:49:24 +020096int __meminit
97e820_any_mapped(unsigned long start, unsigned long end, unsigned type)
Linus Torvalds1da177e2005-04-16 15:20:36 -070098{
99 int i;
100 for (i = 0; i < e820.nr_map; i++) {
101 struct e820entry *ei = &e820.map[i];
102 if (type && ei->type != type)
103 continue;
Eric W. Biederman48c8b112005-09-06 15:16:20 -0700104 if (ei->addr >= end || ei->addr + ei->size <= start)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105 continue;
106 return 1;
107 }
108 return 0;
109}
110
111/*
112 * Find a free area in a specific range.
113 */
114unsigned long __init find_e820_area(unsigned long start, unsigned long end, unsigned size)
115{
116 int i;
117 for (i = 0; i < e820.nr_map; i++) {
118 struct e820entry *ei = &e820.map[i];
119 unsigned long addr = ei->addr, last;
120 if (ei->type != E820_RAM)
121 continue;
122 if (addr < start)
123 addr = start;
124 if (addr > ei->addr + ei->size)
125 continue;
Robert Hentosh7ca97c62006-05-30 22:48:00 +0200126 while (bad_addr(&addr, size) && addr+size <= ei->addr+ei->size)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127 ;
128 last = addr + size;
129 if (last > ei->addr + ei->size)
130 continue;
131 if (last > end)
132 continue;
133 return addr;
134 }
135 return -1UL;
136}
137
138/*
139 * Free bootmem based on the e820 table for a node.
140 */
141void __init e820_bootmem_free(pg_data_t *pgdat, unsigned long start,unsigned long end)
142{
143 int i;
144 for (i = 0; i < e820.nr_map; i++) {
145 struct e820entry *ei = &e820.map[i];
146 unsigned long last, addr;
147
148 if (ei->type != E820_RAM ||
149 ei->addr+ei->size <= start ||
Andi Kleen7c7a3892005-09-12 18:49:24 +0200150 ei->addr >= end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151 continue;
152
153 addr = round_up(ei->addr, PAGE_SIZE);
154 if (addr < start)
155 addr = start;
156
157 last = round_down(ei->addr + ei->size, PAGE_SIZE);
158 if (last >= end)
159 last = end;
160
161 if (last > addr && last-addr >= PAGE_SIZE)
162 free_bootmem_node(pgdat, addr, last-addr);
163 }
164}
165
166/*
167 * Find the highest page frame number we have available
168 */
169unsigned long __init e820_end_of_ram(void)
170{
171 int i;
172 unsigned long end_pfn = 0;
173
174 for (i = 0; i < e820.nr_map; i++) {
175 struct e820entry *ei = &e820.map[i];
176 unsigned long start, end;
177
178 start = round_up(ei->addr, PAGE_SIZE);
179 end = round_down(ei->addr + ei->size, PAGE_SIZE);
180 if (start >= end)
181 continue;
182 if (ei->type == E820_RAM) {
183 if (end > end_pfn<<PAGE_SHIFT)
184 end_pfn = end>>PAGE_SHIFT;
185 } else {
186 if (end > end_pfn_map<<PAGE_SHIFT)
187 end_pfn_map = end>>PAGE_SHIFT;
188 }
189 }
190
191 if (end_pfn > end_pfn_map)
192 end_pfn_map = end_pfn;
193 if (end_pfn_map > MAXMEM>>PAGE_SHIFT)
194 end_pfn_map = MAXMEM>>PAGE_SHIFT;
195 if (end_pfn > end_user_pfn)
196 end_pfn = end_user_pfn;
197 if (end_pfn > end_pfn_map)
198 end_pfn = end_pfn_map;
199
200 return end_pfn;
201}
202
203/*
Andi Kleen485761b2005-08-26 18:34:10 -0700204 * Compute how much memory is missing in a range.
205 * Unlike the other functions in this file the arguments are in page numbers.
206 */
207unsigned long __init
208e820_hole_size(unsigned long start_pfn, unsigned long end_pfn)
209{
210 unsigned long ram = 0;
211 unsigned long start = start_pfn << PAGE_SHIFT;
212 unsigned long end = end_pfn << PAGE_SHIFT;
213 int i;
214 for (i = 0; i < e820.nr_map; i++) {
215 struct e820entry *ei = &e820.map[i];
216 unsigned long last, addr;
217
218 if (ei->type != E820_RAM ||
219 ei->addr+ei->size <= start ||
220 ei->addr >= end)
221 continue;
222
223 addr = round_up(ei->addr, PAGE_SIZE);
224 if (addr < start)
225 addr = start;
226
227 last = round_down(ei->addr + ei->size, PAGE_SIZE);
228 if (last >= end)
229 last = end;
230
231 if (last > addr)
232 ram += last - addr;
233 }
234 return ((end - start) - ram) >> PAGE_SHIFT;
235}
236
237/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238 * Mark e820 reserved areas as busy for the resource manager.
239 */
240void __init e820_reserve_resources(void)
241{
242 int i;
243 for (i = 0; i < e820.nr_map; i++) {
244 struct resource *res;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 res = alloc_bootmem_low(sizeof(struct resource));
246 switch (e820.map[i].type) {
247 case E820_RAM: res->name = "System RAM"; break;
248 case E820_ACPI: res->name = "ACPI Tables"; break;
249 case E820_NVS: res->name = "ACPI Non-volatile Storage"; break;
250 default: res->name = "reserved";
251 }
252 res->start = e820.map[i].addr;
253 res->end = res->start + e820.map[i].size - 1;
254 res->flags = IORESOURCE_MEM | IORESOURCE_BUSY;
255 request_resource(&iomem_resource, res);
256 if (e820.map[i].type == E820_RAM) {
257 /*
258 * We don't know which RAM region contains kernel data,
259 * so we try it repeatedly and let the resource manager
260 * test it.
261 */
262 request_resource(res, &code_resource);
263 request_resource(res, &data_resource);
Eric W. Biederman5f5609d2005-06-25 14:58:04 -0700264#ifdef CONFIG_KEXEC
265 request_resource(res, &crashk_res);
266#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267 }
268 }
269}
270
271/*
272 * Add a memory region to the kernel e820 map.
273 */
274void __init add_memory_region(unsigned long start, unsigned long size, int type)
275{
276 int x = e820.nr_map;
277
278 if (x == E820MAX) {
279 printk(KERN_ERR "Ooops! Too many entries in the memory map!\n");
280 return;
281 }
282
283 e820.map[x].addr = start;
284 e820.map[x].size = size;
285 e820.map[x].type = type;
286 e820.nr_map++;
287}
288
289void __init e820_print_map(char *who)
290{
291 int i;
292
293 for (i = 0; i < e820.nr_map; i++) {
294 printk(" %s: %016Lx - %016Lx ", who,
295 (unsigned long long) e820.map[i].addr,
296 (unsigned long long) (e820.map[i].addr + e820.map[i].size));
297 switch (e820.map[i].type) {
298 case E820_RAM: printk("(usable)\n");
299 break;
300 case E820_RESERVED:
301 printk("(reserved)\n");
302 break;
303 case E820_ACPI:
304 printk("(ACPI data)\n");
305 break;
306 case E820_NVS:
307 printk("(ACPI NVS)\n");
308 break;
309 default: printk("type %u\n", e820.map[i].type);
310 break;
311 }
312 }
313}
314
315/*
316 * Sanitize the BIOS e820 map.
317 *
318 * Some e820 responses include overlapping entries. The following
319 * replaces the original e820 map with a new one, removing overlaps.
320 *
321 */
322static int __init sanitize_e820_map(struct e820entry * biosmap, char * pnr_map)
323{
324 struct change_member {
325 struct e820entry *pbios; /* pointer to original bios entry */
326 unsigned long long addr; /* address for this change point */
327 };
328 static struct change_member change_point_list[2*E820MAX] __initdata;
329 static struct change_member *change_point[2*E820MAX] __initdata;
330 static struct e820entry *overlap_list[E820MAX] __initdata;
331 static struct e820entry new_bios[E820MAX] __initdata;
332 struct change_member *change_tmp;
333 unsigned long current_type, last_type;
334 unsigned long long last_addr;
335 int chgidx, still_changing;
336 int overlap_entries;
337 int new_bios_entry;
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700338 int old_nr, new_nr, chg_nr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700339 int i;
340
341 /*
342 Visually we're performing the following (1,2,3,4 = memory types)...
343
344 Sample memory map (w/overlaps):
345 ____22__________________
346 ______________________4_
347 ____1111________________
348 _44_____________________
349 11111111________________
350 ____________________33__
351 ___________44___________
352 __________33333_________
353 ______________22________
354 ___________________2222_
355 _________111111111______
356 _____________________11_
357 _________________4______
358
359 Sanitized equivalent (no overlap):
360 1_______________________
361 _44_____________________
362 ___1____________________
363 ____22__________________
364 ______11________________
365 _________1______________
366 __________3_____________
367 ___________44___________
368 _____________33_________
369 _______________2________
370 ________________1_______
371 _________________4______
372 ___________________2____
373 ____________________33__
374 ______________________4_
375 */
376
377 /* if there's only one memory region, don't bother */
378 if (*pnr_map < 2)
379 return -1;
380
381 old_nr = *pnr_map;
382
383 /* bail out if we find any unreasonable addresses in bios map */
384 for (i=0; i<old_nr; i++)
385 if (biosmap[i].addr + biosmap[i].size < biosmap[i].addr)
386 return -1;
387
388 /* create pointers for initial change-point information (for sorting) */
389 for (i=0; i < 2*old_nr; i++)
390 change_point[i] = &change_point_list[i];
391
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700392 /* record all known change-points (starting and ending addresses),
393 omitting those that are for empty memory regions */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394 chgidx = 0;
395 for (i=0; i < old_nr; i++) {
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700396 if (biosmap[i].size != 0) {
397 change_point[chgidx]->addr = biosmap[i].addr;
398 change_point[chgidx++]->pbios = &biosmap[i];
399 change_point[chgidx]->addr = biosmap[i].addr + biosmap[i].size;
400 change_point[chgidx++]->pbios = &biosmap[i];
401 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700402 }
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700403 chg_nr = chgidx;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700404
405 /* sort change-point list by memory addresses (low -> high) */
406 still_changing = 1;
407 while (still_changing) {
408 still_changing = 0;
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700409 for (i=1; i < chg_nr; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410 /* if <current_addr> > <last_addr>, swap */
411 /* or, if current=<start_addr> & last=<end_addr>, swap */
412 if ((change_point[i]->addr < change_point[i-1]->addr) ||
413 ((change_point[i]->addr == change_point[i-1]->addr) &&
414 (change_point[i]->addr == change_point[i]->pbios->addr) &&
415 (change_point[i-1]->addr != change_point[i-1]->pbios->addr))
416 )
417 {
418 change_tmp = change_point[i];
419 change_point[i] = change_point[i-1];
420 change_point[i-1] = change_tmp;
421 still_changing=1;
422 }
423 }
424 }
425
426 /* create a new bios memory map, removing overlaps */
427 overlap_entries=0; /* number of entries in the overlap table */
428 new_bios_entry=0; /* index for creating new bios map entries */
429 last_type = 0; /* start with undefined memory type */
430 last_addr = 0; /* start with 0 as last starting address */
431 /* loop through change-points, determining affect on the new bios map */
Venkatesh Pallipadi8059b2a2005-05-01 08:58:52 -0700432 for (chgidx=0; chgidx < chg_nr; chgidx++)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700433 {
434 /* keep track of all overlapping bios entries */
435 if (change_point[chgidx]->addr == change_point[chgidx]->pbios->addr)
436 {
437 /* add map entry to overlap list (> 1 entry implies an overlap) */
438 overlap_list[overlap_entries++]=change_point[chgidx]->pbios;
439 }
440 else
441 {
442 /* remove entry from list (order independent, so swap with last) */
443 for (i=0; i<overlap_entries; i++)
444 {
445 if (overlap_list[i] == change_point[chgidx]->pbios)
446 overlap_list[i] = overlap_list[overlap_entries-1];
447 }
448 overlap_entries--;
449 }
450 /* if there are overlapping entries, decide which "type" to use */
451 /* (larger value takes precedence -- 1=usable, 2,3,4,4+=unusable) */
452 current_type = 0;
453 for (i=0; i<overlap_entries; i++)
454 if (overlap_list[i]->type > current_type)
455 current_type = overlap_list[i]->type;
456 /* continue building up new bios map based on this information */
457 if (current_type != last_type) {
458 if (last_type != 0) {
459 new_bios[new_bios_entry].size =
460 change_point[chgidx]->addr - last_addr;
461 /* move forward only if the new size was non-zero */
462 if (new_bios[new_bios_entry].size != 0)
463 if (++new_bios_entry >= E820MAX)
464 break; /* no more space left for new bios entries */
465 }
466 if (current_type != 0) {
467 new_bios[new_bios_entry].addr = change_point[chgidx]->addr;
468 new_bios[new_bios_entry].type = current_type;
469 last_addr=change_point[chgidx]->addr;
470 }
471 last_type = current_type;
472 }
473 }
474 new_nr = new_bios_entry; /* retain count for new bios entries */
475
476 /* copy new bios mapping into original location */
477 memcpy(biosmap, new_bios, new_nr*sizeof(struct e820entry));
478 *pnr_map = new_nr;
479
480 return 0;
481}
482
483/*
484 * Copy the BIOS e820 map into a safe place.
485 *
486 * Sanity-check it while we're at it..
487 *
488 * If we're lucky and live on a modern system, the setup code
489 * will have given us a memory map that we can use to properly
490 * set up memory. If we aren't, we'll fake a memory map.
491 *
492 * We check to see that the memory map contains at least 2 elements
493 * before we'll use it, because the detection code in setup.S may
494 * not be perfect and most every PC known to man has two memory
495 * regions: one from 0 to 640k, and one from 1mb up. (The IBM
496 * thinkpad 560x, for example, does not cooperate with the memory
497 * detection code.)
498 */
499static int __init copy_e820_map(struct e820entry * biosmap, int nr_map)
500{
501 /* Only one memory region (or negative)? Ignore it */
502 if (nr_map < 2)
503 return -1;
504
505 do {
506 unsigned long start = biosmap->addr;
507 unsigned long size = biosmap->size;
508 unsigned long end = start + size;
509 unsigned long type = biosmap->type;
510
511 /* Overflow in 64 bits? Ignore the memory map. */
512 if (start > end)
513 return -1;
514
515 /*
516 * Some BIOSes claim RAM in the 640k - 1M region.
517 * Not right. Fix it up.
518 *
519 * This should be removed on Hammer which is supposed to not
520 * have non e820 covered ISA mappings there, but I had some strange
521 * problems so it stays for now. -AK
522 */
523 if (type == E820_RAM) {
524 if (start < 0x100000ULL && end > 0xA0000ULL) {
525 if (start < 0xA0000ULL)
526 add_memory_region(start, 0xA0000ULL-start, type);
527 if (end <= 0x100000ULL)
528 continue;
529 start = 0x100000ULL;
530 size = end - start;
531 }
532 }
533
534 add_memory_region(start, size, type);
535 } while (biosmap++,--nr_map);
536 return 0;
537}
538
539void __init setup_memory_region(void)
540{
541 char *who = "BIOS-e820";
542
543 /*
544 * Try to copy the BIOS-supplied E820-map.
545 *
546 * Otherwise fake a memory map; one section from 0k->640k,
547 * the next section from 1mb->appropriate_mem_k
548 */
549 sanitize_e820_map(E820_MAP, &E820_MAP_NR);
550 if (copy_e820_map(E820_MAP, E820_MAP_NR) < 0) {
551 unsigned long mem_size;
552
553 /* compare results from other methods and take the greater */
554 if (ALT_MEM_K < EXT_MEM_K) {
555 mem_size = EXT_MEM_K;
556 who = "BIOS-88";
557 } else {
558 mem_size = ALT_MEM_K;
559 who = "BIOS-e801";
560 }
561
562 e820.nr_map = 0;
563 add_memory_region(0, LOWMEMSIZE(), E820_RAM);
564 add_memory_region(HIGH_MEMORY, mem_size << 10, E820_RAM);
565 }
566 printk(KERN_INFO "BIOS-provided physical RAM map:\n");
567 e820_print_map(who);
568}
569
570void __init parse_memopt(char *p, char **from)
571{
572 end_user_pfn = memparse(p, from);
573 end_user_pfn >>= PAGE_SHIFT;
574}
575
akpm@osdl.org69cda7b2006-01-09 20:51:46 -0800576void __init parse_memmapopt(char *p, char **from)
577{
578 unsigned long long start_at, mem_size;
579
580 mem_size = memparse(p, from);
581 p = *from;
582 if (*p == '@') {
583 start_at = memparse(p+1, from);
584 add_memory_region(start_at, mem_size, E820_RAM);
585 } else if (*p == '#') {
586 start_at = memparse(p+1, from);
587 add_memory_region(start_at, mem_size, E820_ACPI);
588 } else if (*p == '$') {
589 start_at = memparse(p+1, from);
590 add_memory_region(start_at, mem_size, E820_RESERVED);
591 } else {
592 end_user_pfn = (mem_size >> PAGE_SHIFT);
593 }
594 p = *from;
595}
596
Andi Kleena1e97782005-04-16 15:25:12 -0700597unsigned long pci_mem_start = 0xaeedbabe;
Andi Kleen2ee60e172006-06-26 13:59:44 +0200598EXPORT_SYMBOL(pci_mem_start);
Andi Kleena1e97782005-04-16 15:25:12 -0700599
600/*
601 * Search for the biggest gap in the low 32 bits of the e820
602 * memory space. We pass this space to PCI to assign MMIO resources
603 * for hotplug or unconfigured devices in.
604 * Hopefully the BIOS let enough space left.
605 */
606__init void e820_setup_gap(void)
607{
Daniel Ritzf0eca962005-09-09 00:57:14 +0200608 unsigned long gapstart, gapsize, round;
Andi Kleena1e97782005-04-16 15:25:12 -0700609 unsigned long last;
610 int i;
611 int found = 0;
612
613 last = 0x100000000ull;
614 gapstart = 0x10000000;
615 gapsize = 0x400000;
616 i = e820.nr_map;
617 while (--i >= 0) {
618 unsigned long long start = e820.map[i].addr;
619 unsigned long long end = start + e820.map[i].size;
620
621 /*
622 * Since "last" is at most 4GB, we know we'll
623 * fit in 32 bits if this condition is true
624 */
625 if (last > end) {
626 unsigned long gap = last - end;
627
628 if (gap > gapsize) {
629 gapsize = gap;
630 gapstart = end;
631 found = 1;
632 }
633 }
634 if (start < last)
635 last = start;
636 }
637
638 if (!found) {
639 gapstart = (end_pfn << PAGE_SHIFT) + 1024*1024;
640 printk(KERN_ERR "PCI: Warning: Cannot find a gap in the 32bit address range\n"
641 KERN_ERR "PCI: Unassigned devices with 32bit resource registers may break!\n");
642 }
643
644 /*
Daniel Ritzf0eca962005-09-09 00:57:14 +0200645 * See how much we want to round up: start off with
646 * rounding to the next 1MB area.
Andi Kleena1e97782005-04-16 15:25:12 -0700647 */
Daniel Ritzf0eca962005-09-09 00:57:14 +0200648 round = 0x100000;
649 while ((gapsize >> 4) > round)
650 round += round;
651 /* Fun with two's complement */
652 pci_mem_start = (gapstart + round) & -round;
Andi Kleena1e97782005-04-16 15:25:12 -0700653
654 printk(KERN_INFO "Allocating PCI resources starting at %lx (gap: %lx:%lx)\n",
655 pci_mem_start, gapstart, gapsize);
656}