Home
last modified time | relevance | path

Searched refs:old_node (Results 1 – 5 of 5) sorted by relevance

/f-stack/freebsd/contrib/openzfs/include/os/linux/spl/sys/
H A Dlist.h200 list_link_replace(list_node_t *old_node, list_node_t *new_node) in list_link_replace() argument
202 new_node->next = old_node->next; in list_link_replace()
203 new_node->prev = old_node->prev; in list_link_replace()
204 old_node->prev->next = new_node; in list_link_replace()
205 old_node->next->prev = new_node; in list_link_replace()
206 list_link_init(old_node); in list_link_replace()
/f-stack/app/redis-5.0.5/src/
H A Dadlist.c134 list *listInsertNode(list *list, listNode *old_node, void *value, int after) { in listInsertNode() argument
141 node->prev = old_node; in listInsertNode()
142 node->next = old_node->next; in listInsertNode()
143 if (list->tail == old_node) { in listInsertNode()
147 node->next = old_node; in listInsertNode()
148 node->prev = old_node->prev; in listInsertNode()
149 if (list->head == old_node) { in listInsertNode()
H A Dquicklist.c356 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 …]
H A Dadlist.h78 list *listInsertNode(list *list, listNode *old_node, void *value, int after);
/f-stack/freebsd/contrib/openzfs/module/zfs/
H A Dbtree.c533 zfs_btree_insert_into_parent(zfs_btree_t *tree, zfs_btree_hdr_t *old_node, in zfs_btree_insert_into_parent() argument
536 ASSERT3P(old_node->bth_parent, ==, new_node->bth_parent); in zfs_btree_insert_into_parent()
538 zfs_btree_core_t *parent = old_node->bth_parent; in zfs_btree_insert_into_parent()
546 ASSERT3P(old_node, ==, tree->bt_root); in zfs_btree_insert_into_parent()
556 old_node->bth_parent = new_node->bth_parent = new_root; in zfs_btree_insert_into_parent()
557 new_root->btc_children[0] = old_node; in zfs_btree_insert_into_parent()
578 ASSERT3P(parent->btc_children[offset], ==, old_node); in zfs_btree_insert_into_parent()