aboutsummaryrefslogtreecommitdiff
path: root/tools/perf/scripts/python/bin
diff options
context:
space:
mode:
authorOleg Nesterov <[email protected]>2010-08-10 18:03:17 -0700
committerLinus Torvalds <[email protected]>2010-08-11 08:59:20 -0700
commitc52b0b91ba1f4b7ea90e20385c0a6df0ba54aed4 (patch)
tree6d92439150a3218da5807610991da4d70af56bf8 /tools/perf/scripts/python/bin
parent5fdee8c4a5e1800489ce61963208f8cc55e42ea1 (diff)
pids: alloc_pidmap: remove the unnecessary boundary checks
alloc_pidmap() calculates max_scan so that if the initial offset != 0 we inspect the first map->page twice. This is correct, we want to find the unused bits < offset in this bitmap block. Add the comment. But it doesn't make any sense to stop the find_next_offset() loop when we are looking into this map->page for the second time. We have already already checked the bits >= offset during the first attempt, it is fine to do this again, no matter if we succeed this time or not. Remove this hard-to-understand code. It optimizes the very unlikely case when we are going to fail, but slows down the more likely case. Signed-off-by: Oleg Nesterov <[email protected]> Cc: Salman Qazi <[email protected]> Cc: Ingo Molnar <[email protected]> Cc: Sukadev Bhattiprolu <[email protected]> Cc: "Eric W. Biederman" <[email protected]> Signed-off-by: Andrew Morton <[email protected]> Signed-off-by: Linus Torvalds <[email protected]>
Diffstat (limited to 'tools/perf/scripts/python/bin')
0 files changed, 0 insertions, 0 deletions