Lines Matching defs:curr
5526 struct btrfs_ino_list *curr;
5529 list_for_each_entry_safe(curr, next, &ctx->conflict_inodes, list) {
5530 list_del(&curr->list);
5531 kfree(curr);
5711 struct btrfs_ino_list *curr;
5716 curr = list_first_entry(&ctx->conflict_inodes,
5718 ino = curr->ino;
5719 parent = curr->parent;
5720 list_del(&curr->list);
5721 kfree(curr);
5955 const struct btrfs_delayed_item *curr = first_item;
5966 write_extent_buffer(path->nodes[0], &curr->data,
5967 (unsigned long)data_ptr, curr->data_len);
5968 curr = list_next_entry(curr, log_list);
5993 const struct btrfs_delayed_item *curr;
6012 list_for_each_entry(curr, delayed_ins_list, log_list) {
6013 if (curr->index > inode->last_dir_index_offset) {
6014 first = curr;
6032 curr = first;
6033 while (!list_entry_is_head(curr, delayed_ins_list, log_list)) {
6034 const u32 curr_size = curr->data_len + sizeof(struct btrfs_item);
6046 first = curr;
6049 ins_sizes[batch_idx] = curr->data_len;
6052 ins_keys[batch_idx].offset = curr->index;
6054 batch.total_data_size += curr->data_len;
6057 curr = list_next_entry(curr, log_list);
6063 curr = list_last_entry(delayed_ins_list, struct btrfs_delayed_item,
6065 inode->last_dir_index_offset = curr->index;
6079 const struct btrfs_delayed_item *curr;
6081 curr = list_first_entry(delayed_del_list, struct btrfs_delayed_item,
6084 while (!list_entry_is_head(curr, delayed_del_list, log_list)) {
6085 u64 first_dir_index = curr->index;
6095 next = list_next_entry(curr, log_list);
6097 if (next->index != curr->index + 1)
6099 curr = next;
6103 last_dir_index = curr->index;
6110 curr = list_next_entry(curr, log_list);
6158 const struct btrfs_delayed_item *curr;
6165 curr = list_first_entry(delayed_del_list, struct btrfs_delayed_item,
6168 while (!list_entry_is_head(curr, delayed_del_list, log_list)) {
6169 const struct btrfs_delayed_item *last = curr;
6170 u64 first_dir_index = curr->index;
6175 key.offset = curr->index;
6181 delayed_del_list, curr,
6217 curr = list_next_entry(last, log_list);