Home
last modified time | relevance | path

Searched refs:forward (Results 1 – 7 of 7) sorted by relevance

/redis-3.2.3/src/
H A Dt_zset.c125 x = x->level[i].forward; in zslInsert()
144 x->level[i].forward = update[i]->level[i].forward; in zslInsert()
158 if (x->level[0].forward) in zslInsert()
172 update[i]->level[i].forward = x->level[i].forward; in zslDeleteNode()
177 if (x->level[0].forward) { in zslDeleteNode()
203 x = x->level[0].forward; in zslDelete()
255 x = x->level[0].forward; in zslFirstInRange()
307 x = x->level[0].forward; in zslDeleteRangeByScore()
338 x = x->level[0].forward; in zslDeleteRangeByLex()
369 x = x->level[0].forward; in zslDeleteRangeByRank()
[all …]
H A Dquicklist.c305 quicklistNode *forward = quicklist->head; in __quicklistCompress() local
310 quicklistDecompressNode(forward); in __quicklistCompress()
313 if (forward == node || reverse == node) in __quicklistCompress()
316 if (forward == reverse) in __quicklistCompress()
319 forward = forward->next; in __quicklistCompress()
328 quicklistCompressNode(forward); in __quicklistCompress()
1230 int forward = idx < 0 ? 0 : 1; /* < 0 -> reverse, 0+ -> forward */ in quicklistIndex() local
1235 if (!forward) { in quicklistIndex()
1253 n = forward ? n->next : n->prev; in quicklistIndex()
1264 if (forward) { in quicklistIndex()
[all …]
H A Dsort.c413 ln = zsl->header->level[0].forward; in sortCommand()
425 ln = desc ? ln->backward : ln->level[0].forward; in sortCommand()
H A Ddb.c1269 n = n->level[0].forward; in getKeysInSlot()
1287 n = n->level[0].forward; /* Go to the next item before freeing it. */ in delKeysInSlot()
H A Dgeo.c282 ln = ln->level[0].forward; in geoGetPointsInRange()
H A Dserver.h644 struct zskiplistNode *forward; member
/redis-3.2.3/deps/linenoise/
H A DREADME.markdown49 ## Let's push this forward!