Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 42) sorted by relevance

12

/redis-3.2.3/src/
H A Dadlist.c61 listNode *current, *next; in listRelease() local
66 next = current->next; in listRelease()
69 current = next; in listRelease()
118 node->next = NULL; in listAddNodeTail()
134 node->next = old_node->next; in listInsertNode()
148 if (node->next != NULL) { in listInsertNode()
162 node->prev->next = node->next; in listDelNode()
165 if (node->next) in listDelNode()
198 li->next = list->head; in listRewind()
203 li->next = list->tail; in listRewindTail()
[all …]
H A Dae.c217 te->next = eventLoop->timeEventHead; in aeCreateTimeEvent()
230 te = te->next; in aeDeleteTimeEvent()
256 te = te->next; in aeSearchNearestTimer()
280 te = te->next; in processTimeEvents()
294 aeTimeEvent *next = te->next; in processTimeEvents() local
296 eventLoop->timeEventHead = te->next; in processTimeEvents()
298 prev->next = te->next; in processTimeEvents()
302 te = next; in processTimeEvents()
312 te = te->next; in processTimeEvents()
331 te = te->next; in processTimeEvents()
H A Ddict.c264 nextde = de->next; in dictRehash()
430 prevHe->next = he->next; in dictGenericDelete()
442 he = he->next; in dictGenericDelete()
469 nextHe = he->next; in _dictClear()
506 he = he->next; in dictFind()
658 he = he->next; in dictGetRandomKey()
871 de = de->next; in dictScan()
891 de = de->next; in dictScan()
901 de = de->next; in dictScan()
983 he = he->next; in _dictKeyIndex()
[all …]
H A Dquicklist.c162 next = current->next; in quicklistRelease()
170 current = next; in quicklistRelease()
358 new_node->next = old_node->next; in __quicklistInsertNode()
581 if (node->next) in __quicklistDelNode()
584 node->prev->next = node->next; in __quicklistDelNode()
636 quicklistNode *next = entry->node->next; in quicklistDelEntry() local
746 next = center->next; in _quicklistMergeNodes()
747 if (center->next->next) in _quicklistMergeNodes()
748 next_next = center->next->next; in _quicklistMergeNodes()
983 quicklistNode *next = node->next; in quicklistDelRange() local
[all …]
H A Dadlist.h38 struct listNode *next; member
43 listNode *next; member
61 #define listNextNode(n) ((n)->next)
H A Dutil.c306 uint32_t next = length; in ll2string() local
307 dst[next] = '\0'; in ll2string()
308 next--; in ll2string()
312 dst[next] = digits[i + 1]; in ll2string()
313 dst[next - 1] = digits[i]; in ll2string()
314 next -= 2; in ll2string()
319 dst[next] = '0' + (uint32_t) value; in ll2string()
322 dst[next] = digits[i + 1]; in ll2string()
323 dst[next - 1] = digits[i]; in ll2string()
H A Drand.c69 static void next(void);
72 next(); in redisLrand48()
80 static void next(void) { in next() function
H A Dt_string.c104 robj *next = (j == c->argc-1) ? NULL : c->argv[j+1]; in setCommand() local
118 !(flags & OBJ_SET_PX) && next) in setCommand()
122 expire = next; in setCommand()
126 !(flags & OBJ_SET_EX) && next) in setCommand()
130 expire = next; in setCommand()
H A Dhyperloglog.c640 uint8_t oldcount, count, *sparse, *end, *p, *prev, *next; in hllSparseAdd() local
665 next = NULL; /* Points to the next opcode at the end of the loop. */ in hllSparseAdd()
692 next = HLL_SPARSE_IS_XZERO(p) ? p+2 : p+1; in hllSparseAdd()
693 if (next >= end) next = NULL; in hllSparseAdd()
820 if (deltalen && next) memmove(next+deltalen,next,end-next); in hllSparseAdd()
H A Dsds.c589 char next, *str; in sdscatfmt() local
601 next = *(f+1); in sdscatfmt()
603 switch(next) { in sdscatfmt()
607 l = (next == 's') ? strlen(str) : sdslen(str); in sdscatfmt()
617 if (next == 'i') in sdscatfmt()
634 if (next == 'u') in sdscatfmt()
650 s[i++] = next; in sdscatfmt()
H A Dziplist.c468 zlentry cur, next; in __ziplistCascadeUpdate() local
477 zipEntry(p+rawlen, &next); in __ziplistCascadeUpdate()
480 if (next.prevrawlen == rawlen) break; in __ziplistCascadeUpdate()
482 if (next.prevrawlensize < rawlensize) { in __ziplistCascadeUpdate()
486 extra = rawlensize-next.prevrawlensize; in __ziplistCascadeUpdate()
502 np+next.prevrawlensize, in __ziplistCascadeUpdate()
503 curlen-noffset-next.prevrawlensize-1); in __ziplistCascadeUpdate()
510 if (next.prevrawlensize > rawlensize) { in __ziplistCascadeUpdate()
H A Dae.h80 struct aeTimeEvent *next; member
H A Dnetworking.c444 robj *len, *next; in setDeferredMultiBulkLength() local
453 if (ln->next != NULL) { in setDeferredMultiBulkLength()
454 next = listNodeValue(ln->next); in setDeferredMultiBulkLength()
457 if (next->ptr != NULL) { in setDeferredMultiBulkLength()
459 c->reply_bytes -= getStringObjectSdsUsedMemory(next); in setDeferredMultiBulkLength()
460 len->ptr = sdscatlen(len->ptr,next->ptr,sdslen(next->ptr)); in setDeferredMultiBulkLength()
462 listDelNode(c->reply,ln->next); in setDeferredMultiBulkLength()
/redis-3.2.3/deps/lua/src/
H A Dllex.c268 else next(ls); in read_long_string()
321 next(ls); in read_string()
344 next(ls); in llex()
347 next(ls); in llex()
359 next(ls); in llex()
372 next(ls); in llex()
377 next(ls); in llex()
382 next(ls); in llex()
387 next(ls); in llex()
415 next(ls); in llex()
[all …]
H A Dlfunc.c65 pp = &p->next; in luaF_findupval()
71 uv->next = *pp; /* chain it in the proper position */ in luaF_findupval()
74 uv->u.l.next = g->uvhead.u.l.next; in luaF_findupval()
75 uv->u.l.next->u.l.prev = uv; in luaF_findupval()
76 g->uvhead.u.l.next = 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()
102 L->openupval = uv->next; /* remove from `open' list */ in luaF_close()
H A Dlstring.c35 GCObject *next = p->gch.next; /* save next */ in luaS_resize() local
39 p->gch.next = newhash[h1]; /* chain it */ in luaS_resize()
41 p = next; in luaS_resize()
66 ts->tsv.next = tb->hash[h]; /* chain new entry */ in newlstr()
84 o = o->gch.next) { in luaS_newlstr()
107 u->uv.next = G(L)->mainthread->next; in luaS_newudata()
108 G(L)->mainthread->next = obj2gco(u); in luaS_newudata()
H A Dlgc.c119 u = u->gch.next; in marktmu()
138 p = &curr->gch.next; in luaC_separateudata()
143 *p = curr->gch.next; in luaC_separateudata()
148 curr->gch.next = g->tmudata->gch.next; in luaC_separateudata()
417 p = &curr->gch.next; in sweeplist()
421 *p = curr->gch.next; in sweeplist()
454 g->tmudata->gch.next = udata->uv.next; in GCTM()
455 udata->uv.next = g->mainthread->next; /* return it to `root' list */ in GCTM()
456 g->mainthread->next = o; in GCTM()
517 for (uv = g->uvhead.u.l.next; uv != &g->uvhead; uv = uv->u.l.next) { in remarkupvals()
[all …]
H A Dlobject.h43 #define CommonHeader GCObject *next; lu_byte tt; lu_byte marked
281 struct UpVal *next; member
326 struct Node *next; /* for chaining */ member
H A Dltable.h16 #define gnext(n) ((n)->i_key.nk.next)
H A Dlstate.c151 L->next = NULL; in lua_newstate()
161 g->uvhead.u.l.next = &g->uvhead; in lua_newstate()
/redis-3.2.3/deps/hiredis/
H A Ddict.c116 nextHe = he->next; in dictExpand()
119 he->next = n.table[h]; in dictExpand()
146 entry->next = ht->table[index]; in dictAdd()
196 prevde->next = de->next; in dictDelete()
198 ht->table[h] = de->next; in dictDelete()
207 de = de->next; in dictDelete()
222 nextHe = he->next; in _dictClear()
253 he = he->next; in dictFind()
281 iter->nextEntry = iter->entry->next; in dictNext()
334 he = he->next; in _dictKeyIndex()
H A Dsds.c589 char next, *str; in sdscatfmt() local
601 next = *(f+1); in sdscatfmt()
603 switch(next) { in sdscatfmt()
607 l = (next == 's') ? strlen(str) : sdslen(str); in sdscatfmt()
617 if (next == 'i') in sdscatfmt()
634 if (next == 'u') in sdscatfmt()
650 s[i++] = next; in sdscatfmt()
H A Dasync.h46 struct redisCallback *next; /* simple singly linked list */ member
/redis-3.2.3/deps/lua/test/
H A Dlife.lua39 function _CELLS:evolve(next)
47 next[y][x] = ((sum==2) and self[y][x]) or ((sum==3) and 1) or 0
/redis-3.2.3/deps/jemalloc/src/
H A Dprof.c1201 prof_tctx_t *next; in prof_gctx_finish() local
1203 next = NULL; in prof_gctx_finish()
1206 tctx_tree_iter(&gctx->tctxs, next, in prof_gctx_finish()
1209 next = tctx_tree_next(&gctx->tctxs, in prof_gctx_finish()
1216 next = NULL; in prof_gctx_finish()
1217 } while (next != NULL); in prof_gctx_finish()
1864 prof_tdata_t *next; in prof_reset() local
1873 next = NULL; in prof_reset()
1878 next = tdata_tree_next(&tdatas, to_destroy); in prof_reset()
1881 next = NULL; in prof_reset()
[all …]

12