Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 38) sorted by relevance

12

/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Dextent.h100 return (node->en_arena); in extent_node_arena_get()
107 return (node->en_addr); in extent_node_addr_get()
114 return (node->en_size); in extent_node_size_get()
121 return (node->en_zeroed); in extent_node_zeroed_get()
128 assert(!node->en_achunk); in extent_node_committed_get()
136 return (node->en_achunk); in extent_node_achunk_get()
150 node->en_arena = arena; in extent_node_arena_set()
157 node->en_addr = addr; in extent_node_addr_set()
164 node->en_size = size; in extent_node_size_set()
171 node->en_zeroed = zeroed; in extent_node_zeroed_set()
[all …]
H A Drb.h464 a_type *node; \
471 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
481 pathp->node = node; \
532 a_type *node; \
539 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
560 assert(nodep->node == node); \
562 if (pathp->node != node) { \
578 nodep->node = pathp->node; \
579 pathp->node = node; \
585 nodep->node); \
[all …]
H A Drtree.h113 bool rtree_node_valid(rtree_node_elm_t *node);
153 rtree_node_valid(rtree_node_elm_t *node) in rtree_node_valid() argument
239 rtree_node_elm_t *node, *child; in rtree_get() local
244 /**/; i++, node = child) { in rtree_get()
253 return (rtree_val_read(rtree, &node[subkey], in rtree_get()
257 child = rtree_child_tryread(&node[subkey]); in rtree_get()
267 rtree_node_elm_t *node, *child; in rtree_set() local
271 node = rtree_subtree_read(rtree, start_level); in rtree_set()
272 if (node == NULL) in rtree_set()
274 for (i = start_level; /**/; i++, node = child) { in rtree_set()
[all …]
H A Dctl.h19 struct ctl_node_s node; member
29 struct ctl_node_s node; member
H A Dchunk.h55 bool chunk_register(const void *chunk, const extent_node_t *node);
56 void chunk_deregister(const void *chunk, const extent_node_t *node);
H A Darena.h177 extent_node_t node; member
431 void arena_chunk_cache_maybe_insert(arena_t *arena, extent_node_t *node,
433 void arena_chunk_cache_maybe_remove(arena_t *arena, extent_node_t *node,
436 void arena_node_dalloc(arena_t *arena, extent_node_t *node);
961 arena = extent_node_arena_get(&chunk->node); in arena_ptr_small_binind_get()
1198 return (extent_node_arena_get(&chunk->node)); in arena_aalloc()
1274 &chunk->node), chunk, ptr, pageind); in arena_dalloc()
1289 &chunk->node), chunk, ptr); in arena_dalloc()
1327 &chunk->node), chunk, ptr, pageind); in arena_sdalloc()
1337 &chunk->node), chunk, ptr); in arena_sdalloc()
/redis-3.2.3/src/
H A Dadlist.c82 listNode *node; in listAddNodeHead() local
84 if ((node = zmalloc(sizeof(*node))) == NULL) in listAddNodeHead()
89 node->prev = node->next = NULL; in listAddNodeHead()
110 if ((node = zmalloc(sizeof(*node))) == NULL) in listAddNodeTail()
115 node->prev = node->next = NULL; in listAddNodeTail()
129 if ((node = zmalloc(sizeof(*node))) == NULL) in listInsertNode()
146 node->prev->next = node; in listInsertNode()
149 node->next->prev = node; in listInsertNode()
162 node->prev->next = node->next; in listDelNode()
166 node->next->prev = node->prev; in listDelNode()
[all …]
H A Dquicklist.c140 node = zmalloc(sizeof(*node)); in quicklistCreateNode()
144 node->next = node->prev = NULL; in quicklistCreateNode()
279 if (h != node && t != node) in __quicklistCompress()
289 if (h != node && hn != node && t != node && tp != node) { in __quicklistCompress()
529 node->count = ziplistLen(node->zl); in quicklistAppendZiplist()
582 node->next->prev = node->prev; in __quicklistDelNode()
584 node->prev->next = node->next; in __quicklistDelNode()
617 node->zl = ziplistDelete(node->zl, p); in quicklistDelIndex()
817 node->count = ziplistLen(node->zl); in _quicklistSplitNode()
836 quicklistNode *node = entry->node; in _quicklistInsert() local
[all …]
H A Dcluster.c552 link->node = node; in createClusterLink()
654 clusterNode *node = zmalloc(sizeof(*node)); in createClusterNode() local
663 memset(node->slots,0,sizeof(node->slots)); in createClusterNode()
668 node->ping_sent = node->pong_received = 0; in createClusterNode()
671 memset(node->ip,0,sizeof(node->ip)); in createClusterNode()
1187 if (nodeIsSlave(node) || node->numslots == 0) { in clearNodeFailureIfNeeded()
1200 if (nodeIsMaster(node) && node->numslots > 0 && in clearNodeFailureIfNeeded()
1400 if (node->link) freeClusterLink(node->link); in nodeUpdateAddressIfNeeded()
1403 node->name, node->ip, node->port); in nodeUpdateAddressIfNeeded()
1408 replicationSetMaster(node->ip, node->port); in nodeUpdateAddressIfNeeded()
[all …]
H A Dredis-trib.rb309 def add_node(node) argument
310 @nodes << node
752 if node
827 node.assert_cluster
829 add_node(node)
830 node.friends.each{|f|
998 if !node || !node.has_flag?("master")
1287 node.load_info
1289 add_node(node)
1365 if !node
[all …]
H A Dquicklist.h92 quicklistNode *node; member
114 #define quicklistNodeIsCompressed(node) \ argument
115 ((node)->encoding == QUICKLIST_NODE_ENCODING_LZF)
133 void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *node,
135 void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *node,
144 int quicklistNext(quicklistIter *iter, quicklistEntry *node);
159 size_t quicklistGetLzf(const quicklistNode *node, void **data);
H A Ddb.c494 listNode *node, *nextnode; in scanGenericCommand() local
606 node = listFirst(keys); in scanGenericCommand()
607 while (node) { in scanGenericCommand()
608 robj *kobj = listNodeValue(node); in scanGenericCommand()
609 nextnode = listNextNode(node); in scanGenericCommand()
633 listDelNode(keys, node); in scanGenericCommand()
640 node = nextnode; in scanGenericCommand()
645 listDelNode(keys, node); in scanGenericCommand()
648 node = nextnode; in scanGenericCommand()
657 robj *kobj = listNodeValue(node); in scanGenericCommand()
[all …]
H A Dt_zset.c83 decrRefCount(node->obj); in zslFreeNode()
84 zfree(node); in zslFreeNode()
91 while(node) { in zslFree()
92 next = node->level[0].forward; in zslFree()
93 zslFreeNode(node); in zslFree()
94 node = next; in zslFree()
1095 zskiplistNode *node, *next; in zsetConvert() local
1151 while (node) { in zsetConvert()
1157 zslFreeNode(node); in zsetConvert()
1158 node = next; in zsetConvert()
[all …]
H A Dcluster.h45 struct clusterNode *node; /* Node related to this link if any, or NULL */ member
78 struct clusterNode *node; /* Node reporting the failure condition. */ member
/redis-3.2.3/deps/jemalloc/src/
H A Dbase.c20 extent_node_t *node; in base_node_try_alloc() local
24 node = base_nodes; in base_node_try_alloc()
27 return (node); in base_node_try_alloc()
37 base_nodes = node; in base_node_dalloc()
44 extent_node_t *node; in base_chunk_alloc() local
55 if (node != NULL) in base_chunk_alloc()
60 if (node == NULL) { in base_chunk_alloc()
70 return (node); in base_chunk_alloc()
96 if (node != NULL) { in base_alloc()
103 if (node == NULL) { in base_alloc()
[all …]
H A Dhuge.c9 extent_node_t *node; in huge_node_get() local
14 return (node); in huge_node_get()
54 extent_node_t *node; in huge_palloc() local
67 if (node == NULL) in huge_palloc()
133 extent_node_t *node; in huge_ralloc_no_move_similar() local
190 extent_node_t *node; in huge_ralloc_no_move_shrink() local
239 extent_node_t *node; in huge_ralloc_no_move_expand() local
361 extent_node_t *node; in huge_dalloc() local
374 extent_node_addr_get(node), extent_node_size_get(node)); in huge_dalloc()
389 extent_node_t *node; in huge_salloc() local
[all …]
H A Dchunk.c206 extent_node_t *node; in chunk_recycle() local
233 if (node == NULL || (new_addr != NULL && extent_node_size_get(node) < in chunk_recycle()
267 node = NULL; in chunk_recycle()
281 if (node == NULL) { in chunk_recycle()
283 if (node == NULL) { in chunk_recycle()
296 node = NULL; in chunk_recycle()
485 if (node != NULL && extent_node_addr_get(node) == in chunk_record()
488 extent_node_addr_get(node), extent_node_size_get(node), false, in chunk_record()
498 extent_node_size_set(node, size + extent_node_size_get(node)); in chunk_record()
499 extent_node_zeroed_set(node, extent_node_zeroed_get(node) && in chunk_record()
[all …]
H A Drtree.c63 rtree_delete_subtree(rtree_t *rtree, rtree_node_elm_t *node, unsigned level) in rtree_delete_subtree() argument
71 rtree_node_elm_t *child = node[i].child; in rtree_delete_subtree()
76 rtree->dalloc(node); in rtree_delete_subtree()
94 rtree_node_elm_t *node; in rtree_node_init() local
103 node = atomic_read_p((void **)elmp); in rtree_node_init()
104 } while (node == RTREE_NODE_INITIALIZING); in rtree_node_init()
106 node = rtree->alloc(ZU(1) << rtree->levels[level].bits); in rtree_node_init()
107 if (node == NULL) in rtree_node_init()
109 atomic_write_p((void **)elmp, node); in rtree_node_init()
112 return (node); in rtree_node_init()
H A Dctl.c23 return ((node->named) ? (const ctl_named_node_t *)node : NULL); in ctl_named_node()
38 return (!node->named ? (const ctl_indexed_node_t *)node : NULL); in ctl_indexed_node()
818 assert(node); in ctl_lookup()
829 node = child; in ctl_lookup()
837 if (node == pnode) { in ctl_lookup()
854 if (node == NULL) { in ctl_lookup()
917 if (node != NULL && node->ctl) in ctl_byname()
959 assert(node); in ctl_bymib()
967 node = ctl_named_children(node, mib[i]); in ctl_bymib()
974 if (node == NULL) { in ctl_bymib()
[all …]
H A Dtcache.c106 arena_t *bin_arena = extent_node_arena_get(&chunk->node); in tcache_bin_flush_small()
128 if (extent_node_arena_get(&chunk->node) == bin_arena) { in tcache_bin_flush_small()
186 arena_t *locked_arena = extent_node_arena_get(&chunk->node); in tcache_bin_flush_large()
212 if (extent_node_arena_get(&chunk->node) == in tcache_bin_flush_large()
/redis-3.2.3/deps/jemalloc/test/unit/
H A Drb.c78 if (!rbtn_red_get(node_t, link, node)) in tree_recurse()
89 if (node == nil) in tree_recurse()
119 assert_ptr_eq(search_node, node, in tree_iterate_cb()
124 assert_ptr_eq(search_node, node, in tree_iterate_cb()
129 assert_ptr_eq(search_node, node, in tree_iterate_cb()
165 tree_remove(tree, node); in node_remove()
181 node->magic = 0; in node_remove()
197 node_t *ret = tree_next(tree, node); in remove_iterate_cb()
199 node_remove(tree, node, *nnodes); in remove_iterate_cb()
208 node_t *ret = tree_prev(tree, node); in remove_reverse_iterate_cb()
[all …]
H A Drtree.c11 node_dalloc(rtree_node_elm_t *node) in node_dalloc() argument
14 free(node); in node_dalloc()
64 extent_node_t node; in TEST_BEGIN() local
71 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
75 &node, "rtree_get() should return " in TEST_BEGIN()
104 extent_node_t node; in TEST_BEGIN() local
113 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
115 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, in TEST_BEGIN()
119 assert_ptr_eq(rtree_get(&rtree, keys[j], true), &node, in TEST_BEGIN()
/redis-3.2.3/tests/cluster/
H A Dcluster.tcl15 set node [dict create \
26 lappend nodes $node
32 proc has_flag {node flag} {
33 expr {[lsearch -exact [dict get $node flags] $flag] != -1}
56 set node [randomInt $n]
/redis-3.2.3/tests/support/
H A Dcluster.tcl111 set node [dict create \
121 dict set nodes $addr $node
135 dict for {addr node} $nodes {
136 foreach slotrange [dict get $node slots] {
153 dict for {addr node} $nodes {
155 [dict get $node link] close
189 set node [dict get $::redis_cluster::nodes($id) $node_addr]
190 set link [dict get $node link]
/redis-3.2.3/deps/lua/src/
H A Dltable.c252 Node *n = &t->node[i]; in numusehash()
275 t->node = cast(Node *, dummynode); /* use common `dummynode' */ in setnodevector()
284 t->node = luaM_newvector(L, size, Node); in setnodevector()
301 Node *nold = t->node; /* save old hash ... */ in resize()
328 int nsize = (t->node == dummynode) ? 0 : sizenode(t); in luaH_resizearray()
367 t->node = cast(Node *, dummynode); in luaH_new()
375 if (t->node != dummynode) in luaH_free()
376 luaM_freearray(L, t->node, sizenode(t), Node); in luaH_free()
383 while (t->lastfree-- > t->node) { in getfreepos()
573 else if (t->node == dummynode) /* hash part is empty? */ in luaH_getn()

12