Aren/haiku
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added get_free_address_range() to get a free range in a given range array.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@35801 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold 2010-03-10 18:36:44 +00:00
parent c7e6a67024
commit 73a72c42e2
2 changed files with 36 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
headers/private/kernel/boot/addr_range.h
View File

@ -23,6 +23,8 @@ status_t insert_address_range(addr_range *ranges, uint32 *_numRanges, uint32 max
addr_t start, uint32 size);
status_t remove_addr_range(addr_range *ranges, uint32 *_numRanges, uint32 maxRanges,
addr_t start, uint32 size);
bool get_free_address_range(addr_range *ranges, uint32 numRanges, addr_t base,
size_t size, addr_t *_rangeBase);
status_t insert_physical_memory_range(addr_t start, uint32 size);
status_t insert_physical_allocated_range(addr_t start, uint32 size);

34
src/system/boot/loader/kernel_args.cpp
View File

@ -180,6 +180,40 @@ remove_address_range(addr_range* ranges, uint32* _numRanges, uint32 maxRanges,
}
bool
get_free_address_range(addr_range *ranges, uint32 numRanges, addr_t base,
size_t size, addr_t *_rangeBase)
{
addr_t end = base + size - 1;
if (end < base)
return false;
// Note: We don't assume that the ranges are sorted, so we can't do this
// in a simple loop. Instead we restart the loop whenever our range
// intersects with an existing one.
for (uint32 i = 0; i < numRanges;) {
addr_t rangeStart = ranges[i].start;
addr_t rangeEnd = ranges[i].start + ranges[i].size - 1;
if (base <= rangeEnd && rangeStart <= end) {
base = rangeEnd + 1;
end = rangeEnd + size;
if (base == 0 || end < base)
return false;
i = 0;
continue;
}
i++;
}
*_rangeBase = base;
return true;
}
status_t
insert_physical_memory_range(addr_t start, uint32 size)
{