111     zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;  in zslInsert()  local
127         update[i] = x;  in zslInsert()
137             update[i] = zsl->header;  in zslInsert()
138             update[i]->level[i].span = zsl->length;  in zslInsert()
144         x->level[i].forward = update[i]->level[i].forward;  in zslInsert()
145         update[i]->level[i].forward = x;  in zslInsert()
148         x->level[i].span = update[i]->level[i].span - (rank[0] - rank[i]);  in zslInsert()
149         update[i]->level[i].span = (rank[0] - rank[i]) + 1;  in zslInsert()
154         update[i]->level[i].span++;  in zslInsert()
157     x->backward = (update[0] == zsl->header) ? NULL : update[0];  in zslInsert()
167 void zslDeleteNode(zskiplist *zsl, zskiplistNode *x, zskiplistNode **update) {  in zslDeleteNode()  argument
170         if (update[i]->level[i].forward == x) {  in zslDeleteNode()
171             update[i]->level[i].span += x->level[i].span - 1;  in zslDeleteNode()
172             update[i]->level[i].forward = x->level[i].forward;  in zslDeleteNode()
174             update[i]->level[i].span -= 1;  in zslDeleteNode()
189     zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;  in zslDelete()  local
199         update[i] = x;  in zslDelete()
205         zslDeleteNode(zsl, x, update);  in zslDelete()
293     zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;  in zslDeleteRangeByScore()  local
303         update[i] = x;  in zslDeleteRangeByScore()
314         zslDeleteNode(zsl,x,update);  in zslDeleteRangeByScore()
324     zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;  in zslDeleteRangeByLex()  local
334         update[i] = x;  in zslDeleteRangeByLex()
343         zslDeleteNode(zsl,x,update);  in zslDeleteRangeByLex()
355     zskiplistNode *update[ZSKIPLIST_MAXLEVEL], *x;  in zslDeleteRangeByRank()  local
365         update[i] = x;  in zslDeleteRangeByRank()
372         zslDeleteNode(zsl,x,update);  in zslDeleteRangeByRank()