search for: connectedpair

Displaying 5 results from an estimated 5 matches for "connectedpair".

Did you mean: connectedpairs
2011 Dec 02
5
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
...+ bool vectorizePairs(BasicBlock&BB); > + > + void getCandidatePairs(BasicBlock&BB, > + std::multimap<Value *, Value *> &CandidatePairs, > + std::vector<Value *> &PairableInsts); > + > + vojd computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, > + std::vector<Value *> &PairableInsts, > + std::multimap<ValuePair, ValuePair> &ConnectedPairs); > + > + void buildDepMap(BasicBlock&BB, > +...
2011 Dec 14
0
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
...Block&BB); > > + > > + void getCandidatePairs(BasicBlock&BB, > > + std::multimap<Value *, Value *> &CandidatePairs, > > + std::vector<Value *> &PairableInsts); > > + > > + vojd computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, > > + std::vector<Value *> &PairableInsts, > > + std::multimap<ValuePair, ValuePair> &ConnectedPairs); > > + > > + void buildDepMap(BasicBlock&am...
2011 Nov 23
0
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
On Mon, 2011-11-21 at 21:22 -0600, Hal Finkel wrote: > On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > > Tobias, > > > > I've attached an updated patch. It contains a few bug fixes and many > > (refactoring and coding-convention) changes inspired by your comments. > > > > I'm currently trying to fix the bug responsible for causing a compile
2011 Dec 02
0
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
...gt; directly visible in the core routines. Here are my thoughts: getCandidatePairs - This is O(N^2) in the number of instructions in BB. [This assumes that all of the external helper functions, especially queries to alias and scalar-evolution analysis don't make the complexity worse]. computeConnectedPairs - For each candidate pair, there are O(N^2) in the worse case, this loops over all pairs of uses of the instructions in the candidate pair. So if every instruction has U uses, then this has complexity O(N^2 U^2). In practice, U is small, and so this is just another O(N^2). Unfortunately, that is o...
2011 Nov 22
5
[LLVMdev] [llvm-commits] [PATCH] BasicBlock Autovectorization Pass
On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > Tobias, > > I've attached an updated patch. It contains a few bug fixes and many > (refactoring and coding-convention) changes inspired by your comments. > > I'm currently trying to fix the bug responsible for causing a compile > failure when compiling >