similar to: [LLVMdev] How to test my pass

Chayan Sarkar wrote: > Hi there, > > I have written a PRE pass using LLVM. How can I test my pass? Is > there any standard test-cases or bench-marks to test a pass. Please > suggest accordingly. Use the LLVM nightly test suite: http://llvm.org/docs/TestingGuide.html#testsuiterun Make a copy of an existing test like TEST.example.Makefile and modify it to run 'opt -yourpass

Hi All, I am implementing E-pathPRE in LLVM. The coding part is almost complete and till now it worked fine on my test examples. But, I need to test with some standard bench-marks. Can anyone give me any information about standard bench-marks? or any other standard for testing my pass. Any help on this regards will be appreciated. Thank you and regards, Chayan Sarkar

I'm planning on implementing a register allocator on LLVM and I've noticed that the LLVM test suite supports SPEC's CINT2006 benchmarks with some makefiles. Since SPEC seems to be way too expensive, but some (all?) of its programs are available for free, I was thinking of making my own SPEC-based test suite. How hard would it be for me to integrate whole-program benchmarks in LLVM?

*1. I have searched the access/setting of LLVMCC_EMITIR_FLAG in the build directory, recursively, and all the output is what I pasted in last email (just the same to the that in source directory). Maybe the configure failed to do it. My command list for building the test suit is as followings:* *(1) cd ~/SRC_DIR/llvm/projects* *(2) svn co http://llvm.org/svn/llvm-project/test-suite/trunk

On Jan 15, 2011, at 8:06 PM, Qingan Li wrote: > [qali at qali llvm-2.8-rev]$ find . -exec grep -n "LLVMCC_EMITIR_FLAG" ./ {} \; > ./projects/test-suite/Makefile.tests:47: -$(LCC) $(CPPFLAGS) $(CFLAGS) $(LOPTFLAGS) $(X_TARGET_FLAGS) -S $< -o $@ $(LLVMCC_EMITIR_FLAG) > ./projects/test-suite/Makefile.tests:51: -$(LCXX) $(CPPFLAGS) $(CXXFLAGS) $(LOPTFLAGS) $(X_TARGET_FLAGS) -S

After a lot of testing and help from Duncan, Benjamin, Joerg and others, I think the new SROA is ready for some broader testing. I've fixed all the crashers and miscompiles that Duncan and Joerg have been able to find (although I'm sure there are a few left I'll tackle when there are reports), and the LNT numbers look *really* good. Here is the latest LNT run we got by flipping it on

hello everybody, I would like to improve the llvm-test suite[1] as a part of GSoC 2008 program for LLVM. I have few concerns/problems regarding this, please give me your feedbacks and suggestions to come up with the proper proposal. *Goal:* Improve the llvm-test testsuite. *Idea:* Extend the llvm-test testsuite to include new programs and benchmarks[2]. Test programs should be more CPU intensive

Hi All, Still I could not figure out how to use Pass* while calling SplitEdge() function. Can anyone provide me some example? Regards, Chayan On Sun, Jul 18, 2010 at 11:49 PM, Nick Lewycky <nicholas at mxc.ca> wrote: > Chayan Sarkar wrote: >> >> Hi, >> >> I have tried to use SplitEdge function, but failed. Actually the third >> parameter is a variable of

Hi, I could not figure out, how to declare a Pass*. Can anyone give me an example, how to use SplitEdge() function ? Please help me out. Regards, Chayan On Tue, Jul 20, 2010 at 10:12 AM, Chayan Sarkar <chayan.ju at gmail.com> wrote: > Hi All, > > Still I could not figure out how to use Pass* while calling > SplitEdge() function. Can anyone provide me some example? > >

But, the mem2reg pass removes all load store instructions. It replaces all variables by their if possible (kind of constant propagation). I have generated the bitcode of the source program and the applied the mem2reg pass and obviously not getting desired thing. What I want is convert it into SSA form without replacing any variable by their constant value. Please elaborate on your point. Also,

On Mon, Feb 23, 2009 at 6:09 PM, Dale Johannesen <dalej at apple.com> wrote: > These benchmarks are not distributed with llvm (which doesn't have the > legal right to distribute Spec, for example). If you have them from > another source, you need to configure --with-externals=<path> Okay, thanks. Thre should be better warning/error reporting though. Aaron > >

Hi, Can anyone tell me, whether it is possible to convert a program into SSA form without considering algebric equivalence ? regards, Chayan

*[qali at qali llvm-2.8-rev]$ find . -exec grep -n "LLVMCC_EMITIR_FLAG" ./ {} \;* ./projects/test-suite/Makefile.tests:47: -$(LCC) $(CPPFLAGS) $(CFLAGS) $(LOPTFLAGS) $(X_TARGET_FLAGS) -S $< -o $@ $(LLVMCC_EMITIR_FLAG) ./projects/test-suite/Makefile.tests:51: -$(LCXX) $(CPPFLAGS) $(CXXFLAGS) $(LOPTFLAGS) $(X_TARGET_FLAGS) -S $< -o $@ $(LLVMCC_EMITIR_FLAG)

Hi, I have tried to use SplitEdge function, but failed. Actually the third parameter is a variable of type Pass and it need to be non-null. But I could not figure out how to use it. Please help me out. Regards, Chayan On Sat, Jul 17, 2010 at 10:16 PM, Nick Lewycky <nicholas at mxc.ca> wrote: > Chayan Sarkar wrote: >> >> Hi all, >> >> Suppose in a CFG bb1 has two

Simply create an undef constant value and add a store instruction to store the undef value into the memory allocated by the alloca. I believe there is an llvm::Undef class. Check doxygen docs for details. -----Original Message----- From: Chayan Sarkar <chayan.ju at gmail.com> Sent: Sunday, June 27, 2010 12:05 PM To: llvmdev at cs.uiuc.edu <llvmdev at cs.uiuc.edu>; chayan.ju at

E-path PRE requires the program in SSA form like SSAPRE algorithm. Then it finds the eliminatable path (e-path) for an expression and converts partially redundant to fully redundant and removes redundancy Chayan On Mon, Jun 7, 2010 at 1:58 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Sun, Jun 6, 2010 at 8:56 PM, Chayan Sarkar <chayan.ju at gmail.com> wrote: >> Hi

On Mon, Feb 23, 2009 at 6:22 PM, Aaron Gray <aaronngray.lists at googlemail.com > wrote: > On Mon, Feb 23, 2009 at 6:09 PM, Dale Johannesen <dalej at apple.com> wrote: > >> These benchmarks are not distributed with llvm (which doesn't have the >> legal right to distribute Spec, for example). If you have them from >> another source, you need to configure

Suppose my Input function is like : myfunc(int x,int y){ int a=2, b=3,c=5; if(x>y) { c=a+b; a=6; } else { c=a*b; b=4; } a=c+a; c=a+b; } and the output should be : myfunc(int x,int y){ int a.0=2, b.0=3,c.0=5; if(x>y) { c.1=a.0+b.0; a.1=6; } else { c.2=a.0*b.0; b.1=4; }

On Sun, Jun 6, 2010 at 8:56 PM, Chayan Sarkar <chayan.ju at gmail.com> wrote: > Hi Jeffrey, > > Actually I am trying to implement "E-path PRE" which is based on > non-algebric equivallence. So, the  variable names need to be > preserved. Then why do you want to run mem2reg before your optimization in the first place? -Eli

Hi, I am trying to write a small pass. In my pass, I have inserted some instruction and used that in another. But, during OPT it is showing "Instruction does not dominate all uses" like following - %b.1 = bitcast i32 4 to i32 ; <i32> [#uses=8] %11 = add i32 %a.1, %b.1 ; <i32> [#uses=1]Instruction does not dominate all uses! Any