| /redis-3.2.3/src/ |
| H A D | endianconv.h | 42 uint16_t intrev16(uint16_t v); 52 #define intrev16ifbe(v) (v) argument 53 #define intrev32ifbe(v) (v) argument 54 #define intrev64ifbe(v) (v) argument 59 #define intrev16ifbe(v) intrev16(v) argument 60 #define intrev32ifbe(v) intrev32(v) argument 61 #define intrev64ifbe(v) intrev64(v) argument 67 #define htonu64(v) (v) argument 68 #define ntohu64(v) (v) argument 70 #define htonu64(v) intrev64(v) argument [all …]
|
| H A D | util.c | 256 if (v < 0) { in sdigits10() 372 v *= 10; in string2ll() 594 long long v; in test_string2ll() local 649 long v; in test_string2l() local 698 long long v; in test_ll2string() local 701 v = 0; in test_ll2string() 706 v = -1; in test_ll2string() 711 v = 99; in test_ll2string() 716 v = -99; in test_ll2string() 726 v = LLONG_MIN; in test_ll2string() [all …]
|
| H A D | endianconv.c | 89 uint16_t intrev16(uint16_t v) { in intrev16() argument 90 memrev16(&v); in intrev16() 91 return v; in intrev16() 94 uint32_t intrev32(uint32_t v) { in intrev32() argument 95 memrev32(&v); in intrev32() 96 return v; in intrev32() 99 uint64_t intrev64(uint64_t v) { in intrev64() argument 100 memrev64(&v); in intrev64() 101 return v; in intrev64()
|
| H A D | dict.h | 54 } v; member 105 (d)->type->valDestructor((d)->privdata, (entry)->v.val) 109 entry->v.val = (d)->type->valDup((d)->privdata, _val_); \ 111 entry->v.val = (_val_); \ 115 do { entry->v.s64 = _val_; } while(0) 118 do { entry->v.u64 = _val_; } while(0) 121 do { entry->v.d = _val_; } while(0) 141 #define dictGetVal(he) ((he)->v.val) 142 #define dictGetSignedIntegerVal(he) ((he)->v.s64) 143 #define dictGetUnsignedIntegerVal(he) ((he)->v.u64) [all …]
|
| H A D | dict.c | 763 v = ((v >> s) & mask) | ((v << s) & ~mask); in rev() 765 return v; in rev() 868 de = t0->table[v & m0]; in dictScan() 888 de = t0->table[v & m0]; in dictScan() 905 v = (((v | m0) + 1) & ~m0) | (v & m0); in dictScan() 908 } while (v & (m0 ^ m1)); in dictScan() 913 v |= ~m0; in dictScan() 916 v = rev(v); in dictScan() 917 v++; in dictScan() 918 v = rev(v); in dictScan() [all …]
|
| H A D | memtest.c | 169 unsigned long off, w, *l1, *l2, v; in memtest_fill_value() local 175 v = (off & 1) ? v2 : v1; in memtest_fill_value() 178 *l1 = *l2 = ((unsigned long) v) | in memtest_fill_value() 179 (((unsigned long) v) << 16); in memtest_fill_value() 181 *l1 = *l2 = ((unsigned long) v) | in memtest_fill_value() 182 (((unsigned long) v) << 16) | in memtest_fill_value() 183 (((unsigned long) v) << 32) | in memtest_fill_value() 184 (((unsigned long) v) << 48); in memtest_fill_value()
|
| H A D | sha1.c | 47 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); argument 48 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); argument 49 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); argument 50 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); argument 51 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); argument
|
| H A D | util.h | 39 uint32_t digits10(uint64_t v); 40 uint32_t sdigits10(int64_t v);
|
| H A D | lzf_c.c | 49 # define NEXT(v,p) (((v) << 8) | p[2]) argument 70 # define NEXT(v,p) ((v) << 5) ^ p[2]
|
| /redis-3.2.3/deps/lua/src/ |
| H A D | lparser.c | 34 #define luaY_checklimit(fs,v,l,m) if ((v)>(l)) errorlimit(fs,l,m) argument 200 lua_assert(v->k == VLOCAL || v->k == VUPVAL); in indexupvalue() 231 if (v >= 0) { in singlevaraux() 421 expr(ls, v); in yindex() 599 expr(ls, v); in explist1() 914 if (lh->v.u.s.info == v->u.s.info) { /* conflict? */ in check_conflict() 918 if (lh->v.u.s.aux == v->u.s.info) { /* conflict? */ in check_conflict() 967 expdesc v; in cond() local 971 return v.f; in cond() 1228 primaryexp(ls, &v.v); in exprstat() [all …]
|
| H A D | lmem.h | 33 #define luaM_growvector(L,v,nelems,size,t,limit,e) \ argument 35 ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e))) 37 #define luaM_reallocvector(L, v,oldn,n,t) \ argument 38 ((v)=cast(t *, luaM_reallocv(L, v, oldn, n, sizeof(t))))
|
| H A D | lgc.h | 70 #define isdead(g,v) ((v)->gch.marked & otherwhite(g) & WHITEBITS) argument 86 #define luaC_barrier(L,p,v) { if (valiswhite(v) && isblack(obj2gco(p))) \ argument 87 luaC_barrierf(L,obj2gco(p),gcvalue(v)); } 89 #define luaC_barriert(L,t,v) { if (valiswhite(v) && isblack(obj2gco(t))) \ argument 106 LUAI_FUNC void luaC_barrierf (lua_State *L, GCObject *o, GCObject *v);
|
| H A D | lfunc.c | 47 uv->v = &uv->u.value; in luaF_newupval() 48 setnilvalue(uv->v); in luaF_newupval() 58 while (*pp != NULL && (p = ngcotouv(*pp))->v >= level) { in luaF_findupval() 59 lua_assert(p->v != &p->u.value); in luaF_findupval() 60 if (p->v == level) { /* found a corresponding upvalue? */ in luaF_findupval() 70 uv->v = level; /* current value lives in the stack */ in luaF_findupval() 90 if (uv->v != &uv->u.value) /* is it open? */ in luaF_freeupval() 99 while (L->openupval != NULL && (uv = ngcotouv(L->openupval))->v >= level) { in luaF_close() 101 lua_assert(!isblack(o) && uv->v != &uv->u.value); in luaF_close() 107 setobj(L, &uv->u.value, uv->v); in luaF_close() [all …]
|
| H A D | lcode.c | 229 static int addk (FuncState *fs, TValue *k, TValue *v) { in addk() argument 243 setobj(L, &f->k[fs->nk], v); in addk() 244 luaC_barrier(L, f, v); in addk() 272 TValue k, v; in nilK() local 273 setnilvalue(&v); in nilK() 276 return addk(fs, &k, &v); in nilK() 710 void luaK_infix (FuncState *fs, BinOpr op, expdesc *v) { in luaK_infix() argument 713 luaK_goiftrue(fs, v); in luaK_infix() 717 luaK_goiffalse(fs, v); in luaK_infix() 726 if (!isnumeral(v)) luaK_exp2RK(fs, v); in luaK_infix() [all …]
|
| /redis-3.2.3/deps/jemalloc/test/include/test/ |
| H A D | SFMT.h | 85 double to_real1(uint32_t v); 87 double to_real2(uint32_t v); 89 double to_real3(uint32_t v); 91 double to_res53(uint64_t v); 100 JEMALLOC_INLINE double to_real1(uint32_t v) in to_real1() argument 102 return v * (1.0/4294967295.0); in to_real1() 113 JEMALLOC_INLINE double to_real2(uint32_t v) in to_real2() argument 115 return v * (1.0/4294967296.0); in to_real2() 126 JEMALLOC_INLINE double to_real3(uint32_t v) in to_real3() argument 140 JEMALLOC_INLINE double to_res53(uint64_t v) in to_res53() argument [all …]
|
| H A D | SFMT-alti.h | 80 vector unsigned int v, w, x, y, z; in vec_recursion() local 82 v = a; in vec_recursion() 88 v = vec_xor(v, x); in vec_recursion() 90 z = vec_xor(z, v); in vec_recursion()
|
| H A D | SFMT-sse2.h | 65 __m128i v, x, y, z; in mm_recursion() local 70 v = _mm_slli_epi32(d, SL1); in mm_recursion() 72 z = _mm_xor_si128(z, v); in mm_recursion()
|
| /redis-3.2.3/tests/support/ |
| H A D | util.tcl | 166 set v [randomValue] 191 {*}$r set $k $v 193 {*}$r lpush $k $v 195 {*}$r sadd $k $v 197 {*}$r zadd $k $d $v 199 {*}$r hset $k $f $v 212 {{*}$r rpush $k $v} \ 218 randpath {{*}$r sadd $k $v} \ 219 {{*}$r srem $k $v} \ 235 {{*}$r zrem $k $v} \ [all …]
|
| /redis-3.2.3/deps/jemalloc/test/unit/ |
| H A D | ckh.c | 54 } k, v; in TEST_BEGIN() local 59 vp = (i & 2) ? &v.p : NULL; in TEST_BEGIN() 61 v.p = NULL; in TEST_BEGIN() 69 assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu", in TEST_BEGIN() 80 } k, v; in TEST_BEGIN() local 85 vp = (i & 2) ? &v.p : NULL; in TEST_BEGIN() 87 v.p = NULL; in TEST_BEGIN() 95 assert_ptr_eq((void *)vs, (void *)v.s, "Value mismatch, i=%zu", in TEST_BEGIN()
|
| /redis-3.2.3/tests/unit/type/ |
| H A D | hash.tcl | 127 foreach {k v} [array get bighash] { 153 lappend vals $v 167 foreach {k v} [array get bighash] { 169 lappend vals $v 191 lappend vals $v 198 foreach {k v} [array get bighash] { 199 lappend vals $v 430 foreach v $vals { 431 r hmset smallhash field $v 432 r hmset bighash field $v [all …]
|
| /redis-3.2.3/deps/lua/etc/ |
| H A D | strict.lua | 24 mt.__newindex = function (t, n, v) 32 rawset(t, n, v)
|
| /redis-3.2.3/deps/lua/test/ |
| H A D | fib.lua | 30 local v=f(n) 32 print(s,n,v,t,N)
|
| /redis-3.2.3/tests/unit/ |
| H A D | scan.tcl | 120 foreach {k v} $keys { 121 assert {$k eq "key:$v"} 160 foreach {k v} $keys { 161 assert {$k eq "key:$v"}
|
| /redis-3.2.3/deps/jemalloc/src/ |
| H A D | prof.c | 713 void *v; in prof_lookup_global() member 717 void *v; in prof_lookup_global() member 722 if (ckh_search(&bt2gctx, bt, &btkey.v, &gctx.v)) { in prof_lookup_global() 725 if (gctx.v == NULL) { in prof_lookup_global() 730 if (ckh_insert(tsd, &bt2gctx, btkey.v, gctx.v)) { in prof_lookup_global() 749 *p_btkey = btkey.v; in prof_lookup_global() 760 void *v; in prof_lookup() member 813 idalloctm(tsd, ret.v, tcache, true); in prof_lookup() 1239 void *v; in prof_tdata_merge_iter() member 1245 &tctx.v);) in prof_tdata_merge_iter() [all …]
|
| /redis-3.2.3/deps/geohash-int/ |
| H A D | geohash_helper.c | 211 double lat1r, lon1r, lat2r, lon2r, u, v; in geohashGetDistance() local 217 v = sin((lon2r - lon1r) / 2); in geohashGetDistance() 219 asin(sqrt(u * u + cos(lat1r) * cos(lat2r) * v * v)); in geohashGetDistance()
|