Home
last modified time | relevance | path

Searched refs:y (Results 1 – 25 of 31) sorted by relevance

12

/redis-3.2.3/deps/geohash-int/
H A Dgeohash.c62 y = (y | (y << S[4])) & B[4]; in interleave64()
65 y = (y | (y << S[3])) & B[3]; in interleave64()
68 y = (y | (y << S[2])) & B[2]; in interleave64()
71 y = (y | (y << S[1])) & B[1]; in interleave64()
74 y = (y | (y << S[0])) & B[0]; in interleave64()
92 y = (y | (y >> S[0])) & B[0]; in deinterleave64()
95 y = (y | (y >> S[1])) & B[1]; in deinterleave64()
98 y = (y | (y >> S[2])) & B[2]; in deinterleave64()
101 y = (y | (y >> S[3])) & B[3]; in deinterleave64()
104 y = (y | (y >> S[4])) & B[4]; in deinterleave64()
[all …]
/redis-3.2.3/deps/lua/test/
H A Dlife.lua18 for y=1,h do
19 t[y] = {}
21 t[y][x]=0
31 for y=0,shape.h-1 do
33 self[top+y][left+x] = shape[y*shape.w+x+1]
40 local ym1,y,yp1,yi=self.h-1,self.h,1,self.h
45 self[y][xm1] + self[y][xp1] +
47 next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0
50 ym1,y,yp1,yi = y,yp1,yp1+1,yi-1
57 for y=1,self.h do
[all …]
H A Dfib.lua17 local y=c[x]
18 if not y then
19 y=f(x)
20 c[x]=y
22 return y
H A Dsort.lua55 qsort(x,1,n,function (x,y) return x<y end)
57 selectionsort(x,n,function (x,y) return x>y end)
59 qsort(x,1,n,function (x,y) return x<y end)
H A Dreadonly.lua12 y=1 -- cannot redefine `y'
/redis-3.2.3/src/
H A Drand.c50 #define MUL(x, y, z) { int32_t l = (long)(x) * (long)(y); \ argument
52 #define CARRY(x, y) ((int32_t)(x) + (long)(y) > MASK) argument
53 #define ADDEQU(x, y, z) (z = CARRY(x, (y)), x = LOW(x + (y))) argument
62 #define SETLOW(x, y, n) SET3(x, LOW((y)[n]), LOW((y)[(n)+1]), LOW((y)[(n)+2])) argument
H A Dsds.c1173 sdslen(y) == 1 && memcmp(y,"i\0",2) == 0) in sdsTest()
1175 sdsfree(y); in sdsTest()
1179 sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0) in sdsTest()
1181 sdsfree(y); in sdsTest()
1185 sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0) in sdsTest()
1187 sdsfree(y); in sdsTest()
1191 sdslen(y) == 0 && memcmp(y,"\0",1) == 0) in sdsTest()
1193 sdsfree(y); in sdsTest()
1197 sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0) in sdsTest()
1199 sdsfree(y); in sdsTest()
[all …]
H A Dsha1.c47 #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
/redis-3.2.3/deps/hiredis/
H A Dsds.c1173 sdslen(y) == 1 && memcmp(y,"i\0",2) == 0) in sdsTest()
1175 sdsfree(y); in sdsTest()
1179 sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0) in sdsTest()
1181 sdsfree(y); in sdsTest()
1185 sdslen(y) == 2 && memcmp(y,"ao\0",3) == 0) in sdsTest()
1187 sdsfree(y); in sdsTest()
1191 sdslen(y) == 0 && memcmp(y,"\0",1) == 0) in sdsTest()
1193 sdsfree(y); in sdsTest()
1197 sdslen(y) == 3 && memcmp(y,"iao\0",4) == 0) in sdsTest()
1199 sdsfree(y); in sdsTest()
[all …]
/redis-3.2.3/deps/jemalloc/test/include/test/
H A DSFMT.h92 double to_res53_mix(uint32_t x, uint32_t y);
147 JEMALLOC_INLINE double to_res53_mix(uint32_t x, uint32_t y) in to_res53_mix() argument
149 return to_res53(x | ((uint64_t)y << 32)); in to_res53_mix()
164 uint32_t x, y; in genrand_res53_mix() local
167 y = gen_rand32(ctx); in genrand_res53_mix()
168 return to_res53_mix(x, y); in genrand_res53_mix()
H A DSFMT-sse2.h65 __m128i v, x, y, z; in mm_recursion() local
68 y = _mm_srli_epi32(*b, SR1); in mm_recursion()
74 y = _mm_and_si128(y, mask); in mm_recursion()
76 z = _mm_xor_si128(z, y); in mm_recursion()
H A DSFMT-alti.h80 vector unsigned int v, w, x, y, z; in vec_recursion() local
83 y = vec_sr(b, sr1); in vec_recursion()
87 y = vec_and(y, mask); in vec_recursion()
89 z = vec_xor(z, y); in vec_recursion()
/redis-3.2.3/deps/jemalloc/test/src/
H A DSFMT.c247 w128_t y; in do_recursion() local
250 rshift128(&y, c, SR2); in do_recursion()
251 r->u[0] = a->u[0] ^ x.u[0] ^ ((b->u[0] >> SR1) & MSK2) ^ y.u[0] in do_recursion()
253 r->u[1] = a->u[1] ^ x.u[1] ^ ((b->u[1] >> SR1) & MSK1) ^ y.u[1] in do_recursion()
255 r->u[2] = a->u[2] ^ x.u[2] ^ ((b->u[2] >> SR1) & MSK4) ^ y.u[2] in do_recursion()
257 r->u[3] = a->u[3] ^ x.u[3] ^ ((b->u[3] >> SR1) & MSK3) ^ y.u[3] in do_recursion()
264 w128_t y; in do_recursion() local
267 rshift128(&y, c, SR2); in do_recursion()
348 uint32_t x, y; in swap() local
352 y = array[i].u[2]; in swap()
[all …]
/redis-3.2.3/tests/unit/type/
H A Dzset.tcl30 r zadd ztmp 20 y
34 r zadd ztmp 1 y
74 r zadd ztmp 10 x 20 y 30 z
89 r zadd ztmp nx 10 x 20 y 30 z
95 r zadd ztmp 10 x 20 y 30 z
105 r zadd ztmp 10 x 20 y 30 z
112 r zadd ztmp 10 x 20 y 30 z
119 r zadd ztmp 10 x 20 y 30 z
167 r zadd ztmp 20 y
254 r zadd zranktmp 20 y
[all …]
H A Dstring.tcl133 r mset x 10 y "foo bar" z "x x x x x x x\n\n\r\n"
134 r mget x y z
138 catch {r mset x 10 y "foo bar" z} err
H A Dset.tcl104 assert_equal 2 [r srem myset b d x y]
315 hashtable {a b c d e f g h i j k l m n o p q r s t u v w x y z}
/redis-3.2.3/utils/
H A Dgenerate-command-help.rb73 commands.to_a.sort do |x,y|
74 x[0] <=> y[0]
/redis-3.2.3/tests/unit/
H A Dexpire.tcl48 r setex y 1 foo
49 r get y
55 r get y
96 r del x y z
H A Dprotocol.tcl60 assert_error "*wrong*arguments*ping*" {r ping x y z}
H A Dother.tcl131 r setex y 2000 somevalue
152 set ttl [r ttl y]
H A Dpubsub.tcl307 r sadd myset x y z
322 r zadd myzset 3 x 4 y 5 z
H A Dkeyspace.tcl242 r set bar y
/redis-3.2.3/utils/hashtable/
H A Drehashing.c4 void _redisAssert(char *x, char *y, int l) { in _redisAssert() argument
5 printf("ASSERT: %s %s %d\n",x,y,l); in _redisAssert()
/redis-3.2.3/deps/lua/src/
H A Dldump.c39 static void DumpChar(int y, DumpState* D) in DumpChar() argument
41 char x=(char)y; in DumpChar()
/redis-3.2.3/deps/lua/
H A DHISTORY47 + more general syntax for function definition (e.g. function a.x.y:f()...end).
122 f(x).y=1
123 o:f(x,y):g(z)

12