|
From: Julian S. <js...@ac...> - 2006-09-02 11:17:52
|
On Saturday 02 September 2006 08:22, Oswald Buddenhagen wrote: > On Sat, Sep 02, 2006 at 03:18:56AM +0100, Julian Seward wrote: > > Recording program counters without a stack is of limited use, but I > > can't see how to record a complete stack for each first-write without > > huge space/time overheads. It might be possible to devise a highly > > compressed representation for just the PC values, based on the idea > > that each segment is only going to use a tiny subset of the 2^32/2^64 > > possible PC values. > > i think saving traces in a tree might work. sounds a bit like callgrind. Can you give a bit more detail on that? I'm not sure what you mean. J |