noselasd/libucore
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Delete the silly bitvec _s functions

Browse Source
This commit is contained in:
Nils O. Selåsdal
2013-10-14 19:01:56 +02:00
parent 6058be1c07
commit 41bb24bb61
2 changed files with 0 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/bitvec.c
-35
View File
@@ -48,7 +48,6 @@ void uc_bv_free(struct UCBitVec *v)
}
}
void uc_bv_clr_bit(struct UCBitVec *v,int b)
{
v->vec[bit_index(b)] &= ~(1UL << (bit_offset(b)));
@@ -64,40 +63,6 @@ void uc_bv_set_bit(struct UCBitVec *v,int b)
v->vec[bit_index(b)] |= 1UL << (bit_offset(b));
}
void uc_bv_set_bit_s(struct UCBitVec *v,int b)
{
size_t idx = (size_t)bit_index(b);
assert(b >= 0);
assert(v->vec_len > (size_t)idx);
if (likely(idx < v->vec_len))
v->vec[idx] |= 1UL << (bit_offset(b));
}
void uc_bv_clear_bit_s(struct UCBitVec *v,int b)
{
size_t idx = (size_t)bit_index(b);
assert(b >= 0);
assert(v->vec_len > (size_t)idx);
if (likely(idx < v->vec_len))
v->vec[idx] &= ~(1UL << (bit_offset(b)));
}
int uc_bv_get_bit_s(const struct UCBitVec *v,int b)
{
size_t idx = (size_t)bit_index(b);
assert(b >= 0);
assert(v->vec_len > (size_t)idx);
if (likely(idx < v->vec_len))
return !!(v->vec[idx] & (1UL << bit_offset(b)));
else
return 0;
}
void uc_bv_set_bits_from_array(struct UCBitVec *v,char *array,size_t array_len)
{
size_t i;