Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 126) sorted by relevance

123456

/redis-3.2.3/deps/jemalloc/test/include/test/
H A Dtest.h4 t a_ = (a); \
20 #define assert_ptr_eq(a, b, ...) assert_cmp(void *, a, b, ==, \ argument
22 #define assert_ptr_ne(a, b, ...) assert_cmp(void *, a, b, !=, \ argument
24 #define assert_ptr_null(a, ...) assert_cmp(void *, a, NULL, ==, \ argument
57 #define assert_ld_eq(a, b, ...) assert_cmp(long, a, b, ==, \ argument
59 #define assert_ld_ne(a, b, ...) assert_cmp(long, a, b, !=, \ argument
61 #define assert_ld_lt(a, b, ...) assert_cmp(long, a, b, <, \ argument
63 #define assert_ld_le(a, b, ...) assert_cmp(long, a, b, <=, \ argument
67 #define assert_ld_gt(a, b, ...) assert_cmp(long, a, b, >, \ argument
256 __func__, __FILE__, __LINE__, #a, #b, a, b); \
[all …]
H A Dmath.h88 a = 1.0 - p; in i_gamma()
89 b = a + x + 1.0; in i_gamma()
98 a += 1.0; in i_gamma()
101 an = a * term; in i_gamma()
257 a = log(1.0 - p); in pt_chi2()
282 s1 = (210.0 + a * (140.0 + a * (105.0 + a * (84.0 + a * (70.0 + in pt_chi2()
284 s2 = (420.0 + a * (735.0 + a * (966.0 + a * (1141.0 + 1278.0 * in pt_chi2()
285 a)))) / 2520.0; in pt_chi2()
286 s3 = (210.0 + a * (462.0 + a * (707.0 + 932.0 * a))) / 2520.0; in pt_chi2()
287 s4 = (252.0 + a * (672.0 + 1182.0 * a) + c * (294.0 + a * in pt_chi2()
[all …]
/redis-3.2.3/src/
H A Dpqsort.c49 #define min(a, b) (a) < (b) ? a : b argument
93 return cmp(a, b) < 0 ? in med3()
94 (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a )) in med3()
95 :(cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c )); in med3()
106 loop: SWAPINIT(a, es); in _pqsort()
108 for (pm = (char *) a + es; pm < (char *) a + n * es; pm += es) in _pqsort()
116 pl = (char *) a; in _pqsort()
126 swap(a, pm); in _pqsort()
158 void *_l = a, *_r = ((unsigned char*)a)+r-1; in _pqsort()
167 a = pn - r; in _pqsort()
[all …]
H A Dsha1.c81 R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); in SHA1Transform()
82 R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); in SHA1Transform()
83 R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); in SHA1Transform()
84 R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); in SHA1Transform()
85 R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); in SHA1Transform()
86 R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); in SHA1Transform()
87 R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); in SHA1Transform()
88 R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); in SHA1Transform()
89 R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35); in SHA1Transform()
90 R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39); in SHA1Transform()
[all …]
H A Drand.c63 #define SEED(x0, x1, x2) (SET3(x, x0, x1, x2), SET3(a, A0, A1, A2), c = C)
68 static uint32_t x[3] = { X0, X1, X2 }, a[3] = { A0, A1, A2 }, c = C; variable
83 MUL(a[0], x[0], p); in next()
86 MUL(a[0], x[1], q); in next()
88 MUL(a[1], x[0], r); in next()
90 a[0] * x[2] + a[1] * x[1] + a[2] * x[0]); in next()
H A Dt_string.c103 char *a = c->argv[j]->ptr; in setCommand() local
106 if ((a[0] == 'n' || a[0] == 'N') && in setCommand()
107 (a[1] == 'x' || a[1] == 'X') && a[2] == '\0' && in setCommand()
111 } else if ((a[0] == 'x' || a[0] == 'X') && in setCommand()
112 (a[1] == 'x' || a[1] == 'X') && a[2] == '\0' && in setCommand()
116 } else if ((a[0] == 'e' || a[0] == 'E') && in setCommand()
117 (a[1] == 'x' || a[1] == 'X') && a[2] == '\0' && in setCommand()
124 } else if ((a[0] == 'p' || a[0] == 'P') && in setCommand()
125 (a[1] == 'x' || a[1] == 'X') && a[2] == '\0' && in setCommand()
/redis-3.2.3/deps/lua/src/
H A Dluaconf.h533 #define luai_numadd(a,b) ((a)+(b)) argument
534 #define luai_numsub(a,b) ((a)-(b)) argument
535 #define luai_nummul(a,b) ((a)*(b)) argument
536 #define luai_numdiv(a,b) ((a)/(b)) argument
537 #define luai_nummod(a,b) ((a) - floor((a)/(b))*(b)) argument
538 #define luai_numpow(a,b) (pow(a,b)) argument
539 #define luai_numunm(a) (-(a)) argument
540 #define luai_numeq(a,b) ((a)==(b)) argument
541 #define luai_numlt(a,b) ((a)<(b)) argument
542 #define luai_numle(a,b) ((a)<=(b)) argument
[all …]
/redis-3.2.3/deps/lua/test/
H A Dbisect.lua5 function bisect(f,a,b,fa,fb)
6 local c=(a+b)/2
7 io.write(n," c=",c," a=",a," b=",b,"\n")
8 if c==a or c==b or math.abs(a-b)<delta then return c,b-a end
11 if fa*fc<0 then return bisect(f,a,c,fa,fc) else return bisect(f,c,b,fc,fb) end
15 function solve(f,a,b)
17 local z,e=bisect(f,a,b,f(a),f(b))
H A Dtrace-globals.lua6 local tostring=function(a)
7 if type(a)=="string" then
8 return string.format("%q",a)
10 return _tostring(a)
32 a=1
34 a=10
38 print(a,b,c)
H A Dfibfor.lua5 local a,b = 1, 1
6 while a <= n do
7 coroutine.yield(a)
8 a, b = b, a+b
H A Dtable.lua8 local _,_,a,b=string.find(l,'"?([_%w]+)"?%s*(.*)$')
9 if a~=A then A=a io.write("\n",a,":") end
/redis-3.2.3/deps/linenoise/
H A DREADME.markdown11 * Only uses a subset of VT100 escapes (ANSI.SYS compatible).
13 ## Can a line editing library be 20k lines of code?
22 The result is a pollution of binaries without line editing support.
59 library should get you up to speed ASAP. Here is a list of API calls
70 When a tty is detected (the user is actually typing into a terminal session)
72 standard input is not a tty, which happens every time you redirect a file
95 screens rows are used, can be a lot more comfortable.
116 Use `linenoiseHistoryAdd` every time you want to add a new element
138 The following is an example of registering a completion callback:
163 Linenoise has a feature called *hints* which is very useful when you
[all …]
/redis-3.2.3/deps/jemalloc/test/unit/
H A Dprof_active.c43 #define mallctl_prof_active_get(a) \ argument
44 mallctl_prof_active_get_impl(a, __func__, __LINE__)
54 #define mallctl_prof_active_set(a, b) \ argument
55 mallctl_prof_active_set_impl(a, b, __func__, __LINE__)
65 #define mallctl_thread_prof_active_get(a) \ argument
66 mallctl_thread_prof_active_get_impl(a, __func__, __LINE__)
76 #define mallctl_thread_prof_active_set(a, b) \ argument
77 mallctl_thread_prof_active_set_impl(a, b, __func__, __LINE__)
93 #define prof_sampling_probe(a) \ argument
94 prof_sampling_probe_impl(a, __func__, __LINE__)
/redis-3.2.3/
H A DCONTRIBUTING2 a pull request via Github, a code fragment or patch via private email or
23 # How to provide a patch for a new feature
25 1. If it is a major feature or a semantical change, please post it as a new submission in r/redis o…
28 following procedure to submit a patch:
30 a. Fork Redis on github ( http://help.github.com/fork-a-repo/ )
31 b. Create a topic branch (git checkout -b my_branch)
33 d. Initiate a pull request on github ( http://help.github.com/send-pull-requests/ )
36 For minor fixes just open a pull request on Github.
H A DREADME.md6 …a *data structures* server. What this means is that Redis provides access to mutable data structur…
8 Data structures implemented into Redis have a few special properties:
12 * Redis offers a number of features that are natural to find in a database, like replication, tunab…
16 If you want to know more, this is a list of selected starting points:
38 You can run a 32 bit Redis binary using:
42 After building Redis is a good idea to test it, using:
70 with a 64 bit target, or the other way around, you need to perform a
100 Redis will build with a user friendly colorized output by default.
101 If you want to see a more verbose output use the following:
163 it the proper way for a production system, we have a script doing this
[all …]
H A DMANIFESTO7 1 - A DSL for Abstract Data Types. Redis is a DSL (Domain Specific Language)
8 that manipulates abstract data types and implemented as a TCP daemon.
9 Commands manipulate a key space where keys are binary-safe strings and
11 represents an abstract version of a fundamental data structure. For instance
13 essence of a data type isn't just the kind of operations that the data types
28 3 - Fundamental data structures for a fundamental API. The Redis API is a direct
37 4 - Code is like a poem; it's not just something we write to reach some
44 in a bigger story, we'll be happy to use beautiful self contained libraries
48 5 - We're against complexity. We believe designing systems is a fight against
55 naturally into a distributed version of Redis and 2) a more complex API that
[all …]
/redis-3.2.3/utils/create-cluster/
H A DREADME1 Create-custer is a small script used to easily start a big number of Redis
3 testing in a condition which is not easy to replicate with the Redis cluster
4 unit tests, for example when a lot of instances are needed in order to trigger
5 a give bug.
7 The tool can also be used just to easily create a number of instances in a
8 Redis Cluster in order to experiment a bit with the system.
13 To create a cluster, follow this steps:
22 In order to stop a cluster:
25 2. Use "./create-cluster clean" to remove all the AOF / log files to restat with a clean environmen…
/redis-3.2.3/deps/hiredis/
H A DREADME.md13 a reply parser that is decoupled from the I/O layer. It
43 an error state. The field `errstr` will contain a string with a description of
68 used. Together with a pointer to the string, it requires a `size_t` length argument
86 a new connection.
181 The following examples shows a simple pipeline (resulting in only a single call to `write(2)` and
182 a single call to `read(2)`):
257 the disconnect callback is a good point to do so.
268 Because commands are sent to Redis asynchronously, issuing a command requires a callback function
290 If the reply for a command with a `NULL` callback is read, it is immediately free'd. When the callb…
331 The function `redisReaderCreate` creates a `redisReader` structure that holds a
[all …]
/redis-3.2.3/tests/unit/
H A Dexpire.tcl83 set a [r get x]
88 list $a $b
99 set a [r get x]
121 list $a $b
151 r psetex key1 500 a
152 r psetex key2 500 a
153 r psetex key3 500 a
166 r psetex key1 500 a
193 r set a c
194 r expire a 5
[all …]
H A Dbitops.tcl11 foreach a $args {
12 binary scan $a b* bits
143 r bitop and res1 a
144 r bitop or res2 a
145 r bitop xor res3 a
160 r bitop and res1 a b
161 r bitop or res2 a b
196 r set a 1
198 r bitop xor dest a b a
204 r set a 1
[all …]
H A Dscripting.tcl39 } {a b c d}
82 r rpush mylist a
89 } {table a b c 3}
186 } {*against a key*}
203 } {a b}
228 a['x'] = b
323 } {a {} b {} c {}}
583 } 1 a
587 [r -1 lrange a 0 -1] eq [r lrange a 0 -1]
592 } {a 1}
[all …]
H A Dsort.tcl120 r zadd zset 1 a
126 } {e d c b a}
130 r zadd zset 1 a
139 } {{a c e b d} {d b e c a}}
143 r zadd zset 1 a
158 r zadd zset 1 a
167 } {{a c e b d} {d b e c a}}
171 r zadd zset -100 a
178 } {min c a b d max}
213 } {a aa aaa azz b c d e f g h i l m n o p q r s t u v z}
[all …]
/redis-3.2.3/deps/jemalloc/src/
H A Dextent.c18 extent_szad_comp(extent_node_t *a, extent_node_t *b) in extent_szad_comp() argument
21 size_t a_qsize = extent_quantize(extent_node_size_get(a)); in extent_szad_comp()
30 uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a); in extent_szad_comp()
44 extent_ad_comp(extent_node_t *a, extent_node_t *b) in extent_ad_comp() argument
46 uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a); in extent_ad_comp()
/redis-3.2.3/tests/unit/type/
H A Dzset.tcl132 } {3 {a 10 b 20 c 30}}
136 } {1 {x 5 a 10 b 20 c 30}}
193 r zadd ztmp 1 a
223 r zadd ztmp 1 a
329 r zrem zset a
543 r zadd zseta 1 a
547 } {a 1 b 2}
551 r zadd zseta 1 a
569 r sadd seta a
599 r sadd seta a
[all …]
/redis-3.2.3/deps/lua/doc/
H A Dlua.css35 a:link {
41 a:visited {
46 a:link:hover, a:visited:hover {
51 a:link:active, a:visited:active {

123456