mirror of https://github.com/AxioDL/metaforce.git
Update submodules
This commit is contained in:
parent
a8db552ce2
commit
399cdfc657
|
@ -1 +1 @@
|
|||
Subproject commit 8fce7ce1619ad6cbcc47a7f6747d57eb37184eb2
|
||||
Subproject commit 255f2bf745edd042930d7b0376c5b33e14ed1729
|
|
@ -1 +1 @@
|
|||
Subproject commit c057068e64b2123d426ad84606e8a756af11913f
|
||||
Subproject commit 1177d50eda69fb5be711b5ebfa6ee290500ae342
|
|
@ -187,7 +187,7 @@ public:
|
|||
|
||||
/// find_first_contiguous - Returns the index of the first contiguous
|
||||
/// set of bits of "Length", -1 if no contiguous bits found.
|
||||
int find_first_contiguous(unsigned Length) const {
|
||||
int find_first_contiguous(unsigned Length, unsigned BucketSz) const {
|
||||
for (int idx = find_first(); idx != -1; idx = find_next(idx)) {
|
||||
if (idx + Length > size())
|
||||
return -1;
|
||||
|
@ -201,7 +201,11 @@ public:
|
|||
}
|
||||
}
|
||||
if (good)
|
||||
return idx;
|
||||
{
|
||||
unsigned space = BucketSz - (idx % BucketSz);
|
||||
if (space >= Length)
|
||||
return idx;
|
||||
}
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue