search for: adanalis

On Apr 13, 2009, at 3:32 PM, Eli Friedman wrote: > On Mon, Apr 13, 2009 at 9:06 AM, Anthony Danalis <adanalis at eecs.utk.edu > > wrote: >> How can I use MemoryDependenceAnalysis (or any other analysis for >> that >> matter) to gather that the instructions >> j = N/2 (store i32 %11, i32* %j, align 4) >> and >> N = N+7 (store i32 %12, i32* %n, align 4) >>...

On Mon, Apr 13, 2009 at 9:06 AM, Anthony Danalis <adanalis at eecs.utk.edu> wrote: > How can I use MemoryDependenceAnalysis (or any other analysis for that > matter) to gather that the instructions > j = N/2  (store i32 %11, i32* %j, align 4) > and > N = N+7  (store i32 %12, i32* %n, align 4) > are the ones that define the parameters &...

...newbie myself, I can relate to what problems someone new to llvm would have.While I think most of the stuff I have tried will be useful, I wouldn't be entirely sure if its the best way to go about it. Thanks Nipun Arora Columbia University On Wed, Mar 11, 2009 at 11:01 AM, Anthony Danalis <adanalis at eecs.utk.edu>wrote: > > On Mar 11, 2009, at 10:53 AM, Jon Harrop wrote: > > > On Wednesday 11 March 2009 14:19:28 Vikram S. Adve wrote: > >> In principle, having a Wiki like this would be valuable. In > >> practice, > >> I think there will need to b...

On Mar 11, 2009, at 10:53 AM, Jon Harrop wrote: > On Wednesday 11 March 2009 14:19:28 Vikram S. Adve wrote: >> In principle, having a Wiki like this would be valuable. In >> practice, >> I think there will need to be some sanity checking to make sure >> incorrect or misleading information is not added to it. > > Yes, I think a Wiki would be extremely valuable.

Hi Anthony, 2009/3/30 Anthony Danalis <adanalis at eecs.utk.edu> > Is the user expected to add the calls to spawn/join or the compiler? If > it's the compiler adding them, then you don't need to change the front-end > at all, you can do all that in an optimization pass. If it's the user > adding them, then adding ca...

Hello, I have a code similar to the following: program test integer i, j, N real B(10) call bar(N, 8) N = N+1 do i = 1, N B(i) = (i+5)/(i+3) enddo j = N/2 N = N+7 call IMPORTANT_F(B, N, i, j) end program and I am trying to use dependence

I agree too. I'm working on an analysis pass and I could be adding info to a wiki as I discover how to do things. Anthony On Mar 11, 2009, at 4:22 AM, someguy wrote: > Hi all, > > I'm pretty new to LLVM and am slowly learning the code-base and > architecture, mostly as a result of my efforts to implement a target > backend. > > There are a number of resources

...t problems someone new to > llvm would have. > While I think most of the stuff I have tried will be useful, I wouldn't be > entirely sure if its the best way to go about it. > Thanks > Nipun Arora > Columbia University > On Wed, Mar 11, 2009 at 11:01 AM, Anthony Danalis <adanalis at eecs.utk.edu> > wrote: >> >> On Mar 11, 2009, at 10:53 AM, Jon Harrop wrote: >> >> > On Wednesday 11 March 2009 14:19:28 Vikram S. Adve wrote: >> >> In principle, having a Wiki like this would be valuable.  In >> >> practice, >> >...

...ion that could require non-trivial interprocedural analysis to extract. --Vikram Associate Professor, Computer Science University of Illinois at Urbana-Champaign http://llvm.org/~vadve On Mar 30, 2009, at 10:09 AM, Milos Puzovic wrote: > Hi Anthony, > > 2009/3/30 Anthony Danalis <adanalis at eecs.utk.edu> > Is the user expected to add the calls to spawn/join or the > compiler? If it's the compiler adding them, then you don't need to > change the front-end at all, you can do all that in an optimization > pass. If it's the user adding them, then addi...

I think your idea is very interesting. However, some of the issues that concern you might not be as bad as you think. On Mar 30, 2009, at 9:19 AM, Milos Puzovic wrote: > 2009/3/30 someguy <just.s0m3.guy+llvmdev at gmail.com> > Can you not achieve the same effect without adding intrinsics? > Insert function calls to a __spawn and __join pseudo-function instead? > It would

Hi all, I'm pretty new to LLVM and am slowly learning the code-base and architecture, mostly as a result of my efforts to implement a target backend. There are a number of resources (read: documents) available which deal with some parts of backend development (and LLVM development in general), but sadly they are not at all comprehensive. I'd like to propose that a wiki be made available

2009/3/30 someguy <just.s0m3.guy+llvmdev at gmail.com<just.s0m3.guy%2Bllvmdev at gmail.com> > > Can you not achieve the same effect without adding intrinsics? Insert > function calls to a __spawn and __join pseudo-function instead? > It would make LLVM code generation more difficult because instead of building a new instruction (in this case intrinsic) you will be building

Hello, I'm writing a new function pass, and I'm having trouble with getTripCount() in Loop. If I generate the bitcode for the test code with no optimization then getTripCount() returns NULL, but if I pass - O3 to the front-end then getTripCount() returns fine. My phase calls addRequiredID(LoopSimplifyID) from getAnalysisUsage() and I also tried putting -mem2reg at the front

I was using 2.4, but I built 2.5 and it behaves the same. I will test the SVN head too. On Mar 11, 2009, at 10:41 PM, Nick Lewycky wrote: > Anthony Danalis wrote: >> Hello, >> >> I'm writing a pass that adds a function prototype to the module >> during >> doInitialization() and stores the pointer in a global variable. If I >> run opt with

Hello, I'm having some trouble with getTripCount() ... again. In particular it fails in the first of the following two examples, although it works for the second. By fails, I mean it returns NULL. ---------- example 1 ---------- test1(int *a, const int *ip) { int k; for (k = 0; k < ip[2]; ++k) { a[k] = (k+11)/(k+2); } } ---------- example 2 ---------- test2(int

Hello everybody, If anybody is about to graduate and is looking for a research position, ICL at the University of Tennessee (http://icl.cs.utk.edu) is looking for a compilers person. We are looking for somebody with practical experience in compiler technology and some understanding of linear algebra. Sorry for spamming the list with non-development content, but I hope a lot of

Hi Mikhail, Can you please attach a simple .bc file that is subject to this problem? Anthony On Apr 21, 2009, at 7:33 AM, Mikhail Glushenkov wrote: > Hi, > > I try to iterate over all uses of a Function with the following > code (simplified): > > for (Value::use_iterator UI = F->use_begin(), UE = F->use_end(); > UI != UE; ++UI) { > >

On Apr 25, 2009, at 5:05 PM, Chris Lattner wrote: > > On Apr 13, 2009, at 12:01 PM, Anthony Danalis wrote: > >> I'm attaching the .bc file. Note that my analysis pass is invoked >> after "-O1" and that's why the IR I included in the original email >> is optimized. > > Hi Anthony, > > Sorry for the delay, things have been crazy lately. >

Hello, I'm trying to construct a string like "a[1][x].y" in an optimization pass by digging deeper and deeper into a GetElementPtrInst. I can successfully deal with the array/pointer part, but when it comes to the structure field name "y", I cannot figure out how to get anything but the index into the structure. Is there a way to do that, or is this information

On Mar 27, 2009, at 9:15 PM, Dan Gohman wrote: > > On Mar 26, 2009, at 8:28 AM, Mihai Balint wrote: >> >> This summer however, I plan to create an "optimization" that >> automatically fixes memory leaks in programs - obviously only those >> that can be fixed with the available information, for example: > > Hello, > > This doesn't sound