summaryrefslogtreecommitdiff
path: root/tools/perf/scripts/python/call-graph-from-sql.py
diff options
context:
space:
mode:
authorFan Li <fanofcode.li@samsung.com>2017-11-07 14:14:24 +0300
committerJaegeuk Kim <jaegeuk@kernel.org>2017-11-09 20:43:09 +0300
commit974565744955b6154a93c85b77cb94026c85ff5a (patch)
treefefdedfa4ff3872c5a10affb50ebcd47cba59927 /tools/perf/scripts/python/call-graph-from-sql.py
parent74986213adaff2ceab81fc0bb29dbb80d05665b3 (diff)
downloadlinux-974565744955b6154a93c85b77cb94026c85ff5a.tar.xz
f2fs: optimize the way of traversing free_nid_bitmap
We call scan_free_nid_bits only when there isn't many free nids left, it means that marked bits in free_nid_bitmap are supposed to be few, use find_next_bit_le is more efficient in such case. According to my tests, use find_next_bit_le instead of test_bit_le will cut down the traversal time to one third of its original. Signed-off-by: Fan li <fanofcode.li@samsung.com> Reviewed-by: Chao Yu <yuchao0@huawei.com> Signed-off-by: Jaegeuk Kim <jaegeuk@kernel.org>
Diffstat (limited to 'tools/perf/scripts/python/call-graph-from-sql.py')
0 files changed, 0 insertions, 0 deletions