similar to: How to make ScalarEvolution recompute SCEV values?

Hi all, I am trying to write a pass where i am creating a clone of a function (the only difference being, the new function returns void , instead of any value). I am creating a new Function Type with a void return type (rest being the same as original function), and using this i am creating a new function body. Then, i clone the body of the old function into new function, but when ever i

Hi, I'm gonna try to give some feedback, but I have only been working with LLVM for a few days, so don't take what I'm saying without verifying :-) > BasicBlock *ProgSlicer::CloneBasicBlock(const BasicBlock *BB, > DenseMap<const Value*, Value*> &ValueMap, > const char *NameSuffix, Function *F) { > > BasicBlock

Devang Patel wrote: > Hi John, > > On Wed, Nov 4, 2009 at 12:04 PM, John Criswell <criswell at uiuc.edu> wrote: > >> Dear All, >> >> 1) I recall reading somewhere that a few optimizations in LLVM 2.6 strip >> away debug information when such information interferes with >> optimization. Is this correct, >> > > Yes. > >

Hi all, for(pred_iterator PI=pred_begin(BB); PI!=pred_end(BB); PI++) { BasicBlock *Pres = *PI; pred.insert(Pres); } for(predit = pred.begin(); predit!=pred.end();predit++) (BB)->removePredecessor(*predit); Is this code enough to remove the predecessor for each basic block As I read in documentation that this removePredecessor() doesn't update the predecessor list. So,

Good morning to you all, Sorry for taking your time from your research and teaching schedules.   If you have a non-stationary univariate time Series data that has the transformation: Say; l.dat<-log (series) d.ldat<-diff (l.dat, differences=1) and you fit say arima model. predit.arima<-predict (fit.series, n.ahead=10, xregnew= (n+1) :( n+10)) How could I re-transform

Hi, I have problems to estimate the loop exit count of a simple loop with the ScalarEvolution class. simple loop: ...... int a = 0; for(int i; i < 10; ++i){ a = a + 1; }; ...... For the loop analyzation I use the ScalarEvolution class with the following initialization: ...... void analysis(Function* func) DominatorTree DT = DominatorTree(); DT.recalculate(*func);

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 for the runOnLoop, but how can I obtain it in a FunctionPass? I tried simply by creating a new instance : ValueMap<const Value *, Value* > VMap;

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 for the runOnLoop, but how can I obtain it > in a

Thanks , your suggestion was welcome and CloneLoop works without passing the LPPassManager. However, I reached another problem. When the loop to be cloned has some subloops, the subloops are not properly cloned. Some clones of the clones are created and the CFG between the cloned basic blocks of the subloops is not correctly built. There are clones like for.body.clone,

Hello all, I need to tap into the collective wisdom of the group re an issue of efficiency. A sketch of the situation: Let's say 4000 observations in variables Y, X1, X2 , X3 and X4. I would like to feed various combinations of this expression Y ~ X1+X2+X3+X4 + I(X1^2)+I(X2^2)+I(X3^2)+I(X4^2) + X1*X2 + X1*X3 + X1*X4 + X2*X3 + X2*X4 + X3*X4 repeatedly to glm(). (I really have little

On Wed, Jun 15, 2011 at 3:20 AM, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > Thanks , your suggestion was welcome and CloneLoop works without passing the > LPPassManager. > >  However, I reached another problem. When the loop to be cloned has some > subloops, the subloops are not properly cloned. Some clones of the clones > are created and the CFG between the

Hi Eli, > I would like to point you to a code example, but then I realized > nothing in the LLVM codebase actually uses CloneLoop. So I'm not > surprised it's broken... sorry about that. maybe CloneLoop should be removed then? Ciao, Duncan.

I am attempting to add instructions before and after all loops. To do this, I've added a simple function as follows: void addToAllLoops(Loop * IL) { addToAllLoops(IL); BasicBlock * PH = IL->getLoopPreheader(); Instruction *InstrCallPre = new CallInst(PrintLoopBegin, "", PH->getPrev()); return; } The function added is trivial: void

Hi, First, sorry in advance for pasting code like this :) I'm doing a simple optimization pass for a cs326 class project. The pass in question is LICM, and I'm getting an assertion when I try to hoist an instruction. My hoist function is below. I dont think I need that copying in there, that was just something people on the newsgroup suggested. I get the same assertion

On Tue, Apr 4, 2017 at 12:36 PM, Duncan P. N. Exon Smith < dexonsmith at apple.com> wrote: > > On 2017-Apr-04, at 12:12, Peter Collingbourne <peter at pcc.me.uk> wrote: > > On Mon, Apr 3, 2017 at 8:13 PM, Mehdi Amini <mehdi.amini at apple.com> wrote: > >> >> On Apr 3, 2017, at 7:08 PM, Peter Collingbourne <peter at pcc.me.uk> wrote: >>

Hi John, On Thu, Nov 5, 2009 at 8:43 AM, John Criswell <criswell at uiuc.edu> wrote: > Does the debug facilities in LLVM TOT, at present, maintain information > better than LLVM 2.6 (i.e., if a front-end puts the debug information in, > will the optimizations not take it out)?  Does the information that the > llvm-gcc front-end adds comparable to what llvm-gcc in LLVM 2.6 does?

Hello running R 1.7.1 on Windows 2000 I have a model notmar1 <- glm(yprisx~age+harddrug+sex, subset = marcom == 0, family = quasipoisson) and summary(notmar1) gives (as it should) 433 df for the null model but when I run predict(notmar1 <- glm(yprisx~age+harddrug+sex, subset = marcom == 0, family = quasipoisson)) I get preditions for 528 people (the full data set, not the subset)

VorbisHi Any help is appreciate. I have two questions. First, I looked into the vorbis-?-specific and was confused by the floor1 algorithm. I think at last the aim is to derive the piecewise curve with the list X and Y,then when encodering ,why not use the selected point orderly to get the curve ? In other words, the specific use the list of [0,128,64,32,96,16,48,80] , why can not use

Hi there, I have just started using the MASS package in R to run M-estimator robust regressions. The final output appears to only give coefficients, degrees of freedom and t-stats. Does anyone know why R doesn't compute R or R-squared and why doesn't give you any other indices of goodness of fit? Does anyone know how to compute these in R? Sophie -- View this message in context:

I am reading the code for exit block transformation in loop simplify. I do not fully understand how exit blocks with out-of-loop dominators are transformed. In SplitLandingPadPredecessors, all the in-the-loop predecessors of the exits block are grouped and given to the .loopexit basic block and the out-of-loop predecessors are grouped and given to the .nonloopexit basic block. the .loopexit