similar to: [LLVMdev] How to get the Operand type

Hello I'm trying to install LLVM and LLVM GCC so I check out the source of llvm and llvm-gcc-4.2 from the svn I flow the instructions of this page http://llvm.org/docs/GCCFEBuildInstrs.html I did the installation of LLVM and LLVM GCC well but the problem is there is no llvm-gcc at the end of instalation !!! ?? I mean in the /usr/local/bin/ there are all the commands of llvm (lli llc llvmc

You need to manually copy the llvm-gcc front-end binaries to somewhere in your path. Alternatively, you can download the clang front-end and start using that instead. On Mon, Apr 19, 2010 at 10:58 AM, khaled hamidouche <khaledhamidouche at gmail.com> wrote: > Hello > > I'm trying to install LLVM and LLVM GCC > so I check out  the source of llvm and llvm-gcc-4.2 from the svn

Hello I'm wandring to write a Function parser that iterates over loops inside each function and inside each loop iterates over instructions So I found a way to do the Function parser that iterates over BasicBlocks (using the runOnfunction Pass) but I no know how make it iterates over loops ? So my question is there any way to make a loop inside the runOnfunction to iterate over

Hi all, I have problems with years of dates using "chron" package. I don't understand why R by this istruction: > dates("01/02/29",out.format="d/m/year") [1] 02/Jan/2029 > dates("01/02/30",out.format="d/m/year") [1] 02/Jan/1930 reads "29" as 2029 and "30" as 1930. How could I change to read "00" to

Hello I'm wandring to know how many times a block is executed inside a loop ? knowing that I can't use getSmallConstantTripCount() because the number is unkown "for (i=0;i<N;i++) for example" I'm using a Function pass for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { if (Loop *L = LI->getLoopFor(BB)) { if (L->getHeader() ==

The LLVM docs seem to indicate that integer types are considered primitive, however looking at the code I see `FirstDerivedTyID = IntegerTyID`, implying that integers are derived rather than primitive. Should the docs be updated? -------------- next part -------------- An HTML attachment was scrubbed... URL:

Thanks, I must have missed these, added. On Apr 22, 2010, at 1:28 AM, Matthieu Moy wrote: > Chris Lattner <clattner at apple.com> writes: > >> Ok, the LLVM 2.7 release notes are in near final shape. Please take >> a look and suggest improvements (or, better yet, just commit >> improvements if you have commit access): > > About the API changes, some that hit

Hi all, I am working on some old code which was compiled against llvm-2.5. Anyway, in some places I, AllocationInst is used (e.g. to ensure the instruction's type). Even in your current documentation (http://llvm.org/docs/ProgrammersManual.html), I found an example that uses this instruction. If I got it correctly, this istruction (AllocationInst) has been removed from llvm instruction set.

Zappel-Phillip wrote: > Hello, > > I am writing an optimization pass which optimizes code based on an online > pointer analysis algorithm and need to detect pointers which are pointing to > derived types. I have not had any problem identifying pointers in general > using isa<PointerType>(...), but I can't seem to figure out how I can make > sure that the pointer is

khaled hamidouche wrote: > Hello > > I'm trying to install LLVM and LLVM GCC > so I check out the source of llvm and llvm-gcc-4.2 from the svn > > I flow the instructions of this page > http://llvm.org/docs/GCCFEBuildInstrs.html > > I did the installation of LLVM and LLVM GCC well but the problem is > there is no llvm-gcc at the end of instalation !!! ?? >

On Apr 21, 2010, at 7:31 AM, khaled hamidouche wrote: > I'm wandring to know how many times a block is executed inside a > loop ? > knowing that I can't use getSmallConstantTripCount() because the > number is unkown "for (i=0;i<N;i++) for example" In general, the number of iterations is undecidable. For example: int main(char **argv, int N) { for

Chris Lattner <clattner at apple.com> writes: > Ok, the LLVM 2.7 release notes are in near final shape. Please take > a look and suggest improvements (or, better yet, just commit > improvements if you have commit access): About the API changes, some that hit me when I ported some code to LLVM 2.7, and not in the release notes (I had sent a private email some time ago) : ---

Hi all, I have problems with years of dates using "chron" package. I don't understand why R by this istruction: > dates("01/02/29",out.format="d/m/year") [1] 02/Jan/2029 > dates("01/02/30",out.format="d/m/year") [1] 02/Jan/1930 reads "29" as 2029 and "30" as 1930. How could I change to read "00" to

Hi, I am trying to understand LLVM vectorization implementation and was looking into both loop and SLP vectorization. test case 1: *int foo(int *a) {int sum = 0,i;for(i=0; i<16; i++) sum += a[i];return sum;}* This code is vectorized by loop vectorizer where we calculate scalar loop cost as 4 and vector loop cost as 2. Since vector loop cost is less and above reduction is legal to

On Mon, Mar 15, 2010 at 11:51:47AM +0000, Tim Northover wrote: > Hello, > > I noticed a bit of a gap in the current code for unions: a > ConstantUnion cannot be written out to .ll. I've been continuing plugging gaps as I find them, which might not be the best way to solve this problem, but it has produced something that seems to do roughly what I expect. I've split it into

Ok, the LLVM 2.7 release notes are in near final shape. Please take a look and suggest improvements (or, better yet, just commit improvements if you have commit access): http://llvm.org/docs/ReleaseNotes.html Things still needed are marked with FIXMEs. These include: 1. Clang needs a blurb describing what's new in 2.7. Have the clang folks been doing anything for the last 6 months? 2. I

Hamid 2C wrote: > Hi all, > > I am working on some old code which was compiled against llvm-2.5. > Anyway, in some places I, AllocationInst is used (e.g. to ensure the > instruction's type). Even in your current documentation > (http://llvm.org/docs/ProgrammersManual.html), I found an example that > uses this instruction. > If I got it correctly, this istruction

Hi Nadav, Thanks for the quick reply !! Ok, so as of now we are lacking capability to handle flat large reductions. I did go through function vectorizeChainsInBlock() (line number 2862). In this function, we try to vectorize if we have phi nodes in the IR (several if's check for phi nodes) i.e we try to construct tree that starts at chains. Any pointers on how to join multiple trees? I

Hi Arnold, Thanks for your reply. I tried test case as suggested by you. *void foo(int *a, int *sum) {*sum = a[0]+a[1]+a[2]+a[3]+a[4]+a[5]+a[6]+a[7]+a[8]+a[9]+a[10]+a[11]+a[12]+a[13]+a[14]+a[15];}* so that it has a 'store' in its IR. *IR before vectorization :*target datalayout = "e-m:e-p:32:32-f64:32:64-f80:32-n8:16:32-S128" target triple =

Hi Suyog, Thanks for looking at this. This has recently got itself onto my TODO list too. > I am not sure how much all this will improve the code quality for horizontal reduction > (donno how frequently such pattern of horizontal reduction from same array occurs in real world/SPECS). Actually the main loop of 470.lbm can be SLP vectorized like this. We have three parts to it: A fully