Lines Matching refs:rb_node
345 struct rb_node *node, *prev_node = NULL; in __btrfs_lookup_delayed_item()
349 node = root->rb_node; in __btrfs_lookup_delayed_item()
353 rb_node); in __btrfs_lookup_delayed_item()
371 rb_node); in __btrfs_lookup_delayed_item()
383 rb_node); in __btrfs_lookup_delayed_item()
405 struct rb_node **p, *node; in __btrfs_add_delayed_item()
406 struct rb_node *parent_node = NULL; in __btrfs_add_delayed_item()
417 p = &root->rb_node; in __btrfs_add_delayed_item()
418 node = &ins->rb_node; in __btrfs_add_delayed_item()
423 rb_node); in __btrfs_add_delayed_item()
488 rb_erase(&delayed_item->rb_node, root); in __btrfs_remove_delayed_item()
506 struct rb_node *p; in __btrfs_first_delayed_insertion_item()
511 item = rb_entry(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_insertion_item()
519 struct rb_node *p; in __btrfs_first_delayed_deletion_item()
524 item = rb_entry(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_deletion_item()
532 struct rb_node *p; in __btrfs_next_delayed_item()
535 p = rb_next(&item->rb_node); in __btrfs_next_delayed_item()
537 next = rb_entry(p, struct btrfs_delayed_item, rb_node); in __btrfs_next_delayed_item()