Home
last modified time | relevance | path

Searched defs:node (Results 1 – 25 of 26) sorted by relevance

12

/redis-3.2.3/deps/jemalloc/include/jemalloc/internal/
H A Dextent.h97 extent_node_arena_get(const extent_node_t *node) in extent_node_arena_get()
104 extent_node_addr_get(const extent_node_t *node) in extent_node_addr_get()
111 extent_node_size_get(const extent_node_t *node) in extent_node_size_get()
118 extent_node_zeroed_get(const extent_node_t *node) in extent_node_zeroed_get()
125 extent_node_committed_get(const extent_node_t *node) in extent_node_committed_get()
133 extent_node_achunk_get(const extent_node_t *node) in extent_node_achunk_get()
140 extent_node_prof_tctx_get(const extent_node_t *node) in extent_node_prof_tctx_get()
154 extent_node_addr_set(extent_node_t *node, void *addr) in extent_node_addr_set()
211 extent_node_dirty_linkage_init(extent_node_t *node) in extent_node_dirty_linkage_init()
219 extent_node_dirty_insert(extent_node_t *node, in extent_node_dirty_insert()
[all …]
H A Drtree.h153 rtree_node_valid(rtree_node_elm_t *node) in rtree_node_valid()
239 rtree_node_elm_t *node, *child; in rtree_get() local
267 rtree_node_elm_t *node, *child; in rtree_set() local
H A Dctl.h19 struct ctl_node_s node; member
29 struct ctl_node_s node; member
H A Djemalloc_internal.h.in960 extent_node_t *node; local
/redis-3.2.3/deps/jemalloc/src/
H A Dhuge.c9 extent_node_t *node; in huge_node_get() local
18 huge_node_set(const void *ptr, extent_node_t *node) in huge_node_set()
27 huge_node_unset(const void *ptr, const extent_node_t *node) in huge_node_unset()
54 extent_node_t *node; in huge_palloc() local
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
389 extent_node_t *node; in huge_salloc() local
405 extent_node_t *node; in huge_prof_tctx_get() local
[all …]
H A Dbase.c20 extent_node_t *node; in base_node_try_alloc() local
32 base_node_dalloc(extent_node_t *node) in base_node_dalloc()
44 extent_node_t *node; in base_chunk_alloc() local
83 extent_node_t *node; in base_alloc() local
H A Drtree.c63 rtree_delete_subtree(rtree_t *rtree, rtree_node_elm_t *node, unsigned level) in rtree_delete_subtree()
94 rtree_node_elm_t *node; in rtree_node_init() local
H A Dchunk.c142 chunk_register(const void *chunk, const extent_node_t *node) in chunk_register()
169 chunk_deregister(const void *chunk, const extent_node_t *node) in chunk_deregister()
206 extent_node_t *node; in chunk_recycle() local
472 extent_node_t *node, *prev; in chunk_record() local
H A Dctl.c20 ctl_named_node(const ctl_node_t *node) in ctl_named_node()
27 ctl_named_children(const ctl_named_node_t *node, int index) in ctl_named_children()
35 ctl_indexed_node(const ctl_node_t *node) in ctl_indexed_node()
806 const ctl_named_node_t *node; in ctl_lookup() local
904 const ctl_named_node_t *node; in ctl_byname() local
948 const ctl_named_node_t *node; in ctl_bymib() local
H A Darena.c262 arena_chunk_dirty_npages(const extent_node_t *node) in arena_chunk_dirty_npages()
269 arena_chunk_cache_maybe_insert(arena_t *arena, extent_node_t *node, bool cache) in arena_chunk_cache_maybe_insert()
281 arena_chunk_cache_maybe_remove(arena_t *arena, extent_node_t *node, bool dirty) in arena_chunk_cache_maybe_remove()
852 extent_node_t *node; in arena_node_alloc() local
866 arena_node_dalloc(arena_t *arena, extent_node_t *node) in arena_node_dalloc()
/redis-3.2.3/src/
H A Dadlist.c82 listNode *node; in listAddNodeHead() local
108 listNode *node; in listAddNodeTail() local
127 listNode *node; in listInsertNode() local
159 void listDelNode(list *list, listNode *node) in listDelNode()
246 listNode *node; in listDup() local
285 listNode *node; in listSearchKey() local
H A Dcluster.c511 clusterNode *node = dictGetVal(de); in clusterReset() local
844 int clusterAddNode(clusterNode *node) { in clusterAddNode()
881 clusterNode *node = dictGetVal(de); in clusterDelNode() local
933 clusterNode *node = dictGetVal(de); in clusterGetMaxEpoch() local
1221 clusterNode *node = dictGetVal(de); in clusterHandshakeInProgress() local
1300 clusterNode *node; in clusterProcessGossipSection() local
1665 clusterNode *node; in clusterProcessPacket() local
2104 clusterNode *node = dictGetVal(de); in clusterBroadcastMessage() local
2315 clusterNode *node = dictGetVal(de); in clusterBroadcastPong() local
2928 clusterNode *node = dictGetVal(de); in clusterHandleSlaveMigration() local
[all …]
H A Dquicklist.c139 quicklistNode *node; in quicklistCreateNode() local
266 quicklistNode *node) { in __quicklistCompress()
488 quicklistNode *node = quicklistCreateNode(); in quicklistPushHead() local
511 quicklistNode *node = quicklistCreateNode(); in quicklistPushTail() local
526 quicklistNode *node = quicklistCreateNode(); in quicklistAppendZiplist() local
836 quicklistNode *node = entry->node; in _quicklistInsert() local
979 quicklistNode *node = entry.node; in quicklistDelRange() local
1193 quicklistNode *node = quicklistCreateNode(); in quicklistDup() local
1343 quicklistNode *node; in quicklistPopCustom() local
1571 quicklistNode *node = ql->head; in _ql_verify() local
[all …]
H A Dquicklist.h92 quicklistNode *node; member
114 #define quicklistNodeIsCompressed(node) \ argument
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
H A Dredis-trib.rb309 def add_node(node) argument
H A Dt_zset.c82 void zslFreeNode(zskiplistNode *node) { in zslFreeNode()
88 zskiplistNode *node = zsl->header->level[0].forward, *next; in zslFree() local
1095 zskiplistNode *node, *next; in zsetConvert() local
1615 zskiplistNode *node; member
H A Ddebug.c393 for (quicklistNode *node = ql->head; node; node = node->next) { in debugCommand() local
H A Ddb.c494 listNode *node, *nextnode; in scanGenericCommand() local
H A Dnetworking.c442 void setDeferredMultiBulkLength(client *c, void *node, long length) { in setDeferredMultiBulkLength()
H A Drdb.c582 quicklistNode *node = ql->head; in rdbSaveObject() local
/redis-3.2.3/deps/jemalloc/test/unit/
H A Drtree.c11 node_dalloc(rtree_node_elm_t *node) in node_dalloc()
64 extent_node_t node; in TEST_BEGIN() local
104 extent_node_t node; in TEST_BEGIN() local
H A Drb.c71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth, in tree_recurse()
110 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb()
160 node_remove(tree_t *tree, node_t *node, unsigned nnodes) in node_remove()
194 remove_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_iterate_cb()
205 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_reverse_iterate_cb()
/redis-3.2.3/deps/lua/src/
H A Dlcode.c131 static int patchtestreg (FuncState *fs, int node, int reg) { in patchtestreg()
H A Dlobject.h344 Node *node; member

12