similar to: [LLVMdev] Loop-Unroll optimization

Hi, you need to run some optimization passes first. (like -O2) 2011/5/3 Manish Gupta <mgupta.iitr at gmail.com> > I just want to try loop-unroll and see corresponding changes in the bitcode > file. For that any loop will do. Have you been able to test llvm loop-unroll > successfully? > > > On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: >

I just want to try loop-unroll and see corresponding changes in the bitcode file. For that any loop will do. Have you been able to test llvm loop-unroll successfully? On Mon, May 2, 2011 at 10:04 PM, Yuan Pengfei <coolypf at qq.com> wrote: > Hi, > > > The loop that I am trying it on is: > > for(i=0; i< 1000; i++) > > { > > c[i] = a[i] + b[i]; > > }

You mean like *llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* But still i am not able to observe any effect on bit code by running *opt-2.8 -loop-unroll Hello.bc -o Hello_unroll.bc* On Tue, May 3, 2011 at 3:58 AM, Zakk <zakk0610 at gmail.com> wrote: > Hi, you need to run some optimization passes first. (like -O2) > > 2011/5/3 Manish Gupta <mgupta.iitr at gmail.com>

Hi, You might want to try running -loops -loop-simplify before loop unroll. >From loop simplify.cpp This pass performs several transformations to transform natural loops into a00011 // simpler form, which makes subsequent analyses and transformations simpler and00012 // more effective. Arushi On Tue, May 3, 2011 at 2:17 PM, Manish Gupta <mgupta.iitr at gmail.com> wrote: > You

Even after all the sequence of commands below bit-code is not showing any effect of loop-unrolling *manish at manish:~/Test2$ llvm-gcc-4.2 -O2 -emit-llvm Hello.c -c -o Hello.bc* *manish at manish:~/Test2$ opt-2.8 -loops Hello.bc -o Hello1.bc* *manish at manish:~/Test2$ opt-2.8 -loopsimplify Hello1.bc -o Hello2.bc* *manish at manish:~/Test2$ opt-2.8 -indvars Hello2.bc -o Hello3.bc* *manish at

1. You should run the passes in the same opt command, for passes like loops which is an analysis pass provides results to the following passes. 2. You can pass a -debug flag to opt to see the some debugging info. 3. I tried this opt -mem2reg -loops -loopsimplify -loop-unroll -unroll-count=3 -debug loop.o -o tt.bc and got this message. Loop Size = 14 Can't unroll; loop not terminated by

Hi all I am trying hello pass in llvm. I have compiled and could generate LLVMHello.so but while giving the pass using opt i am getting below mentioned error. Command used: *opt-2.8 -load ../../cse231_project/llvm/llvm-2.9/Debug/lib/LLVMHello.so -hello < hello.bc* Error opening '../../cse231_project/llvm/llvm-2.9/Debug/lib/LLVMHello.so':

Hi All, I am trying to build firefox with clang in Ubuntu 14.04 64bit. There is always configure failed errors problem. I follow compiling firefox with clang on linux <https://developer.mozilla.org/en-US/docs/Compiling_Firefox_With_Clang_On_Linux>. I add "export CC=clang export CXX=clang++" to mozconfig file. I wonder whether you guys have built firefox with clang in Linux. Could

Dear John, Now, I want to do dynamic analysis by dynamic slicing based on LLVM. I just see that you have implemented dynamic slicing for LLVM. I also check the Giri project, and I don't find the code. I hope I can learn something from your code. I am very appreciated if you can tell me how to get the code or send me one copy. Thank you very much! Pengfei -- View this message in context:

Yes, you’re probably right about this. I was originally thinking of FENV_ACCESS as a fully strict mode of operation, but what you’re suggesting aligns with what Cameron suggested and even some of my own reasoning on other points. So, let me amend my previous proposal to say: STDC FENV_ACCESS {ON|OFF} Patch in progress. I think ON should force the following: except_behavior { strict }

Hi Pengfei, Glad you tried the program and it works fine to you for the first place. Dr. Swarup and John from UIUC wrote most of the code, and released the original code to public. Dynamic slicing tool is really very useful. Giri is now far from perfect. For example, there are know bugs for multi-thread programs and I'm fixing it these weeks. I will take charge of this project for a while

> ... math errno ... I wouldn't recommend to anyone that they should rely on math errno (because I don't trust libraries to correctly support it). My goal here was to incorporate our existing support for it into the rest of what I'm trying to document. My understanding is that for clang this primarily controls whether or not we feel free to substitute intrinsics for recognized

I recently used the Xen virtual machine backup tools, such as ''xm save'' command. And I found that before this tool save the memory and CPU state, it first pauses the VM. Do Xen have same tools for online backup the VMs? If it do not have one, can I saty that Xen don''t support VM online backup? -- View this message in context:

Dear R users, I see a graph (shown athttps://cid-c486ebef16722625.photos.live.com/self.aspx/%e6%88%91%e5%96%9c%e6%ac%a2%e7%9a%84%e8%8a%b1/untitled.bmp) in a published paper, which is very informative and clear. But I don't know what type the graph is. It looks like a sactter plot but has the points with the same y values are seperate.. I really aprreciate it if someone can tell

Hi, I wrote a script to help removing unused trivial prefixes. It is located in llvm/utils/update_test_prefix.py. It is a rough one and based on problems I met. It also highly relies on the output of llvm-lit and update tools. So carefully verification on its changes is MUST. Here's the usage of it: 1. turn allow-unused-prefixes to false and built it: sed -i

Hi, I've recently setup a new server for our public libraries. For the last two years, this has been my first "big" job, since it involves networking eleven small to medium size public libraries. There was a hiccup some time ago when the administration hiring me wanted to do it on their own, but it took them less than two weeks to get the server hacked and lose everything. So

On Thu, Nov 5, 2020 at 11:36 AM David Blaikie via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > > On Thu, Nov 5, 2020 at 10:46 AM Mircea Trofin <mtrofin at google.com> wrote: >> >> >> >> On Thu, Nov 5, 2020 at 10:40 AM David Blaikie <dblaikie at gmail.com> wrote: >>> >>> >>> >>> On Thu, Nov 5, 2020 at

Hello, I have submitted my proposal on GSoC. But I have little idea about the timeline. Many things are difficult to be determined. Cheers, Liu Chi 2014-03-11 21:33 GMT+08:00 Olly Betts <olly at survex.com>: > On Tue, Mar 11, 2014 at 10:11:31AM +0800, Chi Liu wrote: > > Thank you for your patient explanation about the project. My > > understanding about the project

On Mon, Mar 24, 2014 at 01:57:09PM +0800, Chi Liu wrote: > I have generated the patch by git diff and upload here > https://github.com/incredibleliuchi/xapian_patch_earlyenglishstemmer > > And I have also open a "pull request" on github. Thanks, looks good. Now merged. Cheers, Olly

On Fri, Jan 17, 2020 at 8:09 PM Finkel, Hal J. <hfinkel at anl.gov> wrote: > Andy, thanks for writing this up. A few thoughts: > > 1. The mental model that I have is that there is always an FP_CONTRACT pragma: there's some default (implicit) pragma at the beginning, and what it says (off/on/fast) is controlled by the command-line flags (or the driver's default if no flags