search for: jimborean

...original version. I will always keep an original version available, in addition to the ones I modify with Polly. However, initially I will speculate that it is allocated contiguously. Thanks, Alexandra ________________________________ From: Renato Golin <rengolin at systemcall.org> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: Tobias Grosser <tobias at grosser.es>; llvmdev at cs.uiuc.edu Sent: Tue, July 19, 2011 11:39:02 AM Subject: Re: [LLVMdev] speculative parallelization in LLVM On 19 July 2011 10:12, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: >...

Only because in my next passes I change the CFG significantly and it is very hard to maintain the values of the Phi nodes. Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 9:36 AM Subject: Re: [LLVMdev] scalar evolution to determine access functio...

...bly we are going to run the scalar evolution on the code containing the phi nodes, run reg2mem and try to identify the original variables in the new code built after reg2mem. Thanks for your advice, Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 2:21 AM Subject: Re: [LLVMdev] scalar evolution to determine access functio...

...zed code versions with Polly in a different manner when there are pointers and indirect references inside the code? Thanks again and good luck with all your work on Polly! Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: llvmdev at cs.uiuc.edu; Jimborean Alexandra <xinfinity_a at yahoo.com> Sent: Tue, July 19, 2011 10:19:54 AM Subject: Re: [LLVMdev] speculative parallelization in LLVM On 07/18/2011 07:03 PM, Jimborean Alexandra wrote: > Hi, > > I plan to do some speculative parallelization in LLVM using Polly and I > target loop...

On 19 July 2011 10:12, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > %curr_array = alloca [10 x %struct.linked], align 8 > > while.. >  %tmp16 = getelementptr inbounds [10 x %struct.linked]* %curr_array, i32 0, > i32 1 Hi Alexandra, Can you guarantee that the linked list will be allocated in contig...

On 07/19/2011 11:46 AM, Jimborean Alexandra wrote: > Hi Renato, > > No, I cannot, but in case it is, I want to take advantage of this. In > case it is not, the instrumentation code will detect this at runtime and > simply roll back to the original version. I will always keep an original > version available, in add...

On 08/03/2011 08:35 AM, Jimborean Alexandra wrote: > Hello Tobi, > > You are right, we need to run some other passes before running the > scalar evolution pass. The sequence that I run for this example is -O3 > -loop-simplify -reg2mem. This is why I did not obtain the expressions > depending on the loop indices. S...

On 08/03/2011 10:22 AM, Jimborean Alexandra wrote: > Only because in my next passes I change the CFG significantly and it is > very hard to maintain the values of the Phi nodes. OK. In Polly we developed a pass called, 'independent-blocks-pass'. It basically creates basic blocks, that can easily be rescheduled witho...

Ok, thank you, I will have a look and reply with questions if necessary. Does it take into consideration the existing phi nodes? Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: Wednesday, August 3, 2011 11:26 AM Subject: Re: [LLVMdev] scalar evolution to determine access functi...

On Wed, Mar 30, 2011 at 11:35 PM, Eli Friedman <eli.friedman at gmail.com> wrote: > On Wed, Mar 30, 2011 at 10:14 AM, Jimborean Alexandra > <xinfinity_a at yahoo.com> wrote: >> Hi, >> >> Is there any method to check if there is a path in the CFG from block M to >> block N, but M does not necessarily dominate block N? >> In other words, if N is reachable from M. > > I don't th...

...etchFunc = Intrinsic::getDeclaration(M, Intrinsic::prefetch); Builder.CreateCall4(PrefetchFunc, PrefPtrValue, ConstantInt::get(I32, MemI->mayReadFromMemory() ? 0 : 1), ConstantInt::get(I32, 3), ConstantInt::get(I32, 1)); -Hal ----- Original Message ----- > From: "Jimborean Alexandra" <xinfinity_a at yahoo.com> > To: llvmdev at cs.uiuc.edu > Sent: Wednesday, April 10, 2013 12:43:23 PM > Subject: [LLVMdev] How to call the llvm.prefetch intrinsic ? > > > > > Hello, > > > Can anyone please guide me how can I replace a loa...

Hi, I want to print the memory locations computed by getelementptr. As I understood, getelementptr does not access the memory, but it contains the address it computes. I want to print these addresses at runtime (or process them). So, I try to build a function that takes as argument a pointer and prints its value. And to call this function, by sending the gep instruction as a parameter.

Hello, How can I compute the functions on the loop iterators used as array indices?  For example: for i = 0, N       for j = 0, M             A[2*i + j - 10] = ...  Can I obtain that this instruction A[2*i + j - 10]= .. always accesses memory using a function       f(i,j)   =   2*i + j - 10 + base_address_of_A If I run the scalar evolution pass on this code I obtain: %arrayidx =

Hello, Can anyone please guide me how can I replace a load instruction with a prefetch. I was looking at the intrinsic creation methods of the IRBuilder, but I can only find functions corresponding to memset, memcpy and memmove intrinsics, not for prefetching. Also, I target x86-64 architectures. Is it sufficient to insert a call to the intrinsic in the LLVM IR to have the corresponding prefetch

...s %struct.linked* %curr.025.reload, i64 0, i32 0 I obtain 2084a10 which is not the memory location I expect. Is this the computed memory location, or I did not access it correctly? Thank you. Alexandra ________________________________ From: John Criswell <criswell at illinois.edu> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: llvmdev at cs.uiuc.edu Sent: Wednesday, July 20, 2011 5:08 PM Subject: Re: [LLVMdev] print the memory address computed by getelementptr On 7/20/11 10:02 AM, Jimborean Alexandra wrote: >Hi, > >I want to print the memory locations computed...

...d also the original version of the function (which requires LPPassManager as parameter), but the output is the same. How can I use the CloneLoop function to clone a loop nest? Thank you. Alexandra ________________________________ From: Eli Friedman <eli.friedman at gmail.com> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: llvmdev at cs.uiuc.edu Sent: Mon, May 9, 2011 4:48:29 PM Subject: Re: [LLVMdev] get LPPassManager to use it in llvm::CloneLoop On Mon, May 9, 2011 at 1:06 AM, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > Hi, > > I try to writ...

On Mon, May 9, 2011 at 1:06 AM, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > Hi, > > I try to write a FunctionPass that, among other tasks, has to clone some > loops from the current function. > How can I obtain the LPPassManager in order to use the CloneLoop function. > In a LoopPass this is a parameter...

...l? Do you have a target with 16-bit bytes? In that case, there is quite a lot of changes that needs to be done (we maintain some patches internally that we can provide upon request). Regards, Patrik Hägglund From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Jimborean Alexandra Sent: den 22 november 2012 13:07 To: llvmdev at cs.uiuc.edu Subject: [LLVMdev] Set the minimum number of allocated bits for a variable Hi, I would like to force the minimum number of bits allocated for a variable in memory to be 16. From what I have seen, i1 is already represented on 8...

On 07/27/2011 03:11 PM, Jimborean Alexandra wrote: > Hello, > > How can I compute the functions on the loop iterators used as array > indices? > > For example: > > for i = 0, N > for j = 0, M > A[2*i + j - 10] = ... > > Can I obtain that this instruction A[2*i + j - 10]= .. always accesses > m...

On 7/20/11 10:02 AM, Jimborean Alexandra wrote: > Hi, > > I want to print the memory locations computed by getelementptr. As I > understood, getelementptr does not access the memory, but it contains > the address it computes. I want to print these addresses at runtime > (or process them). So, I try to build...