similar to: [LLVMdev] Which is the better optimization?

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

Hello, LLVMers. I have a quick question for constant folding. When I treated a code twice by changing the data type from 'floating point' to 'integer,' What I found was: optimization is done better for the code having int's. E.g., for this simple code: ------------------------------------------------------------- double foo() { double i,j; double sum = 0; for (i=0;

Wow... Thank you so much for this. I'll try this one. Thanks again, Wojciech. SJL ---- Original message ---- >Date: Sat, 15 Sep 2007 15:07:34 +0200 >From: Wojciech Matyjewicz <wmatyjewicz at fastmail.fm> >Subject: Re: [LLVMdev] constructing 'for' statement from LLVM bitcode >To: LLVM Developers Mailing List <llvmdev at cs.uiuc.edu> > >Hi, >

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

Dear Wojciech Matyjewicz: Thank you for your advice. I could follow what you had suggested upto opt -analyze -loops bsloop-opt.bc Therefore, I could get the prints you had showed me as follows: -------------------------------------------------------- Printing analysis 'Natural Loop Construction' for function 'bsloop': Loop Containing: %bb16, %bb13, %bb8, %bb1 Loop

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:

Hi, LLVMers. I am trying to restore the original HL code from LLVM IR (kinda reverse engineering). However, I have no good idea about how to handle PHI nodes. It is quite tricky for me to deal with the PHI nodes in LLVM IR in order to restore the original-like code. I read some reverse engineering thesis but they are a little bit old so don't handle SSA form. Could you shed some lights on

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 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:

I didn't 'cause my llvm-gcc just seems to be 4.0: ]$ llvm-gcc -v Using built-in specs. Target: i686-pc-linux-gnu Configured with: ../llvm-gcc4-1.9.source/configure --prefix=/mounts/zion/disks/0/localhome/tbrethou/llvm-gcc4/obj/../install --enable-llvm=/localhome/tbrethou/llvm --enable-languages=c,c++ --disable-threads Thread model: single gcc version 4.0.1 LLVM (Apple Computer, Inc. build

Hello, LLVMers. I ran a simple code twice with a very slight modification and found something interesting. I ran this first: ///////////////////////HL source code//////////////////////// unsigned foo() { unsigned i,j; unsigned sum = 0; for (i=0; i<10; i++) { sum += i; for (j=0; j<3; j++) sum += 2; } return sum; }

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

Hello, guys. I just wonder if there is any way to spit out LLVM assembly without any basic block division. E.g., If I emit LLVM assembly for the following simple code: ------------------------------------------------------------ void f_loop(long* c, long sz) { long i; for (i = 0; i < sz; i++) { long offset = i * sz; long* out = c + offset; out[i] = 0; } }

Hi, guys. Is there any easy way to know the leaf BB node in the CFG which is not terminated by such a 'br' instruction? E.g., for the following LLVM assembly: ----------------------------------------------------------- int %foo2(int %k) { entry: br label %bb bb: ; preds = %bb, %entry %indvar = phi uint [ 0, %entry ], [ %indvar.next, %bb ] ;

Hello. I updated my LLVM with version 2.1 from 1.9. But I am curious why I still have signed integer type. I still get LLVM IR as follows: ...... ...... bb8.outer: ; preds = %bb10, %entry %i.0.0.ph = phi uint [ 0, %entry ], [ %indvar.next26, %bb10 ] ; <uint> [#uses=2] %sum.0.pn.ph = phi uint [ 0, %entry ], [ %sum.1, %bb10 ] ; <uint> [#uses=1] br label %bb8 bb3: ; preds = %bb8

Thank you for this comment, Mike. So... your suggestion is to make a valid transform for each loop like: >for (;C;) { > S >} > >is to transform: > >top: >if (!C) goto end; > S >goto top; >end: For now, my code is incomplete so not ready to present for audit yet but I hope it asap. In fact, I couldn't understand what you said: >The cost of the .pdf

On 19/07/2007 01:29:18, Seung Jae Lee (lee225 at uiuc.edu) wrote: > Somebody in this dev-list alreday did it with LLVM. I guess you are speaking about Bruno Cardoso Lopes ? I can see there is a MIPS implementation in LLVM repository but it looks like uncomplete (that is, I'm not even sure it can compile any source). What I hope is to have a complete MIPS implementation so I can adapt

I use VS2005/Vista, which works well... Thx, Seung ---- Original message ---- >Date: Wed, 20 Feb 2008 12:02:29 +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> > >Hi there, > >Did anyone try

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