aboutsummaryrefslogtreecommitdiffstats
path: root/fs/reiserfs/stree.c
diff options
context:
space:
mode:
authorJeff Mahoney <jeffm@suse.com>2009-03-30 14:02:44 -0400
committerLinus Torvalds <torvalds@linux-foundation.org>2009-03-30 15:16:39 -0400
commit0222e6571c332563a48d4cf5487b67feabe60b5e (patch)
tree44829ca0a4b1343edec08d4f70696cb0d3218975 /fs/reiserfs/stree.c
parent3cd6dbe6feb9b32347e6c6f25a27f0cde9d50418 (diff)
reiserfs: strip trailing whitespace
This patch strips trailing whitespace from the reiserfs code. Signed-off-by: Jeff Mahoney <jeffm@suse.com> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'fs/reiserfs/stree.c')
-rw-r--r--fs/reiserfs/stree.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/fs/reiserfs/stree.c b/fs/reiserfs/stree.c
index b2eaa0c6b7b7..a65bfee28bb8 100644
--- a/fs/reiserfs/stree.c
+++ b/fs/reiserfs/stree.c
@@ -77,7 +77,7 @@ inline void copy_item_head(struct item_head *p_v_to,
77/* k1 is pointer to on-disk structure which is stored in little-endian 77/* k1 is pointer to on-disk structure which is stored in little-endian
78 form. k2 is pointer to cpu variable. For key of items of the same 78 form. k2 is pointer to cpu variable. For key of items of the same
79 object this returns 0. 79 object this returns 0.
80 Returns: -1 if key1 < key2 80 Returns: -1 if key1 < key2
81 0 if key1 == key2 81 0 if key1 == key2
82 1 if key1 > key2 */ 82 1 if key1 > key2 */
83inline int comp_short_keys(const struct reiserfs_key *le_key, 83inline int comp_short_keys(const struct reiserfs_key *le_key,
@@ -890,7 +890,7 @@ static inline int prepare_for_direct_item(struct treepath *path,
890 } 890 }
891 // new file gets truncated 891 // new file gets truncated
892 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_6) { 892 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_6) {
893 // 893 //
894 round_len = ROUND_UP(new_file_length); 894 round_len = ROUND_UP(new_file_length);
895 /* this was n_new_file_length < le_ih ... */ 895 /* this was n_new_file_length < le_ih ... */
896 if (round_len < le_ih_k_offset(le_ih)) { 896 if (round_len < le_ih_k_offset(le_ih)) {
@@ -1443,7 +1443,7 @@ static int maybe_indirect_to_direct(struct reiserfs_transaction_handle *th,
1443 if (atomic_read(&p_s_inode->i_count) > 1 || 1443 if (atomic_read(&p_s_inode->i_count) > 1 ||
1444 !tail_has_to_be_packed(p_s_inode) || 1444 !tail_has_to_be_packed(p_s_inode) ||
1445 !page || (REISERFS_I(p_s_inode)->i_flags & i_nopack_mask)) { 1445 !page || (REISERFS_I(p_s_inode)->i_flags & i_nopack_mask)) {
1446 // leave tail in an unformatted node 1446 /* leave tail in an unformatted node */
1447 *p_c_mode = M_SKIP_BALANCING; 1447 *p_c_mode = M_SKIP_BALANCING;
1448 cut_bytes = 1448 cut_bytes =
1449 n_block_size - (n_new_file_size & (n_block_size - 1)); 1449 n_block_size - (n_new_file_size & (n_block_size - 1));
@@ -1826,7 +1826,7 @@ int reiserfs_do_truncate(struct reiserfs_transaction_handle *th, struct inode *p
1826 /* While there are bytes to truncate and previous file item is presented in the tree. */ 1826 /* While there are bytes to truncate and previous file item is presented in the tree. */
1827 1827
1828 /* 1828 /*
1829 ** This loop could take a really long time, and could log 1829 ** This loop could take a really long time, and could log
1830 ** many more blocks than a transaction can hold. So, we do a polite 1830 ** many more blocks than a transaction can hold. So, we do a polite
1831 ** journal end here, and if the transaction needs ending, we make 1831 ** journal end here, and if the transaction needs ending, we make
1832 ** sure the file is consistent before ending the current trans 1832 ** sure the file is consistent before ending the current trans