Skip to content
Snippets Groups Projects
  1. Jul 24, 2009
    • Ming Lei's avatar
      lockdep: Print the shortest dependency chain if finding a circle · c94aa5ca
      Ming Lei authored
      
      Currently lockdep will print the 1st circle detected if it
      exists when acquiring a new (next) lock.
      
      This patch prints the shortest path from the next lock to be
      acquired to the previous held lock if a circle is found.
      
      The patch still uses the current method to check circle, and
      once the circle is found, breadth-first search algorithem is
      used to compute the shortest path from the next lock to the
      previous lock in the forward lock dependency graph.
      
      Printing the shortest path will shorten the dependency chain,
      and make troubleshooting for possible circular locking easier.
      
      Signed-off-by: default avatarMing Lei <tom.leiming@gmail.com>
      Signed-off-by: default avatarPeter Zijlstra <a.p.zijlstra@chello.nl>
      LKML-Reference: <1246201486-7308-2-git-send-email-tom.leiming@gmail.com>
      Signed-off-by: default avatarIngo Molnar <mingo@elte.hu>
      c94aa5ca
  2. Jul 22, 2009
  3. Jul 21, 2009
Loading