|
From: Nicholas N. <nj...@cs...> - 2005-02-24 01:05:41
|
On Wed, 23 Feb 2005, Jeremy Fitzhardinge wrote: > To fix all this, I changed the leak checker to use a standard mark-sweep > algorithm. It does a pass from the root set to find unleaked memory, > and then makes a pass over the leaked memory to group it into cliques > (connected graph of allocations); each clique is reported as a leak, > rather than each individual allocation. > > I'm still running it through its paces, but it seems to be a big > improvement over the existing checker. > > What do people think? Sounds good in principle. How complex is it, how much code has been added? N |