Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 103) sorted by relevance

12345

/redis-3.2.3/deps/jemalloc/test/unit/
H A Dbitmap.c25 size_t j; in TEST_BEGIN() local
30 for (j = 0; j < i; j++) { in TEST_BEGIN()
48 size_t j; in TEST_BEGIN() local
53 for (j = 0; j < i; j++) in TEST_BEGIN()
71 size_t j; in TEST_BEGIN() local
76 for (j = 0; j < i; j++) in TEST_BEGIN()
80 for (j = 0; j < i; j++) in TEST_BEGIN()
82 for (j = 0; j < i; j++) in TEST_BEGIN()
106 for (j = 0; j < i; j++) { in TEST_BEGIN()
118 for (j = i - 1; j >= 0; j--) { in TEST_BEGIN()
[all …]
H A Drtree.c59 unsigned i, j, k; in TEST_BEGIN() local
70 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) { in TEST_BEGIN()
79 j, k, keys[j], keys[k]); in TEST_BEGIN()
84 "i=%u, j=%u", i, j); in TEST_BEGIN()
85 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
105 unsigned j; in TEST_BEGIN() local
111 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
112 keys[j] = (uintptr_t)gen_rand64(sfmt); in TEST_BEGIN()
118 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
123 for (j = 0; j < NSET; j++) { in TEST_BEGIN()
[all …]
H A Dqr.c33 j = 0; in test_independent_entries()
35 j++; in test_independent_entries()
42 j = 0; in test_independent_entries()
44 j++; in test_independent_entries()
80 j = 0; in test_entries_ring()
84 j++; in test_entries_ring()
88 j = 0; in test_entries_ring()
92 j++; in test_entries_ring()
134 j++; in TEST_BEGIN()
140 j++; in TEST_BEGIN()
[all …]
H A Dckh.c128 size_t j; in TEST_BEGIN() local
130 for (j = i; j < NITEMS; j++) { in TEST_BEGIN()
131 assert_false(ckh_insert(tsd, &ckh, p[j], p[j]), in TEST_BEGIN()
133 assert_false(ckh_search(&ckh, p[j], &q, &r), in TEST_BEGIN()
135 assert_ptr_eq(p[j], q, "Key pointer mismatch"); in TEST_BEGIN()
143 for (j = i + 1; j < NITEMS; j++) { in TEST_BEGIN()
148 assert_ptr_eq(p[j], q, "Key pointer mismatch"); in TEST_BEGIN()
177 for (j = 0; j < i + 1; j++) in TEST_BEGIN()
178 assert_true(seen[j], "Item %zu not seen", j); in TEST_BEGIN()
179 for (; j < NITEMS; j++) in TEST_BEGIN()
[all …]
H A Drb.c231 for (j = 0; j < NNODES; j++) in TEST_BEGIN()
232 bag[j] = j; in TEST_BEGIN()
236 for (j = 0; j < NNODES; j++) in TEST_BEGIN()
237 bag[j] = NNODES - j - 1; in TEST_BEGIN()
240 for (j = 0; j < NNODES; j++) in TEST_BEGIN()
244 for (j = 1; j <= NNODES; j++) { in TEST_BEGIN()
248 for (k = 0; k < j; k++) { in TEST_BEGIN()
283 for (k = 0; k < j; k++) in TEST_BEGIN()
287 for (k = j; k > 0; k--) in TEST_BEGIN()
292 unsigned nnodes = j; in TEST_BEGIN()
[all …]
/redis-3.2.3/src/
H A Dsort.c246 j++; in sortCommand()
262 j++; in sortCommand()
272 j++; in sortCommand()
278 j++; in sortCommand()
344 j = 0; in sortCommand()
378 j++; in sortCommand()
449 for (j = 0; j < vectorlen; j++) { in sortCommand()
509 for (j = start; j <= end; j++) { in sortCommand()
537 for (j = start; j <= end; j++) { in sortCommand()
581 for (j = 0; j < vectorlen; j++) in sortCommand()
[all …]
H A Dslowlog.c50 int j, slargc = argc; in slowlogCreateEntry() local
55 for (j = 0; j < slargc; j++) { in slowlogCreateEntry()
66 sdsEncodedObject(argv[j]) && in slowlogCreateEntry()
76 se->argv[j] = argv[j]; in slowlogCreateEntry()
77 incrRefCount(argv[j]); in slowlogCreateEntry()
93 int j; in slowlogFreeEntry() local
95 for (j = 0; j < se->argc; j++) in slowlogFreeEntry()
96 decrRefCount(se->argv[j]); in slowlogFreeEntry()
152 int j; in slowlogCommand() local
160 for (j = 0; j < se->argc; j++) in slowlogCommand()
[all …]
H A Dbio.c96 int j; in bioInit() local
99 for (j = 0; j < BIO_NUM_OPS; j++) { in bioInit()
100 pthread_mutex_init(&bio_mutex[j],NULL); in bioInit()
102 bio_jobs[j] = listCreate(); in bioInit()
103 bio_pending[j] = 0; in bioInit()
116 for (j = 0; j < BIO_NUM_OPS; j++) { in bioInit()
117 void *arg = (void*)(unsigned long) j; in bioInit()
122 bio_threads[j] = thread; in bioInit()
213 int err, j; in bioKillThreads() local
215 for (j = 0; j < BIO_NUM_OPS; j++) { in bioKillThreads()
[all …]
H A Dsparkline.c82 int j; in freeSparklineSequence() local
84 for (j = 0; j < seq->length; j++) in freeSparklineSequence()
85 zfree(seq->samples[j].label); in freeSparklineSequence()
98 int j; in sparklineRenderRange() local
116 for (j = 0; j < len; j++) { in sparklineRenderRange()
117 struct sample *s = &seq->samples[j+offset]; in sparklineRenderRange()
134 chars[j] = '|'; in sparklineRenderRange()
166 int j; in sparklineRender() local
168 for (j = 0; j < seq->length; j += columns) { in sparklineRender()
169 int sublen = (seq->length-j) < columns ? (seq->length-j) : columns; in sparklineRender()
[all …]
H A Dscripting.c99 for (j = 0; j < 20; j++) { in sha1hex()
195 for (j = 0; j < mbulklen; j++) { in redisProtocolToLuaType_MultiBulk()
389 for (j = 0; j < argc; j++) { in luaRedisGenericCommand()
442 for (j = 0; j < c->argc; j++) { in luaRedisGenericCommand()
595 for (j = 0; j < c->argc; j++) { in luaRedisGenericCommand()
790 for (j = 1; j < argc; j++) { in luaLogCommand()
879 for (j = 0; s[j] != NULL; j++) code = sdscatlen(code,s[j],strlen(s[j])); in scriptingEnableGlobalsProtection()
1082 for (j = 0; j < elec; j++) { in luaSetGlobalArray()
1256 for (j = 0; j < 40; j++) in evalGenericCommand()
2016 for (j = 0; j < mbulklen; j++) { in ldbRedisProtocolToHuman_MultiBulk()
[all …]
H A Dbitops.c145 for (j = 0; j < sizeof(*l); j++) { in redisBitpos()
205 for (j = 0; j < bits; j++) { in setUnsignedBitfield()
225 for (j = 0; j < bits; j++) { in getUnsignedBitfield()
375 for (j = 0; j < count; j++) { in printBits()
620 for (j = 0; j < numkeys; j++) { in bitopCommand()
643 src[j] = objects[j]->ptr; in bitopCommand()
646 if (j == 0 || len[j] < minlen) minlen = len[j]; in bitopCommand()
721 for (; j < maxlen; j++) { in bitopCommand()
735 for (j = 0; j < numkeys; j++) { in bitopCommand()
912 for (j = 2; j < c->argc; j++) { in bitfieldCommand()
[all …]
H A Dcluster.c141 for (j = 1; j < argc; j += 2) { in clusterLoadConfig()
223 for (j = 8; j < argc; j++) { in clusterLoadConfig()
506 for (j = 0; j < CLUSTER_SLOTS; j++) clusterDelSlot(j); in clusterReset()
813 for (j = 0; j < n->numslaves; j++) in clusterCountNonFailingSlaves()
825 for (j = 0; j < n->numslaves; j++) in freeClusterNode()
3157 for (j = 0; j < 5; j++) { in clusterCron()
4479 for (j = 4; j < c->argc; j++) { in restoreCommand()
4673 for (j = 6; j < c->argc; j++) { in migrateCommand()
4711 for (j = 0; j < num_keys; j++) { in migrateCommand()
4745 for (j = 0; j < num_keys; j++) { in migrateCommand()
[all …]
H A Dmulti.c42 int j; in freeClientMultiState() local
44 for (j = 0; j < c->mstate.count; j++) { in freeClientMultiState()
46 multiCmd *mc = c->mstate.commands+j; in freeClientMultiState()
58 int j; in queueMultiCommand() local
67 for (j = 0; j < c->argc; j++) in queueMultiCommand()
68 incrRefCount(mc->argv[j]); in queueMultiCommand()
115 int j; in execCommand() local
145 for (j = 0; j < c->mstate.count; j++) { in execCommand()
308 int j; in watchCommand() local
314 for (j = 1; j < c->argc; j++) in watchCommand()
[all …]
H A Dlatency.c161 int j; in analyzeLatencyForEvent() local
175 for (j = 0; j < LATENCY_TS_LEN; j++) { in analyzeLatencyForEvent()
186 sum += ts->samples[j].latency; in analyzeLatencyForEvent()
204 for (j = 0; j < LATENCY_TS_LEN; j++) { in analyzeLatencyForEvent()
479 int samples = 0, j; in latencyCommandReplyWithSamples() local
481 for (j = 0; j < LATENCY_TS_LEN; j++) { in latencyCommandReplyWithSamples()
517 int j; in latencyCommandGenSparkeline() local
522 for (j = 0; j < LATENCY_TS_LEN; j++) { in latencyCommandGenSparkeline()
552 for (j = 0; j < LATENCY_GRAPH_COLS; j++) in latencyCommandGenSparkeline()
606 int j, resets = 0; in latencyCommand() local
[all …]
H A Dserver.c808 for (j = 0; j < dbs_per_call; j++) { in activeExpireCycle()
1777 for (j = 0; j < server.bindaddr_count || j == 0; j++) { in listenToPort()
1907 for (j = 0; j < server.dbnum; j++) { in initServer()
1999 for (j = 0; j < numcommands; j++) { in populateCommandTable()
2036 for (j = 0; j < numcommands; j++) { in resetCommandTableStats()
2074 for (j = 0; j < op->argc; j++) in redisOpArrayFree()
2151 for (j = 0; j < argc; j++) { in alsoPropagate()
2650 for (j = 0; j < sizeof(bufa); j++) { in time_independent_strcmp()
3397 for (j = 0; j < count; j++) { in evictionPoolPopulate()
3792 for (j = 1; j < argc; j++) in checkForSentinelMode()
[all …]
H A Dmemtest.c64 int j; in memtest_progress_start() local
68 for (j = 0; j < ws.ws_col*(ws.ws_row-2); j++) printf("."); in memtest_progress_start()
85 for (j = 0; j < chars-progress_printed; j++) printf("%c",c); in memtest_progress_step()
95 unsigned long j, *p; in memtest_addressing() local
99 for (j = 0; j < words; j++) { in memtest_addressing()
102 if ((j & 0xffff) == 0 && interactive) in memtest_addressing()
103 memtest_progress_step(j,words*2,'A'); in memtest_addressing()
107 for (j = 0; j < words; j++) { in memtest_addressing()
117 if ((j & 0xffff) == 0 && interactive) in memtest_addressing()
221 int j; in memtest_compare_times() local
[all …]
H A Dt_set.c274 int j, added = 0; in saddCommand() local
287 for (j = 2; j < c->argc; j++) { in saddCommand()
288 c->argv[j] = tryObjectEncoding(c->argv[j]); in saddCommand()
306 for (j = 2; j < c->argc; j++) { in sremCommand()
801 for (j = 0; j < setnum; j++) { in sinterGenericCommand()
846 for (j = 1; j < setnum; j++) { in sinterGenericCommand()
947 for (j = 0; j < setnum; j++) { in sunionDiffGenericCommand()
974 for (j = 0; j < setnum; j++) { in sunionDiffGenericCommand()
1003 for (j = 0; j < setnum; j++) { in sunionDiffGenericCommand()
1024 for (j = 1; j < setnum; j++) { in sunionDiffGenericCommand()
[all …]
/redis-3.2.3/tests/cluster/tests/
H A D09-pubsub.tcl11 for {set j 0} {$j < $instances} {incr j} {
12 if {$j != $instance} {
13 R $j deferred 1
14 R $j subscribe testchannel
15 R $j read; # Read the subscribe reply
23 for {set j 0} {$j < $instances} {incr j} {
24 if {$j != $instance} {
25 set msg [R $j read]
27 R $j unsubscribe testchannel
28 R $j read; # Read the unsubscribe reply
[all …]
H A D05-slave-selection.tcl38 for {set j 0} {$j < 100} {incr j} {
39 $cluster set $j $j
54 for {set j 0} {$j < 100} {incr j} {
55 $cluster set $j $j
/redis-3.2.3/deps/jemalloc/test/integration/
H A Drallocx.c8 unsigned i, j; in TEST_BEGIN() local
18 for (j = 1; j < NSZS && szs[j-1] < MAXSZ; j++) { in TEST_BEGIN()
22 szs[j-1], szs[j-1]+1); in TEST_BEGIN()
23 szs[j] = sallocx(q, 0); in TEST_BEGIN()
24 assert_zu_ne(szs[j], szs[j-1]+1, in TEST_BEGIN()
29 for (j--; j > 0; j--) { in TEST_BEGIN()
30 q = rallocx(p, szs[j-1], 0); in TEST_BEGIN()
33 szs[j], szs[j-1]); in TEST_BEGIN()
35 assert_zu_eq(tsz, szs[j-1], in TEST_BEGIN()
71 size_t psz, qsz, i, j; in TEST_BEGIN() local
[all …]
/redis-3.2.3/tests/cluster/
H A Dcluster.tcl60 for {set j 0} {$j < $n} {incr j} {
61 R $j cluster addslots {*}[set slots_${j}]
93 for {set j 0} {$j < $slaves} {incr j} {
94 set master_id [expr {$j % $masters}]
123 for {set j 0} {$j < 100} {incr j} {
126 for {set j 0} {$j < 100} {incr j} {
127 assert {[$cluster get key.$j] eq "$prefix.$j"}
/redis-3.2.3/tests/unit/
H A Dscan.tcl66 for {set j 0} {$j < 100} {incr j} {
67 lappend elements ${prefix}${j}
100 for {set j 0} {$j < $count} {incr j} {
101 lappend elements key:$j $j
140 for {set j 0} {$j < $count} {incr j} {
141 lappend elements $j key:$j
184 for {set j 0} {$j < 10} {incr j} {
232 for {set j 0} {$j < 500} {incr j} {
233 r zadd mykey 9.8813129168249309e-323 $j
H A Dmaxmemory.tcl51 for {set j 0} {$j < $numkeys} {incr j} {
85 for {set j 0} {$j < $numkeys} {incr j} {
133 for {set j 0} {$j < $numkeys} {incr j} {
134 catch {r setex "foo:$j" 10000 x}
139 for {set j 0} {$j < $numkeys} {incr j 2} {
140 assert {[r exists "key:$j"]}
/redis-3.2.3/deps/hiredis/examples/
H A Dexample.c8 unsigned int j; in main() local
57 for (j = 0; j < 10; j++) { in main()
60 snprintf(buf,64,"%d",j); in main()
68 for (j = 0; j < reply->elements; j++) { in main()
69 printf("%u) %s\n", j, reply->element[j]->str); in main()
/redis-3.2.3/deps/jemalloc/src/
H A Dstats.c24 mib[4] = (j); \
55 unsigned nbins, j; in stats_arena_bins_print() local
73 for (j = 0, in_gap = false; j < nbins; j++) { in stats_arena_bins_print()
107 j, &nfills, uint64_t); in stats_arena_bins_print()
109 i, j, &nflushes, uint64_t); in stats_arena_bins_print()
164 unsigned nbins, nlruns, j; in stats_arena_lruns_print() local
172 for (j = 0, in_gap = false; j < nlruns; j++) { in stats_arena_lruns_print()
210 unsigned nbins, nlruns, nhchunks, j; in stats_arena_hchunks_print() local
219 for (j = 0, in_gap = false; j < nhchunks; j++) { in stats_arena_hchunks_print()
235 j, &curhchunks, size_t); in stats_arena_hchunks_print()
[all …]

12345