On Thu, 9 Nov 2006, Ingo Molnar wrote:
>
> * Jason Baron <[email protected]> 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.
>
hmmm...that's not how i read the lockdep code...and the little piece of
code that i added to add a distance measurement to links, found mostly
distance 1 links but there were a number of 2 and 3 links as well (i don't
think i saw any greater than 3).
thanks.
-Jason
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
