search for: llvmdbg

...0x088ca920 llvm::PassManagerImpl::run(llvm::Module&) + 122 10 opt 0x088cace5 llvm::PassManager::run(llvm::Module&) + 39 11 opt 0x084a6484 main + 4873 12 libc.so.6 0x00126e37 __libc_start_main + 231 13 opt 0x08496c21 Stack dump: 0. Program arguments: /home/purini/llvmdbg/bin/opt -loop-rotate -debug-only=loop-unroll -loop-unroll -unroll-count=4 test1.o -S -o test1.s 1. Running pass 'Function Pass Manager' on module 'test1.o'. 2. Running pass 'Module Verifier' on function '@main' Aborted

...ally tested. I >> would recommend it, none of the others have any significant performance >> benefit anyway. Is that still right or you meant that only SelectivePA is the only substantially tested? --Ricardo P.S. BTW, SelectivePA does not appear as an option when you do opt -load ~/llvmdbg/installed/lib/libpoolalloc.so --help and I could not find any reference 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 =...

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 ) );