similar to: [LLVMdev] LoopInterchange Pass

Hi Satya, On Tue, Jul 13, 2010 at 12:06 PM, Satya Jandhayala < satya_jandhayala at yahoo.com> wrote: > Hi, > > I developed a Loop Interchange pass. Please take a look. > I have not incorporate data dependence analysis check. I can insert it when > the LoopDependenceAnalysis is available. > Have you tried using include/llvm/Analysis/LoopDependenceAnalysis.h ? Please

--- On Tue, 7/13/10, Satya Jandhayala <satya_jandhayala at yahoo.com> wrote: From: Satya Jandhayala <satya_jandhayala at yahoo.com> Subject: LoopInterchange Pass To: llvmdev at cs.uiuc.edu Date: Tuesday, July 13, 2010, 12:06 PM Hi,   I developed a Loop Interchange pass. Please take a look. I have not incorporate data dependence analysis check. I can insert it when the

Updated to remove all the loops in the loop-nest from the queue because there no way to remove specific loop(s) from the queue. Deleting loop(s) from queue using deleteLoopFromQueue changes the loop nest.   -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20100713/3cfda735/attachment.html>

hello, I would like to map (Read/Write) pages owned by a HVM guest from my Dom0 Linux kernel module. I have access to the "machine frame numbers" of these pages. 1. What is the right interface to do this? kmap needs ''struct page'' ptrs which I doubt exist for pages owned by a HVM guest. Is there a hypercall to do this then? 2. Do I need to modify the HVM behavior in

Shanmukha Rao wrote: > I am using LLVM for implementing LoopFission pass. > I am using LoopPass. > I know that for checking circular dependency in loop I have to use LoopDependenceAnalysis > > This is what i want to do. >         for(int i = 0; i< n ; i++){ > s1 : a[i] = a[i] + x[i]; > s2 : x[i] = x[i+1] + i*2 ; > } > >

Hello, I've been playing around with the really simple example of not cache friendly loop like this: #define N 100 void foo(int** __restrict__ a, int** __restrict__ b) { for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) a[j][i] += b[j][i]; } link to compiler explorer:

Hello, i have the application set up on my radrails. I was looking at the view generated by scaffold and i see a bunch of names, after looking up internet i found that they are helpers and generate the HTML for us. Now, i wanted to look at the helper code for start_form_tag, so that based on that i could write some of my own helpers in my helper classes... but i could not find the code

On Thu, 15 Mar 2012 09:57:00 -0700 Preston Briggs <preston.briggs at gmail.com> wrote: > Shanmukha Rao wrote: > > I am using LLVM for implementing LoopFission pass. > > I am using LoopPass. > > I know that for checking circular dependency in loop I have to use > > LoopDependenceAnalysis > > > > This is what i want to do. > >         for(int i =

Hi I am new to this group, i heard that this is a dedicated group with java script experts. if this is true then i want to be part of this. Please make me your friend. -Satya

hi, I''m developing my own 32-bit (no PAE) paravirtualized kernel for xen with Mini-OS as a starting point. I am currently working on process page table support (equivalent of arch/i386/mm/pgtable-xen.c) and mostly following Linux for the moment. I noticed that linux-2.6.18-xen never pins an L1 table (a pte), yet __pgd_pin() walks the page directory and gives up write access on the kernel

Hi Hal, Preston! Sorry for the delay! Got busy with some offline work. I've worked on my previous code to calculate direction and distance vectors whenever possible (strong SIV, basically). I think the current code is much clearer and would like your opinions on it. I have attached the patch and also pushed to the github repo I mentioned [1]. Thanks! [1]

On Thu, Oct 30, 2008 at 11:05 PM, Richard Elling <Richard.Elling at sun.com> wrote: > Philip Brown wrote: >> I''ve recently started down the road of production use for zfs, and am hitting my head on some paradigm shifts. I''d like to clarify whether my understanding is correct, and/or whether there are better ways of doing things. >> I have one question for

Hi Sanjoy, Reading through LoopDependenceAnalysis::analyseStrongSIV(), I noticed one problem and one confusion. My confusion related to your naming of the two instructions as A and B. It's consistent all through LoopDependenceAnalysis. I'd prefer something like source and destination, so I can keep track of which is which. It didn't matter so much when you were simply proving or

Gents, I spent some time reading over Sanjoy's patch for LoopDependenceAnalysis. Unfortunately, an early version of these notes escaped; this is the complete review. First off, I agree with his choice to implement the SIV tests. For scientific Fortran, the SIV (and the simpler ZIV) tests cover about 85% of the cases in practice. For C and C++, I expect the percentage will be much higher.

Shanmuhka wrote: > I looked at the sanjoys patch for SIV Test. And i figured out that this is exactly what i need. > as the comments said, check if subscript A can possibly have the same value as B in analyseSIV(A,B) > but i didn't get How to use this information ? > > lets just say in the above program > When i use depends function it shows the dependency from load of x to

Hi, I am using LLVM for implementing LoopFission pass. I am using LoopPass. I know that for checking circular dependency in loop I have to use LoopDependenceAnalysis This is what i want to do. for(int i = 0; i< n ; i++){ s1 : a[i] = a[i] + x[i]; s2 : x[i] = x[i+1] + i*2 ; } /**there is no dependence from s2 to s1/ so after distribution(it

Hello, I am trying to write a sample application. I have class LineItem< ActiveRecord::Base belongs_to : order end && class Order < ActiveRecord::Base has_one :line_item end Now in the controller i am trying : def add @ord = Order.new(params[:ord]) @ord.line_item = LineItem.new(params[:lineitem]) if @ord.save redirect_to :action => ''list'' else render

Hi, I am running xen-unstable , now i have a Full Virt DomU running RHEL 3 update 5 wanted to know is there a way to convert this vm to Paravirt . regards Satya _______________________________________________ Xen-users mailing list Xen-users@lists.xensource.com http://lists.xensource.com/xen-users

Package: logcheck Version: 1.2.32 Severity: minor "Ghandi" should be "Gandhi" in README.how.to.interpret, assuming that you mean the Indian freedom fighter M.K. Gandhi a.k.a. Mahatma Gandhi. -- System Information: Debian Release: 3.1 APT prefers unstable APT policy: (500, 'unstable') Architecture: i386 (i686) Kernel: Linux 2.6.7 Locale: LANG=C, LC_CTYPE=C

I have a partial to which i pass a collection. That views name is _row. So row.name, row.ssn gives me the details of each object in the collection, But i need to display 1. name 123456798 2. name1 234567890 how to get that Index ??? or count or whatever in that partial ?? please help. -- Posted via http://www.ruby-forum.com/.