diff options
author | Ming Lei <tom.leiming@gmail.com> | 2009-07-16 15:44:29 +0200 |
---|---|---|
committer | Peter Zijlstra <a.p.zijlstra@chello.nl> | 2009-07-24 10:49:46 +0200 |
commit | d588e46155e9c51217b9840db1e94a0f594c1af2 (patch) | |
tree | 0ede7d7d8338f8db15d8c690c46a0173196d7bac /.mailmap | |
parent | lockdep: Print the shortest dependency chain if finding a circle (diff) | |
download | linux-d588e46155e9c51217b9840db1e94a0f594c1af2.tar.xz linux-d588e46155e9c51217b9840db1e94a0f594c1af2.zip |
lockdep: Improve implementation of BFS
1,replace %MAX_CIRCULAR_QUE_SIZE with &(MAX_CIRCULAR_QUE_SIZE-1)
since we define MAX_CIRCULAR_QUE_SIZE as power of 2;
2,use bitmap to mark if a lock is accessed in BFS in order to
clear it quickly, because we may search a graph many times.
Signed-off-by: Ming Lei <tom.leiming@gmail.com>
Signed-off-by: Peter Zijlstra <a.p.zijlstra@chello.nl>
LKML-Reference: <1246201486-7308-3-git-send-email-tom.leiming@gmail.com>
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Diffstat (limited to '.mailmap')
0 files changed, 0 insertions, 0 deletions