|
From: Josef W. <Jos...@gm...> - 2007-04-17 13:51:03
|
On Tuesday 17 April 2007, Andrew Shewmaker wrote: > On 4/13/07, Nicholas Nethercote <nj...@cs...> wrote: > > On Fri, 13 Apr 2007, Josef Weidendorfer wrote: > > > > >> I was wondering if valgrind had the kind of functionality that memspy > > >> does. For example, can it tell me which of three data structures > > >> referenced in a line of code is experiencing the most cache misses > > >> and what's pushing it out of cache? > > > > > > AFAIK no. > > > It should be possible, and I once started something like this, but did > > > not finish. However, it already showed some aggregate counters (as part > > > of debug output) attributed to global data symbols... > > > > I have the startings of something like this as well :) It uses client > > requests in the source code to specify which bits of memory should be > > considered a single entity. But it's not very advanced. > > Would it be interesting for you to see the memspy source code? What IMHO currently is missing is a good DWARF debug reader for data structures to be used by Valgrind tools (?). However, it needs a very fast way to look up data structures for an address. I doubt that Memspy code can help here. Functionality is described well in papers, no? > I've emailed the authors and they say they are no longer distributing > the code since it is so old, However, that is sad. Josef > but maybe I could ask them if they would > share it with you so that you can reimpliment the functionality in > Valgrind. > |