Searched refs:old_node (Results 1 – 3 of 3) sorted by relevance
126 list *listInsertNode(list *list, listNode *old_node, void *value, int after) { in listInsertNode() argument133 node->prev = old_node; in listInsertNode()134 node->next = old_node->next; in listInsertNode()135 if (list->tail == old_node) { in listInsertNode()139 node->next = old_node; in listInsertNode()140 node->prev = old_node->prev; in listInsertNode()141 if (list->head == old_node) { in listInsertNode()
356 new_node->prev = old_node; in __quicklistInsertNode()357 if (old_node) { in __quicklistInsertNode()359 if (old_node->next) in __quicklistInsertNode()361 old_node->next = new_node; in __quicklistInsertNode()363 if (quicklist->tail == old_node) in __quicklistInsertNode()366 new_node->next = old_node; in __quicklistInsertNode()367 if (old_node) { in __quicklistInsertNode()369 if (old_node->prev) in __quicklistInsertNode()371 old_node->prev = new_node; in __quicklistInsertNode()373 if (quicklist->head == old_node) in __quicklistInsertNode()[all …]
77 list *listInsertNode(list *list, listNode *old_node, void *value, int after);