BBVectorize.cpp revision 72465ea23d010507d3746adc126d719005981e05
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" 26ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel#include "llvm/Metadata.h" 27de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Pass.h" 28de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Type.h" 29de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseMap.h" 30de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseSet.h" 31de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/SmallVector.h" 32de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/Statistic.h" 33de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/STLExtras.h" 34de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/StringExtras.h" 35de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasAnalysis.h" 36de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasSetTracker.h" 37e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel#include "llvm/Analysis/Dominators.h" 38de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolution.h" 39de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolutionExpressions.h" 40de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ValueTracking.h" 41de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/CommandLine.h" 42de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/Debug.h" 43de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/raw_ostream.h" 44de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/ValueHandle.h" 453574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow#include "llvm/DataLayout.h" 4665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel#include "llvm/TargetTransformInfo.h" 4764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel#include "llvm/Transforms/Utils/Local.h" 48de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Transforms/Vectorize.h" 49de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <algorithm> 50de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <map> 51de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelusing namespace llvm; 52de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 5365309660fa61a837cc05323f69c618a7d8134d56Hal Finkelstatic cl::opt<bool> 5465309660fa61a837cc05323f69c618a7d8134d56Hal FinkelIgnoreTargetInfo("bb-vectorize-ignore-target-info", cl::init(false), 5565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cl::Hidden, cl::desc("Ignore target information")); 5665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 57de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 58de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelReqChainDepth("bb-vectorize-req-chain-depth", cl::init(6), cl::Hidden, 59de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The required chain depth for vectorization")); 60de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 61de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 62de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSearchLimit("bb-vectorize-search-limit", cl::init(400), cl::Hidden, 63de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum search distance for instruction pairs")); 64de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 65de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 66de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSplatBreaksChain("bb-vectorize-splat-breaks-chain", cl::init(false), cl::Hidden, 67de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Replicating one element to a pair breaks the chain")); 68de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 69de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 70de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelVectorBits("bb-vectorize-vector-bits", cl::init(128), cl::Hidden, 71de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The size of the native vector registers")); 72de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 73de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 74de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxIter("bb-vectorize-max-iter", cl::init(0), cl::Hidden, 75de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum number of pairing iterations")); 76de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 7764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkelstatic cl::opt<bool> 7864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal FinkelPow2LenOnly("bb-vectorize-pow2-len-only", cl::init(false), cl::Hidden, 7964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cl::desc("Don't try to form non-2^n-length vectors")); 8064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 81de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 825d4e18bc39fea892f523d960213906d296d3cb38Hal FinkelMaxInsts("bb-vectorize-max-instr-per-group", cl::init(500), cl::Hidden, 835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel cl::desc("The maximum number of pairable instructions per group")); 845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 855d4e18bc39fea892f523d960213906d296d3cb38Hal Finkelstatic cl::opt<unsigned> 86de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxCandPairsForCycleCheck("bb-vectorize-max-cycle-check-pairs", cl::init(200), 87de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::Hidden, cl::desc("The maximum number of candidate pairs with which to use" 88de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " a full cycle check")); 89de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 90de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 91768edf3cd037aab10391abc279f71470df8e3156Hal FinkelNoBools("bb-vectorize-no-bools", cl::init(false), cl::Hidden, 92768edf3cd037aab10391abc279f71470df8e3156Hal Finkel cl::desc("Don't try to vectorize boolean (i1) values")); 93768edf3cd037aab10391abc279f71470df8e3156Hal Finkel 94768edf3cd037aab10391abc279f71470df8e3156Hal Finkelstatic cl::opt<bool> 95de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoInts("bb-vectorize-no-ints", cl::init(false), cl::Hidden, 96de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize integer values")); 97de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 98de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 99de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFloats("bb-vectorize-no-floats", cl::init(false), cl::Hidden, 100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point values")); 101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 102822ab00847da841a63be4e3883cb5f442dc69069Hal Finkel// FIXME: This should default to false once pointer vector support works. 103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 104822ab00847da841a63be4e3883cb5f442dc69069Hal FinkelNoPointers("bb-vectorize-no-pointers", cl::init(/*false*/ true), cl::Hidden, 105f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize pointer values")); 106f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 107f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoCasts("bb-vectorize-no-casts", cl::init(false), cl::Hidden, 109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize casting (conversion) operations")); 110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMath("bb-vectorize-no-math", cl::init(false), cl::Hidden, 113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point math intrinsics")); 114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFMA("bb-vectorize-no-fma", cl::init(false), cl::Hidden, 117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize the fused-multiply-add intrinsic")); 118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 120fc3665c87519850f629c9565535e3be447e10addHal FinkelNoSelect("bb-vectorize-no-select", cl::init(false), cl::Hidden, 121fc3665c87519850f629c9565535e3be447e10addHal Finkel cl::desc("Don't try to vectorize select instructions")); 122fc3665c87519850f629c9565535e3be447e10addHal Finkel 123fc3665c87519850f629c9565535e3be447e10addHal Finkelstatic cl::opt<bool> 124e415f96b6a43ac8861148a11a4258bc38c247e8fHal FinkelNoCmp("bb-vectorize-no-cmp", cl::init(false), cl::Hidden, 125e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel cl::desc("Don't try to vectorize comparison instructions")); 126e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel 127e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkelstatic cl::opt<bool> 128f3f5a1e6f77a842ccb24cc81766437da5197d712Hal FinkelNoGEP("bb-vectorize-no-gep", cl::init(false), cl::Hidden, 129f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize getelementptr instructions")); 130f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 131f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMemOps("bb-vectorize-no-mem-ops", cl::init(false), cl::Hidden, 133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize loads and stores")); 134de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 135de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 136de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelAlignedOnly("bb-vectorize-aligned-only", cl::init(false), cl::Hidden, 137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Only generate aligned loads and stores")); 138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 140edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal FinkelNoMemOpBoost("bb-vectorize-no-mem-op-boost", 141edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::init(false), cl::Hidden, 142edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::desc("Don't boost the chain-depth contribution of loads and stores")); 143edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 144edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkelstatic cl::opt<bool> 145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelFastDep("bb-vectorize-fast-dep", cl::init(false), cl::Hidden, 146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Use a fast instruction dependency analysis")); 147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#ifndef NDEBUG 149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugInstructionExamination("bb-vectorize-debug-instruction-examination", 151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " instruction-examination process")); 154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCandidateSelection("bb-vectorize-debug-candidate-selection", 156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " candidate-selection process")); 159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugPairSelection("bb-vectorize-debug-pair-selection", 161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " pair-selection process")); 164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCycleCheck("bb-vectorize-debug-cycle-check", 166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " cycle-checking process")); 16972465ea23d010507d3746adc126d719005981e05Hal Finkel 17072465ea23d010507d3746adc126d719005981e05Hal Finkelstatic cl::opt<bool> 17172465ea23d010507d3746adc126d719005981e05Hal FinkelPrintAfterEveryPair("bb-vectorize-debug-print-after-every-pair", 17272465ea23d010507d3746adc126d719005981e05Hal Finkel cl::init(false), cl::Hidden, 17372465ea23d010507d3746adc126d719005981e05Hal Finkel cl::desc("When debugging is enabled, dump the basic block after" 17472465ea23d010507d3746adc126d719005981e05Hal Finkel " every pair is fused")); 175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#endif 176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSTATISTIC(NumFusedOps, "Number of operations fused by bb-vectorize"); 178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelnamespace { 180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel struct BBVectorize : public BasicBlockPass { 181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static char ID; // Pass identification, replacement for typeid 182bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 183940371bc65570ec0add1ede4f4d9f0a41ba25e09Hongbin Zheng const VectorizeConfig Config; 184bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 185bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(const VectorizeConfig &C = VectorizeConfig()) 186bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel initializeBBVectorizePass(*PassRegistry::getPassRegistry()); 188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 190bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(Pass *P, const VectorizeConfig &C) 191bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 19287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &P->getAnalysis<AliasAnalysis>(); 193e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &P->getAnalysis<DominatorTree>(); 19487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &P->getAnalysis<ScalarEvolution>(); 1953574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = P->getAnalysisIfAvailable<DataLayout>(); 19665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TTI = IgnoreTargetInfo ? 0 : 19765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel P->getAnalysisIfAvailable<TargetTransformInfo>(); 19865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel VTTI = TTI ? TTI->getVectorTargetTransformInfo() : 0; 19987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 20087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<Value *, Value *> ValuePair; 20265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel typedef std::pair<ValuePair, int> ValuePairWithCost; 203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, size_t> ValuePairWithDepth; 204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair 20572465ea23d010507d3746adc126d719005981e05Hal Finkel typedef std::pair<VPPair, unsigned> VPPairWithType; 206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<Value *, Value *>::iterator, 207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *>::iterator> VPIteratorPair; 208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, 209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair>::iterator> 210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair; 211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis *AA; 213e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DominatorTree *DT; 214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ScalarEvolution *SE; 2153574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow DataLayout *TD; 21665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TargetTransformInfo *TTI; 21765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel const VectorTargetTransformInfo *VTTI; 218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: const correct? 220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 22164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool vectorizePairs(BasicBlock &BB, bool NonPow2Len = false); 222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool getCandidatePairs(BasicBlock &BB, 2245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 226a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 22765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 22864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len); 229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 23072465ea23d010507d3746adc126d719005981e05Hal Finkel enum PairConnectionType { 23172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionDirect, 23272465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSwap, 23372465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSplat 23472465ea23d010507d3746adc126d719005981e05Hal Finkel }; 23572465ea23d010507d3746adc126d719005981e05Hal Finkel 236de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, 237de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 23872465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 23972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes); 240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildDepMap(BasicBlock &BB, 242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers); 245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void choosePairs(std::multimap<Value *, Value *> &CandidatePairs, 24765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs); 252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fuseChosenPairs(BasicBlock &BB, 254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 255a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *>& ChosenPairs, 25672465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 25772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 25872465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 25972465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps); 26072465ea23d010507d3746adc126d719005981e05Hal Finkel 261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isInstVectorizable(Instruction *I, bool &IsSimpleLoadStore); 263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool areInstsCompatible(Instruction *I, Instruction *J, 26565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 266a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder); 267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool trackUsesOfI(DenseSet<Value *> &Users, 269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers = true, 271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet = 0); 2721230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computePairsConnectedTo( 274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 27772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P); 279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairsConflict(ValuePair P, ValuePair Q, 281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap = 0); 283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairWillFormCycle(ValuePair P, 285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUsers, 286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs); 287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void pruneTreeFor( 289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildInitialTreeFor( 300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J); 306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void findBestTreeFor( 308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 30965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 31665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementPointerInput(LLVMContext& Context, Instruction *I, 320202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *J, unsigned o); 321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fillNewShuffleMask(LLVMContext& Context, Instruction *J, 32364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 32464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 32564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask); 326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementShuffleMask(LLVMContext& Context, Instruction *I, 328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J); 329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 33064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool expandIEChain(LLVMContext& Context, Instruction *I, Instruction *J, 33164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned o, Value *&LOp, unsigned numElemL, 33272465ea23d010507d3746adc126d719005981e05Hal Finkel Type *ArgTypeL, Type *ArgTypeR, bool IBeforeJ, 33364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned IdxOff = 0); 33464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementInput(LLVMContext& Context, Instruction *I, 33672465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ); 337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void getReplacementInputsForPair(LLVMContext& Context, Instruction *I, 33972465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, SmallVector<Value *, 3> &ReplacedOperands, 34072465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ); 341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, Instruction *&K1, 345202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K2); 346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectPairLoadMoveSet(BasicBlock &BB, 348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I); 351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectLoadMoveSet(BasicBlock &BB, 353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet); 356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool canMoveUsesOfIAfterJ(BasicBlock &BB, 358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void moveUsesOfIAfterJ(BasicBlock &BB, 362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 366ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void combineMetadata(Instruction *K, const Instruction *J); 367ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 36887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng bool vectorizeBB(BasicBlock &BB) { 369e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel if (!DT->isReachableFromEntry(&BB)) { 370e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DEBUG(dbgs() << "BBV: skipping unreachable " << BB.getName() << 371e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel " in " << BB.getParent()->getName() << "\n"); 372e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel return false; 373e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel } 374e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel 37565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DEBUG(if (VTTI) dbgs() << "BBV: using target information\n"); 37665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool changed = false; 378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate a sufficient number of times to merge types of size 1 bit, 379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then 2 bits, then 4, etc. up to half of the target vector width of the 380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // target vector register. 38164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned n = 1; 38264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 2; 38365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (VTTI || v <= Config.VectorBits) && 38465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (!Config.MaxIter || n <= Config.MaxIter); 385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel v *= 2, ++n) { 386bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng DEBUG(dbgs() << "BBV: fusing loop #" << n << 387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " for " << BB.getName() << " in " << 388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BB.getParent()->getName() << "...\n"); 389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (vectorizePairs(BB)) 390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel changed = true; 391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 39564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (changed && !Pow2LenOnly) { 39664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ++n; 39764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; !Config.MaxIter || n <= Config.MaxIter; ++n) { 39864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel DEBUG(dbgs() << "BBV: fusing for non-2^n-length vectors loop #: " << 39964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel n << " for " << BB.getName() << " in " << 40064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel BB.getParent()->getName() << "...\n"); 40164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!vectorizePairs(BB, true)) break; 40264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 40364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 40464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: done!\n"); 406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return changed; 407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 40987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng virtual bool runOnBasicBlock(BasicBlock &BB) { 41087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &getAnalysis<AliasAnalysis>(); 411e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &getAnalysis<DominatorTree>(); 41287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &getAnalysis<ScalarEvolution>(); 4133574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = getAnalysisIfAvailable<DataLayout>(); 41465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TTI = IgnoreTargetInfo ? 0 : 41565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel getAnalysisIfAvailable<TargetTransformInfo>(); 41665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel VTTI = TTI ? TTI->getVectorTargetTransformInfo() : 0; 41787825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 41887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return vectorizeBB(BB); 41987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 42087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel virtual void getAnalysisUsage(AnalysisUsage &AU) const { 422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlockPass::getAnalysisUsage(AU); 423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<AliasAnalysis>(); 424e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel AU.addRequired<DominatorTree>(); 425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<ScalarEvolution>(); 426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<AliasAnalysis>(); 427e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel AU.addPreserved<DominatorTree>(); 428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<ScalarEvolution>(); 4297e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel AU.setPreservesCFG(); 430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 43264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline VectorType *getVecTypeForPair(Type *ElemTy, Type *Elem2Ty) { 43364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel assert(ElemTy->getScalarType() == Elem2Ty->getScalarType() && 43464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel "Cannot form vector from incompatible scalar types"); 43564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *STy = ElemTy->getScalarType(); 43664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 43764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem; 438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (VectorType *VTy = dyn_cast<VectorType>(ElemTy)) { 43964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = VTy->getNumElements(); 44064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 44164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = 1; 44264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 44364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 44464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VectorType *VTy = dyn_cast<VectorType>(Elem2Ty)) { 44564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += VTy->getNumElements(); 44664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 44764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += 1; 448de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 4497e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel 45064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return VectorType::get(STy, numElem); 45164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 45264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 45364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline void getInstructionTypes(Instruction *I, 45464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *&T1, Type *&T2) { 45564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<StoreInst>(I)) { 45664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // For stores, it is the value type, not the pointer type that matters 45764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // because the value is what will come from a vector register. 45864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 45964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *IVal = cast<StoreInst>(I)->getValueOperand(); 46064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = IVal->getType(); 46164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 46264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = I->getType(); 46364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 46464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 46564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I->isCast()) 46664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T2 = cast<CastInst>(I)->getSrcTy(); 46764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 46864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T2 = T1; 46965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 47065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (SelectInst *SI = dyn_cast<SelectInst>(I)) { 47165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel T2 = SI->getCondition()->getType(); 47265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the weight associated with the provided value. A chain of 476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate pairs has a length given by the sum of the weights of its 477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // members (one weight per pair; the weight of each member of the pair 478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is assumed to be the same). This length is then compared to the 479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chain-length threshold to determine if a given chain is significant 480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // enough to be vectorized. The length is also used in comparing 481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate chains where longer chains are considered to be better. 482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: when this function returns 0, the resulting instructions are 483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // not actually fused. 484bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng inline size_t getDepthFactor(Value *V) { 485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // InsertElement and ExtractElement have a depth factor of zero. This is 486de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // for two reasons: First, they cannot be usefully fused. Second, because 487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pass generates a lot of these, they can confuse the simple metric 488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // used to compare the trees in the next iteration. Thus, giving them a 489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // weight of zero allows the pass to essentially ignore them in 490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // subsequent iterations when looking for vectorization opportunities 491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // while still tracking dependency chains that flow through those 492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions. 493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<InsertElementInst>(V) || isa<ExtractElementInst>(V)) 494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 0; 495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 496edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // Give a load or store half of the required depth so that load/store 497edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // pairs will vectorize. 498bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (!Config.NoMemOpBoost && (isa<LoadInst>(V) || isa<StoreInst>(V))) 499bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return Config.ReqChainDepth/2; 500edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 1; 502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 50446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // Returns the cost of the provided instruction using VTTI. 50546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // This does not handle loads and stores. 50646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned getInstrCost(unsigned Opcode, Type *T1, Type *T2) { 50746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel switch (Opcode) { 50846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel default: break; 50946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::GetElementPtr: 51046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // We mark this instruction as zero-cost because scalar GEPs are usually 51146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // lowered to the intruction addressing mode. At the moment we don't 51246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // generate vector GEPs. 51346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 51446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Br: 51546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCFInstrCost(Opcode); 51646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PHI: 51746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 51846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Add: 51946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FAdd: 52046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Sub: 52146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FSub: 52246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Mul: 52346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FMul: 52446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UDiv: 52546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SDiv: 52646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FDiv: 52746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::URem: 52846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SRem: 52946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FRem: 53046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Shl: 53146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::LShr: 53246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::AShr: 53346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::And: 53446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Or: 53546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Xor: 53646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getArithmeticInstrCost(Opcode, T1); 53746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Select: 53846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ICmp: 53946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FCmp: 54046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCmpSelInstrCost(Opcode, T1, T2); 54146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ZExt: 54246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SExt: 54346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToUI: 54446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToSI: 54546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPExt: 54646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PtrToInt: 54746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::IntToPtr: 54846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SIToFP: 54946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UIToFP: 55046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Trunc: 55146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPTrunc: 55246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::BitCast: 55346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCastInstrCost(Opcode, T1, T2); 55446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 55546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 55646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 1; 55746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 55846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This determines the relative offset of two loads or stores, returning 560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if the offset could be determined to be some constant value. 561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For example, if OffsetInElmts == 1, then J accesses the memory directly 562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after I; if OffsetInElmts == -1 then I accesses the memory 56364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // directly after J. 564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool getPairPtrInfo(Instruction *I, Instruction *J, 565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *&IPtr, Value *&JPtr, unsigned &IAlignment, unsigned &JAlignment, 56665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned &IAddressSpace, unsigned &JAddressSpace, 56793f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel int64_t &OffsetInElmts, bool ComputeOffset = true) { 568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = 0; 56965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (LoadInst *LI = dyn_cast<LoadInst>(I)) { 57065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel LoadInst *LJ = cast<LoadInst>(J); 57165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = LI->getPointerOperand(); 57265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = LJ->getPointerOperand(); 57365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = LI->getAlignment(); 57465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = LJ->getAlignment(); 57565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = LI->getPointerAddressSpace(); 57665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = LJ->getPointerAddressSpace(); 577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 57865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel StoreInst *SI = cast<StoreInst>(I), *SJ = cast<StoreInst>(J); 57965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = SI->getPointerOperand(); 58065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = SJ->getPointerOperand(); 58165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = SI->getAlignment(); 58265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = SJ->getAlignment(); 58365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = SI->getPointerAddressSpace(); 58465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = SJ->getPointerAddressSpace(); 585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 58793f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel if (!ComputeOffset) 58893f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel return true; 58993f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel 590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *IPtrSCEV = SE->getSCEV(IPtr); 591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *JPtrSCEV = SE->getSCEV(JPtr); 592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If this is a trivial offset, then we'll get something like 594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // 1*sizeof(type). With target data, which we need anyway, this will get 595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // constant folded into a number. 596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV); 597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (const SCEVConstant *ConstOffSCEV = 598de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dyn_cast<SCEVConstant>(OffsetSCEV)) { 599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt *IntOff = ConstOffSCEV->getValue(); 600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t Offset = IntOff->getSExtValue(); 601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VTy = cast<PointerType>(IPtr->getType())->getElementType(); 603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t VTyTSS = (int64_t) TD->getTypeStoreSize(VTy); 604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 60564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VTy2 = cast<PointerType>(JPtr->getType())->getElementType(); 60664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VTy != VTy2 && Offset < 0) { 60764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int64_t VTy2TSS = (int64_t) TD->getTypeStoreSize(VTy2); 60864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel OffsetInElmts = Offset/VTy2TSS; 60964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return (abs64(Offset) % VTy2TSS) == 0; 61064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = Offset/VTyTSS; 613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (abs64(Offset) % VTyTSS) == 0; 614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if the provided CallInst represents an intrinsic that can 620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be vectorized. 621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isVectorizableIntrinsic(CallInst* I) { 622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = I->getCalledFunction(); 623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!F) return false; 624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IID) return false; 627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel switch(IID) { 629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel default: 630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sqrt: 632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::powi: 633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sin: 634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::cos: 635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log: 636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log2: 637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log10: 638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp: 639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp2: 640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::pow: 64186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeMath; 642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::fma: 64386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeFMA; 644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if J is the second element in some pair referenced by 648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some multimap pair iterator pair. 649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel template <typename V> 650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isSecondInIteratorPair(V J, std::pair< 651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator, 652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator> PairRange) { 653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (typename std::multimap<V, V>::iterator K = PairRange.first; 654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != PairRange.second; ++K) 655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->second == J) return true; 656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel }; 660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function implements one vectorization iteration on the provided 662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block. It returns true if the block is changed. 66364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::vectorizePairs(BasicBlock &BB, bool NonPow2Len) { 6645d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue; 6655d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator Start = BB.getFirstInsertionPt(); 6665d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 6675d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> AllPairableInsts; 6685d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> AllChosenPairs; 669a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> AllFixedOrderPairs; 67072465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> AllPairConnectionTypes; 67172465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> AllConnectedPairs, AllConnectedPairDeps; 6725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 6735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel do { 6745d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> PairableInsts; 6755d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::multimap<Value *, Value *> CandidatePairs; 676a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> FixedOrderPairs; 67765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> CandidatePairCostSavings; 6785d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, 679a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs, 68065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings, 68164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PairableInsts, NonPow2Len); 6825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.empty()) continue; 6833706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 6845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Now we have a map of all of the pairable instructions and we need to 6855d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // select the best possible pairing. A good pairing is one such that the 6865d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // users of the pair are also paired. This defines a (directed) forest 68794c22716d60ff5edf6a98a3c67e0faa001be1142Sylvestre Ledru // over the pairs such that two pairs are connected iff the second pair 6885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // uses the first. 6893706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 6905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Note that it only matters that both members of the second pair use some 6915d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // element of the first pair (to allow for splatting). 6923706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 69372465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> ConnectedPairs, ConnectedPairDeps; 69472465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> PairConnectionTypes; 69572465ea23d010507d3746adc126d719005981e05Hal Finkel computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs, 69672465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes); 6975d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ConnectedPairs.empty()) continue; 6983706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 69972465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 70072465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 70172465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 70272465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairDeps.insert(VPPair(I->second, I->first)); 70372465ea23d010507d3746adc126d719005981e05Hal Finkel } 70472465ea23d010507d3746adc126d719005981e05Hal Finkel 7055d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Build the pairable-instruction dependency map 7065d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseSet<ValuePair> PairableInstUsers; 7075d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); 7083706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 70935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // There is now a graph of the connected pairs. For each variable, pick 71035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // the pairing with the largest tree meeting the depth requirement on at 71135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // least one branch. Then select all pairings that are part of that tree 71235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // and remove them from the list of available pairings and pairable 71335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // variables. 7143706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7155d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> ChosenPairs; 71665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel choosePairs(CandidatePairs, CandidatePairCostSavings, 71765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel PairableInsts, ConnectedPairs, 7185d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInstUsers, ChosenPairs); 7193706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7205d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ChosenPairs.empty()) continue; 7215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), 7225d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts.end()); 7235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end()); 724a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 72572465ea23d010507d3746adc126d719005981e05Hal Finkel // Only for the chosen pairs, propagate information on fixed-order pairs, 72672465ea23d010507d3746adc126d719005981e05Hal Finkel // pair connections, and their types to the data structures used by the 72772465ea23d010507d3746adc126d719005981e05Hal Finkel // pair fusion procedures. 728a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel for (DenseMap<Value *, Value *>::iterator I = ChosenPairs.begin(), 729a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel IE = ChosenPairs.end(); I != IE; ++I) { 730a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrderPairs.count(*I)) 731a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(*I); 732a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrderPairs.count(ValuePair(I->second, I->first))) 733a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(ValuePair(I->second, I->first)); 73472465ea23d010507d3746adc126d719005981e05Hal Finkel 73572465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseMap<Value *, Value *>::iterator J = ChosenPairs.begin(); 73672465ea23d010507d3746adc126d719005981e05Hal Finkel J != IE; ++J) { 73772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator K = 73872465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(*I, *J)); 73972465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) { 74072465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 74172465ea23d010507d3746adc126d719005981e05Hal Finkel } else { 74272465ea23d010507d3746adc126d719005981e05Hal Finkel K = PairConnectionTypes.find(VPPair(*J, *I)); 74372465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) 74472465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 74572465ea23d010507d3746adc126d719005981e05Hal Finkel } 74672465ea23d010507d3746adc126d719005981e05Hal Finkel } 74772465ea23d010507d3746adc126d719005981e05Hal Finkel } 74872465ea23d010507d3746adc126d719005981e05Hal Finkel 74972465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 75072465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 75172465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 75272465ea23d010507d3746adc126d719005981e05Hal Finkel if (AllPairConnectionTypes.count(*I)) { 75372465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs.insert(*I); 75472465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairDeps.insert(VPPair(I->second, I->first)); 75572465ea23d010507d3746adc126d719005981e05Hal Finkel } 756a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel } 7575d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } while (ShouldContinue); 7585d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7595d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (AllChosenPairs.empty()) return false; 7605d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel NumFusedOps += AllChosenPairs.size(); 7613706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A set of pairs has now been selected. It is now necessary to replace the 763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // paired instructions with vector instructions. For this procedure each 76443ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop // operand must be replaced with a vector operand. This vector is formed 765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // by using build_vector on the old operands. The replaced values are then 766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // replaced with a vector_extract on the result. Subsequent optimization 767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // passes should coalesce the build/extract combinations. 7683706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 76972465ea23d010507d3746adc126d719005981e05Hal Finkel fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs, AllFixedOrderPairs, 77072465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes, 77172465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs, AllConnectedPairDeps); 77264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 77364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // It is important to cleanup here so that future iterations of this 77464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // function have less work to do. 7758e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer (void) SimplifyInstructionsInBlock(&BB, TD, AA->getTargetLibraryInfo()); 776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the provided instruction is capable of being 780de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fused into a vector instruction. This determination is based only on the 781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and other attributes of the instruction. 782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::isInstVectorizable(Instruction *I, 783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &IsSimpleLoadStore) { 784de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = false; 785de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 786de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (CallInst *C = dyn_cast<CallInst>(I)) { 787de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isVectorizableIntrinsic(C)) 788de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 789de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (LoadInst *L = dyn_cast<LoadInst>(I)) { 790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple loads if possbile: 791de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = L->isSimple(); 79286312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 794de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (StoreInst *S = dyn_cast<StoreInst>(I)) { 795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple stores if possbile: 796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = S->isSimple(); 79786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (CastInst *C = dyn_cast<CastInst>(I)) { 800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can vectorize casts, but not casts of pointer types, etc. 80186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeCasts) 802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *SrcTy = C->getSrcTy(); 805f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!SrcTy->isSingleValueType()) 806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *DestTy = C->getDestTy(); 809f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!DestTy->isSingleValueType()) 810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 811fc3665c87519850f629c9565535e3be447e10addHal Finkel } else if (isa<SelectInst>(I)) { 812fc3665c87519850f629c9565535e3be447e10addHal Finkel if (!Config.VectorizeSelect) 813fc3665c87519850f629c9565535e3be447e10addHal Finkel return false; 814e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel } else if (isa<CmpInst>(I)) { 815e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel if (!Config.VectorizeCmp) 816e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel return false; 817f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel } else if (GetElementPtrInst *G = dyn_cast<GetElementPtrInst>(I)) { 818f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!Config.VectorizeGEP) 819f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 820f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 821f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel // Currently, vector GEPs exist only with one index. 822f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (G->getNumIndices() != 1) 823f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!(I->isBinaryOp() || isa<ShuffleVectorInst>(I) || 825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<ExtractElementInst>(I) || isa<InsertElementInst>(I))) { 826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 828de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 829de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can't vectorize memory operations without target data 830de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (TD == 0 && IsSimpleLoadStore) 831de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 833de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *T1, *T2; 83464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, T1, T2); 835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Not every type can be vectorized... 837de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(VectorType::isValidElementType(T1) || T1->isVectorTy()) || 838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel !(VectorType::isValidElementType(T2) || T2->isVectorTy())) 839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 84165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T1->getScalarSizeInBits() == 1) { 842768edf3cd037aab10391abc279f71470df8e3156Hal Finkel if (!Config.VectorizeBools) 843768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 844768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } else { 84565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T1->isIntOrIntVectorTy()) 846768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 847768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } 84865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 84965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T2->getScalarSizeInBits() == 1) { 85065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeBools) 85165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 85265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 85365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T2->isIntOrIntVectorTy()) 85465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 85565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 85665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 85786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeFloats 85886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng && (T1->isFPOrFPVectorTy() || T2->isFPOrFPVectorTy())) 859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 861e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel // Don't vectorize target-specific types. 862e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T1->isX86_FP80Ty() || T1->isPPC_FP128Ty() || T1->isX86_MMXTy()) 863e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 864e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T2->isX86_FP80Ty() || T2->isPPC_FP128Ty() || T2->isX86_MMXTy()) 865e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 866e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel 86705bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel if ((!Config.VectorizePointers || TD == 0) && 86805bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel (T1->getScalarType()->isPointerTy() || 86905bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel T2->getScalarType()->isPointerTy())) 870f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 871f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 87265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!VTTI && (T1->getPrimitiveSizeInBits() >= Config.VectorBits || 87365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel T2->getPrimitiveSizeInBits() >= Config.VectorBits)) 874de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 877de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 878de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 879de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the two provided instructions are compatible 880de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (meaning that they can be fused into a vector instruction). This assumes 881de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that I has already been determined to be vectorizable and that J is not 882de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in the use tree of I. 883de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::areInstsCompatible(Instruction *I, Instruction *J, 88465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 885a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder) { 886de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugInstructionExamination) dbgs() << "BBV: looking at " << *I << 887de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 888de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 88965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = 0; 890a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = 0; 89165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Loads and stores can be merged if they have different alignments, 893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but are otherwise the same. 89464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!J->isSameOperationAs(I, Instruction::CompareIgnoringAlignment | 89564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (NonPow2Len ? Instruction::CompareUsingScalarTypes : 0))) 89664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return false; 89764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 89864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *IT1, *IT2, *JT1, *JT2; 89964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, IT1, IT2); 90064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(J, JT1, JT2); 90164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaxTypeBits = std::max( 90264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT1->getPrimitiveSizeInBits() + JT1->getPrimitiveSizeInBits(), 90364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT2->getPrimitiveSizeInBits() + JT2->getPrimitiveSizeInBits()); 90465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!VTTI && MaxTypeBits > Config.VectorBits) 905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 906ec4e85e3364f50802f2007e4b1e23661d4610366Hal Finkel 907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: handle addsub-type operations! 908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsSimpleLoadStore) { 910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 91165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts = 0; 913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 91465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts) && abs64(OffsetInElmts) == 1) { 916a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = (int) OffsetInElmts; 91765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned BottomAlignment = IAlignment; 91865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (OffsetInElmts < 0) BottomAlignment = JAlignment; 91965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 92065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeI = isa<StoreInst>(I) ? 92165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(I)->getValueOperand()->getType() : I->getType(); 92265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeJ = isa<StoreInst>(J) ? 92365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(J)->getValueOperand()->getType() : J->getType(); 92465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VType = getVecTypeForPair(aTypeI, aTypeJ); 92564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 92665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (Config.AlignedOnly) { 927de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // An aligned load or store is possible only if the instruction 928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // with the lower offset has an alignment suitable for the 929de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector type. 9301230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 931de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned VecAlignment = TD->getPrefTypeAlignment(VType); 932de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (BottomAlignment < VecAlignment) 933de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 934de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 93565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 93665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) { 93765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned ICost = VTTI->getMemoryOpCost(I->getOpcode(), I->getType(), 93865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment, IAddressSpace); 93965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned JCost = VTTI->getMemoryOpCost(J->getOpcode(), J->getType(), 94065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment, JAddressSpace); 94165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned VCost = VTTI->getMemoryOpCost(I->getOpcode(), VType, 94265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel BottomAlignment, 94365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace); 94465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 94565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 94682149a9106f221aa6a7271977c236b078e621f21Hal Finkel 947dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 94882149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 949dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 950dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel unsigned VParts = VTTI->getNumberOfParts(VType); 951dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 952dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 953dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 95482149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 95582149a9106f221aa6a7271977c236b078e621f21Hal Finkel 95665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 95765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 958de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 959de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 960de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 96165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else if (VTTI) { 96246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned ICost = getInstrCost(I->getOpcode(), IT1, IT2); 96346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned JCost = getInstrCost(J->getOpcode(), JT1, JT2); 96465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VT1 = getVecTypeForPair(IT1, JT1), 96565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel *VT2 = getVecTypeForPair(IT2, JT2); 96646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned VCost = getInstrCost(I->getOpcode(), VT1, VT2); 96765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 96865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 96965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 97082149a9106f221aa6a7271977c236b078e621f21Hal Finkel 971dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 97282149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 973dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 974dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel unsigned VParts = VTTI->getNumberOfParts(VT1); 975dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 976dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 977dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 97882149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 97982149a9106f221aa6a7271977c236b078e621f21Hal Finkel 98065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 981de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 982de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 9836173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The powi intrinsic is special because only the first argument is 9846173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // vectorized, the second arguments must be equal. 9856173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel CallInst *CI = dyn_cast<CallInst>(I); 9866173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Function *FI; 9876173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (CI && (FI = CI->getCalledFunction()) && 9886173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel FI->getIntrinsicID() == Intrinsic::powi) { 9896173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 9906173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Value *A1I = CI->getArgOperand(1), 9916173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel *A1J = cast<CallInst>(J)->getArgOperand(1); 9926173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel const SCEV *A1ISCEV = SE->getSCEV(A1I), 9936173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel *A1JSCEV = SE->getSCEV(A1J); 9946173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel return (A1ISCEV == A1JSCEV); 9956173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 9966173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 999de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1000de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Figure out whether or not J uses I and update the users and write-set 1001de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // structures associated with I. Specifically, Users represents the set of 1002de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions that depend on I. WriteSet represents the set 1003de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of memory locations that are dependent on I. If UpdateUsers is true, 1004de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and J uses I, then Users is updated to contain J and WriteSet is updated 1005de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to contain any memory locations to which J writes. The function returns 1006de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if J uses I. By default, alias analysis is used to determine 1007de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // whether J reads from memory that overlaps with a location in WriteSet. 1008de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If LoadMoveSet is not null, then it is a previously-computed multimap 1009de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // where the key is the memory-based user instruction and the value is 1010de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the instruction to be compared with I. So, if LoadMoveSet is provided, 1011de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then the alias analysis is not used. This is necessary because this 1012de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // function is called during the process of moving instructions during 1013de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectorization and the results of the alias analysis are not stable during 1014de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that process. 1015de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, 1016de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 1017de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers, 1018de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet) { 1019de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = false; 1020de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1021de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This instruction may already be marked as a user due, for example, to 1022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // being a member of a selected pair. 1023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (Users.count(J)) 1024de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1025de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1026de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI) 10277e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel for (User::op_iterator JU = J->op_begin(), JE = J->op_end(); 10287e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel JU != JE; ++JU) { 1029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *V = *JU; 1030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I == V || Users.count(V)) { 1031de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI && J->mayReadFromMemory()) { 1036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LoadMoveSet) { 1037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); 1038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = isSecondInIteratorPair<Value*>(I, JPairRange); 1039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSetTracker::iterator W = WriteSet.begin(), 1041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel WE = WriteSet.end(); W != WE; ++W) { 104238a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel if (W->aliasesUnknownInst(J, *AA)) { 104338a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel UsesI = true; 104438a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel break; 1045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1046de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1049de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1050de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI && UpdateUsers) { 1051de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (J->mayWriteToMemory()) WriteSet.add(J); 1052de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Users.insert(J); 1053de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1054de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return UsesI; 1056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function iterates over all instruction pairs in the provided 1059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block and collects all candidate pairs for vectorization. 10605d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool BBVectorize::getCandidatePairs(BasicBlock &BB, 10615d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 1062de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1063a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 106465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 106564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len) { 1066de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 10675d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (Start == E) return false; 10685d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 10695d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue = false, IAfterStart = false; 10705d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel for (BasicBlock::iterator I = Start++; I != E; ++I) { 10715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (I == Start) IAfterStart = true; 10725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1073de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore; 1074de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isInstVectorizable(I, IsSimpleLoadStore)) continue; 1075de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1076de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for an instruction with which to pair instruction *I... 1077de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1078de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 10795d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool JAfterStart = IAfterStart; 10805d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator J = llvm::next(I); 1081bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng for (unsigned ss = 0; J != E && ss <= Config.SearchLimit; ++J, ++ss) { 10825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (J == Start) JAfterStart = true; 10835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1084de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Determine if J uses I, if so, exit the loop. 1085bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep); 1086bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.FastDep) { 1087de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: For this heuristic to be effective, independent operations 1088de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // must tend to be intermixed. This is likely to be true from some 1089de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // kinds of grouped loop unrolling (but not the generic LLVM pass), 1090de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but otherwise may require some kind of reordering pass. 1091de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1092de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // When using fast dependency analysis, 1093de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // stop searching after first use: 1094de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 1095de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1096de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) continue; 1097de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1098de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1099de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J does not use I, and comes before the first use of I, so it can be 1100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // merged with I if the instructions are compatible. 1101a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int CostSavings, FixedOrder; 110265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!areInstsCompatible(I, J, IsSimpleLoadStore, NonPow2Len, 1103a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel CostSavings, FixedOrder)) continue; 1104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J is a candidate for merging with I. 1106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!PairableInsts.size() || 1107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts[PairableInsts.size()-1] != I) { 1108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts.push_back(I); 1109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 11105d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.insert(ValuePair(I, J)); 111265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) 111365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings.insert(ValuePairWithCost(ValuePair(I, J), 111465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings)); 11155d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1116a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrder == 1) 1117a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(I, J)); 1118a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrder == -1) 1119a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(J, I)); 1120a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 11215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // The next call to this function must start after the last instruction 11225d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // selected during this invocation. 11235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (JAfterStart) { 11245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel Start = llvm::next(J); 11255d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel IAfterStart = JAfterStart = false; 11265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 11275d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1128de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCandidateSelection) dbgs() << "BBV: candidate pair " 112965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel << *I << " <-> " << *J << " (cost savings: " << 113065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings << ")\n"); 11315d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11325d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // If we have already found too many pairs, break here and this function 11335d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // will be called again starting after the last instruction selected 11345d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // during this invocation. 1135bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (PairableInsts.size() >= Config.MaxInsts) { 11365d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = true; 11375d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 11385d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 1139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 11405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11415d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ShouldContinue) 11425d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 1143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << PairableInsts.size() 1146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " instructions with candidate pairs\n"); 11475d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11485d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel return ShouldContinue; 1149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Finds candidate pairs connected to the pair P = <PI, PJ>. This means that 1152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // it looks for pairs such that both members have an input which is an 1153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // output of PI or PJ. 1154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computePairsConnectedTo( 1155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 115872465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P) { 1160bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel StoreInst *SI, *SJ; 1161bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each possible pairing for this variable, look at the uses of 1163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the first value... 1164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.first->use_begin(), 1165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.first->use_end(); I != E; ++I) { 1166bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) { 1167bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // A pair cannot be connected to a load because the load only takes one 1168bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // operand (the address) and it is a scalar even after vectorization. 1169bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1170bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } else if ((SI = dyn_cast<StoreInst>(*I)) && 1171bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SI->getPointerOperand()) { 1172bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // Similarly, a pair cannot be connected to a store through its 1173bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // pointer operand. 1174bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1175bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } 1176bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each use of the first variable, look for uses of the second 1180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // variable... 1181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(), 1182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = P.second->use_end(); J != E2; ++J) { 1183bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1184bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1185bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1186bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); 1188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <I, J>: 119072465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 119172465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 119272465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 119372465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionDirect)); 119472465ea23d010507d3746adc126d719005981e05Hal Finkel } 1195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <J, I>: 119772465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*I, JPairRange)) { 119872465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*J, *I)); 119972465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 120072465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSwap)); 120172465ea23d010507d3746adc126d719005981e05Hal Finkel } 1202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1204bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) continue; 1205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the first value in the pair is used by 1206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.first->use_begin(); J != E; ++J) { 1208bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1209bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SJ->getPointerOperand()) 1210bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1211bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 121272465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 121372465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 121472465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 121572465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 121672465ea23d010507d3746adc126d719005981e05Hal Finkel } 1217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1220bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) return; 1221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the second value in the pair is used by 1222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.second->use_begin(), 1224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.second->use_end(); I != E; ++I) { 1225bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) 1226bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1227bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel else if ((SI = dyn_cast<StoreInst>(*I)) && 1228bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SI->getPointerOperand()) 1229bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1230bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1231de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1232de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1233de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(); J != E; ++J) { 1234bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1235bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1236bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1237bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 123872465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 123972465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 124072465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 124172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 124272465ea23d010507d3746adc126d719005981e05Hal Finkel } 1243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function figures out which pairs are connected. Two pairs are 1248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // connected if some output of the first pair forms an input to both members 1249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of the second pair. 1250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computeConnectedPairs( 1251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 125372465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 125472465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes) { 1255de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 1257de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PE = PairableInsts.end(); PI != PE; ++PI) { 1258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); 1259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1260de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator P = choiceRange.first; 1261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel P != choiceRange.second; ++P) 1262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel computePairsConnectedTo(CandidatePairs, PairableInsts, 126372465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs, PairConnectionTypes, *P); 1264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1266de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << ConnectedPairs.size() 1267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " pair connections.\n"); 1268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds a set of use tuples such that <A, B> is in the set 1271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // if B is in the use tree of A. If B is in the use tree of A, then B 1272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depends on the output of A. 1273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildDepMap( 1274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB, 1275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers) { 1278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> IsInPair; 1279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator C = CandidatePairs.begin(), 1280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = CandidatePairs.end(); C != E; ++C) { 1281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->first); 1282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->second); 1283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate through the basic block, recording all Users of each 1286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairable instruction. 1287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 1289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator I = BB.getFirstInsertionPt(); I != E; ++I) { 1290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsInPair.find(I) == IsInPair.end()) continue; 1291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator J = llvm::next(I); J != E; ++J) 1295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, J); 1296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end(); 1298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel U != E; ++U) 1299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.insert(ValuePair(I, *U)); 1300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if an input to pair P is an output of pair Q and also an 1304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // input of pair Q is an output of pair P. If this is the case, then these 1305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // two pairs cannot be simultaneously fused. 1306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairsConflict(ValuePair P, ValuePair Q, 1307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap) { 1309de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Two pairs are in conflict if they are mutual Users of eachother. 1310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool QUsesP = PairableInstUsers.count(ValuePair(P.first, Q.first)) || 1311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.first, Q.second)) || 1312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.first)) || 1313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.second)); 1314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool PUsesQ = PairableInstUsers.count(ValuePair(Q.first, P.first)) || 1315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.first, P.second)) || 1316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.first)) || 1317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.second)); 1318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PairableInstUserMap) { 1319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: The expensive part of the cycle check is not so much the cycle 1320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // check itself but this edge insertion procedure. This needs some 1321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // profiling and probably a different data structure (same is true of 1322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // most uses of std::multimap). 1323de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PUsesQ) { 1324de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap->equal_range(Q); 1325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(P, QPairRange)) 1326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(Q, P)); 1327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (QUsesP) { 1329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair PPairRange = PairableInstUserMap->equal_range(P); 1330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(Q, PPairRange)) 1331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(P, Q)); 1332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (QUsesP && PUsesQ); 1336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function walks the use graph of current pairs to see if, starting 1339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // from P, the walk returns to P. 1340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairWillFormCycle(ValuePair P, 1341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs) { 1343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: starting cycle check for : " << *P.first << " <-> " 1345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *P.second << "\n"); 1346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A lookup table of visisted pairs is kept because the PairableInstUserMap 1347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contains non-direct associations. 1348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> Visited; 134935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePair, 32> Q; 1350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(P); 135235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 135335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePair QTop = Q.pop_back_val(); 1354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Visited.insert(QTop); 1355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: cycle check visiting: " << *QTop.first << " <-> " 1358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *QTop.second << "\n"); 1359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); 1360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator C = QPairRange.first; 1361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != QPairRange.second; ++C) { 1362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C->second == P) { 1363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() 1364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << "BBV: rejected to prevent non-trivial cycle formation: " 1365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *C->first.first << " <-> " << *C->first.second << "\n"); 1366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 13690b2500c504156c45cd71817a9ef6749b6cde5703David Blaikie if (CurrentPairs.count(C->second) && !Visited.count(C->second)) 1370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(C->second); 1371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 137235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds the initial tree of connected pairs with the 1378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair J at the root. 1379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildInitialTreeFor( 1380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J) { 1386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Each of these pairs is viewed as the root node of a Tree. The Tree 1387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is then walked (depth-first). As this happens, we keep track of 1388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pairs that compose the Tree and the maximum depth of the Tree. 138935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 139235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 1393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePairWithDepth QTop = Q.back(); 1394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Push each child onto the queue: 1396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool MoreChildren = false; 1397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxChildDepth = QTop.second; 1398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); 1399478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator k = qtRange.first; 1400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel k != qtRange.second; ++k) { 1401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make sure that this child pair is still a candidate: 1402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsStillCand = false; 1403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair checkRange = 1404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.equal_range(k->second.first); 1405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator m = checkRange.first; 1406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel m != checkRange.second; ++m) { 1407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m->second == k->second.second) { 1408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsStillCand = true; 1409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsStillCand) { 1414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(k->second); 1415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) { 1416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t d = getDepthFactor(k->second.first); 1417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(k->second, QTop.second+d)); 1418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MoreChildren = true; 1419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxChildDepth = std::max(MaxChildDepth, C->second); 1421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!MoreChildren) { 1426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Record the current pair as part of the Tree: 1427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Tree.insert(ValuePairWithDepth(QTop.first, MaxChildDepth)); 1428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.pop_back(); 1429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 143035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given some initial tree, prune it by removing conflicting pairs (pairs 1434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that cannot be simultaneously chosen for vectorization). 1435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::pruneTreeFor( 1436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 1443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 1444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 144535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1446de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1447de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 144835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 144935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePairWithDepth QTop = Q.pop_back_val(); 1450de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree.insert(QTop.first); 1451de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Visit each child, pruning as necessary... 145343ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop DenseMap<ValuePair, size_t> BestChildren; 1454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QTopRange = ConnectedPairs.equal_range(QTop.first); 1455478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator K = QTopRange.first; 1456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != QTopRange.second; ++K) { 1457de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(K->second); 1458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) continue; 1459de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child is in the Tree, now we need to make sure it is the 1461de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // best of any conflicting children. There could be multiple 1462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflicting children, so first, determine if we're keeping 1463de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // this child, then delete conflicting children as necessary. 1464de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1465de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // It is also necessary to guard against pairing-induced 1466de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // dependencies. Consider instructions a .. x .. y .. b 1467de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // such that (a,b) are to be fused and (x,y) are to be fused 1468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but a is an input to x and b is an output from y. This 1469de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // means that y cannot be moved after b but x must be moved 1470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after b for (a,b) to be fused. In other words, after 1471de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fusing (a,b) we have y .. a/b .. x where y is an input 1472de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to a/b and x is an output to a/b: x and y can no longer 1473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be legally fused. To prevent this condition, we must 1474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // make sure that a child pair added to the Tree is not 1475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both an input and output of an already-selected pair. 1476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Pairing-induced dependencies can also form from more complicated 1478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // cycles. The pair vs. pair conflicts are easy to check, and so 1479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that is done explicitly for "fast rejection", and because for 1480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // child vs. child conflicts, we may prefer to keep the current 1481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in preference to the already-selected child. 1482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> CurrentPairs; 1483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool CanAdd = true; 1485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 148643ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->second >= C->second) { 1495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Even worse, this child could conflict with another node already 1505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // selected for the Tree. If that is the case, ignore this child. 1506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator T = PrunedTree.begin(), 1507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = PrunedTree.end(); T != E2; ++T) { 1508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T->first == C->first.first || 1509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->first == C->first.second || 1510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.first || 1511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.second || 1512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(*T, C->first, PairableInstUsers, 1513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*T); 1519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // And check the queue too... 152335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel for (SmallVector<ValuePairWithDepth, 32>::iterator C2 = Q.begin(), 1524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = Q.end(); C2 != E2; ++C2) { 1525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Last but not least, check for a conflict with any of the 1540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // already-chosen pairs. 1541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C2 = 1542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.begin(), E2 = ChosenPairs.end(); 1543de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1544de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C2, C->first, PairableInstUsers, 1545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1546de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1547de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1548de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*C2); 1551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1552de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1553de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 15541230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // To check for non-trivial cycles formed by the addition of the 15551230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // current pair we've formed a list of all relevant pairs, now use a 15561230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // graph walk to check for a cycle. We start from the current pair and 15571230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // walk the use tree to see if we again reach the current pair. If we 15581230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // do, then the current pair is rejected. 1559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: It may be more efficient to use a topological-ordering 1561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // algorithm to improve the cycle check. This should be investigated. 1562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1563de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(C->first, PairableInstUserMap, CurrentPairs)) 1564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child can be added, but we may have chosen it in preference 1567de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to an already-selected child. Check for this here, and if a 1568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict is found, then remove the previously-selected child 1569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // before adding this one in its place. 1570de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 157143ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(); C2 != BestChildren.end();) { 1572de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1573de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers)) 157743ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop BestChildren.erase(C2++); 1578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++C2; 1580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 158243ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop BestChildren.insert(ValuePairWithDepth(C->first, C->second)); 1583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1584de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C 158643ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != E2; ++C) { 1588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t DepthF = getDepthFactor(C->first.first); 1589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(C->first, QTop.second+DepthF)); 1590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 159135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function finds the best tree of mututally-compatible connected 1595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairs, given the choice of root pairs as an iterator range. 1596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::findBestTreeFor( 1597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 159865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 1599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 160565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 1606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 1607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator J = ChoiceRange.first; 1608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J != ChoiceRange.second; ++J) { 1609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before going any further, make sure that this pair does not 1611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict with any already-selected pairs (see comment below 1612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // near the Tree pruning for more details). 1613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> ChosenPairSet; 1614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool DoesConflict = false; 1615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C = ChosenPairs.begin(), 1616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); C != E; ++C) { 1617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C, *J, PairableInstUsers, 1618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DoesConflict = true; 1620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairSet.insert(*C); 1624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (DoesConflict) continue; 1626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(*J, PairableInstUserMap, ChosenPairSet)) 1629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> Tree; 1632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel buildInitialTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, ChosenPairs, Tree, *J); 1634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Because we'll keep the child with the largest depth, the largest 1636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depth is still the same in the unpruned Tree. 1637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxDepth = Tree.lookup(*J); 1638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "BBV: found Tree for pair {" 1640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << Tree.size() << "\n"); 1642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // At this point the Tree has been constructed, but, may contain 1644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contradictory children (meaning that different children of 1645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some tree node may be attempting to fuse the same instruction). 1646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // So now we walk the tree again, in the case of a conflict, 1647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // keep only the child with the largest depth. To break a tie, 1648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // favor the first child. 1649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> PrunedTree; 1651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pruneTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, Tree, 1653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree, *J, UseCycleCheck); 1654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 165565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int EffSize = 0; 165665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) { 165765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 165865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) { 165965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (getDepthFactor(S->first)) 166065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize += CandidatePairCostSavings.find(*S)->second; 166165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 166265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 166365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 166465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) 166565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize += (int) getDepthFactor(S->first); 166665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 1667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) 1669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: found pruned Tree for pair {" 1670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << PrunedTree.size() << 1672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " (effective size: " << EffSize << ")\n"); 167365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (MaxDepth >= Config.ReqChainDepth && 167465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize > 0 && EffSize > BestEffSize) { 1675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestMaxDepth = MaxDepth; 1676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestEffSize = EffSize; 1677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree = PrunedTree; 1678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1680de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given the list of candidate pairs, this function selects those 1683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that will be fused into vector instructions. 1684de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::choosePairs( 1685de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 168665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 1687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1688de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1689de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1690de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs) { 1691bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UseCycleCheck = 1692bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng CandidatePairs.size() <= Config.MaxCandPairsForCycleCheck; 1693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> PairableInstUserMap; 1694de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator I = PairableInsts.begin(), 1695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PairableInsts.end(); I != E; ++I) { 1696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The number of possible pairings for this variable: 1697de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t NumChoices = CandidatePairs.count(*I); 1698de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!NumChoices) continue; 1699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair ChoiceRange = CandidatePairs.equal_range(*I); 1701de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1702de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The best pair to choose and its tree: 170365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel size_t BestMaxDepth = 0; 170465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int BestEffSize = 0; 1705de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> BestTree; 170665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel findBestTreeFor(CandidatePairs, CandidatePairCostSavings, 170765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel PairableInsts, ConnectedPairs, 1708de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, 1709de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree, BestMaxDepth, BestEffSize, ChoiceRange, 1710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck); 1711de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1712de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A tree has been chosen (or not) at this point. If no tree was 1713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chosen, then this instruction, I, cannot be paired (and is no longer 1714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // considered). 1715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (BestTree.size() > 0) 1717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: selected pairs in the best tree for: " 1718de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *cast<Instruction>(*I) << "\n"); 1719de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1720de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator S = BestTree.begin(), 1721de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE2 = BestTree.end(); S != SE2; ++S) { 1722de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Insert the members of this tree into the list of chosen pairs. 1723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(ValuePair(S->first, S->second)); 1724de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected pair: " << *S->first << " <-> " << 1725de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *S->second << "\n"); 1726de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1727de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove all candidate pairs that have values in the chosen tree. 1728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator K = 1729de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.begin(); K != CandidatePairs.end();) { 1730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->first == S->first || K->second == S->first || 1731de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->second == S->second || K->first == S->second) { 1732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Don't remove the actual pair chosen so that it can be used 1733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in subsequent tree selections. 1734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(K->first == S->first && K->second == S->second)) 1735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.erase(K++); 1736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected " << ChosenPairs.size() << " pairs.\n"); 1746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::string getReplacementName(Instruction *I, bool IsInput, unsigned o, 1749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned n = 0) { 1750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!I->hasName()) 1751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ""; 1752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (I->getName() + (IsInput ? ".v.i" : ".v.r") + utostr(o) + 1754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (n > 0 ? "." + utostr(n) : "")).str(); 1755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the pointer input to the vector 1758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 1759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementPointerInput(LLVMContext& Context, 1760202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *I, Instruction *J, unsigned o) { 1761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 176265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 1763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts; 1764282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 1765202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel // Note: the analysis might fail here, that is why the pair order has 1766282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel // been precomputed (OffsetInElmts must be unused here). 1767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 176865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 176993f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel OffsetInElmts, false); 1770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The pointer value is taken to be the one with the lowest offset. 1772202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Value *VPtr = IPtr; 1773de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 177464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = cast<PointerType>(IPtr->getType())->getElementType(); 177564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = cast<PointerType>(JPtr->getType())->getElementType(); 177664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 1777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgPtrType = PointerType::get(VArgType, 1778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<PointerType>(IPtr->getType())->getAddressSpace()); 1779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BitCastInst(VPtr, VArgPtrType, getReplacementName(I, true, o), 1780202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel /* insert before */ I); 1781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fillNewShuffleMask(LLVMContext& Context, Instruction *J, 178464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 178564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 178664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask) { 178764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElem1 = cast<VectorType>(J->getType())->getNumElements(); 178864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < NumElem1; ++v) { 1789de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int m = cast<ShuffleVectorInst>(J)->getMaskValue(v); 1790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m < 0) { 1791de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = UndefValue::get(Type::getInt32Ty(Context)); 1792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned mm = m + (int) IdxOffset; 179464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (m >= (int) NumInElem1) 1795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel mm += (int) NumInElem; 1796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = 1798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt::get(Type::getInt32Ty(Context), mm); 1799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the vector-shuffle mask to the 1804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector instruction that fuses I with J. 1805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementShuffleMask(LLVMContext& Context, 1806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 1807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the shuffle mask. We need to append the second 1808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // mask to the first, and the numbers need to be adjusted. 1809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 181064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 181164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 181264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 181364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 181464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElemI = cast<VectorType>(ArgTypeI)->getNumElements(); 1815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Get the total number of elements in the fused vector type. 1817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // By definition, this must equal the number of elements in 1818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the final mask. 1819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem = cast<VectorType>(VArgType)->getNumElements(); 1820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(NumElem); 1821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 182264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeI = I->getOperand(0)->getType(); 182364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemI = cast<VectorType>(OpTypeI)->getNumElements(); 182464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeJ = J->getOperand(0)->getType(); 182564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemJ = cast<VectorType>(OpTypeJ)->getNumElements(); 182664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 182764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The fused vector will be: 182864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 182964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // | NumInElemI | NumInElemJ | NumInElemI | NumInElemJ | 183064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 183164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // from which we'll extract NumElem total elements (where the first NumElemI 183264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // of them come from the mask in I and the remainder come from the mask 183364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // in J. 1834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the first pair... 183664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, I, 0, NumInElemJ, NumInElemI, 183764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 0, Mask); 1838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the second pair... 184064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, J, NumElemI, NumInElemI, NumInElemJ, 184164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NumInElemI, Mask); 1842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1843de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ConstantVector::get(Mask); 1844de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1845de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 184664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::expandIEChain(LLVMContext& Context, Instruction *I, 184764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *J, unsigned o, Value *&LOp, 184864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL, 184964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL, Type *ArgTypeH, 185072465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ, unsigned IdxOff) { 185164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ExpandedIEChain = false; 185264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (InsertElementInst *LIE = dyn_cast<InsertElementInst>(LOp)) { 185364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If we have a pure insertelement chain, then this can be rewritten 185464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // into a chain that directly builds the larger type. 185564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool PureChain = true; 185664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 185764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 185864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(LIENext->getOperand(0)) && 185964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel !isa<InsertElementInst>(LIENext->getOperand(0))) { 186064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PureChain = false; 186164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 186264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 186364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 186464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 186564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 186664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (PureChain) { 186764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<Value *, 8> VectElemts(numElemL, 186864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(ArgTypeL->getScalarType())); 186964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 187064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 187164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = 187264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LIENext->getOperand(2))->getSExtValue(); 187364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectElemts[Idx] = LIENext->getOperand(1); 187464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 187564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 187664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 187764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = 0; 187864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LIEPrev = UndefValue::get(ArgTypeH); 187964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 188064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<UndefValue>(VectElemts[i])) continue; 188164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = InsertElementInst::Create(LIEPrev, VectElemts[i], 188264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 188364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel i + IdxOff), 188472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 188572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, i+1)); 188672465ea23d010507d3746adc126d719005981e05Hal Finkel LIENext->insertBefore(IBeforeJ ? J : I); 188764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIEPrev = LIENext; 188864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 188964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 189064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = LIENext ? (Value*) LIENext : UndefValue::get(ArgTypeH); 189164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExpandedIEChain = true; 189264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 189364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 189464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 189564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return ExpandedIEChain; 189664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 189764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 1898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value to be used as the specified operand of the vector 1899de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 1900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementInput(LLVMContext& Context, Instruction *I, 190172465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ) { 1902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 1903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 1904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 190564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Compute the fused vector type for this operand 190664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getOperand(o)->getType(); 190764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getOperand(o)->getType(); 190864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 1909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *L = I, *H = J; 191164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL = ArgTypeI, *ArgTypeH = ArgTypeJ; 1912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 191364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL; 191464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeL->isVectorTy()) 191564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = cast<VectorType>(ArgTypeL)->getNumElements(); 191664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 191764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = 1; 1918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 191964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemH; 192064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeH->isVectorTy()) 192164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = cast<VectorType>(ArgTypeH)->getNumElements(); 192264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 192364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = 1; 192464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 192564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LOp = L->getOperand(o); 192664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *HOp = H->getOperand(o); 192764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VArgType->getNumElements(); 192864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 192964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // First, we check if we can reuse the "original" vector outputs (if these 193064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // exist). We might need a shuffle. 193164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *LEE = dyn_cast<ExtractElementInst>(LOp); 193264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *HEE = dyn_cast<ExtractElementInst>(HOp); 193364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *LSV = dyn_cast<ShuffleVectorInst>(LOp); 193464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *HSV = dyn_cast<ShuffleVectorInst>(HOp); 193564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 193664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // FIXME: If we're fusing shuffle instructions, then we can't apply this 193764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // optimization. The input vectors to the shuffle might be a different 193864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // length from the shuffle outputs. Unfortunately, the replacement 193964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // shuffle mask has already been formed, and the mask entries are sensitive 194064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // to the sizes of the inputs. 194164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool IsSizeChangeShuffle = 194264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel isa<ShuffleVectorInst>(L) && 194364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (LOp->getType() != L->getType() || HOp->getType() != H->getType()); 194464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 194564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if ((LEE || LSV) && (HEE || HSV) && !IsSizeChangeShuffle) { 194664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We can have at most two unique vector inputs. 194764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool CanUseInputs = true; 194864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I1, *I2 = 0; 194964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 195064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LEE->getOperand(0); 195164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 195264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LSV->getOperand(0); 195364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = LSV->getOperand(1); 195464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I2 == I1 || isa<UndefValue>(I2)) 195564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = 0; 195664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 195764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 195864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 195964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HEE->getOperand(0); 196064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 196164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 196264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 196364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 196464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 196564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HSV->getOperand(0); 196664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 196764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 196864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 196964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 197064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 197164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 197264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I4 = HSV->getOperand(1); 197364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(I4)) { 197464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I4 != I1) 197564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I4; 197664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I4 != I1 && I4 != I2) 197764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 197864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 197964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 198064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 198164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 198264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 198364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned LOpElem = 198464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(LOp)->getOperand(0)->getType()) 198564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 198664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned HOpElem = 198764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(HOp)->getOperand(0)->getType()) 198864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 198964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 199064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We have one or two input vectors. We need to map each index of the 199164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // operands to the index of the original vector. 199264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<std::pair<int, int>, 8> II(numElem); 199364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 199464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 199564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 199664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 199764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LEE->getOperand(1))->getSExtValue(); 199864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LEE->getOperand(0) == I1 ? 0 : 1; 199964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 200064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = LSV->getMaskValue(i); 200164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) LOpElem) { 200264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(0) == I1 ? 0 : 1; 200364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 200464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= LOpElem; 200564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(1) == I1 ? 0 : 1; 200664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 200764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 200864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 200964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i] = std::pair<int, int>(Idx, INum); 201064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 201164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemH; ++i) { 201264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 201364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 201464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 201564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(HEE->getOperand(1))->getSExtValue(); 201664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HEE->getOperand(0) == I1 ? 0 : 1; 201764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 201864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = HSV->getMaskValue(i); 201964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) HOpElem) { 202064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(0) == I1 ? 0 : 1; 202164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 202264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= HOpElem; 202364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(1) == I1 ? 0 : 1; 202464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 202564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 202664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 202764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i + numElemL] = std::pair<int, int>(Idx, INum); 202864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 202964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 203064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We now have an array which tells us from which index of which 203164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // input vector each element of the operand comes. 203264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I1T = cast<VectorType>(I1->getType()); 203364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I1Elem = I1T->getNumElements(); 203464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 203564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2) { 203664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // In this case there is only one underlying vector input. Check for 203764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // the trivial case where we can use the input directly. 203864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem == numElem) { 203964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ElemInOrder = true; 204064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 204164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[i].first != (int) i && II[i].first != -1) { 204264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ElemInOrder = false; 204364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 204464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 204564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 204664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 204764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ElemInOrder) 204864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return I1; 204964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 205064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 205164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // A shuffle is needed. 205264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 205364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 205464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[i].first; 205564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx == -1) 205664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = UndefValue::get(Type::getInt32Ty(Context)); 205764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 205864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 205964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 206064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 206164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 206264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 206364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 206472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 206572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 206672465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 206764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 206864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 206964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 207064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I2T = cast<VectorType>(I2->getType()); 207164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I2Elem = I2T->getNumElements(); 207264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 207364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This input comes from two distinct vectors. The first step is to 207464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // make sure that both vectors are the same length. If not, the 207564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // smaller one will need to grow before they can be shuffled together. 207664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem < I2Elem) { 207764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I2Elem); 207864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 207964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 208064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 208164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 208264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 208364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 208464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI1 = 208564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 208664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 208772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 208872465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 208972465ea23d010507d3746adc126d719005981e05Hal Finkel NewI1->insertBefore(IBeforeJ ? J : I); 209064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = NewI1; 209164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1T = I2T; 209264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1Elem = I2Elem; 209364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (I1Elem > I2Elem) { 209464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I1Elem); 209564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 209664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 209764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 209864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 209964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 210064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 210164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI2 = 210264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I2, UndefValue::get(I2T), 210364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 210472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 210572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 210672465ea23d010507d3746adc126d719005981e05Hal Finkel NewI2->insertBefore(IBeforeJ ? J : I); 210764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = NewI2; 210864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2T = I1T; 210964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2Elem = I1Elem; 211064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 211164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 211264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Now that both I1 and I2 are the same length we can shuffle them 211364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // together (and use the result). 211464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 211564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 211664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[v].first == -1) { 211764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 211864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 211964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[v].first + II[v].second * I1Elem; 212064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 212164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 212264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 212364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 212464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewOp = 212564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, I2, ConstantVector::get(Mask), 212672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 212772465ea23d010507d3746adc126d719005981e05Hal Finkel NewOp->insertBefore(IBeforeJ ? J : I); 212864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return NewOp; 212964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 213264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgType = ArgTypeL; 213364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL < numElemH) { 213464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL == 1 && expandIEChain(Context, I, J, o, HOp, numElemH, 213572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, VArgType, IBeforeJ, 1)) { 213664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This is another short-circuit case: we're combining a scalar into 213764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // a vector that is formed by an IE chain. We've just expanded the IE 213864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // chain, now insert the scalar and we're done. 213964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 214064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = InsertElementInst::Create(HOp, LOp, CV0, 214172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 214272465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 214364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 214464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, LOp, numElemL, ArgTypeL, 214572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, IBeforeJ)) { 214664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The two vector inputs to the shuffle must be the same length, 214764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // so extend the smaller vector to be the same length as the larger one. 214864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NLOp; 214964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL > 1) { 215064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 215164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemH); 215264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 215364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 215464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 215564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 215664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 215764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 215864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = new ShuffleVectorInst(LOp, UndefValue::get(ArgTypeL), 215964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 216072465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 216172465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 216264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 216364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = InsertElementInst::Create(UndefValue::get(ArgTypeH), LOp, CV0, 216472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 216572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 216664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 216764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 216872465ea23d010507d3746adc126d719005981e05Hal Finkel NLOp->insertBefore(IBeforeJ ? J : I); 216964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = NLOp; 217064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 217164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 217264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ArgType = ArgTypeH; 217364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (numElemL > numElemH) { 217464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH == 1 && expandIEChain(Context, I, J, o, LOp, numElemL, 217572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, VArgType, IBeforeJ)) { 217664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 217764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst::Create(LOp, HOp, 217864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 217964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL), 218072465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 218172465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 218272465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 218364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 218464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, HOp, numElemH, ArgTypeH, 218572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, IBeforeJ)) { 218664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NHOp; 218764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH > 1) { 218864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemL); 218964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 219064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 219164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 219264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 219364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 219464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 219564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = new ShuffleVectorInst(HOp, UndefValue::get(ArgTypeH), 219664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 219772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 219872465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 219964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 220064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = InsertElementInst::Create(UndefValue::get(ArgTypeL), HOp, CV0, 220172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 220272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 220364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 220464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 220572465ea23d010507d3746adc126d719005981e05Hal Finkel NHOp->insertBefore(IBeforeJ ? J : I); 220664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel HOp = NHOp; 2207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 220864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 221064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgType->isVectorTy()) { 221164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = cast<VectorType>(VArgType)->getNumElements(); 221264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask(numElem); 221364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 221464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = v; 221564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If the low vector was expanded, we need to skip the extra 221664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // undefined entries. 221764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (v >= numElemL && numElemH > numElemL) 221864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx += (numElemH - numElemL); 221964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 222064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 222264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV = new ShuffleVectorInst(LOp, HOp, 222372465ea23d010507d3746adc126d719005981e05Hal Finkel ConstantVector::get(Mask), 222472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 222572465ea23d010507d3746adc126d719005981e05Hal Finkel BV->insertBefore(IBeforeJ ? J : I); 2226de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 2227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2228de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV1 = InsertElementInst::Create( 223064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(VArgType), LOp, CV0, 223172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 223272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 223372465ea23d010507d3746adc126d719005981e05Hal Finkel BV1->insertBefore(IBeforeJ ? J : I); 223464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV2 = InsertElementInst::Create(BV1, HOp, CV1, 223572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 223672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 2)); 223772465ea23d010507d3746adc126d719005981e05Hal Finkel BV2->insertBefore(IBeforeJ ? J : I); 2238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV2; 2239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates an array of values that will be used as the inputs 2242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to the vector instruction that fuses I with J. 2243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::getReplacementInputsForPair(LLVMContext& Context, 2244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, 224572465ea23d010507d3746adc126d719005981e05Hal Finkel SmallVector<Value *, 3> &ReplacedOperands, 224672465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ) { 2247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned p = 0, o = NumOperands-1; p < NumOperands; ++p, --o) { 2250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate backward so that we look at the store pointer 2251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first and know whether or not we need to flip the inputs. 2252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I) || (o == 1 && isa<StoreInst>(I))) { 2254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the pointer for a load/store instruction. 2255202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ReplacedOperands[o] = getReplacementPointerInput(Context, I, J, o); 2256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 22576173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (isa<CallInst>(I)) { 2258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = cast<CallInst>(I)->getCalledFunction(); 2259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 22606173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (o == NumOperands-1) { 22616173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel BasicBlock &BB = *I->getParent(); 2262bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 22636173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Module *M = BB.getParent()->getParent(); 226464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 226564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 226664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2267bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 22686173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = Intrinsic::getDeclaration(M, 22696173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel (Intrinsic::ID) IID, VArgType); 22706173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 22716173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (IID == Intrinsic::powi && o == 1) { 22726173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The second argument of powi is a single integer and we've already 22736173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // checked that both arguments are equal. As a result, we just keep 22746173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // I's second argument. 22756173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = I->getOperand(o); 22766173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 22776173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 2278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I) && o == NumOperands-1) { 2279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementShuffleMask(Context, I, J); 2280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 228372465ea23d010507d3746adc126d719005981e05Hal Finkel ReplacedOperands[o] = getReplacementInput(Context, I, J, o, IBeforeJ); 2284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates two values that represent the outputs of the 2288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // original I and J instructions. These are generally vector shuffles 2289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // or extracts. In many cases, these will end up being unused and, thus, 2290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // eliminated by later passes. 2291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 2292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 2293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2294202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K1, Instruction *&K2) { 2295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 2296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K); 2297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K); 2298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *IType = I->getType(); 230064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *JType = J->getType(); 230164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 230264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VType = getVecTypeForPair(IType, JType); 230364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VType->getNumElements(); 230464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 230564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemI, numElemJ; 230664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (IType->isVectorTy()) 230764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = cast<VectorType>(IType)->getNumElements(); 230864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 230964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = 1; 231064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 231164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) 231264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = cast<VectorType>(JType)->getNumElements(); 231364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 231464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = 1; 2315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IType->isVectorTy()) { 231764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemI), Mask2(numElemI); 231864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemI; ++v) { 231964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 232064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemJ+v); 232164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 232364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K1 = new ShuffleVectorInst(K, UndefValue::get(VType), 2324202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask1), 232564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 1)); 2326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 232764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2328202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K1 = ExtractElementInst::Create(K, CV0, 2329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 233064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 233164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 233264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) { 233364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemJ), Mask2(numElemJ); 233464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemJ; ++v) { 233564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 233664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemI+v); 233764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 233864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 233964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K2 = new ShuffleVectorInst(K, UndefValue::get(VType), 2340202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask2), 234164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 2)); 234264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 234364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), numElem-1); 2344202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K2 = ExtractElementInst::Create(K, CV1, 2345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 2346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1->insertAfter(K); 2349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2->insertAfter(K1); 2350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = K2; 2351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::canMoveUsesOfIAfterJ(BasicBlock &BB, 2356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2359ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J; ++L) 2364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet); 2365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(cast<Instruction>(L) == J && 2367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel "Tracking has not proceeded far enough to check for dependencies"); 2368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If J is now in the use set of I, then trackUsesOfI will return true 2369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and we have a dependency cycle (and the fusing operation must abort). 2370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSet); 2371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::moveUsesOfIAfterJ(BasicBlock &BB, 2375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2379ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J;) { 2384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet)) { 2385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move this instruction 2386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InstToMove = L; ++L; 2387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: moving: " << *InstToMove << 2389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " to after " << *InsertionPt << "\n"); 2390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->removeFromParent(); 2391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->insertAfter(InsertionPt); 2392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = InstToMove; 2393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++L; 2395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Collect all load instruction that are in the move set of a given first 2400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair member. These loads depend on the first instruction, I, and so need 2401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to be moved after J (the second instruction) when the pair is fused. 2402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectPairLoadMoveSet(BasicBlock &BB, 2403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I) { 2406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2407ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: We cannot end the loop when we reach J because J could be moved 2413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // farther down the use chain by another instruction pairing. Also, J 2414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be before I if this is an inverted input. 2415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator E = BB.end(); cast<Instruction>(L) != E; ++L) { 2416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L)) { 2417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (L->mayReadFromMemory()) 2418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(ValuePair(L, I)); 2419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // In cases where both load/stores and the computation of their pointers 2424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // are chosen for vectorization, we can end up in a situation where the 2425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // aliasing analysis starts returning different query results as the 2426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // process of fusing instruction pairs continues. Because the algorithm 2427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // relies on finding the same use trees here as were found earlier, we'll 2428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to precompute the necessary aliasing information here and then 2429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // manually update it during the fusion process. 2430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectLoadMoveSet(BasicBlock &BB, 2431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet) { 2434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 2435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PIE = PairableInsts.end(); PI != PIE; ++PI) { 2436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(*PI); 2437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) continue; 2438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first); 2440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectPairLoadMoveSet(BB, ChosenPairs, LoadMoveSet, I); 2441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2444ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // When the first instruction in each pair is cloned, it will inherit its 2445ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // parent's metadata. This metadata must be combined with that of the other 2446ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // instruction in a safe way. 2447ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void BBVectorize::combineMetadata(Instruction *K, const Instruction *J) { 2448ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel SmallVector<std::pair<unsigned, MDNode*>, 4> Metadata; 2449ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->getAllMetadataOtherThanDebugLoc(Metadata); 2450ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel for (unsigned i = 0, n = Metadata.size(); i < n; ++i) { 2451ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel unsigned Kind = Metadata[i].first; 2452ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *JMD = J->getMetadata(Kind); 2453ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *KMD = Metadata[i].second; 2454ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2455ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel switch (Kind) { 2456ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel default: 2457ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, 0); // Remove unknown metadata 2458ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2459ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_tbaa: 2460ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericTBAA(JMD, KMD)); 2461ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2462ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_fpmath: 2463ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericFPMath(JMD, KMD)); 2464ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2465ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2466ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2467ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2468ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2469de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function fuses the chosen instruction pairs into vector instructions, 2470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // taking care preserve any needed scalar outputs and, then, it reorders the 2471de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // remaining instructions as needed (users of the first member of the pair 2472de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to be moved to after the location of the second member of the pair 2473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the vector instruction is inserted in the location of the pair's 2474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // second member). 2475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fuseChosenPairs(BasicBlock &BB, 2476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2477a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 247872465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 247972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 248072465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 248172465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps) { 2482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LLVMContext& Context = BB.getContext(); 2483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // During the vectorization process, the order of the pairs to be fused 2485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be flipped. So we'll add each pair, flipped, into the ChosenPairs 2486de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // list. After a pair is fused, the flipped pair is removed from the list. 248772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> FlippedPairs; 2488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator P = ChosenPairs.begin(), 2489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); P != E; ++P) 249072465ea23d010507d3746adc126d719005981e05Hal Finkel FlippedPairs.insert(ValuePair(P->second, P->first)); 249172465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseSet<ValuePair>::iterator P = FlippedPairs.begin(), 2492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = FlippedPairs.end(); P != E; ++P) 2493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(*P); 2494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> LoadMoveSet; 2496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectLoadMoveSet(BB, PairableInsts, ChosenPairs, LoadMoveSet); 2497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: initial: \n" << BB << "\n"); 2499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator PI = BB.getFirstInsertionPt(); PI != BB.end();) { 2501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(PI); 2502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) { 2503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getDepthFactor(P->first) == 0) { 2508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // These instructions are not really fused, but are tracked as though 2509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // they are. Any case in which it would be interesting to fuse them 2510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // will be taken care of by InstCombine. 2511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first), 2517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *J = cast<Instruction>(P->second); 2518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing: " << *I << 2520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 2521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove the pair and flipped pair from the list. 2523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator FP = ChosenPairs.find(P->second); 2524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(FP != ChosenPairs.end() && "Flipped pair not found in list"); 2525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(FP); 2526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(P); 2527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!canMoveUsesOfIAfterJ(BB, LoadMoveSet, I, J)) { 2529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusion of: " << *I << 2530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << 2531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " aborted because of non-trivial dependency cycle\n"); 2532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2537a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel // If the pair must have the other order, then flip it. 2538a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel bool FlipPairOrder = FixedOrderPairs.count(ValuePair(J, I)); 253972465ea23d010507d3746adc126d719005981e05Hal Finkel if (!FlipPairOrder && !FixedOrderPairs.count(ValuePair(I, J))) { 254072465ea23d010507d3746adc126d719005981e05Hal Finkel // This pair does not have a fixed order, and so we might want to 254172465ea23d010507d3746adc126d719005981e05Hal Finkel // flip it if that will yield fewer shuffles. We count the number 254272465ea23d010507d3746adc126d719005981e05Hal Finkel // of dependencies connected via swaps, and those directly connected, 254372465ea23d010507d3746adc126d719005981e05Hal Finkel // and flip the order if the number of swaps is greater. 254472465ea23d010507d3746adc126d719005981e05Hal Finkel bool OrigOrder = true; 254572465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairDeps.equal_range(ValuePair(I, J)); 254672465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first == ConnectedPairDeps.end()) { 254772465ea23d010507d3746adc126d719005981e05Hal Finkel IP = ConnectedPairDeps.equal_range(ValuePair(J, I)); 254872465ea23d010507d3746adc126d719005981e05Hal Finkel OrigOrder = false; 254972465ea23d010507d3746adc126d719005981e05Hal Finkel } 255072465ea23d010507d3746adc126d719005981e05Hal Finkel 255172465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first != ConnectedPairDeps.end()) { 255272465ea23d010507d3746adc126d719005981e05Hal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 255372465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 255472465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 255572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = 255672465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 255772465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 255872465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 255972465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 256072465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsDirect; 256172465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 256272465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsSwap; 256372465ea23d010507d3746adc126d719005981e05Hal Finkel } 256472465ea23d010507d3746adc126d719005981e05Hal Finkel 256572465ea23d010507d3746adc126d719005981e05Hal Finkel if (!OrigOrder) 256672465ea23d010507d3746adc126d719005981e05Hal Finkel std::swap(NumDepsDirect, NumDepsSwap); 256772465ea23d010507d3746adc126d719005981e05Hal Finkel 256872465ea23d010507d3746adc126d719005981e05Hal Finkel if (NumDepsSwap > NumDepsDirect) { 256972465ea23d010507d3746adc126d719005981e05Hal Finkel FlipPairOrder = true; 257072465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(dbgs() << "BBV: reordering pair: " << *I << 257172465ea23d010507d3746adc126d719005981e05Hal Finkel " <-> " << *J << "\n"); 257272465ea23d010507d3746adc126d719005981e05Hal Finkel } 257372465ea23d010507d3746adc126d719005981e05Hal Finkel } 257472465ea23d010507d3746adc126d719005981e05Hal Finkel } 2575282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2576202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *L = I, *H = J; 2577a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FlipPairOrder) 2578202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel std::swap(H, L); 2579202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel 258072465ea23d010507d3746adc126d719005981e05Hal Finkel // If the pair being fused uses the opposite order from that in the pair 258172465ea23d010507d3746adc126d719005981e05Hal Finkel // connection map, then we need to flip the types. 258272465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairs.equal_range(ValuePair(H, L)); 258372465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 258472465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 258572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = PairConnectionTypes.find(*Q); 258672465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 258772465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 258872465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 258972465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionSwap; 259072465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 259172465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionDirect; 259272465ea23d010507d3746adc126d719005981e05Hal Finkel } 259372465ea23d010507d3746adc126d719005981e05Hal Finkel 259472465ea23d010507d3746adc126d719005981e05Hal Finkel bool LBeforeH = !FlipPairOrder; 2595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> ReplacedOperands(NumOperands); 259772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementInputsForPair(Context, L, H, ReplacedOperands, 259872465ea23d010507d3746adc126d719005981e05Hal Finkel LBeforeH); 2599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make a copy of the original operation, change its type to the vector 2601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and replace its operands with the vector operands. 260272465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *K = L->clone(); 260372465ea23d010507d3746adc126d719005981e05Hal Finkel if (L->hasName()) 260472465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(L); 260572465ea23d010507d3746adc126d719005981e05Hal Finkel else if (H->hasName()) 260672465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(H); 2607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(K)) 2609202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K->mutateType(getVecTypeForPair(L->getType(), H->getType())); 2610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 261172465ea23d010507d3746adc126d719005981e05Hal Finkel combineMetadata(K, H); 2612ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned o = 0; o < NumOperands; ++o) 2614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->setOperand(o, ReplacedOperands[o]); 2615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->insertAfter(J); 2617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instruction insertion point: 2619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InsertionPt = K; 2620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *K1 = 0, *K2 = 0; 2621202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel replaceOutputsOfPair(Context, L, H, K, InsertionPt, K1, K2); 2622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The use tree of the first original instruction must be moved to after 2624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the location of the second instruction. The entire use tree of the 2625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first instruction is disjoint from the input tree of the second 2626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (by definition), and so commutes with it. 2627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel moveUsesOfIAfterJ(BB, LoadMoveSet, InsertionPt, I, J); 2629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(I)) { 263172465ea23d010507d3746adc126d719005981e05Hal Finkel L->replaceAllUsesWith(K1); 263272465ea23d010507d3746adc126d719005981e05Hal Finkel H->replaceAllUsesWith(K2); 263372465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(L, K1); 263472465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(H, K2); 2635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instructions that may read from memory may be in the load move set. 2638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Once an instruction is fused, we no longer need its move set, and so 2639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the values of the map never need to be updated. However, when a load 2640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is fused, we need to merge the entries from both instructions in the 2641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in case those instructions were in the move set of some other 2642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // yet-to-be-fused pair. The loads in question are the keys of the map. 2643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->mayReadFromMemory()) { 2644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> NewSetMembers; 2645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = LoadMoveSet.equal_range(I); 2646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet.equal_range(J); 2647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = IPairRange.first; 2648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != IPairRange.second; ++N) 2649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 2650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = JPairRange.first; 2651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != JPairRange.second; ++N) 2652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 2653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator A = NewSetMembers.begin(), 2654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AE = NewSetMembers.end(); A != AE; ++A) 2655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(*A); 2656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before removing I, set the iterator to the next instruction. 2659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PI = llvm::next(BasicBlock::iterator(I)); 2660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (cast<Instruction>(PI) == J) 2661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(I); 2664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(J); 2665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->eraseFromParent(); 2666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->eraseFromParent(); 266772465ea23d010507d3746adc126d719005981e05Hal Finkel 266872465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(if (PrintAfterEveryPair) dbgs() << "BBV: block is now: \n" << 266972465ea23d010507d3746adc126d719005981e05Hal Finkel BB << "\n"); 2670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: final: \n" << BB << "\n"); 2673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 2675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelchar BBVectorize::ID = 0; 2677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic const char bb_vectorize_name[] = "Basic-Block Vectorization"; 2678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_BEGIN(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 2679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_AG_DEPENDENCY(AliasAnalysis) 2680e29c19091cca58db668407dfc5dd86c70e8b3d49Hal FinkelINITIALIZE_PASS_DEPENDENCY(DominatorTree) 2681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 2682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_END(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 2683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2684bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengBasicBlockPass *llvm::createBBVectorizePass(const VectorizeConfig &C) { 2685bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return new BBVectorize(C); 2686de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 2687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2688bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengbool 2689bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengllvm::vectorizeBasicBlock(Pass *P, BasicBlock &BB, const VectorizeConfig &C) { 2690bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize BBVectorizer(P, C); 269187825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return BBVectorizer.vectorizeBB(BB); 269287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng} 2693bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 2694bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng//===----------------------------------------------------------------------===// 2695bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengVectorizeConfig::VectorizeConfig() { 2696bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng VectorBits = ::VectorBits; 2697768edf3cd037aab10391abc279f71470df8e3156Hal Finkel VectorizeBools = !::NoBools; 269886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeInts = !::NoInts; 269986312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFloats = !::NoFloats; 2700f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizePointers = !::NoPointers; 270186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeCasts = !::NoCasts; 270286312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMath = !::NoMath; 270386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFMA = !::NoFMA; 2704fc3665c87519850f629c9565535e3be447e10addHal Finkel VectorizeSelect = !::NoSelect; 2705e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel VectorizeCmp = !::NoCmp; 2706f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizeGEP = !::NoGEP; 270786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMemOps = !::NoMemOps; 2708bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng AlignedOnly = ::AlignedOnly; 2709bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng ReqChainDepth= ::ReqChainDepth; 2710bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SearchLimit = ::SearchLimit; 2711bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxCandPairsForCycleCheck = ::MaxCandPairsForCycleCheck; 2712bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SplatBreaksChain = ::SplatBreaksChain; 2713bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxInsts = ::MaxInsts; 2714bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxIter = ::MaxIter; 271564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Pow2LenOnly = ::Pow2LenOnly; 2716bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng NoMemOpBoost = ::NoMemOpBoost; 2717bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng FastDep = ::FastDep; 2718bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng} 2719