search for: zhousheng

...> same code > To: "LLVM Developers Mailing List" <llvmdev at cs.uiuc.edu> > Message-ID: > <16e5fdf90808121323g1ae2a2e3lb6c5bd62521df621 at mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > On Tue, Aug 12, 2008 at 1:24 AM, Sheng Zhou <zhousheng at autoesl.com> wrote: > >> > Hi, >> > >> > The following two segments of code are actually the same, >> > but llvm created different cfg for them. >> > >> > ... > >> > >> > The prime difference is that: cfg...

Hi, The following two segments of code are actually the same, but llvm created different cfg for them. Form1: 1 #define N 10 2 int test(int A[N][N]) 3 { 4 int i, j; 5 int result =0; 6 for(j=0; j+2<N; ++j) { 7 //for(i=0; i<j && i+j+1<N; i++) { 8 for(i=0; i<j && i<N-j-1; i++) { 9 A[i+j+1][j] = A[j + 2][j-i] + i; 10 } 11 } 12 13 for (i=0; i<N-2; ++i) 14 for (j=0;

> > > Having the final .ll file doesn't help debug this. If you run opt > -analyze -scalar-evolution on the .ll you pasted, it will correctly > print out the loop trip count. > > I've modified llvm-gcc to remove all the passes after indvars. > > I updated my llvm and now it works. >> > Surely the loop trip count is 256, but the Loop::getTripCount()

>> 7 for(i=0; i<j && i+j+1<N; i++) { >> >> 8 for(i=0; i<j && i<N-j-1; i++) { >> >> >> Line 7 and Line 8 actually have the same expression, >> > > The expressions are logically similar, but they aren't the same to the > compiler unless some pass that recognizes these types of polynomial > equations and

Hi, Is there anybody familiar with the code in llvm/lib/Transforms/Utils/SimplifyCFG.cpp? The function FoldBranchtoCommonDest() (line 1422) has the comment as following: "/// FoldBranchToCommonDest - If this basic block is ONLY a setcc and a branch, /// and if a predecessor branches to us and one of our successors, fold the /// setcc into the predecessor and use logical operations to pick

> > Are you able to run nightly test ? > Yes, I can run nightly test. > Here is what I see... > > $ make TEST=dbgopt > /Developer/usr/bin//llvm-gcc sse.expandfft.c -g --emit-llvm -c -o > Output/sse.expandfft.bc > /Volumes/Nanpura/mainline/llvm/Debug/bin/opt Output/sse.expandfft.bc - > strip-nondebug -strip-debug -std-compile-opts -strip -f -o Output/ >

Hi Patel, Thanks for your comments, some reply below... (This is the first part, I'll send the second part later) > 2.1 Verification Flow > > The most important of this project is to make the debug information > > do not block any optimization by LLVM transform passes. Here I > > propose a way to determine whether codegen is being impacted by > > debug info.

Hi Patel, Here is second part of my reply. > 2. Proposed Work Plan > > This section defines a proposed work plan to accomplish the > > requirements that we desires. The work plan is broken into several > > distinct phases that follow a logical progression of modifications > > to the LLVM software. > > > > 2.1 Phase 1: Establish the testing