From: Chris Mason Date: Wed, 23 Jul 2008 13:26:26 +0000 (-0400) Subject: Btrfs: Fix 32 bit compiles by using an unsigned long byte count in the ordered extent X-Git-Url: https://git.karo-electronics.de/?a=commitdiff_plain;h=9ba4611a3a7902c6bad70c5c205de5161fcfc17b;p=linux-beck.git Btrfs: Fix 32 bit compiles by using an unsigned long byte count in the ordered extent The ordered extents have to fit in memory, so an unsigned long is sufficient. Signed-off-by: Chris Mason --- diff --git a/fs/btrfs/ordered-data.h b/fs/btrfs/ordered-data.h index 36e63f1f79b3..199cb0b4f1d9 100644 --- a/fs/btrfs/ordered-data.h +++ b/fs/btrfs/ordered-data.h @@ -95,7 +95,8 @@ struct btrfs_ordered_extent { * calculates the total size you need to allocate for an ordered sum * structure spanning 'bytes' in the file */ -static inline int btrfs_ordered_sum_size(struct btrfs_root *root, u64 bytes) +static inline int btrfs_ordered_sum_size(struct btrfs_root *root, + unsigned long bytes) { unsigned long num_sectors = (bytes + root->sectorsize - 1) / root->sectorsize;