| /redis-3.2.3/src/ |
| H A D | adlist.c | 91 node->prev = NULL; in listAddNodeHead()
93 list->head->prev = node; in listAddNodeHead()
117 node->prev = list->tail; in listAddNodeTail()
133 node->prev = old_node; in listInsertNode()
140 node->prev = old_node->prev; in listInsertNode()
145 if (node->prev != NULL) { in listInsertNode()
161 if (node->prev) in listDelNode()
166 node->next->prev = node->prev; in listDelNode()
328 list->tail = tail->prev; in listRotate()
331 list->head->prev = tail; in listRotate()
[all …]
|
| H A D | quicklist.c | 284 quicklistNode *t = quicklist->tail, *tp = t->prev, *tpp = tp->prev; in __quicklistCompress()
368 new_node->prev = old_node->prev; in __quicklistInsertNode()
369 if (old_node->prev) in __quicklistInsertNode()
582 node->next->prev = node->prev; in __quicklistDelNode()
583 if (node->prev) in __quicklistDelNode()
635 quicklistNode *prev = entry->node->prev; in quicklistDelEntry() local
739 if (center->prev) { in _quicklistMergeNodes()
740 prev = center->prev; in _quicklistMergeNodes()
741 if (center->prev->prev) in _quicklistMergeNodes()
742 prev_prev = center->prev->prev; in _quicklistMergeNodes()
[all …]
|
| H A D | adlist.h | 37 struct listNode *prev; member
60 #define listPrevNode(n) ((n)->prev)
|
| H A D | ae.c | 264 aeTimeEvent *te, *prev; in processTimeEvents() local
285 prev = NULL; in processTimeEvents()
295 if (prev == NULL) in processTimeEvents()
298 prev->next = te->next; in processTimeEvents()
330 prev = te; in processTimeEvents()
|
| H A D | latency.c | 101 int prev; in latencyAddSample() local
114 prev = (ts->idx + LATENCY_TS_LEN - 1) % LATENCY_TS_LEN; in latencyAddSample()
115 if (ts->samples[prev].time == now) { in latencyAddSample()
116 if (latency > ts->samples[prev].latency) in latencyAddSample()
117 ts->samples[prev].latency = latency; in latencyAddSample()
|
| H A D | quicklist.h | 45 struct quicklistNode *prev; member
|
| H A D | hyperloglog.c | 640 uint8_t oldcount, count, *sparse, *end, *p, *prev, *next; in hllSparseAdd() local
664 prev = NULL; /* Points to previos opcode at the end of the loop. */ in hllSparseAdd()
686 prev = p; in hllSparseAdd()
831 p = prev ? prev : sparse; in hllSparseAdd()
|
| /redis-3.2.3/deps/lua/src/ |
| H A D | lfunc.c | 73 uv->u.l.prev = &g->uvhead; /* double link it in `uvhead' list */ in luaF_findupval()
75 uv->u.l.next->u.l.prev = uv; in luaF_findupval()
77 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in luaF_findupval()
83 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in unlinkupval()
84 uv->u.l.next->u.l.prev = uv->u.l.prev; /* remove from `uvhead' list */ in unlinkupval()
85 uv->u.l.prev->u.l.next = uv->u.l.next; in unlinkupval()
|
| H A D | lparser.h | 61 struct FuncState *prev; /* enclosing function */ member
|
| H A D | lparser.c | 238 if (singlevaraux(fs->prev, n, var, 0) == VGLOBAL) in singlevaraux()
332 fs->prev = ls->fs; /* linked list of funcstates */ in open_func()
376 ls->fs = fs->prev; in close_func()
394 lua_assert(funcstate.prev == NULL); in luaY_parser()
897 struct LHS_assign *prev; member
912 for (; lh; lh = lh->prev) { in check_conflict()
937 nv.prev = lh; in assignment()
1232 v.prev = NULL; in exprstat()
|
| H A D | lstate.c | 160 g->uvhead.u.l.prev = &g->uvhead; in lua_newstate()
|
| H A D | lobject.h | 280 struct UpVal *prev; member
|
| H A D | lgc.c | 518 lua_assert(uv->u.l.next->u.l.prev == uv && uv->u.l.prev->u.l.next == uv); in remarkupvals()
|
| /redis-3.2.3/deps/jemalloc/src/ |
| H A D | chunk.c | 472 extent_node_t *node, *prev; in chunk_record() local
527 prev = extent_tree_ad_prev(chunks_ad, node); in chunk_record()
528 if (prev != NULL && (void *)((uintptr_t)extent_node_addr_get(prev) + in chunk_record()
529 extent_node_size_get(prev)) == chunk && in chunk_record()
530 extent_node_committed_get(prev) == committed && in chunk_record()
531 !chunk_hooks->merge(extent_node_addr_get(prev), in chunk_record()
538 extent_tree_szad_remove(chunks_szad, prev); in chunk_record()
539 extent_tree_ad_remove(chunks_ad, prev); in chunk_record()
540 arena_chunk_cache_maybe_remove(arena, prev, cache); in chunk_record()
543 extent_node_addr_set(node, extent_node_addr_get(prev)); in chunk_record()
[all …]
|
| /redis-3.2.3/deps/jemalloc/include/jemalloc/internal/ |
| H A D | rb.h | 170 a_prefix##prev(a_rbt_type *rbtree, a_type *node); \
372 a_prefix##prev(a_rbt_type *rbtree, a_type *node) { \
|