similar to: [LLVMdev] How to deal with phi-nodes

Thank you, Bill. Seems to be better. Anyway...Is there a way I can do what you showed for me? Thanks, Seung J. Lee ---- Original message ---- >Date: Sat, 26 Jan 2008 22:10:01 -0800 >From: Bill Wendling <isanbard at gmail.com> >Subject: Re: [LLVMdev] Question to Chris >To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > >On Jan 26, 2008, at 9:48 AM, Seung

Dear Prof.Adve and Bill, I deeply appreciate your comments and concerns. (Please forgive my late response. I've tried some more cases to make this issue) As Prof.Adve mentioned, I need to explain exactly what my problem is, but I have no good ability that I can explain it in this plain text space. For this reason, I made a .pdf file and linked it as follows:

Hi Seung, It should be fairly straight-forward to do in LLVM. Once you identify the loops, then identify the PHI nodes that you need to convert, then apply the transformation below. The fine details on how to create an instruction and replace one instruction with another are documented in the docs section and in other code. :-) One thing to be careful of, if you convert a variable like

Hello, LLVMers. I just wonder How I can pronounce Clang. [see-laeng], [see-lang], [k-laeng], [k-lang]?? Thanks, Seung

Do you mean that "normal" SSA phi elimination algorithm is DemotePHI()? Thx, Seung ---- Original message ---- >Date: Mon, 24 Mar 2008 21:43:06 -0700 >From: Chris Lattner <sabre at nondot.org> >Subject: Re: [LLVMdev] What is "strong phi elimination" >To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> >Cc: Christopher Lamb

Hi, guys. I'm interested in using reg2mem pass but not sure about the concept of it. Can you let me know a reference about it, if any? Forgive my ignorance. -_-; Thanks, Seung J. Lee

Hello. My name is Seung Jae Lee. I'd like to ask you onething about converting to ARM assembly code. I saved the simplest C code shown in your LLVM webpage as 'hello.c' And I made 'hello.bc' by "$ llvm-gcc hello.c -o hello". In order to make ARM assembly code, I typed "llc -march=arm hello.bc -o hello.arm" But, I met this error. llc: ARMISelDAGToDAG.cpp:73:

Dear Dr.Lattner Hello, Dr.Lattner. You may find your reply at http://lists.cs.uiuc.edu/pipermail/llvmdev/2007-August/010479.html and other your replies to me right up and down at the list. You had suggested me to read the "structural analysis" section in Muchnick's book. Thank you for this. I bought and read it, which was very helpful but... I still don't have any idea

On Fri, 2007-08-10 at 00:51 -0500, Seung Jae Lee wrote: > Hi, guys. > > I'm interested in using reg2mem pass but not sure about the concept of it. > Can you let me know a reference about it, if any? > Forgive my ignorance. -_-; The reg2mem pass undoes SSA form. That is, it turns SSA registers into alloca instructions with loads and stores. > > Thanks, > Seung J.

Ok, here are a few suggestions and comments: 1) LLVM has the capabilities to do everything that you are trying to re-implement. 2) Have you looked at the C backend? It recreates loops. It may not create "for" loops but you can hack on it to do that. 3) The way you are converting out of SSA is wrong. You will suffer from lost copies. You should look at using demotePHI(). see

Bill, Depending on what Seung's problem is, converting *out* of SSA form may actually be the wrong thing to do. Seung needs to explain exactly problem he is unable solve using SSA form. --Vikram http://www.cs.uiuc.edu/~vadve http://llvm.org/ On Jan 28, 2008, at 1:10 AM, Bill Wendling wrote: > Hi Seung, > > It should be fairly straight-forward to do in LLVM. Once you

Xi, I just installed VS2005 pro w/ SP1 for Win Vista. Thanks, Seung ---- Original message ---- >Date: Fri, 22 Feb 2008 12:36:43 +0800 >From: "Xi Wang" <xi.wang at gmail.com> >Subject: Re: [LLVMdev] Is there someone tried LLVM 2.1 on Visual Studio 2005? >To: "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu> > >I'm sorry but did you

On Jul 3, 2008, at 8:06 AM, Seung Jae Lee wrote: > Hello, LLVMers. > > I just wonder How I can pronounce Clang. > > [see-laeng], [see-lang], [k-laeng], [k-lang]?? We've been pronouncing it kl -------------- next part -------------- A non-text attachment was scrubbed... Name: abreve.gif Type: image/gif Size: 62 bytes Desc: not available URL:

Hello, guys. I just tested -reg2mem pass to see how it changes my bitcode. E.g., for the following simple C code: ------------------------------------------------------------- int foo() { int i,j; int sum = 0; for (i=0; i<10; i++) { sum += i; for (j=0; j<3; j++) sum += 2; } return sum; } ------------------------------------------------------------- I could get the

Hello. Nice to meet you. My name is Seung Jae Lee, a graduate student in UIUC CEE, who is working in NCSA for the present. Nowadays I am trying to develop LLVM backend to spit out CHiMPS assembly code. In the process, I installed LLVM codes on my home directory in the host computer. But I don't think it was installed properly. While bootstrapping the LLVM C/C++ Front-End, I met several

Thank you so much for your reply, Chris. If so, can I ask you two things more? First, is there any way to have various optimizations on LLVM assembly such as -O options in llvmc? llvm-gcc doesn't seem to be working for these -O options... Second, I'm still not sure about difference between *.s and *.ll. LLVM assembly *.s file can be made from llvm-gcc -S. Another assembly *.ll file comes

Thank you for this information. If so, is there any way to grasp which kinda data throw in and out in LLVM as shown in such a way in gdb? Thanks, Seung Jae Lee ---- Original message ---- >Date: Tue, 20 Feb 2007 23:54:04 -0600 >From: "John T. Criswell" <criswell at cs.uiuc.edu> >Subject: Re: [LLVMdev] bugpoint usage >To: LLVM Developers Mailing List <llvmdev at

I have always built it with flex and bison installed, though I believe Chris removed our last dependence on flex a little while back, so you may not need that. I'm using bison 2.1 which I got from the getgnuwin32 folks. I imagine that if you have cygwin or the like, you probably already have everything. You will need to have the executables in your path. I build with VisualStudio 2k5

Thanks for your comment. I also tried for LLVM 2.2 but got the same compilation errors on VS2005. (I didn't modify anything before the compilation) I just wonder if I need bison and flex even just in the case of compiling them on VS2005 without changing anything because the LLVM doc says "If you plan to modify any .y or .l files, you will need to have bison and/or flex installed where

I simply found it at: http://getgnuwin32.sourceforge.net/ Seung ---- Original message ---- >Date: Tue, 12 Feb 2008 21:11:04 -0800 >From: "Ted Neward" <ted at tedneward.com> >Subject: Re: [LLVMdev] Is there someone tried LLVM 2.1 on Visual Studio 2005? >To: "'LLVM Developers Mailing List'" <llvmdev at cs.uiuc.edu> > >I'm sorry,