BBVectorize.cpp revision da20ea696d8b24d89ae157106ddad2337296ed50
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 19d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Transforms/Vectorize.h" 20de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseMap.h" 21de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseSet.h" 22d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/ADT/STLExtras.h" 2386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel#include "llvm/ADT/SmallSet.h" 24de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/SmallVector.h" 25de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/Statistic.h" 26de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/StringExtras.h" 27de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasAnalysis.h" 28de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasSetTracker.h" 29e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel#include "llvm/Analysis/Dominators.h" 30de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolution.h" 31de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolutionExpressions.h" 32be04929f7fd76a921540e9901f24563e51dc1219Chandler Carruth#include "llvm/Analysis/TargetTransformInfo.h" 33de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ValueTracking.h" 340b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Constants.h" 350b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/DataLayout.h" 360b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/DerivedTypes.h" 370b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Function.h" 380b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Instructions.h" 390b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/IntrinsicInst.h" 400b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Intrinsics.h" 410b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/LLVMContext.h" 420b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Metadata.h" 430b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Type.h" 44d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Pass.h" 45de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/CommandLine.h" 46de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/Debug.h" 47de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/ValueHandle.h" 48d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Support/raw_ostream.h" 4964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel#include "llvm/Transforms/Utils/Local.h" 50de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <algorithm> 51de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <map> 52de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelusing namespace llvm; 53de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 5465309660fa61a837cc05323f69c618a7d8134d56Hal Finkelstatic cl::opt<bool> 5565309660fa61a837cc05323f69c618a7d8134d56Hal FinkelIgnoreTargetInfo("bb-vectorize-ignore-target-info", cl::init(false), 5665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cl::Hidden, cl::desc("Ignore target information")); 5765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 58de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 59de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelReqChainDepth("bb-vectorize-req-chain-depth", cl::init(6), cl::Hidden, 60de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The required chain depth for vectorization")); 61de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 6278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkelstatic cl::opt<bool> 6378fd353d5e5daedc47ecc31b6193ca48793c249cHal FinkelUseChainDepthWithTI("bb-vectorize-use-chain-depth", cl::init(false), 6478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel cl::Hidden, cl::desc("Use the chain depth requirement with" 6578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel " target information")); 6678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 67de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 68de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSearchLimit("bb-vectorize-search-limit", cl::init(400), cl::Hidden, 69de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum search distance for instruction pairs")); 70de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 71de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 72de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSplatBreaksChain("bb-vectorize-splat-breaks-chain", cl::init(false), cl::Hidden, 73de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Replicating one element to a pair breaks the chain")); 74de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 75de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 76de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelVectorBits("bb-vectorize-vector-bits", cl::init(128), cl::Hidden, 77de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The size of the native vector registers")); 78de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 79de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 80de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxIter("bb-vectorize-max-iter", cl::init(0), cl::Hidden, 81de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("The maximum number of pairing iterations")); 82de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 8364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkelstatic cl::opt<bool> 8464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal FinkelPow2LenOnly("bb-vectorize-pow2-len-only", cl::init(false), cl::Hidden, 8564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cl::desc("Don't try to form non-2^n-length vectors")); 8664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 87de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<unsigned> 885d4e18bc39fea892f523d960213906d296d3cb38Hal FinkelMaxInsts("bb-vectorize-max-instr-per-group", cl::init(500), cl::Hidden, 895d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel cl::desc("The maximum number of pairable instructions per group")); 905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 915d4e18bc39fea892f523d960213906d296d3cb38Hal Finkelstatic cl::opt<unsigned> 92de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxCandPairsForCycleCheck("bb-vectorize-max-cycle-check-pairs", cl::init(200), 93de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::Hidden, cl::desc("The maximum number of candidate pairs with which to use" 94de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " a full cycle check")); 95de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 96de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 97768edf3cd037aab10391abc279f71470df8e3156Hal FinkelNoBools("bb-vectorize-no-bools", cl::init(false), cl::Hidden, 98768edf3cd037aab10391abc279f71470df8e3156Hal Finkel cl::desc("Don't try to vectorize boolean (i1) values")); 99768edf3cd037aab10391abc279f71470df8e3156Hal Finkel 100768edf3cd037aab10391abc279f71470df8e3156Hal Finkelstatic cl::opt<bool> 101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoInts("bb-vectorize-no-ints", cl::init(false), cl::Hidden, 102de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize integer values")); 103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFloats("bb-vectorize-no-floats", cl::init(false), cl::Hidden, 106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point values")); 107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 108822ab00847da841a63be4e3883cb5f442dc69069Hal Finkel// FIXME: This should default to false once pointer vector support works. 109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 110822ab00847da841a63be4e3883cb5f442dc69069Hal FinkelNoPointers("bb-vectorize-no-pointers", cl::init(/*false*/ true), cl::Hidden, 111f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize pointer values")); 112f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 113f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoCasts("bb-vectorize-no-casts", cl::init(false), cl::Hidden, 115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize casting (conversion) operations")); 116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMath("bb-vectorize-no-math", cl::init(false), cl::Hidden, 119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point math intrinsics")); 120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFMA("bb-vectorize-no-fma", cl::init(false), cl::Hidden, 123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize the fused-multiply-add intrinsic")); 124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 126fc3665c87519850f629c9565535e3be447e10addHal FinkelNoSelect("bb-vectorize-no-select", cl::init(false), cl::Hidden, 127fc3665c87519850f629c9565535e3be447e10addHal Finkel cl::desc("Don't try to vectorize select instructions")); 128fc3665c87519850f629c9565535e3be447e10addHal Finkel 129fc3665c87519850f629c9565535e3be447e10addHal Finkelstatic cl::opt<bool> 130e415f96b6a43ac8861148a11a4258bc38c247e8fHal FinkelNoCmp("bb-vectorize-no-cmp", cl::init(false), cl::Hidden, 131e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel cl::desc("Don't try to vectorize comparison instructions")); 132e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel 133e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkelstatic cl::opt<bool> 134f3f5a1e6f77a842ccb24cc81766437da5197d712Hal FinkelNoGEP("bb-vectorize-no-gep", cl::init(false), cl::Hidden, 135f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize getelementptr instructions")); 136f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 137f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMemOps("bb-vectorize-no-mem-ops", cl::init(false), cl::Hidden, 139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize loads and stores")); 140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 141de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelAlignedOnly("bb-vectorize-aligned-only", cl::init(false), cl::Hidden, 143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Only generate aligned loads and stores")); 144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 146edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal FinkelNoMemOpBoost("bb-vectorize-no-mem-op-boost", 147edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::init(false), cl::Hidden, 148edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::desc("Don't boost the chain-depth contribution of loads and stores")); 149edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 150edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkelstatic cl::opt<bool> 151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelFastDep("bb-vectorize-fast-dep", cl::init(false), cl::Hidden, 152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Use a fast instruction dependency analysis")); 153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#ifndef NDEBUG 155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugInstructionExamination("bb-vectorize-debug-instruction-examination", 157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " instruction-examination process")); 160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCandidateSelection("bb-vectorize-debug-candidate-selection", 162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " candidate-selection process")); 165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugPairSelection("bb-vectorize-debug-pair-selection", 167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " pair-selection process")); 170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCycleCheck("bb-vectorize-debug-cycle-check", 172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " cycle-checking process")); 17572465ea23d010507d3746adc126d719005981e05Hal Finkel 17672465ea23d010507d3746adc126d719005981e05Hal Finkelstatic cl::opt<bool> 17772465ea23d010507d3746adc126d719005981e05Hal FinkelPrintAfterEveryPair("bb-vectorize-debug-print-after-every-pair", 17872465ea23d010507d3746adc126d719005981e05Hal Finkel cl::init(false), cl::Hidden, 17972465ea23d010507d3746adc126d719005981e05Hal Finkel cl::desc("When debugging is enabled, dump the basic block after" 18072465ea23d010507d3746adc126d719005981e05Hal Finkel " every pair is fused")); 181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#endif 182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSTATISTIC(NumFusedOps, "Number of operations fused by bb-vectorize"); 184de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelnamespace { 186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel struct BBVectorize : public BasicBlockPass { 187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static char ID; // Pass identification, replacement for typeid 188bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 189940371bc65570ec0add1ede4f4d9f0a41ba25e09Hongbin Zheng const VectorizeConfig Config; 190bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 191bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(const VectorizeConfig &C = VectorizeConfig()) 192bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel initializeBBVectorizePass(*PassRegistry::getPassRegistry()); 194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 196bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(Pass *P, const VectorizeConfig &C) 197bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 19887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &P->getAnalysis<AliasAnalysis>(); 199e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &P->getAnalysis<DominatorTree>(); 20087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &P->getAnalysis<ScalarEvolution>(); 2013574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = P->getAnalysisIfAvailable<DataLayout>(); 2028bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler Carruth TTI = IgnoreTargetInfo ? 0 : &P->getAnalysis<TargetTransformInfo>(); 20387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 20487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<Value *, Value *> ValuePair; 20665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel typedef std::pair<ValuePair, int> ValuePairWithCost; 207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, size_t> ValuePairWithDepth; 208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair 20972465ea23d010507d3746adc126d719005981e05Hal Finkel typedef std::pair<VPPair, unsigned> VPPairWithType; 210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<Value *, Value *>::iterator, 211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *>::iterator> VPIteratorPair; 212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, 213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair>::iterator> 214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair; 215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis *AA; 217e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DominatorTree *DT; 218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ScalarEvolution *SE; 2193574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow DataLayout *TD; 220abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth const TargetTransformInfo *TTI; 221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: const correct? 223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 22464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool vectorizePairs(BasicBlock &BB, bool NonPow2Len = false); 225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool getCandidatePairs(BasicBlock &BB, 2275d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 228de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 229a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 23065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 23164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len); 232de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 23378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // FIXME: The current implementation does not account for pairs that 23478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // are connected in multiple ways. For example: 23578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // C1 = A1 / A2; C2 = A2 / A1 (which may be both direct and a swap) 23672465ea23d010507d3746adc126d719005981e05Hal Finkel enum PairConnectionType { 23772465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionDirect, 23872465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSwap, 23972465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSplat 24072465ea23d010507d3746adc126d719005981e05Hal Finkel }; 24172465ea23d010507d3746adc126d719005981e05Hal Finkel 242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computeConnectedPairs(std::multimap<Value *, Value *> &CandidatePairs, 243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 24472465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 24572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes); 246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildDepMap(BasicBlock &BB, 248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers); 251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void choosePairs(std::multimap<Value *, Value *> &CandidatePairs, 25365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 25586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 25686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 257de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 25886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 259de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 260de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs); 261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fuseChosenPairs(BasicBlock &BB, 263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 264a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *>& ChosenPairs, 26572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 26672465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 26772465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 26872465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps); 26972465ea23d010507d3746adc126d719005981e05Hal Finkel 270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isInstVectorizable(Instruction *I, bool &IsSimpleLoadStore); 272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool areInstsCompatible(Instruction *I, Instruction *J, 27465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 275a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder); 276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool trackUsesOfI(DenseSet<Value *> &Users, 278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers = true, 280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet = 0); 2811230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void computePairsConnectedTo( 283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 28672465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P); 288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairsConflict(ValuePair P, ValuePair Q, 290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 291da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap = 0, 292da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> *PairableInstUserPairSet = 0); 293de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairWillFormCycle(ValuePair P, 295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUsers, 296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs); 297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 298de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void pruneTreeFor( 299de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 304da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 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, 328da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 33165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck); 333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementPointerInput(LLVMContext& Context, Instruction *I, 335202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *J, unsigned o); 336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fillNewShuffleMask(LLVMContext& Context, Instruction *J, 33864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 33964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 34064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask); 341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementShuffleMask(LLVMContext& Context, Instruction *I, 343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J); 344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 34564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool expandIEChain(LLVMContext& Context, Instruction *I, Instruction *J, 34664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned o, Value *&LOp, unsigned numElemL, 34772465ea23d010507d3746adc126d719005981e05Hal Finkel Type *ArgTypeL, Type *ArgTypeR, bool IBeforeJ, 34864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned IdxOff = 0); 34964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementInput(LLVMContext& Context, Instruction *I, 35172465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ); 352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void getReplacementInputsForPair(LLVMContext& Context, Instruction *I, 35472465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, SmallVector<Value *, 3> &ReplacedOperands, 35572465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ); 356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, Instruction *&K1, 360202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K2); 361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 362de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectPairLoadMoveSet(BasicBlock &BB, 363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I); 366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectLoadMoveSet(BasicBlock &BB, 368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet); 371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool canMoveUsesOfIAfterJ(BasicBlock &BB, 373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void moveUsesOfIAfterJ(BasicBlock &BB, 377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 381ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void combineMetadata(Instruction *K, const Instruction *J); 382ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 38387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng bool vectorizeBB(BasicBlock &BB) { 384e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel if (!DT->isReachableFromEntry(&BB)) { 385e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DEBUG(dbgs() << "BBV: skipping unreachable " << BB.getName() << 386e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel " in " << BB.getParent()->getName() << "\n"); 387e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel return false; 388e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel } 389e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel 390abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth DEBUG(if (TTI) dbgs() << "BBV: using target information\n"); 39165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool changed = false; 393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate a sufficient number of times to merge types of size 1 bit, 394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then 2 bits, then 4, etc. up to half of the target vector width of the 395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // target vector register. 39664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned n = 1; 39764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 2; 398abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth (TTI || v <= Config.VectorBits) && 39965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (!Config.MaxIter || n <= Config.MaxIter); 400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel v *= 2, ++n) { 401bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng DEBUG(dbgs() << "BBV: fusing loop #" << n << 402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " for " << BB.getName() << " in " << 403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BB.getParent()->getName() << "...\n"); 404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (vectorizePairs(BB)) 405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel changed = true; 406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 41064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (changed && !Pow2LenOnly) { 41164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ++n; 41264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; !Config.MaxIter || n <= Config.MaxIter; ++n) { 41364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel DEBUG(dbgs() << "BBV: fusing for non-2^n-length vectors loop #: " << 41464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel n << " for " << BB.getName() << " in " << 41564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel BB.getParent()->getName() << "...\n"); 41664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!vectorizePairs(BB, true)) break; 41764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 41864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 41964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: done!\n"); 421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return changed; 422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 42487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng virtual bool runOnBasicBlock(BasicBlock &BB) { 42587825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &getAnalysis<AliasAnalysis>(); 426e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DT = &getAnalysis<DominatorTree>(); 42787825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &getAnalysis<ScalarEvolution>(); 4283574eca1b02600bac4e625297f4ecf745f4c4f32Micah Villmow TD = getAnalysisIfAvailable<DataLayout>(); 4298bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler Carruth TTI = IgnoreTargetInfo ? 0 : &getAnalysis<TargetTransformInfo>(); 43087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 43187825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return vectorizeBB(BB); 43287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 43387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel virtual void getAnalysisUsage(AnalysisUsage &AU) const { 435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlockPass::getAnalysisUsage(AU); 436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<AliasAnalysis>(); 437e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel AU.addRequired<DominatorTree>(); 438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<ScalarEvolution>(); 4398bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler Carruth AU.addRequired<TargetTransformInfo>(); 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(); 4868b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel } else if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(I)) { 4878b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel T2 = SI->getOperand(0)->getType(); 4885094257518ea7b615d87ef5bea657625ffa81991Hal Finkel } else if (CmpInst *CI = dyn_cast<CmpInst>(I)) { 4895094257518ea7b615d87ef5bea657625ffa81991Hal Finkel T2 = CI->getOperand(0)->getType(); 49065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the weight associated with the provided value. A chain of 494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate pairs has a length given by the sum of the weights of its 495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // members (one weight per pair; the weight of each member of the pair 496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is assumed to be the same). This length is then compared to the 497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chain-length threshold to determine if a given chain is significant 498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // enough to be vectorized. The length is also used in comparing 499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate chains where longer chains are considered to be better. 500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: when this function returns 0, the resulting instructions are 501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // not actually fused. 502bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng inline size_t getDepthFactor(Value *V) { 503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // InsertElement and ExtractElement have a depth factor of zero. This is 504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // for two reasons: First, they cannot be usefully fused. Second, because 505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pass generates a lot of these, they can confuse the simple metric 506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // used to compare the trees in the next iteration. Thus, giving them a 507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // weight of zero allows the pass to essentially ignore them in 508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // subsequent iterations when looking for vectorization opportunities 509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // while still tracking dependency chains that flow through those 510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions. 511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<InsertElementInst>(V) || isa<ExtractElementInst>(V)) 512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 0; 513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 514edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // Give a load or store half of the required depth so that load/store 515edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // pairs will vectorize. 516bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (!Config.NoMemOpBoost && (isa<LoadInst>(V) || isa<StoreInst>(V))) 517bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return Config.ReqChainDepth/2; 518edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 1; 520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 522abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth // Returns the cost of the provided instruction using TTI. 52346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // This does not handle loads and stores. 52446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned getInstrCost(unsigned Opcode, Type *T1, Type *T2) { 52546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel switch (Opcode) { 52646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel default: break; 52746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::GetElementPtr: 52846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // We mark this instruction as zero-cost because scalar GEPs are usually 52946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // lowered to the intruction addressing mode. At the moment we don't 53046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // generate vector GEPs. 53146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 53246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Br: 533abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCFInstrCost(Opcode); 53446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PHI: 53546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 53646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Add: 53746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FAdd: 53846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Sub: 53946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FSub: 54046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Mul: 54146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FMul: 54246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UDiv: 54346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SDiv: 54446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FDiv: 54546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::URem: 54646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SRem: 54746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FRem: 54846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Shl: 54946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::LShr: 55046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::AShr: 55146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::And: 55246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Or: 55346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Xor: 554abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getArithmeticInstrCost(Opcode, T1); 55546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Select: 55646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ICmp: 55746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FCmp: 558abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCmpSelInstrCost(Opcode, T1, T2); 55946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ZExt: 56046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SExt: 56146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToUI: 56246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToSI: 56346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPExt: 56446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PtrToInt: 56546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::IntToPtr: 56646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SIToFP: 56746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UIToFP: 56846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Trunc: 56946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPTrunc: 57046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::BitCast: 57186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel case Instruction::ShuffleVector: 572abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCastInstrCost(Opcode, T1, T2); 57346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 57446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 57546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 1; 57646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 57746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This determines the relative offset of two loads or stores, returning 579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if the offset could be determined to be some constant value. 580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For example, if OffsetInElmts == 1, then J accesses the memory directly 581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after I; if OffsetInElmts == -1 then I accesses the memory 58264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // directly after J. 583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool getPairPtrInfo(Instruction *I, Instruction *J, 584de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *&IPtr, Value *&JPtr, unsigned &IAlignment, unsigned &JAlignment, 58565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned &IAddressSpace, unsigned &JAddressSpace, 58693f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel int64_t &OffsetInElmts, bool ComputeOffset = true) { 587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = 0; 58865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (LoadInst *LI = dyn_cast<LoadInst>(I)) { 58965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel LoadInst *LJ = cast<LoadInst>(J); 59065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = LI->getPointerOperand(); 59165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = LJ->getPointerOperand(); 59265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = LI->getAlignment(); 59365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = LJ->getAlignment(); 59465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = LI->getPointerAddressSpace(); 59565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = LJ->getPointerAddressSpace(); 596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 59765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel StoreInst *SI = cast<StoreInst>(I), *SJ = cast<StoreInst>(J); 59865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = SI->getPointerOperand(); 59965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = SJ->getPointerOperand(); 60065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = SI->getAlignment(); 60165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = SJ->getAlignment(); 60265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = SI->getPointerAddressSpace(); 60365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = SJ->getPointerAddressSpace(); 604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 60693f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel if (!ComputeOffset) 60793f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel return true; 60893f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel 609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *IPtrSCEV = SE->getSCEV(IPtr); 610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *JPtrSCEV = SE->getSCEV(JPtr); 611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If this is a trivial offset, then we'll get something like 613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // 1*sizeof(type). With target data, which we need anyway, this will get 614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // constant folded into a number. 615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV); 616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (const SCEVConstant *ConstOffSCEV = 617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dyn_cast<SCEVConstant>(OffsetSCEV)) { 618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt *IntOff = ConstOffSCEV->getValue(); 619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t Offset = IntOff->getSExtValue(); 620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VTy = cast<PointerType>(IPtr->getType())->getElementType(); 622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t VTyTSS = (int64_t) TD->getTypeStoreSize(VTy); 623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 62464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VTy2 = cast<PointerType>(JPtr->getType())->getElementType(); 62564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VTy != VTy2 && Offset < 0) { 62664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int64_t VTy2TSS = (int64_t) TD->getTypeStoreSize(VTy2); 62764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel OffsetInElmts = Offset/VTy2TSS; 62864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return (abs64(Offset) % VTy2TSS) == 0; 62964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = Offset/VTyTSS; 632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (abs64(Offset) % VTyTSS) == 0; 633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if the provided CallInst represents an intrinsic that can 639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be vectorized. 640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isVectorizableIntrinsic(CallInst* I) { 641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = I->getCalledFunction(); 642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!F) return false; 643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 644a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) F->getIntrinsicID(); 645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IID) return false; 646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 647de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel switch(IID) { 648de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel default: 649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sqrt: 651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::powi: 652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sin: 653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::cos: 654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log: 655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log2: 656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log10: 657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp: 658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp2: 659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::pow: 66086312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeMath; 661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::fma: 66264a7a24edf719bb6ffacc030c23f4cd99312f3fbHal Finkel case Intrinsic::fmuladd: 66386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeFMA; 664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if J is the second element in some pair referenced by 668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some multimap pair iterator pair. 669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel template <typename V> 670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isSecondInIteratorPair(V J, std::pair< 671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator, 672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typename std::multimap<V, V>::iterator> PairRange) { 673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (typename std::multimap<V, V>::iterator K = PairRange.first; 674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != PairRange.second; ++K) 675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->second == J) return true; 676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 679b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel 680b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel bool isPureIEChain(InsertElementInst *IE) { 681b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel InsertElementInst *IENext = IE; 682b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel do { 683b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (!isa<UndefValue>(IENext->getOperand(0)) && 684b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel !isa<InsertElementInst>(IENext->getOperand(0))) { 685b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel return false; 686b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } 687b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } while ((IENext = 688b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel dyn_cast<InsertElementInst>(IENext->getOperand(0)))); 689b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel 690b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel return true; 691b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } 692de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel }; 693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 694de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function implements one vectorization iteration on the provided 695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block. It returns true if the block is changed. 69664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::vectorizePairs(BasicBlock &BB, bool NonPow2Len) { 6975d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue; 6985d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator Start = BB.getFirstInsertionPt(); 6995d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7005d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> AllPairableInsts; 7015d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> AllChosenPairs; 702a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> AllFixedOrderPairs; 70372465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> AllPairConnectionTypes; 70472465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> AllConnectedPairs, AllConnectedPairDeps; 7055d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7065d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel do { 7075d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> PairableInsts; 7085d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::multimap<Value *, Value *> CandidatePairs; 709a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> FixedOrderPairs; 71065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> CandidatePairCostSavings; 7115d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, 712a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs, 71365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings, 71464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PairableInsts, NonPow2Len); 7155d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.empty()) continue; 7163706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7175d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Now we have a map of all of the pairable instructions and we need to 7185d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // select the best possible pairing. A good pairing is one such that the 7195d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // users of the pair are also paired. This defines a (directed) forest 72094c22716d60ff5edf6a98a3c67e0faa001be1142Sylvestre Ledru // over the pairs such that two pairs are connected iff the second pair 7215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // uses the first. 7223706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Note that it only matters that both members of the second pair use some 7245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // element of the first pair (to allow for splatting). 7253706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 72672465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> ConnectedPairs, ConnectedPairDeps; 72772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> PairConnectionTypes; 72872465ea23d010507d3746adc126d719005981e05Hal Finkel computeConnectedPairs(CandidatePairs, PairableInsts, ConnectedPairs, 72972465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes); 7305d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ConnectedPairs.empty()) continue; 7313706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 73272465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 73372465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 73472465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 73572465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairDeps.insert(VPPair(I->second, I->first)); 73672465ea23d010507d3746adc126d719005981e05Hal Finkel } 73772465ea23d010507d3746adc126d719005981e05Hal Finkel 7385d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Build the pairable-instruction dependency map 7395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseSet<ValuePair> PairableInstUsers; 7405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); 7413706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 74235564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // There is now a graph of the connected pairs. For each variable, pick 74335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // the pairing with the largest tree meeting the depth requirement on at 74435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // least one branch. Then select all pairings that are part of that tree 74535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // and remove them from the list of available pairings and pairable 74635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // variables. 7473706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7485d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> ChosenPairs; 74965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel choosePairs(CandidatePairs, CandidatePairCostSavings, 75086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 75186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 7525d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInstUsers, ChosenPairs); 7533706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7545d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ChosenPairs.empty()) continue; 7555d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), 7565d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts.end()); 7575d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end()); 758a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 75972465ea23d010507d3746adc126d719005981e05Hal Finkel // Only for the chosen pairs, propagate information on fixed-order pairs, 76072465ea23d010507d3746adc126d719005981e05Hal Finkel // pair connections, and their types to the data structures used by the 76172465ea23d010507d3746adc126d719005981e05Hal Finkel // pair fusion procedures. 762a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel for (DenseMap<Value *, Value *>::iterator I = ChosenPairs.begin(), 763a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel IE = ChosenPairs.end(); I != IE; ++I) { 764a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrderPairs.count(*I)) 765a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(*I); 766a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrderPairs.count(ValuePair(I->second, I->first))) 767a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(ValuePair(I->second, I->first)); 76872465ea23d010507d3746adc126d719005981e05Hal Finkel 76972465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseMap<Value *, Value *>::iterator J = ChosenPairs.begin(); 77072465ea23d010507d3746adc126d719005981e05Hal Finkel J != IE; ++J) { 77172465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator K = 77272465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(*I, *J)); 77372465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) { 77472465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 77572465ea23d010507d3746adc126d719005981e05Hal Finkel } else { 77672465ea23d010507d3746adc126d719005981e05Hal Finkel K = PairConnectionTypes.find(VPPair(*J, *I)); 77772465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) 77872465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 77972465ea23d010507d3746adc126d719005981e05Hal Finkel } 78072465ea23d010507d3746adc126d719005981e05Hal Finkel } 78172465ea23d010507d3746adc126d719005981e05Hal Finkel } 78272465ea23d010507d3746adc126d719005981e05Hal Finkel 78372465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator 78472465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 78572465ea23d010507d3746adc126d719005981e05Hal Finkel I != IE; ++I) { 78672465ea23d010507d3746adc126d719005981e05Hal Finkel if (AllPairConnectionTypes.count(*I)) { 78772465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs.insert(*I); 78872465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairDeps.insert(VPPair(I->second, I->first)); 78972465ea23d010507d3746adc126d719005981e05Hal Finkel } 790a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel } 7915d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } while (ShouldContinue); 7925d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7935d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (AllChosenPairs.empty()) return false; 7945d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel NumFusedOps += AllChosenPairs.size(); 7953706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A set of pairs has now been selected. It is now necessary to replace the 797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // paired instructions with vector instructions. For this procedure each 79843ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop // operand must be replaced with a vector operand. This vector is formed 799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // by using build_vector on the old operands. The replaced values are then 800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // replaced with a vector_extract on the result. Subsequent optimization 801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // passes should coalesce the build/extract combinations. 8023706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 80372465ea23d010507d3746adc126d719005981e05Hal Finkel fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs, AllFixedOrderPairs, 80472465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes, 80572465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs, AllConnectedPairDeps); 80664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 80764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // It is important to cleanup here so that future iterations of this 80864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // function have less work to do. 8098e0d1c03ca7fd86e6879b4e37d0d7f0e982feef6Benjamin Kramer (void) SimplifyInstructionsInBlock(&BB, TD, AA->getTargetLibraryInfo()); 810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 813de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the provided instruction is capable of being 814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fused into a vector instruction. This determination is based only on the 815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and other attributes of the instruction. 816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::isInstVectorizable(Instruction *I, 817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &IsSimpleLoadStore) { 818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = false; 819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (CallInst *C = dyn_cast<CallInst>(I)) { 821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isVectorizableIntrinsic(C)) 822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 823de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (LoadInst *L = dyn_cast<LoadInst>(I)) { 824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple loads if possbile: 825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = L->isSimple(); 82686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 828de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (StoreInst *S = dyn_cast<StoreInst>(I)) { 829de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple stores if possbile: 830de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = S->isSimple(); 83186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 833de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (CastInst *C = dyn_cast<CastInst>(I)) { 834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can vectorize casts, but not casts of pointer types, etc. 83586312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeCasts) 836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 837de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *SrcTy = C->getSrcTy(); 839f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!SrcTy->isSingleValueType()) 840de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *DestTy = C->getDestTy(); 843f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!DestTy->isSingleValueType()) 844de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 845fc3665c87519850f629c9565535e3be447e10addHal Finkel } else if (isa<SelectInst>(I)) { 846fc3665c87519850f629c9565535e3be447e10addHal Finkel if (!Config.VectorizeSelect) 847fc3665c87519850f629c9565535e3be447e10addHal Finkel return false; 848e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel } else if (isa<CmpInst>(I)) { 849e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel if (!Config.VectorizeCmp) 850e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel return false; 851f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel } else if (GetElementPtrInst *G = dyn_cast<GetElementPtrInst>(I)) { 852f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!Config.VectorizeGEP) 853f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 854f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 855f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel // Currently, vector GEPs exist only with one index. 856f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (G->getNumIndices() != 1) 857f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!(I->isBinaryOp() || isa<ShuffleVectorInst>(I) || 859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<ExtractElementInst>(I) || isa<InsertElementInst>(I))) { 860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 861de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 863de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can't vectorize memory operations without target data 864de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (TD == 0 && IsSimpleLoadStore) 865de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 866de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *T1, *T2; 86864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, T1, T2); 869de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 870de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Not every type can be vectorized... 871de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(VectorType::isValidElementType(T1) || T1->isVectorTy()) || 872de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel !(VectorType::isValidElementType(T2) || T2->isVectorTy())) 873de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 874de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 87565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T1->getScalarSizeInBits() == 1) { 876768edf3cd037aab10391abc279f71470df8e3156Hal Finkel if (!Config.VectorizeBools) 877768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 878768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } else { 87965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T1->isIntOrIntVectorTy()) 880768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 881768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } 88265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 88365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T2->getScalarSizeInBits() == 1) { 88465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeBools) 88565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 88665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 88765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T2->isIntOrIntVectorTy()) 88865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 88965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 89065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 89186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeFloats 89286312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng && (T1->isFPOrFPVectorTy() || T2->isFPOrFPVectorTy())) 893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 895e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel // Don't vectorize target-specific types. 896e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T1->isX86_FP80Ty() || T1->isPPC_FP128Ty() || T1->isX86_MMXTy()) 897e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 898e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T2->isX86_FP80Ty() || T2->isPPC_FP128Ty() || T2->isX86_MMXTy()) 899e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 900e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel 90105bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel if ((!Config.VectorizePointers || TD == 0) && 90205bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel (T1->getScalarType()->isPointerTy() || 90305bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel T2->getScalarType()->isPointerTy())) 904f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 905f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 906abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (!TTI && (T1->getPrimitiveSizeInBits() >= Config.VectorBits || 907abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth T2->getPrimitiveSizeInBits() >= Config.VectorBits)) 908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the two provided instructions are compatible 914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (meaning that they can be fused into a vector instruction). This assumes 915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that I has already been determined to be vectorizable and that J is not 916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in the use tree of I. 917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::areInstsCompatible(Instruction *I, Instruction *J, 91865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 919a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder) { 920de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugInstructionExamination) dbgs() << "BBV: looking at " << *I << 921de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 922de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 92365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = 0; 924a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = 0; 92565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Loads and stores can be merged if they have different alignments, 927de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but are otherwise the same. 92864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!J->isSameOperationAs(I, Instruction::CompareIgnoringAlignment | 92964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (NonPow2Len ? Instruction::CompareUsingScalarTypes : 0))) 93064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return false; 93164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 93264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *IT1, *IT2, *JT1, *JT2; 93364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, IT1, IT2); 93464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(J, JT1, JT2); 93564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaxTypeBits = std::max( 93664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT1->getPrimitiveSizeInBits() + JT1->getPrimitiveSizeInBits(), 93764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT2->getPrimitiveSizeInBits() + JT2->getPrimitiveSizeInBits()); 938abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (!TTI && MaxTypeBits > Config.VectorBits) 939de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 940ec4e85e3364f50802f2007e4b1e23661d4610366Hal Finkel 941de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: handle addsub-type operations! 942de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 943de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsSimpleLoadStore) { 944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 94565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 946de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts = 0; 947de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 94865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts) && abs64(OffsetInElmts) == 1) { 950a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = (int) OffsetInElmts; 95165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned BottomAlignment = IAlignment; 95265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (OffsetInElmts < 0) BottomAlignment = JAlignment; 95365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 95465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeI = isa<StoreInst>(I) ? 95565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(I)->getValueOperand()->getType() : I->getType(); 95665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeJ = isa<StoreInst>(J) ? 95765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(J)->getValueOperand()->getType() : J->getType(); 95865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VType = getVecTypeForPair(aTypeI, aTypeJ); 95964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 96065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (Config.AlignedOnly) { 961de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // An aligned load or store is possible only if the instruction 962de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // with the lower offset has an alignment suitable for the 963de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector type. 9641230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 965de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned VecAlignment = TD->getPrefTypeAlignment(VType); 966de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (BottomAlignment < VecAlignment) 967de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 968de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 96965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 970abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) { 971abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned ICost = TTI->getMemoryOpCost(I->getOpcode(), aTypeI, 972abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth IAlignment, IAddressSpace); 973abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned JCost = TTI->getMemoryOpCost(J->getOpcode(), aTypeJ, 974abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth JAlignment, JAddressSpace); 975abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VCost = TTI->getMemoryOpCost(I->getOpcode(), VType, 976abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth BottomAlignment, 977abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth IAddressSpace); 9780cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel 9790cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel ICost += TTI->getAddressComputationCost(aTypeI); 9800cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel JCost += TTI->getAddressComputationCost(aTypeJ); 9810cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel VCost += TTI->getAddressComputationCost(VType); 9820cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel 98365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 98465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 98582149a9106f221aa6a7271977c236b078e621f21Hal Finkel 986dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 98782149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 988dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 989abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VParts = TTI->getNumberOfParts(VType); 990dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 991dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 992dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 99382149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 99482149a9106f221aa6a7271977c236b078e621f21Hal Finkel 99565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 99665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 999de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1000abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth } else if (TTI) { 100146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned ICost = getInstrCost(I->getOpcode(), IT1, IT2); 100246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned JCost = getInstrCost(J->getOpcode(), JT1, JT2); 100365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VT1 = getVecTypeForPair(IT1, JT1), 100465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel *VT2 = getVecTypeForPair(IT2, JT2); 1005ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel 1006ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // Note that this procedure is incorrect for insert and extract element 1007ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // instructions (because combining these often results in a shuffle), 1008ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // but this cost is ignored (because insert and extract element 1009ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // instructions are assigned a zero depth factor and are not really 1010ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // fused in general). 101146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned VCost = getInstrCost(I->getOpcode(), VT1, VT2); 101265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 101365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 101465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 101582149a9106f221aa6a7271977c236b078e621f21Hal Finkel 1016dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 101782149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 1018dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 1019abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VParts1 = TTI->getNumberOfParts(VT1), 1020abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth VParts2 = TTI->getNumberOfParts(VT2); 10218b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel if (VParts1 > 1 || VParts2 > 1) 1022dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 10238b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel else if ((!VParts1 || !VParts2) && VCost == ICost + JCost) 102482149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 102582149a9106f221aa6a7271977c236b078e621f21Hal Finkel 102665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 1027de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1028de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 10296173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The powi intrinsic is special because only the first argument is 10306173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // vectorized, the second arguments must be equal. 10316173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel CallInst *CI = dyn_cast<CallInst>(I); 10326173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Function *FI; 1033a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (CI && (FI = CI->getCalledFunction())) { 1034a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) FI->getIntrinsicID(); 1035a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (IID == Intrinsic::powi) { 1036a77728415857196035c0090f7b2749d7971811a2Hal Finkel Value *A1I = CI->getArgOperand(1), 1037a77728415857196035c0090f7b2749d7971811a2Hal Finkel *A1J = cast<CallInst>(J)->getArgOperand(1); 1038a77728415857196035c0090f7b2749d7971811a2Hal Finkel const SCEV *A1ISCEV = SE->getSCEV(A1I), 1039a77728415857196035c0090f7b2749d7971811a2Hal Finkel *A1JSCEV = SE->getSCEV(A1J); 1040a77728415857196035c0090f7b2749d7971811a2Hal Finkel return (A1ISCEV == A1JSCEV); 1041a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1042a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1043abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (IID && TTI) { 1044a77728415857196035c0090f7b2749d7971811a2Hal Finkel SmallVector<Type*, 4> Tys; 1045a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) 1046a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CI->getArgOperand(i)->getType()); 1047abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned ICost = TTI->getIntrinsicInstrCost(IID, IT1, Tys); 1048a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1049a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.clear(); 1050a77728415857196035c0090f7b2749d7971811a2Hal Finkel CallInst *CJ = cast<CallInst>(J); 1051a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CJ->getNumArgOperands(); i != ie; ++i) 1052a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CJ->getArgOperand(i)->getType()); 1053abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned JCost = TTI->getIntrinsicInstrCost(IID, JT1, Tys); 1054a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1055a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.clear(); 1056a77728415857196035c0090f7b2749d7971811a2Hal Finkel assert(CI->getNumArgOperands() == CJ->getNumArgOperands() && 1057a77728415857196035c0090f7b2749d7971811a2Hal Finkel "Intrinsic argument counts differ"); 1058a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) { 1059a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (IID == Intrinsic::powi && i == 1) 1060a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CI->getArgOperand(i)->getType()); 1061a77728415857196035c0090f7b2749d7971811a2Hal Finkel else 1062a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(getVecTypeForPair(CI->getArgOperand(i)->getType(), 1063a77728415857196035c0090f7b2749d7971811a2Hal Finkel CJ->getArgOperand(i)->getType())); 1064a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1065a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1066a77728415857196035c0090f7b2749d7971811a2Hal Finkel Type *RetTy = getVecTypeForPair(IT1, JT1); 1067abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VCost = TTI->getIntrinsicInstrCost(IID, RetTy, Tys); 1068a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1069a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (VCost > ICost + JCost) 1070a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1071a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1072a77728415857196035c0090f7b2749d7971811a2Hal Finkel // We don't want to fuse to a type that will be split, even 1073a77728415857196035c0090f7b2749d7971811a2Hal Finkel // if the two input types will also be split and there is no other 1074a77728415857196035c0090f7b2749d7971811a2Hal Finkel // associated cost. 1075abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned RetParts = TTI->getNumberOfParts(RetTy); 1076a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (RetParts > 1) 1077a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1078a77728415857196035c0090f7b2749d7971811a2Hal Finkel else if (!RetParts && VCost == ICost + JCost) 1079a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1080a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1081a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) { 1082a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (!Tys[i]->isVectorTy()) 1083a77728415857196035c0090f7b2749d7971811a2Hal Finkel continue; 1084a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1085abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned NumParts = TTI->getNumberOfParts(Tys[i]); 1086a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (NumParts > 1) 1087a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1088a77728415857196035c0090f7b2749d7971811a2Hal Finkel else if (!NumParts && VCost == ICost + JCost) 1089a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1090a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1091a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1092a77728415857196035c0090f7b2749d7971811a2Hal Finkel CostSavings = ICost + JCost - VCost; 1093a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 10946173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 10956173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 1096de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1097de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1098de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1099de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Figure out whether or not J uses I and update the users and write-set 1100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // structures associated with I. Specifically, Users represents the set of 1101de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions that depend on I. WriteSet represents the set 1102de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of memory locations that are dependent on I. If UpdateUsers is true, 1103de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and J uses I, then Users is updated to contain J and WriteSet is updated 1104de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to contain any memory locations to which J writes. The function returns 1105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if J uses I. By default, alias analysis is used to determine 1106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // whether J reads from memory that overlaps with a location in WriteSet. 1107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If LoadMoveSet is not null, then it is a previously-computed multimap 1108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // where the key is the memory-based user instruction and the value is 1109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the instruction to be compared with I. So, if LoadMoveSet is provided, 1110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then the alias analysis is not used. This is necessary because this 1111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // function is called during the process of moving instructions during 1112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectorization and the results of the alias analysis are not stable during 1113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that process. 1114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, 1115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 1116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers, 1117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> *LoadMoveSet) { 1118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = false; 1119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This instruction may already be marked as a user due, for example, to 1121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // being a member of a selected pair. 1122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (Users.count(J)) 1123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI) 11267e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel for (User::op_iterator JU = J->op_begin(), JE = J->op_end(); 11277e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel JU != JE; ++JU) { 1128de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *V = *JU; 1129de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I == V || Users.count(V)) { 1130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1134de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI && J->mayReadFromMemory()) { 1135de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (LoadMoveSet) { 1136de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet->equal_range(J); 1137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = isSecondInIteratorPair<Value*>(I, JPairRange); 1138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSetTracker::iterator W = WriteSet.begin(), 1140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel WE = WriteSet.end(); W != WE; ++W) { 114138a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel if (W->aliasesUnknownInst(J, *AA)) { 114238a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel UsesI = true; 114338a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel break; 1144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI && UpdateUsers) { 1150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (J->mayWriteToMemory()) WriteSet.add(J); 1151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Users.insert(J); 1152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return UsesI; 1155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1156de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function iterates over all instruction pairs in the provided 1158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block and collects all candidate pairs for vectorization. 11595d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool BBVectorize::getCandidatePairs(BasicBlock &BB, 11605d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 1161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1162a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 116365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 116464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len) { 1165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 11665d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (Start == E) return false; 11675d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 11685d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue = false, IAfterStart = false; 11695d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel for (BasicBlock::iterator I = Start++; I != E; ++I) { 11705d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (I == Start) IAfterStart = true; 11715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore; 1173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isInstVectorizable(I, IsSimpleLoadStore)) continue; 1174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for an instruction with which to pair instruction *I... 1176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 11785d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool JAfterStart = IAfterStart; 11795d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator J = llvm::next(I); 1180bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng for (unsigned ss = 0; J != E && ss <= Config.SearchLimit; ++J, ++ss) { 11815d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (J == Start) JAfterStart = true; 11825d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Determine if J uses I, if so, exit the loop. 1184bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep); 1185bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.FastDep) { 1186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: For this heuristic to be effective, independent operations 1187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // must tend to be intermixed. This is likely to be true from some 1188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // kinds of grouped loop unrolling (but not the generic LLVM pass), 1189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but otherwise may require some kind of reordering pass. 1190de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // When using fast dependency analysis, 1192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // stop searching after first use: 1193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 1194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) continue; 1196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J does not use I, and comes before the first use of I, so it can be 1199de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // merged with I if the instructions are compatible. 1200a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int CostSavings, FixedOrder; 120165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!areInstsCompatible(I, J, IsSimpleLoadStore, NonPow2Len, 1202a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel CostSavings, FixedOrder)) continue; 1203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J is a candidate for merging with I. 1205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!PairableInsts.size() || 1206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts[PairableInsts.size()-1] != I) { 1207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts.push_back(I); 1208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 12095d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.insert(ValuePair(I, J)); 1211abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) 121265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings.insert(ValuePairWithCost(ValuePair(I, J), 121365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings)); 12145d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1215a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrder == 1) 1216a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(I, J)); 1217a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrder == -1) 1218a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(J, I)); 1219a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 12205d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // The next call to this function must start after the last instruction 12215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // selected during this invocation. 12225d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (JAfterStart) { 12235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel Start = llvm::next(J); 12245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel IAfterStart = JAfterStart = false; 12255d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 12265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCandidateSelection) dbgs() << "BBV: candidate pair " 122865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel << *I << " <-> " << *J << " (cost savings: " << 122965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings << ")\n"); 12305d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 12315d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // If we have already found too many pairs, break here and this function 12325d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // will be called again starting after the last instruction selected 12335d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // during this invocation. 1234bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (PairableInsts.size() >= Config.MaxInsts) { 12355d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = true; 12365d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 12375d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 1238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 12395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 12405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ShouldContinue) 12415d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 1242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1243de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1244de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << PairableInsts.size() 1245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " instructions with candidate pairs\n"); 12465d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 12475d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel return ShouldContinue; 1248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Finds candidate pairs connected to the pair P = <PI, PJ>. This means that 1251de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // it looks for pairs such that both members have an input which is an 1252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // output of PI or PJ. 1253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computePairsConnectedTo( 1254de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1255de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1256de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 125772465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePair P) { 1259bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel StoreInst *SI, *SJ; 1260bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each possible pairing for this variable, look at the uses of 1262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the first value... 1263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.first->use_begin(), 1264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.first->use_end(); I != E; ++I) { 1265bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) { 1266bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // A pair cannot be connected to a load because the load only takes one 1267bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // operand (the address) and it is a scalar even after vectorization. 1268bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1269bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } else if ((SI = dyn_cast<StoreInst>(*I)) && 1270bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SI->getPointerOperand()) { 1271bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // Similarly, a pair cannot be connected to a store through its 1272bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // pointer operand. 1273bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1274bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } 1275bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each use of the first variable, look for uses of the second 1279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // variable... 1280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(), 1281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = P.second->use_end(); J != E2; ++J) { 1282bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1283bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1284bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1285bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = CandidatePairs.equal_range(*J); 1287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <I, J>: 128972465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 129072465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 129172465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 129272465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionDirect)); 129372465ea23d010507d3746adc126d719005981e05Hal Finkel } 1294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <J, I>: 129672465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*I, JPairRange)) { 129772465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*J, *I)); 129872465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 129972465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSwap)); 130072465ea23d010507d3746adc126d719005981e05Hal Finkel } 1301de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1303bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) continue; 1304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the first value in the pair is used by 1305de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.first->use_begin(); J != E; ++J) { 1307bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1308bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SJ->getPointerOperand()) 1309bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1310bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 131172465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 131272465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 131372465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 131472465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 131572465ea23d010507d3746adc126d719005981e05Hal Finkel } 1316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1319bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) return; 1320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the second value in the pair is used by 1321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 1322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator I = P.second->use_begin(), 1323de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = P.second->use_end(); I != E; ++I) { 1324bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if (isa<LoadInst>(*I)) 1325bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1326bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel else if ((SI = dyn_cast<StoreInst>(*I)) && 1327bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SI->getPointerOperand()) 1328bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1329bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = CandidatePairs.equal_range(*I); 1331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (Value::use_iterator J = P.second->use_begin(); J != E; ++J) { 1333bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel if ((SJ = dyn_cast<StoreInst>(*J)) && 1334bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1335bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1336bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 133772465ea23d010507d3746adc126d719005981e05Hal Finkel if (isSecondInIteratorPair<Value*>(*J, IPairRange)) { 133872465ea23d010507d3746adc126d719005981e05Hal Finkel VPPair VP(P, ValuePair(*I, *J)); 133972465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs.insert(VP); 134072465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 134172465ea23d010507d3746adc126d719005981e05Hal Finkel } 1342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1346de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function figures out which pairs are connected. Two pairs are 1347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // connected if some output of the first pair forms an input to both members 1348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of the second pair. 1349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computeConnectedPairs( 1350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 135272465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 135372465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes) { 1354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 1356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PE = PairableInsts.end(); PI != PE; ++PI) { 1357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair choiceRange = CandidatePairs.equal_range(*PI); 1358de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1359de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator P = choiceRange.first; 1360de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel P != choiceRange.second; ++P) 1361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel computePairsConnectedTo(CandidatePairs, PairableInsts, 136272465ea23d010507d3746adc126d719005981e05Hal Finkel ConnectedPairs, PairConnectionTypes, *P); 1363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1365de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << ConnectedPairs.size() 1366de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " pair connections.\n"); 1367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds a set of use tuples such that <A, B> is in the set 1370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // if B is in the use tree of A. If B is in the use tree of A, then B 1371de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depends on the output of A. 1372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildDepMap( 1373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB, 1374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1375de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers) { 1377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> IsInPair; 1378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator C = CandidatePairs.begin(), 1379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = CandidatePairs.end(); C != E; ++C) { 1380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->first); 1381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->second); 1382de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1383de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 13847a8aba906416b6998347b52c3c08610fdc190638Hal Finkel // Iterate through the basic block, recording all users of each 1385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairable instruction. 1386de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 1388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator I = BB.getFirstInsertionPt(); I != E; ++I) { 1389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsInPair.find(I) == IsInPair.end()) continue; 1390de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator J = llvm::next(I); J != E; ++J) 1394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, J); 1395de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end(); 1397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel U != E; ++U) 1398de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.insert(ValuePair(I, *U)); 1399de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1400de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1401de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1402de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if an input to pair P is an output of pair Q and also an 1403de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // input of pair Q is an output of pair P. If this is the case, then these 1404de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // two pairs cannot be simultaneously fused. 1405de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairsConflict(ValuePair P, ValuePair Q, 1406de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1407da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel std::multimap<ValuePair, ValuePair> *PairableInstUserMap, 1408da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> *PairableInstUserPairSet) { 1409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Two pairs are in conflict if they are mutual Users of eachother. 1410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool QUsesP = PairableInstUsers.count(ValuePair(P.first, Q.first)) || 1411de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.first, Q.second)) || 1412de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.first)) || 1413de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.second)); 1414de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool PUsesQ = PairableInstUsers.count(ValuePair(Q.first, P.first)) || 1415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.first, P.second)) || 1416de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.first)) || 1417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.second)); 1418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PairableInstUserMap) { 1419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: The expensive part of the cycle check is not so much the cycle 1420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // check itself but this edge insertion procedure. This needs some 1421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // profiling and probably a different data structure (same is true of 1422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // most uses of std::multimap). 1423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PUsesQ) { 1424da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel if (PairableInstUserPairSet->insert(VPPair(Q, P)).second) 1425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(Q, P)); 1426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (QUsesP) { 1428da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel if (PairableInstUserPairSet->insert(VPPair(P, Q)).second) 1429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUserMap->insert(VPPair(P, Q)); 1430de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (QUsesP && PUsesQ); 1434de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function walks the use graph of current pairs to see if, starting 1437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // from P, the walk returns to P. 1438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairWillFormCycle(ValuePair P, 1439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1440de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &CurrentPairs) { 1441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1442de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: starting cycle check for : " << *P.first << " <-> " 1443de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *P.second << "\n"); 1444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A lookup table of visisted pairs is kept because the PairableInstUserMap 1445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contains non-direct associations. 1446de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> Visited; 144735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePair, 32> Q; 1448de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1449de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(P); 145035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 145135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePair QTop = Q.pop_back_val(); 1452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Visited.insert(QTop); 1453de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1455de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: cycle check visiting: " << *QTop.first << " <-> " 1456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *QTop.second << "\n"); 1457de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QPairRange = PairableInstUserMap.equal_range(QTop); 1458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator C = QPairRange.first; 1459de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != QPairRange.second; ++C) { 1460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C->second == P) { 1461de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() 1462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << "BBV: rejected to prevent non-trivial cycle formation: " 1463de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *C->first.first << " <-> " << *C->first.second << "\n"); 1464de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1465de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1466de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 14670b2500c504156c45cd71817a9ef6749b6cde5703David Blaikie if (CurrentPairs.count(C->second) && !Visited.count(C->second)) 1468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(C->second); 1469de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 147035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1471de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1472de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1473de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds the initial tree of connected pairs with the 1476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair J at the root. 1477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildInitialTreeFor( 1478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1479de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1481de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, ValuePair J) { 1484de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Each of these pairs is viewed as the root node of a Tree. The Tree 1485de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is then walked (depth-first). As this happens, we keep track of 1486de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pairs that compose the Tree and the maximum depth of the Tree. 148735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1489de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 149035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 1491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePairWithDepth QTop = Q.back(); 1492de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1493de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Push each child onto the queue: 1494de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool MoreChildren = false; 1495de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxChildDepth = QTop.second; 1496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair qtRange = ConnectedPairs.equal_range(QTop.first); 1497478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator k = qtRange.first; 1498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel k != qtRange.second; ++k) { 1499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make sure that this child pair is still a candidate: 1500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsStillCand = false; 1501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair checkRange = 1502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.equal_range(k->second.first); 1503de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator m = checkRange.first; 1504de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel m != checkRange.second; ++m) { 1505de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m->second == k->second.second) { 1506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsStillCand = true; 1507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsStillCand) { 1512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(k->second); 1513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) { 1514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t d = getDepthFactor(k->second.first); 1515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(k->second, QTop.second+d)); 1516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MoreChildren = true; 1517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxChildDepth = std::max(MaxChildDepth, C->second); 1519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1520de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!MoreChildren) { 1524de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Record the current pair as part of the Tree: 1525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Tree.insert(ValuePairWithDepth(QTop.first, MaxChildDepth)); 1526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.pop_back(); 1527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 152835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given some initial tree, prune it by removing conflicting pairs (pairs 1532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that cannot be simultaneously chosen for vectorization). 1533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::pruneTreeFor( 1534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 1535de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1536de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 1537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1539da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 1540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> &Tree, 1542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PrunedTree, ValuePair J, 1543de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 154435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1546de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 154735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 154835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePairWithDepth QTop = Q.pop_back_val(); 1549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PrunedTree.insert(QTop.first); 1550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Visit each child, pruning as necessary... 155297d19ebe5b5bf27617e536a16fa232116cefe914Hal Finkel SmallVector<ValuePairWithDepth, 8> BestChildren; 1553de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPPIteratorPair QTopRange = ConnectedPairs.equal_range(QTop.first); 1554478eed85f96f0d93da43e26cfb7fc6dee981c9aaNAKAMURA Takumi for (std::multimap<ValuePair, ValuePair>::iterator K = QTopRange.first; 1555de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K != QTopRange.second; ++K) { 1556de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t>::iterator C = Tree.find(K->second); 1557de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C == Tree.end()) continue; 1558de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1559de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child is in the Tree, now we need to make sure it is the 1560de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // best of any conflicting children. There could be multiple 1561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflicting children, so first, determine if we're keeping 1562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // this child, then delete conflicting children as necessary. 1563de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // It is also necessary to guard against pairing-induced 1565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // dependencies. Consider instructions a .. x .. y .. b 1566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // such that (a,b) are to be fused and (x,y) are to be fused 1567de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but a is an input to x and b is an output from y. This 1568de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // means that y cannot be moved after b but x must be moved 1569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after b for (a,b) to be fused. In other words, after 1570de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fusing (a,b) we have y .. a/b .. x where y is an input 1571de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to a/b and x is an output to a/b: x and y can no longer 1572de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be legally fused. To prevent this condition, we must 1573de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // make sure that a child pair added to the Tree is not 1574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both an input and output of an already-selected pair. 1575de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Pairing-induced dependencies can also form from more complicated 1577de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // cycles. The pair vs. pair conflicts are easy to check, and so 1578de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that is done explicitly for "fast rejection", and because for 1579de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // child vs. child conflicts, we may prefer to keep the current 1580de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in preference to the already-selected child. 1581de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> CurrentPairs; 1582de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1583de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool CanAdd = true; 158497d19ebe5b5bf27617e536a16fa232116cefe914Hal Finkel for (SmallVector<ValuePairWithDepth, 8>::iterator C2 158543ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1587de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1588de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1591de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1592da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserMap : 0, 1593da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserPairSet : 0)) { 1594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->second >= C->second) { 1595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1597de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1598de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1599de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1604de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Even worse, this child could conflict with another node already 1605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // selected for the Tree. If that is the case, ignore this child. 1606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator T = PrunedTree.begin(), 1607de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = PrunedTree.end(); T != E2; ++T) { 1608de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T->first == C->first.first || 1609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->first == C->first.second || 1610de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.first || 1611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.second || 1612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(*T, C->first, PairableInstUsers, 1613da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserMap : 0, 1614da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserPairSet : 0)) { 1615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1616de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1617de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*T); 1620de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // And check the queue too... 162435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel for (SmallVector<ValuePairWithDepth, 32>::iterator C2 = Q.begin(), 1625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = Q.end(); C2 != E2; ++C2) { 1626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1630de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1631da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserMap : 0, 1632da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserPairSet : 0)) { 1633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Last but not least, check for a conflict with any of the 1642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // already-chosen pairs. 1643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C2 = 1644de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.begin(), E2 = ChosenPairs.end(); 1645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1646de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C2, C->first, PairableInstUsers, 1647da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserMap : 0, 1648da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserPairSet : 0)) { 1649de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1650de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*C2); 1654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 16571230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // To check for non-trivial cycles formed by the addition of the 16581230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // current pair we've formed a list of all relevant pairs, now use a 16591230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // graph walk to check for a cycle. We start from the current pair and 16601230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // walk the use tree to see if we again reach the current pair. If we 16611230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // do, then the current pair is rejected. 1662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: It may be more efficient to use a topological-ordering 1664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // algorithm to improve the cycle check. This should be investigated. 1665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(C->first, PairableInstUserMap, CurrentPairs)) 1667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child can be added, but we may have chosen it in preference 1670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to an already-selected child. Check for this here, and if a 1671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict is found, then remove the previously-selected child 1672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // before adding this one in its place. 167397d19ebe5b5bf27617e536a16fa232116cefe914Hal Finkel for (SmallVector<ValuePairWithDepth, 8>::iterator C2 167443ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(); C2 != BestChildren.end();) { 1675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers)) 1680d7a3425f06d51ed579bd9aefeb835b7fa4ce7849Hal Finkel C2 = BestChildren.erase(C2); 1681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++C2; 1683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1684de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1685d7a3425f06d51ed579bd9aefeb835b7fa4ce7849Hal Finkel BestChildren.push_back(ValuePairWithDepth(C->first, C->second)); 1686de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 168897d19ebe5b5bf27617e536a16fa232116cefe914Hal Finkel for (SmallVector<ValuePairWithDepth, 8>::iterator C 168943ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1690de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != E2; ++C) { 1691de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t DepthF = getDepthFactor(C->first.first); 1692de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(C->first, QTop.second+DepthF)); 1693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 169435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1697de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function finds the best tree of mututally-compatible connected 1698de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairs, given the choice of root pairs as an iterator range. 1699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::findBestTreeFor( 1700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 170165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 1702de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 170386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 170486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 1705de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 170686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 1707de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 1708de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &PairableInstUserMap, 1709da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 1710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1711de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &BestTree, size_t &BestMaxDepth, 171265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int &BestEffSize, VPIteratorPair ChoiceRange, 1713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UseCycleCheck) { 1714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator J = ChoiceRange.first; 1715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J != ChoiceRange.second; ++J) { 1716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before going any further, make sure that this pair does not 1718de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict with any already-selected pairs (see comment below 1719de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // near the Tree pruning for more details). 1720de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> ChosenPairSet; 1721de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool DoesConflict = false; 1722de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C = ChosenPairs.begin(), 1723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); C != E; ++C) { 1724de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C, *J, PairableInstUsers, 1725da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserMap : 0, 1726da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel UseCycleCheck ? &PairableInstUserPairSet : 0)) { 1727de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DoesConflict = true; 1728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1729de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1731de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairSet.insert(*C); 1732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (DoesConflict) continue; 1734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(*J, PairableInstUserMap, ChosenPairSet)) 1737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<ValuePair, size_t> Tree; 1740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel buildInitialTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers, ChosenPairs, Tree, *J); 1742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Because we'll keep the child with the largest depth, the largest 1744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depth is still the same in the unpruned Tree. 1745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxDepth = Tree.lookup(*J); 1746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "BBV: found Tree for pair {" 1748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 1749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << Tree.size() << "\n"); 1750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // At this point the Tree has been constructed, but, may contain 1752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contradictory children (meaning that different children of 1753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // some tree node may be attempting to fuse the same instruction). 1754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // So now we walk the tree again, in the case of a conflict, 1755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // keep only the child with the largest depth. To break a tie, 1756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // favor the first child. 1757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> PrunedTree; 1759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pruneTreeFor(CandidatePairs, PairableInsts, ConnectedPairs, 1760da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel PairableInstUsers, PairableInstUserMap, PairableInstUserPairSet, 1761da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel ChosenPairs, Tree, PrunedTree, *J, UseCycleCheck); 1762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 176365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int EffSize = 0; 1764abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) { 176578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DenseSet<Value *> PrunedTreeInstrs; 176678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 176778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel E = PrunedTree.end(); S != E; ++S) { 176878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel PrunedTreeInstrs.insert(S->first); 176978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel PrunedTreeInstrs.insert(S->second); 177078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 177178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 177278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The set of pairs that have already contributed to the total cost. 177378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DenseSet<ValuePair> IncomingPairs; 177478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 17754387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // If the cost model were perfect, this might not be necessary; but we 17764387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // need to make sure that we don't get stuck vectorizing our own 17774387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // shuffle chains. 17784387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel bool HasNontrivialInsts = false; 17794387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 178086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // The node weights represent the cost savings associated with 178186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // fusing the pair of instructions. 178265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 178365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) { 17844387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel if (!isa<ShuffleVectorInst>(S->first) && 17854387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel !isa<InsertElementInst>(S->first) && 17864387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel !isa<ExtractElementInst>(S->first)) 17874387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel HasNontrivialInsts = true; 17884387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 178978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool FlipOrder = false; 179078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 179178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (getDepthFactor(S->first)) { 179278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = CandidatePairCostSavings.find(*S)->second; 179378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tweight {" 179478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *S->first << " <-> " << *S->second << "} = " << 179578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 179678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize += ESContrib; 179778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 179886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 179978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The edge weights contribute in a negative sense: they represent 180078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // the cost of shuffles. 180186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel VPPIteratorPair IP = ConnectedPairDeps.equal_range(*S); 180286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if (IP.first != ConnectedPairDeps.end()) { 180386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 180486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 180586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Q != IP.second; ++Q) { 180678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!PrunedTree.count(Q->second)) 180778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 180886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 180986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 181086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 181186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 181286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if (R->second == PairConnectionDirect) 181386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsDirect; 181486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel else if (R->second == PairConnectionSwap) 181586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsSwap; 181686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 181786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 181886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // If there are more swaps than direct connections, then 181986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // the pair order will be flipped during fusion. So the real 182086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // number of swaps is the minimum number. 182178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel FlipOrder = !FixedOrderPairs.count(*S) && 182286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ((NumDepsSwap > NumDepsDirect) || 182386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel FixedOrderPairs.count(ValuePair(S->second, S->first))); 182486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 182586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 182686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Q != IP.second; ++Q) { 182778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!PrunedTree.count(Q->second)) 182878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 182986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 183086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 183186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 183286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 183386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Type *Ty1 = Q->second.first->getType(), 183486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel *Ty2 = Q->second.second->getType(); 183586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 183686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if ((R->second == PairConnectionDirect && FlipOrder) || 183786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel (R->second == PairConnectionSwap && !FlipOrder) || 183878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel R->second == PairConnectionSplat) { 183978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 184078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 1841245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 1842245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (VTy->getVectorNumElements() == 2) { 1843245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (R->second == PairConnectionSplat) 1844245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1845245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Broadcast, VTy)); 1846245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel else 1847245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1848245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Reverse, VTy)); 1849245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } 1850245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 185178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 185278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Q->second.first << " <-> " << *Q->second.second << 185378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel "} -> {" << 185478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << " <-> " << *S->second << "} = " << 185578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 185678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 185778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 185878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 185978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 186078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 186178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of outgoing edges. We assume that edges outgoing 186278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // to shuffles, inserts or extracts can be merged, and so contribute 186378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // no additional cost. 186478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!S->first->getType()->isVoidTy()) { 186578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = S->first->getType(), 186678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = S->second->getType(); 186778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 186878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 186978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool NeedsExtraction = false; 187078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (Value::use_iterator I = S->first->use_begin(), 187178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IE = S->first->use_end(); I != IE; ++I) { 187286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(*I)) { 187386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // Shuffle can be folded if it has no other input 187486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<UndefValue>(SI->getOperand(1))) 187586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 187686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 187786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<ExtractElementInst>(*I)) 187878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 187978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTreeInstrs.count(*I)) 188078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 188178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 188278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 188378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 188478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 188578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 188678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 1887245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (Ty1->isVectorTy()) { 188878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 188978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty1, VTy); 1890245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1891245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_ExtractSubvector, VTy, 0, Ty1)); 1892245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } else 1893abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 189478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 0); 189578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 189678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 189778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << "} = " << ESContrib << "\n"); 189878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 189978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 190078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 190178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = false; 190278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (Value::use_iterator I = S->second->use_begin(), 190378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IE = S->second->use_end(); I != IE; ++I) { 190486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(*I)) { 190586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // Shuffle can be folded if it has no other input 190686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<UndefValue>(SI->getOperand(1))) 190786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 190886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 190986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<ExtractElementInst>(*I)) 191078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 191178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTreeInstrs.count(*I)) 191278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 191378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 191478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 191578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 191678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 191778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 191878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 1919245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (Ty2->isVectorTy()) { 192078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 192178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty2, VTy); 1922245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1923245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_ExtractSubvector, VTy, 1924245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel Ty1->isVectorTy() ? Ty1->getVectorNumElements() : 1, Ty2)); 1925245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } else 1926abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 192778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 1); 192878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 192978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->second << "} = " << ESContrib << "\n"); 193078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 193178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 193278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 193378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 193478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of incoming edges. 193578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!isa<LoadInst>(S->first) && !isa<StoreInst>(S->first)) { 193678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction *S1 = cast<Instruction>(S->first), 193778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S2 = cast<Instruction>(S->second); 193878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (unsigned o = 0; o < S1->getNumOperands(); ++o) { 193978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Value *O1 = S1->getOperand(o), *O2 = S2->getOperand(o); 194078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 194178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining constants into vector constants (or small vector 194278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // constants into larger ones are assumed free). 194378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (isa<Constant>(O1) && isa<Constant>(O2)) 194478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 194578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 194678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (FlipOrder) 194778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(O1, O2); 194878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 194978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VP = ValuePair(O1, O2); 195078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VPR = ValuePair(O2, O1); 195178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 195278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Internal edges are not handled here. 195378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (PrunedTree.count(VP) || PrunedTree.count(VPR)) 195478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 195578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 195678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = O1->getType(), 195778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = O2->getType(); 195878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 195978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 196078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining vector operations of the same type is also assumed 196178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // folded with other operations. 196286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (Ty1 == Ty2) { 196386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are insert elements, then both can be widened. 1964b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel InsertElementInst *IEO1 = dyn_cast<InsertElementInst>(O1), 1965b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel *IEO2 = dyn_cast<InsertElementInst>(O2); 1966b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (IEO1 && IEO2 && isPureIEChain(IEO1) && isPureIEChain(IEO2)) 196786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 196886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are extract elements, and both have the same input 196986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // type, then they can be replaced with a shuffle 197086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel ExtractElementInst *EIO1 = dyn_cast<ExtractElementInst>(O1), 197186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel *EIO2 = dyn_cast<ExtractElementInst>(O2); 197286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (EIO1 && EIO2 && 197386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel EIO1->getOperand(0)->getType() == 197486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel EIO2->getOperand(0)->getType()) 197586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 197686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are a shuffle with equal operand types and only two 197786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // unqiue operands, then they can be replaced with a single 197886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // shuffle 197986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel ShuffleVectorInst *SIO1 = dyn_cast<ShuffleVectorInst>(O1), 198086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel *SIO2 = dyn_cast<ShuffleVectorInst>(O2); 198186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (SIO1 && SIO2 && 198286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIO1->getOperand(0)->getType() == 198386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIO2->getOperand(0)->getType()) { 198486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SmallSet<Value *, 4> SIOps; 198586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO1->getOperand(0)); 198686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO1->getOperand(1)); 198786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO2->getOperand(0)); 198886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO2->getOperand(1)); 198986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (SIOps.size() <= 2) 199086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 199186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 199286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 199378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 199478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 199578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // This pair has already been formed. 199678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (IncomingPairs.count(VP)) { 199778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 199878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (IncomingPairs.count(VPR)) { 199978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 200078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 2001245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 2002245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (VTy->getVectorNumElements() == 2) 2003245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 2004245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Reverse, VTy)); 200578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy() && !Ty2->isVectorTy()) { 2006abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 200778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 0); 2008abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib += (int) TTI->getVectorInstrCost( 200978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 1); 201078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy()) { 201178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O1 needs to be inserted into a vector of size O2, and then 201278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 2013abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 201478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty2, 0); 201578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 201678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty2); 201778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty2->isVectorTy()) { 201878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O2 needs to be inserted into a vector of size O1, and then 201978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 2020abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 202178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty1, 0); 202278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 202378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty1); 202478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else { 202578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *TyBig = Ty1, *TySmall = Ty2; 202678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty2->getVectorNumElements() > Ty1->getVectorNumElements()) 202778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(TyBig, TySmall); 202878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 202978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 203078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, TyBig); 203178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (TyBig != TySmall) 203278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 203378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel TyBig, TySmall); 203478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 203578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 203678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" 203778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *O1 << " <-> " << *O2 << "} = " << 203878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 203978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 204078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IncomingPairs.insert(VP); 204186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 204286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 204365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 20444387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 20454387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel if (!HasNontrivialInsts) { 20464387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel DEBUG(if (DebugPairSelection) dbgs() << 20474387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel "\tNo non-trivial instructions in tree;" 20484387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel " override to zero effective size\n"); 20494387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel EffSize = 0; 20504387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel } 205165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 205265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel for (DenseSet<ValuePair>::iterator S = PrunedTree.begin(), 205365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel E = PrunedTree.end(); S != E; ++S) 205465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize += (int) getDepthFactor(S->first); 205565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 2056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) 2058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: found pruned Tree for pair {" 2059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *J->first << " <-> " << *J->second << "} of depth " << 2060de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel MaxDepth << " and size " << PrunedTree.size() << 2061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " (effective size: " << EffSize << ")\n"); 2062abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (((TTI && !UseChainDepthWithTI) || 206378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel MaxDepth >= Config.ReqChainDepth) && 206465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize > 0 && EffSize > BestEffSize) { 2065de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestMaxDepth = MaxDepth; 2066de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestEffSize = EffSize; 2067de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree = PrunedTree; 2068de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2069de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2070de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2071de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2072de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given the list of candidate pairs, this function selects those 2073de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that will be fused into vector instructions. 2074de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::choosePairs( 2075de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &CandidatePairs, 207665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 2077de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 207886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 207986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 2080de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 208186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps, 2082de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers, 2083de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>& ChosenPairs) { 2084bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UseCycleCheck = 2085bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng CandidatePairs.size() <= Config.MaxCandPairsForCycleCheck; 2086de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<ValuePair, ValuePair> PairableInstUserMap; 2087da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> PairableInstUserPairSet; 2088de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator I = PairableInsts.begin(), 2089de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PairableInsts.end(); I != E; ++I) { 2090de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The number of possible pairings for this variable: 2091de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t NumChoices = CandidatePairs.count(*I); 2092de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!NumChoices) continue; 2093de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2094de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair ChoiceRange = CandidatePairs.equal_range(*I); 2095de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2096de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The best pair to choose and its tree: 209765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel size_t BestMaxDepth = 0; 209865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int BestEffSize = 0; 2099de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> BestTree; 210065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel findBestTreeFor(CandidatePairs, CandidatePairCostSavings, 210186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 210286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 2103da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel PairableInstUsers, PairableInstUserMap, 2104da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel PairableInstUserPairSet, ChosenPairs, 2105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestTree, BestMaxDepth, BestEffSize, ChoiceRange, 2106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck); 2107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A tree has been chosen (or not) at this point. If no tree was 2109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chosen, then this instruction, I, cannot be paired (and is no longer 2110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // considered). 2111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2112de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (BestTree.size() > 0) 2113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: selected pairs in the best tree for: " 2114de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *cast<Instruction>(*I) << "\n"); 2115de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2116de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<ValuePair>::iterator S = BestTree.begin(), 2117de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE2 = BestTree.end(); S != SE2; ++S) { 2118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Insert the members of this tree into the list of chosen pairs. 2119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(ValuePair(S->first, S->second)); 2120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected pair: " << *S->first << " <-> " << 2121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *S->second << "\n"); 2122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove all candidate pairs that have values in the chosen tree. 2124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator K = 2125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.begin(); K != CandidatePairs.end();) { 2126de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (K->first == S->first || K->second == S->first || 2127de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->second == S->second || K->first == S->second) { 2128de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Don't remove the actual pair chosen so that it can be used 2129de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // in subsequent tree selections. 2130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(K->first == S->first && K->second == S->second)) 2131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CandidatePairs.erase(K++); 2132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 2133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 2134de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2135de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++K; 2136de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2139de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2141de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected " << ChosenPairs.size() << " pairs.\n"); 2142de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2143de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::string getReplacementName(Instruction *I, bool IsInput, unsigned o, 2145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned n = 0) { 2146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!I->hasName()) 2147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ""; 2148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (I->getName() + (IsInput ? ".v.i" : ".v.r") + utostr(o) + 2150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (n > 0 ? "." + utostr(n) : "")).str(); 2151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the pointer input to the vector 2154de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 2155de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementPointerInput(LLVMContext& Context, 2156202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *I, Instruction *J, unsigned o) { 2157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 215865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 2159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts; 2160282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2161202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel // Note: the analysis might fail here, that is why the pair order has 2162282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel // been precomputed (OffsetInElmts must be unused here). 2163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 216465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 216593f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel OffsetInElmts, false); 2166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The pointer value is taken to be the one with the lowest offset. 2168202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Value *VPtr = IPtr; 2169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 217064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = cast<PointerType>(IPtr->getType())->getElementType(); 217164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = cast<PointerType>(JPtr->getType())->getElementType(); 217264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *VArgPtrType = PointerType::get(VArgType, 2174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cast<PointerType>(IPtr->getType())->getAddressSpace()); 2175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BitCastInst(VPtr, VArgPtrType, getReplacementName(I, true, o), 2176202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel /* insert before */ I); 2177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fillNewShuffleMask(LLVMContext& Context, Instruction *J, 218064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 218164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 218264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask) { 218364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElem1 = cast<VectorType>(J->getType())->getNumElements(); 218464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < NumElem1; ++v) { 2185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int m = cast<ShuffleVectorInst>(J)->getMaskValue(v); 2186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m < 0) { 2187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = UndefValue::get(Type::getInt32Ty(Context)); 2188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned mm = m + (int) IdxOffset; 219064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (m >= (int) NumInElem1) 2191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel mm += (int) NumInElem; 2192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = 2194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt::get(Type::getInt32Ty(Context), mm); 2195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2199de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the vector-shuffle mask to the 2200de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector instruction that fuses I with J. 2201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementShuffleMask(LLVMContext& Context, 2202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the shuffle mask. We need to append the second 2204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // mask to the first, and the numbers need to be adjusted. 2205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 220664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 220764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 220864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 220964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 221064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumElemI = cast<VectorType>(ArgTypeI)->getNumElements(); 2211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Get the total number of elements in the fused vector type. 2213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // By definition, this must equal the number of elements in 2214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the final mask. 2215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumElem = cast<VectorType>(VArgType)->getNumElements(); 2216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(NumElem); 2217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 221864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeI = I->getOperand(0)->getType(); 221964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemI = cast<VectorType>(OpTypeI)->getNumElements(); 222064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeJ = J->getOperand(0)->getType(); 222164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElemJ = cast<VectorType>(OpTypeJ)->getNumElements(); 222264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 222364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The fused vector will be: 222464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 222564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // | NumInElemI | NumInElemJ | NumInElemI | NumInElemJ | 222664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 222764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // from which we'll extract NumElem total elements (where the first NumElemI 222864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // of them come from the mask in I and the remainder come from the mask 222964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // in J. 2230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2231de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the first pair... 223264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, I, 0, NumInElemJ, NumInElemI, 223364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 0, Mask); 2234de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2235de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the second pair... 223664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, J, NumElemI, NumInElemI, NumInElemJ, 223764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NumInElemI, Mask); 2238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ConstantVector::get(Mask); 2240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 224264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::expandIEChain(LLVMContext& Context, Instruction *I, 224364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *J, unsigned o, Value *&LOp, 224464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL, 224564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL, Type *ArgTypeH, 224672465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ, unsigned IdxOff) { 224764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ExpandedIEChain = false; 224864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (InsertElementInst *LIE = dyn_cast<InsertElementInst>(LOp)) { 224964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If we have a pure insertelement chain, then this can be rewritten 225064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // into a chain that directly builds the larger type. 2251b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (isPureIEChain(LIE)) { 225264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<Value *, 8> VectElemts(numElemL, 225364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(ArgTypeL->getScalarType())); 225464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 225564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 225664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = 225764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LIENext->getOperand(2))->getSExtValue(); 225864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectElemts[Idx] = LIENext->getOperand(1); 225964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 226064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 226164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 226264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = 0; 226364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LIEPrev = UndefValue::get(ArgTypeH); 226464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 226564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<UndefValue>(VectElemts[i])) continue; 226664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = InsertElementInst::Create(LIEPrev, VectElemts[i], 226764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 226864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel i + IdxOff), 226972465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 227072465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, i+1)); 227172465ea23d010507d3746adc126d719005981e05Hal Finkel LIENext->insertBefore(IBeforeJ ? J : I); 227264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIEPrev = LIENext; 227364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 227464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 227564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = LIENext ? (Value*) LIENext : UndefValue::get(ArgTypeH); 227664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExpandedIEChain = true; 227764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 227864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 227964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 228064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return ExpandedIEChain; 228164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 228264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value to be used as the specified operand of the vector 2284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 2285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementInput(LLVMContext& Context, Instruction *I, 228672465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ) { 2287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 2289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 229064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Compute the fused vector type for this operand 229164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getOperand(o)->getType(); 229264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getOperand(o)->getType(); 229364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2295de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *L = I, *H = J; 229664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL = ArgTypeI, *ArgTypeH = ArgTypeJ; 2297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 229864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL; 229964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeL->isVectorTy()) 230064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = cast<VectorType>(ArgTypeL)->getNumElements(); 230164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 230264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL = 1; 2303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 230464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemH; 230564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgTypeH->isVectorTy()) 230664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = cast<VectorType>(ArgTypeH)->getNumElements(); 230764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 230864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemH = 1; 230964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 231064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LOp = L->getOperand(o); 231164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *HOp = H->getOperand(o); 231264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VArgType->getNumElements(); 231364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 231464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // First, we check if we can reuse the "original" vector outputs (if these 231564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // exist). We might need a shuffle. 231664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *LEE = dyn_cast<ExtractElementInst>(LOp); 231764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *HEE = dyn_cast<ExtractElementInst>(HOp); 231864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *LSV = dyn_cast<ShuffleVectorInst>(LOp); 231964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *HSV = dyn_cast<ShuffleVectorInst>(HOp); 232064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 232164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // FIXME: If we're fusing shuffle instructions, then we can't apply this 232264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // optimization. The input vectors to the shuffle might be a different 232364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // length from the shuffle outputs. Unfortunately, the replacement 232464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // shuffle mask has already been formed, and the mask entries are sensitive 232564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // to the sizes of the inputs. 232664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool IsSizeChangeShuffle = 232764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel isa<ShuffleVectorInst>(L) && 232864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (LOp->getType() != L->getType() || HOp->getType() != H->getType()); 232964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 233064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if ((LEE || LSV) && (HEE || HSV) && !IsSizeChangeShuffle) { 233164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We can have at most two unique vector inputs. 233264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool CanUseInputs = true; 233364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I1, *I2 = 0; 233464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 233564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LEE->getOperand(0); 233664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 233764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LSV->getOperand(0); 233864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = LSV->getOperand(1); 233964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I2 == I1 || isa<UndefValue>(I2)) 234064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = 0; 234164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 234264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 234364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 234464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HEE->getOperand(0); 234564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 234664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 234764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 234864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 234964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 235064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HSV->getOperand(0); 235164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 235264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 235364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 235464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 235564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 235664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 235764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I4 = HSV->getOperand(1); 235864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(I4)) { 235964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I4 != I1) 236064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I4; 236164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I4 != I1 && I4 != I2) 236264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 236364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 236464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 236564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 236664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 236764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 236864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned LOpElem = 236964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(LOp)->getOperand(0)->getType()) 237064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 237164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned HOpElem = 237264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<VectorType>(cast<Instruction>(HOp)->getOperand(0)->getType()) 237364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ->getNumElements(); 237464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 237564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We have one or two input vectors. We need to map each index of the 237664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // operands to the index of the original vector. 237764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<std::pair<int, int>, 8> II(numElem); 237864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 237964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 238064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 238164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 238264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LEE->getOperand(1))->getSExtValue(); 238364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LEE->getOperand(0) == I1 ? 0 : 1; 238464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 238564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = LSV->getMaskValue(i); 238664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) LOpElem) { 238764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(0) == I1 ? 0 : 1; 238864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 238964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= LOpElem; 239064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(1) == I1 ? 0 : 1; 239164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 239264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 239364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 239464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i] = std::pair<int, int>(Idx, INum); 239564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 239664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemH; ++i) { 239764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 239864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 239964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 240064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(HEE->getOperand(1))->getSExtValue(); 240164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HEE->getOperand(0) == I1 ? 0 : 1; 240264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 240364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = HSV->getMaskValue(i); 240464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) HOpElem) { 240564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(0) == I1 ? 0 : 1; 240664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 240764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= HOpElem; 240864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(1) == I1 ? 0 : 1; 240964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 241264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i + numElemL] = std::pair<int, int>(Idx, INum); 241364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 241564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We now have an array which tells us from which index of which 241664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // input vector each element of the operand comes. 241764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I1T = cast<VectorType>(I1->getType()); 241864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I1Elem = I1T->getNumElements(); 241964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 242064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2) { 242164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // In this case there is only one underlying vector input. Check for 242264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // the trivial case where we can use the input directly. 242364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem == numElem) { 242464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ElemInOrder = true; 242564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 242664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[i].first != (int) i && II[i].first != -1) { 242764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ElemInOrder = false; 242864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 242964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 243064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 243164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 243264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ElemInOrder) 243364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return I1; 243464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 243564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 243664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // A shuffle is needed. 243764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 243864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 243964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[i].first; 244064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx == -1) 244164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = UndefValue::get(Type::getInt32Ty(Context)); 244264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 244364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 244464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 244564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 244664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 244764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 244864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 244972465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 245072465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 245172465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 245264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 245364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 245464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 245564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I2T = cast<VectorType>(I2->getType()); 245664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I2Elem = I2T->getNumElements(); 245764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 245864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This input comes from two distinct vectors. The first step is to 245964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // make sure that both vectors are the same length. If not, the 246064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // smaller one will need to grow before they can be shuffled together. 246164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem < I2Elem) { 246264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I2Elem); 246364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 246464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 246564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 246664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 246764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 246864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 246964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI1 = 247064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 247164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 247272465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 247372465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 247472465ea23d010507d3746adc126d719005981e05Hal Finkel NewI1->insertBefore(IBeforeJ ? J : I); 247564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = NewI1; 247664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1T = I2T; 247764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1Elem = I2Elem; 247864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (I1Elem > I2Elem) { 247964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I1Elem); 248064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 248164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 248264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 248364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 248464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 248564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 248664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI2 = 248764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I2, UndefValue::get(I2T), 248864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 248972465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 249072465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 249172465ea23d010507d3746adc126d719005981e05Hal Finkel NewI2->insertBefore(IBeforeJ ? J : I); 249264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = NewI2; 249364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2T = I1T; 249464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2Elem = I1Elem; 249564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 249664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 249764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Now that both I1 and I2 are the same length we can shuffle them 249864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // together (and use the result). 249964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 250064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 250164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[v].first == -1) { 250264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 250364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 250464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[v].first + II[v].second * I1Elem; 250564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 250664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 250764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 250864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 250964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewOp = 251064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, I2, ConstantVector::get(Mask), 251172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 251272465ea23d010507d3746adc126d719005981e05Hal Finkel NewOp->insertBefore(IBeforeJ ? J : I); 251364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return NewOp; 251464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 251764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgType = ArgTypeL; 251864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL < numElemH) { 251964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL == 1 && expandIEChain(Context, I, J, o, HOp, numElemH, 252072465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, VArgType, IBeforeJ, 1)) { 252164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This is another short-circuit case: we're combining a scalar into 252264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // a vector that is formed by an IE chain. We've just expanded the IE 252364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // chain, now insert the scalar and we're done. 252464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 252564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = InsertElementInst::Create(HOp, LOp, CV0, 252672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 252772465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 252864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 252964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, LOp, numElemL, ArgTypeL, 253072465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, IBeforeJ)) { 253164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The two vector inputs to the shuffle must be the same length, 253264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // so extend the smaller vector to be the same length as the larger one. 253364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NLOp; 253464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL > 1) { 253564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 253664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemH); 253764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 253864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 253964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 254064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 254164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 254264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 254364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = new ShuffleVectorInst(LOp, UndefValue::get(ArgTypeL), 254464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 254572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 254672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 254764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 254864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = InsertElementInst::Create(UndefValue::get(ArgTypeH), LOp, CV0, 254972465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 255072465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 255164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 255264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 255372465ea23d010507d3746adc126d719005981e05Hal Finkel NLOp->insertBefore(IBeforeJ ? J : I); 255464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = NLOp; 255564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 255664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 255764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ArgType = ArgTypeH; 255864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (numElemL > numElemH) { 255964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH == 1 && expandIEChain(Context, I, J, o, LOp, numElemL, 256072465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, VArgType, IBeforeJ)) { 256164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 256264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst::Create(LOp, HOp, 256364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 256464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL), 256572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 256672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 256772465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 256864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 256964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, HOp, numElemH, ArgTypeH, 257072465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, IBeforeJ)) { 257164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NHOp; 257264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH > 1) { 257364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemL); 257464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 257564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 257664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 257764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 257864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 257964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 258064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = new ShuffleVectorInst(HOp, UndefValue::get(ArgTypeH), 258164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 258272465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 258372465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 258464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 258564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = InsertElementInst::Create(UndefValue::get(ArgTypeL), HOp, CV0, 258672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 258772465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 258864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 258964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 259072465ea23d010507d3746adc126d719005981e05Hal Finkel NHOp->insertBefore(IBeforeJ ? J : I); 259164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel HOp = NHOp; 2592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 259364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 259564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgType->isVectorTy()) { 259664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = cast<VectorType>(VArgType)->getNumElements(); 259764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask(numElem); 259864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 259964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = v; 260064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If the low vector was expanded, we need to skip the extra 260164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // undefined entries. 260264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (v >= numElemL && numElemH > numElemL) 260364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx += (numElemH - numElemL); 260464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 260564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 260764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV = new ShuffleVectorInst(LOp, HOp, 260872465ea23d010507d3746adc126d719005981e05Hal Finkel ConstantVector::get(Mask), 260972465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 261072465ea23d010507d3746adc126d719005981e05Hal Finkel BV->insertBefore(IBeforeJ ? J : I); 2611de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 2612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV1 = InsertElementInst::Create( 261564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(VArgType), LOp, CV0, 261672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 261772465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 261872465ea23d010507d3746adc126d719005981e05Hal Finkel BV1->insertBefore(IBeforeJ ? J : I); 261964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV2 = InsertElementInst::Create(BV1, HOp, CV1, 262072465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 262172465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 2)); 262272465ea23d010507d3746adc126d719005981e05Hal Finkel BV2->insertBefore(IBeforeJ ? J : I); 2623de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV2; 2624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2625de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates an array of values that will be used as the inputs 2627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to the vector instruction that fuses I with J. 2628de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::getReplacementInputsForPair(LLVMContext& Context, 2629de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, 263072465ea23d010507d3746adc126d719005981e05Hal Finkel SmallVector<Value *, 3> &ReplacedOperands, 263172465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ) { 2632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned p = 0, o = NumOperands-1; p < NumOperands; ++p, --o) { 2635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate backward so that we look at the store pointer 2636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first and know whether or not we need to flip the inputs. 2637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I) || (o == 1 && isa<StoreInst>(I))) { 2639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the pointer for a load/store instruction. 2640202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ReplacedOperands[o] = getReplacementPointerInput(Context, I, J, o); 2641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 26426173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (isa<CallInst>(I)) { 2643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = cast<CallInst>(I)->getCalledFunction(); 2644a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) F->getIntrinsicID(); 26456173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (o == NumOperands-1) { 26466173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel BasicBlock &BB = *I->getParent(); 2647bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 26486173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Module *M = BB.getParent()->getParent(); 264964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 265064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 265164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2652bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 2653a77728415857196035c0090f7b2749d7971811a2Hal Finkel ReplacedOperands[o] = Intrinsic::getDeclaration(M, IID, VArgType); 26546173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 26556173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (IID == Intrinsic::powi && o == 1) { 26566173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // The second argument of powi is a single integer and we've already 26576173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // checked that both arguments are equal. As a result, we just keep 26586173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel // I's second argument. 26596173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = I->getOperand(o); 26606173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 26616173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 2662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I) && o == NumOperands-1) { 2663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementShuffleMask(Context, I, J); 2664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 266772465ea23d010507d3746adc126d719005981e05Hal Finkel ReplacedOperands[o] = getReplacementInput(Context, I, J, o, IBeforeJ); 2668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates two values that represent the outputs of the 2672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // original I and J instructions. These are generally vector shuffles 2673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // or extracts. In many cases, these will end up being unused and, thus, 2674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // eliminated by later passes. 2675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 2676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 2677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2678202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K1, Instruction *&K2) { 2679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 2680de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K); 2681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K); 2682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *IType = I->getType(); 268464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *JType = J->getType(); 268564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 268664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VType = getVecTypeForPair(IType, JType); 268764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VType->getNumElements(); 268864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 268964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemI, numElemJ; 269064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (IType->isVectorTy()) 269164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = cast<VectorType>(IType)->getNumElements(); 269264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 269364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemI = 1; 269464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 269564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) 269664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = cast<VectorType>(JType)->getNumElements(); 269764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 269864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemJ = 1; 2699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IType->isVectorTy()) { 270164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemI), Mask2(numElemI); 270264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemI; ++v) { 270364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 270464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemJ+v); 270564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2706de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 270764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K1 = new ShuffleVectorInst(K, UndefValue::get(VType), 2708202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask1), 270964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 1)); 2710de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 271164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2712202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K1 = ExtractElementInst::Create(K, CV0, 2713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 271464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 271564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 271664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) { 271764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemJ), Mask2(numElemJ); 271864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemJ; ++v) { 271964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 272064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemI+v); 272164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 272264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 272364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K2 = new ShuffleVectorInst(K, UndefValue::get(VType), 2724202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask2), 272564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 2)); 272664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 272764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), numElem-1); 2728202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K2 = ExtractElementInst::Create(K, CV1, 2729de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 2730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2731de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1->insertAfter(K); 2733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2->insertAfter(K1); 2734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = K2; 2735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::canMoveUsesOfIAfterJ(BasicBlock &BB, 2740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2743ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2746de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J; ++L) 2748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet); 2749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(cast<Instruction>(L) == J && 2751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel "Tracking has not proceeded far enough to check for dependencies"); 2752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If J is now in the use set of I, then trackUsesOfI will return true 2753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and we have a dependency cycle (and the fusing operation must abort). 2754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSet); 2755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2757de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2758de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::moveUsesOfIAfterJ(BasicBlock &BB, 2759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2760de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2763ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J;) { 2768de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSet)) { 2769de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move this instruction 2770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InstToMove = L; ++L; 2771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2772de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: moving: " << *InstToMove << 2773de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " to after " << *InsertionPt << "\n"); 2774de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->removeFromParent(); 2775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->insertAfter(InsertionPt); 2776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = InstToMove; 2777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++L; 2779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2780de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Collect all load instruction that are in the move set of a given first 2784de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair member. These loads depend on the first instruction, I, and so need 2785de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to be moved after J (the second instruction) when the pair is fused. 2786de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectPairLoadMoveSet(BasicBlock &BB, 2787de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2788de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet, 2789de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I) { 2790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 2791ded681d2725907c7de9db53d59cee0c51fad6fcbBenjamin Kramer BasicBlock::iterator L = llvm::next(BasicBlock::iterator(I)); 2792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2794de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: We cannot end the loop when we reach J because J could be moved 2797de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // farther down the use chain by another instruction pairing. Also, J 2798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be before I if this is an inverted input. 2799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator E = BB.end(); cast<Instruction>(L) != E; ++L) { 2800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L)) { 2801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (L->mayReadFromMemory()) 2802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(ValuePair(L, I)); 2803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2804de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // In cases where both load/stores and the computation of their pointers 2808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // are chosen for vectorization, we can end up in a situation where the 2809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // aliasing analysis starts returning different query results as the 2810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // process of fusing instruction pairs continues. Because the algorithm 2811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // relies on finding the same use trees here as were found earlier, we'll 2812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to precompute the necessary aliasing information here and then 2813de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // manually update it during the fusion process. 2814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectLoadMoveSet(BasicBlock &BB, 2815de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 2817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> &LoadMoveSet) { 2818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 2819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PIE = PairableInsts.end(); PI != PIE; ++PI) { 2820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(*PI); 2821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) continue; 2822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2823de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first); 2824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectPairLoadMoveSet(BB, ChosenPairs, LoadMoveSet, I); 2825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2828ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // When the first instruction in each pair is cloned, it will inherit its 2829ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // parent's metadata. This metadata must be combined with that of the other 2830ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // instruction in a safe way. 2831ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void BBVectorize::combineMetadata(Instruction *K, const Instruction *J) { 2832ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel SmallVector<std::pair<unsigned, MDNode*>, 4> Metadata; 2833ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->getAllMetadataOtherThanDebugLoc(Metadata); 2834ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel for (unsigned i = 0, n = Metadata.size(); i < n; ++i) { 2835ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel unsigned Kind = Metadata[i].first; 2836ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *JMD = J->getMetadata(Kind); 2837ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *KMD = Metadata[i].second; 2838ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2839ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel switch (Kind) { 2840ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel default: 2841ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, 0); // Remove unknown metadata 2842ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2843ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_tbaa: 2844ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericTBAA(JMD, KMD)); 2845ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2846ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_fpmath: 2847ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericFPMath(JMD, KMD)); 2848ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2849ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2850ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2851ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2852ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2853de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function fuses the chosen instruction pairs into vector instructions, 2854de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // taking care preserve any needed scalar outputs and, then, it reorders the 2855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // remaining instructions as needed (users of the first member of the pair 2856de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to be moved to after the location of the second member of the pair 2857de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the vector instruction is inserted in the location of the pair's 2858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // second member). 2859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fuseChosenPairs(BasicBlock &BB, 2860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2861a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 286272465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 286372465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 286472465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairs, 286572465ea23d010507d3746adc126d719005981e05Hal Finkel std::multimap<ValuePair, ValuePair> &ConnectedPairDeps) { 2866de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LLVMContext& Context = BB.getContext(); 2867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // During the vectorization process, the order of the pairs to be fused 2869de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be flipped. So we'll add each pair, flipped, into the ChosenPairs 2870de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // list. After a pair is fused, the flipped pair is removed from the list. 287172465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> FlippedPairs; 2872de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator P = ChosenPairs.begin(), 2873de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); P != E; ++P) 287472465ea23d010507d3746adc126d719005981e05Hal Finkel FlippedPairs.insert(ValuePair(P->second, P->first)); 287572465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseSet<ValuePair>::iterator P = FlippedPairs.begin(), 2876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = FlippedPairs.end(); P != E; ++P) 2877de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(*P); 2878de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2879de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::multimap<Value *, Value *> LoadMoveSet; 2880de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel collectLoadMoveSet(BB, PairableInsts, ChosenPairs, LoadMoveSet); 2881de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2882de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: initial: \n" << BB << "\n"); 2883de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2884de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator PI = BB.getFirstInsertionPt(); PI != BB.end();) { 2885de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(PI); 2886de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) { 2887de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2888de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2889de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2890de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2891de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getDepthFactor(P->first) == 0) { 2892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // These instructions are not really fused, but are tracked as though 2893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // they are. Any case in which it would be interesting to fuse them 2894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // will be taken care of by InstCombine. 2895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2899de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first), 2901de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *J = cast<Instruction>(P->second); 2902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing: " << *I << 2904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 2905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove the pair and flipped pair from the list. 2907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator FP = ChosenPairs.find(P->second); 2908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(FP != ChosenPairs.end() && "Flipped pair not found in list"); 2909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(FP); 2910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(P); 2911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!canMoveUsesOfIAfterJ(BB, LoadMoveSet, I, J)) { 2913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusion of: " << *I << 2914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << 2915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " aborted because of non-trivial dependency cycle\n"); 2916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 2917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 2918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2919de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2920de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2921a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel // If the pair must have the other order, then flip it. 2922a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel bool FlipPairOrder = FixedOrderPairs.count(ValuePair(J, I)); 292372465ea23d010507d3746adc126d719005981e05Hal Finkel if (!FlipPairOrder && !FixedOrderPairs.count(ValuePair(I, J))) { 292472465ea23d010507d3746adc126d719005981e05Hal Finkel // This pair does not have a fixed order, and so we might want to 292572465ea23d010507d3746adc126d719005981e05Hal Finkel // flip it if that will yield fewer shuffles. We count the number 292672465ea23d010507d3746adc126d719005981e05Hal Finkel // of dependencies connected via swaps, and those directly connected, 292772465ea23d010507d3746adc126d719005981e05Hal Finkel // and flip the order if the number of swaps is greater. 292872465ea23d010507d3746adc126d719005981e05Hal Finkel bool OrigOrder = true; 292972465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairDeps.equal_range(ValuePair(I, J)); 293072465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first == ConnectedPairDeps.end()) { 293172465ea23d010507d3746adc126d719005981e05Hal Finkel IP = ConnectedPairDeps.equal_range(ValuePair(J, I)); 293272465ea23d010507d3746adc126d719005981e05Hal Finkel OrigOrder = false; 293372465ea23d010507d3746adc126d719005981e05Hal Finkel } 293472465ea23d010507d3746adc126d719005981e05Hal Finkel 293572465ea23d010507d3746adc126d719005981e05Hal Finkel if (IP.first != ConnectedPairDeps.end()) { 293672465ea23d010507d3746adc126d719005981e05Hal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 293772465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 293872465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 293972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = 294072465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(Q->second, Q->first)); 294172465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 294272465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 294372465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 294472465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsDirect; 294572465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 294672465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsSwap; 294772465ea23d010507d3746adc126d719005981e05Hal Finkel } 294872465ea23d010507d3746adc126d719005981e05Hal Finkel 294972465ea23d010507d3746adc126d719005981e05Hal Finkel if (!OrigOrder) 295072465ea23d010507d3746adc126d719005981e05Hal Finkel std::swap(NumDepsDirect, NumDepsSwap); 295172465ea23d010507d3746adc126d719005981e05Hal Finkel 295272465ea23d010507d3746adc126d719005981e05Hal Finkel if (NumDepsSwap > NumDepsDirect) { 295372465ea23d010507d3746adc126d719005981e05Hal Finkel FlipPairOrder = true; 295472465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(dbgs() << "BBV: reordering pair: " << *I << 295572465ea23d010507d3746adc126d719005981e05Hal Finkel " <-> " << *J << "\n"); 295672465ea23d010507d3746adc126d719005981e05Hal Finkel } 295772465ea23d010507d3746adc126d719005981e05Hal Finkel } 295872465ea23d010507d3746adc126d719005981e05Hal Finkel } 2959282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2960202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *L = I, *H = J; 2961a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FlipPairOrder) 2962202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel std::swap(H, L); 2963202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel 296472465ea23d010507d3746adc126d719005981e05Hal Finkel // If the pair being fused uses the opposite order from that in the pair 296572465ea23d010507d3746adc126d719005981e05Hal Finkel // connection map, then we need to flip the types. 296672465ea23d010507d3746adc126d719005981e05Hal Finkel VPPIteratorPair IP = ConnectedPairs.equal_range(ValuePair(H, L)); 296772465ea23d010507d3746adc126d719005981e05Hal Finkel for (std::multimap<ValuePair, ValuePair>::iterator Q = IP.first; 296872465ea23d010507d3746adc126d719005981e05Hal Finkel Q != IP.second; ++Q) { 296972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = PairConnectionTypes.find(*Q); 297072465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 297172465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 297272465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 297372465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionSwap; 297472465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 297572465ea23d010507d3746adc126d719005981e05Hal Finkel R->second = PairConnectionDirect; 297672465ea23d010507d3746adc126d719005981e05Hal Finkel } 297772465ea23d010507d3746adc126d719005981e05Hal Finkel 297872465ea23d010507d3746adc126d719005981e05Hal Finkel bool LBeforeH = !FlipPairOrder; 2979de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2980de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> ReplacedOperands(NumOperands); 298172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementInputsForPair(Context, L, H, ReplacedOperands, 298272465ea23d010507d3746adc126d719005981e05Hal Finkel LBeforeH); 2983de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2984de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make a copy of the original operation, change its type to the vector 2985de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and replace its operands with the vector operands. 298672465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *K = L->clone(); 298772465ea23d010507d3746adc126d719005981e05Hal Finkel if (L->hasName()) 298872465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(L); 298972465ea23d010507d3746adc126d719005981e05Hal Finkel else if (H->hasName()) 299072465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(H); 2991de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2992de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(K)) 2993202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K->mutateType(getVecTypeForPair(L->getType(), H->getType())); 2994de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 299572465ea23d010507d3746adc126d719005981e05Hal Finkel combineMetadata(K, H); 2996430b9079c614cd3f45015a6516590d33742cc802Hal Finkel K->intersectOptionalDataWith(H); 2997ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned o = 0; o < NumOperands; ++o) 2999de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->setOperand(o, ReplacedOperands[o]); 3000de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3001de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->insertAfter(J); 3002de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3003de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instruction insertion point: 3004de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InsertionPt = K; 3005de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *K1 = 0, *K2 = 0; 3006202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel replaceOutputsOfPair(Context, L, H, K, InsertionPt, K1, K2); 3007de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3008de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The use tree of the first original instruction must be moved to after 3009de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the location of the second instruction. The entire use tree of the 3010de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first instruction is disjoint from the input tree of the second 3011de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (by definition), and so commutes with it. 3012de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3013de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel moveUsesOfIAfterJ(BB, LoadMoveSet, InsertionPt, I, J); 3014de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3015de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(I)) { 301672465ea23d010507d3746adc126d719005981e05Hal Finkel L->replaceAllUsesWith(K1); 301772465ea23d010507d3746adc126d719005981e05Hal Finkel H->replaceAllUsesWith(K2); 301872465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(L, K1); 301972465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(H, K2); 3020de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3021de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instructions that may read from memory may be in the load move set. 3023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Once an instruction is fused, we no longer need its move set, and so 3024de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the values of the map never need to be updated. However, when a load 3025de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is fused, we need to merge the entries from both instructions in the 3026de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in case those instructions were in the move set of some other 3027de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // yet-to-be-fused pair. The loads in question are the keys of the map. 3028de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->mayReadFromMemory()) { 3029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> NewSetMembers; 3030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair IPairRange = LoadMoveSet.equal_range(I); 3031de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel VPIteratorPair JPairRange = LoadMoveSet.equal_range(J); 3032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = IPairRange.first; 3033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != IPairRange.second; ++N) 3034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 3035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::multimap<Value *, Value *>::iterator N = JPairRange.first; 3036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel N != JPairRange.second; ++N) 3037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel NewSetMembers.push_back(ValuePair(K, N->second)); 3038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator A = NewSetMembers.begin(), 3039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AE = NewSetMembers.end(); A != AE; ++A) 3040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LoadMoveSet.insert(*A); 3041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3042de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3043de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before removing I, set the iterator to the next instruction. 3044de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PI = llvm::next(BasicBlock::iterator(I)); 3045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (cast<Instruction>(PI) == J) 3046de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 3047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(I); 3049de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(J); 3050de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->eraseFromParent(); 3051de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->eraseFromParent(); 305272465ea23d010507d3746adc126d719005981e05Hal Finkel 305372465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(if (PrintAfterEveryPair) dbgs() << "BBV: block is now: \n" << 305472465ea23d010507d3746adc126d719005981e05Hal Finkel BB << "\n"); 3055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: final: \n" << BB << "\n"); 3058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 3060de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelchar BBVectorize::ID = 0; 3062de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic const char bb_vectorize_name[] = "Basic-Block Vectorization"; 3063de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_BEGIN(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 3064de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_AG_DEPENDENCY(AliasAnalysis) 30658bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler CarruthINITIALIZE_AG_DEPENDENCY(TargetTransformInfo) 3066e29c19091cca58db668407dfc5dd86c70e8b3d49Hal FinkelINITIALIZE_PASS_DEPENDENCY(DominatorTree) 3067de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 3068de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_END(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 3069de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3070bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengBasicBlockPass *llvm::createBBVectorizePass(const VectorizeConfig &C) { 3071bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return new BBVectorize(C); 3072de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 3073de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3074bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengbool 3075bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengllvm::vectorizeBasicBlock(Pass *P, BasicBlock &BB, const VectorizeConfig &C) { 3076bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize BBVectorizer(P, C); 307787825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return BBVectorizer.vectorizeBB(BB); 307887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng} 3079bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 3080bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng//===----------------------------------------------------------------------===// 3081bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengVectorizeConfig::VectorizeConfig() { 3082bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng VectorBits = ::VectorBits; 3083768edf3cd037aab10391abc279f71470df8e3156Hal Finkel VectorizeBools = !::NoBools; 308486312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeInts = !::NoInts; 308586312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFloats = !::NoFloats; 3086f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizePointers = !::NoPointers; 308786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeCasts = !::NoCasts; 308886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMath = !::NoMath; 308986312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFMA = !::NoFMA; 3090fc3665c87519850f629c9565535e3be447e10addHal Finkel VectorizeSelect = !::NoSelect; 3091e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel VectorizeCmp = !::NoCmp; 3092f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizeGEP = !::NoGEP; 309386312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMemOps = !::NoMemOps; 3094bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng AlignedOnly = ::AlignedOnly; 3095bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng ReqChainDepth= ::ReqChainDepth; 3096bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SearchLimit = ::SearchLimit; 3097bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxCandPairsForCycleCheck = ::MaxCandPairsForCycleCheck; 3098bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SplatBreaksChain = ::SplatBreaksChain; 3099bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxInsts = ::MaxInsts; 3100bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxIter = ::MaxIter; 310164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Pow2LenOnly = ::Pow2LenOnly; 3102bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng NoMemOpBoost = ::NoMemOpBoost; 3103bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng FastDep = ::FastDep; 3104bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng} 3105