lock_extent_bits(&BTRFS_I(inode)->io_tree, lockstart, lockend,
                                 cached_state);
-               ordered = btrfs_lookup_first_ordered_extent(inode, lockend);
+               ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode),
+                                                           lockend);
 
                /*
                 * We need to make sure we have no ordered extents in this range
                 */
                lock_extent_bits(&BTRFS_I(inode)->io_tree, alloc_start,
                                 locked_end, &cached_state);
-               ordered = btrfs_lookup_first_ordered_extent(inode, locked_end);
+               ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode),
+                                                           locked_end);
 
                if (ordered &&
                    ordered->file_offset + ordered->num_bytes > alloc_start &&
 
                return;
 
        while (1) {
-               ordered = btrfs_lookup_first_ordered_extent(inode, (u64)-1);
+               ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode),
+                                                           (u64)-1);
                if (!ordered)
                        break;
                else {
 
 
        end = orig_end;
        while (1) {
-               ordered = btrfs_lookup_first_ordered_extent(inode, end);
+               ordered = btrfs_lookup_first_ordered_extent(BTRFS_I(inode), end);
                if (!ordered)
                        break;
                if (ordered->file_offset > orig_end) {
  * if none is found
  */
 struct btrfs_ordered_extent *
-btrfs_lookup_first_ordered_extent(struct inode *inode, u64 file_offset)
+btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset)
 {
        struct btrfs_ordered_inode_tree *tree;
        struct rb_node *node;
        struct btrfs_ordered_extent *entry = NULL;
 
-       tree = &BTRFS_I(inode)->ordered_tree;
+       tree = &inode->ordered_tree;
        spin_lock_irq(&tree->lock);
        node = tree_search(tree, file_offset);
        if (!node)
 
                                struct btrfs_ordered_extent *entry, int wait);
 int btrfs_wait_ordered_range(struct inode *inode, u64 start, u64 len);
 struct btrfs_ordered_extent *
-btrfs_lookup_first_ordered_extent(struct inode * inode, u64 file_offset);
+btrfs_lookup_first_ordered_extent(struct btrfs_inode *inode, u64 file_offset);
 struct btrfs_ordered_extent *btrfs_lookup_ordered_range(
                struct btrfs_inode *inode,
                u64 file_offset,