Lines Matching refs:node
37 struct rb_node *node) in tree_insert() argument
55 rb_link_node(node, parent, p); in tree_insert()
56 rb_insert_color(node, root); in tree_insert()
230 struct rb_node *node; in insert_ordered_extent() local
241 node = tree_insert(&inode->ordered_tree, entry->file_offset, in insert_ordered_extent()
243 if (unlikely(node)) in insert_ordered_extent()
482 struct rb_node *node; in btrfs_mark_ordered_io_finished() local
497 node = ordered_tree_search(inode, cur); in btrfs_mark_ordered_io_finished()
499 if (!node) in btrfs_mark_ordered_io_finished()
502 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_mark_ordered_io_finished()
510 node = rb_next(node); in btrfs_mark_ordered_io_finished()
512 if (!node) in btrfs_mark_ordered_io_finished()
514 entry = rb_entry(node, struct btrfs_ordered_extent, in btrfs_mark_ordered_io_finished()
574 struct rb_node *node; in btrfs_dec_test_ordered_pending() local
585 node = ordered_tree_search(inode, file_offset); in btrfs_dec_test_ordered_pending()
586 if (!node) in btrfs_dec_test_ordered_pending()
589 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_dec_test_ordered_pending()
651 struct rb_node *node; in btrfs_remove_ordered_extent() local
682 node = &entry->rb_node; in btrfs_remove_ordered_extent()
683 rb_erase(node, &btrfs_inode->ordered_tree); in btrfs_remove_ordered_extent()
684 RB_CLEAR_NODE(node); in btrfs_remove_ordered_extent()
685 if (btrfs_inode->ordered_tree_last == node) in btrfs_remove_ordered_extent()
972 struct rb_node *node; in btrfs_lookup_ordered_extent() local
977 node = ordered_tree_search(inode, file_offset); in btrfs_lookup_ordered_extent()
978 if (!node) in btrfs_lookup_ordered_extent()
981 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_extent()
999 struct rb_node *node; in btrfs_lookup_ordered_range() local
1003 node = ordered_tree_search(inode, file_offset); in btrfs_lookup_ordered_range()
1004 if (!node) { in btrfs_lookup_ordered_range()
1005 node = ordered_tree_search(inode, file_offset + len); in btrfs_lookup_ordered_range()
1006 if (!node) in btrfs_lookup_ordered_range()
1011 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_ordered_range()
1020 node = rb_next(node); in btrfs_lookup_ordered_range()
1021 if (!node) in btrfs_lookup_ordered_range()
1068 struct rb_node *node; in btrfs_lookup_first_ordered_extent() local
1072 node = ordered_tree_search(inode, file_offset); in btrfs_lookup_first_ordered_extent()
1073 if (!node) in btrfs_lookup_first_ordered_extent()
1076 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_extent()
1096 struct rb_node *node; in btrfs_lookup_first_ordered_range() local
1103 node = inode->ordered_tree.rb_node; in btrfs_lookup_first_ordered_range()
1110 while (node) { in btrfs_lookup_first_ordered_range()
1111 entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); in btrfs_lookup_first_ordered_range()
1114 node = node->rb_left; in btrfs_lookup_first_ordered_range()
1116 node = node->rb_right; in btrfs_lookup_first_ordered_range()
1243 struct rb_node *node; in btrfs_split_ordered_extent() local
1341 node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node); in btrfs_split_ordered_extent()
1342 if (unlikely(node)) in btrfs_split_ordered_extent()