similar to: [LLVMdev] DFG?

And one last thing, the problem seems to be related to libcpp. Using only C frontend will work? 2008/7/7 Julio <julio.martin.hidalgo at gmail.com>: > Hi, well, I downloaded the head revision of llvm and llvm-gcc. As you said > it hangs at: > > Formal argument #0 has unhandled type f32 > /home/julio/trunk/llvm-gcc/gcc/libgcc2.c:1765: internal compiler error: > Abortado

Hi Andrew, Thanks for the response. That helps a lot. So that means I have to implement a pass, right ? Sorry for dumb question. I just started LLVM today.   =========================================== Phone : 82-42-860-1838 Fax : 82-42-860-6790 Cell Phone: 82-10-7599-1981 =========================================== --- On Thu, 6/30/11, Andrew Trick <atrick at apple.com> wrote:

Unless someone else responds with "I've already done that" then you need to implement a pass. It's probably something you want to customize to your needs anyway. -Andy On Jun 30, 2011, at 11:50 PM, janarbek wrote: > Hi Andrew, > Thanks for the response. That helps a lot. > > So that means I have to implement a pass, right ? Sorry for dumb question. I just started

Hi, well, I downloaded the head revision of llvm and llvm-gcc. As you said it hangs at: Formal argument #0 has unhandled type f32 /home/julio/trunk/llvm-gcc/gcc/libgcc2.c:1765: internal compiler error: Abortado Please submit a full bug report, with preprocessed source if appropriate. Actually, I don't need fp, there is any way to disable? By the way, I'm working with a MIPS coprocessor

I tried debugging it and the issue seems to be in the implementation of MachineInstrIterator.h and the way it interacts with GraphWriter.h functions. I found this by replacing the ( template <> struct GraphTraits<MCDFGraph<MachineFunction*> >) with a similar MCDFGraph based template of CFG similar to the one in MachineFunction.h (similarly replacing the DOTGraphTraits with the

Hi All, I am reposting my question again since i think my question was not clear enough. I am wondering is it possible to generate Control Data Flow Graph from C using LLVM? or is it possible to get web-like structure of C code using llvm / Thanks in advance, Any comment suggestion would be appreciated. Jan Ma.   =========================================== --- On Thu, 6/30/11, janarbek

Hi, I have been trying my hand on writing a simple traversal of the graph node. I see the opt can print me a CFG for a given IR, is there some tool which i can use to print a DFG (data-flow graph) for the IR ? thanks and regards Tarique -------------- next part -------------- An HTML attachment was scrubbed... URL:

On 22 August 2013 13:24, Redmond, Paul <paul.redmond at intel.com> wrote: > Hi, > > I'm trying to get the following loop to vectorize (simple reduction): > > unsigned int sum2(unsigned int *a, int len){ > unsigned int s = 0; > for (int i = 0; i < len; i += 4) > s += *a++; > return s; > } > > > The loop fails to vectorize because SCEV

Hi Julio, On Mon, Jul 7, 2008 at 6:53 AM, Julio <julio.martin.hidalgo at gmail.com> wrote: > And one last thing, the problem seems to be related to libcpp. Using only C > frontend will work? The problem is with libgcc2, which contains libcalls needed to support some operations your processor cant directly do. >> Actually, I don't need fp, there is any way to disable?

Hi, I am trying to generate the DFG of machine functions. Initially, I added a pass to generate the DFG of LLVM IR functions. This was based on the mail thread - http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-September/025582.html. This pass worked fine and I was able to generate DFG of LLVM IR functions. Later, I ported the DFG pass code for machine functions. I ported the InstIterator.h

Hi, Seems pass scalar-evolution+indvars fail to get the loop trip count of the following case: int foo(int x, int y, int lam[256], int alp[256]) { int i; int z = y; for (i = 255; i >= 0; i--) { z += x; lam[i] = alp[i]; } return z; } The final optimized ll code is : define i32 @foo(i32 %x, i32 %y, i32* %lam, i32* %alp) nounwind { entry: br label %bb bb:

On Jun 30, 2011, at 10:05 PM, janarbek wrote: > > Hi All, > I am reposting my question again since i think my question was not clear enough. > I am wondering is it possible to generate Control Data Flow Graph from C using LLVM? or is it possible to get web-like structure of C code using llvm / > > Thanks in advance, > Any comment suggestion would be appreciated. > >

On Wed, Jan 22, 2014 at 1:01 AM, Andrew Trick <atrick at apple.com> wrote: > On Jan 22, 2014, at 12:44 AM, Chandler Carruth <chandlerc at gmail.com> > wrote: > > > On Wed, Jan 22, 2014 at 12:33 AM, Andrew Trick <atrick at apple.com> wrote: > >> > There appear to be two chunks of "functionality" provided by loop >> passes: >> >

​Hi, Would you be able to kindly check and assist with the IndVarSimplify / SCEV problem I got in the latest LLVM, please? Sometimes IndVarSimplify may not eliminate narrow IV's when there actually exists such a possibility. This may affect other LLVM passes and result in inefficient code. The reproducing test 'indvar_test.cpp' is attached. The problem is with the second

Hi Dan, I whipped up this patch as a more optimal test of whether replacing the phi node PN by V will break LCSSA form. I hope it is more or less correct, but since I know nothing about loops it could well be completely bogus :) Can you please comment on it. Best wishes, Duncan. -------------- next part -------------- A non-text attachment was scrubbed... Name: lcssa.diff Type: text/x-patch

Hi Hideki, Thanks for the interesting writeup! > On Aug 27, 2016, at 7:15 AM, Renato Golin via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > On 25 August 2016 at 05:46, Saito, Hideki via llvm-dev > <llvm-dev at lists.llvm.org> wrote: >> Now, I have one question. Suppose we'd like to split the vectorization decision as an Analysis pass and vectorization

Hi, I'm trying to get the following loop to vectorize (simple reduction): unsigned int sum2(unsigned int *a, int len){ unsigned int s = 0; for (int i = 0; i < len; i += 4) s += *a++; return s; } The loop fails to vectorize because SCEV could not compute the loop exit count. It appears SCEV cannot handle the non-unit increment of the loop counter. Is this a known limitation of

Hi Julio, On Sun, Jul 6, 2008 at 1:58 PM, Julio <julio.martin.hidalgo at gmail.com> wrote: > Hello, I'm trying to compile llvm-gcc to crosscompile mips. I have already > modified a config.gcc to add mips as a target with llvm, but it gives me > "Did not get a target machine!" (from llvm-backend.cpp). > > I thought that I had to modify TargetMachOWriterInfo.h

instcombine doesn't seem to be doing it. From my testing it seems to only occur when I use -indvars after a long string of commands. For example: llvm-as < test_fc_27.ll | opt -preverify -domtree -verify -lowersetjmp -raiseallocs -simplifycfg -domtree -domfrontier -mem2reg -globalopt -globaldce -ipconstprop -deadargelim -instcombine -simplifycfg -ba siccg -prune-eh -inline

On Nov 17, 2010, at 11:03 AM, Duncan Sands wrote: > Hi Dan, I whipped up this patch as a more optimal test of whether > replacing the phi node PN by V will break LCSSA form. I hope it > is more or less correct, but since I know nothing about loops it > could well be completely bogus :) Can you please comment on it. Looks good to me. Thanks, Dan