i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

find_nearest() now saves a solution when reaching the max number of solutions and not near enough

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@25859 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Jérôme Duval
2008-06-08 01:11:29 +00:00
parent cfbfa8bade
commit f7c655c7e0
1 changed files with 12 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/system/kernel/arch/x86/arch_vm.cpp
+12 -5
View File
@@ -223,11 +223,18 @@ static int64 sPropositions[MTRR_MAX_SOLUTIONS];
static void static void
find_nearest(uint64 value, int iteration) find_nearest(uint64 value, int iteration)
{ {
TRACE_MTRR("find_nearest %Lx %d\n", value, iteration);
if (iteration > (MTRR_MAX_SOLUTIONS - 1) || (iteration + 1) >= sSolutionCount)
return;
uint64 down, up;
int i; int i;
uint64 down, up;
TRACE_MTRR("find_nearest %Lx %d\n", value, iteration);
if (iteration > (MTRR_MAX_SOLUTIONS - 1) || (iteration + 1) >= sSolutionCount) {
if (sSolutionCount > MTRR_MAX_SOLUTIONS) {
// no solutions yet, save something
for (i=0; i<iteration; i++)
sSolutions[i] = sPropositions[i];
sSolutionCount = iteration;
}
return;
}
nearest_powers(value, &down, &up); nearest_powers(value, &down, &up);
sPropositions[iteration] = down; sPropositions[iteration] = down;
if (value - down < MTRR_MIN_SIZE) { if (value - down < MTRR_MIN_SIZE) {
@@ -254,7 +261,7 @@ set_memory_write_back(int32 id, uint64 base, uint64 length)
{ {
status_t err; status_t err;
TRACE_MTRR("set_memory_write_back base %Lx length %Lx\n", base, length); TRACE_MTRR("set_memory_write_back base %Lx length %Lx\n", base, length);
sSolutionCount = MTRR_MAX_SOLUTIONS; sSolutionCount = MTRR_MAX_SOLUTIONS + 1;
find_nearest(length, 0); find_nearest(length, 0);
#ifdef TRACE_MTRR #ifdef TRACE_MTRR