search for: naftali

...Ty, Value *OffsetVal, std::vector<Value*> &Indices, const TargetData &TD, BasicBlock::iterator *BI) { return 0; } in lib/Transforms/TransformInternals.cpp, how can this be? Naftali On Tue, 26 Jul 2005, Chris Lattner wrote: > On Tue, 26 Jul 2005, Naftali Schwartz wrote: >> It seems like general dependence analysis in LLVM should require that this >> function be, well, functional. Is it simply a placeholder waiting for >> someone to come and fill in th...

...to make this a getelementptr // instruction. The type returned is the root type that the GEP would point to would be quite useful (and in particular for dependence analysis). Are you going to remove it because it's functionality is already present elsewhere or is simply not needed anymore? Naftali On Tue, 26 Jul 2005, Chris Lattner wrote: > On Tue, 26 Jul 2005, Naftali Schwartz wrote: >> But it's completely empty, no? >> >> const Type *llvm::ConvertibleToGEP(const Type *Ty, Value *OffsetVal, >> std::vector<Value*> &amp...

...a++ * *p_b++; > > } > > } which, as you had pointed out, removal of the if statement in IndVarSimplify:647 takes care of, but only partially, as it leaves the p_a and p_c references exactly as before. On the other hand, maybe I'm just a little confused... Naftali On Tue, 26 Jul 2005, Chris Lattner wrote: > On Tue, 26 Jul 2005, Naftali Schwartz wrote: >> I'm sorry, it had seemed to me that the documented functionality: >> >> // ConvertibleToGEP - This function returns true if the specified value V >> is >> // a valid...

...for (f = 0; f < Y-2; f++ ) C[X*k+i] += A[Y*i+f+1] * B[Y*k+f+1]; C[X*k+i] += A[Y*i+Y-1] * B[Y*k+Y-1]; } a la Frank and O'Boyle, which -indvars seems not to be able to handle (unless I'm doing something wrong...) Naftali

...d like to contribute in the area of dependence analysis, and a good place to start seems to be in the transformation of pointers to explicit array accesses. Is anyone else working on this? If not, does this seem a plausible place to start and how would be the best way to go about it? Thanks, Naftali

On Tue, 26 Jul 2005, Naftali Schwartz wrote: > I'm sorry, it had seemed to me that the documented functionality: > > // ConvertibleToGEP - This function returns true if the specified value V is > // a valid index into a pointer of type Ty. If it is valid, Idx is filled in > // with the values that would be...

On Tue, 26 Jul 2005, Naftali Schwartz wrote: > But it's completely empty, no? > > const Type *llvm::ConvertibleToGEP(const Type *Ty, Value *OffsetVal, > std::vector<Value*> &Indices, > const TargetData &TD, >...

On Thu, 21 Jul 2005, Naftali Schwartz wrote: >> If you're interested in dependence analysis, the next important step is > to >> start analyzing distance and direction vectors. > > Well, specifically, I was thinking of a mechanism to turn this: The indvars pass is *intentionally* restricted to only pr...

...s like general dependence analysis in LLVM should require that this function be, well, functional. Is it simply a placeholder waiting for someone to come and fill in the details? It also appears that some other things besides dependence analysis depend on it as well...anyone working on this? Naftali

...some pass in llvm seems to want to collapse, and then scalar evolution can't find all the predictable loop counts. However, when I insert a volatile memory operation inside of each loop, this preserves the loop structure and scalar evolution finds all the loop counts. What to do? Thanks, Naftali On Thu, 28 Jul 2005, Chris Lattner wrote: > On Thu, 28 Jul 2005, Naftali Schwartz wrote: >> I now understand that IndVarSimplify.cpp is capable of reproducing array >> references when the pointer initialization from the array address is found >> inside the immediately enclo...

On Tue, 26 Jul 2005, Naftali Schwartz wrote: > It seems like general dependence analysis in LLVM should require that this > function be, well, functional. Is it simply a placeholder waiting for > someone to come and fill in the details? It also appears that some other > things besides dependence analysis depen...

...; if (AR->getNumOperands() == 2 && isa<SCEVConstant>(AR->getOperand(1))) --- > if (1)//SCEVAddRecExpr *AR = dyn_cast<SCEVAddRecExpr>(SCEV)) > if (1)//AR->getNumOperands() == 2 && isa<SCEVConstant>(AR->getOperand(1))) Naftali

On Thu, 28 Jul 2005, Naftali Schwartz wrote: > I now understand that IndVarSimplify.cpp is capable of reproducing array > references when the pointer initialization from the array address is found > inside the immediately enclosing loop, such that in the following code: Ok. > int A[20000], B[100], Z; > int m...

...d> Playing 'digits/30.ulaw' (language 'en') -- <SIP/103-0000035d> Playing 'digits/4.ulaw' (language 'en') It`s not will to be: ; "one - thousand - two - hundred - *and* - thirty - four ?? I put and.ulaw file on en dir and on en/digits dir. Thanks Naftali -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.digium.com/pipermail/asterisk-users/attachments/20120723/b270b408/attachment.htm>

On Mon, 18 Jul 2005, Naftali Schwartz wrote: > Hi, everyone. I've been examining llvm for a while and been duly impressed. > I'd like to contribute in the area of dependence analysis, and a good place > to start seems to be in the transformation of pointers to explicit array > accesses. Is anyone else...

> LLVM already includes this: the -indvars pass. It turns things like this: > > int *P = for (...; ... ; ++P) > *P > > to: > > int *P = ... > for (int i = 0; ... ; ++i) > P[i] > > If you're interested in dependence analysis, the next important step is to > start analyzing distance and direction vectors. You can check out

This may sound like a dumb question but for those who do not follow either :- "why do you want to turn pointers into indexes ?" Aaron

...i != 300; i++ ) for ( b = &B[0], j = 0; j != 200; j++ ) for ( c = &C[0], k = 0; k != 100; k++ ) Z += *a++ * *b++ * *c++; } Here's the patch with diff -u, limited to 80 columns: Does it look reasonable? Thanks, Naftali Index: lib/Transforms/Scalar/IndVarSimplify.cpp =================================================================== RCS file: /var/cvs/llvm/llvm/lib/Transforms/Scalar/IndVarSimplify.cpp,v retrieving revision 1.78 diff -u -r1.78 IndVarSimplify.cpp --- lib/Transforms/Scalar/IndVarSimplify.cpp 15...