search for: allbutunreachablefrommemory

...ence in the source code (Heuristic.{h,cpp}) May I assume that is a new heuristic or you are referring to one of the current ones? -poolalloc-heuristic - Heuristic to choose which nodes to pool allocate =AllNodes - Pool allocate all nodes =AllButUnreachableFromMemory - Pool allocate all reachable from memory objects =CyclicNodes - Pool allocate nodes with cycles =SmartCoallesceNodes - Use the smart node merging heuristic =AllInOneGlobalPool - Use pool library as replacement...

On Sat, 2 Apr 2005, Ricardo wrote: > After applying the PA to it, the output is something like this: ... > My question is: why is this malloc necessary? > ltmp_2_5 = malloc(4u); > Shouldn't be the result a program with this malloc replaced by poolalloc? > Should I include a special flag to achieve this? Ah, sorry, my memory was wrong. The default is to perform the

Thanks for the answer I am trying to test the PA with a program very similar to the one used as an example in the paper located here: http://llvm.cs.uiuc.edu/pubs/2003-04-29-DataStructureAnalysisTR.html The program is as follows: ========================== struct list { struct list *Next; }; struct list *makeList (int Num) { struct list *New = malloc ( sizeof ( struct list ) );