2 * Copyright (C) 2012 Michael Brown <mbrown@fensystems.co.uk>.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation; either version 2 of the
7 * License, or (at your option) any later version.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
19 * You can also choose to distribute this program under the terms of
20 * the Unmodified Binary Distribution Licence (as given in the file
21 * COPYING.UBDL), provided that you have satisfied its requirements.
24 FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
28 * Largest memory block
33 #include <ipxe/uaccess.h>
35 #include <ipxe/memblock.h>
38 * Find largest usable memory region
40 * @ret start Start of region
41 * @ret len Length of region
43 size_t largest_memblock ( userptr_t *start ) {
44 struct memory_map memmap;
45 struct memory_region *region;
46 physaddr_t max = ~( ( physaddr_t ) 0 );
47 physaddr_t region_start;
48 physaddr_t region_end;
53 /* Avoid returning uninitialised data on error */
56 /* Scan through all memory regions */
57 get_memmap ( &memmap );
58 for ( i = 0 ; i < memmap.count ; i++ ) {
59 region = &memmap.regions[i];
60 DBG ( "Considering [%llx,%llx)\n", region->start, region->end );
62 /* Truncate block to maximum physical address */
63 if ( region->start > max ) {
64 DBG ( "...starts after maximum address %lx\n", max );
67 region_start = region->start;
68 if ( region->end > max ) {
69 DBG ( "...end truncated to maximum address %lx\n", max);
70 region_end = 0; /* =max, given the wraparound */
72 region_end = region->end;
74 region_len = ( region_end - region_start );
76 /* Use largest block */
77 if ( region_len > len ) {
78 DBG ( "...new best block found\n" );
79 *start = phys_to_user ( region_start );