diff options
Diffstat (limited to 'fs/btrfs/ordered-data.c')
| -rw-r--r-- | fs/btrfs/ordered-data.c | 15 |
1 files changed, 9 insertions, 6 deletions
diff --git a/fs/btrfs/ordered-data.c b/fs/btrfs/ordered-data.c index 69582d5b69d1..b16450b840e7 100644 --- a/fs/btrfs/ordered-data.c +++ b/fs/btrfs/ordered-data.c | |||
| @@ -336,13 +336,14 @@ int btrfs_dec_test_first_ordered_pending(struct inode *inode, | |||
| 336 | entry->len); | 336 | entry->len); |
| 337 | *file_offset = dec_end; | 337 | *file_offset = dec_end; |
| 338 | if (dec_start > dec_end) { | 338 | if (dec_start > dec_end) { |
| 339 | printk(KERN_CRIT "bad ordering dec_start %llu end %llu\n", | 339 | btrfs_crit(BTRFS_I(inode)->root->fs_info, |
| 340 | dec_start, dec_end); | 340 | "bad ordering dec_start %llu end %llu", dec_start, dec_end); |
| 341 | } | 341 | } |
| 342 | to_dec = dec_end - dec_start; | 342 | to_dec = dec_end - dec_start; |
| 343 | if (to_dec > entry->bytes_left) { | 343 | if (to_dec > entry->bytes_left) { |
| 344 | printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n", | 344 | btrfs_crit(BTRFS_I(inode)->root->fs_info, |
| 345 | entry->bytes_left, to_dec); | 345 | "bad ordered accounting left %llu size %llu", |
| 346 | entry->bytes_left, to_dec); | ||
| 346 | } | 347 | } |
| 347 | entry->bytes_left -= to_dec; | 348 | entry->bytes_left -= to_dec; |
| 348 | if (!uptodate) | 349 | if (!uptodate) |
| @@ -401,7 +402,8 @@ have_entry: | |||
| 401 | } | 402 | } |
| 402 | 403 | ||
| 403 | if (io_size > entry->bytes_left) { | 404 | if (io_size > entry->bytes_left) { |
| 404 | printk(KERN_CRIT "bad ordered accounting left %llu size %llu\n", | 405 | btrfs_crit(BTRFS_I(inode)->root->fs_info, |
| 406 | "bad ordered accounting left %llu size %llu", | ||
| 405 | entry->bytes_left, io_size); | 407 | entry->bytes_left, io_size); |
| 406 | } | 408 | } |
| 407 | entry->bytes_left -= io_size; | 409 | entry->bytes_left -= io_size; |
| @@ -520,7 +522,8 @@ void btrfs_remove_ordered_extent(struct inode *inode, | |||
| 520 | spin_lock_irq(&tree->lock); | 522 | spin_lock_irq(&tree->lock); |
| 521 | node = &entry->rb_node; | 523 | node = &entry->rb_node; |
| 522 | rb_erase(node, &tree->tree); | 524 | rb_erase(node, &tree->tree); |
| 523 | tree->last = NULL; | 525 | if (tree->last == node) |
| 526 | tree->last = NULL; | ||
| 524 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); | 527 | set_bit(BTRFS_ORDERED_COMPLETE, &entry->flags); |
| 525 | spin_unlock_irq(&tree->lock); | 528 | spin_unlock_irq(&tree->lock); |
| 526 | 529 | ||
