similar to: [LLVMdev] Loop transformations using LLVM

Malveeka, You can use the LoopInfo analysis to find the induction variable. http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c Cheers, Nadav From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Malveeka Tewari Sent: Thursday, May 05, 2011 14:51 To: llvmdev at cs.uiuc.edu Subject: [LLVMdev] Loop transformations

On May 5, 2011, at 5:11 AM, Rotem, Nadav wrote: > Malveeka, > > You can use the LoopInfo analysis to find the induction variable. > > http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c > > Cheers, > Nadav getCanonicalInductionVariable is a good example of finding IVs without iterating over instructions. But you may need to

Hi I have the followed code for which I am writing a loop pass. int main() { int i = 0; for (i=0; i<20; i++) { printf ("hello world %d\n", i); } return 0; } In the function runOnLoop, I have the following instruction PHINode *indv = NULL; indv = L->getCanonicalInductionVariable(); However, when I check indv is always set to NULL. Since the code has a canonical

Hi I am running llvm-g++ on a .cpp file to generate the llvm bitcode. The function definition in the .cpp file is: float pFL(Points *points, int *feasible, int numfeasible, float z, long *k, double cost, long iter, float e, int pid, pthread_barrier_t* barrier) { However, in the bit code I see that the function name has been modified to the following define float

Hi, What does your LLVM IR look like. Are you sure the loop hasnt been optimized away? Arushi On Sat, May 21, 2011 at 5:52 PM, Malveeka Tewari <mtewari at eng.ucsd.edu>wrote: > Hi > > I have the followed code for which I am writing a loop pass. > > int main() { > int i = 0; > for (i=0; i<20; i++) { > printf ("hello world %d\n", i); > }

Hi, For one of our research projects, we are planning to use LLVM. We need the following features: 1. We need to aggressively fuse loops that have inter-loop dependencies. 2. We need to identify intrinsic functions and induction variables. 3. We need to detect few memory access patterns like copy, transpose-copy, stride-copy etc. 4. Lastly, auto-vectorization and

On 6/3/11 9:55 PM, Malveeka Tewari wrote: > Hi > > I am running llvm-g++ on a .cpp file to generate the llvm bitcode. > > The function definition in the .cpp file is: > > float pFL(Points *points, int *feasible, int numfeasible, float z, long *k, > double cost, long iter, float e, int pid, pthread_barrier_t* > barrier) { > > However, in the bit code I see

Hi Ganesh, Please have a look at: These core parts of LLVM: http://llvm.org/docs/doxygen/html/classllvm_1_1Loop.html#a72bbf45d2e00971f56bf8cfe4e1df01c http://llvm.org/docs/Vectorizers.html These research projects based on LLVM: http://polly.llvm.org http://aesop.ece.umd.edu I'm not sure what you mean by "identify intrinsic functions". If you really mean LLVM intrinsics,

Dear all, I have a variable called thres and before I run a script I set it to a value like thres<- -10 at the end of the execution I am issuing a save(variablename,file='Results') which will end up with a file saved at the current directory with the name Results   I would like though to use thres value and do the followingg save at the directory called 10 so to get ./10/Results, (yes I

Dear List members, I am trying to produce some trellis graphics and to save them in a postscript file but I only get blank files. R behaviour is certainly strange because I use a loop to generate the graphics (see code below). When I change the loop variable myself the postscript graphics are OK. I am using R 1.9.1 (2004-06-21) on Debian GNU/Linux which I try to keep updated on a daily basis. I

I am trying to create the roc plot bootstrap method from library(verification), and when I set the plot =both or emp then I get the following error. The roc.plot works fine when the plot is set to binorm. This is my first time using this function in R and am not sure what this error means or how to resolve the issue. It seems to work ok with the example dataset. Is there an option or data

Dear All: Significance Analysis of Microarrays(SAM) As we know sam do multiple t.test as following ## Default S3 method: t.test(x, y = NULL, alternative = c("two.sided", "less", "greater"),mu = 0, paired = FALSE, var.equal = FALSE,conf.level = 0.95, ...) var.equal: a logical variable indicating whether to treat the two variances as being equal. If 'TRUE'

This is a first step towards to full iterative compilation framework for Clang/LLVM. The attached patch is work in progress and the idea of sending it to the list earlier rather than later is to open up a discussion on iterative compilation in Clang/LLVM. All comments are welcome, especially those related to integration of the framework into Clang/LLVM. Current compilers have pipeline structure

Forwarding to list :) ~Will ---------- Forwarded message ---------- From: Malveeka Tewari <mtewari at eng.ucsd.edu> Date: Sun, May 22, 2011 at 12:38 AM Subject: Re: [LLVMdev] getCanonicalInductionVariable To: willdtz at gmail.com Adding -mem2reg fixed the problem ! Thanks a lot! Malveeka On Sat, May 21, 2011 at 9:47 PM, Will Dietz <willdtz at gmail.com> wrote: > > Also, make

Dear List, I have a list of length ~1000 filled with numerics. I need to replace the elements of this list that are above a certain numerical threshold with the value of the threshold. e.g example=list(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1) threshold=5 <magic code goes here> example=(1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1). I have written a crude

Radovan, Thanks for posting this! I would really like to have this kind of functionality available. There are a lot of things to think through here; comments inline... ----- Original Message ----- > From: "Radovan Obradovic" <Radovan.Obradovic at imgtec.com> > To: llvmdev at cs.uiuc.edu > Sent: Monday, December 16, 2013 11:31:21 AM > Subject: [LLVMdev] [RFC]

Hello, I am looking for a loop unfolding procedure implemented in LLVM that helps to transform a while-loop to n-layer If-statements. The transformation should be on IR, although the example below is illustrated on the source level. original loop: * WHILE (condition) DO action ENDWHILE* Expected unfolded loop (2-layer): * IF (condition) THEN* * action* * IF

Hal, Thank you for finding interest in our work! Please find my answers inlined below. > > ________________________________________ > From: Hal Finkel [hfinkel at anl.gov] > Sent: Monday, December 16, 2013 4:26 PM > To: Radovan Obradovic > Cc: llvmdev at cs.uiuc.edu; chandlerc; Andrew Trick > Subject: Re: [LLVMdev] [RFC] Iterrative compilation framework for Clang/LLVM >

Hi Radovan, I am also interested in the iterative compilation in LLVM, and had implemented a simple iterative compilation driver. I guess you do not need to embedded the pointer to ModuleDecisionTreeProxies into the core classes of llvm, i.e. the PassManager class and the Function class. Instead, you could: 1. Implement a special pass manager that runs a set of passes iteratively. Implementing

Hi everyone. R is new to me and I'm very impressed with its capabilities but still cannot figure out how to do some basic things. There seems to be no lack of documentation but finding what I need has proven difficult. Perhaps you can help. Here's what I'm after: 1. How do I create a new plot without erasing the prior one i.e., have a new window pop up with the new graph?