Searched refs:bv (Results 1 – 3 of 3) sorted by relevance
198 #define HASH_BLOOM_BITSET(bv,idx) (bv[(idx)/8U] |= (1U << ((idx)%8U))) argument199 #define HASH_BLOOM_BITTEST(bv,idx) (bv[(idx)/8U] & (1U << ((idx)%8U))) argument
1280 BYTE bm, bv; in find_bitmap() local1293 bv = fs->win[i] & bm; bm <<= 1; /* Get bit value */ in find_bitmap()1297 if (bv == 0) { /* Is it a free cluster? */ in find_bitmap()1318 int bv /* bit value to be set (0 or 1) */ in change_bitmap() argument1334 if (bv == (int)((fs->win[i] & bm) != 0)) return FR_INT_ERR; /* Is the bit expected value? */ in change_bitmap()
1310 BYTE bm, bv; in find_bitmap() local1323 bv = fs->win[i] & bm; bm <<= 1; /* Get bit value */ in find_bitmap()1327 if (bv == 0) { /* Is it a free cluster? */ in find_bitmap()1348 int bv /* bit value to be set (0 or 1) */ in change_bitmap() argument1364 if (bv == (int)((fs->win[i] & bm) != 0)) return FR_INT_ERR; /* Is the bit expected value? */ in change_bitmap()
Completed in 43 milliseconds