search for: prashantha

>On Aug 16, 2012, at 1:09 PM, "Rao, Prashantha" <Prashantha.Rao at amd.com<mailto:Prashantha.Rao at amd.com>> wrote: >Hi- >I am writing a pass to traverse loops and collect some analysis data and later on come back to transform the IR. In the analysis phase I need to >remember statistics regarding every loop in the...

From: Andrew Trick [mailto:atrick at apple.com] Sent: Tuesday, August 21, 2012 9:58 PM To: Rao, Prashantha Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] How to uniquely remember a loop? On Aug 21, 2012, at 4:17 AM, "Rao, Prashantha" <Prashantha.Rao at amd.com<mailto:Prashantha.Rao at amd.com>> wrote: More than one loop may share the same header; You have a different definitio...

Hi- I am writing a pass to traverse loops and collect some analysis data and later on come back to transform the IR. In the analysis phase I need to remember statistics regarding every loop in the program. What is the best way to uniquely remember a loop? Thanks, -Prashantha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120816/fb2f47d5/attachment.html>

On Aug 21, 2012, at 4:17 AM, "Rao, Prashantha" <Prashantha.Rao at amd.com> wrote: > More than one loop may share the same header; You have a different definition of loop than the rest of the optimizer. You can identify your loops by the backedge if you prefer. > I can certainly run LoopSimplify as a prepass. But will that en...

On Aug 16, 2012, at 1:09 PM, "Rao, Prashantha" <Prashantha.Rao at amd.com> wrote: > Hi- > > I am writing a pass to traverse loops and collect some analysis data and later on come back to transform the IR. In the analysis phase I need to remember statistics regarding every loop in the program. What is the best way to uniq...

It would be great to get "accurate" dependence analysis from polyhedral framework. Anyone working on making polly into analysis+Transforms framework? -Prashantha -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Sahasrabuddhe, Sameer Sent: Monday, October 08, 2012 9:03 AM To: Hal Finkel; Javed Absar Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] LLVM Loop Vectorizer (Nadav Rotem) > -...

On 10/08/2012 06:58 AM, Rao, Prashantha wrote: > It would be great to get "accurate" dependence analysis from polyhedral framework. Anyone working on making polly into analysis+Transforms framework? Polly is already divided into analysis and transformation passes. However, the interface is currently specific to the needs o...

> -----Original Message----- > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On > Behalf Of Hal Finkel > Sent: Monday, October 08, 2012 1:35 AM > > I'd like to add that, mostly through Tobi's efforts, we were able to have isl (the > integer set library) on which Polly depends relicensed such that it is now > distributed under the MIT

Can we not run the -insert-edge-profiling and -profile-loader passes at the beginning of the opt? Orthogonal point is, is it worth doing any optimizations when -insert-edge-profiling is specified on command line? -Prashantha -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Alastair Murray Sent: Wednesday, September 19, 2012 7:19 PM To: apala guha Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] counting branch frequencies Hi Apala, Dibyendu is cor...

We are trying to implement data layout optimizations in LLVM. This requires us to do a global analysis followed by global transformations. What is the best way to structure the pass(es) in such a scenario? thanks, -Prashantha -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20120821/a3c019b4/attachment.html>

Hi Apala, Dibyendu is correct that this is likely due to pass order, but things get a bit complicated with -O[1-9] or -std-compile-opts as they insert early passes *before* the profiling code. I recommend that you use identical optimizations to insert instrumentation and to load the profiling data. E.g.: opt -insert-edge-profiling -O3 foo.bc -o foo.2.bc opt -profile-loader -O3 foo.bc

I tried getting profile data from LLVM 3.1, using the method mentioned below. I tried it out on a simple matrix multiplication program. However, I noticed the following problems: 1. There is a warning message: "WARNING: profile information is inconsistent with the current program!" 2. The basic block counts (obtained from ProfileInfo::getExecutionCount(const BasicBlock*)) are

Is this a relevant location to provide information about what I believe is a compiler bug in clang? If not, please forgive me for posting it here. (Perhaps you can redirect me to some place more appropriate.) If so, here are the details: I have a short 15-line C++ program using only one standard header that clang fails to compile properly under C++11 with the new standard library (although the

Hi, We are currently working on revising a journal article that describes our work on pre-allocation scheduling using LLVM and have some questions about LLVM's pre-allocation scheduler. The answers to these question will help us better document and analyze the results of our benchmark tests that compare our algorithm with LLVM's pre-allocation scheduling algorithm. First, here is a