admin/mlib
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update formula for increasing the size.

Browse Source
This commit is contained in:
Patrick Pelissier committed 2018-07-24 00:24:50 +02:00
1 parent 79158dabbc
commit 4b8779d8d3
1 file changed
+4 -2
Download Patch File Download Diff File Expand all files Collapse all files
m-bitset.h
+4 -2
View File
@@ -46,7 +46,7 @@ typedef struct bitset_it_s {
} bitset_it_t[1]; } bitset_it_t[1];
// bitset grow policy // bitset grow policy
#define BITSETI_INC_ALLOC_SIZE(n) ((n) < 2 ? 4 : (n) * 2) #define BITSETI_INC_ALLOC_SIZE(n) ((n) < 4 ? 4 : (n) * 2)
// Compute the number of allocated limbs needed to handle 'n' bits. // Compute the number of allocated limbs needed to handle 'n' bits.
#define BITSETI_TO_ALLOC(n) (((n) + BITSET_LIMB_BIT - 1) / BITSET_LIMB_BIT) #define BITSETI_TO_ALLOC(n) (((n) + BITSET_LIMB_BIT - 1) / BITSET_LIMB_BIT)
@@ -70,7 +70,8 @@ bitset_init(bitset_t t)
{ {
assert (t != NULL); assert (t != NULL);
assert (M_POWEROF2_P(BITSET_LIMB_BIT)); assert (M_POWEROF2_P(BITSET_LIMB_BIT));
t->size = t->alloc = 0; t->size = 0;
t->alloc = 0;
t->ptr = NULL; t->ptr = NULL;
BITSETI_CONTRACT(t); BITSETI_CONTRACT(t);
} }
@@ -183,6 +184,7 @@ bitset_push_back (bitset_t v, bool x)
return; return;
} }
// Clear allocated memory // Clear allocated memory
// FIXME: Why?
for(size_t a = v->alloc; a < needAlloc; a++) for(size_t a = v->alloc; a < needAlloc; a++)
ptr[a] = 0; ptr[a] = 0;
v->ptr = ptr; v->ptr = ptr;