#include <citrusleaf/cf_atomic.h>
#include <citrusleaf/cf_types.h>
#include <strings.h>
#include <string.h>
#include <inttypes.h>
Go to the source code of this file.
|
#define | cf_bits_find_first_set(__x) ffs(__x) |
|
#define | cf_bits_find_first_set_64(__x) ffsll(__x) |
|
#define | CF_LT(n) n, n, n, n, n, n, n, n, n, n, n, n, n, n, n, n |
|
#define | cf_max(__x, __y) ( (__x) > (__y) ? (__x) : (__y) ) |
|
#define | cf_max_uint32(__x, __y) ( (__x) > (__y) ? (__x) : (__y) ) |
|
#define cf_bits_find_first_set |
( |
|
__x) | |
ffs(__x) |
#define cf_bits_find_first_set_64 |
( |
|
__x) | |
ffsll(__x) |
#define CF_LT |
( |
|
n) | |
n, n, n, n, n, n, n, n, n, n, n, n, n, n, n, n |
#define cf_max |
( |
|
__x, |
|
|
|
__y |
|
) |
| ( (__x) > (__y) ? (__x) : (__y) ) |
#define cf_max_uint32 |
( |
|
__x, |
|
|
|
__y |
|
) |
| ( (__x) > (__y) ? (__x) : (__y) ) |
int cf_bits_find_last_set |
( |
uint32_t |
c) | |
|
int cf_bits_find_last_set_64 |
( |
uint64_t |
c) | |
|
static uint32_t cf_roundup |
( |
uint32_t |
i, |
|
|
uint32_t |
modulus |
|
) |
| |
|
inlinestatic |
static uint64_t cf_roundup_64 |
( |
uint64_t |
i, |
|
|
uint32_t |
modulus |
|
) |
| |
|
inlinestatic |
const char cf_LogTable256[] |
|
static |
Initial value:=
{
#define CF_LT(n)
-1, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3,
}
Definition at line 38 of file src/include/citrusleaf/cf_bits.h.