summaryrefslogtreecommitdiff
path: root/lib/textsearch.c
diff options
context:
space:
mode:
authorJosef Bacik <josef@redhat.com>2012-04-23 14:41:09 -0400
committerJosef Bacik <josef@redhat.com>2012-05-30 10:23:28 -0400
commit551ebb2d34304ee2abfe6b00d39ec65d5e4e8266 (patch)
tree19e9e5717e2dc031ba9b87bc314552dda886fce4 /lib/textsearch.c
parentd7dbe9e7f64e72ec6548658857c5d92327a73633 (diff)
Btrfs: remove useless waiting and extra filemap work
In btrfs_wait_ordered_range we have been calling filemap_fdata_write() twice because compression does strange things and then waiting. Then we look up ordered extents and if we find any we will always schedule_timeout(); once and then loop back around and do it all again. We will even check to see if there is delalloc pages on this range and loop again. So this patch gets rid of the multipe fdata_write() calls and just does filemap_write_and_wait(). In the case of compression we will still find the ordered extents and start those individually if we need to so that is ok, but in the normal buffered case we avoid all this weird overhead. Then in the case of the schedule_timeout(1), we don't need it. All callers either 1) don't care, they just want to make sure what they just wrote maeks it to disk or 2) are doing the lock()->lookup ordered->unlock->flush thing in which case it will lock and check for ordered extents _anyway_ so get back to them as quickly as possible. The delaloc check is simply not needed, this only catches the case where we write to the file again since doing the filemap_write_and_wait() and if the caller truly cares about that it will take care of everything itself. Thanks, Signed-off-by: Josef Bacik <josef@redhat.com>
Diffstat (limited to 'lib/textsearch.c')
0 files changed, 0 insertions, 0 deletions