【Redis源码学习】skiplist的插入过程分析

最新推荐文章于 2024-05-21 14:05:06 发布

xiaobai18630

最新推荐文章于 2024-05-21 14:05:06 发布

阅读量257

点赞数

分类专栏： Redis

本文链接：https://blog.csdn.net/xiaobai18630/article/details/50595863

版权

Redis 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

zskiplistNode *zslInsert(zskiplist *zsl, double score, sds ele) {
    zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;
    unsigned int rank[ZSKIPLIST_MAXLEVEL];
    int i, level;

    serverAssert(!isnan(score));
    x = zsl->header;
    for (i = zsl->level-1; i >= 0; i--) {
        /* store rank that is crossed to reach the insert position */
        rank[i] = i == (zsl->level-1) ? 0 : rank[i+1];
        while (x->level[i].forward &&
                (x->level[i].forward->score < score ||
                    (x->level[i].forward->score == score &&
                    sdscmp(x->level[i].forward->ele,ele) < 0)))
        {
            rank[i] += x->level[i].span;
            x = x->level[i].forward;
        }
        update[i] = x;
    }
    /* we assume the element is not already inside, since we allow duplicated
     * scores, reinserting the same element should never happen since the
     * caller of zslInsert() should test in the hash table if the element is
     * already inside or not. */
    level = zslRandomLevel();
    if (level > zsl->level) {
        for (i = zsl->level; i < level; i++) {
            rank[i] = 0;
            update[i] = zsl->header;
            update[i]->level[i].span = zsl->length;
        }
        zsl->level = level;
    }
    x = zslCreateNode(level,score,ele);
    for (i = 0; i < level; i++) {
        x->level[i].forward = update[i]->level[i].forward;
        update[i]->level[i].forward = x;

        /* update span covered by update[i] as x is inserted here */
		//rank[0] 表示从头结点到当前update[0]结点，forward前移的步数,
		//rank[i] 表示从头结点到当前update[i]结点，forward前移的步数,
		//span表示，从当前i节点到他指向的下一节点，需要移动的最大步数(从它的i-1节点移动)
		//更新X因为 X到下一节点的步数，等于update[i]到X的下一节点的步数，减去从update[i]移动到X的步数
		//更新update[i]到下一节点的步数，是因为update[i] 的下一节点是X,rank[0] - rank[i] 表示从当前点i到下一点X的后向节点的步数，
		//因此再加上1，则为到达下一点X的步数。
        x->level[i].span = update[i]->level[i].span - (rank[0] - rank[i]);
        update[i]->level[i].span = (rank[0] - rank[i]) + 1;
    }

    /* increment span for untouched levels */
    for (i = level; i < zsl->level; i++) {
        update[i]->level[i].span++;
    }

    x->backward = (update[0] == zsl->header) ? NULL : update[0];
    if (x->level[0].forward)
        x->level[0].forward->backward = x;
    else
        zsl->tail = x;
    zsl->length++;
    return x;
}