BBVectorize.cpp revision 78fd353d5e5daedc47ecc31b6193ca48793c249c
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 6178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkelstatic cl::opt<bool> 6278fd353d5e5daedc47ecc31b6193ca48793c249cHal FinkelUseChainDepthWithTI("bb-vectorize-use-chain-depth", cl::init(false), 6378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel cl::Hidden, cl::desc("Use the chain depth requirement with" 6478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel " target information")); 6578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 66de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 67de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSearchLimit("bb-vectorize-search-limit", cl::init(400), cl::Hidden, 68de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum search distance for instruction pairs")); 69de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 70de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 71de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSplatBreaksChain("bb-vectorize-splat-breaks-chain", cl::init(false), cl::Hidden, 72de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Replicating one element to a pair breaks the chain")); 73de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 74de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 75de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelVectorBits("bb-vectorize-vector-bits", cl::init(128), cl::Hidden, 76de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The size of the native vector registers")); 77de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 78de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 79de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxIter("bb-vectorize-max-iter", cl::init(0), cl::Hidden, 80de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum number of pairing iterations")); 81de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 8264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkelstatic cl::opt<bool> 8364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal FinkelPow2LenOnly("bb-vectorize-pow2-len-only", cl::init(false), cl::Hidden, 8464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cl::desc("Don't try to form non-2^n-length vectors")); 8564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 86de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 875d4e18bc39fea892f523d960213906d296d3cb38Hal FinkelMaxInsts("bb-vectorize-max-instr-per-group", cl::init(500), cl::Hidden, 885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel cl::desc("The maximum number of pairable instructions per group")); 895d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkelstatic cl::opt<unsigned> 91de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxCandPairsForCycleCheck("bb-vectorize-max-cycle-check-pairs", cl::init(200), 92de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::Hidden, cl::desc("The maximum number of candidate pairs with which to use" 93de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " a full cycle check")); 94de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 95de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 96768edf3cd037aab10391abc279f71470df8e3156Hal FinkelNoBools("bb-vectorize-no-bools", cl::init(false), cl::Hidden, 97768edf3cd037aab10391abc279f71470df8e3156Hal Finkel cl::desc("Don't try to vectorize boolean (i1) values")); 98768edf3cd037aab10391abc279f71470df8e3156Hal Finkel 99768edf3cd037aab10391abc279f71470df8e3156Hal Finkelstatic cl::opt<bool> 100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoInts("bb-vectorize-no-ints", cl::init(false), cl::Hidden, 101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize integer values")); 102de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFloats("bb-vectorize-no-floats", cl::init(false), cl::Hidden, 105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point values")); 106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 107822ab00847da841a63be4e3883cb5f442dc69069Hal Finkel// FIXME: This should default to false once pointer vector support works. 108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 109822ab00847da841a63be4e3883cb5f442dc69069Hal FinkelNoPointers("bb-vectorize-no-pointers", cl::init(/*false*/ true), cl::Hidden, 110f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize pointer values")); 111f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 112f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoCasts("bb-vectorize-no-casts", cl::init(false), cl::Hidden, 114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize casting (conversion) operations")); 115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMath("bb-vectorize-no-math", cl::init(false), cl::Hidden, 118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point math intrinsics")); 119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFMA("bb-vectorize-no-fma", cl::init(false), cl::Hidden, 122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize the fused-multiply-add intrinsic")); 123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 125fc3665c87519850f629c9565535e3be447e10addHal FinkelNoSelect("bb-vectorize-no-select", cl::init(false), cl::Hidden, 126fc3665c87519850f629c9565535e3be447e10addHal Finkel cl::desc("Don't try to vectorize select instructions")); 127fc3665c87519850f629c9565535e3be447e10addHal Finkel 128fc3665c87519850f629c9565535e3be447e10addHal Finkelstatic cl::opt<bool> 129e415f96b6a43ac8861148a11a4258bc38c247e8fHal FinkelNoCmp("bb-vectorize-no-cmp", cl::init(false), cl::Hidden, 130e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel cl::desc("Don't try to vectorize comparison instructions")); 131e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel 132e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkelstatic cl::opt<bool> 133f3f5a1e6f77a842ccb24cc81766437da5197d712Hal FinkelNoGEP("bb-vectorize-no-gep", cl::init(false), cl::Hidden, 134f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize getelementptr instructions")); 135f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 136f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMemOps("bb-vectorize-no-mem-ops", cl::init(false), cl::Hidden, 138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize loads and stores")); 139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 141de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelAlignedOnly("bb-vectorize-aligned-only", cl::init(false), cl::Hidden, 142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Only generate aligned loads and stores")); 143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 145edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal FinkelNoMemOpBoost("bb-vectorize-no-mem-op-boost", 146edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::init(false), cl::Hidden, 147edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::desc("Don't boost the chain-depth contribution of loads and stores")); 148edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 149edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkelstatic cl::opt<bool> 150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelFastDep("bb-vectorize-fast-dep", cl::init(false), cl::Hidden, 151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Use a fast instruction dependency analysis")); 152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#ifndef NDEBUG 154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugInstructionExamination("bb-vectorize-debug-instruction-examination", 156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " instruction-examination process")); 159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCandidateSelection("bb-vectorize-debug-candidate-selection", 161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " candidate-selection process")); 164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugPairSelection("bb-vectorize-debug-pair-selection", 166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " pair-selection process")); 169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCycleCheck("bb-vectorize-debug-cycle-check", 171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " cycle-checking process")); 17472465ea23d010507d3746adc126d719005981e05Hal Finkel 17572465ea23d010507d3746adc126d719005981e05Hal Finkelstatic cl::opt<bool> 17672465ea23d010507d3746adc126d719005981e05Hal FinkelPrintAfterEveryPair("bb-vectorize-debug-print-after-every-pair", 17772465ea23d010507d3746adc126d719005981e05Hal Finkel cl::init(false), cl::Hidden, 17872465ea23d010507d3746adc126d719005981e05Hal Finkel cl::desc("When debugging is enabled, dump the basic block after" 17972465ea23d010507d3746adc126d719005981e05Hal Finkel " every pair is fused")); 180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#endif 181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSTATISTIC(NumFusedOps, "Number of operations fused by bb-vectorize"); 183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 184de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelnamespace { 185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel struct BBVectorize : public BasicBlockPass { 186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static char ID; // Pass identification, replacement for typeid 187bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 188940371bc65570ec0add1ede4f4d9f0a41ba25e09Hongbin Zheng const VectorizeConfig Config; 189bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 190bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(const VectorizeConfig &C = VectorizeConfig()) 191bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel initializeBBVectorizePass(*PassRegistry::getPassRegistry()); 193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 195bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(Pass *P, const VectorizeConfig &C) 196bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 19787825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &P->getAnalysis<AliasAnalysis>(); 198e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &P->getAnalysis<DominatorTree>(); 19987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &P->getAnalysis<ScalarEvolution>(); 2003574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = P->getAnalysisIfAvailable<DataLayout>(); 20165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TTI = IgnoreTargetInfo ? 0 : 20265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel P->getAnalysisIfAvailable<TargetTransformInfo>(); 20365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel VTTI = TTI ? TTI->getVectorTargetTransformInfo() : 0; 20487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 20587825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<Value *, Value *> ValuePair; 20765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel typedef std::pair<ValuePair, int> ValuePairWithCost; 208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, size_t> ValuePairWithDepth; 209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair 21072465ea23d010507d3746adc126d719005981e05Hal Finkel typedef std::pair<VPPair, unsigned> VPPairWithType; 211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<Value *, Value *>::iterator, 212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *>::iterator> VPIteratorPair; 213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, 214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair>::iterator> 215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair; 216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis *AA; 218e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DominatorTree *DT; 219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ScalarEvolution *SE; 2203574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow DataLayout *TD; 22165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TargetTransformInfo *TTI; 22265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel const VectorTargetTransformInfo *VTTI; 223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: const correct? 225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 22664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool vectorizePairs(BasicBlock &BB, bool NonPow2Len = false); 227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2285d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool getCandidatePairs(BasicBlock &BB, 2295d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 231a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 23265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 23364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len); 234de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 23578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // FIXME: The current implementation does not account for pairs that 23678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // are connected in multiple ways. For example: 23778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // C1 = A1 / A2; C2 = A2 / A1 (which may be both direct and a swap) 23872465ea23d010507d3746adc126d719005981e05Hal Finkel enum PairConnectionType { 23972465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionDirect, 24072465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSwap, 24172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSplat 24272465ea23d010507d3746adc126d719005981e05Hal Finkel }; 24372465ea23d010507d3746adc126d719005981e05Hal Finkel 244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, 245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 24672465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 24772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes); 248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildDepMap(BasicBlock &BB, 250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers); 253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void choosePairs(std::multimap<Value *, Value *> &CandidatePairs, 25565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 25786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 25886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 26086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs); 263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fuseChosenPairs(BasicBlock &BB, 265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 266a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *>& ChosenPairs, 26772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 26872465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 26972465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 27072465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps); 27172465ea23d010507d3746adc126d719005981e05Hal Finkel 272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isInstVectorizable(Instruction *I, bool &IsSimpleLoadStore); 274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool areInstsCompatible(Instruction *I, Instruction *J, 27665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 277a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder); 278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool trackUsesOfI(DenseSet<Value *> &Users, 280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers = true, 282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet = 0); 2831230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computePairsConnectedTo( 285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 28872465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P); 290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairsConflict(ValuePair P, ValuePair Q, 292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap = 0); 294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairWillFormCycle(ValuePair P, 296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUsers, 297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs); 298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void pruneTreeFor( 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 std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 309de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildInitialTreeFor( 311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J); 317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void findBestTreeFor( 319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 32065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 32286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 32386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 324de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 32586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 33065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementPointerInput(LLVMContext& Context, Instruction *I, 334202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *J, unsigned o); 335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fillNewShuffleMask(LLVMContext& Context, Instruction *J, 33764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 33864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 33964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask); 340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementShuffleMask(LLVMContext& Context, Instruction *I, 342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J); 343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 34464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool expandIEChain(LLVMContext& Context, Instruction *I, Instruction *J, 34564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned o, Value *&LOp, unsigned numElemL, 34672465ea23d010507d3746adc126d719005981e05Hal Finkel Type *ArgTypeL, Type *ArgTypeR, bool IBeforeJ, 34764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned IdxOff = 0); 34864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementInput(LLVMContext& Context, Instruction *I, 35072465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ); 351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void getReplacementInputsForPair(LLVMContext& Context, Instruction *I, 35372465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, SmallVector<Value *, 3> &ReplacedOperands, 35472465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ); 355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, Instruction *&K1, 359202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K2); 360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectPairLoadMoveSet(BasicBlock &BB, 362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I); 365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectLoadMoveSet(BasicBlock &BB, 367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet); 370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool canMoveUsesOfIAfterJ(BasicBlock &BB, 372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void moveUsesOfIAfterJ(BasicBlock &BB, 376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 380ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void combineMetadata(Instruction *K, const Instruction *J); 381ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 38287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng bool vectorizeBB(BasicBlock &BB) { 383e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel if (!DT->isReachableFromEntry(&BB)) { 384e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DEBUG(dbgs() << "BBV: skipping unreachable " << BB.getName() << 385e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel " in " << BB.getParent()->getName() << "\n"); 386e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel return false; 387e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel } 388e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel 38965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DEBUG(if (VTTI) dbgs() << "BBV: using target information\n"); 39065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool changed = false; 392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate a sufficient number of times to merge types of size 1 bit, 393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then 2 bits, then 4, etc. up to half of the target vector width of the 394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // target vector register. 39564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned n = 1; 39664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 2; 39765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (VTTI || v <= Config.VectorBits) && 39865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (!Config.MaxIter || n <= Config.MaxIter); 399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel v *= 2, ++n) { 400bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng DEBUG(dbgs() << "BBV: fusing loop #" << n << 401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " for " << BB.getName() << " in " << 402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BB.getParent()->getName() << "...\n"); 403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (vectorizePairs(BB)) 404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel changed = true; 405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 40964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (changed && !Pow2LenOnly) { 41064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ++n; 41164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; !Config.MaxIter || n <= Config.MaxIter; ++n) { 41264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel DEBUG(dbgs() << "BBV: fusing for non-2^n-length vectors loop #: " << 41364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel n << " for " << BB.getName() << " in " << 41464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel BB.getParent()->getName() << "...\n"); 41564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!vectorizePairs(BB, true)) break; 41664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 41764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 41864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: done!\n"); 420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return changed; 421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 42387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng virtual bool runOnBasicBlock(BasicBlock &BB) { 42487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &getAnalysis<AliasAnalysis>(); 425e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &getAnalysis<DominatorTree>(); 42687825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &getAnalysis<ScalarEvolution>(); 4273574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = getAnalysisIfAvailable<DataLayout>(); 42865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel TTI = IgnoreTargetInfo ? 0 : 42965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel getAnalysisIfAvailable<TargetTransformInfo>(); 43065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel VTTI = TTI ? TTI->getVectorTargetTransformInfo() : 0; 43187825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 43287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return vectorizeBB(BB); 43387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 43487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel virtual void getAnalysisUsage(AnalysisUsage &AU) const { 436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlockPass::getAnalysisUsage(AU); 437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<AliasAnalysis>(); 438e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel AU.addRequired<DominatorTree>(); 439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<ScalarEvolution>(); 440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<AliasAnalysis>(); 441e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel AU.addPreserved<DominatorTree>(); 442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<ScalarEvolution>(); 4437e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel AU.setPreservesCFG(); 444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 44664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline VectorType *getVecTypeForPair(Type *ElemTy, Type *Elem2Ty) { 44764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel assert(ElemTy->getScalarType() == Elem2Ty->getScalarType() && 44864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel "Cannot form vector from incompatible scalar types"); 44964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *STy = ElemTy->getScalarType(); 45064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 45164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem; 452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (VectorType *VTy = dyn_cast<VectorType>(ElemTy)) { 45364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = VTy->getNumElements(); 45464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 45564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = 1; 45664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 45764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 45864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VectorType *VTy = dyn_cast<VectorType>(Elem2Ty)) { 45964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += VTy->getNumElements(); 46064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 46164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += 1; 462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 4637e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel 46464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return VectorType::get(STy, numElem); 46564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 46664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 46764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline void getInstructionTypes(Instruction *I, 46864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *&T1, Type *&T2) { 46964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<StoreInst>(I)) { 47064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // For stores, it is the value type, not the pointer type that matters 47164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // because the value is what will come from a vector register. 47264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 47364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *IVal = cast<StoreInst>(I)->getValueOperand(); 47464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = IVal->getType(); 47564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 47664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = I->getType(); 47764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 47864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 47964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I->isCast()) 48064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T2 = cast<CastInst>(I)->getSrcTy(); 48164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 48264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T2 = T1; 48365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 48465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (SelectInst *SI = dyn_cast<SelectInst>(I)) { 48565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel T2 = SI->getCondition()->getType(); 48665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the weight associated with the provided value. A chain of 490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate pairs has a length given by the sum of the weights of its 491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // members (one weight per pair; the weight of each member of the pair 492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is assumed to be the same). This length is then compared to the 493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chain-length threshold to determine if a given chain is significant 494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // enough to be vectorized. The length is also used in comparing 495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate chains where longer chains are considered to be better. 496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: when this function returns 0, the resulting instructions are 497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // not actually fused. 498bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng inline size_t getDepthFactor(Value *V) { 499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // InsertElement and ExtractElement have a depth factor of zero. This is 500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // for two reasons: First, they cannot be usefully fused. Second, because 501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pass generates a lot of these, they can confuse the simple metric 502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // used to compare the trees in the next iteration. Thus, giving them a 503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // weight of zero allows the pass to essentially ignore them in 504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // subsequent iterations when looking for vectorization opportunities 505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // while still tracking dependency chains that flow through those 506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions. 507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<InsertElementInst>(V) || isa<ExtractElementInst>(V)) 508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 0; 509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 510edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // Give a load or store half of the required depth so that load/store 511edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // pairs will vectorize. 512bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (!Config.NoMemOpBoost && (isa<LoadInst>(V) || isa<StoreInst>(V))) 513bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return Config.ReqChainDepth/2; 514edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 1; 516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 51846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // Returns the cost of the provided instruction using VTTI. 51946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // This does not handle loads and stores. 52046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned getInstrCost(unsigned Opcode, Type *T1, Type *T2) { 52146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel switch (Opcode) { 52246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel default: break; 52346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::GetElementPtr: 52446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // We mark this instruction as zero-cost because scalar GEPs are usually 52546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // lowered to the intruction addressing mode. At the moment we don't 52646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // generate vector GEPs. 52746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 52846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Br: 52946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCFInstrCost(Opcode); 53046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PHI: 53146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 53246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Add: 53346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FAdd: 53446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Sub: 53546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FSub: 53646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Mul: 53746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FMul: 53846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UDiv: 53946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SDiv: 54046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FDiv: 54146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::URem: 54246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SRem: 54346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FRem: 54446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Shl: 54546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::LShr: 54646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::AShr: 54746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::And: 54846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Or: 54946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Xor: 55046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getArithmeticInstrCost(Opcode, T1); 55146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Select: 55246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ICmp: 55346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FCmp: 55446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCmpSelInstrCost(Opcode, T1, T2); 55546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ZExt: 55646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SExt: 55746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToUI: 55846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToSI: 55946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPExt: 56046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PtrToInt: 56146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::IntToPtr: 56246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SIToFP: 56346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UIToFP: 56446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Trunc: 56546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPTrunc: 56646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::BitCast: 56786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel case Instruction::ShuffleVector: 56846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return VTTI->getCastInstrCost(Opcode, T1, T2); 56946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 57046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 57146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 1; 57246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 57346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This determines the relative offset of two loads or stores, returning 575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if the offset could be determined to be some constant value. 576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For example, if OffsetInElmts == 1, then J accesses the memory directly 577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after I; if OffsetInElmts == -1 then I accesses the memory 57864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // directly after J. 579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool getPairPtrInfo(Instruction *I, Instruction *J, 580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *&IPtr, Value *&JPtr, unsigned &IAlignment, unsigned &JAlignment, 58165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned &IAddressSpace, unsigned &JAddressSpace, 58293f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel int64_t &OffsetInElmts, bool ComputeOffset = true) { 583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = 0; 58465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (LoadInst *LI = dyn_cast<LoadInst>(I)) { 58565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel LoadInst *LJ = cast<LoadInst>(J); 58665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = LI->getPointerOperand(); 58765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = LJ->getPointerOperand(); 58865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = LI->getAlignment(); 58965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = LJ->getAlignment(); 59065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = LI->getPointerAddressSpace(); 59165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = LJ->getPointerAddressSpace(); 592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 59365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel StoreInst *SI = cast<StoreInst>(I), *SJ = cast<StoreInst>(J); 59465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = SI->getPointerOperand(); 59565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = SJ->getPointerOperand(); 59665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = SI->getAlignment(); 59765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = SJ->getAlignment(); 59865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = SI->getPointerAddressSpace(); 59965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = SJ->getPointerAddressSpace(); 600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 60293f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel if (!ComputeOffset) 60393f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel return true; 60493f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel 605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *IPtrSCEV = SE->getSCEV(IPtr); 606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *JPtrSCEV = SE->getSCEV(JPtr); 607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If this is a trivial offset, then we'll get something like 609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // 1*sizeof(type). With target data, which we need anyway, this will get 610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // constant folded into a number. 611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV); 612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (const SCEVConstant *ConstOffSCEV = 613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dyn_cast<SCEVConstant>(OffsetSCEV)) { 614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt *IntOff = ConstOffSCEV->getValue(); 615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t Offset = IntOff->getSExtValue(); 616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VTy = cast<PointerType>(IPtr->getType())->getElementType(); 618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t VTyTSS = (int64_t) TD->getTypeStoreSize(VTy); 619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 62064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VTy2 = cast<PointerType>(JPtr->getType())->getElementType(); 62164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VTy != VTy2 && Offset < 0) { 62264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int64_t VTy2TSS = (int64_t) TD->getTypeStoreSize(VTy2); 62364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel OffsetInElmts = Offset/VTy2TSS; 62464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return (abs64(Offset) % VTy2TSS) == 0; 62564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = Offset/VTyTSS; 628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (abs64(Offset) % VTyTSS) == 0; 629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if the provided CallInst represents an intrinsic that can 635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be vectorized. 636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isVectorizableIntrinsic(CallInst* I) { 637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = I->getCalledFunction(); 638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!F) return false; 639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IID) return false; 642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel switch(IID) { 644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel default: 645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sqrt: 647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::powi: 648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sin: 649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::cos: 650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log: 651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log2: 652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log10: 653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp: 654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp2: 655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::pow: 65686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeMath; 657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::fma: 65886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeFMA; 659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if J is the second element in some pair referenced by 663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some multimap pair iterator pair. 664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel template <typename V> 665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isSecondInIteratorPair(V J, std::pair< 666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator, 667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator> PairRange) { 668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (typename std::multimap<V, V>::iterator K = PairRange.first; 669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != PairRange.second; ++K) 670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->second == J) return true; 671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel }; 675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function implements one vectorization iteration on the provided 677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block. It returns true if the block is changed. 67864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::vectorizePairs(BasicBlock &BB, bool NonPow2Len) { 6795d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue; 6805d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator Start = BB.getFirstInsertionPt(); 6815d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 6825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> AllPairableInsts; 6835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> AllChosenPairs; 684a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> AllFixedOrderPairs; 68572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> AllPairConnectionTypes; 68672465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> AllConnectedPairs, AllConnectedPairDeps; 6875d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 6885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel do { 6895d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> PairableInsts; 6905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::multimap<Value *, Value *> CandidatePairs; 691a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> FixedOrderPairs; 69265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> CandidatePairCostSavings; 6935d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, 694a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs, 69565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings, 69664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PairableInsts, NonPow2Len); 6975d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.empty()) continue; 6983706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 6995d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Now we have a map of all of the pairable instructions and we need to 7005d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // select the best possible pairing. A good pairing is one such that the 7015d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // users of the pair are also paired. This defines a (directed) forest 70294c22716d60ff5edf6a98a3c67e0faa001be1142Sylvestre Ledru // over the pairs such that two pairs are connected iff the second pair 7035d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // uses the first. 7043706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7055d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Note that it only matters that both members of the second pair use some 7065d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // element of the first pair (to allow for splatting). 7073706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 70872465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> ConnectedPairs, ConnectedPairDeps; 70972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> PairConnectionTypes; 71072465ea23d010507d3746adc126d719005981e05Hal Finkel computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs, 71172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes); 7125d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ConnectedPairs.empty()) continue; 7133706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 71472465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 71572465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 71672465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 71772465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairDeps.insert(VPPair(I->second, I->first)); 71872465ea23d010507d3746adc126d719005981e05Hal Finkel } 71972465ea23d010507d3746adc126d719005981e05Hal Finkel 7205d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Build the pairable-instruction dependency map 7215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseSet<ValuePair> PairableInstUsers; 7225d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); 7233706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 72435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // There is now a graph of the connected pairs. For each variable, pick 72535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // the pairing with the largest tree meeting the depth requirement on at 72635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // least one branch. Then select all pairings that are part of that tree 72735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // and remove them from the list of available pairings and pairable 72835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // variables. 7293706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7305d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> ChosenPairs; 73165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel choosePairs(CandidatePairs, CandidatePairCostSavings, 73286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 73386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 7345d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInstUsers, ChosenPairs); 7353706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7365d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ChosenPairs.empty()) continue; 7375d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), 7385d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts.end()); 7395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end()); 740a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 74172465ea23d010507d3746adc126d719005981e05Hal Finkel // Only for the chosen pairs, propagate information on fixed-order pairs, 74272465ea23d010507d3746adc126d719005981e05Hal Finkel // pair connections, and their types to the data structures used by the 74372465ea23d010507d3746adc126d719005981e05Hal Finkel // pair fusion procedures. 744a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel for (DenseMap<Value *, Value *>::iterator I = ChosenPairs.begin(), 745a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel IE = ChosenPairs.end(); I != IE; ++I) { 746a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrderPairs.count(*I)) 747a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(*I); 748a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrderPairs.count(ValuePair(I->second, I->first))) 749a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(ValuePair(I->second, I->first)); 75072465ea23d010507d3746adc126d719005981e05Hal Finkel 75172465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseMap<Value *, Value *>::iterator J = ChosenPairs.begin(); 75272465ea23d010507d3746adc126d719005981e05Hal Finkel J != IE; ++J) { 75372465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator K = 75472465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(*I, *J)); 75572465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) { 75672465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 75772465ea23d010507d3746adc126d719005981e05Hal Finkel } else { 75872465ea23d010507d3746adc126d719005981e05Hal Finkel K = PairConnectionTypes.find(VPPair(*J, *I)); 75972465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) 76072465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 76172465ea23d010507d3746adc126d719005981e05Hal Finkel } 76272465ea23d010507d3746adc126d719005981e05Hal Finkel } 76372465ea23d010507d3746adc126d719005981e05Hal Finkel } 76472465ea23d010507d3746adc126d719005981e05Hal Finkel 76572465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 76672465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 76772465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 76872465ea23d010507d3746adc126d719005981e05Hal Finkel if (AllPairConnectionTypes.count(*I)) { 76972465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs.insert(*I); 77072465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairDeps.insert(VPPair(I->second, I->first)); 77172465ea23d010507d3746adc126d719005981e05Hal Finkel } 772a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel } 7735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } while (ShouldContinue); 7745d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7755d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (AllChosenPairs.empty()) return false; 7765d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel NumFusedOps += AllChosenPairs.size(); 7773706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A set of pairs has now been selected. It is now necessary to replace the 779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // paired instructions with vector instructions. For this procedure each 78043ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop // operand must be replaced with a vector operand. This vector is formed 781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // by using build_vector on the old operands. The replaced values are then 782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // replaced with a vector_extract on the result. Subsequent optimization 783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // passes should coalesce the build/extract combinations. 7843706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 78572465ea23d010507d3746adc126d719005981e05Hal Finkel fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs, AllFixedOrderPairs, 78672465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes, 78772465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs, AllConnectedPairDeps); 78864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 78964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // It is important to cleanup here so that future iterations of this 79064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // function have less work to do. 7918e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer (void) SimplifyInstructionsInBlock(&BB, TD, AA->getTargetLibraryInfo()); 792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 794de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the provided instruction is capable of being 796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fused into a vector instruction. This determination is based only on the 797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and other attributes of the instruction. 798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::isInstVectorizable(Instruction *I, 799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &IsSimpleLoadStore) { 800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = false; 801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (CallInst *C = dyn_cast<CallInst>(I)) { 803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isVectorizableIntrinsic(C)) 804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (LoadInst *L = dyn_cast<LoadInst>(I)) { 806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple loads if possbile: 807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = L->isSimple(); 80886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (StoreInst *S = dyn_cast<StoreInst>(I)) { 811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple stores if possbile: 812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = S->isSimple(); 81386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (CastInst *C = dyn_cast<CastInst>(I)) { 816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can vectorize casts, but not casts of pointer types, etc. 81786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeCasts) 818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *SrcTy = C->getSrcTy(); 821f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!SrcTy->isSingleValueType()) 822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 823de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *DestTy = C->getDestTy(); 825f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!DestTy->isSingleValueType()) 826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 827fc3665c87519850f629c9565535e3be447e10addHal Finkel } else if (isa<SelectInst>(I)) { 828fc3665c87519850f629c9565535e3be447e10addHal Finkel if (!Config.VectorizeSelect) 829fc3665c87519850f629c9565535e3be447e10addHal Finkel return false; 830e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel } else if (isa<CmpInst>(I)) { 831e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel if (!Config.VectorizeCmp) 832e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel return false; 833f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel } else if (GetElementPtrInst *G = dyn_cast<GetElementPtrInst>(I)) { 834f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!Config.VectorizeGEP) 835f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 836f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 837f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel // Currently, vector GEPs exist only with one index. 838f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (G->getNumIndices() != 1) 839f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!(I->isBinaryOp() || isa<ShuffleVectorInst>(I) || 841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<ExtractElementInst>(I) || isa<InsertElementInst>(I))) { 842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 843de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 844de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 845de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can't vectorize memory operations without target data 846de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (TD == 0 && IsSimpleLoadStore) 847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 848de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 849de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *T1, *T2; 85064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, T1, T2); 851de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 852de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Not every type can be vectorized... 853de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(VectorType::isValidElementType(T1) || T1->isVectorTy()) || 854de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel !(VectorType::isValidElementType(T2) || T2->isVectorTy())) 855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 856de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 85765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T1->getScalarSizeInBits() == 1) { 858768edf3cd037aab10391abc279f71470df8e3156Hal Finkel if (!Config.VectorizeBools) 859768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 860768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } else { 86165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T1->isIntOrIntVectorTy()) 862768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 863768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } 86465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 86565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T2->getScalarSizeInBits() == 1) { 86665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeBools) 86765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 86865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 86965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T2->isIntOrIntVectorTy()) 87065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 87165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 87265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 87386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeFloats 87486312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng && (T1->isFPOrFPVectorTy() || T2->isFPOrFPVectorTy())) 875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 877e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel // Don't vectorize target-specific types. 878e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T1->isX86_FP80Ty() || T1->isPPC_FP128Ty() || T1->isX86_MMXTy()) 879e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 880e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T2->isX86_FP80Ty() || T2->isPPC_FP128Ty() || T2->isX86_MMXTy()) 881e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 882e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel 88305bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel if ((!Config.VectorizePointers || TD == 0) && 88405bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel (T1->getScalarType()->isPointerTy() || 88505bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel T2->getScalarType()->isPointerTy())) 886f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 887f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 88865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!VTTI && (T1->getPrimitiveSizeInBits() >= Config.VectorBits || 88965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel T2->getPrimitiveSizeInBits() >= Config.VectorBits)) 890de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 891de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the two provided instructions are compatible 896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (meaning that they can be fused into a vector instruction). This assumes 897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that I has already been determined to be vectorizable and that J is not 898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in the use tree of I. 899de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::areInstsCompatible(Instruction *I, Instruction *J, 90065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 901a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder) { 902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugInstructionExamination) dbgs() << "BBV: looking at " << *I << 903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 90565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = 0; 906a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = 0; 90765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Loads and stores can be merged if they have different alignments, 909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but are otherwise the same. 91064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!J->isSameOperationAs(I, Instruction::CompareIgnoringAlignment | 91164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (NonPow2Len ? Instruction::CompareUsingScalarTypes : 0))) 91264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return false; 91364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 91464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *IT1, *IT2, *JT1, *JT2; 91564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, IT1, IT2); 91664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(J, JT1, JT2); 91764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaxTypeBits = std::max( 91864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT1->getPrimitiveSizeInBits() + JT1->getPrimitiveSizeInBits(), 91964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT2->getPrimitiveSizeInBits() + JT2->getPrimitiveSizeInBits()); 92065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!VTTI && MaxTypeBits > Config.VectorBits) 921de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 922ec4e85e3364f50802f2007e4b1e23661d4610366Hal Finkel 923de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: handle addsub-type operations! 924de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 925de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsSimpleLoadStore) { 926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 92765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts = 0; 929de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 93065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 931de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts) && abs64(OffsetInElmts) == 1) { 932a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = (int) OffsetInElmts; 93365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned BottomAlignment = IAlignment; 93465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (OffsetInElmts < 0) BottomAlignment = JAlignment; 93565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 93665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeI = isa<StoreInst>(I) ? 93765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(I)->getValueOperand()->getType() : I->getType(); 93865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeJ = isa<StoreInst>(J) ? 93965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(J)->getValueOperand()->getType() : J->getType(); 94065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VType = getVecTypeForPair(aTypeI, aTypeJ); 94164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 94265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (Config.AlignedOnly) { 943de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // An aligned load or store is possible only if the instruction 944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // with the lower offset has an alignment suitable for the 945de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector type. 9461230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 947de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned VecAlignment = TD->getPrefTypeAlignment(VType); 948de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (BottomAlignment < VecAlignment) 949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 950de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 95165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 95265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) { 95365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned ICost = VTTI->getMemoryOpCost(I->getOpcode(), I->getType(), 95465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment, IAddressSpace); 95565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned JCost = VTTI->getMemoryOpCost(J->getOpcode(), J->getType(), 95665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment, JAddressSpace); 95765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned VCost = VTTI->getMemoryOpCost(I->getOpcode(), VType, 95865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel BottomAlignment, 95965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace); 96065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 96165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 96282149a9106f221aa6a7271977c236b078e621f21Hal Finkel 963dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 96482149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 965dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 966dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel unsigned VParts = VTTI->getNumberOfParts(VType); 967dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 968dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 969dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 97082149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 97182149a9106f221aa6a7271977c236b078e621f21Hal Finkel 97265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 97365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 974de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 975de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 976de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 97765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else if (VTTI) { 97846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned ICost = getInstrCost(I->getOpcode(), IT1, IT2); 97946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned JCost = getInstrCost(J->getOpcode(), JT1, JT2); 98065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VT1 = getVecTypeForPair(IT1, JT1), 98165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel *VT2 = getVecTypeForPair(IT2, JT2); 98246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned VCost = getInstrCost(I->getOpcode(), VT1, VT2); 98365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 98465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 98565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 98682149a9106f221aa6a7271977c236b078e621f21Hal Finkel 987dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 98882149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 989dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 990dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel unsigned VParts = VTTI->getNumberOfParts(VT1); 991dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 992dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 993dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 99482149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 99582149a9106f221aa6a7271977c236b078e621f21Hal Finkel 99665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 9996173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The powi intrinsic is special because only the first argument is 10006173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // vectorized, the second arguments must be equal. 10016173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel CallInst *CI = dyn_cast<CallInst>(I); 10026173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Function *FI; 10036173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (CI && (FI = CI->getCalledFunction()) && 10046173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel FI->getIntrinsicID() == Intrinsic::powi) { 10056173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 10066173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Value *A1I = CI->getArgOperand(1), 10076173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel *A1J = cast<CallInst>(J)->getArgOperand(1); 10086173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel const SCEV *A1ISCEV = SE->getSCEV(A1I), 10096173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel *A1JSCEV = SE->getSCEV(A1J); 10106173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel return (A1ISCEV == A1JSCEV); 10116173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 10126173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 1013de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1014de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1015de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1016de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Figure out whether or not J uses I and update the users and write-set 1017de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // structures associated with I. Specifically, Users represents the set of 1018de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions that depend on I. WriteSet represents the set 1019de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of memory locations that are dependent on I. If UpdateUsers is true, 1020de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and J uses I, then Users is updated to contain J and WriteSet is updated 1021de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to contain any memory locations to which J writes. The function returns 1022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if J uses I. By default, alias analysis is used to determine 1023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // whether J reads from memory that overlaps with a location in WriteSet. 1024de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If LoadMoveSet is not null, then it is a previously-computed multimap 1025de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // where the key is the memory-based user instruction and the value is 1026de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the instruction to be compared with I. So, if LoadMoveSet is provided, 1027de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then the alias analysis is not used. This is necessary because this 1028de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // function is called during the process of moving instructions during 1029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectorization and the results of the alias analysis are not stable during 1030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that process. 1031de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, 1032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 1033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers, 1034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet) { 1035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = false; 1036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This instruction may already be marked as a user due, for example, to 1038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // being a member of a selected pair. 1039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (Users.count(J)) 1040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1042de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI) 10437e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel for (User::op_iterator JU = J->op_begin(), JE = J->op_end(); 10447e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel JU != JE; ++JU) { 1045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *V = *JU; 1046de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I == V || Users.count(V)) { 1047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1049de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1050de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1051de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI && J->mayReadFromMemory()) { 1052de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LoadMoveSet) { 1053de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); 1054de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = isSecondInIteratorPair<Value*>(I, JPairRange); 1055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSetTracker::iterator W = WriteSet.begin(), 1057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel WE = WriteSet.end(); W != WE; ++W) { 105838a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel if (W->aliasesUnknownInst(J, *AA)) { 105938a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel UsesI = true; 106038a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel break; 1061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1062de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1063de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1064de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1065de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1066de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI && UpdateUsers) { 1067de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (J->mayWriteToMemory()) WriteSet.add(J); 1068de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Users.insert(J); 1069de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1070de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1071de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return UsesI; 1072de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1073de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1074de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function iterates over all instruction pairs in the provided 1075de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block and collects all candidate pairs for vectorization. 10765d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool BBVectorize::getCandidatePairs(BasicBlock &BB, 10775d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 1078de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1079a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 108065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 108164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len) { 1082de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 10835d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (Start == E) return false; 10845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 10855d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue = false, IAfterStart = false; 10865d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel for (BasicBlock::iterator I = Start++; I != E; ++I) { 10875d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (I == Start) IAfterStart = true; 10885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1089de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore; 1090de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isInstVectorizable(I, IsSimpleLoadStore)) continue; 1091de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1092de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for an instruction with which to pair instruction *I... 1093de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1094de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 10955d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool JAfterStart = IAfterStart; 10965d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator J = llvm::next(I); 1097bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng for (unsigned ss = 0; J != E && ss <= Config.SearchLimit; ++J, ++ss) { 10985d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (J == Start) JAfterStart = true; 10995d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Determine if J uses I, if so, exit the loop. 1101bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep); 1102bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.FastDep) { 1103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: For this heuristic to be effective, independent operations 1104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // must tend to be intermixed. This is likely to be true from some 1105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // kinds of grouped loop unrolling (but not the generic LLVM pass), 1106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but otherwise may require some kind of reordering pass. 1107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // When using fast dependency analysis, 1109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // stop searching after first use: 1110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 1111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) continue; 1113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J does not use I, and comes before the first use of I, so it can be 1116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // merged with I if the instructions are compatible. 1117a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int CostSavings, FixedOrder; 111865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!areInstsCompatible(I, J, IsSimpleLoadStore, NonPow2Len, 1119a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel CostSavings, FixedOrder)) continue; 1120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J is a candidate for merging with I. 1122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!PairableInsts.size() || 1123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts[PairableInsts.size()-1] != I) { 1124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts.push_back(I); 1125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 11265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1127de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.insert(ValuePair(I, J)); 112865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) 112965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings.insert(ValuePairWithCost(ValuePair(I, J), 113065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings)); 11315d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1132a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrder == 1) 1133a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(I, J)); 1134a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrder == -1) 1135a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(J, I)); 1136a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 11375d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // The next call to this function must start after the last instruction 11385d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // selected during this invocation. 11395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (JAfterStart) { 11405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel Start = llvm::next(J); 11415d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel IAfterStart = JAfterStart = false; 11425d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 11435d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCandidateSelection) dbgs() << "BBV: candidate pair " 114565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel << *I << " <-> " << *J << " (cost savings: " << 114665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings << ")\n"); 11475d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11485d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // If we have already found too many pairs, break here and this function 11495d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // will be called again starting after the last instruction selected 11505d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // during this invocation. 1151bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (PairableInsts.size() >= Config.MaxInsts) { 11525d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = true; 11535d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 11545d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 1155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 11565d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11575d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ShouldContinue) 11585d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 1159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << PairableInsts.size() 1162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " instructions with candidate pairs\n"); 11635d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11645d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel return ShouldContinue; 1165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Finds candidate pairs connected to the pair P = <PI, PJ>. This means that 1168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // it looks for pairs such that both members have an input which is an 1169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // output of PI or PJ. 1170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computePairsConnectedTo( 1171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 117472465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P) { 1176bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel StoreInst *SI, *SJ; 1177bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each possible pairing for this variable, look at the uses of 1179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the first value... 1180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.first->use_begin(), 1181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.first->use_end(); I != E; ++I) { 1182bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) { 1183bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // A pair cannot be connected to a load because the load only takes one 1184bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // operand (the address) and it is a scalar even after vectorization. 1185bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1186bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } else if ((SI = dyn_cast<StoreInst>(*I)) && 1187bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SI->getPointerOperand()) { 1188bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // Similarly, a pair cannot be connected to a store through its 1189bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // pointer operand. 1190bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1191bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } 1192bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each use of the first variable, look for uses of the second 1196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // variable... 1197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(), 1198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = P.second->use_end(); J != E2; ++J) { 1199bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1200bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1201bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1202bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); 1204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <I, J>: 120672465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 120772465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 120872465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 120972465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionDirect)); 121072465ea23d010507d3746adc126d719005981e05Hal Finkel } 1211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <J, I>: 121372465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*I, JPairRange)) { 121472465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*J, *I)); 121572465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 121672465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSwap)); 121772465ea23d010507d3746adc126d719005981e05Hal Finkel } 1218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1220bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) continue; 1221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the first value in the pair is used by 1222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.first->use_begin(); J != E; ++J) { 1224bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1225bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SJ->getPointerOperand()) 1226bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1227bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 122872465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 122972465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 123072465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 123172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 123272465ea23d010507d3746adc126d719005981e05Hal Finkel } 1233de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1234de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1235de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1236bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) return; 1237de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the second value in the pair is used by 1238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.second->use_begin(), 1240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.second->use_end(); I != E; ++I) { 1241bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) 1242bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1243bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel else if ((SI = dyn_cast<StoreInst>(*I)) && 1244bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SI->getPointerOperand()) 1245bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1246bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(); J != E; ++J) { 1250bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1251bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1252bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1253bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 125472465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 125572465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 125672465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 125772465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 125872465ea23d010507d3746adc126d719005981e05Hal Finkel } 1259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1260de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function figures out which pairs are connected. Two pairs are 1264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // connected if some output of the first pair forms an input to both members 1265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of the second pair. 1266de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computeConnectedPairs( 1267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 126972465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 127072465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes) { 1271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 1273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PE = PairableInsts.end(); PI != PE; ++PI) { 1274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); 1275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator P = choiceRange.first; 1277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel P != choiceRange.second; ++P) 1278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel computePairsConnectedTo(CandidatePairs, PairableInsts, 127972465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs, PairConnectionTypes, *P); 1280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << ConnectedPairs.size() 1283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " pair connections.\n"); 1284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds a set of use tuples such that <A, B> is in the set 1287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // if B is in the use tree of A. If B is in the use tree of A, then B 1288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depends on the output of A. 1289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildDepMap( 1290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB, 1291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers) { 1294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> IsInPair; 1295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator C = CandidatePairs.begin(), 1296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = CandidatePairs.end(); C != E; ++C) { 1297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->first); 1298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->second); 1299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate through the basic block, recording all Users of each 1302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairable instruction. 1303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 1305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator I = BB.getFirstInsertionPt(); I != E; ++I) { 1306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsInPair.find(I) == IsInPair.end()) continue; 1307de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1308de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1309de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1310de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator J = llvm::next(I); J != E; ++J) 1311de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, J); 1312de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end(); 1314de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel U != E; ++U) 1315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.insert(ValuePair(I, *U)); 1316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if an input to pair P is an output of pair Q and also an 1320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // input of pair Q is an output of pair P. If this is the case, then these 1321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // two pairs cannot be simultaneously fused. 1322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairsConflict(ValuePair P, ValuePair Q, 1323de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1324de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap) { 1325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Two pairs are in conflict if they are mutual Users of eachother. 1326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool QUsesP = PairableInstUsers.count(ValuePair(P.first, Q.first)) || 1327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.first, Q.second)) || 1328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.first)) || 1329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.second)); 1330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool PUsesQ = PairableInstUsers.count(ValuePair(Q.first, P.first)) || 1331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.first, P.second)) || 1332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.first)) || 1333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.second)); 1334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PairableInstUserMap) { 1335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: The expensive part of the cycle check is not so much the cycle 1336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // check itself but this edge insertion procedure. This needs some 1337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // profiling and probably a different data structure (same is true of 1338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // most uses of std::multimap). 1339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PUsesQ) { 1340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap->equal_range(Q); 1341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(P, QPairRange)) 1342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(Q, P)); 1343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (QUsesP) { 1345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair PPairRange = PairableInstUserMap->equal_range(P); 1346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isSecondInIteratorPair(Q, PPairRange)) 1347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(P, Q)); 1348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (QUsesP && PUsesQ); 1352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function walks the use graph of current pairs to see if, starting 1355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // from P, the walk returns to P. 1356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairWillFormCycle(ValuePair P, 1357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs) { 1359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: starting cycle check for : " << *P.first << " <-> " 1361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *P.second << "\n"); 1362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A lookup table of visisted pairs is kept because the PairableInstUserMap 1363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contains non-direct associations. 1364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> Visited; 136535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePair, 32> Q; 1366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(P); 136835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 136935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePair QTop = Q.pop_back_val(); 1370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Visited.insert(QTop); 1371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: cycle check visiting: " << *QTop.first << " <-> " 1374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *QTop.second << "\n"); 1375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); 1376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator C = QPairRange.first; 1377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != QPairRange.second; ++C) { 1378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C->second == P) { 1379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() 1380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << "BBV: rejected to prevent non-trivial cycle formation: " 1381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *C->first.first << " <-> " << *C->first.second << "\n"); 1382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 13850b2500c504156c45cd71817a9ef6749b6cde5703David Blaikie if (CurrentPairs.count(C->second) && !Visited.count(C->second)) 1386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(C->second); 1387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 138835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds the initial tree of connected pairs with the 1394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair J at the root. 1395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildInitialTreeFor( 1396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J) { 1402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Each of these pairs is viewed as the root node of a Tree. The Tree 1403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is then walked (depth-first). As this happens, we keep track of 1404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pairs that compose the Tree and the maximum depth of the Tree. 140535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 140835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 1409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePairWithDepth QTop = Q.back(); 1410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Push each child onto the queue: 1412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool MoreChildren = false; 1413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxChildDepth = QTop.second; 1414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); 1415478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator k = qtRange.first; 1416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel k != qtRange.second; ++k) { 1417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make sure that this child pair is still a candidate: 1418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsStillCand = false; 1419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair checkRange = 1420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.equal_range(k->second.first); 1421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator m = checkRange.first; 1422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel m != checkRange.second; ++m) { 1423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m->second == k->second.second) { 1424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsStillCand = true; 1425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsStillCand) { 1430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(k->second); 1431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) { 1432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t d = getDepthFactor(k->second.first); 1433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(k->second, QTop.second+d)); 1434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MoreChildren = true; 1435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxChildDepth = std::max(MaxChildDepth, C->second); 1437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!MoreChildren) { 1442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Record the current pair as part of the Tree: 1443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Tree.insert(ValuePairWithDepth(QTop.first, MaxChildDepth)); 1444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.pop_back(); 1445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 144635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1447de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1448de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1449de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given some initial tree, prune it by removing conflicting pairs (pairs 1450de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that cannot be simultaneously chosen for vectorization). 1451de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::pruneTreeFor( 1452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1453de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1455de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1457de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 1459de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 1460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 146135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1463de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 146435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 146535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePairWithDepth QTop = Q.pop_back_val(); 1466de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree.insert(QTop.first); 1467de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Visit each child, pruning as necessary... 146943ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop DenseMap<ValuePair, size_t> BestChildren; 1470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QTopRange = ConnectedPairs.equal_range(QTop.first); 1471478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator K = QTopRange.first; 1472de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != QTopRange.second; ++K) { 1473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(K->second); 1474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) continue; 1475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child is in the Tree, now we need to make sure it is the 1477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // best of any conflicting children. There could be multiple 1478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflicting children, so first, determine if we're keeping 1479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // this child, then delete conflicting children as necessary. 1480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // It is also necessary to guard against pairing-induced 1482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // dependencies. Consider instructions a .. x .. y .. b 1483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // such that (a,b) are to be fused and (x,y) are to be fused 1484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but a is an input to x and b is an output from y. This 1485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // means that y cannot be moved after b but x must be moved 1486de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after b for (a,b) to be fused. In other words, after 1487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fusing (a,b) we have y .. a/b .. x where y is an input 1488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to a/b and x is an output to a/b: x and y can no longer 1489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be legally fused. To prevent this condition, we must 1490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // make sure that a child pair added to the Tree is not 1491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both an input and output of an already-selected pair. 1492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Pairing-induced dependencies can also form from more complicated 1494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // cycles. The pair vs. pair conflicts are easy to check, and so 1495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that is done explicitly for "fast rejection", and because for 1496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // child vs. child conflicts, we may prefer to keep the current 1497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in preference to the already-selected child. 1498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> CurrentPairs; 1499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool CanAdd = true; 1501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 150243ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->second >= C->second) { 1511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Even worse, this child could conflict with another node already 1521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // selected for the Tree. If that is the case, ignore this child. 1522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator T = PrunedTree.begin(), 1523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = PrunedTree.end(); T != E2; ++T) { 1524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T->first == C->first.first || 1525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->first == C->first.second || 1526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.first || 1527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.second || 1528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(*T, C->first, PairableInstUsers, 1529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*T); 1535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // And check the queue too... 153935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel for (SmallVector<ValuePairWithDepth, 32>::iterator C2 = Q.begin(), 1540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = Q.end(); C2 != E2; ++C2) { 1541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1543de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1544de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1546de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1547de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1548de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1552de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1553de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1554de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1555de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Last but not least, check for a conflict with any of the 1556de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // already-chosen pairs. 1557de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C2 = 1558de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.begin(), E2 = ChosenPairs.end(); 1559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C2, C->first, PairableInstUsers, 1561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1563de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*C2); 1567de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 15701230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // To check for non-trivial cycles formed by the addition of the 15711230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // current pair we've formed a list of all relevant pairs, now use a 15721230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // graph walk to check for a cycle. We start from the current pair and 15731230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // walk the use tree to see if we again reach the current pair. If we 15741230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // do, then the current pair is rejected. 1575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: It may be more efficient to use a topological-ordering 1577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // algorithm to improve the cycle check. This should be investigated. 1578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(C->first, PairableInstUserMap, CurrentPairs)) 1580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1582de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child can be added, but we may have chosen it in preference 1583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to an already-selected child. Check for this here, and if a 1584de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict is found, then remove the previously-selected child 1585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // before adding this one in its place. 1586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C2 158743ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(); C2 != BestChildren.end();) { 1588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers)) 159343ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop BestChildren.erase(C2++); 1594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++C2; 1596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 159843ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop BestChildren.insert(ValuePairWithDepth(C->first, C->second)); 1599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<ValuePair, size_t>::iterator C 160243ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != E2; ++C) { 1604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t DepthF = getDepthFactor(C->first.first); 1605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(C->first, QTop.second+DepthF)); 1606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 160735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function finds the best tree of mututally-compatible connected 1611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairs, given the choice of root pairs as an iterator range. 1612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::findBestTreeFor( 1613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 161465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 1615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 161686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 161786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 161986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 1620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 162465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 1625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 1626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator J = ChoiceRange.first; 1627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J != ChoiceRange.second; ++J) { 1628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before going any further, make sure that this pair does not 1630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict with any already-selected pairs (see comment below 1631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // near the Tree pruning for more details). 1632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> ChosenPairSet; 1633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool DoesConflict = false; 1634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C = ChosenPairs.begin(), 1635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); C != E; ++C) { 1636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C, *J, PairableInstUsers, 1637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck ? &PairableInstUserMap : 0)) { 1638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DoesConflict = true; 1639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairSet.insert(*C); 1643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (DoesConflict) continue; 1645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(*J, PairableInstUserMap, ChosenPairSet)) 1648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> Tree; 1651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel buildInitialTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, ChosenPairs, Tree, *J); 1653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Because we'll keep the child with the largest depth, the largest 1655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depth is still the same in the unpruned Tree. 1656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxDepth = Tree.lookup(*J); 1657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "BBV: found Tree for pair {" 1659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << Tree.size() << "\n"); 1661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // At this point the Tree has been constructed, but, may contain 1663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contradictory children (meaning that different children of 1664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some tree node may be attempting to fuse the same instruction). 1665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // So now we walk the tree again, in the case of a conflict, 1666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // keep only the child with the largest depth. To break a tie, 1667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // favor the first child. 1668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> PrunedTree; 1670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pruneTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, Tree, 1672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree, *J, UseCycleCheck); 1673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 167465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int EffSize = 0; 167565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VTTI) { 167678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DenseSet<Value *> PrunedTreeInstrs; 167778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 167878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel E = PrunedTree.end(); S != E; ++S) { 167978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel PrunedTreeInstrs.insert(S->first); 168078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel PrunedTreeInstrs.insert(S->second); 168178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 168278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 168378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The set of pairs that have already contributed to the total cost. 168478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DenseSet<ValuePair> IncomingPairs; 168578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 168686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // The node weights represent the cost savings associated with 168786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // fusing the pair of instructions. 168865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 168965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) { 169078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool FlipOrder = false; 169178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 169278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (getDepthFactor(S->first)) { 169378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = CandidatePairCostSavings.find(*S)->second; 169478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tweight {" 169578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *S->first << " <-> " << *S->second << "} = " << 169678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 169778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize += ESContrib; 169878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 169986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 170078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The edge weights contribute in a negative sense: they represent 170178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // the cost of shuffles. 170286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel VPPIteratorPair IP = ConnectedPairDeps.equal_range(*S); 170386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if (IP.first != ConnectedPairDeps.end()) { 170486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 170586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 170686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Q != IP.second; ++Q) { 170778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!PrunedTree.count(Q->second)) 170878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 170986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 171086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 171186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 171286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 171386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if (R->second == PairConnectionDirect) 171486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsDirect; 171586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel else if (R->second == PairConnectionSwap) 171686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsSwap; 171786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 171886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 171986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // If there are more swaps than direct connections, then 172086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // the pair order will be flipped during fusion. So the real 172186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // number of swaps is the minimum number. 172278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel FlipOrder = !FixedOrderPairs.count(*S) && 172386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ((NumDepsSwap > NumDepsDirect) || 172486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel FixedOrderPairs.count(ValuePair(S->second, S->first))); 172586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 172686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 172786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Q != IP.second; ++Q) { 172878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!PrunedTree.count(Q->second)) 172978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 173086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 173186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 173286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 173386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 173486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Type *Ty1 = Q->second.first->getType(), 173586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel *Ty2 = Q->second.second->getType(); 173686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 173786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if ((R->second == PairConnectionDirect && FlipOrder) || 173886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel (R->second == PairConnectionSwap && !FlipOrder) || 173978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel R->second == PairConnectionSplat) { 174078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 174178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 174278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 174378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Q->second.first << " <-> " << *Q->second.second << 174478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel "} -> {" << 174578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << " <-> " << *S->second << "} = " << 174678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 174778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 174878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 174978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 175078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 175178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 175278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of outgoing edges. We assume that edges outgoing 175378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // to shuffles, inserts or extracts can be merged, and so contribute 175478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // no additional cost. 175578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!S->first->getType()->isVoidTy()) { 175678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = S->first->getType(), 175778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = S->second->getType(); 175878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 175978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 176078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool NeedsExtraction = false; 176178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (Value::use_iterator I = S->first->use_begin(), 176278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IE = S->first->use_end(); I != IE; ++I) { 176378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (isa<ShuffleVectorInst>(*I) || 176478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(*I) || 176578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<ExtractElementInst>(*I)) 176678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 176778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTreeInstrs.count(*I)) 176878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 176978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 177078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 177178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 177278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 177378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 177478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 177578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty1->isVectorTy()) 177678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 177778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty1, VTy); 177878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel else 177978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) VTTI->getVectorInstrCost( 178078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 0); 178178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 178278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 178378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << "} = " << ESContrib << "\n"); 178478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 178578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 178678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 178778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = false; 178878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (Value::use_iterator I = S->second->use_begin(), 178978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IE = S->second->use_end(); I != IE; ++I) { 179078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (isa<ShuffleVectorInst>(*I) || 179178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(*I) || 179278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<ExtractElementInst>(*I)) 179378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 179478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTreeInstrs.count(*I)) 179578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 179678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 179778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 179878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 179978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 180078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 180178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 180278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty2->isVectorTy()) 180378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 180478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty2, VTy); 180578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel else 180678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) VTTI->getVectorInstrCost( 180778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 1); 180878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 180978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->second << "} = " << ESContrib << "\n"); 181078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 181178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 181278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 181378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 181478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of incoming edges. 181578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!isa<LoadInst>(S->first) && !isa<StoreInst>(S->first)) { 181678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction *S1 = cast<Instruction>(S->first), 181778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S2 = cast<Instruction>(S->second); 181878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (unsigned o = 0; o < S1->getNumOperands(); ++o) { 181978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Value *O1 = S1->getOperand(o), *O2 = S2->getOperand(o); 182078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 182178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining constants into vector constants (or small vector 182278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // constants into larger ones are assumed free). 182378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (isa<Constant>(O1) && isa<Constant>(O2)) 182478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 182578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 182678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (FlipOrder) 182778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(O1, O2); 182878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 182978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VP = ValuePair(O1, O2); 183078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VPR = ValuePair(O2, O1); 183178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 183278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Internal edges are not handled here. 183378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTree.count(VP) || PrunedTree.count(VPR)) 183478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 183578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 183678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = O1->getType(), 183778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = O2->getType(); 183878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 183978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 184078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining vector operations of the same type is also assumed 184178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // folded with other operations. 184278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty1 == Ty2 && 184378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel (isa<ShuffleVectorInst>(O1) || 184478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(O1) || 184578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(O1)) && 184678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel (isa<ShuffleVectorInst>(O2) || 184778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(O2) || 184878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel isa<InsertElementInst>(O2))) 184978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 185078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 185178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 185278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // This pair has already been formed. 185378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (IncomingPairs.count(VP)) { 185478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 185578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (IncomingPairs.count(VPR)) { 185678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 185778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 185878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy() && !Ty2->isVectorTy()) { 185978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) VTTI->getVectorInstrCost( 186078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 0); 186178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) VTTI->getVectorInstrCost( 186278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 1); 186378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy()) { 186478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O1 needs to be inserted into a vector of size O2, and then 186578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 186678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) VTTI->getVectorInstrCost( 186778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty2, 0); 186878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 186978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty2); 187078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty2->isVectorTy()) { 187178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O2 needs to be inserted into a vector of size O1, and then 187278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 187378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) VTTI->getVectorInstrCost( 187478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty1, 0); 187578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 187678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty1); 187778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else { 187878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *TyBig = Ty1, *TySmall = Ty2; 187978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty2->getVectorNumElements() > Ty1->getVectorNumElements()) 188078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(TyBig, TySmall); 188178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 188278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 188378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, TyBig); 188478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (TyBig != TySmall) 188578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 188678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel TyBig, TySmall); 188778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 188878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 188978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" 189078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *O1 << " <-> " << *O2 << "} = " << 189178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 189278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 189378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IncomingPairs.insert(VP); 189486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 189586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 189665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 189765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 189865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 189965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) 190065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize += (int) getDepthFactor(S->first); 190165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 1902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) 1904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: found pruned Tree for pair {" 1905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << PrunedTree.size() << 1907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " (effective size: " << EffSize << ")\n"); 190878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (((VTTI && !UseChainDepthWithTI) || 190978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel MaxDepth >= Config.ReqChainDepth) && 191065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize > 0 && EffSize > BestEffSize) { 1911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestMaxDepth = MaxDepth; 1912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestEffSize = EffSize; 1913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree = PrunedTree; 1914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given the list of candidate pairs, this function selects those 1919de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that will be fused into vector instructions. 1920de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::choosePairs( 1921de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 192265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 1923de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 192486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 192586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 192786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 1928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1929de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs) { 1930bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UseCycleCheck = 1931bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng CandidatePairs.size() <= Config.MaxCandPairsForCycleCheck; 1932de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> PairableInstUserMap; 1933de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator I = PairableInsts.begin(), 1934de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PairableInsts.end(); I != E; ++I) { 1935de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The number of possible pairings for this variable: 1936de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t NumChoices = CandidatePairs.count(*I); 1937de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!NumChoices) continue; 1938de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1939de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair ChoiceRange = CandidatePairs.equal_range(*I); 1940de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1941de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The best pair to choose and its tree: 194265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel size_t BestMaxDepth = 0; 194365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int BestEffSize = 0; 1944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> BestTree; 194565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel findBestTreeFor(CandidatePairs, CandidatePairCostSavings, 194686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 194786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 1948de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, PairableInstUserMap, ChosenPairs, 1949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree, BestMaxDepth, BestEffSize, ChoiceRange, 1950de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck); 1951de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1952de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A tree has been chosen (or not) at this point. If no tree was 1953de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chosen, then this instruction, I, cannot be paired (and is no longer 1954de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // considered). 1955de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1956de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (BestTree.size() > 0) 1957de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: selected pairs in the best tree for: " 1958de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *cast<Instruction>(*I) << "\n"); 1959de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1960de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator S = BestTree.begin(), 1961de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE2 = BestTree.end(); S != SE2; ++S) { 1962de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Insert the members of this tree into the list of chosen pairs. 1963de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(ValuePair(S->first, S->second)); 1964de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected pair: " << *S->first << " <-> " << 1965de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *S->second << "\n"); 1966de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1967de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove all candidate pairs that have values in the chosen tree. 1968de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator K = 1969de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.begin(); K != CandidatePairs.end();) { 1970de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->first == S->first || K->second == S->first || 1971de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->second == S->second || K->first == S->second) { 1972de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Don't remove the actual pair chosen so that it can be used 1973de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in subsequent tree selections. 1974de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(K->first == S->first && K->second == S->second)) 1975de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.erase(K++); 1976de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1977de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1978de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1979de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 1980de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1981de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1982de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1983de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1984de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1985de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected " << ChosenPairs.size() << " pairs.\n"); 1986de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1987de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1988de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::string getReplacementName(Instruction *I, bool IsInput, unsigned o, 1989de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned n = 0) { 1990de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!I->hasName()) 1991de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ""; 1992de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1993de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (I->getName() + (IsInput ? ".v.i" : ".v.r") + utostr(o) + 1994de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (n > 0 ? "." + utostr(n) : "")).str(); 1995de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1996de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the pointer input to the vector 1998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 1999de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementPointerInput(LLVMContext& Context, 2000202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *I, Instruction *J, unsigned o) { 2001de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 200265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 2003de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts; 2004282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2005202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel // Note: the analysis might fail here, that is why the pair order has 2006282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel // been precomputed (OffsetInElmts must be unused here). 2007de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 200865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 200993f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel OffsetInElmts, false); 2010de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2011de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The pointer value is taken to be the one with the lowest offset. 2012202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Value *VPtr = IPtr; 2013de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 201464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = cast<PointerType>(IPtr->getType())->getElementType(); 201564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = cast<PointerType>(JPtr->getType())->getElementType(); 201664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2017de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgPtrType = PointerType::get(VArgType, 2018de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<PointerType>(IPtr->getType())->getAddressSpace()); 2019de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BitCastInst(VPtr, VArgPtrType, getReplacementName(I, true, o), 2020202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel /* insert before */ I); 2021de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fillNewShuffleMask(LLVMContext& Context, Instruction *J, 202464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 202564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 202664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask) { 202764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElem1 = cast<VectorType>(J->getType())->getNumElements(); 202864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < NumElem1; ++v) { 2029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int m = cast<ShuffleVectorInst>(J)->getMaskValue(v); 2030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m < 0) { 2031de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = UndefValue::get(Type::getInt32Ty(Context)); 2032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned mm = m + (int) IdxOffset; 203464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (m >= (int) NumInElem1) 2035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel mm += (int) NumInElem; 2036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = 2038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt::get(Type::getInt32Ty(Context), mm); 2039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2042de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2043de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the vector-shuffle mask to the 2044de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector instruction that fuses I with J. 2045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementShuffleMask(LLVMContext& Context, 2046de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the shuffle mask. We need to append the second 2048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // mask to the first, and the numbers need to be adjusted. 2049de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 205064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 205164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 205264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 205364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 205464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElemI = cast<VectorType>(ArgTypeI)->getNumElements(); 2055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Get the total number of elements in the fused vector type. 2057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // By definition, this must equal the number of elements in 2058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the final mask. 2059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem = cast<VectorType>(VArgType)->getNumElements(); 2060de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(NumElem); 2061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 206264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeI = I->getOperand(0)->getType(); 206364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemI = cast<VectorType>(OpTypeI)->getNumElements(); 206464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeJ = J->getOperand(0)->getType(); 206564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemJ = cast<VectorType>(OpTypeJ)->getNumElements(); 206664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 206764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The fused vector will be: 206864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 206964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // | NumInElemI | NumInElemJ | NumInElemI | NumInElemJ | 207064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 207164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // from which we'll extract NumElem total elements (where the first NumElemI 207264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // of them come from the mask in I and the remainder come from the mask 207364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // in J. 2074de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2075de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the first pair... 207664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, I, 0, NumInElemJ, NumInElemI, 207764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 0, Mask); 2078de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2079de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the second pair... 208064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, J, NumElemI, NumInElemI, NumInElemJ, 208164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NumInElemI, Mask); 2082de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2083de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ConstantVector::get(Mask); 2084de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2085de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 208664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::expandIEChain(LLVMContext& Context, Instruction *I, 208764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *J, unsigned o, Value *&LOp, 208864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL, 208964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL, Type *ArgTypeH, 209072465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ, unsigned IdxOff) { 209164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ExpandedIEChain = false; 209264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (InsertElementInst *LIE = dyn_cast<InsertElementInst>(LOp)) { 209364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If we have a pure insertelement chain, then this can be rewritten 209464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // into a chain that directly builds the larger type. 209564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool PureChain = true; 209664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 209764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 209864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(LIENext->getOperand(0)) && 209964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel !isa<InsertElementInst>(LIENext->getOperand(0))) { 210064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PureChain = false; 210164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 210264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 210364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 210464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 210564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 210664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (PureChain) { 210764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<Value *, 8> VectElemts(numElemL, 210864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(ArgTypeL->getScalarType())); 210964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 211064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 211164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = 211264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LIENext->getOperand(2))->getSExtValue(); 211364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectElemts[Idx] = LIENext->getOperand(1); 211464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 211564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 211664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 211764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = 0; 211864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LIEPrev = UndefValue::get(ArgTypeH); 211964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 212064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<UndefValue>(VectElemts[i])) continue; 212164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = InsertElementInst::Create(LIEPrev, VectElemts[i], 212264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 212364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel i + IdxOff), 212472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 212572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, i+1)); 212672465ea23d010507d3746adc126d719005981e05Hal Finkel LIENext->insertBefore(IBeforeJ ? J : I); 212764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIEPrev = LIENext; 212864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 212964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 213064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = LIENext ? (Value*) LIENext : UndefValue::get(ArgTypeH); 213164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExpandedIEChain = true; 213264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 213364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 213464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 213564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return ExpandedIEChain; 213664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 213764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value to be used as the specified operand of the vector 2139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 2140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementInput(LLVMContext& Context, Instruction *I, 214172465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ) { 2142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 2144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 214564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Compute the fused vector type for this operand 214664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getOperand(o)->getType(); 214764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getOperand(o)->getType(); 214864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *L = I, *H = J; 215164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL = ArgTypeI, *ArgTypeH = ArgTypeJ; 2152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 215364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL; 215464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeL->isVectorTy()) 215564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = cast<VectorType>(ArgTypeL)->getNumElements(); 215664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 215764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = 1; 2158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 215964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemH; 216064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeH->isVectorTy()) 216164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = cast<VectorType>(ArgTypeH)->getNumElements(); 216264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 216364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = 1; 216464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 216564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LOp = L->getOperand(o); 216664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *HOp = H->getOperand(o); 216764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VArgType->getNumElements(); 216864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 216964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // First, we check if we can reuse the "original" vector outputs (if these 217064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // exist). We might need a shuffle. 217164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *LEE = dyn_cast<ExtractElementInst>(LOp); 217264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *HEE = dyn_cast<ExtractElementInst>(HOp); 217364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *LSV = dyn_cast<ShuffleVectorInst>(LOp); 217464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *HSV = dyn_cast<ShuffleVectorInst>(HOp); 217564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 217664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // FIXME: If we're fusing shuffle instructions, then we can't apply this 217764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // optimization. The input vectors to the shuffle might be a different 217864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // length from the shuffle outputs. Unfortunately, the replacement 217964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // shuffle mask has already been formed, and the mask entries are sensitive 218064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // to the sizes of the inputs. 218164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool IsSizeChangeShuffle = 218264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel isa<ShuffleVectorInst>(L) && 218364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (LOp->getType() != L->getType() || HOp->getType() != H->getType()); 218464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 218564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if ((LEE || LSV) && (HEE || HSV) && !IsSizeChangeShuffle) { 218664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We can have at most two unique vector inputs. 218764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool CanUseInputs = true; 218864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I1, *I2 = 0; 218964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 219064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LEE->getOperand(0); 219164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 219264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LSV->getOperand(0); 219364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = LSV->getOperand(1); 219464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I2 == I1 || isa<UndefValue>(I2)) 219564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = 0; 219664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 219764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 219864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 219964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HEE->getOperand(0); 220064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 220164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 220264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 220364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 220464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 220564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HSV->getOperand(0); 220664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 220764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 220864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 220964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 221064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 221164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 221264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I4 = HSV->getOperand(1); 221364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(I4)) { 221464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I4 != I1) 221564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I4; 221664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I4 != I1 && I4 != I2) 221764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 221864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 221964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 222064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 222164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 222264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 222364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned LOpElem = 222464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(LOp)->getOperand(0)->getType()) 222564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 222664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned HOpElem = 222764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(HOp)->getOperand(0)->getType()) 222864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 222964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 223064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We have one or two input vectors. We need to map each index of the 223164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // operands to the index of the original vector. 223264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<std::pair<int, int>, 8> II(numElem); 223364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 223464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 223564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 223664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 223764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LEE->getOperand(1))->getSExtValue(); 223864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LEE->getOperand(0) == I1 ? 0 : 1; 223964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 224064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = LSV->getMaskValue(i); 224164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) LOpElem) { 224264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(0) == I1 ? 0 : 1; 224364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 224464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= LOpElem; 224564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(1) == I1 ? 0 : 1; 224664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 224764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 224864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 224964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i] = std::pair<int, int>(Idx, INum); 225064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 225164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemH; ++i) { 225264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 225364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 225464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 225564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(HEE->getOperand(1))->getSExtValue(); 225664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HEE->getOperand(0) == I1 ? 0 : 1; 225764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 225864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = HSV->getMaskValue(i); 225964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) HOpElem) { 226064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(0) == I1 ? 0 : 1; 226164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 226264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= HOpElem; 226364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(1) == I1 ? 0 : 1; 226464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 226564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 226664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 226764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i + numElemL] = std::pair<int, int>(Idx, INum); 226864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 226964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 227064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We now have an array which tells us from which index of which 227164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // input vector each element of the operand comes. 227264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I1T = cast<VectorType>(I1->getType()); 227364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I1Elem = I1T->getNumElements(); 227464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 227564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2) { 227664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // In this case there is only one underlying vector input. Check for 227764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // the trivial case where we can use the input directly. 227864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem == numElem) { 227964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ElemInOrder = true; 228064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 228164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[i].first != (int) i && II[i].first != -1) { 228264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ElemInOrder = false; 228364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 228464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 228564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 228664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 228764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ElemInOrder) 228864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return I1; 228964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 229064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 229164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // A shuffle is needed. 229264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 229364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 229464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[i].first; 229564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx == -1) 229664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = UndefValue::get(Type::getInt32Ty(Context)); 229764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 229864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 229964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 230064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 230164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 230264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 230364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 230472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 230572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 230672465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 230764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 230864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 230964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 231064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I2T = cast<VectorType>(I2->getType()); 231164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I2Elem = I2T->getNumElements(); 231264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 231364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This input comes from two distinct vectors. The first step is to 231464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // make sure that both vectors are the same length. If not, the 231564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // smaller one will need to grow before they can be shuffled together. 231664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem < I2Elem) { 231764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I2Elem); 231864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 231964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 232064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 232164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 232264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 232364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 232464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI1 = 232564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 232664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 232772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 232872465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 232972465ea23d010507d3746adc126d719005981e05Hal Finkel NewI1->insertBefore(IBeforeJ ? J : I); 233064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = NewI1; 233164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1T = I2T; 233264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1Elem = I2Elem; 233364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (I1Elem > I2Elem) { 233464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I1Elem); 233564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 233664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 233764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 233864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 233964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 234064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 234164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI2 = 234264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I2, UndefValue::get(I2T), 234364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 234472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 234572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 234672465ea23d010507d3746adc126d719005981e05Hal Finkel NewI2->insertBefore(IBeforeJ ? J : I); 234764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = NewI2; 234864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2T = I1T; 234964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2Elem = I1Elem; 235064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 235164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 235264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Now that both I1 and I2 are the same length we can shuffle them 235364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // together (and use the result). 235464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 235564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 235664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[v].first == -1) { 235764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 235864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 235964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[v].first + II[v].second * I1Elem; 236064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 236164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 236264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 236364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 236464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewOp = 236564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, I2, ConstantVector::get(Mask), 236672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 236772465ea23d010507d3746adc126d719005981e05Hal Finkel NewOp->insertBefore(IBeforeJ ? J : I); 236864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return NewOp; 236964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 237264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgType = ArgTypeL; 237364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL < numElemH) { 237464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL == 1 && expandIEChain(Context, I, J, o, HOp, numElemH, 237572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, VArgType, IBeforeJ, 1)) { 237664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This is another short-circuit case: we're combining a scalar into 237764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // a vector that is formed by an IE chain. We've just expanded the IE 237864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // chain, now insert the scalar and we're done. 237964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 238064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = InsertElementInst::Create(HOp, LOp, CV0, 238172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 238272465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 238364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 238464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, LOp, numElemL, ArgTypeL, 238572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, IBeforeJ)) { 238664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The two vector inputs to the shuffle must be the same length, 238764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // so extend the smaller vector to be the same length as the larger one. 238864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NLOp; 238964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL > 1) { 239064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 239164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemH); 239264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 239364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 239464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 239564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 239664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 239764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 239864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = new ShuffleVectorInst(LOp, UndefValue::get(ArgTypeL), 239964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 240072465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 240172465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 240264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 240364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = InsertElementInst::Create(UndefValue::get(ArgTypeH), LOp, CV0, 240472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 240572465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 240664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 240764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 240872465ea23d010507d3746adc126d719005981e05Hal Finkel NLOp->insertBefore(IBeforeJ ? J : I); 240964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = NLOp; 241064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 241264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ArgType = ArgTypeH; 241364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (numElemL > numElemH) { 241464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH == 1 && expandIEChain(Context, I, J, o, LOp, numElemL, 241572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, VArgType, IBeforeJ)) { 241664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 241764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst::Create(LOp, HOp, 241864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 241964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL), 242072465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 242172465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 242272465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 242364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 242464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, HOp, numElemH, ArgTypeH, 242572465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, IBeforeJ)) { 242664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NHOp; 242764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH > 1) { 242864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemL); 242964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 243064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 243164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 243264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 243364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 243464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 243564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = new ShuffleVectorInst(HOp, UndefValue::get(ArgTypeH), 243664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 243772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 243872465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 243964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 244064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = InsertElementInst::Create(UndefValue::get(ArgTypeL), HOp, CV0, 244172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 244272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 244364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 244464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 244572465ea23d010507d3746adc126d719005981e05Hal Finkel NHOp->insertBefore(IBeforeJ ? J : I); 244664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel HOp = NHOp; 2447de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 244864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2449de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 245064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgType->isVectorTy()) { 245164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = cast<VectorType>(VArgType)->getNumElements(); 245264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask(numElem); 245364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 245464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = v; 245564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If the low vector was expanded, we need to skip the extra 245664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // undefined entries. 245764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (v >= numElemL && numElemH > numElemL) 245864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx += (numElemH - numElemL); 245964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 246064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2461de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 246264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV = new ShuffleVectorInst(LOp, HOp, 246372465ea23d010507d3746adc126d719005981e05Hal Finkel ConstantVector::get(Mask), 246472465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 246572465ea23d010507d3746adc126d719005981e05Hal Finkel BV->insertBefore(IBeforeJ ? J : I); 2466de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 2467de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2469de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV1 = InsertElementInst::Create( 247064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(VArgType), LOp, CV0, 247172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 247272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 247372465ea23d010507d3746adc126d719005981e05Hal Finkel BV1->insertBefore(IBeforeJ ? J : I); 247464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV2 = InsertElementInst::Create(BV1, HOp, CV1, 247572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 247672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 2)); 247772465ea23d010507d3746adc126d719005981e05Hal Finkel BV2->insertBefore(IBeforeJ ? J : I); 2478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV2; 2479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates an array of values that will be used as the inputs 2482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to the vector instruction that fuses I with J. 2483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::getReplacementInputsForPair(LLVMContext& Context, 2484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, 248572465ea23d010507d3746adc126d719005981e05Hal Finkel SmallVector<Value *, 3> &ReplacedOperands, 248672465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ) { 2487de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned p = 0, o = NumOperands-1; p < NumOperands; ++p, --o) { 2490de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate backward so that we look at the store pointer 2491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first and know whether or not we need to flip the inputs. 2492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I) || (o == 1 && isa<StoreInst>(I))) { 2494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the pointer for a load/store instruction. 2495202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ReplacedOperands[o] = getReplacementPointerInput(Context, I, J, o); 2496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 24976173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (isa<CallInst>(I)) { 2498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = cast<CallInst>(I)->getCalledFunction(); 2499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned IID = F->getIntrinsicID(); 25006173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (o == NumOperands-1) { 25016173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel BasicBlock &BB = *I->getParent(); 2502bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 25036173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Module *M = BB.getParent()->getParent(); 250464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 250564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 250664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2507bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 25086173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = Intrinsic::getDeclaration(M, 25096173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel (Intrinsic::ID) IID, VArgType); 25106173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 25116173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (IID == Intrinsic::powi && o == 1) { 25126173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The second argument of powi is a single integer and we've already 25136173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // checked that both arguments are equal. As a result, we just keep 25146173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // I's second argument. 25156173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = I->getOperand(o); 25166173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 25176173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 2518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I) && o == NumOperands-1) { 2519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementShuffleMask(Context, I, J); 2520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 252372465ea23d010507d3746adc126d719005981e05Hal Finkel ReplacedOperands[o] = getReplacementInput(Context, I, J, o, IBeforeJ); 2524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates two values that represent the outputs of the 2528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // original I and J instructions. These are generally vector shuffles 2529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // or extracts. In many cases, these will end up being unused and, thus, 2530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // eliminated by later passes. 2531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 2532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 2533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2534202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K1, Instruction *&K2) { 2535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 2536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K); 2537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K); 2538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *IType = I->getType(); 254064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *JType = J->getType(); 254164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 254264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VType = getVecTypeForPair(IType, JType); 254364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VType->getNumElements(); 254464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 254564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemI, numElemJ; 254664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (IType->isVectorTy()) 254764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = cast<VectorType>(IType)->getNumElements(); 254864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 254964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = 1; 255064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 255164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) 255264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = cast<VectorType>(JType)->getNumElements(); 255364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 255464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = 1; 2555de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2556de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IType->isVectorTy()) { 255764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemI), Mask2(numElemI); 255864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemI; ++v) { 255964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 256064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemJ+v); 256164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 256364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K1 = new ShuffleVectorInst(K, UndefValue::get(VType), 2564202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask1), 256564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 1)); 2566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 256764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2568202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K1 = ExtractElementInst::Create(K, CV0, 2569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 257064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 257164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 257264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) { 257364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemJ), Mask2(numElemJ); 257464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemJ; ++v) { 257564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 257664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemI+v); 257764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 257864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 257964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K2 = new ShuffleVectorInst(K, UndefValue::get(VType), 2580202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask2), 258164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 2)); 258264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 258364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), numElem-1); 2584202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K2 = ExtractElementInst::Create(K, CV1, 2585de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 2586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1->insertAfter(K); 2589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2->insertAfter(K1); 2590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = K2; 2591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::canMoveUsesOfIAfterJ(BasicBlock &BB, 2596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2598de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2599ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J; ++L) 2604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet); 2605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(cast<Instruction>(L) == J && 2607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel "Tracking has not proceeded far enough to check for dependencies"); 2608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If J is now in the use set of I, then trackUsesOfI will return true 2609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and we have a dependency cycle (and the fusing operation must abort). 2610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSet); 2611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::moveUsesOfIAfterJ(BasicBlock &BB, 2615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2619ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J;) { 2624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet)) { 2625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move this instruction 2626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InstToMove = L; ++L; 2627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: moving: " << *InstToMove << 2629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " to after " << *InsertionPt << "\n"); 2630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->removeFromParent(); 2631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->insertAfter(InsertionPt); 2632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = InstToMove; 2633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++L; 2635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Collect all load instruction that are in the move set of a given first 2640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair member. These loads depend on the first instruction, I, and so need 2641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to be moved after J (the second instruction) when the pair is fused. 2642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectPairLoadMoveSet(BasicBlock &BB, 2643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I) { 2646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2647ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: We cannot end the loop when we reach J because J could be moved 2653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // farther down the use chain by another instruction pairing. Also, J 2654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be before I if this is an inverted input. 2655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator E = BB.end(); cast<Instruction>(L) != E; ++L) { 2656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L)) { 2657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (L->mayReadFromMemory()) 2658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(ValuePair(L, I)); 2659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // In cases where both load/stores and the computation of their pointers 2664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // are chosen for vectorization, we can end up in a situation where the 2665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // aliasing analysis starts returning different query results as the 2666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // process of fusing instruction pairs continues. Because the algorithm 2667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // relies on finding the same use trees here as were found earlier, we'll 2668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to precompute the necessary aliasing information here and then 2669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // manually update it during the fusion process. 2670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectLoadMoveSet(BasicBlock &BB, 2671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet) { 2674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 2675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PIE = PairableInsts.end(); PI != PIE; ++PI) { 2676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(*PI); 2677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) continue; 2678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first); 2680de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectPairLoadMoveSet(BB, ChosenPairs, LoadMoveSet, I); 2681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2684ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // When the first instruction in each pair is cloned, it will inherit its 2685ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // parent's metadata. This metadata must be combined with that of the other 2686ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // instruction in a safe way. 2687ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void BBVectorize::combineMetadata(Instruction *K, const Instruction *J) { 2688ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel SmallVector<std::pair<unsigned, MDNode*>, 4> Metadata; 2689ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->getAllMetadataOtherThanDebugLoc(Metadata); 2690ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel for (unsigned i = 0, n = Metadata.size(); i < n; ++i) { 2691ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel unsigned Kind = Metadata[i].first; 2692ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *JMD = J->getMetadata(Kind); 2693ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *KMD = Metadata[i].second; 2694ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2695ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel switch (Kind) { 2696ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel default: 2697ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, 0); // Remove unknown metadata 2698ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2699ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_tbaa: 2700ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericTBAA(JMD, KMD)); 2701ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2702ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_fpmath: 2703ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericFPMath(JMD, KMD)); 2704ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2705ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2706ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2707ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2708ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2709de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function fuses the chosen instruction pairs into vector instructions, 2710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // taking care preserve any needed scalar outputs and, then, it reorders the 2711de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // remaining instructions as needed (users of the first member of the pair 2712de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to be moved to after the location of the second member of the pair 2713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the vector instruction is inserted in the location of the pair's 2714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // second member). 2715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fuseChosenPairs(BasicBlock &BB, 2716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2717a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 271872465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 271972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 272072465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 272172465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps) { 2722de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LLVMContext& Context = BB.getContext(); 2723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2724de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // During the vectorization process, the order of the pairs to be fused 2725de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be flipped. So we'll add each pair, flipped, into the ChosenPairs 2726de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // list. After a pair is fused, the flipped pair is removed from the list. 272772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> FlippedPairs; 2728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator P = ChosenPairs.begin(), 2729de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); P != E; ++P) 273072465ea23d010507d3746adc126d719005981e05Hal Finkel FlippedPairs.insert(ValuePair(P->second, P->first)); 273172465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseSet<ValuePair>::iterator P = FlippedPairs.begin(), 2732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = FlippedPairs.end(); P != E; ++P) 2733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(*P); 2734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> LoadMoveSet; 2736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectLoadMoveSet(BB, PairableInsts, ChosenPairs, LoadMoveSet); 2737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: initial: \n" << BB << "\n"); 2739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator PI = BB.getFirstInsertionPt(); PI != BB.end();) { 2741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(PI); 2742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) { 2743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getDepthFactor(P->first) == 0) { 2748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // These instructions are not really fused, but are tracked as though 2749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // they are. Any case in which it would be interesting to fuse them 2750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // will be taken care of by InstCombine. 2751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first), 2757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *J = cast<Instruction>(P->second); 2758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing: " << *I << 2760de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 2761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove the pair and flipped pair from the list. 2763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator FP = ChosenPairs.find(P->second); 2764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(FP != ChosenPairs.end() && "Flipped pair not found in list"); 2765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(FP); 2766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(P); 2767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2768de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!canMoveUsesOfIAfterJ(BB, LoadMoveSet, I, J)) { 2769de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusion of: " << *I << 2770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << 2771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " aborted because of non-trivial dependency cycle\n"); 2772de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2773de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2774de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2777a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel // If the pair must have the other order, then flip it. 2778a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel bool FlipPairOrder = FixedOrderPairs.count(ValuePair(J, I)); 277972465ea23d010507d3746adc126d719005981e05Hal Finkel if (!FlipPairOrder && !FixedOrderPairs.count(ValuePair(I, J))) { 278072465ea23d010507d3746adc126d719005981e05Hal Finkel // This pair does not have a fixed order, and so we might want to 278172465ea23d010507d3746adc126d719005981e05Hal Finkel // flip it if that will yield fewer shuffles. We count the number 278272465ea23d010507d3746adc126d719005981e05Hal Finkel // of dependencies connected via swaps, and those directly connected, 278372465ea23d010507d3746adc126d719005981e05Hal Finkel // and flip the order if the number of swaps is greater. 278472465ea23d010507d3746adc126d719005981e05Hal Finkel bool OrigOrder = true; 278572465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairDeps.equal_range(ValuePair(I, J)); 278672465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first == ConnectedPairDeps.end()) { 278772465ea23d010507d3746adc126d719005981e05Hal Finkel IP = ConnectedPairDeps.equal_range(ValuePair(J, I)); 278872465ea23d010507d3746adc126d719005981e05Hal Finkel OrigOrder = false; 278972465ea23d010507d3746adc126d719005981e05Hal Finkel } 279072465ea23d010507d3746adc126d719005981e05Hal Finkel 279172465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first != ConnectedPairDeps.end()) { 279272465ea23d010507d3746adc126d719005981e05Hal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 279372465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 279472465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 279572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = 279672465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 279772465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 279872465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 279972465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 280072465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsDirect; 280172465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 280272465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsSwap; 280372465ea23d010507d3746adc126d719005981e05Hal Finkel } 280472465ea23d010507d3746adc126d719005981e05Hal Finkel 280572465ea23d010507d3746adc126d719005981e05Hal Finkel if (!OrigOrder) 280672465ea23d010507d3746adc126d719005981e05Hal Finkel std::swap(NumDepsDirect, NumDepsSwap); 280772465ea23d010507d3746adc126d719005981e05Hal Finkel 280872465ea23d010507d3746adc126d719005981e05Hal Finkel if (NumDepsSwap > NumDepsDirect) { 280972465ea23d010507d3746adc126d719005981e05Hal Finkel FlipPairOrder = true; 281072465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(dbgs() << "BBV: reordering pair: " << *I << 281172465ea23d010507d3746adc126d719005981e05Hal Finkel " <-> " << *J << "\n"); 281272465ea23d010507d3746adc126d719005981e05Hal Finkel } 281372465ea23d010507d3746adc126d719005981e05Hal Finkel } 281472465ea23d010507d3746adc126d719005981e05Hal Finkel } 2815282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2816202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *L = I, *H = J; 2817a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FlipPairOrder) 2818202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel std::swap(H, L); 2819202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel 282072465ea23d010507d3746adc126d719005981e05Hal Finkel // If the pair being fused uses the opposite order from that in the pair 282172465ea23d010507d3746adc126d719005981e05Hal Finkel // connection map, then we need to flip the types. 282272465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairs.equal_range(ValuePair(H, L)); 282372465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 282472465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 282572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = PairConnectionTypes.find(*Q); 282672465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 282772465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 282872465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 282972465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionSwap; 283072465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 283172465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionDirect; 283272465ea23d010507d3746adc126d719005981e05Hal Finkel } 283372465ea23d010507d3746adc126d719005981e05Hal Finkel 283472465ea23d010507d3746adc126d719005981e05Hal Finkel bool LBeforeH = !FlipPairOrder; 2835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> ReplacedOperands(NumOperands); 283772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementInputsForPair(Context, L, H, ReplacedOperands, 283872465ea23d010507d3746adc126d719005981e05Hal Finkel LBeforeH); 2839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make a copy of the original operation, change its type to the vector 2841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and replace its operands with the vector operands. 284272465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *K = L->clone(); 284372465ea23d010507d3746adc126d719005981e05Hal Finkel if (L->hasName()) 284472465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(L); 284572465ea23d010507d3746adc126d719005981e05Hal Finkel else if (H->hasName()) 284672465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(H); 2847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2848de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(K)) 2849202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K->mutateType(getVecTypeForPair(L->getType(), H->getType())); 2850de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 285172465ea23d010507d3746adc126d719005981e05Hal Finkel combineMetadata(K, H); 2852ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2853de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned o = 0; o < NumOperands; ++o) 2854de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->setOperand(o, ReplacedOperands[o]); 2855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2856de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->insertAfter(J); 2857de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instruction insertion point: 2859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InsertionPt = K; 2860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *K1 = 0, *K2 = 0; 2861202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel replaceOutputsOfPair(Context, L, H, K, InsertionPt, K1, K2); 2862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2863de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The use tree of the first original instruction must be moved to after 2864de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the location of the second instruction. The entire use tree of the 2865de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first instruction is disjoint from the input tree of the second 2866de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (by definition), and so commutes with it. 2867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel moveUsesOfIAfterJ(BB, LoadMoveSet, InsertionPt, I, J); 2869de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2870de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(I)) { 287172465ea23d010507d3746adc126d719005981e05Hal Finkel L->replaceAllUsesWith(K1); 287272465ea23d010507d3746adc126d719005981e05Hal Finkel H->replaceAllUsesWith(K2); 287372465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(L, K1); 287472465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(H, K2); 2875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2877de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instructions that may read from memory may be in the load move set. 2878de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Once an instruction is fused, we no longer need its move set, and so 2879de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the values of the map never need to be updated. However, when a load 2880de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is fused, we need to merge the entries from both instructions in the 2881de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in case those instructions were in the move set of some other 2882de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // yet-to-be-fused pair. The loads in question are the keys of the map. 2883de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->mayReadFromMemory()) { 2884de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> NewSetMembers; 2885de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = LoadMoveSet.equal_range(I); 2886de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet.equal_range(J); 2887de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = IPairRange.first; 2888de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != IPairRange.second; ++N) 2889de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 2890de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = JPairRange.first; 2891de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != JPairRange.second; ++N) 2892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 2893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator A = NewSetMembers.begin(), 2894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AE = NewSetMembers.end(); A != AE; ++A) 2895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(*A); 2896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before removing I, set the iterator to the next instruction. 2899de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PI = llvm::next(BasicBlock::iterator(I)); 2900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (cast<Instruction>(PI) == J) 2901de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(I); 2904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(J); 2905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->eraseFromParent(); 2906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->eraseFromParent(); 290772465ea23d010507d3746adc126d719005981e05Hal Finkel 290872465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(if (PrintAfterEveryPair) dbgs() << "BBV: block is now: \n" << 290972465ea23d010507d3746adc126d719005981e05Hal Finkel BB << "\n"); 2910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: final: \n" << BB << "\n"); 2913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 2915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelchar BBVectorize::ID = 0; 2917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic const char bb_vectorize_name[] = "Basic-Block Vectorization"; 2918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_BEGIN(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 2919de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_AG_DEPENDENCY(AliasAnalysis) 2920e29c19091cca58db668407dfc5dd86c70e8b3d49Hal FinkelINITIALIZE_PASS_DEPENDENCY(DominatorTree) 2921de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 2922de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_END(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 2923de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2924bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengBasicBlockPass *llvm::createBBVectorizePass(const VectorizeConfig &C) { 2925bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return new BBVectorize(C); 2926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 2927de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2928bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengbool 2929bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengllvm::vectorizeBasicBlock(Pass *P, BasicBlock &BB, const VectorizeConfig &C) { 2930bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize BBVectorizer(P, C); 293187825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return BBVectorizer.vectorizeBB(BB); 293287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng} 2933bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 2934bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng//===----------------------------------------------------------------------===// 2935bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengVectorizeConfig::VectorizeConfig() { 2936bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng VectorBits = ::VectorBits; 2937768edf3cd037aab10391abc279f71470df8e3156Hal Finkel VectorizeBools = !::NoBools; 293886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeInts = !::NoInts; 293986312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFloats = !::NoFloats; 2940f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizePointers = !::NoPointers; 294186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeCasts = !::NoCasts; 294286312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMath = !::NoMath; 294386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFMA = !::NoFMA; 2944fc3665c87519850f629c9565535e3be447e10addHal Finkel VectorizeSelect = !::NoSelect; 2945e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel VectorizeCmp = !::NoCmp; 2946f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizeGEP = !::NoGEP; 294786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMemOps = !::NoMemOps; 2948bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng AlignedOnly = ::AlignedOnly; 2949bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng ReqChainDepth= ::ReqChainDepth; 2950bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SearchLimit = ::SearchLimit; 2951bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxCandPairsForCycleCheck = ::MaxCandPairsForCycleCheck; 2952bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SplatBreaksChain = ::SplatBreaksChain; 2953bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxInsts = ::MaxInsts; 2954bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxIter = ::MaxIter; 295564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Pow2LenOnly = ::Pow2LenOnly; 2956bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng NoMemOpBoost = ::NoMemOpBoost; 2957bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng FastDep = ::FastDep; 2958bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng} 2959