Lines Matching refs:new_node

354                                         quicklistNode *new_node, int after) {  in __quicklistInsertNode()  argument
356 new_node->prev = old_node; in __quicklistInsertNode()
358 new_node->next = old_node->next; in __quicklistInsertNode()
360 old_node->next->prev = new_node; in __quicklistInsertNode()
361 old_node->next = new_node; in __quicklistInsertNode()
364 quicklist->tail = new_node; in __quicklistInsertNode()
366 new_node->next = old_node; in __quicklistInsertNode()
368 new_node->prev = old_node->prev; in __quicklistInsertNode()
370 old_node->prev->next = new_node; in __quicklistInsertNode()
371 old_node->prev = new_node; in __quicklistInsertNode()
374 quicklist->head = new_node; in __quicklistInsertNode()
378 quicklist->head = quicklist->tail = new_node; in __quicklistInsertNode()
390 quicklistNode *new_node) { in _quicklistInsertNodeBefore() argument
391 __quicklistInsertNode(quicklist, old_node, new_node, 0); in _quicklistInsertNodeBefore()
396 quicklistNode *new_node) { in _quicklistInsertNodeAfter() argument
397 __quicklistInsertNode(quicklist, old_node, new_node, 1); in _quicklistInsertNodeAfter()
801 quicklistNode *new_node = quicklistCreateNode(); in _quicklistSplitNode() local
802 new_node->zl = zmalloc(zl_sz); in _quicklistSplitNode()
805 memcpy(new_node->zl, node->zl, zl_sz); in _quicklistSplitNode()
820 new_node->zl = ziplistDeleteRange(new_node->zl, new_start, new_extent); in _quicklistSplitNode()
821 new_node->count = ziplistLen(new_node->zl); in _quicklistSplitNode()
822 quicklistNodeUpdateSz(new_node); in _quicklistSplitNode()
824 D("After split lengths: orig (%d), new (%d)", node->count, new_node->count); in _quicklistSplitNode()
825 return new_node; in _quicklistSplitNode()
837 quicklistNode *new_node = NULL; in _quicklistInsert() local
842 new_node = quicklistCreateNode(); in _quicklistInsert()
843 new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD); in _quicklistInsert()
844 __quicklistInsertNode(quicklist, NULL, new_node, after); in _quicklistInsert()
845 new_node->count++; in _quicklistInsert()
899 new_node = node->next; in _quicklistInsert()
900 quicklistDecompressNodeForUse(new_node); in _quicklistInsert()
901 new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_HEAD); in _quicklistInsert()
902 new_node->count++; in _quicklistInsert()
903 quicklistNodeUpdateSz(new_node); in _quicklistInsert()
904 quicklistRecompressOnly(quicklist, new_node); in _quicklistInsert()
909 new_node = node->prev; in _quicklistInsert()
910 quicklistDecompressNodeForUse(new_node); in _quicklistInsert()
911 new_node->zl = ziplistPush(new_node->zl, value, sz, ZIPLIST_TAIL); in _quicklistInsert()
912 new_node->count++; in _quicklistInsert()
913 quicklistNodeUpdateSz(new_node); in _quicklistInsert()
914 quicklistRecompressOnly(quicklist, new_node); in _quicklistInsert()
920 new_node = quicklistCreateNode(); in _quicklistInsert()
921 new_node->zl = ziplistPush(ziplistNew(), value, sz, ZIPLIST_HEAD); in _quicklistInsert()
922 new_node->count++; in _quicklistInsert()
923 quicklistNodeUpdateSz(new_node); in _quicklistInsert()
924 __quicklistInsertNode(quicklist, node, new_node, after); in _quicklistInsert()
930 new_node = _quicklistSplitNode(node, entry->offset, after); in _quicklistInsert()
931 new_node->zl = ziplistPush(new_node->zl, value, sz, in _quicklistInsert()
933 new_node->count++; in _quicklistInsert()
934 quicklistNodeUpdateSz(new_node); in _quicklistInsert()
935 __quicklistInsertNode(quicklist, node, new_node, after); in _quicklistInsert()