Mirror/inav
1
0
Fork 0
mirror of https://github.com/iNavFlight/inav.git synced 2025-07-26 01:35:35 +03:00
Code Issues Wiki Activity

[BITARRAY] Bounds check in the first iteration in bitArrayFindFirstSet() (#5707)

Browse source 
We already had bounds checking for the 2nd and subsequent 32 bit
blocks, but since the first block was handled separately (due to the
masking needed if it doesn't fall on a 32 bit boundary) it skipped
the check. With this change, any start bit >= the number of bits
in the array will return -1.
This commit is contained in:
Alberto García Hierro 2020-05-16 16:38:31 +01:00 • committed by GitHub
parent 3cbf830e04
commit 7f1a7d5a0b
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
2 changed files with 21 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/main/common/bitarray.c
View file

@ -75,6 +75,7 @@ int bitArrayFindFirstSet(const bitarrayElement_t *array, unsigned start, size_t
const uint32_t *end = ptr + (size / 4);
const uint32_t *p = ptr + start / (8 * 4);
int ret;
if (p < end) {
// First iteration might need to mask some bits
uint32_t mask = 0xFFFFFFFF << (start % (8 * 4));
if ((ret = __CTZ(*p & mask)) != 32) {
@ -87,5 +88,6 @@ int bitArrayFindFirstSet(const bitarrayElement_t *array, unsigned start, size_t
}
p++;
}
}
return -1;
}

11
src/test/unit/bitarray_unittest.cc
View file

@ -83,3 +83,14 @@ TEST(BitArrayTest, TestSetClrAll)
EXPECT_EQ(ii, BITARRAY_FIND_FIRST_SET(p, ii));
}
}
TEST(BitArrayTest, TestOutOfBounds)
{
const int bits = 32 * 4;
BITARRAY_DECLARE(p, bits);
BITARRAY_CLR_ALL(p);
EXPECT_EQ(-1, BITARRAY_FIND_FIRST_SET(p, 0));
EXPECT_EQ(-1, BITARRAY_FIND_FIRST_SET(p, bits));
EXPECT_EQ(-1, BITARRAY_FIND_FIRST_SET(p, bits + 1));
}