6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-06-21 02:24:22 +00:00
Code Issues Projects Releases Wiki Activity

remove spaces on empty lines

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@152034 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Sebastian Pop
2012-03-05 17:39:45 +00:00
parent 7eb0bf5fb7
commit 3706ac7aa8
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
lib/Transforms/Vectorize/BBVectorize.cpp
View File

@ -456,34 +456,34 @@ namespace {
ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs,
PairableInsts); PairableInsts);
if (PairableInsts.empty()) continue; if (PairableInsts.empty()) continue;
// Now we have a map of all of the pairable instructions and we need to // Now we have a map of all of the pairable instructions and we need to
// select the best possible pairing. A good pairing is one such that the // select the best possible pairing. A good pairing is one such that the
// users of the pair are also paired. This defines a (directed) forest // users of the pair are also paired. This defines a (directed) forest
// over the pairs such that two pairs are connected iff the second pair // over the pairs such that two pairs are connected iff the second pair
// uses the first. // uses the first.
// Note that it only matters that both members of the second pair use some // Note that it only matters that both members of the second pair use some
// element of the first pair (to allow for splatting). // element of the first pair (to allow for splatting).
std::multimap<ValuePair, ValuePair> ConnectedPairs; std::multimap<ValuePair, ValuePair> ConnectedPairs;
computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs); computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs);
if (ConnectedPairs.empty()) continue; if (ConnectedPairs.empty()) continue;
// Build the pairable-instruction dependency map // Build the pairable-instruction dependency map
DenseSet<ValuePair> PairableInstUsers; DenseSet<ValuePair> PairableInstUsers;
buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers);
// There is now a graph of the connected pairs. For each variable, pick // There is now a graph of the connected pairs. For each variable, pick
// the pairing with the largest tree meeting the depth requirement on at // the pairing with the largest tree meeting the depth requirement on at
// least one branch. Then select all pairings that are part of that tree // least one branch. Then select all pairings that are part of that tree
// and remove them from the list of available pairings and pairable // and remove them from the list of available pairings and pairable
// variables. // variables.
DenseMap<Value *, Value *> ChosenPairs; DenseMap<Value *, Value *> ChosenPairs;
choosePairs(CandidatePairs, PairableInsts, ConnectedPairs, choosePairs(CandidatePairs, PairableInsts, ConnectedPairs,
PairableInstUsers, ChosenPairs); PairableInstUsers, ChosenPairs);
if (ChosenPairs.empty()) continue; if (ChosenPairs.empty()) continue;
AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(),
PairableInsts.end()); PairableInsts.end());
@ -492,14 +492,14 @@ namespace {
if (AllChosenPairs.empty()) return false; if (AllChosenPairs.empty()) return false;
NumFusedOps += AllChosenPairs.size(); NumFusedOps += AllChosenPairs.size();
// A set of pairs has now been selected. It is now necessary to replace the // A set of pairs has now been selected. It is now necessary to replace the
// paired instructions with vector instructions. For this procedure each // paired instructions with vector instructions. For this procedure each
// operand much be replaced with a vector operand. This vector is formed // operand much be replaced with a vector operand. This vector is formed
// by using build_vector on the old operands. The replaced values are then // by using build_vector on the old operands. The replaced values are then
// replaced with a vector_extract on the result. Subsequent optimization // replaced with a vector_extract on the result. Subsequent optimization
// passes should coalesce the build/extract combinations. // passes should coalesce the build/extract combinations.
fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs); fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs);
return true; return true;
} }