Lines Matching defs:curr
698 struct btrfs_delayed_item *curr, *next;
730 curr = next;
731 next = __btrfs_next_delayed_item(curr);
735 if (!btrfs_is_continuous_delayed_item(curr, next))
776 list_for_each_entry_safe(curr, next, &head, tree_list) {
778 write_extent_buffer(leaf, &curr->data,
780 curr->data_len);
783 btrfs_delayed_item_release_metadata(root, curr);
785 list_del(&curr->tree_list);
786 btrfs_release_delayed_item(curr);
838 struct btrfs_delayed_item *curr, *prev;
843 curr = __btrfs_first_delayed_insertion_item(node);
844 if (!curr)
847 ret = btrfs_insert_delayed_item(trans, root, path, curr);
853 prev = curr;
854 curr = __btrfs_next_delayed_item(prev);
855 if (curr && btrfs_is_continuous_delayed_item(prev, curr)) {
858 btrfs_batch_insert_items(root, path, curr);
877 struct btrfs_delayed_item *curr, *next;
904 curr = next;
905 next = __btrfs_next_delayed_item(curr);
909 if (!btrfs_is_continuous_delayed_item(curr, next))
925 list_for_each_entry_safe(curr, next, &head, tree_list) {
926 btrfs_delayed_item_release_metadata(root, curr);
927 list_del(&curr->tree_list);
928 btrfs_release_delayed_item(curr);
940 struct btrfs_delayed_item *curr, *prev;
946 curr = __btrfs_first_delayed_deletion_item(node);
947 if (!curr)
951 ret = btrfs_search_slot(trans, root, &curr->key, path, -1, 1);
960 prev = curr;
961 curr = __btrfs_next_delayed_item(prev);
965 if (curr) {
972 btrfs_batch_delete_items(trans, root, path, curr);
1658 struct btrfs_delayed_item *curr, *next;
1660 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1661 list_del(&curr->readdir_list);
1662 if (refcount_dec_and_test(&curr->refs))
1663 kfree(curr);
1666 list_for_each_entry_safe(curr, next, del_list, readdir_list) {
1667 list_del(&curr->readdir_list);
1668 if (refcount_dec_and_test(&curr->refs))
1669 kfree(curr);
1682 struct btrfs_delayed_item *curr;
1685 list_for_each_entry(curr, del_list, readdir_list) {
1686 if (curr->key.offset > index)
1688 if (curr->key.offset == index) {
1704 struct btrfs_delayed_item *curr, *next;
1719 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1720 list_del(&curr->readdir_list);
1722 if (curr->key.offset < ctx->pos) {
1723 if (refcount_dec_and_test(&curr->refs))
1724 kfree(curr);
1728 ctx->pos = curr->key.offset;
1730 di = (struct btrfs_dir_item *)curr->data;
1740 if (refcount_dec_and_test(&curr->refs))
1741 kfree(curr);