similar to: [LLVMdev] How to uniquely remember a loop?

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 uniquely remember a loop? Probably too late to help

>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 program. What is the best way to uniquely

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 ensure unique loop header for each loop. It tries

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

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 of polyhedral optimizers. If there is interest to use e.g.

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

> -----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

hi, i`m working on a machine instruction scheduler for an VLIW architecture. loads are somewhat expensive on this architecture, thus i would like to reorder unrelated loads/stores to better hide load latencies. to do this, i would need alias information on machine instructions, i.e., which machine instructions may access the same memory region. as far as i know, this is not available at the

On Mon, 30 Apr 2007, Florian Brandner wrote: > i`m working on a machine instruction scheduler for an VLIW architecture. > loads are somewhat expensive on this architecture, thus i would like to > reorder unrelated loads/stores to better hide load latencies. > > to do this, i would need alias information on machine instructions, > i.e., which machine instructions may access the

Chris Lattner wrote: > There are a couple of ways to do this. Is your scheduler a prepass > scheduler (before regalloc) or a post-pass scheduler (after regalloc)? it is a post-pass scheduler, which operates on MachineInstrs. we need to run it after register allocation to hide latencies of spill code, prolog, and epilog. > If you want to extract maximal parallelism, I assume you want a

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:

Signed-off-by: Attilio Rao <attilio.rao@citrix.com> Acked-by: Ian Campbell <ian.campbell@citrix.com> --- Differences with previous revision: - Improvements to the manpage: * s/operated/made * s/compatbile/compatible * New paragraph for rombios, provided by Ian * s/force/request * redundant line removal in UEFI explanatory * Wrap of lines at 80 cols diff -r adcd6ab160fa

just for my curiosity, How can we make sure that its not affected? Is there any script to check whether its vulnerable or not (as in bash shell shock vulnerability test)? On Tue, Mar 31, 2015 at 12:25 PM, Eero Volotinen <eero.volotinen at iki.fi> wrote: > Centos 5 is not affected by this bug, so fix is not available. > > Eero > 31.3.2015 9.48 ap. kirjoitti "Venkateswara

We are using following dtrace script to analyze an application. However we see different number of lwp_yield and yield calls reported depending on whether we trace mutex_lock or mutex_unlock or not. The number reported when we are not tracing mutex_lock or mutex_unlock is higher. What could be going on here and which one is the correct number. This is on S10 U2. Thanks, Rao.

Hi! I need to perform ANOVA on a couple of data sets. The only information I have are N, Mean and Standard deviation. I am very new to R, so can someone point me to the right direction on where to go? Thank you very much. Sincerely Niny Rao, PhD Philadelphia University

Thanks for the reply. If we want to have PV kernel for CentOs 7 , are there any guidelines to follow? How we can know before hand itself that this kernel is PV or HVM, without installing kernel? On Wed, Aug 19, 2015 at 11:27 AM, John R Pierce <pierce at hogranch.com> wrote: > On 8/18/2015 10:37 PM, Venkateswara Rao Dokku wrote: > >> Thanks for the reply. >> Sorry for the

Hi All, I wanted to fix the openssl vulnerabilities (CVE-2014-3569, CVE-2014-3570, CVE-2014-3571, CVE-2014-3572) in my CentOS 5.5 and found out that 0.9.8zd has the fixes I am looking for (from the https://www.openssl.org/news/vulnerabilities.html link). But, When I tried to find the openssl-0.9.8zd rpm package, I did not find it in http://mirror.centos.org/centos/5/updates/x86_64/RPMS/. The

Thanks for the replies. The tool that we used for testing the security vulnerability is "Nessus". I have glibc version 2.17-78.el7, I saw that CVE-2015-0235 (Ghost) is fixed in this version and I want to apply patch for the vulnerbailities CVE-2015-1472 & CVE-2015-1473. Can you please help me in finding the right version that has fixes for these? Thanks On Sat, Apr 25, 2015 at

Hi, while generating the PDF file , i am getting following error.. please help for me. RuntimeError (JPEG marker not found!): C:/Ruby/lib/ruby/gems/1.8/gems/pdf-writer-1.1.8/lib/pdf/writer/ graphics/imageinfo.rb:176:in ` measure_JPEG'' C:/Ruby/lib/ruby/gems/1.8/gems/pdf-writer-1.1.8/lib/pdf/writer/ graphics/imageinfo.rb:174:in ` loop''