Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 170) sorted by relevance

1234567

/redis-3.2.3/deps/jemalloc/test/unit/
H A Dqr.c20 for (i = 0; i < NENTRIES; i++) { in init_entries()
32 for (i = 0; i < NENTRIES; i++) { in test_independent_entries()
41 for (i = 0; i < NENTRIES; i++) { in test_independent_entries()
50 for (i = 0; i < NENTRIES; i++) { in test_independent_entries()
56 for (i = 0; i < NENTRIES; i++) { in test_independent_entries()
79 for (i = 0; i < NENTRIES; i++) { in test_entries_ring()
87 for (i = 0; i < NENTRIES; i++) { in test_entries_ring()
95 for (i = 0; i < NENTRIES; i++) { in test_entries_ring()
100 for (i = 0; i < NENTRIES; i++) { in test_entries_ring()
113 for (i = 1; i < NENTRIES; i++) in TEST_BEGIN()
[all …]
H A Dql.c26 i++; in test_empty_list()
51 for (i = 0; i < nentries; i++) { in init_entries()
52 entries[i].id = 'a' + i; in init_entries()
80 for (i = 0; i < nentries-1; i++) { in test_entries_list()
88 for (i = 1; i < nentries; i++) { in test_entries_list()
102 for (i = 0; i < NENTRIES; i++) in TEST_BEGIN()
117 for (i = 0; i < NENTRIES; i++) in TEST_BEGIN()
120 for (i = 0; i < NENTRIES; i++) { in TEST_BEGIN()
136 for (i = 0; i < NENTRIES; i++) in TEST_BEGIN()
151 for (i = 0; i < NENTRIES; i++) in TEST_BEGIN()
[all …]
H A Dckh.c31 size_t i; in TEST_BEGIN() local
42 for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) { in TEST_BEGIN()
43 ckh_insert(tsd, &ckh, strs[i], strs[i]); in TEST_BEGIN()
50 for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) { in TEST_BEGIN()
65 ks = (i & 1) ? strs[i] : (const char *)NULL; in TEST_BEGIN()
66 vs = (i & 2) ? strs[i] : (const char *)NULL; in TEST_BEGIN()
76 for (i = 0; i < sizeof(strs)/sizeof(const char *); i++) { in TEST_BEGIN()
122 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
123 p[i] = mallocx(i+1, 0); in TEST_BEGIN()
127 for (i = 0; i < NITEMS; i++) { in TEST_BEGIN()
[all …]
H A Dmath.c27 unsigned i; in factorial() local
29 for (i = 2; i <= x; i++) in factorial()
30 ret *= (uint64_t)i; in factorial()
189 unsigned i; in TEST_BEGIN() local
191 for (i = 1; i < sizeof(ln_gamma_misc_expected)/sizeof(double); i++) { in TEST_BEGIN()
240 unsigned i; in TEST_BEGIN() local
242 for (i = 1; i < sizeof(pt_norm_expected)/sizeof(double); i++) { in TEST_BEGIN()
290 unsigned i, j; in TEST_BEGIN() local
293 for (i = 0; i < sizeof(pt_chi2_df)/sizeof(double); i++) { in TEST_BEGIN()
352 unsigned i, j; in TEST_BEGIN() local
[all …]
H A Dbitmap.c5 size_t i, prev_size; in TEST_BEGIN() local
8 for (i = 1; i <= BITMAP_MAXBITS; i++) { in TEST_BEGIN()
9 size_t size = bitmap_size(i); in TEST_BEGIN()
19 size_t i; in TEST_BEGIN() local
21 for (i = 1; i <= BITMAP_MAXBITS; i++) { in TEST_BEGIN()
42 size_t i; in TEST_BEGIN() local
44 for (i = 1; i <= BITMAP_MAXBITS; i++) { in TEST_BEGIN()
65 size_t i; in TEST_BEGIN() local
67 for (i = 1; i <= BITMAP_MAXBITS; i++) { in TEST_BEGIN()
94 size_t i; in TEST_BEGIN() local
[all …]
H A Datomic.c30 unsigned i; \
32 for (i = 0; i < sizeof(tests)/sizeof(p##_test_t); i++) { \
36 tests[i].accum0, \
40 (t)((tc)tests[i].accum0 + (tc)tests[i].x), \
42 i, tests[i].accum0, tests[i].x); \
46 accum = tests[i].accum0; \
48 (t)((tc)tests[i].accum0 - (tc)tests[i].x), \
50 i, tests[i].accum0, tests[i].x); \
55 err = atomic_cas_##p(&accum, tests[i].x, tests[i].s); \
56 assert_b_eq(err, tests[i].accum0 != tests[i].x, \
[all …]
H A Dprof_reset.c52 unsigned i; in TEST_BEGIN() local
68 for (i = 0; i < 2; i++) { in TEST_BEGIN()
78 for (i = 0; i < 2; i++) { in TEST_BEGIN()
154 unsigned i; in thd_start() local
159 for (i = 0; i < NALLOCS_PER_THREAD; i++) { in thd_start()
184 for (i = 0; i < OBJ_RING_BUF_COUNT; i++) { in thd_start()
215 for (i = 0; i < NTHREADS; i++) { in TEST_BEGIN()
216 thd_args[i] = i; in TEST_BEGIN()
219 for (i = 0; i < NTHREADS; i++) in TEST_BEGIN()
254 for (i = 0; i < NITER; i++) { in TEST_BEGIN()
[all …]
H A Dprof_accum.c36 unsigned i_prev, i; in thd_start() local
40 for (i = 0; i < NALLOCS_PER_THREAD; i++) { in thd_start()
43 if (i % DUMP_INTERVAL == 0) { in thd_start()
49 i+1 == NALLOCS_PER_THREAD) { in thd_start()
53 i_prev = i; in thd_start()
66 unsigned i; in TEST_BEGIN() local
76 for (i = 0; i < NTHREADS; i++) { in TEST_BEGIN()
77 thd_args[i] = i; in TEST_BEGIN()
78 thd_create(&thds[i], thd_start, (void *)&thd_args[i]); in TEST_BEGIN()
80 for (i = 0; i < NTHREADS; i++) in TEST_BEGIN()
[all …]
H A Dmallctl.c203 for (i = 0; i < nbins; i++) { in TEST_BEGIN()
256 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
263 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
268 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
275 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
282 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
295 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
305 for (i = 0; i < NTCACHES; i++) { in TEST_BEGIN()
316 for (i = 0; i < NTCACHES; i++) in TEST_BEGIN()
320 for (i = 0; i < NTCACHES/2; i++) { in TEST_BEGIN()
[all …]
H A Drtree.c19 unsigned i; in TEST_BEGIN() local
21 for (i = 1; i <= (sizeof(uintptr_t) << 3); i++) { in TEST_BEGIN()
34 unsigned i; in TEST_BEGIN() local
37 for (i = 1; i <= (sizeof(uintptr_t) << 3); i++) { in TEST_BEGIN()
59 unsigned i, j, k; in TEST_BEGIN() local
61 for (i = 1; i < (sizeof(uintptr_t) << 3); i++) { in TEST_BEGIN()
63 (((uintptr_t)1) << (sizeof(uintptr_t)*8-i)) - 1}; in TEST_BEGIN()
78 "set key=%#"FMTxPTR", get key=%#"FMTxPTR, i, in TEST_BEGIN()
84 "i=%u, j=%u", i, j); in TEST_BEGIN()
96 unsigned i; in TEST_BEGIN() local
[all …]
/redis-3.2.3/deps/jemalloc/test/src/
H A DSFMT.c291 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
297 for (; i < N; i++) { in gen_rand_all()
318 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
350 for (i = 0; i < size; i++) { in swap()
389 for (i = 0; i < 4; i++) in period_certification()
391 for (i = 16; i > 0; i >>= 1) in period_certification()
399 for (i = 0; i < 4; i++) { in period_certification()
620 for (i = 1; i < N32; i++) { in init_gen_rand()
686 i = (i + 1) % N32; in init_by_array()
695 i = (i + 1) % N32; in init_by_array()
[all …]
/redis-3.2.3/deps/jemalloc/test/include/test/
H A DSFMT-alti.h99 int i; in gen_rand_all() local
104 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
110 for (; i < N; i++) { in gen_rand_all()
126 int i, j; in gen_rand_array() local
131 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
133 array[i].s = r; in gen_rand_array()
137 for (; i < N; i++) { in gen_rand_array()
144 for (; i < size - N; i++) { in gen_rand_array()
153 for (; i < size; i++) { in gen_rand_array()
177 int i; in swap() local
[all …]
H A DSFMT-sse2.h85 int i; in gen_rand_all() local
91 for (i = 0; i < N - POS1; i++) { in gen_rand_all()
92 r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2, in gen_rand_all()
98 for (; i < N; i++) { in gen_rand_all()
115 int i, j; in gen_rand_array() local
121 for (i = 0; i < N - POS1; i++) { in gen_rand_array()
122 r = mm_recursion(&ctx->sfmt[i].si, &ctx->sfmt[i + POS1].si, r1, r2, in gen_rand_array()
128 for (; i < N; i++) { in gen_rand_array()
129 r = mm_recursion(&ctx->sfmt[i].si, &array[i + POS1 - N].si, r1, r2, in gen_rand_array()
136 for (; i < size - N; i++) { in gen_rand_array()
[all …]
/redis-3.2.3/deps/lua/src/
H A Dltablib.c23 int i; in foreachi() local
26 for (i=1; i <= n; i++) { in foreachi()
99 int i; in tinsert() local
102 for (i = e; i > pos; i--) { /* move up elements */ in tinsert()
147 int i, last; in tconcat() local
153 for (; i < last; i++) { in tconcat()
195 int i, j; in auxsort() local
204 i = (l+u)/2; in auxsort()
246 if (i-l < u-i) { in auxsort()
247 j=l; i=i-1; l=i+2; in auxsort()
[all …]
H A Dprint.c28 for (i=0; i<n; i++) in PrintString()
30 int c=s[i]; in PrintString()
82 int a=GETARG_A(i); in PrintCode()
83 int b=GETARG_B(i); in PrintCode()
183 int i,n=f->sizek; in PrintConstants() local
185 for (i=0; i<n; i++) in PrintConstants()
197 for (i=0; i<n; i++) in PrintLocals()
200 i,getstr(f->locvars[i].varname),f->locvars[i].startpc+1,f->locvars[i].endpc+1); in PrintLocals()
209 for (i=0; i<n; i++) in PrintUpvalues()
211 printf("\t%d\t%s\n",i,getstr(f->upvalues[i])); in PrintUpvalues()
[all …]
H A Dltable.c86 int i; in hashnum() local
90 for (i = 1; i < numints; i++) a[0] += a[i]; in hashnum()
138 int i; in findindex() local
164 for (i++; i < t->sizearray; i++) { /* try first array part */ in luaH_next()
171 for (i -= t->sizearray; i < sizenode(t); i++) { /* then hash part */ in luaH_next()
236 for (; i <= lim; i++) { in numusearray()
266 for (i=t->sizearray; i<size; i++) in setarrayvector()
285 for (i=0; i<size; i++) { in setnodevector()
309 for (i=nasize; i<oldasize; i++) { in resize()
317 for (i = twoto(oldhsize) - 1; i >= 0; i--) { in resize()
[all …]
H A Dluac.c72 int i; in doargs() local
75 for (i=1; i<argc; i++) in doargs()
81 ++i; in doargs()
114 return i; in doargs()
117 #define toproto(L,i) (clvalue(L->top+(i))->l.p) argument
125 int i,pc; in combine() local
136 for (i=0; i<n; i++) in combine()
138 f->p[i]=toproto(L,i-n-1); in combine()
164 int i; in pmain() local
166 for (i=0; i<argc; i++) in pmain()
[all …]
H A Dlopcodes.h80 #define GET_OPCODE(i) (cast(OpCode, ((i)>>POS_OP) & MASK1(SIZE_OP,0))) argument
81 #define SET_OPCODE(i,o) ((i) = (((i)&MASK0(SIZE_OP,POS_OP)) | \ argument
84 #define GETARG_A(i) (cast(int, ((i)>>POS_A) & MASK1(SIZE_A,0))) argument
85 #define SETARG_A(i,u) ((i) = (((i)&MASK0(SIZE_A,POS_A)) | \ argument
88 #define GETARG_B(i) (cast(int, ((i)>>POS_B) & MASK1(SIZE_B,0))) argument
89 #define SETARG_B(i,b) ((i) = (((i)&MASK0(SIZE_B,POS_B)) | \ argument
92 #define GETARG_C(i) (cast(int, ((i)>>POS_C) & MASK1(SIZE_C,0))) argument
93 #define SETARG_C(i,b) ((i) = (((i)&MASK0(SIZE_C,POS_C)) | \ argument
96 #define GETARG_Bx(i) (cast(int, ((i)>>POS_Bx) & MASK1(SIZE_Bx,0))) argument
97 #define SETARG_Bx(i,b) ((i) = (((i)&MASK0(SIZE_Bx,POS_Bx)) | \ argument
[all …]
/redis-3.2.3/src/
H A Dsetproctitle.c102 int i, error; in spt_copyenv() local
110 for (i = 0; oldenv[i]; i++) { in spt_copyenv()
132 int i; in spt_copyargs() local
134 for (i = 1; i < argc || (i >= argc && argv[i]); i++) { in spt_copyargs()
135 if (!argv[i]) in spt_copyargs()
151 int i, error; in spt_init() local
159 for (i = 0; i < argc || (i >= argc && argv[i]); i++) { in spt_init()
160 if (!argv[i] || argv[i] < end) in spt_init()
163 end = argv[i] + strlen(argv[i]) + 1; in spt_init()
166 for (i = 0; envp[i]; i++) { in spt_init()
[all …]
H A Dae_evport.c76 int i; in aeApiCreate() local
88 for (i = 0; i < MAX_EVENT_BATCHSZ; i++) { in aeApiCreate()
110 int i; in aeApiLookupPending() local
112 for (i = 0; i < state->npending; i++) { in aeApiLookupPending()
246 int mask, i; in aeApiPoll() local
255 for (i = 0; i < state->npending; i++) { in aeApiPoll()
261 state->pending_fds[i], state->pending_masks[i]) != 0) { in aeApiPoll()
297 for (i = 0; i < nevents; i++) { in aeApiPoll()
304 eventLoop->fired[i].fd = event[i].portev_object; in aeApiPoll()
311 state->pending_fds[i] = event[i].portev_object; in aeApiPoll()
[all …]
H A Dsha1.c36 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ argument
39 #define blk0(i) block->l[i] argument
43 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ argument
44 ^block->l[(i+2)&15]^block->l[i&15],1))
169 for (i = 0; i < 2; i++) in SHA1Final()
178 for (i = 0; i < 8; i++) { in SHA1Final()
190 for (i = 0; i < 20; i++) { in SHA1Final()
213 for(i=0;i<BUFSIZE;i++) in sha1Test()
214 buf[i] = i; in sha1Test()
217 for(i=0;i<1000;i++) in sha1Test()
[all …]
/redis-3.2.3/utils/hyperloglog/
H A Dhll-gnuplot-graph.rb23 i = 0
26 while i < max do
31 i += 1
35 err = approx-i
36 rel_err = 100.to_f*err/i
37 samples << [i,rel_err]
45 (0...numsets).each{|i|
46 dataset[i] = run_experiment(r,i,max,step)
47 STDERR.puts "Set #{i}"
53 (1...numsets).each{|i|
[all …]
/redis-3.2.3/deps/lua/test/
H A Dsort.lua11 local i=l+1
12 while i<=u do
16 x[m],x[i]=x[i],x[m] -- swap x[i] and x[m]
18 i=i+1
28 local i=1
29 while i<=n do
30 local m,j=i,i+1
35 x[i],x[m]=x[m],x[i] -- swap x[i] and x[m]
36 i=i+1
42 local i=1
[all …]
/redis-3.2.3/deps/jemalloc/src/
H A Dstats.c14 mib[2] = (i); \
23 mib[2] = (i); \
51 unsigned i) in stats_arena_bins_print() argument
162 unsigned i) in stats_arena_lruns_print() argument
395 unsigned i; in stats_print() local
397 for (i = 0; opts[i] != '\0'; i++) { in stats_print()
398 switch (opts[i]) { in stats_print()
596 for (i = ninitialized = 0; i < narenas; i++) { in stats_print()
597 if (initialized[i]) in stats_print()
620 unsigned i; in stats_print() local
[all …]
H A Drtree.c16 unsigned bits_in_leaf, height, i; in rtree_new() local
40 for (i = 1; i < height-1; i++) { in rtree_new()
41 rtree->levels[i].subtree = NULL; in rtree_new()
43 rtree->levels[i].cumbits = rtree->levels[i-1].cumbits + in rtree_new()
54 for (i = 0; i < RTREE_HEIGHT_MAX; i++) { in rtree_new()
55 rtree->start_level[i] = hmin(RTREE_HEIGHT_MAX - 1 - i, height - in rtree_new()
67 size_t nchildren, i; in rtree_delete_subtree() local
70 for (i = 0; i < nchildren; i++) { in rtree_delete_subtree()
71 rtree_node_elm_t *child = node[i].child; in rtree_delete_subtree()
82 unsigned i; in rtree_delete() local
[all …]

1234567