Home
last modified time | relevance | path

Searched refs:bits (Results 1 – 21 of 21) sorted by relevance

/redis-3.2.3/tests/unit/
H A Dbitfield.tcl3 r del bits
12 r del bits
21 r del bits
26 r get bits
30 r del bits
39 r del bits
47 r del bits
57 r del bits
67 r del bits
77 r del bits
[all …]
H A Dbitops.tcl3 binary scan $s b* bits
4 string length [regsub -all {0} $bits {}]
12 binary scan $a b* bits
13 set b($j) $bits
14 if {[string length $bits] > $maxlen} {
15 set maxlen [string length $bits]
287 test {BITPOS bit=1 returns -1 if string is all 0 bits} {
/redis-3.2.3/deps/jemalloc/src/
H A Drtree.c18 assert(bits > 0 && bits <= (sizeof(uintptr_t) << 3)); in rtree_new()
21 : (bits % RTREE_BITS_PER_LEVEL); in rtree_new()
22 if (bits > bits_in_leaf) { in rtree_new()
23 height = 1 + (bits - bits_in_leaf) / RTREE_BITS_PER_LEVEL; in rtree_new()
24 if ((height-1) * RTREE_BITS_PER_LEVEL + bits_in_leaf != bits) in rtree_new()
38 rtree->levels[0].cumbits = rtree->levels[0].bits; in rtree_new()
42 rtree->levels[i].bits = RTREE_BITS_PER_LEVEL; in rtree_new()
49 rtree->levels[height-1].bits = bits_in_leaf; in rtree_new()
50 rtree->levels[height-1].cumbits = bits; in rtree_new()
69 nchildren = ZU(1) << rtree->levels[level].bits; in rtree_delete_subtree()
[all …]
/redis-3.2.3/deps/jemalloc/test/include/test/
H A Dbtalloc.h2 void *btalloc(size_t size, unsigned bits);
5 void *btalloc_##n(size_t size, unsigned bits);
11 btalloc_##n(size_t size, unsigned bits) \
15 if (bits == 0) \
18 switch (bits & 0x1U) { \
20 p = (btalloc_0(size, bits >> 1)); \
23 p = (btalloc_1(size, bits >> 1)); \
/redis-3.2.3/src/
H A Dbitops.c41 size_t bits = 0; in redisPopcount() local
48 bits += bitsinbyte[*p++]; in redisPopcount()
91 return bits; in redisPopcount()
205 for (j = 0; j < bits; j++) { in setUnsignedBitfield()
225 for (j = 0; j < bits; j++) { in getUnsignedBitfield()
282 uint64_t max = (bits == 64) ? UINT64_MAX : (((uint64_t)1<<bits)-1); in checkUnsignedBitfieldOverflow()
319 int64_t max = (bits == 64) ? INT64_MAX : (((int64_t)1<<(bits-1))-1); in checkSignedBitfieldOverflow()
420 if (usehash) loffset *= bits; in getBitOffsetFromArgument()
462 *bits = llbits; in getBitfieldTypeFromArgument()
974 ops[numops].bits = bits; in bitfieldCommand()
[all …]
H A Dgeo.c85 int decodeGeohash(double bits, double *xy) { in decodeGeohash() argument
86 GeoHashBits hash = { .bits = (uint64_t)bits, .step = GEO_STEP_MAX }; in decodeGeohash()
313 hash.bits++; in scoresOfGeoHashBox()
353 neighbors[i].bits == neighbors[last_processed].bits && in membersOfAllNeighbors()
417 GeoHashFix52Bits bits = geohashAlign52Bits(hash); in geoaddCommand() local
418 robj *score = createObject(OBJ_STRING, sdsfromlonglong(bits)); in geoaddCommand()
706 int idx = (hash.bits >> (52-((i+1)*5))) & 0x1f; in geohashCommand()
H A Dintset.c318 static intset *createSet(int bits, int size) { in createSet() argument
319 uint64_t mask = (1<<bits)-1; in createSet()
324 if (bits > 32) { in createSet()
463 int i, bits = 20; in intsetTest() local
465 is = createSet(bits,size); in intsetTest()
469 for (i = 0; i < num; i++) intsetSearch(is,rand() % ((1<<bits)-1),NULL); in intsetTest()
H A Dsha1.c31 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) argument
/redis-3.2.3/deps/geohash-int/
H A Dgeohash.c133 hash->bits = 0; in geohashEncode()
149 hash->bits = interleave64(lat_offset, long_offset); in geohashEncode()
173 uint64_t hash_sep = deinterleave64(hash.bits); /* hash = [LAT][LONG] */ in geohashDecode()
228 uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL; in geohash_move_x()
229 uint64_t y = hash->bits & 0x5555555555555555ULL; in geohash_move_x()
241 hash->bits = (x | y); in geohash_move_x()
248 uint64_t x = hash->bits & 0xaaaaaaaaaaaaaaaaULL; in geohash_move_y()
249 uint64_t y = hash->bits & 0x5555555555555555ULL; in geohash_move_y()
259 hash->bits = (x | y); in geohash_move_y()
H A Dgeohash_helper.h38 #define GZERO(s) s.bits = s.step = 0;
39 #define GISZERO(s) (!s.bits && !s.step)
40 #define GISNOTZERO(s) (s.bits || s.step)
H A Dgeohash_helper.c85 return a->step != b->step ? a->step - b->step : a->bits - b->bits; in geohashBitsComparator()
204 uint64_t bits = hash.bits; in geohashAlign52Bits() local
205 bits <<= (52 - hash.step * 2); in geohashAlign52Bits()
206 return bits; in geohashAlign52Bits()
H A Dgeohash.h43 #define HASHISZERO(r) (!(r).bits && !(r).step)
67 uint64_t bits; member
/redis-3.2.3/deps/jemalloc/test/src/
H A Dbtalloc.c4 btalloc(size_t size, unsigned bits) in btalloc() argument
7 return (btalloc_0(size, bits)); in btalloc()
/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Drtree.h73 unsigned bits; member
97 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
149 rtree->levels[level].bits) - 1)); in rtree_subkey()
H A Dsize_classes.sh263 * stored in 8 bits of arena_chunk_map_bits_t's bits field.
H A Darena.h111 size_t bits; member
642 return (&arena_bitselm_get(chunk, pageind)->bits); in arena_mapbitsp_get()
H A Djemalloc_internal.h.in190 * Flags bits:
/redis-3.2.3/deps/jemalloc/include/jemalloc/
H A Djemalloc_macros.h.in23 * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
29 * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
/redis-3.2.3/deps/jemalloc/
H A Dconfig.guess641 long bits = sysconf(_SC_KERNEL_BITS);
651 switch (bits)
H A DChangeLog176 cache locality for the frequently accessed bits.
/redis-3.2.3/
H A D00-RELEASENOTES106 [offset 46] AUX FIELD redis-bits = '64'
526 don't be a typo, a step of 26 should be valid with 52 bits per
1298 | BITFIELD: Farest bit set is offset+bits-1. Off by one error fixed.
1400 bits composing a string, can be addressed at random, not aligned