| /redis-3.2.3/deps/hiredis/ |
| H A D | test.c | 502 int i, num; in test_throughput() local
509 num = 1000; in test_throughput()
510 replies = malloc(sizeof(redisReply*)*num); in test_throughput()
512 for (i = 0; i < num; i++) { in test_throughput()
521 replies = malloc(sizeof(redisReply*)*num); in test_throughput()
523 for (i = 0; i < num; i++) { in test_throughput()
533 num = 10000; in test_throughput()
535 for (i = 0; i < num; i++) in test_throughput()
538 for (i = 0; i < num; i++) { in test_throughput()
548 for (i = 0; i < num; i++) in test_throughput()
[all …]
|
| H A D | sds.c | 591 long long num; in sdscatfmt() local
618 num = va_arg(ap,int); in sdscatfmt()
620 num = va_arg(ap,long long); in sdscatfmt()
623 l = sdsll2str(buf,num); in sdscatfmt()
|
| /redis-3.2.3/tests/unit/ |
| H A D | sort.tcl | 8 proc create_random_dataset {num cmd} {
13 for {set i 0} {$i < $num} {incr i} {
31 for {set i 0} {$i < $num} {incr i} {
37 foreach {num cmd enc title} {
45 set result [create_random_dataset $num $cmd]
245 r sort mylist by num get x:*->
267 set num 100
268 set res [create_random_dataset $num lpush]
270 test "SORT speed, $num element list BY key, 100 times" {
294 test "SORT speed, $num element list directly, 100 times" {
[all …]
|
| H A D | bitops.tcl | 56 catch {unset num}
58 incr num
59 test "BITCOUNT against test vector #$num" {
|
| /redis-3.2.3/src/ |
| H A D | db.c | 1112 int i, num, *keys; in zunionInterGetKeys() local
1115 num = atoi(argv[2]->ptr); in zunionInterGetKeys()
1118 if (num > (argc-3)) { in zunionInterGetKeys()
1132 keys[num] = 1; in zunionInterGetKeys()
1141 int i, num, *keys; in evalGetKeys() local
1144 num = atoi(argv[2]->ptr); in evalGetKeys()
1147 if (num > (argc-3)) { in evalGetKeys()
1153 *numkeys = num; in evalGetKeys()
1172 num = 0; in sortGetKeys()
1216 num = 1; in migrateGetKeys()
[all …]
|
| H A D | quicklist.c | 2243 char num[32]; in quicklistTest() local
2247 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
2407 char num[32]; in quicklistTest() local
2411 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
2434 char num[32]; in quicklistTest() local
2438 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
2466 char num[32]; in quicklistTest() local
2470 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
2515 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
2544 int sz = ll2string(num, sizeof(num), nums[i]); in quicklistTest()
[all …]
|
| H A D | bio.h | 34 void bioWaitPendingJobsLE(int type, unsigned long long num);
|
| H A D | ziplist.h | 46 unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
|
| H A D | ziplist.c | 526 static unsigned char *__ziplistDelete(unsigned char *zl, unsigned char *p, unsigned int num) { in __ziplistDelete() argument
533 for (i = 0; p[0] != ZIP_END && i < num; i++) { in __ziplistDelete()
909 unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num) { in ziplistDeleteRange() argument
911 return (p == NULL) ? zl : __ziplistDelete(zl,p,num); in ziplistDeleteRange()
1119 static void stress(int pos, int num, int maxsize, int dnum) { in stress() argument
1132 for (k = 0; k < num; k++) { in stress()
1137 i,intrev32ifbe(ZIPLIST_BYTES(zl)),num,posstr[pos],usec()-start); in stress()
|
| H A D | intset.c | 462 long num = 100000, size = 10000; in intsetTest() local
469 for (i = 0; i < num; i++) intsetSearch(is,rand() % ((1<<bits)-1),NULL); in intsetTest()
471 num,size,usec()-start); in intsetTest()
|
| H A D | sds.c | 591 long long num; in sdscatfmt() local
618 num = va_arg(ap,int); in sdscatfmt()
620 num = va_arg(ap,long long); in sdscatfmt()
623 l = sdsll2str(buf,num); in sdscatfmt()
|
| H A D | t_zset.c | 1015 unsigned long num = 0; in zzlDeleteRangeByScore() local
1030 num++; in zzlDeleteRangeByScore()
1037 if (deleted != NULL) *deleted = num; in zzlDeleteRangeByScore()
1043 unsigned long num = 0; in zzlDeleteRangeByLex() local
1057 num++; in zzlDeleteRangeByLex()
1064 if (deleted != NULL) *deleted = num; in zzlDeleteRangeByLex()
1071 unsigned int num = (end-start)+1; in zzlDeleteRangeByRank() local
1072 if (deleted) *deleted = num; in zzlDeleteRangeByRank()
1073 zl = ziplistDeleteRange(zl,2*(start-1),2*num); in zzlDeleteRangeByRank()
|
| H A D | scripting.c | 397 lua_Number num = lua_tonumber(lua,j+1); in luaRedisGenericCommand() local
399 obj_len = snprintf(dbuf,sizeof(dbuf),"%.17g",(double)num); in luaRedisGenericCommand()
2317 int num = atoi(argv[1]); in ldbRepl() local
2318 if (num > 0) around = num; in ldbRepl()
|
| H A D | server.c | 820 unsigned long num, slots; in activeExpireCycle() local
825 if ((num = dictSize(db->expires)) == 0) { in activeExpireCycle()
835 if (num && slots > DICT_HT_INITIAL_SIZE && in activeExpireCycle()
836 (num*100/slots < 1)) break; in activeExpireCycle()
844 if (num > ACTIVE_EXPIRE_CYCLE_LOOKUPS_PER_LOOP) in activeExpireCycle()
845 num = ACTIVE_EXPIRE_CYCLE_LOOKUPS_PER_LOOP; in activeExpireCycle()
847 while (num--) { in activeExpireCycle()
|
| /redis-3.2.3/deps/lua/src/ |
| H A D | fpconv.c | 174 int fpconv_g_fmt(char *str, double num, int precision) in fpconv_g_fmt() argument
185 return snprintf(str, FPCONV_G_FMT_BUFSIZE, fmt, num); in fpconv_g_fmt()
188 len = snprintf(buf, FPCONV_G_FMT_BUFSIZE, fmt, num); in fpconv_g_fmt()
|
| H A D | lua_cjson.c | 591 double num = lua_tonumber(l, lindex); in json_append_number() local
596 if (isinf(num) || isnan(num)) in json_append_number()
601 if (isnan(num)) { in json_append_number()
607 if (isinf(num) || isnan(num)) { in json_append_number()
614 len = fpconv_g_fmt(strbuf_empty_ptr(json), num, cfg->encode_number_precision); in json_append_number()
|
| H A D | lvm.c | 36 lua_Number num; in luaV_tonumber() local
38 if (ttisstring(obj) && luaO_str2d(svalue(obj), &num)) { in luaV_tonumber()
39 setnvalue(n, num); in luaV_tonumber()
|
| H A D | lapi.c | 328 lua_Number num = nvalue(o); in lua_tointeger() local
329 lua_number2integer(res, num); in lua_tointeger()
|
| /redis-3.2.3/deps/jemalloc/src/ |
| H A D | zone.c | 24 static void *zone_calloc(malloc_zone_t *zone, size_t num, size_t size);
70 zone_calloc(malloc_zone_t *zone, size_t num, size_t size) in zone_calloc() argument
73 return (je_calloc(num, size)); in zone_calloc()
|
| H A D | jemalloc.c | 353 bootstrap_calloc(size_t num, size_t size) in bootstrap_calloc() argument
357 num_size = num * size; in bootstrap_calloc()
359 assert(num == 0 || size == 0); in bootstrap_calloc()
1619 je_calloc(size_t num, size_t size) in JEMALLOC_ATTR()
1633 num_size = num * size; in JEMALLOC_ATTR()
1635 if (num == 0 || size == 0) in JEMALLOC_ATTR()
1646 } else if (unlikely(((num | size) & (SIZE_T_MAX << (sizeof(size_t) << in JEMALLOC_ATTR()
1647 2))) && (num_size / size != num))) { in JEMALLOC_ATTR()
|
| /redis-3.2.3/deps/jemalloc/bin/ |
| H A D | jeprof.in | 2663 my $num = shift;
2668 return ($num == 0) ? "nan" : (($num > 0) ? "+inf" : "-inf");
2674 my $num = shift;
2677 return sprintf("%d", $num);
2688 return sprintf("%d", $num);
2694 my $num = shift;
2695 if ($num == 0) {
2698 return Unparse($num);
2704 my $num = shift;
2705 if ($num == 0) {
[all …]
|
| /redis-3.2.3/deps/jemalloc/include/jemalloc/ |
| H A D | jemalloc_protos.h.in | 14 void JEMALLOC_NOTHROW *@je_@calloc(size_t num, size_t size)
|
| /redis-3.2.3/tests/unit/type/ |
| H A D | list.tcl | 537 foreach {type num} {quicklist 250 quicklist 500} {
557 for {set i 0} {$i < $num} {incr i} {
687 foreach {type num} {quicklist 250 quicklist 500} {
691 for {set i 0} {$i < $num} {incr i} {
|
| /redis-3.2.3/deps/jemalloc/include/jemalloc/internal/ |
| H A D | jemalloc_internal.h.in | 448 void *bootstrap_calloc(size_t num, size_t size);
|