Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 43) sorted by relevance

12

/redis-3.2.3/tests/support/
H A Dutil.tcl150 set k [{*}$r randomkey]
151 if {$k eq {}} {
155 return $k
163 set k [randomKey]
187 set t [{*}$r type $k]
191 {*}$r set $k $v
193 {*}$r lpush $k $v
195 {*}$r sadd $k $v
197 {*}$r zadd $k $d $v
201 {*}$r del $k
[all …]
/redis-3.2.3/utils/
H A Dredis-sha1.rb18 r.keys('*').sort.each{|k|
19 vtype = r.type?(k)
22 sha1 = Digest::SHA1.hexdigest(sha1+k)
23 sha1 = Digest::SHA1.hexdigest(sha1+r.get(k))
25 len = r.llen(k)
27 sha1 = Digest::SHA1.hexdigest(sha1+k)
31 len = r.scard(k)
33 sha1 = Digest::SHA1.hexdigest(sha1+k)
37 len = r.zcard(k)
39 sha1 = Digest::SHA1.hexdigest(sha1+k)
[all …]
/redis-3.2.3/tests/unit/
H A Dscan.tcl11 set k [lindex $res 1]
12 lappend keys {*}$k
29 set k [lindex $res 1]
30 lappend keys {*}$k
47 set k [lindex $res 1]
48 lappend keys {*}$k
122 lappend keys2 $k
162 lappend keys2 $k
181 lappend keys {*}$k
190 foreach k $keys {
[all …]
/redis-3.2.3/tests/unit/type/
H A Dhash.tcl43 if {$smallhash($k) ne [r hget smallhash $k]} {
44 set err "$smallhash($k) != [r hget smallhash $k]"
54 if {$bighash($k) ne [r hget bighash $k]} {
55 set err "$bighash($k) != [r hget bighash $k]"
152 lappend keys $k
168 lappend keys $k
220 unset smallhash($k)
225 unset bighash($k)
396 if {[string length $smallhash($k)] ne [r hstrlen smallhash $k]} {
407 if {[string length $bighash($k)] ne [r hstrlen bighash $k]} {
[all …]
/redis-3.2.3/deps/jemalloc/test/unit/
H A Drb.c248 for (k = 0; k < j; k++) { in TEST_BEGIN()
249 nodes[k].magic = NODE_MAGIC; in TEST_BEGIN()
250 nodes[k].key = bag[k]; in TEST_BEGIN()
254 for (k = 0; k < j; k++) { in TEST_BEGIN()
255 tree_insert(&tree, &nodes[k]); in TEST_BEGIN()
276 tree_next(&tree, &nodes[k]); in TEST_BEGIN()
277 tree_prev(&tree, &nodes[k]); in TEST_BEGIN()
283 for (k = 0; k < j; k++) in TEST_BEGIN()
284 node_remove(&tree, &nodes[k], j - k); in TEST_BEGIN()
287 for (k = j; k > 0; k--) in TEST_BEGIN()
[all …]
H A Dckh.c54 } k, v; in TEST_BEGIN() local
58 kp = (i & 1) ? &k.p : NULL; in TEST_BEGIN()
60 k.p = NULL; in TEST_BEGIN()
80 } k, v; in TEST_BEGIN() local
84 kp = (i & 1) ? &k.p : NULL; in TEST_BEGIN()
86 k.p = NULL; in TEST_BEGIN()
163 size_t k; in TEST_BEGIN() local
167 for (k = 0; k < NITEMS; k++) { in TEST_BEGIN()
168 if (p[k] == q) { in TEST_BEGIN()
169 assert_false(seen[k], in TEST_BEGIN()
[all …]
H A Drtree.c59 unsigned i, j, k; in TEST_BEGIN() local
73 for (k = 0; k < sizeof(keys)/sizeof(uintptr_t); k++) { in TEST_BEGIN()
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true), in TEST_BEGIN()
79 j, k, keys[j], keys[k]); in TEST_BEGIN()
/redis-3.2.3/deps/lua/src/
H A Dlcode.c272 TValue k, v; in nilK() local
305 switch (e->k) { in luaK_dischargevars()
345 switch (e->k) { in discharge2reg()
373 lua_assert(e->k == VVOID || e->k == VJMP); in discharge2reg()
446 switch (e->k) { in luaK_exp2RK()
455 e->k = VK; in luaK_exp2RK()
542 switch (e->k) { in luaK_goiftrue()
566 switch (e->k) { in luaK_goiffalse()
588 switch (e->k) { in codenot()
623 t->k = VINDEXED; in luaK_indexed()
[all …]
H A Dltable.c123 int k; in arrayindex() local
124 lua_number2int(k, n); in arrayindex()
126 return k; in arrayindex()
212 int k = arrayindex(key); in countint() local
213 if (0 < k && k <= MAXASIZE) { /* is `key' an appropriate array index? */ in countint()
474 int k; in luaH_get() local
476 lua_number2int(k, n); in luaH_get()
513 TValue k; in luaH_setnum() local
515 return newkey(L, t, &k); in luaH_setnum()
525 TValue k; in luaH_setstr() local
[all …]
H A Dlparser.c30 #define hasmultret(k) ((k) == VCALL || (k) == VVARARG) argument
128 e->k = k; in init_exp()
200 lua_assert(v->k == VLOCAL || v->k == VUPVAL); in indexupvalue()
201 fs->upvalues[f->nups].k = cast_byte(v->k); in indexupvalue()
467 cc->v.k = VVOID; in closelistfield()
933 check_condition(ls, VLOCAL <= lh->v.k && lh->v.k <= VINDEXED, in assignment()
969 if (v.k == VNIL) v.k = VFALSE; /* `falses' are all equal here */ in cond()
1038 int k; in exp1() local
1040 k = e.k; in exp1()
1042 return k; in exp1()
[all …]
H A Dlparser.h38 expkind k; member
49 lu_byte k; member
H A Dldebug.c394 check(ttisstring(&pt->k[b])); in symbexec()
490 if (ISK(c) && ttisstring(&p->k[INDEXK(c)])) in kname()
491 return svalue(&p->k[INDEXK(c)]); in kname()
511 lua_assert(ttisstring(&p->k[g])); in getobjname()
512 *name = svalue(&p->k[g]); in getobjname()
523 int k = GETARG_C(i); /* key index */ in getobjname() local
524 *name = kname(p, k); in getobjname()
533 int k = GETARG_C(i); /* key index */ in getobjname() local
534 *name = kname(p, k); in getobjname()
H A Dlundump.c104 f->k=luaM_newvector(S->L,n,TValue); in LoadConstants()
106 for (i=0; i<n; i++) setnilvalue(&f->k[i]); in LoadConstants()
109 TValue* o=&f->k[i]; in LoadConstants()
H A Dlua_cjson.c495 double k; in lua_array_length() local
507 (k = lua_tonumber(l, -2))) { in lua_array_length()
509 if (floor(k) == k && k >= 1) { in lua_array_length()
510 if (k > max) in lua_array_length()
511 max = k; in lua_array_length()
H A Dprint.c53 const TValue* o=&f->k[i]; in PrintConstant()
116 printf("\t; %s",svalue(&f->k[bx])); in PrintCode()
/redis-3.2.3/deps/jemalloc/bin/
H A Djeprof.in1201 $sym = $symbols->{$k}->[0] . " " . $symbols->{$k}->[1];
2582 my $k = shift;
3092 $R->{$k} = $A->{$k};
3096 $R->{$k} = $B->{$k};
3111 $R->{$k} = 1
3115 $R->{$k} = 1
3127 my $v = $A->{$k} - GetEntry($B, $k);
3137 AddEntry($R, $k, 0 - $B->{$k});
3147 my $k = shift;
3173 my @k = ();
[all …]
/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Dhash.h76 hash_fmix_64(uint64_t k) in hash_fmix_64() argument
79 k ^= k >> 33; in hash_fmix_64()
80 k *= KQU(0xff51afd7ed558ccd); in hash_fmix_64()
81 k ^= k >> 33; in hash_fmix_64()
82 k *= KQU(0xc4ceb9fe1a85ec53); in hash_fmix_64()
83 k ^= k >> 33; in hash_fmix_64()
85 return (k); in hash_fmix_64()
/redis-3.2.3/deps/hiredis/
H A DCHANGELOG.md5 * Increase the read buffer size from 2k to 16k.
/redis-3.2.3/src/
H A Dhyperloglog.c401 uint64_t k; in MurmurHash64A() local
404 k = *((uint64_t*)data); in MurmurHash64A()
406 k = (uint64_t) data[0]; in MurmurHash64A()
407 k |= (uint64_t) data[1] << 8; in MurmurHash64A()
408 k |= (uint64_t) data[2] << 16; in MurmurHash64A()
409 k |= (uint64_t) data[3] << 24; in MurmurHash64A()
410 k |= (uint64_t) data[4] << 32; in MurmurHash64A()
416 k *= m; in MurmurHash64A()
417 k ^= k >> r; in MurmurHash64A()
418 k *= m; in MurmurHash64A()
[all …]
H A Dredis-trib.rb165 k,v=e.split(":")
166 k = k.to_sym
168 if k != :cluster_state
169 @info[k] = v.to_i
171 @info[k] = v
451 none = slots.select {|k,v| v.length == 0}
452 single = slots.select {|k,v| v.length == 1}
453 multi = slots.select {|k,v| v.length > 1}
1471 keys.each{|k|
1473 slot = key_to_slot(k)
[all …]
H A Dzipmap.c139 unsigned char *p = zm+1, *k = NULL; in zipmapLookupRaw() local
148 if (key != NULL && k == NULL && l == klen && !memcmp(p+llen,key,l)) { in zipmapLookupRaw()
152 k = p; in zipmapLookupRaw()
165 return k; in zipmapLookupRaw()
H A Dserver.c3384 int j, k, count; in evictionPoolPopulate() local
3415 k = 0; in evictionPoolPopulate()
3417 pool[k].key && in evictionPoolPopulate()
3418 pool[k].idle < idle) k++; in evictionPoolPopulate()
3423 } else if (k < MAXMEMORY_EVICTION_POOL_SIZE && pool[k].key == NULL) { in evictionPoolPopulate()
3431 memmove(pool+k+1,pool+k, in evictionPoolPopulate()
3435 k--; in evictionPoolPopulate()
3443 pool[k].idle = idle; in evictionPoolPopulate()
3521 for (k = MAXMEMORY_EVICTION_POOL_SIZE-1; k >= 0; k--) { in freeMemoryIfNeeded()
3528 memmove(pool+k,pool+k+1, in freeMemoryIfNeeded()
[all …]
H A Dsort.c62 char *p, *f, *k; in lookupKeyByPattern() local
102 k = keyobj->ptr; in lookupKeyByPattern()
103 memcpy(k,spat,prefixlen); in lookupKeyByPattern()
104 memcpy(k+prefixlen,ssub,sublen); in lookupKeyByPattern()
105 memcpy(k+prefixlen+sublen,p+1,postfixlen); in lookupKeyByPattern()
H A Ddict.c117 uint32_t k = *(uint32_t*)data; in dictGenHashFunction() local
119 k *= m; in dictGenHashFunction()
120 k ^= k >> r; in dictGenHashFunction()
121 k *= m; in dictGenHashFunction()
124 h ^= k; in dictGenHashFunction()
/redis-3.2.3/deps/jemalloc/src/
H A Djemalloc.c846 const char *opts, *k, *v; in malloc_conf_init() local
952 k, klen, v, vlen); \ in malloc_conf_init()
968 k, klen, v, vlen); \ in malloc_conf_init()
982 k, klen, v, vlen); \ in malloc_conf_init()
999 k, klen, v, vlen); \ in malloc_conf_init()
1004 k, klen, v, vlen); \ in malloc_conf_init()
1031 if (strncmp("dss", k, klen) == 0) { in malloc_conf_init()
1040 k, klen, v, vlen); in malloc_conf_init()
1051 k, klen, v, vlen); in malloc_conf_init()
1080 "Invalid conf value", k, in malloc_conf_init()
[all …]

12