Home
last modified time | relevance | path

Searched refs:index (Results 1 – 25 of 35) sorted by relevance

12

/redis-3.2.3/deps/jemalloc/test/unit/
H A Dsize_classes.c29 szind_t index, max_index; in TEST_BEGIN() local
34 for (index = 0, size_class = index2size(index); index < max_index || in TEST_BEGIN()
35 size_class < max_size_class; index++, size_class = in TEST_BEGIN()
36 index2size(index)) { in TEST_BEGIN()
37 assert_true(index < max_index, in TEST_BEGIN()
44 assert_u_eq(index, size2index(size_class), in TEST_BEGIN()
55 assert_u_eq(index+1, size2index(size_class+1), in TEST_BEGIN()
58 assert_zu_eq(size_class, (index > 0) ? in TEST_BEGIN()
59 s2u(index2size(index-1)+1) : s2u(1), in TEST_BEGIN()
69 assert_u_eq(index, size2index(index2size(index)), in TEST_BEGIN()
[all …]
/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Dsize_classes.sh44 index=$1
107 index=0
113 nlbins=$((${index} + 1))
116 nbins=$((${index} + 1))
120 index=$((${index} + 1))
133 index=$((${index} + 1))
139 index=$((${index} + 1))
161 nbins=$((${index} + 1))
172 index=$((${index} + 1))
179 nsizes=${index}
[all …]
H A Djemalloc_internal.h.in186 /* Size class index type. */
518 size_t index2size_lookup(szind_t index);
519 size_t index2size(szind_t index);
556 size_t index = NTBINS + grp + mod; local
557 return (index);
585 index2size_compute(szind_t index) argument
589 if (index < NTBINS)
612 index2size_lookup(szind_t index) argument
620 index2size(szind_t index) argument
623 assert(index < NSIZES);
[all …]
H A Dctl.h30 const ctl_named_node_t *(*index)(const size_t *, size_t, size_t); member
/redis-3.2.3/deps/hiredis/
H A Ddict.c136 int index; in dictAdd() local
141 if ((index = _dictKeyIndex(ht, key)) == -1) in dictAdd()
146 entry->next = ht->table[index]; in dictAdd()
147 ht->table[index] = entry; in dictAdd()
262 iter->index = -1; in dictGetIterator()
271 iter->index++; in dictNext()
272 if (iter->index >= in dictNext()
274 iter->entry = iter->ht->table[iter->index]; in dictNext()
H A Ddict.h71 int index; member
/redis-3.2.3/src/
H A Dadlist.c307 listNode *listIndex(list *list, long index) { in listIndex() argument
310 if (index < 0) { in listIndex()
311 index = (-index)-1; in listIndex()
313 while(index-- && n) n = n->prev; in listIndex()
316 while(index-- && n) n = n->next; in listIndex()
H A Dhyperloglog.c445 uint64_t hash, bit, index; in hllPatLen() local
468 *regp = (int) index; in hllPatLen()
487 long index; in hllDenseAdd() local
641 long index, first, span; in hllSparseAdd() local
770 if (index != first) { in hllSparseAdd()
771 len = index-first; in hllSparseAdd()
782 if (index != last) { in hllSparseAdd()
783 len = last-index; in hllSparseAdd()
796 if (index != first) { in hllSparseAdd()
803 if (index != last) { in hllSparseAdd()
[all …]
H A Dziplist.h40 unsigned char *ziplistIndex(unsigned char *zl, int index);
46 unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
H A Ddict.c348 int index; in dictAddRaw() local
356 if ((index = _dictKeyIndex(d, key)) == -1) in dictAddRaw()
365 entry->next = ht->table[index]; in dictAddRaw()
366 ht->table[index] = entry; in dictAddRaw()
564 iter->index = -1; in dictGetIterator()
583 if (iter->index == -1 && iter->table == 0) { in dictNext()
589 iter->index++; in dictNext()
590 if (iter->index >= (long) ht->size) { in dictNext()
593 iter->index = 0; in dictNext()
599 iter->entry = ht->table[iter->index]; in dictNext()
[all …]
H A Dquicklist.h138 int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data,
147 int quicklistIndex(const quicklist *quicklist, const long long index,
H A Dziplist.c800 unsigned char *ziplistIndex(unsigned char *zl, int index) { in ziplistIndex() argument
803 if (index < 0) { in ziplistIndex()
804 index = (-index)-1; in ziplistIndex()
808 while (prevlen > 0 && index--) { in ziplistIndex()
815 while (p[0] != ZIP_END && index--) { in ziplistIndex()
819 return (p[0] == ZIP_END || index > 0) ? NULL : p; in ziplistIndex()
909 unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num) { in ziplistDeleteRange() argument
910 unsigned char *p = ziplistIndex(zl,index); in ziplistDeleteRange()
1027 int index = 0; in ziplistRepr() local
1052 index, in ziplistRepr()
[all …]
H A Dt_list.c83 listTypeIterator *listTypeInitIterator(robj *subject, long index, in listTypeInitIterator() argument
96 iter_direction, index); in listTypeInitIterator()
308 long index; in lindexCommand() local
311 if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK)) in lindexCommand()
316 if (quicklistIndex(o->ptr, index, &entry)) { in lindexCommand()
335 long index; in lsetCommand() local
338 if ((getLongFromObjectOrReply(c, c->argv[2], &index, NULL) != C_OK)) in lsetCommand()
343 int replaced = quicklistReplaceAtIndex(ql, index, in lsetCommand()
H A Dadlist.h84 listNode *listIndex(list *list, long index);
H A Dquicklist.c667 int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data, in quicklistReplaceAtIndex() argument
670 if (likely(quicklistIndex(quicklist, index, &entry))) { in quicklistReplaceAtIndex()
1229 unsigned long long index; in quicklistIndex() local
1236 index = (-idx) - 1; in quicklistIndex()
1239 index = idx; in quicklistIndex()
1243 if (index >= quicklist->count) in quicklistIndex()
1247 if ((accum + n->count) > index) { in quicklistIndex()
1261 accum, index, index - accum, (-index) - 1 + accum); in quicklistIndex()
1266 entry->offset = index - accum; in quicklistIndex()
1270 entry->offset = (-index) - 1 + accum; in quicklistIndex()
H A Ddict.h90 long index; member
/redis-3.2.3/deps/jemalloc/src/
H A Darena.c789 arena->stats.hstats[index].nmalloc++; in arena_huge_malloc_stats_update()
802 arena->stats.hstats[index].nmalloc--; in arena_huge_malloc_stats_update_undo()
815 arena->stats.hstats[index].ndalloc++; in arena_huge_dalloc_stats_update()
828 arena->stats.hstats[index].ndalloc--; in arena_huge_dalloc_stats_update_undo()
2242 arena->stats.lstats[index].nmalloc++; in arena_malloc_large()
2244 arena->stats.lstats[index].curruns++; in arena_malloc_large()
2335 arena->stats.lstats[index].nmalloc++; in arena_palloc_large()
2337 arena->stats.lstats[index].curruns++; in arena_palloc_large()
2636 arena->stats.lstats[index].nmalloc++; in arena_ralloc_large_shrink()
2638 arena->stats.lstats[index].curruns++; in arena_ralloc_large_shrink()
[all …]
H A Dctl.c27 ctl_named_children(const ctl_named_node_t *node, int index) in ctl_named_children() argument
31 return (children ? &children[index] : NULL); in ctl_named_children()
842 uintmax_t index; in ctl_lookup() local
846 index = malloc_strtoumax(elm, NULL, 10); in ctl_lookup()
847 if (index == UINTMAX_MAX || index > SIZE_T_MAX) { in ctl_lookup()
853 node = inode->index(mibp, *depthp, (size_t)index); in ctl_lookup()
861 mibp[i] = (size_t)index; in ctl_lookup()
973 node = inode->index(mib, miblen, mib[i]); in ctl_bymib()
/redis-3.2.3/deps/jemalloc/include/jemalloc/
H A Djemalloc_macros.h.in23 * Bias tcache index bits so that 0 encodes "automatic tcache management", and 1
29 * Bias arena index bits so that 0 encodes "use an automatically chosen arena".
/redis-3.2.3/deps/jemalloc/bin/
H A Djeprof.in3912 my $index = 1;
3914 $index = 1;
3916 $index = 0;
3918 $index = 3;
3920 $index = 2;
3922 return $index;
4210 my $index = 0;
4212 $index = 0;
4214 $index = 1;
4216 $index = 2;
[all …]
/redis-3.2.3/tests/unit/type/
H A Dstring.tcl29 set index [randomInt 100]
31 if {$buf != $payload($index)} {
32 set err "Values differ: I set '$payload($index)' but I read back '$buf'"
H A Dzset.tcl1013 set index [randomInt $card]
1014 set ele [lindex [r zrange myzset $index $index] 0]
1016 if {$rank != $index} {
1017 set err "$ele RANK is wrong! ($rank != $index)"
/redis-3.2.3/deps/lua/src/
H A Dlua_cjson.c144 int index; member
881 token->index = json->ptr - json->data; in json_set_token_error()
1030 token->index = json->ptr - json->data; in json_next_token()
1113 exp, found, token->index + 1); in json_throw_parse_error()
/redis-3.2.3/tests/support/
H A Dserver.tcl182 if {[string length $line] > 0 && [string index $line 0] ne "#"} {
H A Dredis.tcl242 switch -exact -- [string index $line 0] {

12