struct inode *inode = tree->private_data;
        u64 isize;
 
-       if (!inode || !is_data_inode(inode))
+       if (!inode)
                return;
 
        isize = i_size_read(inode);
        other = prev_state(state);
        if (other && other->end == state->start - 1 &&
            other->state == state->state) {
-               if (tree->private_data && is_data_inode(tree->private_data))
+               if (tree->private_data)
                        btrfs_merge_delalloc_extent(tree->private_data,
                                                    state, other);
                state->start = other->start;
        other = next_state(state);
        if (other && other->start == state->end + 1 &&
            other->state == state->state) {
-               if (tree->private_data && is_data_inode(tree->private_data))
+               if (tree->private_data)
                        btrfs_merge_delalloc_extent(tree->private_data, state,
                                                    other);
                state->end = other->end;
        u32 bits_to_set = bits & ~EXTENT_CTLBITS;
        int ret;
 
-       if (tree->private_data && is_data_inode(tree->private_data))
+       if (tree->private_data)
                btrfs_set_delalloc_extent(tree->private_data, state, bits);
 
        ret = add_extent_changeset(state, bits_to_set, changeset, 1);
        struct rb_node *parent = NULL;
        struct rb_node **node;
 
-       if (tree->private_data && is_data_inode(tree->private_data))
+       if (tree->private_data)
                btrfs_split_delalloc_extent(tree->private_data, orig, split);
 
        prealloc->start = orig->start;
        u32 bits_to_clear = bits & ~EXTENT_CTLBITS;
        int ret;
 
-       if (tree->private_data && is_data_inode(tree->private_data))
+       if (tree->private_data)
                btrfs_clear_delalloc_extent(tree->private_data, state, bits);
 
        ret = add_extent_changeset(state, bits_to_clear, changeset, 0);