search for: hayarm

FInally I had the time to complete everything up. Now I included the test case in the patch and the testcase runs with the LLVM tests system. 2012/2/9 Marcello Maggioni <hayarms at gmail.com>: > This is instead a very simple (handmade) test case that triggers the > problem (attached) > Also a more conforming patch has been attached > > 2012/2/9 Marcello Maggioni <hayarms at gmail.com>: >> This is the .ll for that graph (attached). I think I u...

...t block that jumps to a block with an unconditional jump that jumps to the loop header and that has as unique predecessor the exit block) is equivalent to jumping directly to the loop header. 2012/2/9 Nick Lewycky <nlewycky at google.com>: > On 8 February 2012 15:50, Marcello Maggioni <hayarms at gmail.com> wrote: >> >> Well, it wasn't intended as a "real" patch to be included , but more >> as a "proof of concept" for a solution. Do you think it is a valid >> solution and I'm correct in my assumption? If so then I'll clean up &g...

This is instead a very simple (handmade) test case that triggers the problem (attached) Also a more conforming patch has been attached 2012/2/9 Marcello Maggioni <hayarms at gmail.com>: > This is the .ll for that graph (attached). I think I understand what > you are saying. > This particular testcase returns CNC not because the exit block > doesn't have a unique predecessor, but because the unique predecessor > (the inner loop block) has a suc...

...n into when he tried to update a TargetMachine by > placement newing a new one into it. > > Can you elaborate a bit more about what you're trying to do? (I > realize this may be difficult for reasons.) > > -eric > > On Tue, Jun 24, 2014 at 10:44 AM, Marcello Maggioni <hayarms at gmail.com> > wrote: > > Hello, > > > > the need here is to have a single LLVMContext used for multiple > > compilations. > > > > You make a good point about that by the way. If there are outstanding > users > > cleaning the context under their...

On 11/18/2011 01:36 PM, Marcello Maggioni wrote: > 2011/11/18 Marcello Maggioni<hayarms at gmail.com>: >> The patch is attached. >> >> The patch to correct the test runs on OSX will be posted shortly after >> this one (I preferred to separate the two so that a problem with >> either one of the two wouldn't give problems to the other and also to &g...

...est/Analysis/ScalarEvolution for > examples. "BranchInst* " should be "BranchInst *". You should have spaces > after the // in your comments. One of the comment lines isn't indented > properly. > > Nick > > On 8 February 2012 12:05, Marcello Maggioni <hayarms at gmail.com> wrote: >> >> Attached >> >> 2012/2/8 Marcello Maggioni <hayarms at gmail.com>: >> > Mmm, sorry, the patch I posted crashes if ExitBr is null (which it may >> > be ...) , this one should be ok (and passess all the ScalarEvolution >...

On 8 February 2012 15:50, Marcello Maggioni <hayarms at gmail.com> wrote: > Well, it wasn't intended as a "real" patch to be included , but more > as a "proof of concept" for a solution. Do you think it is a valid > solution and I'm correct in my assumption? If so then I'll clean up > the patch and att...

...y be at risk of breaking if you > mutate the LLVMContext underneath them? > > & if you don't have outstanding users, is there any particular benefit > to resetting the LLVMContext compared to just making a new one? > > On Tue, Jun 24, 2014 at 7:18 AM, Marcello Maggioni <hayarms at gmail.com> > wrote: > > Hello, > > > > I'm trying to develop a way to reliably clean the LLVMContext in order to > > make it possible to use it multiple times. > > > > LLVMContext itself is an almost empty object delegating almost all its > >...

Attached 2012/2/8 Marcello Maggioni <hayarms at gmail.com>: > Mmm, sorry, the patch I posted crashes if ExitBr is null (which it may > be ...) , this one should be ok (and passess all the ScalarEvolution > tests in LLVM): > > diff --git a/lib/Analysis/ScalarEvolution.cpp b/lib/Analysis/ScalarEvolution.cpp > index daf7742...

...should include a testcase, see test/Analysis/ScalarEvolution for examples. "BranchInst* " should be "BranchInst *". You should have spaces after the // in your comments. One of the comment lines isn't indented properly. Nick On 8 February 2012 12:05, Marcello Maggioni <hayarms at gmail.com> wrote: > Attached > > 2012/2/8 Marcello Maggioni <hayarms at gmail.com>: > > Mmm, sorry, the patch I posted crashes if ExitBr is null (which it may > > be ...) , this one should be ok (and passess all the ScalarEvolution > > tests in LLVM): > &...

2011/11/18 Marcello Maggioni <hayarms at gmail.com>: > 2011/11/15 Marcello Maggioni <hayarms at gmail.com>: >> 2011/11/14 Tobias Grosser <tobias at grosser.es>: >>> On 11/14/2011 02:45 PM, Marcello Maggioni wrote: >>>> >>>> 2011/11/14 Tobias Grosser<tobias at grosser.es>:...

Marcello Maggioni <hayarms at gmail.com> writes: > I'm working on an LLVM backend for a new target architecture which has > some instructions that when executed implicitly produce a result in a > particular register after a certain amount of cycles. > > The situation is this : > > 1: Execute ins...

Hi David, can you point me to an instruction in the X86 architecture that uses this? The MUL instruction would be a good example? Thanks Marcello 2012/10/2 <dag at cray.com> > Marcello Maggioni <hayarms at gmail.com> writes: > > > I'm working on an LLVM backend for a new target architecture which has > > some instructions that when executed implicitly produce a result in a > > particular register after a certain amount of cycles. > > > > The situation is th...

Hi, I'm working on an LLVM backend for a new target architecture which has some instructions that when executed implicitly produce a result in a particular register after a certain amount of cycles. The situation is this : 1: Execute instruction 2: Wait for result 3: Wait for result 4: Wait for result 5: Read from register The value in the special register needs to be protected until the

...&& !Ok; ) { BasicBlock *Pred = BB->getUniquePredecessor(); if (!Pred) return getCouldNotCompute(); anyway, this patch is only "a concept" of what I'm talking about. PS=Sorry for the bad english in the previous post :p 2012/2/8 Marcello Maggioni <hayarms at gmail.com>: > Hello, I'm finding problems with BackEdgeTaken count calculation in > even simple fortran loops with gfortran-4.6 + DragonEgg 3.0. > > Even for simple double loops like this one: > >       program test2 >       integer i,j,k >       dimension k(100,1...

...lock '%for.body3.single_entry' ./compile_ex.sh: line 9: 36824 Segmentation fault: 11 opt -load ${PATH_TO_POLLY_LIB}/LLVMPolly.dylib -polly-scops -analyze $1.preopt.ll Also I want to ask: Why Bitcast instructions make polly discard scops? Thanks Marcello 2011/10/27 Marcello Maggioni <hayarms at gmail.com>: > Perfect, thank you very much :) > > 2011/10/26 Tobias Grosser <tobias at grosser.es>: >> On 10/24/2011 11:32 PM, Marcello Maggioni wrote: >>> >>> Strange , with --enable-shared (I use auto tool by the way ...) it gives: >>> >&g...

2011/11/15 Marcello Maggioni <hayarms at gmail.com>: > 2011/11/14 Tobias Grosser <tobias at grosser.es>: >> On 11/14/2011 02:45 PM, Marcello Maggioni wrote: >>> >>> 2011/11/14 Tobias Grosser<tobias at grosser.es>: >>>> >>>> On 11/14/2011 01:24 AM, Marcello Maggioni wrot...

Hi Tobias, thanks for the answer. I'll try to give a look to the code you pointed me to , and I'll try to make the modification myself. I'm new to LLVM and Polly, but the code of both seem clean and understandable, so I hope to be able to do it myself. In case I'll ask here for support :) Marcello 2011/10/1 Tobias Grosser <tobias at grosser.es>: > On 10/01/2011 03:26

Perfect, thank you very much :) 2011/10/26 Tobias Grosser <tobias at grosser.es>: > On 10/24/2011 11:32 PM, Marcello Maggioni wrote: >> >> Strange , with --enable-shared (I use auto tool by the way ...) it gives: >> >> MacBook-Pro-di-Marcello:examples Kariddi$ ./compile_ex.sh >> not_so_simple_loop >> clang (LLVM option parsing): Unknown command line

...A[j] = k; return 0; } gives: [hades at artemis examples]$ ./compile_ex.sh super_simple_loop Printing analysis 'Polly - Detect Scops in functions' for function 'main': Valid Region for Scop: %1 => %5 [hades at artemis examples]$ 2011/10/7 Marcello Maggioni <hayarms at gmail.com>: > Hi, > > for example this loop: > >  #include <stdio.h> > >  int main() >  { >          int A[1024]; >          int j, k=10; >          for (j = 1; j < 1024; j++) >                  A[j] = k; > >        return 0; > } > &gt...