| /redis-3.2.3/deps/jemalloc/src/ |
| H A D | ckh.c | 93 const void *data) in ckh_try_bucket_insert() argument 108 cell->data = data; in ckh_try_bucket_insert() 134 data = *argdata; in ckh_evict_reloc_insert() 150 cell->key = key; cell->data = data; in ckh_evict_reloc_insert() 183 *argdata = data; in ckh_evict_reloc_insert() 233 data = aTab[i].data; in ckh_rebuild() 449 *data = (void *)ckh->tab[i].data; in ckh_iter() 484 void **data) in ckh_remove() argument 494 if (data != NULL) in ckh_remove() 495 *data = (void *)ckh->tab[cell].data; in ckh_remove() [all …]
|
| /redis-3.2.3/tests/unit/type/ |
| H A D | list-3.tcl | 70 set data [randomInt 65536] 72 set data [randomInt 4294967296] 74 set data [randomInt 18446744073709551616] 76 set data -[randomInt 65536] 77 if {$data eq {-0}} {set data 0} 79 set data -[randomInt 4294967296] 80 if {$data eq {-0}} {set data 0} 82 set data -[randomInt 18446744073709551616] 83 if {$data eq {-0}} {set data 0} 85 lappend l $data [all …]
|
| /redis-3.2.3/deps/jemalloc/test/unit/ |
| H A D | tsd.c | 15 data_t *data = (data_t *)arg; in malloc_tsd_types() local 18 assert_x_eq(*data, THREAD_DATA, in malloc_tsd_types() 28 switch (*data) { in malloc_tsd_types() 30 *data = 1; in malloc_tsd_types() 31 data_tsd_set(data); in malloc_tsd_types() 34 *data = 2; in malloc_tsd_types() 35 data_tsd_set(data); in malloc_tsd_types()
|
| H A D | rb.c | 110 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb() argument 112 unsigned *i = (unsigned *)data; in tree_iterate_cb() 194 remove_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_iterate_cb() argument 196 unsigned *nnodes = (unsigned *)data; in remove_iterate_cb() 205 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_reverse_iterate_cb() argument 207 unsigned *nnodes = (unsigned *)data; in remove_reverse_iterate_cb()
|
| /redis-3.2.3/tests/unit/ |
| H A D | aofrw.tcl | 86 set data [randstring 0 16 alpha] 88 set data [randomInt 4000000000] 90 r lpush key $data 112 set data [randstring 0 16 alpha] 114 set data [randomInt 4000000000] 116 r sadd key $data 140 set data [randstring 0 16 alpha] 142 set data [randomInt 4000000000] 144 r hset key $data $data 168 set data [randomInt 4000000000] [all …]
|
| /redis-3.2.3/tests/ |
| H A D | test_helper.tcl | 249 foreach {status data} $payload break 254 puts "\[$status\]: $data" 270 set ::active_clients_task($fd) "(OK) $data" 272 set err "\[[colorstr red $status]\]: $data" 277 puts "\[[colorstr red $status]\]: $data" 284 lappend ::active_servers $data 289 puts "\[$status\]: $data" 378 foreach {cmd data} $payload break 380 execute_tests $data 387 proc send_data_packet {fd status data} { argument [all …]
|
| /redis-3.2.3/deps/jemalloc/include/jemalloc/internal/ |
| H A D | ckh.h | 29 const void *data; member 73 bool ckh_iter(ckh_t *ckh, size_t *tabind, void **key, void **data); 74 bool ckh_insert(tsd_t *tsd, ckh_t *ckh, const void *key, const void *data); 76 void **data); 77 bool ckh_search(ckh_t *ckh, const void *seachkey, void **key, void **data);
|
| H A D | hash.h | 91 const uint8_t *data = (const uint8_t *) key; in hash_x86_32() local 101 const uint32_t *blocks = (const uint32_t *) (data + nblocks*4); in hash_x86_32() 119 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); in hash_x86_32() 143 const uint8_t * data = (const uint8_t *) key; in hash_x86_128() local 158 const uint32_t *blocks = (const uint32_t *) (data + nblocks*16); in hash_x86_128() 191 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); in hash_x86_128() 245 const uint8_t *data = (const uint8_t *) key; in hash_x64_128() local 256 const uint64_t *blocks = (const uint64_t *) (data); in hash_x64_128() 277 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); in hash_x64_128()
|
| /redis-3.2.3/ |
| H A D | MANIFESTO | 8 that manipulates abstract data types and implemented as a TCP daemon. 10 values are different kinds of abstract data types. Every data type 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 14 support, but also the space and time complexity of the data type and the 17 2 - Memory storage is #1. The Redis data set, composed of defined key-value 22 perform similarly. Complex data types like Redis Sorted Sets are easy to 24 simple. Redis will continue to explore alternative options (where data can 28 3 - Fundamental data structures for a fundamental API. The Redis API is a direct 29 consequence of fundamental data structures. APIs can often be arbitrary but [all …]
|
| H A D | README.md | 6 …data structures* server. What this means is that Redis provides access to mutable data structures … 11 …ntation of data structures stress on memory efficiency, so data structures inside Redis will likel… 14 …just SETs and GETs, but operations to work with complex data types like Lists, Sets, ordered data … 18 * Introduction to Redis data types. http://redis.io/topics/data-types-intro
|
| /redis-3.2.3/deps/hiredis/adapters/ |
| H A D | libev.h | 52 redisLibevEvents *e = (redisLibevEvents*)watcher->data; in redisLibevReadEvent() 62 redisLibevEvents *e = (redisLibevEvents*)watcher->data; in redisLibevWriteEvent() 118 if (ac->ev.data != NULL) in redisLibevAttach() 130 e->rev.data = e; in redisLibevAttach() 131 e->wev.data = e; in redisLibevAttach() 139 ac->ev.data = e; in redisLibevAttach()
|
| H A D | libuv.h | 17 redisLibuvEvents* p = (redisLibuvEvents*)handle->data; in redisLibuvPoll() 77 redisLibuvEvents* p = (redisLibuvEvents*)handle->data; in on_close() 93 if (ac->ev.data != NULL) { in redisLibuvAttach() 115 ac->ev.data = p; in redisLibuvAttach() 116 p->handle.data = p; in redisLibuvAttach()
|
| H A D | libevent.h | 86 if (ac->ev.data != NULL) in redisLibeventAttach() 99 ac->ev.data = e; in redisLibeventAttach()
|
| /redis-3.2.3/deps/lua/src/ |
| H A D | lzio.c | 26 buff = z->reader(L, z->data, &size); in luaZ_fill() 48 void luaZ_init (lua_State *L, ZIO *z, lua_Reader reader, void *data) { in luaZ_init() argument 51 z->data = data; in luaZ_init()
|
| H A D | lua_struct.c | 297 const char *data = luaL_checklstring(L, 2, &ld); in b_unpack() local 311 lua_Number res = getinteger(data+pos, h.endian, issigned, size); in b_unpack() 320 memcpy(&f, data+pos, size); in b_unpack() 327 memcpy(&d, data+pos, size); in b_unpack() 340 lua_pushlstring(L, data+pos, size); in b_unpack() 344 const char *e = (const char *)memchr(data+pos, '\0', ld - pos); in b_unpack() 347 size = (e - (data+pos)) + 1; in b_unpack() 348 lua_pushlstring(L, data+pos, size - 1); in b_unpack()
|
| H A D | ldump.c | 21 void* data; member 34 D->status=(*D->writer)(D->L,b,size,D->data); in DumpBlock() 153 int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) in luaU_dump() argument 158 D.data=data; in luaU_dump()
|
| H A D | lzio.h | 48 void *data); 60 void* data; /* additional data */ member
|
| /redis-3.2.3/src/ |
| H A D | quicklist.h | 138 int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data, 152 int quicklistPopCustom(quicklist *quicklist, int where, unsigned char **data, 154 void *(*saver)(unsigned char *data, unsigned int sz)); 155 int quicklistPop(quicklist *quicklist, int where, unsigned char **data, 159 size_t quicklistGetLzf(const quicklistNode *node, void **data);
|
| H A D | hyperloglog.c | 400 while(data != end) { in MurmurHash64A() 404 k = *((uint64_t*)data); in MurmurHash64A() 406 k = (uint64_t) data[0]; in MurmurHash64A() 407 k |= (uint64_t) data[1] << 8; in MurmurHash64A() 408 k |= (uint64_t) data[2] << 16; in MurmurHash64A() 409 k |= (uint64_t) data[3] << 24; in MurmurHash64A() 410 k |= (uint64_t) data[4] << 32; in MurmurHash64A() 411 k |= (uint64_t) data[5] << 40; in MurmurHash64A() 412 k |= (uint64_t) data[6] << 48; in MurmurHash64A() 421 data += 8; in MurmurHash64A() [all …]
|
| H A D | quicklist.c | 255 *data = lzf->compressed; in quicklistGetLzf() 1336 if (data) in quicklistPopCustom() 1337 *data = NULL; in quicklistPopCustom() 1355 if (data) in quicklistPopCustom() 1360 if (data) in quicklistPopCustom() 1361 *data = NULL; in quicklistPopCustom() 1374 if (data) { in _quicklistSaver() 1394 if (data) in quicklistPop() 1395 *data = vstr; in quicklistPop() 1773 zfree(data); in quicklistTest() [all …]
|
| H A D | ae_epoll.c | 85 ee.data.fd = fd; in aeApiAddEvent() 98 ee.data.fd = fd; in aeApiDelEvent() 126 eventLoop->fired[j].fd = e->data.fd; in aeApiPoll()
|
| H A D | redis-benchmark.c | 650 char *data, *cmd; in main() local 719 data = zmalloc(config.datasize+1); in main() 721 memset(data,'x',config.datasize); in main() 722 data[config.datasize] = '\0'; in main() 734 len = redisFormatCommand(&cmd,"SET key:__rand_int__ %s",data); in main() 752 len = redisFormatCommand(&cmd,"LPUSH mylist %s",data); in main() 758 len = redisFormatCommand(&cmd,"RPUSH mylist %s",data); in main() 794 len = redisFormatCommand(&cmd,"LPUSH mylist %s",data); in main() 828 argv[i+1] = data; in main()
|
| /redis-3.2.3/tests/cluster/tests/ |
| H A D | 09-pubsub.tcl | 19 set data [randomValue] 20 R $instance PUBLISH testchannel $data 26 assert {$data eq [lindex $msg 2]}
|
| /redis-3.2.3/deps/lua/etc/ |
| H A D | noparser.c | 37 LUAI_FUNC int luaU_dump (lua_State* L, const Proto* f, lua_Writer w, void* data, int strip) { in luaU_dump() argument 40 UNUSED(data); in luaU_dump()
|
| /redis-3.2.3/deps/hiredis/ |
| H A D | async.h | 70 void *data; member 74 void *data; member
|