Lines Matching refs:rb_node
329 RB_CLEAR_NODE(&item->rb_node); in btrfs_alloc_delayed_item()
337 static int delayed_item_index_cmp(const void *key, const struct rb_node *node) in delayed_item_index_cmp()
341 struct btrfs_delayed_item, rb_node); in delayed_item_index_cmp()
364 struct rb_node *node; in __btrfs_lookup_delayed_item()
367 return rb_entry_safe(node, struct btrfs_delayed_item, rb_node); in __btrfs_lookup_delayed_item()
370 static int btrfs_delayed_item_cmp(const struct rb_node *new, in btrfs_delayed_item_cmp()
371 const struct rb_node *exist) in btrfs_delayed_item_cmp()
374 rb_entry(new, struct btrfs_delayed_item, rb_node); in btrfs_delayed_item_cmp()
383 struct rb_node *exist; in __btrfs_add_delayed_item()
390 exist = rb_find_add_cached(&ins->rb_node, root, btrfs_delayed_item_cmp); in __btrfs_add_delayed_item()
420 if (RB_EMPTY_NODE(&delayed_item->rb_node)) in __btrfs_remove_delayed_item()
433 rb_erase_cached(&delayed_item->rb_node, root); in __btrfs_remove_delayed_item()
434 RB_CLEAR_NODE(&delayed_item->rb_node); in __btrfs_remove_delayed_item()
452 struct rb_node *p = rb_first_cached(&delayed_node->ins_root); in __btrfs_first_delayed_insertion_item()
454 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_insertion_item()
460 struct rb_node *p = rb_first_cached(&delayed_node->del_root); in __btrfs_first_delayed_deletion_item()
462 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_deletion_item()
468 struct rb_node *p = rb_next(&item->rb_node); in __btrfs_next_delayed_item()
470 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_next_delayed_item()