Re: locking hierarchy based on lockdep

[Ingo Molnar]

* Jason Baron <jbaron@xxxxxxxxxx> wrote:

> You are right though, i think that the data in the locks after lists 
> is sufficient to re-create the entire graph, since its acyclic, but by 
> simply printing out nodes of distance '1', the algorithm is greatly 
> simplified. Otherwise, i'd have to first reconstruct the graph...

but ... the locks_after list should really only include locks that are 
taken immediately after. I.e. there should only be 'distance 1' locks.

	Ingo

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/