Lines Matching refs:node
311 struct rb_node node;
320 struct rb_node node;
333 struct rb_node node;
1447 struct ulist_node *node;
1464 while ((node = ulist_next(root_ids, &uiter)) != NULL) {
1465 const u64 root_id = node->val;
3021 struct rb_node node;
3032 RB_CLEAR_NODE(&ref->node);
3041 if (!RB_EMPTY_NODE(&ref->node))
3042 rb_erase(&ref->node, ref->root);
3120 entry = rb_entry(parent, struct orphan_dir_info, node);
3141 rb_link_node(&odi->node, parent, p);
3142 rb_insert_color(&odi->node, &sctx->orphan_dirs);
3153 entry = rb_entry(n, struct orphan_dir_info, node);
3180 rb_erase(&odi->node, &sctx->orphan_dirs);
3344 entry = rb_entry(parent, struct waiting_dir_move, node);
3355 rb_link_node(&dm->node, parent, p);
3356 rb_insert_color(&dm->node, &sctx->waiting_dir_moves);
3367 entry = rb_entry(n, struct waiting_dir_move, node);
3383 rb_erase(&dm->node, &sctx->waiting_dir_moves);
3410 RB_CLEAR_NODE(&pm->node);
3414 entry = rb_entry(parent, struct pending_dir_move, node);
3443 rb_link_node(&pm->node, parent, p);
3444 rb_insert_color(&pm->node, &sctx->pending_dir_moves);
3462 entry = rb_entry(n, struct pending_dir_move, node);
3661 if (!RB_EMPTY_NODE(&m->node))
3662 rb_erase(&m->node, &sctx->pending_dir_moves);
3679 if (!RB_EMPTY_NODE(&moves->node)) {
3680 rb_erase(&moves->node, &sctx->pending_dir_moves);
3681 RB_CLEAR_NODE(&moves->node);
4618 static int rbtree_ref_comp(const void *k, const struct rb_node *node)
4621 const struct recorded_ref *ref = rb_entry(node, struct recorded_ref, node);
4644 static bool rbtree_ref_less(struct rb_node *node, const struct rb_node *parent)
4646 const struct recorded_ref *entry = rb_entry(node, struct recorded_ref, node);
4682 rb_add(&ref->node, root, rbtree_ref_less);
4698 struct rb_node *node = NULL;
4710 node = rb_find(&data, &sctx->rbtree_deleted_refs, rbtree_ref_comp);
4711 if (node) {
4712 ref = rb_entry(node, struct recorded_ref, node);
4728 struct rb_node *node = NULL;
4740 node = rb_find(&data, &sctx->rbtree_new_refs, rbtree_ref_comp);
4741 if (node) {
4742 ref = rb_entry(node, struct recorded_ref, node);
7512 * relocation, we can assert that the last key of the root node still
7728 * node or a leaf.
7741 * We clone the root node of the send and parent roots to prevent races
7743 * root node of a tree, so after the transaction is committed the old
7992 sctx->parent_root->node != sctx->parent_root->commit_root)
7996 if (sctx->clone_roots[i].root->node !=
8348 pm = rb_entry(n, struct pending_dir_move, node);
8365 dm = rb_entry(n, struct waiting_dir_move, node);
8366 rb_erase(&dm->node, &sctx->waiting_dir_moves);
8376 odi = rb_entry(n, struct orphan_dir_info, node);