On 6/1/22 10:30, Jason Gunthorpe wrote:
That is just the keys, not the graph arcs. lockdep records an arc between every key that establishes a locking relationship and minimizing the number of keys also de-duplicates those arcs.
Do you agree that this overhead is acceptable since lockdep is only used to debug kernel code? Thanks, Bart.
