BBVectorize.cpp revision 0b2500c504156c45cd71817a9ef6749b6cde5703
1de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel//===- BBVectorize.cpp - A Basic-Block Vectorizer -------------------------===// 2de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// 3de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// The LLVM Compiler Infrastructure 4de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// 5de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// This file is distributed under the University of Illinois Open Source 6de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// License. See LICENSE.TXT for details. 7de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// 8de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel//===----------------------------------------------------------------------===// 9de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// 10de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// This file implements a basic-block vectorization pass. The algorithm was 11de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// inspired by that used by the Vienna MAP Vectorizor by Franchetti and Kral, 12de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// et al. It works by looking for chains of pairable operations and then 13de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// pairing them. 14de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel// 15de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel//===----------------------------------------------------------------------===// 16de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 17de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#define BBV_NAME "bb-vectorize" 18de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#define DEBUG_TYPE BBV_NAME 19de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Constants.h" 20de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/DerivedTypes.h" 21de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Function.h" 22de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Instructions.h" 23de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/IntrinsicInst.h" 24de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Intrinsics.h" 25de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/LLVMContext.h" 26de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Pass.h" 27de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Type.h" 28de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseMap.h" 29de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseSet.h" 30de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/SmallVector.h" 31de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/Statistic.h" 32de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/STLExtras.h" 33de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/StringExtras.h" 34de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasAnalysis.h" 35de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasSetTracker.h" 36de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolution.h" 37de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolutionExpressions.h" 38de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ValueTracking.h" 39de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/CommandLine.h" 40de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/Debug.h" 41de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/raw_ostream.h" 42de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/ValueHandle.h" 43de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Target/TargetData.h" 44de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Transforms/Vectorize.h" 45de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <algorithm> 46de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <map> 47de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelusing namespace llvm; 48de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 49de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 50de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelReqChainDepth("bb-vectorize-req-chain-depth", cl::init(6), cl::Hidden, 51de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The required chain depth for vectorization")); 52de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 53de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 54de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSearchLimit("bb-vectorize-search-limit", cl::init(400), cl::Hidden, 55de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum search distance for instruction pairs")); 56de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 57de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 58de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSplatBreaksChain("bb-vectorize-splat-breaks-chain", cl::init(false), cl::Hidden, 59de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Replicating one element to a pair breaks the chain")); 60de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 61de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 62de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelVectorBits("bb-vectorize-vector-bits", cl::init(128), cl::Hidden, 63de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The size of the native vector registers")); 64de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 65de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 66de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxIter("bb-vectorize-max-iter", cl::init(0), cl::Hidden, 67de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum number of pairing iterations")); 68de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 69de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 705d4e18bc39fea892f523d960213906d296d3cb38Hal FinkelMaxInsts("bb-vectorize-max-instr-per-group", cl::init(500), cl::Hidden, 715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel cl::desc("The maximum number of pairable instructions per group")); 725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkelstatic cl::opt<unsigned> 74de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxCandPairsForCycleCheck("bb-vectorize-max-cycle-check-pairs", cl::init(200), 75de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::Hidden, cl::desc("The maximum number of candidate pairs with which to use" 76de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " a full cycle check")); 77de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 78de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 79de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoInts("bb-vectorize-no-ints", cl::init(false), cl::Hidden, 80de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize integer values")); 81de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 82de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 83de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFloats("bb-vectorize-no-floats", cl::init(false), cl::Hidden, 84de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point values")); 85de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 86de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 87de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoCasts("bb-vectorize-no-casts", cl::init(false), cl::Hidden, 88de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize casting (conversion) operations")); 89de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 90de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 91de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMath("bb-vectorize-no-math", cl::init(false), cl::Hidden, 92de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point math intrinsics")); 93de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 94de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 95de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFMA("bb-vectorize-no-fma", cl::init(false), cl::Hidden, 96de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize the fused-multiply-add intrinsic")); 97de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 98de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 99de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMemOps("bb-vectorize-no-mem-ops", cl::init(false), cl::Hidden, 100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize loads and stores")); 101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 102de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelAlignedOnly("bb-vectorize-aligned-only", cl::init(false), cl::Hidden, 104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Only generate aligned loads and stores")); 105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 107edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal FinkelNoMemOpBoost("bb-vectorize-no-mem-op-boost", 108edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::init(false), cl::Hidden, 109edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::desc("Don't boost the chain-depth contribution of loads and stores")); 110edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 111edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkelstatic cl::opt<bool> 112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelFastDep("bb-vectorize-fast-dep", cl::init(false), cl::Hidden, 113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Use a fast instruction dependency analysis")); 114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#ifndef NDEBUG 116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugInstructionExamination("bb-vectorize-debug-instruction-examination", 118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " instruction-examination process")); 121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCandidateSelection("bb-vectorize-debug-candidate-selection", 123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " candidate-selection process")); 126de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 127de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugPairSelection("bb-vectorize-debug-pair-selection", 128de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 129de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " pair-selection process")); 131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCycleCheck("bb-vectorize-debug-cycle-check", 133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 134de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 135de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " cycle-checking process")); 136de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#endif 137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSTATISTIC(NumFusedOps, "Number of operations fused by bb-vectorize"); 139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelnamespace { 141de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel struct BBVectorize : public BasicBlockPass { 142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static char ID; // Pass identification, replacement for typeid 143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BBVectorize() : BasicBlockPass(ID) { 144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel initializeBBVectorizePass(*PassRegistry::getPassRegistry()); 145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<Value *, Value *> ValuePair; 148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, size_t> ValuePairWithDepth; 149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair 150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<Value *, Value *>::iterator, 151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *>::iterator> VPIteratorPair; 152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, 153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair>::iterator> 154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair; 155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis *AA; 157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ScalarEvolution *SE; 158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel TargetData *TD; 159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: const correct? 161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool vectorizePairs(BasicBlock &BB); 163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1645d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool getCandidatePairs(BasicBlock &BB, 1655d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts); 168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, 170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs); 172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildDepMap(BasicBlock &BB, 174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers); 177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void choosePairs(std::multimap<Value *, Value *> &CandidatePairs, 179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs); 183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 184de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fuseChosenPairs(BasicBlock &BB, 185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs); 187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isInstVectorizable(Instruction *I, bool &IsSimpleLoadStore); 189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 190de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool areInstsCompatible(Instruction *I, Instruction *J, 191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore); 192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool trackUsesOfI(DenseSet<Value *> &Users, 194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers = true, 196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet = 0); 197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computePairsConnectedTo( 199de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 200de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P); 203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairsConflict(ValuePair P, ValuePair Q, 205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap = 0); 207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairWillFormCycle(ValuePair P, 209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUsers, 210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs); 211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void pruneTreeFor( 213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildInitialTreeFor( 224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 226de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 228de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J); 230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 231de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void findBestTreeFor( 232de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 233de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 234de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 235de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 236de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 237de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t &BestEffSize, VPIteratorPair ChoiceRange, 240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementPointerInput(LLVMContext& Context, Instruction *I, 243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, unsigned o, bool &FlipMemInputs); 244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fillNewShuffleMask(LLVMContext& Context, Instruction *J, 246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem, unsigned MaskOffset, unsigned NumInElem, 247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IdxOffset, std::vector<Constant*> &Mask); 248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementShuffleMask(LLVMContext& Context, Instruction *I, 250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J); 251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementInput(LLVMContext& Context, Instruction *I, 253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, unsigned o, bool FlipMemInputs); 254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 255de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void getReplacementInputsForPair(LLVMContext& Context, Instruction *I, 256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, SmallVector<Value *, 3> &ReplacedOperands, 257de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &FlipMemInputs); 258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 260de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, Instruction *&K1, 262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&K2, bool &FlipMemInputs); 263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectPairLoadMoveSet(BasicBlock &BB, 265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 266de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I); 268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectLoadMoveSet(BasicBlock &BB, 270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet); 273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool canMoveUsesOfIAfterJ(BasicBlock &BB, 275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void moveUsesOfIAfterJ(BasicBlock &BB, 279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel virtual bool runOnBasicBlock(BasicBlock &BB) { 284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA = &getAnalysis<AliasAnalysis>(); 285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE = &getAnalysis<ScalarEvolution>(); 286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel TD = getAnalysisIfAvailable<TargetData>(); 287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool changed = false; 289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate a sufficient number of times to merge types of size 1 bit, 290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then 2 bits, then 4, etc. up to half of the target vector width of the 291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // target vector register. 292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned v = 2, n = 1; v <= VectorBits && (!MaxIter || n <= MaxIter); 293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel v *= 2, ++n) { 294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing loop #" << n << 295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " for " << BB.getName() << " in " << 296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BB.getParent()->getName() << "...\n"); 297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (vectorizePairs(BB)) 298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel changed = true; 299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: done!\n"); 304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return changed; 305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel virtual void getAnalysisUsage(AnalysisUsage &AU) const { 308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlockPass::getAnalysisUsage(AU); 309de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<AliasAnalysis>(); 310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<ScalarEvolution>(); 311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<AliasAnalysis>(); 312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<ScalarEvolution>(); 3137e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel AU.setPreservesCFG(); 314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This returns the vector type that holds a pair of the provided type. 317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If the provided type is already a vector, then its length is doubled. 318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static inline VectorType *getVecTypeForPair(Type *ElemTy) { 319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (VectorType *VTy = dyn_cast<VectorType>(ElemTy)) { 320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned numElem = VTy->getNumElements(); 321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return VectorType::get(ElemTy->getScalarType(), numElem*2); 322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3237e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel 3247e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel return VectorType::get(ElemTy, 2); 325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the weight associated with the provided value. A chain of 328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate pairs has a length given by the sum of the weights of its 329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // members (one weight per pair; the weight of each member of the pair 330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is assumed to be the same). This length is then compared to the 331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chain-length threshold to determine if a given chain is significant 332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // enough to be vectorized. The length is also used in comparing 333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate chains where longer chains are considered to be better. 334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: when this function returns 0, the resulting instructions are 335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // not actually fused. 336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static inline size_t getDepthFactor(Value *V) { 337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // InsertElement and ExtractElement have a depth factor of zero. This is 338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // for two reasons: First, they cannot be usefully fused. Second, because 339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pass generates a lot of these, they can confuse the simple metric 340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // used to compare the trees in the next iteration. Thus, giving them a 341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // weight of zero allows the pass to essentially ignore them in 342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // subsequent iterations when looking for vectorization opportunities 343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // while still tracking dependency chains that flow through those 344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions. 345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<InsertElementInst>(V) || isa<ExtractElementInst>(V)) 346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 0; 347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 348edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // Give a load or store half of the required depth so that load/store 349edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // pairs will vectorize. 350edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel if (!NoMemOpBoost && (isa<LoadInst>(V) || isa<StoreInst>(V))) 351edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel return ReqChainDepth/2; 352edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 1; 354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This determines the relative offset of two loads or stores, returning 357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if the offset could be determined to be some constant value. 358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For example, if OffsetInElmts == 1, then J accesses the memory directly 359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after I; if OffsetInElmts == -1 then I accesses the memory 360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // directly after J. This function assumes that both instructions 361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // have the same type. 362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool getPairPtrInfo(Instruction *I, Instruction *J, 363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *&IPtr, Value *&JPtr, unsigned &IAlignment, unsigned &JAlignment, 364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t &OffsetInElmts) { 365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = 0; 366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I)) { 367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IPtr = cast<LoadInst>(I)->getPointerOperand(); 368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel JPtr = cast<LoadInst>(J)->getPointerOperand(); 369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IAlignment = cast<LoadInst>(I)->getAlignment(); 370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel JAlignment = cast<LoadInst>(J)->getAlignment(); 371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IPtr = cast<StoreInst>(I)->getPointerOperand(); 373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel JPtr = cast<StoreInst>(J)->getPointerOperand(); 374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IAlignment = cast<StoreInst>(I)->getAlignment(); 375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel JAlignment = cast<StoreInst>(J)->getAlignment(); 376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *IPtrSCEV = SE->getSCEV(IPtr); 379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *JPtrSCEV = SE->getSCEV(JPtr); 380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If this is a trivial offset, then we'll get something like 382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // 1*sizeof(type). With target data, which we need anyway, this will get 383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // constant folded into a number. 384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV); 385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (const SCEVConstant *ConstOffSCEV = 386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dyn_cast<SCEVConstant>(OffsetSCEV)) { 387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt *IntOff = ConstOffSCEV->getValue(); 388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t Offset = IntOff->getSExtValue(); 389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VTy = cast<PointerType>(IPtr->getType())->getElementType(); 391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t VTyTSS = (int64_t) TD->getTypeStoreSize(VTy); 392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(VTy == cast<PointerType>(JPtr->getType())->getElementType()); 394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = Offset/VTyTSS; 396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (abs64(Offset) % VTyTSS) == 0; 397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if the provided CallInst represents an intrinsic that can 403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be vectorized. 404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isVectorizableIntrinsic(CallInst* I) { 405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = I->getCalledFunction(); 406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!F) return false; 407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IID) return false; 410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel switch(IID) { 412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel default: 413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sqrt: 415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::powi: 416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sin: 417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::cos: 418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log: 419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log2: 420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log10: 421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp: 422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp2: 423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::pow: 424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !NoMath; 425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::fma: 426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !NoFMA; 427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if J is the second element in some pair referenced by 431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some multimap pair iterator pair. 432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel template <typename V> 433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isSecondInIteratorPair(V J, std::pair< 434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator, 435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator> PairRange) { 436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (typename std::multimap<V, V>::iterator K = PairRange.first; 437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != PairRange.second; ++K) 438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->second == J) return true; 439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel }; 443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function implements one vectorization iteration on the provided 445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block. It returns true if the block is changed. 446de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::vectorizePairs(BasicBlock &BB) { 4475d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue; 4485d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator Start = BB.getFirstInsertionPt(); 4495d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4505d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> AllPairableInsts; 4515d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> AllChosenPairs; 4525d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4535d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel do { 4545d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> PairableInsts; 4555d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::multimap<Value *, Value *> CandidatePairs; 4565d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, 4575d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts); 4585d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.empty()) continue; 4595d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4605d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Now we have a map of all of the pairable instructions and we need to 4615d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // select the best possible pairing. A good pairing is one such that the 4625d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // users of the pair are also paired. This defines a (directed) forest 4635d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // over the pairs such that two pairs are connected iff the second pair 4645d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // uses the first. 4655d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4665d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Note that it only matters that both members of the second pair use some 4675d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // element of the first pair (to allow for splatting). 4685d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4695d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::multimap<ValuePair, ValuePair> ConnectedPairs; 4705d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs); 4715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ConnectedPairs.empty()) continue; 4725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Build the pairable-instruction dependency map 4745d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseSet<ValuePair> PairableInstUsers; 4755d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); 4765d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 47735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // There is now a graph of the connected pairs. For each variable, pick 47835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // the pairing with the largest tree meeting the depth requirement on at 47935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // least one branch. Then select all pairings that are part of that tree 48035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // and remove them from the list of available pairings and pairable 48135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // variables. 4825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> ChosenPairs; 4845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel choosePairs(CandidatePairs, PairableInsts, ConnectedPairs, 4855d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInstUsers, ChosenPairs); 4865d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4875d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ChosenPairs.empty()) continue; 4885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), 4895d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts.end()); 4905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end()); 4915d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } while (ShouldContinue); 4925d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 4935d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (AllChosenPairs.empty()) return false; 4945d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel NumFusedOps += AllChosenPairs.size(); 4955d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A set of pairs has now been selected. It is now necessary to replace the 497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // paired instructions with vector instructions. For this procedure each 498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // operand much be replaced with a vector operand. This vector is formed 499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // by using build_vector on the old operands. The replaced values are then 500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // replaced with a vector_extract on the result. Subsequent optimization 501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // passes should coalesce the build/extract combinations. 5025d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 5035d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs); 504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the provided instruction is capable of being 508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fused into a vector instruction. This determination is based only on the 509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and other attributes of the instruction. 510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::isInstVectorizable(Instruction *I, 511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &IsSimpleLoadStore) { 512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = false; 513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (CallInst *C = dyn_cast<CallInst>(I)) { 515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isVectorizableIntrinsic(C)) 516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (LoadInst *L = dyn_cast<LoadInst>(I)) { 518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple loads if possbile: 519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = L->isSimple(); 520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IsSimpleLoadStore || NoMemOps) 521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (StoreInst *S = dyn_cast<StoreInst>(I)) { 523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple stores if possbile: 524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = S->isSimple(); 525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IsSimpleLoadStore || NoMemOps) 526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (CastInst *C = dyn_cast<CastInst>(I)) { 528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can vectorize casts, but not casts of pointer types, etc. 529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (NoCasts) 530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *SrcTy = C->getSrcTy(); 533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!SrcTy->isSingleValueType() || SrcTy->isPointerTy()) 534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *DestTy = C->getDestTy(); 537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!DestTy->isSingleValueType() || DestTy->isPointerTy()) 538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!(I->isBinaryOp() || isa<ShuffleVectorInst>(I) || 540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<ExtractElementInst>(I) || isa<InsertElementInst>(I))) { 541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 543de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 544de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can't vectorize memory operations without target data 545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (TD == 0 && IsSimpleLoadStore) 546de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 547de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 548de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *T1, *T2; 549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For stores, it is the value type, not the pointer type that matters 551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the value is what will come from a vector register. 552de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 553de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IVal = cast<StoreInst>(I)->getValueOperand(); 554de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T1 = IVal->getType(); 555de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 556de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T1 = I->getType(); 557de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 558de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->isCast()) 560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T2 = cast<CastInst>(I)->getSrcTy(); 561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T2 = T1; 563de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Not every type can be vectorized... 565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(VectorType::isValidElementType(T1) || T1->isVectorTy()) || 566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel !(VectorType::isValidElementType(T2) || T2->isVectorTy())) 567de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (NoInts && (T1->isIntOrIntVectorTy() || T2->isIntOrIntVectorTy())) 570de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 571de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 572de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (NoFloats && (T1->isFPOrFPVectorTy() || T2->isFPOrFPVectorTy())) 573de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T1->getPrimitiveSizeInBits() > VectorBits/2 || 576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T2->getPrimitiveSizeInBits() > VectorBits/2) 577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 582de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the two provided instructions are compatible 583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (meaning that they can be fused into a vector instruction). This assumes 584de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that I has already been determined to be vectorizable and that J is not 585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in the use tree of I. 586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::areInstsCompatible(Instruction *I, Instruction *J, 587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore) { 588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugInstructionExamination) dbgs() << "BBV: looking at " << *I << 589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Loads and stores can be merged if they have different alignments, 592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but are otherwise the same. 593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadInst *LI, *LJ; 594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel StoreInst *SI, *SJ; 595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if ((LI = dyn_cast<LoadInst>(I)) && (LJ = dyn_cast<LoadInst>(J))) { 596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->getType() != J->getType()) 597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 598de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LI->getPointerOperand()->getType() != 600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LJ->getPointerOperand()->getType() || 601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LI->isVolatile() != LJ->isVolatile() || 602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LI->getOrdering() != LJ->getOrdering() || 603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LI->getSynchScope() != LJ->getSynchScope()) 604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if ((SI = dyn_cast<StoreInst>(I)) && (SJ = dyn_cast<StoreInst>(J))) { 606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (SI->getValueOperand()->getType() != 607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SJ->getValueOperand()->getType() || 608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SI->getPointerOperand()->getType() != 609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SJ->getPointerOperand()->getType() || 610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SI->isVolatile() != SJ->isVolatile() || 611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SI->getOrdering() != SJ->getOrdering() || 612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SI->getSynchScope() != SJ->getSynchScope()) 613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!J->isSameOperationAs(I)) { 615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: handle addsub-type operations! 618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsSimpleLoadStore) { 620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IAlignment, JAlignment; 622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts = 0; 623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts) && abs64(OffsetInElmts) == 1) { 625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (AlignedOnly) { 626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *aType = isa<StoreInst>(I) ? 627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<StoreInst>(I)->getValueOperand()->getType() : I->getType(); 628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // An aligned load or store is possible only if the instruction 629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // with the lower offset has an alignment suitable for the 630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector type. 631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned BottomAlignment = IAlignment; 633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (OffsetInElmts < 0) BottomAlignment = JAlignment; 634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VType = getVecTypeForPair(aType); 636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned VecAlignment = TD->getPrefTypeAlignment(VType); 637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (BottomAlignment < VecAlignment) 638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I)) { 644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Only merge two shuffles if they're both constant 645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return isa<Constant>(I->getOperand(2)) && 646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<Constant>(J->getOperand(2)); 647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: We may want to vectorize non-constant shuffles also. 648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Figure out whether or not J uses I and update the users and write-set 654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // structures associated with I. Specifically, Users represents the set of 655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions that depend on I. WriteSet represents the set 656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of memory locations that are dependent on I. If UpdateUsers is true, 657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and J uses I, then Users is updated to contain J and WriteSet is updated 658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to contain any memory locations to which J writes. The function returns 659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if J uses I. By default, alias analysis is used to determine 660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // whether J reads from memory that overlaps with a location in WriteSet. 661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If LoadMoveSet is not null, then it is a previously-computed multimap 662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // where the key is the memory-based user instruction and the value is 663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the instruction to be compared with I. So, if LoadMoveSet is provided, 664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then the alias analysis is not used. This is necessary because this 665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // function is called during the process of moving instructions during 666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectorization and the results of the alias analysis are not stable during 667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that process. 668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, 669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers, 671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet) { 672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = false; 673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This instruction may already be marked as a user due, for example, to 675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // being a member of a selected pair. 676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (Users.count(J)) 677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI) 6807e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel for (User::op_iterator JU = J->op_begin(), JE = J->op_end(); 6817e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel JU != JE; ++JU) { 682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *V = *JU; 683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I == V || Users.count(V)) { 684de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 685de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 686de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 688de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI && J->mayReadFromMemory()) { 689de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LoadMoveSet) { 690de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); 691de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = isSecondInIteratorPair<Value*>(I, JPairRange); 692de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSetTracker::iterator W = WriteSet.begin(), 694de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel WE = WriteSet.end(); W != WE; ++W) { 695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSet::iterator A = W->begin(), AE = W->end(); 696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel A != AE; ++A) { 697de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis::Location ptrLoc(A->getValue(), A->getSize(), 698de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel A->getTBAAInfo()); 699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (AA->getModRefInfo(J, ptrLoc) != AliasAnalysis::NoModRef) { 700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 701de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 702de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 703de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 704de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 705de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 706de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 707de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 708de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 709de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI && UpdateUsers) { 710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (J->mayWriteToMemory()) WriteSet.add(J); 711de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Users.insert(J); 712de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return UsesI; 715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function iterates over all instruction pairs in the provided 718de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block and collects all candidate pairs for vectorization. 7195d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool BBVectorize::getCandidatePairs(BasicBlock &BB, 7205d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 721de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 722de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts) { 723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 7245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (Start == E) return false; 7255d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue = false, IAfterStart = false; 7275d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel for (BasicBlock::iterator I = Start++; I != E; ++I) { 7285d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (I == Start) IAfterStart = true; 7295d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore; 731de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isInstVectorizable(I, IsSimpleLoadStore)) continue; 732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for an instruction with which to pair instruction *I... 734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 7365d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool JAfterStart = IAfterStart; 7375d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator J = llvm::next(I); 738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned ss = 0; J != E && ss <= SearchLimit; ++J, ++ss) { 7395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (J == Start) JAfterStart = true; 7405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Determine if J uses I, if so, exit the loop. 742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !FastDep); 743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (FastDep) { 744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: For this heuristic to be effective, independent operations 745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // must tend to be intermixed. This is likely to be true from some 746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // kinds of grouped loop unrolling (but not the generic LLVM pass), 747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but otherwise may require some kind of reordering pass. 748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // When using fast dependency analysis, 750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // stop searching after first use: 751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) continue; 754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J does not use I, and comes before the first use of I, so it can be 757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // merged with I if the instructions are compatible. 758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!areInstsCompatible(I, J, IsSimpleLoadStore)) continue; 759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 760de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J is a candidate for merging with I. 761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!PairableInsts.size() || 762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts[PairableInsts.size()-1] != I) { 763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts.push_back(I); 764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 7655d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.insert(ValuePair(I, J)); 7675d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7685d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // The next call to this function must start after the last instruction 7695d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // selected during this invocation. 7705d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (JAfterStart) { 7715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel Start = llvm::next(J); 7725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel IAfterStart = JAfterStart = false; 7735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 7745d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCandidateSelection) dbgs() << "BBV: candidate pair " 776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *I << " <-> " << *J << "\n"); 7775d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7785d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // If we have already found too many pairs, break here and this function 7795d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // will be called again starting after the last instruction selected 7805d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // during this invocation. 7815d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.size() >= MaxInsts) { 7825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = true; 7835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 7845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 785de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 7865d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7875d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ShouldContinue) 7885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 789de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 791de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << PairableInsts.size() 792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " instructions with candidate pairs\n"); 7935d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7945d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel return ShouldContinue; 795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Finds candidate pairs connected to the pair P = <PI, PJ>. This means that 798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // it looks for pairs such that both members have an input which is an 799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // output of PI or PJ. 800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computePairsConnectedTo( 801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P) { 805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each possible pairing for this variable, look at the uses of 806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the first value... 807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.first->use_begin(), 808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.first->use_end(); I != E; ++I) { 809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each use of the first variable, look for uses of the second 812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // variable... 813de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(), 814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = P.second->use_end(); J != E2; ++J) { 815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); 816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <I, J>: 818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) 819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J))); 820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <J, I>: 822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isSecondInIteratorPair<Value*>(*I, JPairRange)) 823de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConnectedPairs.insert(VPPair(P, ValuePair(*J, *I))); 824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (SplatBreaksChain) continue; 827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the first value in the pair is used by 828de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 829de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.first->use_begin(); J != E; ++J) { 830de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) 831de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J))); 832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 833de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (SplatBreaksChain) return; 836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the second value in the pair is used by 837de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.second->use_begin(), 839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.second->use_end(); I != E; ++I) { 840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(); J != E; ++J) { 843de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) 844de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConnectedPairs.insert(VPPair(P, ValuePair(*I, *J))); 845de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 846de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 848de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 849de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function figures out which pairs are connected. Two pairs are 850de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // connected if some output of the first pair forms an input to both members 851de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of the second pair. 852de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computeConnectedPairs( 853de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 854de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs) { 856de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 857de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PE = PairableInsts.end(); PI != PE; ++PI) { 859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); 860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 861de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator P = choiceRange.first; 862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel P != choiceRange.second; ++P) 863de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel computePairsConnectedTo(CandidatePairs, PairableInsts, 864de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConnectedPairs, *P); 865de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 866de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << ConnectedPairs.size() 868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " pair connections.\n"); 869de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 870de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 871de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds a set of use tuples such that <A, B> is in the set 872de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // if B is in the use tree of A. If B is in the use tree of A, then B 873de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depends on the output of A. 874de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildDepMap( 875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB, 876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 877de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 878de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers) { 879de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> IsInPair; 880de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator C = CandidatePairs.begin(), 881de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = CandidatePairs.end(); C != E; ++C) { 882de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->first); 883de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->second); 884de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 885de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 886de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate through the basic block, recording all Users of each 887de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairable instruction. 888de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 889de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 890de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator I = BB.getFirstInsertionPt(); I != E; ++I) { 891de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsInPair.find(I) == IsInPair.end()) continue; 892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator J = llvm::next(I); J != E; ++J) 896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, J); 897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end(); 899de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel U != E; ++U) 900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.insert(ValuePair(I, *U)); 901de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if an input to pair P is an output of pair Q and also an 905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // input of pair Q is an output of pair P. If this is the case, then these 906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // two pairs cannot be simultaneously fused. 907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairsConflict(ValuePair P, ValuePair Q, 908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap) { 910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Two pairs are in conflict if they are mutual Users of eachother. 911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool QUsesP = PairableInstUsers.count(ValuePair(P.first, Q.first)) || 912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.first, Q.second)) || 913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.first)) || 914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.second)); 915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool PUsesQ = PairableInstUsers.count(ValuePair(Q.first, P.first)) || 916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.first, P.second)) || 917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.first)) || 918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.second)); 919de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PairableInstUserMap) { 920de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: The expensive part of the cycle check is not so much the cycle 921de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // check itself but this edge insertion procedure. This needs some 922de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // profiling and probably a different data structure (same is true of 923de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // most uses of std::multimap). 924de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PUsesQ) { 925de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap->equal_range(Q); 926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(P, QPairRange)) 927de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(Q, P)); 928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 929de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (QUsesP) { 930de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair PPairRange = PairableInstUserMap->equal_range(P); 931de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(Q, PPairRange)) 932de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(P, Q)); 933de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 934de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 935de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 936de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (QUsesP && PUsesQ); 937de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 938de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 939de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function walks the use graph of current pairs to see if, starting 940de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // from P, the walk returns to P. 941de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairWillFormCycle(ValuePair P, 942de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 943de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs) { 944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 945de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: starting cycle check for : " << *P.first << " <-> " 946de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *P.second << "\n"); 947de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A lookup table of visisted pairs is kept because the PairableInstUserMap 948de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contains non-direct associations. 949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> Visited; 95035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePair, 32> Q; 951de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 952de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(P); 95335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 95435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePair QTop = Q.pop_back_val(); 955de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Visited.insert(QTop); 956de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 957de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 958de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: cycle check visiting: " << *QTop.first << " <-> " 959de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *QTop.second << "\n"); 960de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); 961de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator C = QPairRange.first; 962de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != QPairRange.second; ++C) { 963de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C->second == P) { 964de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() 965de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << "BBV: rejected to prevent non-trivial cycle formation: " 966de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *C->first.first << " <-> " << *C->first.second << "\n"); 967de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 968de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 969de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 9700b2500c504156c45cd71817a9ef6749b6cde5703David Blaikie if (CurrentPairs.count(C->second) && !Visited.count(C->second)) 971de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(C->second); 972de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 97335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 974de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 975de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 976de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 977de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 978de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds the initial tree of connected pairs with the 979de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair J at the root. 980de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildInitialTreeFor( 981de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 982de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 983de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 984de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 985de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 986de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J) { 987de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Each of these pairs is viewed as the root node of a Tree. The Tree 988de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is then walked (depth-first). As this happens, we keep track of 989de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pairs that compose the Tree and the maximum depth of the Tree. 99035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 991de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 992de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 99335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 994de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePairWithDepth QTop = Q.back(); 995de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 996de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Push each child onto the queue: 997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool MoreChildren = false; 998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxChildDepth = QTop.second; 999de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); 1000478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator k = qtRange.first; 1001de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel k != qtRange.second; ++k) { 1002de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make sure that this child pair is still a candidate: 1003de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsStillCand = false; 1004de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair checkRange = 1005de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.equal_range(k->second.first); 1006de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator m = checkRange.first; 1007de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel m != checkRange.second; ++m) { 1008de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m->second == k->second.second) { 1009de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsStillCand = true; 1010de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1011de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1012de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1013de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1014de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsStillCand) { 1015de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(k->second); 1016de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) { 1017de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t d = getDepthFactor(k->second.first); 1018de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(k->second, QTop.second+d)); 1019de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MoreChildren = true; 1020de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1021de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxChildDepth = std::max(MaxChildDepth, C->second); 1022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1024de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1025de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1026de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!MoreChildren) { 1027de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Record the current pair as part of the Tree: 1028de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Tree.insert(ValuePairWithDepth(QTop.first, MaxChildDepth)); 1029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.pop_back(); 1030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 103135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given some initial tree, prune it by removing conflicting pairs (pairs 1035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that cannot be simultaneously chosen for vectorization). 1036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::pruneTreeFor( 1037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1042de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1043de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 1044de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 1045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 104635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 104935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 105035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePairWithDepth QTop = Q.pop_back_val(); 1051de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree.insert(QTop.first); 1052de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1053de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Visit each child, pruning as necessary... 1054de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> BestChilden; 1055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QTopRange = ConnectedPairs.equal_range(QTop.first); 1056478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator K = QTopRange.first; 1057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != QTopRange.second; ++K) { 1058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(K->second); 1059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) continue; 1060de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child is in the Tree, now we need to make sure it is the 1062de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // best of any conflicting children. There could be multiple 1063de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflicting children, so first, determine if we're keeping 1064de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // this child, then delete conflicting children as necessary. 1065de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1066de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // It is also necessary to guard against pairing-induced 1067de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // dependencies. Consider instructions a .. x .. y .. b 1068de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // such that (a,b) are to be fused and (x,y) are to be fused 1069de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but a is an input to x and b is an output from y. This 1070de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // means that y cannot be moved after b but x must be moved 1071de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after b for (a,b) to be fused. In other words, after 1072de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fusing (a,b) we have y .. a/b .. x where y is an input 1073de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to a/b and x is an output to a/b: x and y can no longer 1074de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be legally fused. To prevent this condition, we must 1075de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // make sure that a child pair added to the Tree is not 1076de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both an input and output of an already-selected pair. 1077de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1078de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Pairing-induced dependencies can also form from more complicated 1079de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // cycles. The pair vs. pair conflicts are easy to check, and so 1080de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that is done explicitly for "fast rejection", and because for 1081de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // child vs. child conflicts, we may prefer to keep the current 1082de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in preference to the already-selected child. 1083de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> CurrentPairs; 1084de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1085de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool CanAdd = true; 1086de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 1087de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel = BestChilden.begin(), E2 = BestChilden.end(); 1088de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1089de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1090de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1091de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1092de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1093de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1094de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1095de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->second >= C->second) { 1096de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1097de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1098de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1099de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1102de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Even worse, this child could conflict with another node already 1106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // selected for the Tree. If that is the case, ignore this child. 1107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator T = PrunedTree.begin(), 1108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = PrunedTree.end(); T != E2; ++T) { 1109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T->first == C->first.first || 1110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->first == C->first.second || 1111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.first || 1112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.second || 1113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(*T, C->first, PairableInstUsers, 1114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*T); 1120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // And check the queue too... 112435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel for (SmallVector<ValuePairWithDepth, 32>::iterator C2 = Q.begin(), 1125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = Q.end(); C2 != E2; ++C2) { 1126de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1127de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1128de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1129de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1134de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1135de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1136de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Last but not least, check for a conflict with any of the 1141de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // already-chosen pairs. 1142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C2 = 1143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.begin(), E2 = ChosenPairs.end(); 1144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C2, C->first, PairableInstUsers, 1146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*C2); 1152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // To check for non-trivial cycles formed by the addition of the 1156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // current pair we've formed a list of all relevant pairs, now use a 1157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // graph walk to check for a cycle. We start from the current pair and 1158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // walk the use tree to see if we again reach the current pair. If we 1159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // do, then the current pair is rejected. 1160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: It may be more efficient to use a topological-ordering 1162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // algorithm to improve the cycle check. This should be investigated. 1163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(C->first, PairableInstUserMap, CurrentPairs)) 1165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child can be added, but we may have chosen it in preference 1168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to an already-selected child. Check for this here, and if a 1169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict is found, then remove the previously-selected child 1170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // before adding this one in its place. 1171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 1172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel = BestChilden.begin(); C2 != BestChilden.end();) { 1173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers)) 1178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestChilden.erase(C2++); 1179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++C2; 1181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestChilden.insert(ValuePairWithDepth(C->first, C->second)); 1184de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C 1187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel = BestChilden.begin(), E2 = BestChilden.end(); 1188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != E2; ++C) { 1189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t DepthF = getDepthFactor(C->first.first); 1190de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(C->first, QTop.second+DepthF)); 1191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 119235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function finds the best tree of mututally-compatible connected 1196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairs, given the choice of root pairs as an iterator range. 1197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::findBestTreeFor( 1198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1199de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1200de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 1205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t &BestEffSize, VPIteratorPair ChoiceRange, 1206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 1207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator J = ChoiceRange.first; 1208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J != ChoiceRange.second; ++J) { 1209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before going any further, make sure that this pair does not 1211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict with any already-selected pairs (see comment below 1212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // near the Tree pruning for more details). 1213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> ChosenPairSet; 1214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool DoesConflict = false; 1215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C = ChosenPairs.begin(), 1216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); C != E; ++C) { 1217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C, *J, PairableInstUsers, 1218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DoesConflict = true; 1220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairSet.insert(*C); 1224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (DoesConflict) continue; 1226de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1228de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(*J, PairableInstUserMap, ChosenPairSet)) 1229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1231de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> Tree; 1232de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel buildInitialTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1233de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, ChosenPairs, Tree, *J); 1234de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1235de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Because we'll keep the child with the largest depth, the largest 1236de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depth is still the same in the unpruned Tree. 1237de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxDepth = Tree.lookup(*J); 1238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "BBV: found Tree for pair {" 1240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << Tree.size() << "\n"); 1242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // At this point the Tree has been constructed, but, may contain 1244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contradictory children (meaning that different children of 1245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some tree node may be attempting to fuse the same instruction). 1246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // So now we walk the tree again, in the case of a conflict, 1247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // keep only the child with the largest depth. To break a tie, 1248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // favor the first child. 1249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> PrunedTree; 1251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pruneTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, Tree, 1253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree, *J, UseCycleCheck); 1254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1255de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t EffSize = 0; 1256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 1257de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PrunedTree.end(); S != E; ++S) 1258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel EffSize += getDepthFactor(S->first); 1259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1260de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) 1261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: found pruned Tree for pair {" 1262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << PrunedTree.size() << 1264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " (effective size: " << EffSize << ")\n"); 1265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (MaxDepth >= ReqChainDepth && EffSize > BestEffSize) { 1266de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestMaxDepth = MaxDepth; 1267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestEffSize = EffSize; 1268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree = PrunedTree; 1269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given the list of candidate pairs, this function selects those 1274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that will be fused into vector instructions. 1275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::choosePairs( 1276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs) { 1281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck = CandidatePairs.size() <= MaxCandPairsForCycleCheck; 1282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> PairableInstUserMap; 1283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator I = PairableInsts.begin(), 1284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PairableInsts.end(); I != E; ++I) { 1285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The number of possible pairings for this variable: 1286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t NumChoices = CandidatePairs.count(*I); 1287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!NumChoices) continue; 1288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair ChoiceRange = CandidatePairs.equal_range(*I); 1290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The best pair to choose and its tree: 1292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t BestMaxDepth = 0, BestEffSize = 0; 1293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> BestTree; 1294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel findBestTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, 1296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree, BestMaxDepth, BestEffSize, ChoiceRange, 1297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck); 1298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A tree has been chosen (or not) at this point. If no tree was 1300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chosen, then this instruction, I, cannot be paired (and is no longer 1301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // considered). 1302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (BestTree.size() > 0) 1304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: selected pairs in the best tree for: " 1305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *cast<Instruction>(*I) << "\n"); 1306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator S = BestTree.begin(), 1308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE2 = BestTree.end(); S != SE2; ++S) { 1309de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Insert the members of this tree into the list of chosen pairs. 1310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(ValuePair(S->first, S->second)); 1311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected pair: " << *S->first << " <-> " << 1312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *S->second << "\n"); 1313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove all candidate pairs that have values in the chosen tree. 1315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator K = 1316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.begin(); K != CandidatePairs.end();) { 1317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->first == S->first || K->second == S->first || 1318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->second == S->second || K->first == S->second) { 1319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Don't remove the actual pair chosen so that it can be used 1320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in subsequent tree selections. 1321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(K->first == S->first && K->second == S->second)) 1322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.erase(K++); 1323de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1324de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected " << ChosenPairs.size() << " pairs.\n"); 1333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::string getReplacementName(Instruction *I, bool IsInput, unsigned o, 1336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned n = 0) { 1337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!I->hasName()) 1338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ""; 1339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (I->getName() + (IsInput ? ".v.i" : ".v.r") + utostr(o) + 1341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (n > 0 ? "." + utostr(n) : "")).str(); 1342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the pointer input to the vector 1345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 1346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementPointerInput(LLVMContext& Context, 1347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, unsigned o, 1348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &FlipMemInputs) { 1349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 1350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IAlignment, JAlignment; 1351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts; 1352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 1353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts); 1354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The pointer value is taken to be the one with the lowest offset. 1356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *VPtr; 1357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (OffsetInElmts > 0) { 1358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPtr = IPtr; 1359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs = true; 1361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPtr = JPtr; 1362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *ArgType = cast<PointerType>(IPtr->getType())->getElementType(); 1365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgType = getVecTypeForPair(ArgType); 1366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgPtrType = PointerType::get(VArgType, 1367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<PointerType>(IPtr->getType())->getAddressSpace()); 1368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BitCastInst(VPtr, VArgPtrType, getReplacementName(I, true, o), 1369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel /* insert before */ FlipMemInputs ? J : I); 1370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fillNewShuffleMask(LLVMContext& Context, Instruction *J, 1373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem, unsigned MaskOffset, unsigned NumInElem, 1374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IdxOffset, std::vector<Constant*> &Mask) { 1375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned v = 0; v < NumElem/2; ++v) { 1376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int m = cast<ShuffleVectorInst>(J)->getMaskValue(v); 1377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m < 0) { 1378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = UndefValue::get(Type::getInt32Ty(Context)); 1379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned mm = m + (int) IdxOffset; 1381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m >= (int) NumInElem) 1382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel mm += (int) NumInElem; 1383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = 1385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt::get(Type::getInt32Ty(Context), mm); 1386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the vector-shuffle mask to the 1391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector instruction that fuses I with J. 1392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementShuffleMask(LLVMContext& Context, 1393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 1394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the shuffle mask. We need to append the second 1395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // mask to the first, and the numbers need to be adjusted. 1396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *ArgType = I->getType(); 1398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgType = getVecTypeForPair(ArgType); 1399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Get the total number of elements in the fused vector type. 1401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // By definition, this must equal the number of elements in 1402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the final mask. 1403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem = cast<VectorType>(VArgType)->getNumElements(); 1404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(NumElem); 1405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *OpType = I->getOperand(0)->getType(); 1407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumInElem = cast<VectorType>(OpType)->getNumElements(); 1408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the first pair... 1410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel fillNewShuffleMask(Context, I, NumElem, 0, NumInElem, 0, Mask); 1411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the second pair... 1413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel fillNewShuffleMask(Context, J, NumElem, NumElem/2, NumInElem, NumInElem, 1414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask); 1415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ConstantVector::get(Mask); 1417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value to be used as the specified operand of the vector 1420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 1421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementInput(LLVMContext& Context, Instruction *I, 1422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, unsigned o, bool FlipMemInputs) { 1423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 1424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 1425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Compute the fused vector type for this operand 1427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *ArgType = I->getOperand(o)->getType(); 1428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VectorType *VArgType = getVecTypeForPair(ArgType); 1429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *L = I, *H = J; 1431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (FlipMemInputs) { 1432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel L = J; 1433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel H = I; 1434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (ArgType->isVectorTy()) { 1437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned numElem = cast<VectorType>(VArgType)->getNumElements(); 1438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(numElem); 1439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned v = 0; v < numElem; ++v) 1440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 1441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV = new ShuffleVectorInst(L->getOperand(o), 1443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel H->getOperand(o), 1444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantVector::get(Mask), 1445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(I, true, o)); 1446de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BV->insertBefore(J); 1447de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 1448de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1449de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1450de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If these two inputs are the output of another vector instruction, 1451de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then we should use that output directly. It might be necessary to 1452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // permute it first. [When pairings are fused recursively, you can 1453de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // end up with cases where a large vector is decomposed into scalars 1454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // using extractelement instructions, then built into size-2 1455de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectors using insertelement and the into larger vectors using 1456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // shuffles. InstCombine does not simplify all of these cases well, 1457de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and so we make sure that shuffles are generated here when possible. 1458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ExtractElementInst *LEE 1459de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel = dyn_cast<ExtractElementInst>(L->getOperand(o)); 1460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ExtractElementInst *HEE 1461de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel = dyn_cast<ExtractElementInst>(H->getOperand(o)); 1462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1463de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LEE && HEE && 1464de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LEE->getOperand(0)->getType() == HEE->getOperand(0)->getType()) { 1465de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VectorType *EEType = cast<VectorType>(LEE->getOperand(0)->getType()); 1466de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned LowIndx = cast<ConstantInt>(LEE->getOperand(1))->getZExtValue(); 1467de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned HighIndx = cast<ConstantInt>(HEE->getOperand(1))->getZExtValue(); 1468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LEE->getOperand(0) == HEE->getOperand(0)) { 1469de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LowIndx == 0 && HighIndx == 1) 1470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return LEE->getOperand(0); 1471de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1472de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(2); 1473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[0] = ConstantInt::get(Type::getInt32Ty(Context), LowIndx); 1474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[1] = ConstantInt::get(Type::getInt32Ty(Context), HighIndx); 1475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV = new ShuffleVectorInst(LEE->getOperand(0), 1477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UndefValue::get(EEType), 1478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantVector::get(Mask), 1479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(I, true, o)); 1480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BV->insertBefore(J); 1481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 1482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(2); 1485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel HighIndx += EEType->getNumElements(); 1486de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[0] = ConstantInt::get(Type::getInt32Ty(Context), LowIndx); 1487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[1] = ConstantInt::get(Type::getInt32Ty(Context), HighIndx); 1488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV = new ShuffleVectorInst(LEE->getOperand(0), 1490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel HEE->getOperand(0), 1491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantVector::get(Mask), 1492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(I, true, o)); 1493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BV->insertBefore(J); 1494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 1495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV1 = InsertElementInst::Create( 1498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UndefValue::get(VArgType), 1499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel L->getOperand(o), CV0, 1500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(I, true, o, 1)); 1501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BV1->insertBefore(I); 1502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV2 = InsertElementInst::Create(BV1, H->getOperand(o), 1503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CV1, 1504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(I, true, o, 2)); 1505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BV2->insertBefore(J); 1506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV2; 1507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates an array of values that will be used as the inputs 1510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to the vector instruction that fuses I with J. 1511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::getReplacementInputsForPair(LLVMContext& Context, 1512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, 1513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> &ReplacedOperands, 1514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &FlipMemInputs) { 1515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs = false; 1516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 1517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned p = 0, o = NumOperands-1; p < NumOperands; ++p, --o) { 1519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate backward so that we look at the store pointer 1520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first and know whether or not we need to flip the inputs. 1521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I) || (o == 1 && isa<StoreInst>(I))) { 1523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the pointer for a load/store instruction. 1524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementPointerInput(Context, I, J, o, 1525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs); 1526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<CallInst>(I) && o == NumOperands-1) { 1528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = cast<CallInst>(I)->getCalledFunction(); 1529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 1530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB = *I->getParent(); 1531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Module *M = BB.getParent()->getParent(); 1533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *ArgType = I->getType(); 1534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgType = getVecTypeForPair(ArgType); 1535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: is it safe to do this here? 1537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = Intrinsic::getDeclaration(M, 1538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (Intrinsic::ID) IID, VArgType); 1539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I) && o == NumOperands-1) { 1541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementShuffleMask(Context, I, J); 1542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1543de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1544de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = 1546de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementInput(Context, I, J, o, FlipMemInputs); 1547de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1548de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates two values that represent the outputs of the 1551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // original I and J instructions. These are generally vector shuffles 1552de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // or extracts. In many cases, these will end up being unused and, thus, 1553de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // eliminated by later passes. 1554de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 1555de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 1556de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 1557de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&K1, Instruction *&K2, 1558de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &FlipMemInputs) { 1559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 1560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 1561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 1563de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K); 1564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K); 1565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *IType = I->getType(); 1567de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VType = getVecTypeForPair(IType); 1568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IType->isVectorTy()) { 1570de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned numElem = cast<VectorType>(IType)->getNumElements(); 1571de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask1(numElem), Mask2(numElem); 1572de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned v = 0; v < numElem; ++v) { 1573de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 1574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElem+v); 1575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1 = new ShuffleVectorInst(K, UndefValue::get(VType), 1578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantVector::get( 1579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs ? Mask2 : Mask1), 1580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 1581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2 = new ShuffleVectorInst(K, UndefValue::get(VType), 1582de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantVector::get( 1583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs ? Mask1 : Mask2), 1584de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 1585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1 = ExtractElementInst::Create(K, FlipMemInputs ? CV1 : CV0, 1587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 1588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2 = ExtractElementInst::Create(K, FlipMemInputs ? CV0 : CV1, 1589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 1590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1->insertAfter(K); 1593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2->insertAfter(K1); 1594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = K2; 1595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1598de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 1599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::canMoveUsesOfIAfterJ(BasicBlock &BB, 1600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 1601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 1602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 1603ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 1604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J; ++L) 1608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet); 1609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(cast<Instruction>(L) == J && 1611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel "Tracking has not proceeded far enough to check for dependencies"); 1612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If J is now in the use set of I, then trackUsesOfI will return true 1613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and we have a dependency cycle (and the fusing operation must abort). 1614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSet); 1615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 1618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::moveUsesOfIAfterJ(BasicBlock &BB, 1619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 1620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 1621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 1622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 1623ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 1624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J;) { 1628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet)) { 1629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move this instruction 1630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InstToMove = L; ++L; 1631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: moving: " << *InstToMove << 1633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " to after " << *InsertionPt << "\n"); 1634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->removeFromParent(); 1635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->insertAfter(InsertionPt); 1636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = InstToMove; 1637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++L; 1639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Collect all load instruction that are in the move set of a given first 1644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair member. These loads depend on the first instruction, I, and so need 1645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to be moved after J (the second instruction) when the pair is fused. 1646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectPairLoadMoveSet(BasicBlock &BB, 1647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 1649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I) { 1650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 1651ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 1652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: We cannot end the loop when we reach J because J could be moved 1657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // farther down the use chain by another instruction pairing. Also, J 1658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be before I if this is an inverted input. 1659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator E = BB.end(); cast<Instruction>(L) != E; ++L) { 1660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L)) { 1661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (L->mayReadFromMemory()) 1662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(ValuePair(L, I)); 1663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // In cases where both load/stores and the computation of their pointers 1668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // are chosen for vectorization, we can end up in a situation where the 1669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // aliasing analysis starts returning different query results as the 1670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // process of fusing instruction pairs continues. Because the algorithm 1671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // relies on finding the same use trees here as were found earlier, we'll 1672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to precompute the necessary aliasing information here and then 1673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // manually update it during the fusion process. 1674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectLoadMoveSet(BasicBlock &BB, 1675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet) { 1678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 1679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PIE = PairableInsts.end(); PI != PIE; ++PI) { 1680de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(*PI); 1681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) continue; 1682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first); 1684de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectPairLoadMoveSet(BB, ChosenPairs, LoadMoveSet, I); 1685de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1686de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1688de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function fuses the chosen instruction pairs into vector instructions, 1689de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // taking care preserve any needed scalar outputs and, then, it reorders the 1690de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // remaining instructions as needed (users of the first member of the pair 1691de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to be moved to after the location of the second member of the pair 1692de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the vector instruction is inserted in the location of the pair's 1693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // second member). 1694de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fuseChosenPairs(BasicBlock &BB, 1695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs) { 1697de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LLVMContext& Context = BB.getContext(); 1698de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // During the vectorization process, the order of the pairs to be fused 1700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be flipped. So we'll add each pair, flipped, into the ChosenPairs 1701de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // list. After a pair is fused, the flipped pair is removed from the list. 1702de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> FlippedPairs; 1703de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlippedPairs.reserve(ChosenPairs.size()); 1704de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator P = ChosenPairs.begin(), 1705de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); P != E; ++P) 1706de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlippedPairs.push_back(ValuePair(P->second, P->first)); 1707de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator P = FlippedPairs.begin(), 1708de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = FlippedPairs.end(); P != E; ++P) 1709de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(*P); 1710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1711de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> LoadMoveSet; 1712de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectLoadMoveSet(BB, PairableInsts, ChosenPairs, LoadMoveSet); 1713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: initial: \n" << BB << "\n"); 1715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator PI = BB.getFirstInsertionPt(); PI != BB.end();) { 1717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(PI); 1718de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) { 1719de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 1720de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1721de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1722de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getDepthFactor(P->first) == 0) { 1724de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // These instructions are not really fused, but are tracked as though 1725de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // they are. Any case in which it would be interesting to fuse them 1726de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // will be taken care of by InstCombine. 1727de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 1728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 1729de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1731de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first), 1733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *J = cast<Instruction>(P->second); 1734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing: " << *I << 1736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 1737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove the pair and flipped pair from the list. 1739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator FP = ChosenPairs.find(P->second); 1740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(FP != ChosenPairs.end() && "Flipped pair not found in list"); 1741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(FP); 1742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(P); 1743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!canMoveUsesOfIAfterJ(BB, LoadMoveSet, I, J)) { 1745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusion of: " << *I << 1746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << 1747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " aborted because of non-trivial dependency cycle\n"); 1748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 1749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 1750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool FlipMemInputs; 1754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 1755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> ReplacedOperands(NumOperands); 1756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementInputsForPair(Context, I, J, ReplacedOperands, 1757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs); 1758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make a copy of the original operation, change its type to the vector 1760de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and replace its operands with the vector operands. 1761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *K = I->clone(); 1762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->hasName()) K->takeName(I); 1763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(K)) 1765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->mutateType(getVecTypeForPair(I->getType())); 1766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned o = 0; o < NumOperands; ++o) 1768de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->setOperand(o, ReplacedOperands[o]); 1769de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If we've flipped the memory inputs, make sure that we take the correct 1771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // alignment. 1772de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (FlipMemInputs) { 1773de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(K)) 1774de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<StoreInst>(K)->setAlignment(cast<StoreInst>(J)->getAlignment()); 1775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<LoadInst>(K)->setAlignment(cast<LoadInst>(J)->getAlignment()); 1777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->insertAfter(J); 1780de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instruction insertion point: 1782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InsertionPt = K; 1783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *K1 = 0, *K2 = 0; 1784de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel replaceOutputsOfPair(Context, I, J, K, InsertionPt, K1, K2, 1785de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel FlipMemInputs); 1786de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1787de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The use tree of the first original instruction must be moved to after 1788de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the location of the second instruction. The entire use tree of the 1789de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first instruction is disjoint from the input tree of the second 1790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (by definition), and so commutes with it. 1791de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel moveUsesOfIAfterJ(BB, LoadMoveSet, InsertionPt, I, J); 1793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1794de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(I)) { 1795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->replaceAllUsesWith(K1); 1796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->replaceAllUsesWith(K2); 1797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K1); 1798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K2); 1799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instructions that may read from memory may be in the load move set. 1802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Once an instruction is fused, we no longer need its move set, and so 1803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the values of the map never need to be updated. However, when a load 1804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is fused, we need to merge the entries from both instructions in the 1805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in case those instructions were in the move set of some other 1806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // yet-to-be-fused pair. The loads in question are the keys of the map. 1807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->mayReadFromMemory()) { 1808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> NewSetMembers; 1809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = LoadMoveSet.equal_range(I); 1810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet.equal_range(J); 1811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = IPairRange.first; 1812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != IPairRange.second; ++N) 1813de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 1814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = JPairRange.first; 1815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != JPairRange.second; ++N) 1816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 1817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator A = NewSetMembers.begin(), 1818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AE = NewSetMembers.end(); A != AE; ++A) 1819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(*A); 1820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before removing I, set the iterator to the next instruction. 1823de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PI = llvm::next(BasicBlock::iterator(I)); 1824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (cast<Instruction>(PI) == J) 1825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 1826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(I); 1828de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(J); 1829de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->eraseFromParent(); 1830de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->eraseFromParent(); 1831de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1833de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: final: \n" << BB << "\n"); 1834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 1836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1837de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelchar BBVectorize::ID = 0; 1838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic const char bb_vectorize_name[] = "Basic-Block Vectorization"; 1839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_BEGIN(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 1840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_AG_DEPENDENCY(AliasAnalysis) 1841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 1842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_END(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 1843de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1844de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelBasicBlockPass *llvm::createBBVectorizePass() { 1845de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BBVectorize(); 1846de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 1847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1848