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" 18d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Transforms/Vectorize.h" 19de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseMap.h" 20de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/DenseSet.h" 21d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/ADT/STLExtras.h" 2286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel#include "llvm/ADT/SmallSet.h" 23de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/SmallVector.h" 24de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/Statistic.h" 25de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/ADT/StringExtras.h" 26de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasAnalysis.h" 27de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/AliasSetTracker.h" 28de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolution.h" 29de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ScalarEvolutionExpressions.h" 30be04929f7fd76a921540e9901f24563e51dc1219Chandler Carruth#include "llvm/Analysis/TargetTransformInfo.h" 31de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Analysis/ValueTracking.h" 320b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Constants.h" 330b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/DataLayout.h" 340b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/DerivedTypes.h" 3536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines#include "llvm/IR/Dominators.h" 360b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Function.h" 370b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Instructions.h" 380b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/IntrinsicInst.h" 390b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Intrinsics.h" 400b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/LLVMContext.h" 410b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Metadata.h" 420b8c9a80f20772c3793201ab5b251d3520b9cea3Chandler Carruth#include "llvm/IR/Type.h" 4336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines#include "llvm/IR/ValueHandle.h" 44d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Pass.h" 45de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/CommandLine.h" 46de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include "llvm/Support/Debug.h" 47d04a8d4b33ff316ca4cf961e06c9e312eff8e64fChandler Carruth#include "llvm/Support/raw_ostream.h" 4864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel#include "llvm/Transforms/Utils/Local.h" 49de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#include <algorithm> 50de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelusing namespace llvm; 51de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 52dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines#define DEBUG_TYPE BBV_NAME 53dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 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> 92ab90084bca42b74a5b5edad9b416bd81e105dad0Hal FinkelMaxPairs("bb-vectorize-max-pairs-per-group", cl::init(3000), cl::Hidden, 93ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel cl::desc("The maximum number of candidate instruction pairs per group")); 94ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel 95ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkelstatic cl::opt<unsigned> 96de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelMaxCandPairsForCycleCheck("bb-vectorize-max-cycle-check-pairs", cl::init(200), 97de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::Hidden, cl::desc("The maximum number of candidate pairs with which to use" 98de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " a full cycle check")); 99de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 100de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 101768edf3cd037aab10391abc279f71470df8e3156Hal FinkelNoBools("bb-vectorize-no-bools", cl::init(false), cl::Hidden, 102768edf3cd037aab10391abc279f71470df8e3156Hal Finkel cl::desc("Don't try to vectorize boolean (i1) values")); 103768edf3cd037aab10391abc279f71470df8e3156Hal Finkel 104768edf3cd037aab10391abc279f71470df8e3156Hal Finkelstatic cl::opt<bool> 105de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoInts("bb-vectorize-no-ints", cl::init(false), cl::Hidden, 106de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize integer values")); 107de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 108de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 109de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFloats("bb-vectorize-no-floats", cl::init(false), cl::Hidden, 110de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point values")); 111de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 112822ab00847da841a63be4e3883cb5f442dc69069Hal Finkel// FIXME: This should default to false once pointer vector support works. 113de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 114822ab00847da841a63be4e3883cb5f442dc69069Hal FinkelNoPointers("bb-vectorize-no-pointers", cl::init(/*false*/ true), cl::Hidden, 115f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize pointer values")); 116f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 117f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 118de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoCasts("bb-vectorize-no-casts", cl::init(false), cl::Hidden, 119de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize casting (conversion) operations")); 120de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 121de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 122de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMath("bb-vectorize-no-math", cl::init(false), cl::Hidden, 123de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize floating-point math intrinsics")); 124de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 126dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines NoBitManipulation("bb-vectorize-no-bitmanip", cl::init(false), cl::Hidden, 127dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines cl::desc("Don't try to vectorize BitManipulation intrinsics")); 128dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines 129dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hinesstatic cl::opt<bool> 130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoFMA("bb-vectorize-no-fma", cl::init(false), cl::Hidden, 131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize the fused-multiply-add intrinsic")); 132de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 133de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 134fc3665c87519850f629c9565535e3be447e10addHal FinkelNoSelect("bb-vectorize-no-select", cl::init(false), cl::Hidden, 135fc3665c87519850f629c9565535e3be447e10addHal Finkel cl::desc("Don't try to vectorize select instructions")); 136fc3665c87519850f629c9565535e3be447e10addHal Finkel 137fc3665c87519850f629c9565535e3be447e10addHal Finkelstatic cl::opt<bool> 138e415f96b6a43ac8861148a11a4258bc38c247e8fHal FinkelNoCmp("bb-vectorize-no-cmp", cl::init(false), cl::Hidden, 139e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel cl::desc("Don't try to vectorize comparison instructions")); 140e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel 141e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkelstatic cl::opt<bool> 142f3f5a1e6f77a842ccb24cc81766437da5197d712Hal FinkelNoGEP("bb-vectorize-no-gep", cl::init(false), cl::Hidden, 143f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel cl::desc("Don't try to vectorize getelementptr instructions")); 144f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 145f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkelstatic cl::opt<bool> 146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelNoMemOps("bb-vectorize-no-mem-ops", cl::init(false), cl::Hidden, 147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Don't try to vectorize loads and stores")); 148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelAlignedOnly("bb-vectorize-aligned-only", cl::init(false), cl::Hidden, 151de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Only generate aligned loads and stores")); 152de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 154edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal FinkelNoMemOpBoost("bb-vectorize-no-mem-op-boost", 155edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::init(false), cl::Hidden, 156edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel cl::desc("Don't boost the chain-depth contribution of loads and stores")); 157edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 158edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkelstatic cl::opt<bool> 159de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelFastDep("bb-vectorize-fast-dep", cl::init(false), cl::Hidden, 160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("Use a fast instruction dependency analysis")); 161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 162de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#ifndef NDEBUG 163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugInstructionExamination("bb-vectorize-debug-instruction-examination", 165de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " instruction-examination process")); 168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCandidateSelection("bb-vectorize-debug-candidate-selection", 170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " candidate-selection process")); 173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugPairSelection("bb-vectorize-debug-pair-selection", 175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " pair-selection process")); 178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic cl::opt<bool> 179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelDebugCycleCheck("bb-vectorize-debug-cycle-check", 180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::init(false), cl::Hidden, 181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel cl::desc("When debugging is enabled, output information on the" 182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " cycle-checking process")); 18372465ea23d010507d3746adc126d719005981e05Hal Finkel 18472465ea23d010507d3746adc126d719005981e05Hal Finkelstatic cl::opt<bool> 18572465ea23d010507d3746adc126d719005981e05Hal FinkelPrintAfterEveryPair("bb-vectorize-debug-print-after-every-pair", 18672465ea23d010507d3746adc126d719005981e05Hal Finkel cl::init(false), cl::Hidden, 18772465ea23d010507d3746adc126d719005981e05Hal Finkel cl::desc("When debugging is enabled, dump the basic block after" 18872465ea23d010507d3746adc126d719005981e05Hal Finkel " every pair is fused")); 189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel#endif 190de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelSTATISTIC(NumFusedOps, "Number of operations fused by bb-vectorize"); 192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelnamespace { 194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel struct BBVectorize : public BasicBlockPass { 195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel static char ID; // Pass identification, replacement for typeid 196bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 197940371bc65570ec0add1ede4f4d9f0a41ba25e09Hongbin Zheng const VectorizeConfig Config; 198bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 199bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(const VectorizeConfig &C = VectorizeConfig()) 200bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel initializeBBVectorizePass(*PassRegistry::getPassRegistry()); 202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 204bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize(Pass *P, const VectorizeConfig &C) 205bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng : BasicBlockPass(ID), Config(C) { 20687825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &P->getAnalysis<AliasAnalysis>(); 20736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DT = &P->getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 20887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &P->getAnalysis<ScalarEvolution>(); 20936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DataLayoutPass *DLP = P->getAnalysisIfAvailable<DataLayoutPass>(); 210dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DL = DLP ? &DLP->getDataLayout() : nullptr; 211dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines TTI = IgnoreTargetInfo ? nullptr : &P->getAnalysis<TargetTransformInfo>(); 21287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 21387825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<Value *, Value *> ValuePair; 21565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel typedef std::pair<ValuePair, int> ValuePairWithCost; 216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, size_t> ValuePairWithDepth; 217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair 21872465ea23d010507d3746adc126d719005981e05Hal Finkel typedef std::pair<VPPair, unsigned> VPPairWithType; 219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasAnalysis *AA; 221e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DominatorTree *DT; 222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ScalarEvolution *SE; 22336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines const DataLayout *DL; 224abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth const TargetTransformInfo *TTI; 225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 226de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: const correct? 227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 22864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool vectorizePairs(BasicBlock &BB, bool NonPow2Len = false); 229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2305d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool getCandidatePairs(BasicBlock &BB, 2315d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 2326ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 233a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 23465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 23564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len); 236de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 23778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // FIXME: The current implementation does not account for pairs that 23878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // are connected in multiple ways. For example: 23978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // C1 = A1 / A2; C2 = A2 / A1 (which may be both direct and a swap) 24072465ea23d010507d3746adc126d719005981e05Hal Finkel enum PairConnectionType { 24172465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionDirect, 24272465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSwap, 24372465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionSplat 24472465ea23d010507d3746adc126d719005981e05Hal Finkel }; 24572465ea23d010507d3746adc126d719005981e05Hal Finkel 24697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel void computeConnectedPairs( 24797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 24897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 24997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 25097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 25197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes); 252de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 253de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void buildDepMap(BasicBlock &BB, 25497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 25597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 25697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers); 257de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2586ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel void choosePairs(DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 25997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 26097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 26197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 26297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 26397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 26497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 26597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps, 26697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 26797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *>& ChosenPairs); 268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fuseChosenPairs(BasicBlock &BB, 27097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 27197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *>& ChosenPairs, 27297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 27397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 27497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 27597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps); 27672465ea23d010507d3746adc126d719005981e05Hal Finkel 277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isInstVectorizable(Instruction *I, bool &IsSimpleLoadStore); 279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool areInstsCompatible(Instruction *I, Instruction *J, 28165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 282a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder); 283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool trackUsesOfI(DenseSet<Value *> &Users, 285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers = true, 287dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DenseSet<ValuePair> *LoadMoveSetPairs = nullptr); 2881230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 28997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel void computePairsConnectedTo( 29097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 29197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 29297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 29397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 29497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 29597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ValuePair P); 296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 297de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairsConflict(ValuePair P, ValuePair Q, 29897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 29997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > 300dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines *PairableInstUserMap = nullptr, 301dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DenseSet<VPPair> *PairableInstUserPairSet = nullptr); 302de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool pairWillFormCycle(ValuePair P, 30497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUsers, 30597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CurrentPairs); 306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 307f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void pruneDAGFor( 30897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 30997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 31097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 31197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 31297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUserMap, 31397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 31497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 315f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t> &DAG, 316f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> &PrunedDAG, ValuePair J, 31797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel bool UseCycleCheck); 318de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 319f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void buildInitialDAGFor( 32097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 32197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 32297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 32397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 32497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 32597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 326f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t> &DAG, ValuePair J); 327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 328f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void findBestDAGFor( 32997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 33097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 33197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 33297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 33397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 33497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 33597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 33697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps, 33797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 33897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUserMap, 33997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 34097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 341f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> &BestDAG, size_t &BestMaxDepth, 34297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel int &BestEffSize, Value *II, std::vector<Value *>&JJ, 34397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel bool UseCycleCheck); 344de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 345de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementPointerInput(LLVMContext& Context, Instruction *I, 346202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *J, unsigned o); 347de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 348de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void fillNewShuffleMask(LLVMContext& Context, Instruction *J, 34964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 35064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 35164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask); 352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 353de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementShuffleMask(LLVMContext& Context, Instruction *I, 354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J); 355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 35664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool expandIEChain(LLVMContext& Context, Instruction *I, Instruction *J, 35764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned o, Value *&LOp, unsigned numElemL, 35872465ea23d010507d3746adc126d719005981e05Hal Finkel Type *ArgTypeL, Type *ArgTypeR, bool IBeforeJ, 35964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned IdxOff = 0); 36064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 361de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *getReplacementInput(LLVMContext& Context, Instruction *I, 36272465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ); 363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 364de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void getReplacementInputsForPair(LLVMContext& Context, Instruction *I, 365a0ec3f9b7b826b9b40b80199923b664bad808cceCraig Topper Instruction *J, SmallVectorImpl<Value *> &ReplacedOperands, 36672465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ); 367de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, Instruction *&K1, 371202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K2); 372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectPairLoadMoveSet(BasicBlock &BB, 374de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 37597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &LoadMoveSet, 3762f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I); 378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void collectLoadMoveSet(BasicBlock &BB, 380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 381de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 38297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &LoadMoveSet, 3832f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs); 384de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 385de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool canMoveUsesOfIAfterJ(BasicBlock &BB, 3862f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 387de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 388de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 389de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void moveUsesOfIAfterJ(BasicBlock &BB, 3902f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 391de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J); 393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 394ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void combineMetadata(Instruction *K, const Instruction *J); 395ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 39687825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng bool vectorizeBB(BasicBlock &BB) { 39736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (skipOptnoneFunction(BB)) 39836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return false; 399e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel if (!DT->isReachableFromEntry(&BB)) { 400e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel DEBUG(dbgs() << "BBV: skipping unreachable " << BB.getName() << 401e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel " in " << BB.getParent()->getName() << "\n"); 402e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel return false; 403e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel } 404e29c19091cca58db668407dfc5dd86c70e8b3d49Hal Finkel 405abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth DEBUG(if (TTI) dbgs() << "BBV: using target information\n"); 40665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 407de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool changed = false; 408de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate a sufficient number of times to merge types of size 1 bit, 409de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then 2 bits, then 4, etc. up to half of the target vector width of the 410de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // target vector register. 41164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned n = 1; 41264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 2; 413abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth (TTI || v <= Config.VectorBits) && 41465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel (!Config.MaxIter || n <= Config.MaxIter); 415de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel v *= 2, ++n) { 416bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng DEBUG(dbgs() << "BBV: fusing loop #" << n << 417de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " for " << BB.getName() << " in " << 418de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BB.getParent()->getName() << "...\n"); 419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (vectorizePairs(BB)) 420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel changed = true; 421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 42564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (changed && !Pow2LenOnly) { 42664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ++n; 42764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; !Config.MaxIter || n <= Config.MaxIter; ++n) { 42864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel DEBUG(dbgs() << "BBV: fusing for non-2^n-length vectors loop #: " << 42964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel n << " for " << BB.getName() << " in " << 43064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel BB.getParent()->getName() << "...\n"); 43164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!vectorizePairs(BB, true)) break; 43264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 43364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 43464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 435de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: done!\n"); 436de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return changed; 437de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 43936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines bool runOnBasicBlock(BasicBlock &BB) override { 44036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // OptimizeNone check deferred to vectorizeBB(). 44136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 44287825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng AA = &getAnalysis<AliasAnalysis>(); 44336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 44487825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng SE = &getAnalysis<ScalarEvolution>(); 44536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>(); 446dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines DL = DLP ? &DLP->getDataLayout() : nullptr; 447dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines TTI = IgnoreTargetInfo ? nullptr : &getAnalysis<TargetTransformInfo>(); 44887825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 44987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return vectorizeBB(BB); 45087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng } 45187825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng 45236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines void getAnalysisUsage(AnalysisUsage &AU) const override { 453de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlockPass::getAnalysisUsage(AU); 454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<AliasAnalysis>(); 45536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines AU.addRequired<DominatorTreeWrapperPass>(); 456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addRequired<ScalarEvolution>(); 4578bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler Carruth AU.addRequired<TargetTransformInfo>(); 458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<AliasAnalysis>(); 45936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines AU.addPreserved<DominatorTreeWrapperPass>(); 460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AU.addPreserved<ScalarEvolution>(); 4617e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel AU.setPreservesCFG(); 462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 463de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 46464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline VectorType *getVecTypeForPair(Type *ElemTy, Type *Elem2Ty) { 46564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel assert(ElemTy->getScalarType() == Elem2Ty->getScalarType() && 46664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel "Cannot form vector from incompatible scalar types"); 46764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *STy = ElemTy->getScalarType(); 46864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 46964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem; 470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (VectorType *VTy = dyn_cast<VectorType>(ElemTy)) { 47164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = VTy->getNumElements(); 47264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 47364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem = 1; 47464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 47564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 47664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VectorType *VTy = dyn_cast<VectorType>(Elem2Ty)) { 47764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += VTy->getNumElements(); 47864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 47964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElem += 1; 480de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 4817e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel 48264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return VectorType::get(STy, numElem); 48364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 48464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 48564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel static inline void getInstructionTypes(Instruction *I, 48664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *&T1, Type *&T2) { 4873fc1e4aa159ec15058bb26acbec39f6e09990207Hal Finkel if (StoreInst *SI = dyn_cast<StoreInst>(I)) { 48864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // For stores, it is the value type, not the pointer type that matters 48964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // because the value is what will come from a vector register. 49064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 4913fc1e4aa159ec15058bb26acbec39f6e09990207Hal Finkel Value *IVal = SI->getValueOperand(); 49264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = IVal->getType(); 49364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 49464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T1 = I->getType(); 49564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 49664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 4973fc1e4aa159ec15058bb26acbec39f6e09990207Hal Finkel if (CastInst *CI = dyn_cast<CastInst>(I)) 4983fc1e4aa159ec15058bb26acbec39f6e09990207Hal Finkel T2 = CI->getSrcTy(); 49964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 50064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel T2 = T1; 50165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 50265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (SelectInst *SI = dyn_cast<SelectInst>(I)) { 50365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel T2 = SI->getCondition()->getType(); 5048b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel } else if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(I)) { 5058b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel T2 = SI->getOperand(0)->getType(); 5065094257518ea7b615d87ef5bea657625ffa81991Hal Finkel } else if (CmpInst *CI = dyn_cast<CmpInst>(I)) { 5075094257518ea7b615d87ef5bea657625ffa81991Hal Finkel T2 = CI->getOperand(0)->getType(); 50865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the weight associated with the provided value. A chain of 512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate pairs has a length given by the sum of the weights of its 513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // members (one weight per pair; the weight of each member of the pair 514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is assumed to be the same). This length is then compared to the 515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chain-length threshold to determine if a given chain is significant 516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // enough to be vectorized. The length is also used in comparing 517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // candidate chains where longer chains are considered to be better. 518de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: when this function returns 0, the resulting instructions are 519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // not actually fused. 520bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng inline size_t getDepthFactor(Value *V) { 521de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // InsertElement and ExtractElement have a depth factor of zero. This is 522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // for two reasons: First, they cannot be usefully fused. Second, because 523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the pass generates a lot of these, they can confuse the simple metric 524f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // used to compare the dags in the next iteration. Thus, giving them a 525de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // weight of zero allows the pass to essentially ignore them in 526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // subsequent iterations when looking for vectorization opportunities 527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // while still tracking dependency chains that flow through those 528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions. 529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<InsertElementInst>(V) || isa<ExtractElementInst>(V)) 530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 0; 531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 532edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // Give a load or store half of the required depth so that load/store 533edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel // pairs will vectorize. 534bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (!Config.NoMemOpBoost && (isa<LoadInst>(V) || isa<StoreInst>(V))) 535bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return Config.ReqChainDepth/2; 536edc8db87dc2ed4d2971e7f50464f5f4d0fead537Hal Finkel 537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return 1; 538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 540abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth // Returns the cost of the provided instruction using TTI. 54146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // This does not handle loads and stores. 54236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned getInstrCost(unsigned Opcode, Type *T1, Type *T2, 54336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OperandValueKind Op1VK = 54436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OK_AnyValue, 54536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OperandValueKind Op2VK = 54636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OK_AnyValue) { 54746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel switch (Opcode) { 54846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel default: break; 54946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::GetElementPtr: 55046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // We mark this instruction as zero-cost because scalar GEPs are usually 551f80a63fa23862e578de919f4b44d4fcdee68fd0dRobert Wilhelm // lowered to the instruction addressing mode. At the moment we don't 55246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel // generate vector GEPs. 55346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 55446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Br: 555abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCFInstrCost(Opcode); 55646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PHI: 55746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 0; 55846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Add: 55946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FAdd: 56046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Sub: 56146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FSub: 56246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Mul: 56346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FMul: 56446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UDiv: 56546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SDiv: 56646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FDiv: 56746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::URem: 56846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SRem: 56946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FRem: 57046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Shl: 57146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::LShr: 57246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::AShr: 57346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::And: 57446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Or: 57546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Xor: 57636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines return TTI->getArithmeticInstrCost(Opcode, T1, Op1VK, Op2VK); 57746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Select: 57846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ICmp: 57946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FCmp: 580abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCmpSelInstrCost(Opcode, T1, T2); 58146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::ZExt: 58246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SExt: 58346fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToUI: 58446fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPToSI: 58546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPExt: 58646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::PtrToInt: 58746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::IntToPtr: 58846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::SIToFP: 58946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::UIToFP: 59046fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::Trunc: 59146fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::FPTrunc: 59246fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel case Instruction::BitCast: 59386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel case Instruction::ShuffleVector: 594abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth return TTI->getCastInstrCost(Opcode, T1, T2); 59546fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 59646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 59746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel return 1; 59846fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel } 59946fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel 600de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This determines the relative offset of two loads or stores, returning 601de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if the offset could be determined to be some constant value. 602de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For example, if OffsetInElmts == 1, then J accesses the memory directly 603de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after I; if OffsetInElmts == -1 then I accesses the memory 60464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // directly after J. 605de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool getPairPtrInfo(Instruction *I, Instruction *J, 606de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *&IPtr, Value *&JPtr, unsigned &IAlignment, unsigned &JAlignment, 60765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned &IAddressSpace, unsigned &JAddressSpace, 60893f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel int64_t &OffsetInElmts, bool ComputeOffset = true) { 609de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = 0; 61065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (LoadInst *LI = dyn_cast<LoadInst>(I)) { 61165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel LoadInst *LJ = cast<LoadInst>(J); 61265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = LI->getPointerOperand(); 61365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = LJ->getPointerOperand(); 61465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = LI->getAlignment(); 61565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = LJ->getAlignment(); 61665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = LI->getPointerAddressSpace(); 61765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = LJ->getPointerAddressSpace(); 618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 61965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel StoreInst *SI = cast<StoreInst>(I), *SJ = cast<StoreInst>(J); 62065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IPtr = SI->getPointerOperand(); 62165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JPtr = SJ->getPointerOperand(); 62265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAlignment = SI->getAlignment(); 62365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAlignment = SJ->getAlignment(); 62465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace = SI->getPointerAddressSpace(); 62565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel JAddressSpace = SJ->getPointerAddressSpace(); 626de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 627de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 62893f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel if (!ComputeOffset) 62993f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel return true; 63093f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel 631de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *IPtrSCEV = SE->getSCEV(IPtr); 632de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *JPtrSCEV = SE->getSCEV(JPtr); 633de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 634de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If this is a trivial offset, then we'll get something like 635de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // 1*sizeof(type). With target data, which we need anyway, this will get 636de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // constant folded into a number. 637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel const SCEV *OffsetSCEV = SE->getMinusSCEV(JPtrSCEV, IPtrSCEV); 638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (const SCEVConstant *ConstOffSCEV = 639de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dyn_cast<SCEVConstant>(OffsetSCEV)) { 640de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt *IntOff = ConstOffSCEV->getValue(); 641de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t Offset = IntOff->getSExtValue(); 642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 643244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault Type *VTy = IPtr->getType()->getPointerElementType(); 64436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines int64_t VTyTSS = (int64_t) DL->getTypeStoreSize(VTy); 645de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 646244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault Type *VTy2 = JPtr->getType()->getPointerElementType(); 64764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (VTy != VTy2 && Offset < 0) { 64836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines int64_t VTy2TSS = (int64_t) DL->getTypeStoreSize(VTy2); 64964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel OffsetInElmts = Offset/VTy2TSS; 65064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return (abs64(Offset) % VTy2TSS) == 0; 65164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 653de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts = Offset/VTyTSS; 654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (abs64(Offset) % VTyTSS) == 0; 655de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if the provided CallInst represents an intrinsic that can 661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be vectorized. 662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool isVectorizableIntrinsic(CallInst* I) { 663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = I->getCalledFunction(); 664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!F) return false; 665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 666a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) F->getIntrinsicID(); 667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!IID) return false; 668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 669de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel switch(IID) { 670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel default: 671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sqrt: 673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::powi: 674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::sin: 675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::cos: 676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log: 677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log2: 678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::log10: 679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp: 680de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::exp2: 681de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::pow: 682dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::round: 683dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::copysign: 684dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::ceil: 685dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::nearbyint: 686dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::rint: 687dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::trunc: 688dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::floor: 689dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::fabs: 69086312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeMath; 691dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::bswap: 692dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::ctpop: 693dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::ctlz: 694dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines case Intrinsic::cttz: 695dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines return Config.VectorizeBitManipulations; 696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel case Intrinsic::fma: 69764a7a24edf719bb6ffacc030c23f4cd99312f3fbHal Finkel case Intrinsic::fmuladd: 69886312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng return Config.VectorizeFMA; 699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 701de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 702b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel bool isPureIEChain(InsertElementInst *IE) { 703b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel InsertElementInst *IENext = IE; 704b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel do { 705b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (!isa<UndefValue>(IENext->getOperand(0)) && 706b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel !isa<InsertElementInst>(IENext->getOperand(0))) { 707b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel return false; 708b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } 709b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } while ((IENext = 710b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel dyn_cast<InsertElementInst>(IENext->getOperand(0)))); 711b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel 712b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel return true; 713b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel } 714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel }; 715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function implements one vectorization iteration on the provided 717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block. It returns true if the block is changed. 71864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::vectorizePairs(BasicBlock &BB, bool NonPow2Len) { 7195d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue; 7205d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator Start = BB.getFirstInsertionPt(); 7215d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7225d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> AllPairableInsts; 7235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> AllChosenPairs; 724a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> AllFixedOrderPairs; 72572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> AllPairConnectionTypes; 72697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > AllConnectedPairs, 72797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel AllConnectedPairDeps; 7285d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 7295d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel do { 7305d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel std::vector<Value *> PairableInsts; 7316ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> > CandidatePairs; 732a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> FixedOrderPairs; 73365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> CandidatePairCostSavings; 7345d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = getCandidatePairs(BB, Start, CandidatePairs, 735a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs, 73665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings, 73764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel PairableInsts, NonPow2Len); 7385d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (PairableInsts.empty()) continue; 7393706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 740b1a82589339fed148c12b052d30861a539552f1aHal Finkel // Build the candidate pair set for faster lookups. 741b1a82589339fed148c12b052d30861a539552f1aHal Finkel DenseSet<ValuePair> CandidatePairsSet; 7426ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (DenseMap<Value *, std::vector<Value *> >::iterator I = 7436ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairs.begin(), E = CandidatePairs.end(); I != E; ++I) 7446ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator J = I->second.begin(), 7456ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel JE = I->second.end(); J != JE; ++J) 7466ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.insert(ValuePair(I->first, *J)); 747b1a82589339fed148c12b052d30861a539552f1aHal Finkel 7485d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Now we have a map of all of the pairable instructions and we need to 7495d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // select the best possible pairing. A good pairing is one such that the 7505d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // users of the pair are also paired. This defines a (directed) forest 75194c22716d60ff5edf6a98a3c67e0faa001be1142Sylvestre Ledru // over the pairs such that two pairs are connected iff the second pair 7525d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // uses the first. 7533706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7545d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Note that it only matters that both members of the second pair use some 7555d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // element of the first pair (to allow for splatting). 7563706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 75797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > ConnectedPairs, 75897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairDeps; 75972465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned> PairConnectionTypes; 760b1a82589339fed148c12b052d30861a539552f1aHal Finkel computeConnectedPairs(CandidatePairs, CandidatePairsSet, 761b1a82589339fed148c12b052d30861a539552f1aHal Finkel PairableInsts, ConnectedPairs, PairConnectionTypes); 7625d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ConnectedPairs.empty()) continue; 7633706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 76497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (DenseMap<ValuePair, std::vector<ValuePair> >::iterator 76572465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 76697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel I != IE; ++I) 76797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator J = I->second.begin(), 76897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel JE = I->second.end(); J != JE; ++J) 76997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairDeps[*J].push_back(I->first); 77072465ea23d010507d3746adc126d719005981e05Hal Finkel 7715d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // Build the pairable-instruction dependency map 7725d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseSet<ValuePair> PairableInstUsers; 7735d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel buildDepMap(BB, CandidatePairs, PairableInsts, PairableInstUsers); 7743706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 77535564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // There is now a graph of the connected pairs. For each variable, pick 776f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // the pairing with the largest dag meeting the depth requirement on at 777f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // least one branch. Then select all pairings that are part of that dag 77835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // and remove them from the list of available pairings and pairable 77935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel // variables. 7803706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7815d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel DenseMap<Value *, Value *> ChosenPairs; 782b1a82589339fed148c12b052d30861a539552f1aHal Finkel choosePairs(CandidatePairs, CandidatePairsSet, 783b1a82589339fed148c12b052d30861a539552f1aHal Finkel CandidatePairCostSavings, 78486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 78586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 7865d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInstUsers, ChosenPairs); 7873706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 7885d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ChosenPairs.empty()) continue; 7895d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllPairableInsts.insert(AllPairableInsts.end(), PairableInsts.begin(), 7905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel PairableInsts.end()); 7915d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel AllChosenPairs.insert(ChosenPairs.begin(), ChosenPairs.end()); 792a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 79372465ea23d010507d3746adc126d719005981e05Hal Finkel // Only for the chosen pairs, propagate information on fixed-order pairs, 79472465ea23d010507d3746adc126d719005981e05Hal Finkel // pair connections, and their types to the data structures used by the 79572465ea23d010507d3746adc126d719005981e05Hal Finkel // pair fusion procedures. 796a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel for (DenseMap<Value *, Value *>::iterator I = ChosenPairs.begin(), 797a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel IE = ChosenPairs.end(); I != IE; ++I) { 798a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrderPairs.count(*I)) 799a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(*I); 800a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrderPairs.count(ValuePair(I->second, I->first))) 801a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel AllFixedOrderPairs.insert(ValuePair(I->second, I->first)); 80272465ea23d010507d3746adc126d719005981e05Hal Finkel 80372465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseMap<Value *, Value *>::iterator J = ChosenPairs.begin(); 80472465ea23d010507d3746adc126d719005981e05Hal Finkel J != IE; ++J) { 80572465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator K = 80672465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.find(VPPair(*I, *J)); 80772465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) { 80872465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 80972465ea23d010507d3746adc126d719005981e05Hal Finkel } else { 81072465ea23d010507d3746adc126d719005981e05Hal Finkel K = PairConnectionTypes.find(VPPair(*J, *I)); 81172465ea23d010507d3746adc126d719005981e05Hal Finkel if (K != PairConnectionTypes.end()) 81272465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes.insert(*K); 81372465ea23d010507d3746adc126d719005981e05Hal Finkel } 81472465ea23d010507d3746adc126d719005981e05Hal Finkel } 81572465ea23d010507d3746adc126d719005981e05Hal Finkel } 81672465ea23d010507d3746adc126d719005981e05Hal Finkel 81797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (DenseMap<ValuePair, std::vector<ValuePair> >::iterator 81872465ea23d010507d3746adc126d719005981e05Hal Finkel I = ConnectedPairs.begin(), IE = ConnectedPairs.end(); 81997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel I != IE; ++I) 82097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator J = I->second.begin(), 82197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel JE = I->second.end(); J != JE; ++J) 82297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (AllPairConnectionTypes.count(VPPair(I->first, *J))) { 82397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel AllConnectedPairs[I->first].push_back(*J); 82497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel AllConnectedPairDeps[*J].push_back(I->first); 82597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel } 8265d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } while (ShouldContinue); 8275d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 8285d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (AllChosenPairs.empty()) return false; 8295d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel NumFusedOps += AllChosenPairs.size(); 8303706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 831de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A set of pairs has now been selected. It is now necessary to replace the 832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // paired instructions with vector instructions. For this procedure each 83343ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop // operand must be replaced with a vector operand. This vector is formed 834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // by using build_vector on the old operands. The replaced values are then 835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // replaced with a vector_extract on the result. Subsequent optimization 836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // passes should coalesce the build/extract combinations. 8373706ac7aa83ab0aed9e2da7d5fc2386ac1f035f5Sebastian Pop 83872465ea23d010507d3746adc126d719005981e05Hal Finkel fuseChosenPairs(BB, AllPairableInsts, AllChosenPairs, AllFixedOrderPairs, 83972465ea23d010507d3746adc126d719005981e05Hal Finkel AllPairConnectionTypes, 84072465ea23d010507d3746adc126d719005981e05Hal Finkel AllConnectedPairs, AllConnectedPairDeps); 84164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 84264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // It is important to cleanup here so that future iterations of this 84364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // function have less work to do. 84436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines (void) SimplifyInstructionsInBlock(&BB, DL, AA->getTargetLibraryInfo()); 845de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 846de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 848de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the provided instruction is capable of being 849de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fused into a vector instruction. This determination is based only on the 850de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and other attributes of the instruction. 851de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::isInstVectorizable(Instruction *I, 852de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool &IsSimpleLoadStore) { 853de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = false; 854de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (CallInst *C = dyn_cast<CallInst>(I)) { 856de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isVectorizableIntrinsic(C)) 857de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (LoadInst *L = dyn_cast<LoadInst>(I)) { 859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple loads if possbile: 860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = L->isSimple(); 86186312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 863de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (StoreInst *S = dyn_cast<StoreInst>(I)) { 864de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Vectorize simple stores if possbile: 865de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsSimpleLoadStore = S->isSimple(); 86686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!IsSimpleLoadStore || !Config.VectorizeMemOps) 867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (CastInst *C = dyn_cast<CastInst>(I)) { 869de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can vectorize casts, but not casts of pointer types, etc. 87086312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeCasts) 871de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 872de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 873de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *SrcTy = C->getSrcTy(); 874f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!SrcTy->isSingleValueType()) 875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 876de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 877de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *DestTy = C->getDestTy(); 878f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!DestTy->isSingleValueType()) 879de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 880fc3665c87519850f629c9565535e3be447e10addHal Finkel } else if (isa<SelectInst>(I)) { 881fc3665c87519850f629c9565535e3be447e10addHal Finkel if (!Config.VectorizeSelect) 882fc3665c87519850f629c9565535e3be447e10addHal Finkel return false; 883e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel } else if (isa<CmpInst>(I)) { 884e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel if (!Config.VectorizeCmp) 885e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel return false; 886f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel } else if (GetElementPtrInst *G = dyn_cast<GetElementPtrInst>(I)) { 887f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (!Config.VectorizeGEP) 888f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 889f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 890f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel // Currently, vector GEPs exist only with one index. 891f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel if (G->getNumIndices() != 1) 892f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (!(I->isBinaryOp() || isa<ShuffleVectorInst>(I) || 894de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel isa<ExtractElementInst>(I) || isa<InsertElementInst>(I))) { 895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 898de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // We can't vectorize memory operations without target data 899dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (!DL && IsSimpleLoadStore) 900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 901de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *T1, *T2; 90364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, T1, T2); 904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Not every type can be vectorized... 906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!(VectorType::isValidElementType(T1) || T1->isVectorTy()) || 907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel !(VectorType::isValidElementType(T2) || T2->isVectorTy())) 908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 91065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T1->getScalarSizeInBits() == 1) { 911768edf3cd037aab10391abc279f71470df8e3156Hal Finkel if (!Config.VectorizeBools) 912768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 913768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } else { 91465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T1->isIntOrIntVectorTy()) 915768edf3cd037aab10391abc279f71470df8e3156Hal Finkel return false; 916768edf3cd037aab10391abc279f71470df8e3156Hal Finkel } 91765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 91865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (T2->getScalarSizeInBits() == 1) { 91965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeBools) 92065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 92165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 92265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!Config.VectorizeInts && T2->isIntOrIntVectorTy()) 92365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 92465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 92565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 92686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng if (!Config.VectorizeFloats 92786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng && (T1->isFPOrFPVectorTy() || T2->isFPOrFPVectorTy())) 928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 929de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 930e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel // Don't vectorize target-specific types. 931e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T1->isX86_FP80Ty() || T1->isPPC_FP128Ty() || T1->isX86_MMXTy()) 932e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 933e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel if (T2->isX86_FP80Ty() || T2->isPPC_FP128Ty() || T2->isX86_MMXTy()) 934e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel return false; 935e32e5440d6aaff8a77517e9d286846ae9e380770Hal Finkel 936dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if ((!Config.VectorizePointers || !DL) && 93705bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel (T1->getScalarType()->isPointerTy() || 93805bc5087a25bbcf59936d71ebfc878b545ef3e5cHal Finkel T2->getScalarType()->isPointerTy())) 939f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel return false; 940f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel 941abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (!TTI && (T1->getPrimitiveSizeInBits() >= Config.VectorBits || 942abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth T2->getPrimitiveSizeInBits() >= Config.VectorBits)) 943de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 945de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 946de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 947de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 948de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function returns true if the two provided instructions are compatible 949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (meaning that they can be fused into a vector instruction). This assumes 950de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that I has already been determined to be vectorizable and that J is not 951f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // in the use dag of I. 952de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::areInstsCompatible(Instruction *I, Instruction *J, 95365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel bool IsSimpleLoadStore, bool NonPow2Len, 954a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int &CostSavings, int &FixedOrder) { 955de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugInstructionExamination) dbgs() << "BBV: looking at " << *I << 956de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 957de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 95865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = 0; 959a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = 0; 96065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 961de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Loads and stores can be merged if they have different alignments, 962de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but are otherwise the same. 96364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!J->isSameOperationAs(I, Instruction::CompareIgnoringAlignment | 96464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (NonPow2Len ? Instruction::CompareUsingScalarTypes : 0))) 96564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return false; 96664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 96764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *IT1, *IT2, *JT1, *JT2; 96864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(I, IT1, IT2); 96964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getInstructionTypes(J, JT1, JT2); 97064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaxTypeBits = std::max( 97164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT1->getPrimitiveSizeInBits() + JT1->getPrimitiveSizeInBits(), 97264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel IT2->getPrimitiveSizeInBits() + JT2->getPrimitiveSizeInBits()); 973abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (!TTI && MaxTypeBits > Config.VectorBits) 974de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 975ec4e85e3364f50802f2007e4b1e23661d4610366Hal Finkel 976de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: handle addsub-type operations! 977de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 978de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsSimpleLoadStore) { 979de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 98065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 981de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts = 0; 982de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 98365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 984de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel OffsetInElmts) && abs64(OffsetInElmts) == 1) { 985a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrder = (int) OffsetInElmts; 98665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned BottomAlignment = IAlignment; 98765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (OffsetInElmts < 0) BottomAlignment = JAlignment; 98865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 98965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeI = isa<StoreInst>(I) ? 99065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(I)->getValueOperand()->getType() : I->getType(); 99165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *aTypeJ = isa<StoreInst>(J) ? 99265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel cast<StoreInst>(J)->getValueOperand()->getType() : J->getType(); 99365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VType = getVecTypeForPair(aTypeI, aTypeJ); 99464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 99565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (Config.AlignedOnly) { 996de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // An aligned load or store is possible only if the instruction 997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // with the lower offset has an alignment suitable for the 998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector type. 9991230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop 100036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned VecAlignment = DL->getPrefTypeAlignment(VType); 1001de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (BottomAlignment < VecAlignment) 1002de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1003de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 100465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 1005abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) { 1006abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned ICost = TTI->getMemoryOpCost(I->getOpcode(), aTypeI, 1007abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth IAlignment, IAddressSpace); 1008abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned JCost = TTI->getMemoryOpCost(J->getOpcode(), aTypeJ, 1009abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth JAlignment, JAddressSpace); 1010abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VCost = TTI->getMemoryOpCost(I->getOpcode(), VType, 1011abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth BottomAlignment, 1012abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth IAddressSpace); 10130cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel 10140cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel ICost += TTI->getAddressComputationCost(aTypeI); 10150cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel JCost += TTI->getAddressComputationCost(aTypeJ); 10160cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel VCost += TTI->getAddressComputationCost(VType); 10170cf5d396c14c71dd4fa1d102c2b3d178b1191436Hal Finkel 101865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 101965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 102082149a9106f221aa6a7271977c236b078e621f21Hal Finkel 1021dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 102282149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 1023dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 1024abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VParts = TTI->getNumberOfParts(VType); 1025dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel if (VParts > 1) 1026dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 1027dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel else if (!VParts && VCost == ICost + JCost) 102882149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 102982149a9106f221aa6a7271977c236b078e621f21Hal Finkel 103065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 103165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 1032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1035abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth } else if (TTI) { 103646fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned ICost = getInstrCost(I->getOpcode(), IT1, IT2); 103746fb81cf4009cc34af97c5a1c0e824e2633fb4e4Hal Finkel unsigned JCost = getInstrCost(J->getOpcode(), JT1, JT2); 103865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel Type *VT1 = getVecTypeForPair(IT1, JT1), 103965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel *VT2 = getVecTypeForPair(IT2, JT2); 104036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OperandValueKind Op1VK = 104136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OK_AnyValue; 104236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OperandValueKind Op2VK = 104336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OK_AnyValue; 104436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 104536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // On some targets (example X86) the cost of a vector shift may vary 104636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // depending on whether the second operand is a Uniform or 104736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // NonUniform Constant. 104836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines switch (I->getOpcode()) { 104936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines default : break; 105036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines case Instruction::Shl: 105136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines case Instruction::LShr: 105236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines case Instruction::AShr: 105336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines 105436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // If both I and J are scalar shifts by constant, then the 105536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // merged vector shift count would be either a constant splat value 105636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // or a non-uniform vector of constants. 105736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (ConstantInt *CII = dyn_cast<ConstantInt>(I->getOperand(1))) { 105836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (ConstantInt *CIJ = dyn_cast<ConstantInt>(J->getOperand(1))) 105936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Op2VK = CII == CIJ ? TargetTransformInfo::OK_UniformConstantValue : 106036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines TargetTransformInfo::OK_NonUniformConstantValue; 106136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } else { 106236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // Check for a splat of a constant or for a non uniform vector 106336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines // of constants. 106436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Value *IOp = I->getOperand(1); 106536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Value *JOp = J->getOperand(1); 106636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if ((isa<ConstantVector>(IOp) || isa<ConstantDataVector>(IOp)) && 106736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines (isa<ConstantVector>(JOp) || isa<ConstantDataVector>(JOp))) { 106836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Op2VK = TargetTransformInfo::OK_NonUniformConstantValue; 106936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Constant *SplatValue = cast<Constant>(IOp)->getSplatValue(); 1070dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (SplatValue != nullptr && 107136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines SplatValue == cast<Constant>(JOp)->getSplatValue()) 107236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Op2VK = TargetTransformInfo::OK_UniformConstantValue; 107336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 107436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 107536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } 1076ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel 1077ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // Note that this procedure is incorrect for insert and extract element 1078ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // instructions (because combining these often results in a shuffle), 1079ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // but this cost is ignored (because insert and extract element 1080ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // instructions are assigned a zero depth factor and are not really 1081ec5c3c2bd37828e9fbd913f5ac7b7f75711ddd59Hal Finkel // fused in general). 108236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines unsigned VCost = getInstrCost(I->getOpcode(), VT1, VT2, Op1VK, Op2VK); 108365309660fa61a837cc05323f69c618a7d8134d56Hal Finkel 108465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (VCost > ICost + JCost) 108565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel return false; 108682149a9106f221aa6a7271977c236b078e621f21Hal Finkel 1087dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // We don't want to fuse to a type that will be split, even 108882149a9106f221aa6a7271977c236b078e621f21Hal Finkel // if the two input types will also be split and there is no other 1089dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel // associated cost. 1090abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VParts1 = TTI->getNumberOfParts(VT1), 1091abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth VParts2 = TTI->getNumberOfParts(VT2); 10928b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel if (VParts1 > 1 || VParts2 > 1) 1093dc330f75b732b4ce1beace69ae7ed8e19d89bd9fHal Finkel return false; 10948b9796f4f83bea2bbefcd2822eb574abdb7f3d1bHal Finkel else if ((!VParts1 || !VParts2) && VCost == ICost + JCost) 109582149a9106f221aa6a7271977c236b078e621f21Hal Finkel return false; 109682149a9106f221aa6a7271977c236b078e621f21Hal Finkel 109765309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings = ICost + JCost - VCost; 1098de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1099de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1100dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // The powi,ctlz,cttz intrinsics are special because only the first 1101dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // argument is vectorized, the second arguments must be equal. 11026173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel CallInst *CI = dyn_cast<CallInst>(I); 11036173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Function *FI; 1104a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (CI && (FI = CI->getCalledFunction())) { 1105a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) FI->getIntrinsicID(); 1106dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if (IID == Intrinsic::powi || IID == Intrinsic::ctlz || 1107dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines IID == Intrinsic::cttz) { 1108a77728415857196035c0090f7b2749d7971811a2Hal Finkel Value *A1I = CI->getArgOperand(1), 1109a77728415857196035c0090f7b2749d7971811a2Hal Finkel *A1J = cast<CallInst>(J)->getArgOperand(1); 1110a77728415857196035c0090f7b2749d7971811a2Hal Finkel const SCEV *A1ISCEV = SE->getSCEV(A1I), 1111a77728415857196035c0090f7b2749d7971811a2Hal Finkel *A1JSCEV = SE->getSCEV(A1J); 1112a77728415857196035c0090f7b2749d7971811a2Hal Finkel return (A1ISCEV == A1JSCEV); 1113a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1114a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1115abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (IID && TTI) { 1116a77728415857196035c0090f7b2749d7971811a2Hal Finkel SmallVector<Type*, 4> Tys; 1117a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) 1118a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CI->getArgOperand(i)->getType()); 1119abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned ICost = TTI->getIntrinsicInstrCost(IID, IT1, Tys); 1120a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1121a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.clear(); 1122a77728415857196035c0090f7b2749d7971811a2Hal Finkel CallInst *CJ = cast<CallInst>(J); 1123a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CJ->getNumArgOperands(); i != ie; ++i) 1124a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CJ->getArgOperand(i)->getType()); 1125abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned JCost = TTI->getIntrinsicInstrCost(IID, JT1, Tys); 1126a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1127a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.clear(); 1128a77728415857196035c0090f7b2749d7971811a2Hal Finkel assert(CI->getNumArgOperands() == CJ->getNumArgOperands() && 1129a77728415857196035c0090f7b2749d7971811a2Hal Finkel "Intrinsic argument counts differ"); 1130a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) { 1131dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines if ((IID == Intrinsic::powi || IID == Intrinsic::ctlz || 1132dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines IID == Intrinsic::cttz) && i == 1) 1133a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(CI->getArgOperand(i)->getType()); 1134a77728415857196035c0090f7b2749d7971811a2Hal Finkel else 1135a77728415857196035c0090f7b2749d7971811a2Hal Finkel Tys.push_back(getVecTypeForPair(CI->getArgOperand(i)->getType(), 1136a77728415857196035c0090f7b2749d7971811a2Hal Finkel CJ->getArgOperand(i)->getType())); 1137a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1138a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1139a77728415857196035c0090f7b2749d7971811a2Hal Finkel Type *RetTy = getVecTypeForPair(IT1, JT1); 1140abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned VCost = TTI->getIntrinsicInstrCost(IID, RetTy, Tys); 1141a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1142a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (VCost > ICost + JCost) 1143a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1144a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1145a77728415857196035c0090f7b2749d7971811a2Hal Finkel // We don't want to fuse to a type that will be split, even 1146a77728415857196035c0090f7b2749d7971811a2Hal Finkel // if the two input types will also be split and there is no other 1147a77728415857196035c0090f7b2749d7971811a2Hal Finkel // associated cost. 1148abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned RetParts = TTI->getNumberOfParts(RetTy); 1149a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (RetParts > 1) 1150a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1151a77728415857196035c0090f7b2749d7971811a2Hal Finkel else if (!RetParts && VCost == ICost + JCost) 1152a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1153a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1154a77728415857196035c0090f7b2749d7971811a2Hal Finkel for (unsigned i = 0, ie = CI->getNumArgOperands(); i != ie; ++i) { 1155a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (!Tys[i]->isVectorTy()) 1156a77728415857196035c0090f7b2749d7971811a2Hal Finkel continue; 1157a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1158abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth unsigned NumParts = TTI->getNumberOfParts(Tys[i]); 1159a77728415857196035c0090f7b2749d7971811a2Hal Finkel if (NumParts > 1) 1160a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1161a77728415857196035c0090f7b2749d7971811a2Hal Finkel else if (!NumParts && VCost == ICost + JCost) 1162a77728415857196035c0090f7b2749d7971811a2Hal Finkel return false; 1163a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 1164a77728415857196035c0090f7b2749d7971811a2Hal Finkel 1165a77728415857196035c0090f7b2749d7971811a2Hal Finkel CostSavings = ICost + JCost - VCost; 1166a77728415857196035c0090f7b2749d7971811a2Hal Finkel } 11676173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 11686173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel 1169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Figure out whether or not J uses I and update the users and write-set 1173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // structures associated with I. Specifically, Users represents the set of 1174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instructions that depend on I. WriteSet represents the set 1175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of memory locations that are dependent on I. If UpdateUsers is true, 1176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and J uses I, then Users is updated to contain J and WriteSet is updated 1177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to contain any memory locations to which J writes. The function returns 1178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // true if J uses I. By default, alias analysis is used to determine 1179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // whether J reads from memory that overlaps with a location in WriteSet. 118097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel // If LoadMoveSet is not null, then it is a previously-computed map 1181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // where the key is the memory-based user instruction and the value is 1182de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the instruction to be compared with I. So, if LoadMoveSet is provided, 1183de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // then the alias analysis is not used. This is necessary because this 1184de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // function is called during the process of moving instructions during 1185de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vectorization and the results of the alias analysis are not stable during 1186de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that process. 1187de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::trackUsesOfI(DenseSet<Value *> &Users, 1188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker &WriteSet, Instruction *I, 1189de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, bool UpdateUsers, 11902f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> *LoadMoveSetPairs) { 1191de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool UsesI = false; 1192de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This instruction may already be marked as a user due, for example, to 1194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // being a member of a selected pair. 1195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (Users.count(J)) 1196de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI) 11997e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel for (User::op_iterator JU = J->op_begin(), JE = J->op_end(); 12007e004d177fe76145f75a9417ed2e281f1b9abaf7Hal Finkel JU != JE; ++JU) { 1201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *V = *JU; 1202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I == V || Users.count(V)) { 1203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UsesI = true; 1204de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!UsesI && J->mayReadFromMemory()) { 12082f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel if (LoadMoveSetPairs) { 12092f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel UsesI = LoadMoveSetPairs->count(ValuePair(J, I)); 1210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (AliasSetTracker::iterator W = WriteSet.begin(), 1212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel WE = WriteSet.end(); W != WE; ++W) { 121338a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel if (W->aliasesUnknownInst(J, *AA)) { 121438a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel UsesI = true; 121538a7f22445b8782682d1f8f253454ea0390d4ac5Hal Finkel break; 1216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1217de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1218de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI && UpdateUsers) { 1222de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (J->mayWriteToMemory()) WriteSet.add(J); 1223de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Users.insert(J); 1224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1226de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return UsesI; 1227de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1228de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1229de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function iterates over all instruction pairs in the provided 1230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // basic block and collects all candidate pairs for vectorization. 12315d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool BBVectorize::getCandidatePairs(BasicBlock &BB, 12325d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel BasicBlock::iterator &Start, 12336ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 1234a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel DenseSet<ValuePair> &FixedOrderPairs, 123565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 123664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Value *> &PairableInsts, bool NonPow2Len) { 1237ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel size_t TotalPairs = 0; 1238de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock::iterator E = BB.end(); 12395d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (Start == E) return false; 12405d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 12415d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool ShouldContinue = false, IAfterStart = false; 12425d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel for (BasicBlock::iterator I = Start++; I != E; ++I) { 12435d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (I == Start) IAfterStart = true; 12445d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1245de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool IsSimpleLoadStore; 1246de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isInstVectorizable(I, IsSimpleLoadStore)) continue; 1247de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1248de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for an instruction with which to pair instruction *I... 1249de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1250de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1251eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel if (I->mayWriteToMemory()) WriteSet.add(I); 1252eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel 12535d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel bool JAfterStart = IAfterStart; 125436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines BasicBlock::iterator J = std::next(I); 1255bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng for (unsigned ss = 0; J != E && ss <= Config.SearchLimit; ++J, ++ss) { 12565d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (J == Start) JAfterStart = true; 12575d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1258de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Determine if J uses I, if so, exit the loop. 1259bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UsesI = trackUsesOfI(Users, WriteSet, I, J, !Config.FastDep); 1260bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.FastDep) { 1261de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: For this heuristic to be effective, independent operations 1262de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // must tend to be intermixed. This is likely to be true from some 1263de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // kinds of grouped loop unrolling (but not the generic LLVM pass), 1264de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but otherwise may require some kind of reordering pass. 1265de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1266de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // When using fast dependency analysis, 1267de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // stop searching after first use: 1268de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) break; 1269de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 1270de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UsesI) continue; 1271de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1272de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1273de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J does not use I, and comes before the first use of I, so it can be 1274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // merged with I if the instructions are compatible. 1275a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel int CostSavings, FixedOrder; 127665309660fa61a837cc05323f69c618a7d8134d56Hal Finkel if (!areInstsCompatible(I, J, IsSimpleLoadStore, NonPow2Len, 1277a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel CostSavings, FixedOrder)) continue; 1278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // J is a candidate for merging with I. 1280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!PairableInsts.size() || 1281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts[PairableInsts.size()-1] != I) { 1282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInsts.push_back(I); 1283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 12845d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 12856ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairs[I].push_back(J); 1286ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel ++TotalPairs; 1287abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) 128865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CandidatePairCostSavings.insert(ValuePairWithCost(ValuePair(I, J), 128965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings)); 12905d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1291a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FixedOrder == 1) 1292a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(I, J)); 1293a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel else if (FixedOrder == -1) 1294a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel FixedOrderPairs.insert(ValuePair(J, I)); 1295a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel 12965d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // The next call to this function must start after the last instruction 12975d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // selected during this invocation. 12985d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (JAfterStart) { 129936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines Start = std::next(J); 13005d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel IAfterStart = JAfterStart = false; 13015d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 13025d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 1303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCandidateSelection) dbgs() << "BBV: candidate pair " 130465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel << *I << " <-> " << *J << " (cost savings: " << 130565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel CostSavings << ")\n"); 13065d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 13075d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // If we have already found too many pairs, break here and this function 13085d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // will be called again starting after the last instruction selected 13095d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel // during this invocation. 1310ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel if (PairableInsts.size() >= Config.MaxInsts || 1311ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel TotalPairs >= Config.MaxPairs) { 13125d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel ShouldContinue = true; 13135d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 13145d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel } 1315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 13165d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 13175d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel if (ShouldContinue) 13185d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel break; 1319de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1320de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1321de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: found " << PairableInsts.size() 1322de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " instructions with candidate pairs\n"); 13235d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel 13245d4e18bc39fea892f523d960213906d296d3cb38Hal Finkel return ShouldContinue; 1325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Finds candidate pairs connected to the pair P = <PI, PJ>. This means that 1328de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // it looks for pairs such that both members have an input which is an 1329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // output of PI or PJ. 1330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computePairsConnectedTo( 133197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 133297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 133397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 133497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 133597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 133697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ValuePair P) { 1337bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel StoreInst *SI, *SJ; 1338bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each possible pairing for this variable, look at the uses of 1340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the first value... 134136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (Value::user_iterator I = P.first->user_begin(), 134236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines E = P.first->user_end(); 134336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines I != E; ++I) { 134436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines User *UI = *I; 134536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isa<LoadInst>(UI)) { 1346bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // A pair cannot be connected to a load because the load only takes one 1347bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // operand (the address) and it is a scalar even after vectorization. 1348bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 134936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines } else if ((SI = dyn_cast<StoreInst>(UI)) && 1350bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SI->getPointerOperand()) { 1351bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // Similarly, a pair cannot be connected to a store through its 1352bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel // pointer operand. 1353bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1354bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel } 1355bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1356de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For each use of the first variable, look for uses of the second 1357de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // variable... 135836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (User *UJ : P.second->users()) { 135936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if ((SJ = dyn_cast<StoreInst>(UJ)) && 1360bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1361bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1362bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 1363de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <I, J>: 136436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (CandidatePairsSet.count(ValuePair(UI, UJ))) { 136536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VPPair VP(P, ValuePair(UI, UJ)); 136697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs[VP.first].push_back(VP.second); 136772465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionDirect)); 136872465ea23d010507d3746adc126d719005981e05Hal Finkel } 1369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1370de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for <J, I>: 137136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (CandidatePairsSet.count(ValuePair(UJ, UI))) { 137236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VPPair VP(P, ValuePair(UJ, UI)); 137397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs[VP.first].push_back(VP.second); 137472465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSwap)); 137572465ea23d010507d3746adc126d719005981e05Hal Finkel } 1376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1378bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) continue; 1379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the first value in the pair is used by 1380de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 138136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (Value::user_iterator J = P.first->user_begin(); J != E; ++J) { 138236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines User *UJ = *J; 138336b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if ((SJ = dyn_cast<StoreInst>(UJ)) && 1384bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.first == SJ->getPointerOperand()) 1385bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1386bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 138736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (CandidatePairsSet.count(ValuePair(UI, UJ))) { 138836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VPPair VP(P, ValuePair(UI, UJ)); 138997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs[VP.first].push_back(VP.second); 139072465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 139172465ea23d010507d3746adc126d719005981e05Hal Finkel } 1392de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1393de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1394de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1395bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng if (Config.SplatBreaksChain) return; 1396de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Look for cases where just the second value in the pair is used by 1397de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both members of another pair (splatting). 139836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (Value::user_iterator I = P.second->user_begin(), 139936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines E = P.second->user_end(); 140036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines I != E; ++I) { 140136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines User *UI = *I; 140236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isa<LoadInst>(UI)) 1403bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 140436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines else if ((SI = dyn_cast<StoreInst>(UI)) && 1405bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SI->getPointerOperand()) 1406bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1407bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 140836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (Value::user_iterator J = P.second->user_begin(); J != E; ++J) { 140936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines User *UJ = *J; 141036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if ((SJ = dyn_cast<StoreInst>(UJ)) && 1411bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel P.second == SJ->getPointerOperand()) 1412bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel continue; 1413bba23ed672c4cedd61a302497f45bf6f53fec7b2Hal Finkel 141436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (CandidatePairsSet.count(ValuePair(UI, UJ))) { 141536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines VPPair VP(P, ValuePair(UI, UJ)); 141697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs[VP.first].push_back(VP.second); 141772465ea23d010507d3746adc126d719005981e05Hal Finkel PairConnectionTypes.insert(VPPairWithType(VP, PairConnectionSplat)); 141872465ea23d010507d3746adc126d719005981e05Hal Finkel } 1419de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1420de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1421de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1422de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1423de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function figures out which pairs are connected. Two pairs are 1424de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // connected if some output of the first pair forms an input to both members 1425de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // of the second pair. 1426de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::computeConnectedPairs( 142797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 142897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 142997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 143097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 143197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes) { 1432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 1433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PE = PairableInsts.end(); PI != PE; ++PI) { 14346ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> >::iterator PP = 14356ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairs.find(*PI); 14366ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (PP == CandidatePairs.end()) 14376ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel continue; 1438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 14396ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator P = PP->second.begin(), 14406ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel E = PP->second.end(); P != E; ++P) 1441b1a82589339fed148c12b052d30861a539552f1aHal Finkel computePairsConnectedTo(CandidatePairs, CandidatePairsSet, 1442b1a82589339fed148c12b052d30861a539552f1aHal Finkel PairableInsts, ConnectedPairs, 14436ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel PairConnectionTypes, ValuePair(*PI, *P)); 1444de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1445de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 144697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DEBUG(size_t TotalPairs = 0; 144797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (DenseMap<ValuePair, std::vector<ValuePair> >::iterator I = 144897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs.begin(), IE = ConnectedPairs.end(); I != IE; ++I) 144997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel TotalPairs += I->second.size(); 145097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel dbgs() << "BBV: found " << TotalPairs 1451de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << " pair connections.\n"); 1452de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1453de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1454de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function builds a set of use tuples such that <A, B> is in the set 1455f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // if B is in the use dag of A. If B is in the use dag of A, then B 1456de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // depends on the output of A. 1457de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::buildDepMap( 1458de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BasicBlock &BB, 14596ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 1460de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 1461de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> &PairableInstUsers) { 1462de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> IsInPair; 14636ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (DenseMap<Value *, std::vector<Value *> >::iterator C = 14646ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairs.begin(), E = CandidatePairs.end(); C != E; ++C) { 1465de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel IsInPair.insert(C->first); 14666ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel IsInPair.insert(C->second.begin(), C->second.end()); 1467de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1468de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 14697a8aba906416b6998347b52c3c08610fdc190638Hal Finkel // Iterate through the basic block, recording all users of each 1470de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairable instruction. 1471de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1472c951003faf4d475d221f5e839971673d2350b983Hal Finkel BasicBlock::iterator E = BB.end(), EL = 1473c951003faf4d475d221f5e839971673d2350b983Hal Finkel BasicBlock::iterator(cast<Instruction>(PairableInsts.back())); 1474de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator I = BB.getFirstInsertionPt(); I != E; ++I) { 1475de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IsInPair.find(I) == IsInPair.end()) continue; 1476de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1477de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 1478de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 1479eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel if (I->mayWriteToMemory()) WriteSet.add(I); 1480eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel 148136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (BasicBlock::iterator J = std::next(I); J != E; ++J) { 1482de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) trackUsesOfI(Users, WriteSet, I, J); 1483de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1484c951003faf4d475d221f5e839971673d2350b983Hal Finkel if (J == EL) 1485c951003faf4d475d221f5e839971673d2350b983Hal Finkel break; 1486c951003faf4d475d221f5e839971673d2350b983Hal Finkel } 1487c951003faf4d475d221f5e839971673d2350b983Hal Finkel 1488de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseSet<Value *>::iterator U = Users.begin(), E = Users.end(); 14898f3359a4b396d3f1a7b2726e02f199be74c62e4cHal Finkel U != E; ++U) { 14908f3359a4b396d3f1a7b2726e02f199be74c62e4cHal Finkel if (IsInPair.find(*U) == IsInPair.end()) continue; 1491de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.insert(ValuePair(I, *U)); 14928f3359a4b396d3f1a7b2726e02f199be74c62e4cHal Finkel } 1493c951003faf4d475d221f5e839971673d2350b983Hal Finkel 1494c951003faf4d475d221f5e839971673d2350b983Hal Finkel if (I == EL) 1495c951003faf4d475d221f5e839971673d2350b983Hal Finkel break; 1496de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1497de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1498de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1499de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns true if an input to pair P is an output of pair Q and also an 1500de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // input of pair Q is an output of pair P. If this is the case, then these 1501de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // two pairs cannot be simultaneously fused. 1502de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairsConflict(ValuePair P, ValuePair Q, 150397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 150497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > *PairableInstUserMap, 150597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<VPPair> *PairableInstUserPairSet) { 1506de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Two pairs are in conflict if they are mutual Users of eachother. 1507de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool QUsesP = PairableInstUsers.count(ValuePair(P.first, Q.first)) || 1508de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.first, Q.second)) || 1509de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.first)) || 1510de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(P.second, Q.second)); 1511de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool PUsesQ = PairableInstUsers.count(ValuePair(Q.first, P.first)) || 1512de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.first, P.second)) || 1513de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.first)) || 1514de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PairableInstUsers.count(ValuePair(Q.second, P.second)); 1515de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PairableInstUserMap) { 1516de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: The expensive part of the cycle check is not so much the cycle 1517de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // check itself but this edge insertion procedure. This needs some 151897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel // profiling and probably a different data structure. 1519de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (PUsesQ) { 1520da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel if (PairableInstUserPairSet->insert(VPPair(Q, P)).second) 152197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel (*PairableInstUserMap)[Q].push_back(P); 1522de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1523de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (QUsesP) { 1524da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel if (PairableInstUserPairSet->insert(VPPair(P, Q)).second) 152597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel (*PairableInstUserMap)[P].push_back(Q); 1526de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1527de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1528de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1529de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (QUsesP && PUsesQ); 1530de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1531de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1532de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function walks the use graph of current pairs to see if, starting 1533de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // from P, the walk returns to P. 1534de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::pairWillFormCycle(ValuePair P, 153597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUserMap, 153697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CurrentPairs) { 1537de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1538de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: starting cycle check for : " << *P.first << " <-> " 1539de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *P.second << "\n"); 1540de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // A lookup table of visisted pairs is kept because the PairableInstUserMap 1541de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contains non-direct associations. 1542de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> Visited; 154335564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePair, 32> Q; 1544de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1545de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(P); 154635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 154735564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePair QTop = Q.pop_back_val(); 1548de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Visited.insert(QTop); 1549de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1550de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugCycleCheck) 1551de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel dbgs() << "BBV: cycle check visiting: " << *QTop.first << " <-> " 1552de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << *QTop.second << "\n"); 155397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator QQ = 155497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel PairableInstUserMap.find(QTop); 155597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (QQ == PairableInstUserMap.end()) 155697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel continue; 155797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel 155897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator C = QQ->second.begin(), 155997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel CE = QQ->second.end(); C != CE; ++C) { 156097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (*C == P) { 1561de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() 1562de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel << "BBV: rejected to prevent non-trivial cycle formation: " 156397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel << QTop.first << " <-> " << C->second << "\n"); 1564de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return true; 1565de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1566de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 156797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (CurrentPairs.count(*C) && !Visited.count(*C)) 156897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel Q.push_back(*C); 1569de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 157035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1571de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1572de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return false; 1573de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1574de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1575f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // This function builds the initial dag of connected pairs with the 1576de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair J at the root. 1577f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void BBVectorize::buildInitialDAGFor( 157897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 157997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 158097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 158197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 158297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 158397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1584f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t> &DAG, ValuePair J) { 1585f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // Each of these pairs is viewed as the root node of a DAG. The DAG 1586de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is then walked (depth-first). As this happens, we keep track of 1587f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // the pairs that compose the DAG and the maximum depth of the DAG. 158835564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1589de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1590de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 159135564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 1592de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ValuePairWithDepth QTop = Q.back(); 1593de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1594de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Push each child onto the queue: 1595de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool MoreChildren = false; 1596de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t MaxChildDepth = QTop.second; 159797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator QQ = 159897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs.find(QTop.first); 159997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (QQ != ConnectedPairs.end()) 160097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator k = QQ->second.begin(), 160197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ke = QQ->second.end(); k != ke; ++k) { 160297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel // Make sure that this child pair is still a candidate: 160397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (CandidatePairsSet.count(*k)) { 1604f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t>::iterator C = DAG.find(*k); 1605f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (C == DAG.end()) { 160697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel size_t d = getDepthFactor(k->first); 160797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel Q.push_back(ValuePairWithDepth(*k, QTop.second+d)); 160897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel MoreChildren = true; 160997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel } else { 161097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel MaxChildDepth = std::max(MaxChildDepth, C->second); 161197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel } 1612de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1613de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1614de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1615de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!MoreChildren) { 1616f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // Record the current pair as part of the DAG: 1617f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DAG.insert(ValuePairWithDepth(QTop.first, MaxChildDepth)); 1618de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.pop_back(); 1619de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 162035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1621de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1622de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1623f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // Given some initial dag, prune it by removing conflicting pairs (pairs 1624de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that cannot be simultaneously chosen for vectorization). 1625f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void BBVectorize::pruneDAGFor( 162697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 162797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 162897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 162997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 163097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUserMap, 163197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 163297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1633f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t> &DAG, 1634f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> &PrunedDAG, ValuePair J, 163597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel bool UseCycleCheck) { 163635564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel SmallVector<ValuePairWithDepth, 32> Q; 1637de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // General depth-first post-order traversal: 1638de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(J, getDepthFactor(J.first))); 163935564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel do { 164035564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel ValuePairWithDepth QTop = Q.pop_back_val(); 1641f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel PrunedDAG.insert(QTop.first); 1642de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1643de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Visit each child, pruning as necessary... 164497d19ebe5b5bf27617e536a16fa232116cefe914Hal Finkel SmallVector<ValuePairWithDepth, 8> BestChildren; 164597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator QQ = 164697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs.find(QTop.first); 164797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (QQ == ConnectedPairs.end()) 164897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel continue; 164997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel 165097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator K = QQ->second.begin(), 165197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel KE = QQ->second.end(); K != KE; ++K) { 1652f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t>::iterator C = DAG.find(*K); 1653f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (C == DAG.end()) continue; 1654de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1655f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // This child is in the DAG, now we need to make sure it is the 1656de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // best of any conflicting children. There could be multiple 1657de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflicting children, so first, determine if we're keeping 1658de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // this child, then delete conflicting children as necessary. 1659de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1660de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // It is also necessary to guard against pairing-induced 1661de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // dependencies. Consider instructions a .. x .. y .. b 1662de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // such that (a,b) are to be fused and (x,y) are to be fused 1663de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // but a is an input to x and b is an output from y. This 1664de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // means that y cannot be moved after b but x must be moved 1665de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // after b for (a,b) to be fused. In other words, after 1666de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // fusing (a,b) we have y .. a/b .. x where y is an input 1667de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to a/b and x is an output to a/b: x and y can no longer 1668de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // be legally fused. To prevent this condition, we must 1669f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // make sure that a child pair added to the DAG is not 1670de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // both an input and output of an already-selected pair. 1671de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1672de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Pairing-induced dependencies can also form from more complicated 1673de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // cycles. The pair vs. pair conflicts are easy to check, and so 1674de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that is done explicitly for "fast rejection", and because for 1675de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // child vs. child conflicts, we may prefer to keep the current 1676de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in preference to the already-selected child. 1677de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> CurrentPairs; 1678de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1679de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool CanAdd = true; 16806227d5c690504c7ada5780c00a635b282c46e275Craig Topper for (SmallVectorImpl<ValuePairWithDepth>::iterator C2 168143ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1682de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1683de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1684de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1685de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1686de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1687de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1688dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserMap : nullptr, 1689dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserPairSet 1690dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines : nullptr)) { 1691de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->second >= C->second) { 1692de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1693de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1694de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1695de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1696de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1697de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1698de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1699de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1700de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1701de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Even worse, this child could conflict with another node already 1702f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // selected for the DAG. If that is the case, ignore this child. 1703f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel for (DenseSet<ValuePair>::iterator T = PrunedDAG.begin(), 1704f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel E2 = PrunedDAG.end(); T != E2; ++T) { 1705de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (T->first == C->first.first || 1706de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->first == C->first.second || 1707de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.first || 1708de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel T->second == C->first.second || 1709de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(*T, C->first, PairableInstUsers, 1710dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserMap : nullptr, 1711dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserPairSet 1712dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines : nullptr)) { 1713de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1714de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1715de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1716de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1717de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*T); 1718de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1719de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1720de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1721de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // And check the queue too... 17226227d5c690504c7ada5780c00a635b282c46e275Craig Topper for (SmallVectorImpl<ValuePairWithDepth>::iterator C2 = Q.begin(), 1723de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E2 = Q.end(); C2 != E2; ++C2) { 1724de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1725de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1726de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1727de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers, 1729dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserMap : nullptr, 1730dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserPairSet 1731dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines : nullptr)) { 1732de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1733de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1734de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1735de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1736de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(C2->first); 1737de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1738de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1739de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1740de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Last but not least, check for a conflict with any of the 1741de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // already-chosen pairs. 1742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C2 = 1743de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.begin(), E2 = ChosenPairs.end(); 1744de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2 != E2; ++C2) { 1745de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (pairsConflict(*C2, C->first, PairableInstUsers, 1746dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserMap : nullptr, 1747dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserPairSet 1748dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines : nullptr)) { 1749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CanAdd = false; 1750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1751de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1752de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1753de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel CurrentPairs.insert(*C2); 1754de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1755de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!CanAdd) continue; 1756de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 17571230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // To check for non-trivial cycles formed by the addition of the 17581230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // current pair we've formed a list of all relevant pairs, now use a 17591230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // graph walk to check for a cycle. We start from the current pair and 1760f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // walk the use dag to see if we again reach the current pair. If we 17611230ad6e8cb7977527ac64dcf5005464d7d6c20bSebastian Pop // do, then the current pair is rejected. 1762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // FIXME: It may be more efficient to use a topological-ordering 1764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // algorithm to improve the cycle check. This should be investigated. 1765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 1766de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairWillFormCycle(C->first, PairableInstUserMap, CurrentPairs)) 1767de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1768de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1769de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This child can be added, but we may have chosen it in preference 1770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to an already-selected child. Check for this here, and if a 1771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict is found, then remove the previously-selected child 1772de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // before adding this one in its place. 17736227d5c690504c7ada5780c00a635b282c46e275Craig Topper for (SmallVectorImpl<ValuePairWithDepth>::iterator C2 177443ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(); C2 != BestChildren.end();) { 1775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (C2->first.first == C->first.first || 1776de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.first == C->first.second || 1777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.first || 1778de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C2->first.second == C->first.second || 1779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel pairsConflict(C2->first, C->first, PairableInstUsers)) 1780d7a3425f06d51ed579bd9aefeb835b7fa4ce7849Hal Finkel C2 = BestChildren.erase(C2); 1781de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel else 1782de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++C2; 1783de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1784de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1785d7a3425f06d51ed579bd9aefeb835b7fa4ce7849Hal Finkel BestChildren.push_back(ValuePairWithDepth(C->first, C->second)); 1786de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1787de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 17886227d5c690504c7ada5780c00a635b282c46e275Craig Topper for (SmallVectorImpl<ValuePairWithDepth>::iterator C 178943ec0f4921e315dd9507be7467e633a837ad23dbSebastian Pop = BestChildren.begin(), E2 = BestChildren.end(); 1790de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel C != E2; ++C) { 1791de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel size_t DepthF = getDepthFactor(C->first.first); 1792de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Q.push_back(ValuePairWithDepth(C->first, QTop.second+DepthF)); 1793de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 179435564dc3ae1c377abad425cb09928eaf676dcb3cHal Finkel } while (!Q.empty()); 1795de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1796de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1797f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // This function finds the best dag of mututally-compatible connected 1798de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pairs, given the choice of root pairs as an iterator range. 1799f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel void BBVectorize::findBestDAGFor( 180097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 180197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 180297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 180397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 180497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 180597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 180697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 180797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps, 180897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 180997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &PairableInstUserMap, 181097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<VPPair> &PairableInstUserPairSet, 181197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 1812f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> &BestDAG, size_t &BestMaxDepth, 181397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel int &BestEffSize, Value *II, std::vector<Value *>&JJ, 181497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel bool UseCycleCheck) { 18156ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator J = JJ.begin(), JE = JJ.end(); 18166ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel J != JE; ++J) { 18176ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel ValuePair IJ(II, *J); 18186ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (!CandidatePairsSet.count(IJ)) 18196ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel continue; 1820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1821de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before going any further, make sure that this pair does not 1822de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // conflict with any already-selected pairs (see comment below 1823f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // near the DAG pruning for more details). 1824de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<ValuePair> ChosenPairSet; 1825de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool DoesConflict = false; 1826de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator C = ChosenPairs.begin(), 1827de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); C != E; ++C) { 18286ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (pairsConflict(*C, IJ, PairableInstUsers, 1829dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserMap : nullptr, 1830dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines UseCycleCheck ? &PairableInstUserPairSet : nullptr)) { 1831de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DoesConflict = true; 1832de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel break; 1833de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1834de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairSet.insert(*C); 1836de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 1837de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (DoesConflict) continue; 1838de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (UseCycleCheck && 18406ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel pairWillFormCycle(IJ, PairableInstUserMap, ChosenPairSet)) 1841de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 1842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1843f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseMap<ValuePair, size_t> DAG; 1844f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel buildInitialDAGFor(CandidatePairs, CandidatePairsSet, 1845b1a82589339fed148c12b052d30861a539552f1aHal Finkel PairableInsts, ConnectedPairs, 1846f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel PairableInstUsers, ChosenPairs, DAG, IJ); 1847de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1848de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Because we'll keep the child with the largest depth, the largest 1849f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // depth is still the same in the unpruned DAG. 1850f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel size_t MaxDepth = DAG.lookup(IJ); 1851de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1852f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "BBV: found DAG for pair {" 185376a05c93b13a8debec4497a6e4e753d7531709e5Hal Finkel << *IJ.first << " <-> " << *IJ.second << "} of depth " << 1854f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel MaxDepth << " and size " << DAG.size() << "\n"); 1855de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1856f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // At this point the DAG has been constructed, but, may contain 1857de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // contradictory children (meaning that different children of 1858f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // some dag node may be attempting to fuse the same instruction). 1859f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // So now we walk the dag again, in the case of a conflict, 1860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // keep only the child with the largest depth. To break a tie, 1861de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // favor the first child. 1862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 1863f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> PrunedDAG; 1864f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel pruneDAGFor(CandidatePairs, PairableInsts, ConnectedPairs, 1865b1a82589339fed148c12b052d30861a539552f1aHal Finkel PairableInstUsers, PairableInstUserMap, 1866b1a82589339fed148c12b052d30861a539552f1aHal Finkel PairableInstUserPairSet, 1867f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel ChosenPairs, DAG, PrunedDAG, IJ, UseCycleCheck); 1868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 186965309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int EffSize = 0; 1870abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (TTI) { 1871f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<Value *> PrunedDAGInstrs; 1872f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedDAG.begin(), 1873f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel E = PrunedDAG.end(); S != E; ++S) { 1874f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel PrunedDAGInstrs.insert(S->first); 1875f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel PrunedDAGInstrs.insert(S->second); 187678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 187778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 187878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The set of pairs that have already contributed to the total cost. 187978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DenseSet<ValuePair> IncomingPairs; 188078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 18814387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // If the cost model were perfect, this might not be necessary; but we 18824387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // need to make sure that we don't get stuck vectorizing our own 18834387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel // shuffle chains. 18844387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel bool HasNontrivialInsts = false; 18854387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 188686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // The node weights represent the cost savings associated with 188786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // fusing the pair of instructions. 1888f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedDAG.begin(), 1889f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel E = PrunedDAG.end(); S != E; ++S) { 18904387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel if (!isa<ShuffleVectorInst>(S->first) && 18914387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel !isa<InsertElementInst>(S->first) && 18924387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel !isa<ExtractElementInst>(S->first)) 18934387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel HasNontrivialInsts = true; 18944387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 189578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool FlipOrder = false; 189678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 189778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (getDepthFactor(S->first)) { 189878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = CandidatePairCostSavings.find(*S)->second; 189978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tweight {" 190078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *S->first << " <-> " << *S->second << "} = " << 190178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 190278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize += ESContrib; 190378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 190486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 190578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // The edge weights contribute in a negative sense: they represent 190678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // the cost of shuffles. 190797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator SS = 190897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairDeps.find(*S); 190997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (SS != ConnectedPairDeps.end()) { 191086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 191197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator T = SS->second.begin(), 191297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel TE = SS->second.end(); T != TE; ++T) { 191397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel VPPair Q(*S, *T); 1914f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (!PrunedDAG.count(Q.second)) 191578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 191686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 191797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel PairConnectionTypes.find(VPPair(Q.second, Q.first)); 191886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 191986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 192086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if (R->second == PairConnectionDirect) 192186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsDirect; 192286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel else if (R->second == PairConnectionSwap) 192386ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ++NumDepsSwap; 192486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 192586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 192686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // If there are more swaps than direct connections, then 192786ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // the pair order will be flipped during fusion. So the real 192886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel // number of swaps is the minimum number. 192978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel FlipOrder = !FixedOrderPairs.count(*S) && 193086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ((NumDepsSwap > NumDepsDirect) || 193186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel FixedOrderPairs.count(ValuePair(S->second, S->first))); 193286ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel 193397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator T = SS->second.begin(), 193497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel TE = SS->second.end(); T != TE; ++T) { 193597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel VPPair Q(*S, *T); 1936f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (!PrunedDAG.count(Q.second)) 193778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 193886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel DenseMap<VPPair, unsigned>::iterator R = 193997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel PairConnectionTypes.find(VPPair(Q.second, Q.first)); 194086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel assert(R != PairConnectionTypes.end() && 194186ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel "Cannot find pair connection type"); 194297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel Type *Ty1 = Q.second.first->getType(), 194397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel *Ty2 = Q.second.second->getType(); 194486ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 194586ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel if ((R->second == PairConnectionDirect && FlipOrder) || 194686ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel (R->second == PairConnectionSwap && !FlipOrder) || 194778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel R->second == PairConnectionSplat) { 194878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 194978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 1950245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 1951245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (VTy->getVectorNumElements() == 2) { 1952245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (R->second == PairConnectionSplat) 1953245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1954245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Broadcast, VTy)); 1955245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel else 1956245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1957245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Reverse, VTy)); 1958245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } 1959245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 196078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 196197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel *Q.second.first << " <-> " << *Q.second.second << 196278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel "} -> {" << 196378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << " <-> " << *S->second << "} = " << 196478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 196578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 196678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 196778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 196878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 196978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 197078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of outgoing edges. We assume that edges outgoing 197178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // to shuffles, inserts or extracts can be merged, and so contribute 197278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // no additional cost. 197378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!S->first->getType()->isVoidTy()) { 197478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = S->first->getType(), 197578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = S->second->getType(); 197678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 197778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 197878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel bool NeedsExtraction = false; 197936b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (User *U : S->first->users()) { 198036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(U)) { 198186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // Shuffle can be folded if it has no other input 198286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<UndefValue>(SI->getOperand(1))) 198386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 198486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 198536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isa<ExtractElementInst>(U)) 198678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 198736b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (PrunedDAGInstrs.count(U)) 198878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 198978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 199078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 199178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 199278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 199378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 199478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 1995245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (Ty1->isVectorTy()) { 199678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 199778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty1, VTy); 1998245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 1999245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_ExtractSubvector, VTy, 0, Ty1)); 2000245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } else 2001abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 200278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 0); 200378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 200478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 200578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->first << "} = " << ESContrib << "\n"); 200678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 200778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 200878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 200978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = false; 201036b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines for (User *U : S->second->users()) { 201136b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (ShuffleVectorInst *SI = dyn_cast<ShuffleVectorInst>(U)) { 201286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // Shuffle can be folded if it has no other input 201386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (isa<UndefValue>(SI->getOperand(1))) 201486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 201586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 201636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (isa<ExtractElementInst>(U)) 201778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 201836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines if (PrunedDAGInstrs.count(U)) 201978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 202078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel NeedsExtraction = true; 202178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel break; 202278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 202378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 202478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (NeedsExtraction) { 202578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 2026245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (Ty2->isVectorTy()) { 202778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 202878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Ty2, VTy); 2029245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 2030245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_ExtractSubvector, VTy, 2031245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel Ty1->isVectorTy() ? Ty1->getVectorNumElements() : 1, Ty2)); 2032245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel } else 2033abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 203478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::ExtractElement, VTy, 1); 203578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" << 203678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S->second << "} = " << ESContrib << "\n"); 203778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 203878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 203978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 204078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 204178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Compute the cost of incoming edges. 204278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (!isa<LoadInst>(S->first) && !isa<StoreInst>(S->first)) { 204378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction *S1 = cast<Instruction>(S->first), 204478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *S2 = cast<Instruction>(S->second); 204578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel for (unsigned o = 0; o < S1->getNumOperands(); ++o) { 204678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Value *O1 = S1->getOperand(o), *O2 = S2->getOperand(o); 204778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 204878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining constants into vector constants (or small vector 204978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // constants into larger ones are assumed free). 205078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (isa<Constant>(O1) && isa<Constant>(O2)) 205178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 205278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 205378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (FlipOrder) 205478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(O1, O2); 205578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 205678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VP = ValuePair(O1, O2); 205778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ValuePair VPR = ValuePair(O2, O1); 205878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 205978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Internal edges are not handled here. 2060f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (PrunedDAG.count(VP) || PrunedDAG.count(VPR)) 206178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 206278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 206378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *Ty1 = O1->getType(), 206478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel *Ty2 = O2->getType(); 206578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *VTy = getVecTypeForPair(Ty1, Ty2); 206678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 206778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // Combining vector operations of the same type is also assumed 206878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // folded with other operations. 206986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (Ty1 == Ty2) { 207086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are insert elements, then both can be widened. 2071b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel InsertElementInst *IEO1 = dyn_cast<InsertElementInst>(O1), 2072b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel *IEO2 = dyn_cast<InsertElementInst>(O2); 2073b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (IEO1 && IEO2 && isPureIEChain(IEO1) && isPureIEChain(IEO2)) 207486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 207586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are extract elements, and both have the same input 207686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // type, then they can be replaced with a shuffle 207786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel ExtractElementInst *EIO1 = dyn_cast<ExtractElementInst>(O1), 207886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel *EIO2 = dyn_cast<ExtractElementInst>(O2); 207986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (EIO1 && EIO2 && 208086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel EIO1->getOperand(0)->getType() == 208186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel EIO2->getOperand(0)->getType()) 208286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 208386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // If both are a shuffle with equal operand types and only two 208486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // unqiue operands, then they can be replaced with a single 208586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel // shuffle 208686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel ShuffleVectorInst *SIO1 = dyn_cast<ShuffleVectorInst>(O1), 208786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel *SIO2 = dyn_cast<ShuffleVectorInst>(O2); 208886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (SIO1 && SIO2 && 208986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIO1->getOperand(0)->getType() == 209086c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIO2->getOperand(0)->getType()) { 209186c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SmallSet<Value *, 4> SIOps; 209286c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO1->getOperand(0)); 209386c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO1->getOperand(1)); 209486c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO2->getOperand(0)); 209586c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel SIOps.insert(SIO2->getOperand(1)); 209686c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel if (SIOps.size() <= 2) 209786c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel continue; 209886c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 209986c88c938aec8006d2ce83325ec1f31e1154620bHal Finkel } 210078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 210178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel int ESContrib; 210278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // This pair has already been formed. 210378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (IncomingPairs.count(VP)) { 210478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel continue; 210578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (IncomingPairs.count(VPR)) { 210678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 210778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, VTy); 2108245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel 2109245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel if (VTy->getVectorNumElements() == 2) 2110245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel ESContrib = std::min(ESContrib, (int) TTI->getShuffleCost( 2111245b657ab636a505066ea6a81591a9a8b93604d2Hal Finkel TargetTransformInfo::SK_Reverse, VTy)); 211278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy() && !Ty2->isVectorTy()) { 2113abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 211478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 0); 2115abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib += (int) TTI->getVectorInstrCost( 211678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, VTy, 1); 211778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty1->isVectorTy()) { 211878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O1 needs to be inserted into a vector of size O2, and then 211978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 2120abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 212178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty2, 0); 212278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 212378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty2); 212478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else if (!Ty2->isVectorTy()) { 212578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // O2 needs to be inserted into a vector of size O1, and then 212678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel // both need to be shuffled together. 2127abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth ESContrib = (int) TTI->getVectorInstrCost( 212878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Instruction::InsertElement, Ty1, 0); 212978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 213078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, Ty1); 213178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } else { 213278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel Type *TyBig = Ty1, *TySmall = Ty2; 213378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (Ty2->getVectorNumElements() > Ty1->getVectorNumElements()) 213478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel std::swap(TyBig, TySmall); 213578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 213678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib = (int) getInstrCost(Instruction::ShuffleVector, 213778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel VTy, TyBig); 213878fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel if (TyBig != TySmall) 213978fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib += (int) getInstrCost(Instruction::ShuffleVector, 214078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel TyBig, TySmall); 214178fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel } 214278fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel 214378fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel DEBUG(if (DebugPairSelection) dbgs() << "\tcost {" 214478fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel << *O1 << " <-> " << *O2 << "} = " << 214578fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel ESContrib << "\n"); 214678fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel EffSize -= ESContrib; 214778fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel IncomingPairs.insert(VP); 214886ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 214986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel } 215065309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 21514387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel 21524387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel if (!HasNontrivialInsts) { 21534387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel DEBUG(if (DebugPairSelection) dbgs() << 2154f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel "\tNo non-trivial instructions in DAG;" 21554387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel " override to zero effective size\n"); 21564387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel EffSize = 0; 21574387b8c95971a512e07bfda30dea6459e8419e8fHal Finkel } 215865309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } else { 2159f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel for (DenseSet<ValuePair>::iterator S = PrunedDAG.begin(), 2160f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel E = PrunedDAG.end(); S != E; ++S) 216165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize += (int) getDepthFactor(S->first); 216265309660fa61a837cc05323f69c618a7d8134d56Hal Finkel } 2163de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2164de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(if (DebugPairSelection) 2165f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel dbgs() << "BBV: found pruned DAG for pair {" 216676a05c93b13a8debec4497a6e4e753d7531709e5Hal Finkel << *IJ.first << " <-> " << *IJ.second << "} of depth " << 2167f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel MaxDepth << " and size " << PrunedDAG.size() << 2168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " (effective size: " << EffSize << ")\n"); 2169abc227d9b39baed266c453f459ca14242f5c1eeaChandler Carruth if (((TTI && !UseChainDepthWithTI) || 217078fd353d5e5daedc47ecc31b6193ca48793c249cHal Finkel MaxDepth >= Config.ReqChainDepth) && 217165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel EffSize > 0 && EffSize > BestEffSize) { 2172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestMaxDepth = MaxDepth; 2173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel BestEffSize = EffSize; 2174f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel BestDAG = PrunedDAG; 2175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2176de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2177de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2178de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2179de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Given the list of candidate pairs, this function selects those 2180de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // that will be fused into vector instructions. 2181de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::choosePairs( 218297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &CandidatePairs, 218397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &CandidatePairsSet, 218497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, int> &CandidatePairCostSavings, 218597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 218697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 218797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 218897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 218997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps, 219097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &PairableInstUsers, 219197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *>& ChosenPairs) { 2192bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng bool UseCycleCheck = 21936ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.size() <= Config.MaxCandPairsForCycleCheck; 21946ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel 21956ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel DenseMap<Value *, std::vector<Value *> > CandidatePairs2; 21966ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (DenseSet<ValuePair>::iterator I = CandidatePairsSet.begin(), 21976ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel E = CandidatePairsSet.end(); I != E; ++I) { 21986ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel std::vector<Value *> &JJ = CandidatePairs2[I->second]; 21996ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (JJ.empty()) JJ.reserve(32); 22006ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel JJ.push_back(I->first); 22016ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel } 22026ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel 220397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > PairableInstUserMap; 2204da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel DenseSet<VPPair> PairableInstUserPairSet; 2205de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator I = PairableInsts.begin(), 2206de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = PairableInsts.end(); I != E; ++I) { 2207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The number of possible pairings for this variable: 22086ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel size_t NumChoices = CandidatePairs.lookup(*I).size(); 2209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!NumChoices) continue; 2210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 22116ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel std::vector<Value *> &JJ = CandidatePairs[*I]; 2212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2213f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // The best pair to choose and its dag: 221465309660fa61a837cc05323f69c618a7d8134d56Hal Finkel size_t BestMaxDepth = 0; 221565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel int BestEffSize = 0; 2216f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DenseSet<ValuePair> BestDAG; 2217f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel findBestDAGFor(CandidatePairs, CandidatePairsSet, 2218b1a82589339fed148c12b052d30861a539552f1aHal Finkel CandidatePairCostSavings, 221986ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel PairableInsts, FixedOrderPairs, PairConnectionTypes, 222086ccc55c82651f91fd6a312c5f6a4b511bcd1aecHal Finkel ConnectedPairs, ConnectedPairDeps, 2221da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel PairableInstUsers, PairableInstUserMap, 2222da20ea696d8b24d89ae157106ddad2337296ed50Hal Finkel PairableInstUserPairSet, ChosenPairs, 2223f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel BestDAG, BestMaxDepth, BestEffSize, *I, JJ, 2224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel UseCycleCheck); 2225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2226f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel if (BestDAG.empty()) 22276ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel continue; 22286ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel 2229f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // A dag has been chosen (or not) at this point. If no dag was 2230de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // chosen, then this instruction, I, cannot be paired (and is no longer 2231de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // considered). 2232de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2233f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel DEBUG(dbgs() << "BBV: selected pairs in the best DAG for: " 22346ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel << *cast<Instruction>(*I) << "\n"); 2235de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2236f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel for (DenseSet<ValuePair>::iterator S = BestDAG.begin(), 2237f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel SE2 = BestDAG.end(); S != SE2; ++S) { 2238f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // Insert the members of this dag into the list of chosen pairs. 2239de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(ValuePair(S->first, S->second)); 2240de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected pair: " << *S->first << " <-> " << 2241de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *S->second << "\n"); 2242de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2243f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // Remove all candidate pairs that have values in the chosen dag. 2244f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel std::vector<Value *> &KK = CandidatePairs[S->first]; 22456ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator K = KK.begin(), KE = KK.end(); 22466ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel K != KE; ++K) { 22476ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (*K == S->second) 22486ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel continue; 22496ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel 22506ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.erase(ValuePair(S->first, *K)); 22516ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel } 2252f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel 2253f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel std::vector<Value *> &LL = CandidatePairs2[S->second]; 22546ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator L = LL.begin(), LE = LL.end(); 22556ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel L != LE; ++L) { 22566ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel if (*L == S->first) 22576ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel continue; 22586ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel 22596ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.erase(ValuePair(*L, S->second)); 22606ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel } 2261f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel 2262f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel std::vector<Value *> &MM = CandidatePairs[S->second]; 22636ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator M = MM.begin(), ME = MM.end(); 22646ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel M != ME; ++M) { 22656ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel assert(*M != S->first && "Flipped pair in candidate list?"); 22666ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.erase(ValuePair(S->second, *M)); 22676ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel } 2268f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel 2269f79f136cc64b0625b77c7b9008ed8c5b848b6b17Hal Finkel std::vector<Value *> &NN = CandidatePairs2[S->first]; 22706ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel for (std::vector<Value *>::iterator N = NN.begin(), NE = NN.end(); 22716ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel N != NE; ++N) { 22726ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel assert(*N != S->second && "Flipped pair in candidate list?"); 22736ca6d3b1eac5b8611f3a9e2c270c2e794d37e1f5Hal Finkel CandidatePairsSet.erase(ValuePair(*N, S->first)); 2274de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2275de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2276de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2277de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2278de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: selected " << ChosenPairs.size() << " pairs.\n"); 2279de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2280de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2281de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::string getReplacementName(Instruction *I, bool IsInput, unsigned o, 2282de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned n = 0) { 2283de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!I->hasName()) 2284de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ""; 2285de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2286de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return (I->getName() + (IsInput ? ".v.i" : ".v.r") + utostr(o) + 2287de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (n > 0 ? "." + utostr(n) : "")).str(); 2288de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2289de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2290de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the pointer input to the vector 2291de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 2292de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementPointerInput(LLVMContext& Context, 2293202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *I, Instruction *J, unsigned o) { 2294de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *IPtr, *JPtr; 229565309660fa61a837cc05323f69c618a7d8134d56Hal Finkel unsigned IAlignment, JAlignment, IAddressSpace, JAddressSpace; 2296de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int64_t OffsetInElmts; 2297282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 2298202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel // Note: the analysis might fail here, that is why the pair order has 2299282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel // been precomputed (OffsetInElmts must be unused here). 2300de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel (void) getPairPtrInfo(I, J, IPtr, JPtr, IAlignment, JAlignment, 230165309660fa61a837cc05323f69c618a7d8134d56Hal Finkel IAddressSpace, JAddressSpace, 230293f6f457614299eee3d22f376ab8f42a130f1912Hal Finkel OffsetInElmts, false); 2303de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2304de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // The pointer value is taken to be the one with the lowest offset. 2305202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Value *VPtr = IPtr; 2306de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2307244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault Type *ArgTypeI = IPtr->getType()->getPointerElementType(); 2308244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault Type *ArgTypeJ = JPtr->getType()->getPointerElementType(); 230964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2310244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault Type *VArgPtrType 2311244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault = PointerType::get(VArgType, 2312244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault IPtr->getType()->getPointerAddressSpace()); 2313de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return new BitCastInst(VPtr, VArgPtrType, getReplacementName(I, true, o), 2314202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel /* insert before */ I); 2315de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2316de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2317de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fillNewShuffleMask(LLVMContext& Context, Instruction *J, 231864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned MaskOffset, unsigned NumInElem, 231964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned NumInElem1, unsigned IdxOffset, 232064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> &Mask) { 2321244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned NumElem1 = J->getType()->getVectorNumElements(); 232264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < NumElem1; ++v) { 2323de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel int m = cast<ShuffleVectorInst>(J)->getMaskValue(v); 2324de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (m < 0) { 2325de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = UndefValue::get(Type::getInt32Ty(Context)); 2326de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2327de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned mm = m + (int) IdxOffset; 232864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (m >= (int) NumInElem1) 2329de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel mm += (int) NumInElem; 2330de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2331de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Mask[v+MaskOffset] = 2332de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ConstantInt::get(Type::getInt32Ty(Context), mm); 2333de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2334de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2335de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2336de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2337de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value that is to be used as the vector-shuffle mask to the 2338de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // vector instruction that fuses I with J. 2339de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementShuffleMask(LLVMContext& Context, 2340de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2341de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the shuffle mask. We need to append the second 2342de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // mask to the first, and the numbers need to be adjusted. 2343de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 234464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 234564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 234664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 234764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2348244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned NumElemI = ArgTypeI->getVectorNumElements(); 2349de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2350de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Get the total number of elements in the fused vector type. 2351de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // By definition, this must equal the number of elements in 2352de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the final mask. 2353244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned NumElem = VArgType->getVectorNumElements(); 2354de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Constant*> Mask(NumElem); 2355de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 235664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeI = I->getOperand(0)->getType(); 2357244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned NumInElemI = OpTypeI->getVectorNumElements(); 235864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *OpTypeJ = J->getOperand(0)->getType(); 2359244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned NumInElemJ = OpTypeJ->getVectorNumElements(); 236064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 236164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The fused vector will be: 236264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 236364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // | NumInElemI | NumInElemJ | NumInElemI | NumInElemJ | 236464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // ----------------------------------------------------- 236564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // from which we'll extract NumElem total elements (where the first NumElemI 236664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // of them come from the mask in I and the remainder come from the mask 236764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // in J. 2368de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2369de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the first pair... 237064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, I, 0, NumInElemJ, NumInElemI, 237164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 0, Mask); 2372de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2373de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // For the mask from the second pair... 237464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel fillNewShuffleMask(Context, J, NumElemI, NumInElemI, NumInElemJ, 237564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NumInElemI, Mask); 2376de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2377de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return ConstantVector::get(Mask); 2378de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2379de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 238064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool BBVectorize::expandIEChain(LLVMContext& Context, Instruction *I, 238164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *J, unsigned o, Value *&LOp, 238264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElemL, 238364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL, Type *ArgTypeH, 238472465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ, unsigned IdxOff) { 238564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ExpandedIEChain = false; 238664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (InsertElementInst *LIE = dyn_cast<InsertElementInst>(LOp)) { 238764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If we have a pure insertelement chain, then this can be rewritten 238864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // into a chain that directly builds the larger type. 2389b2b2469a9178f7e22cd7a69f3093e54d67d6b712Hal Finkel if (isPureIEChain(LIE)) { 239064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<Value *, 8> VectElemts(numElemL, 239164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(ArgTypeL->getScalarType())); 239264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst *LIENext = LIE; 239364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel do { 239464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = 239564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LIENext->getOperand(2))->getSExtValue(); 239664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectElemts[Idx] = LIENext->getOperand(1); 239764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } while ((LIENext = 239864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel dyn_cast<InsertElementInst>(LIENext->getOperand(0)))); 239964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2400dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines LIENext = nullptr; 240164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LIEPrev = UndefValue::get(ArgTypeH); 240264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 240364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (isa<UndefValue>(VectElemts[i])) continue; 240464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIENext = InsertElementInst::Create(LIEPrev, VectElemts[i], 240564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 240664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel i + IdxOff), 240772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 240872465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, i+1)); 240972465ea23d010507d3746adc126d719005981e05Hal Finkel LIENext->insertBefore(IBeforeJ ? J : I); 241064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LIEPrev = LIENext; 241164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 241364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = LIENext ? (Value*) LIENext : UndefValue::get(ArgTypeH); 241464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExpandedIEChain = true; 241564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 241764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 241864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return ExpandedIEChain; 241964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 242064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2421611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault static unsigned getNumScalarElements(Type *Ty) { 2422611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault if (VectorType *VecTy = dyn_cast<VectorType>(Ty)) 2423611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault return VecTy->getNumElements(); 2424611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault return 1; 2425611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault } 2426611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault 2427de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Returns the value to be used as the specified operand of the vector 2428de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // instruction that fuses I with J. 2429de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *BBVectorize::getReplacementInput(LLVMContext& Context, Instruction *I, 243072465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *J, unsigned o, bool IBeforeJ) { 2431de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2432de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), 1); 2433de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 243464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Compute the fused vector type for this operand 243564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getOperand(o)->getType(); 243664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getOperand(o)->getType(); 243764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2438de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2439de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *L = I, *H = J; 244064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeL = ArgTypeI, *ArgTypeH = ArgTypeJ; 2441de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2442611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault unsigned numElemL = getNumScalarElements(ArgTypeL); 2443611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault unsigned numElemH = getNumScalarElements(ArgTypeH); 244464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 244564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *LOp = L->getOperand(o); 244664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *HOp = H->getOperand(o); 244764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VArgType->getNumElements(); 244864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 244964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // First, we check if we can reuse the "original" vector outputs (if these 245064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // exist). We might need a shuffle. 245164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *LEE = dyn_cast<ExtractElementInst>(LOp); 245264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ExtractElementInst *HEE = dyn_cast<ExtractElementInst>(HOp); 245364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *LSV = dyn_cast<ShuffleVectorInst>(LOp); 245464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ShuffleVectorInst *HSV = dyn_cast<ShuffleVectorInst>(HOp); 245564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 245664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // FIXME: If we're fusing shuffle instructions, then we can't apply this 245764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // optimization. The input vectors to the shuffle might be a different 245864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // length from the shuffle outputs. Unfortunately, the replacement 245964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // shuffle mask has already been formed, and the mask entries are sensitive 246064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // to the sizes of the inputs. 246164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool IsSizeChangeShuffle = 246264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel isa<ShuffleVectorInst>(L) && 246364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel (LOp->getType() != L->getType() || HOp->getType() != H->getType()); 246464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 246564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if ((LEE || LSV) && (HEE || HSV) && !IsSizeChangeShuffle) { 246664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We can have at most two unique vector inputs. 246764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool CanUseInputs = true; 2468dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Value *I1, *I2 = nullptr; 246964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 247064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LEE->getOperand(0); 247164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 247264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = LSV->getOperand(0); 247364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = LSV->getOperand(1); 247464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I2 == I1 || isa<UndefValue>(I2)) 2475dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines I2 = nullptr; 247664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 247764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 247864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 247964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HEE->getOperand(0); 248064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 248164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 248264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 248364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 248464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 248564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I3 = HSV->getOperand(0); 248664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I3 != I1) 248764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I3; 248864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I3 != I1 && I3 != I2) 248964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 249064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 249164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 249264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *I4 = HSV->getOperand(1); 249364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!isa<UndefValue>(I4)) { 249464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2 && I4 != I1) 249564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = I4; 249664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else if (I4 != I1 && I4 != I2) 249764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel CanUseInputs = false; 249864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 249964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 250064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 250164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 250264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (CanUseInputs) { 250364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned LOpElem = 2504244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault cast<Instruction>(LOp)->getOperand(0)->getType() 2505244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault ->getVectorNumElements(); 2506244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault 250764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned HOpElem = 2508244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault cast<Instruction>(HOp)->getOperand(0)->getType() 2509244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault ->getVectorNumElements(); 251064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 251164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We have one or two input vectors. We need to map each index of the 251264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // operands to the index of the original vector. 251364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel SmallVector<std::pair<int, int>, 8> II(numElem); 251464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemL; ++i) { 251564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 251664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (LEE) { 251764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 251864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(LEE->getOperand(1))->getSExtValue(); 251964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LEE->getOperand(0) == I1 ? 0 : 1; 252064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 252164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = LSV->getMaskValue(i); 252264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) LOpElem) { 252364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(0) == I1 ? 0 : 1; 252464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 252564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= LOpElem; 252664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = LSV->getOperand(1) == I1 ? 0 : 1; 252764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 252864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 252964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 253064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i] = std::pair<int, int>(Idx, INum); 253164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 253264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElemH; ++i) { 253364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx, INum; 253464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (HEE) { 253564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = 253664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel cast<ConstantInt>(HEE->getOperand(1))->getSExtValue(); 253764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HEE->getOperand(0) == I1 ? 0 : 1; 253864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 253964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx = HSV->getMaskValue(i); 254064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx < (int) HOpElem) { 254164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(0) == I1 ? 0 : 1; 254264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 254364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx -= HOpElem; 254464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel INum = HSV->getOperand(1) == I1 ? 0 : 1; 254564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 254664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 254764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 254864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel II[i + numElemL] = std::pair<int, int>(Idx, INum); 254964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 255064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 255164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // We now have an array which tells us from which index of which 255264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // input vector each element of the operand comes. 255364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I1T = cast<VectorType>(I1->getType()); 255464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I1Elem = I1T->getNumElements(); 255564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 255664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (!I2) { 255764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // In this case there is only one underlying vector input. Check for 255864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // the trivial case where we can use the input directly. 255964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem == numElem) { 256064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel bool ElemInOrder = true; 256164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 256264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[i].first != (int) i && II[i].first != -1) { 256364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ElemInOrder = false; 256464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel break; 256564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 256664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 256764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 256864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ElemInOrder) 256964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return I1; 257064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 257164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 257264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // A shuffle is needed. 257364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 257464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned i = 0; i < numElem; ++i) { 257564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[i].first; 257664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (Idx == -1) 257764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = UndefValue::get(Type::getInt32Ty(Context)); 257864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel else 257964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[i] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 258064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 258164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 258264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 258364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 258464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 258572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 258672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 258772465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 258864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 258964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 259064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 259164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *I2T = cast<VectorType>(I2->getType()); 259264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned I2Elem = I2T->getNumElements(); 259364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 259464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This input comes from two distinct vectors. The first step is to 259564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // make sure that both vectors are the same length. If not, the 259664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // smaller one will need to grow before they can be shuffled together. 259764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (I1Elem < I2Elem) { 259864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I2Elem); 259964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 260064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 260164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 260264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 260364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 260464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 260564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI1 = 260664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, UndefValue::get(I1T), 260764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 260872465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 260972465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 261072465ea23d010507d3746adc126d719005981e05Hal Finkel NewI1->insertBefore(IBeforeJ ? J : I); 261164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1 = NewI1; 261264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1T = I2T; 261364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I1Elem = I2Elem; 261464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (I1Elem > I2Elem) { 261564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(I1Elem); 261664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 261764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I2Elem; ++v) 261864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 261964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < I1Elem; ++v) 262064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 262164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 262264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewI2 = 262364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I2, UndefValue::get(I2T), 262464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 262572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 262672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 262772465ea23d010507d3746adc126d719005981e05Hal Finkel NewI2->insertBefore(IBeforeJ ? J : I); 262864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2 = NewI2; 262964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2T = I1T; 263064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel I2Elem = I1Elem; 263164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 263264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 263364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // Now that both I1 and I2 are the same length we can shuffle them 263464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // together (and use the result). 263564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElem); 263664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 263764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (II[v].first == -1) { 263864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 263964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 264064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel int Idx = II[v].first + II[v].second * I1Elem; 264164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 264264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 264364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 264464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 264564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NewOp = 264664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel new ShuffleVectorInst(I1, I2, ConstantVector::get(Mask), 264772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 264872465ea23d010507d3746adc126d719005981e05Hal Finkel NewOp->insertBefore(IBeforeJ ? J : I); 264964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return NewOp; 265064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2651de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2652de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 265364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgType = ArgTypeL; 265464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL < numElemH) { 265564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL == 1 && expandIEChain(Context, I, J, o, HOp, numElemH, 265672465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, VArgType, IBeforeJ, 1)) { 265764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // This is another short-circuit case: we're combining a scalar into 265864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // a vector that is formed by an IE chain. We've just expanded the IE 265964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // chain, now insert the scalar and we're done. 266064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 266164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = InsertElementInst::Create(HOp, LOp, CV0, 266272465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 266372465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 266464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 266564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, LOp, numElemL, ArgTypeL, 266672465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, IBeforeJ)) { 266764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // The two vector inputs to the shuffle must be the same length, 266864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // so extend the smaller vector to be the same length as the larger one. 266964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NLOp; 267064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemL > 1) { 267164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 267264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemH); 267364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 267464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 267564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 267664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 267764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 267864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 267964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = new ShuffleVectorInst(LOp, UndefValue::get(ArgTypeL), 268064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 268172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 268272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 268364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 268464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NLOp = InsertElementInst::Create(UndefValue::get(ArgTypeH), LOp, CV0, 268572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 268672465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 268764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 268864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 268972465ea23d010507d3746adc126d719005981e05Hal Finkel NLOp->insertBefore(IBeforeJ ? J : I); 269064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel LOp = NLOp; 269164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 269264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 269364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ArgType = ArgTypeH; 269464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (numElemL > numElemH) { 269564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH == 1 && expandIEChain(Context, I, J, o, LOp, numElemL, 269672465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeH, VArgType, IBeforeJ)) { 269764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *S = 269864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel InsertElementInst::Create(LOp, HOp, 269964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantInt::get(Type::getInt32Ty(Context), 270064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel numElemL), 270172465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 270272465ea23d010507d3746adc126d719005981e05Hal Finkel true, o)); 270372465ea23d010507d3746adc126d719005981e05Hal Finkel S->insertBefore(IBeforeJ ? J : I); 270464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel return S; 270564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else if (!expandIEChain(Context, I, J, o, HOp, numElemH, ArgTypeH, 270672465ea23d010507d3746adc126d719005981e05Hal Finkel ArgTypeL, IBeforeJ)) { 270764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *NHOp; 270864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (numElemH > 1) { 270964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant *> Mask(numElemL); 271064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned v = 0; 271164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemH; ++v) 271264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 271364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (; v < numElemL; ++v) 271464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = UndefValue::get(Type::getInt32Ty(Context)); 271564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 271664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = new ShuffleVectorInst(HOp, UndefValue::get(ArgTypeH), 271764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel ConstantVector::get(Mask), 271872465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 271972465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 272064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 272164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel NHOp = InsertElementInst::Create(UndefValue::get(ArgTypeL), HOp, CV0, 272272465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 272372465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 272464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2725244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault 272672465ea23d010507d3746adc126d719005981e05Hal Finkel NHOp->insertBefore(IBeforeJ ? J : I); 272764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel HOp = NHOp; 2728de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 272964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2730de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 273164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (ArgType->isVectorTy()) { 2732244d24597497c09ab68969c8bbbdf2576130262cMatt Arsenault unsigned numElem = VArgType->getVectorNumElements(); 273364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask(numElem); 273464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElem; ++v) { 273564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned Idx = v; 273664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // If the low vector was expanded, we need to skip the extra 273764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel // undefined entries. 273864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (v >= numElemL && numElemH > numElemL) 273964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Idx += (numElemH - numElemL); 274064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask[v] = ConstantInt::get(Type::getInt32Ty(Context), Idx); 274164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2742de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 274364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV = new ShuffleVectorInst(LOp, HOp, 274472465ea23d010507d3746adc126d719005981e05Hal Finkel ConstantVector::get(Mask), 274572465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, true, o)); 274672465ea23d010507d3746adc126d719005981e05Hal Finkel BV->insertBefore(IBeforeJ ? J : I); 2747de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV; 2748de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2749de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2750de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *BV1 = InsertElementInst::Create( 275164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel UndefValue::get(VArgType), LOp, CV0, 275272465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 275372465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 1)); 275472465ea23d010507d3746adc126d719005981e05Hal Finkel BV1->insertBefore(IBeforeJ ? J : I); 275564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Instruction *BV2 = InsertElementInst::Create(BV1, HOp, CV1, 275672465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementName(IBeforeJ ? I : J, 275772465ea23d010507d3746adc126d719005981e05Hal Finkel true, o, 2)); 275872465ea23d010507d3746adc126d719005981e05Hal Finkel BV2->insertBefore(IBeforeJ ? J : I); 2759de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel return BV2; 2760de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2761de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2762de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates an array of values that will be used as the inputs 2763de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to the vector instruction that fuses I with J. 2764de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::getReplacementInputsForPair(LLVMContext& Context, 2765de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J, 2766a0ec3f9b7b826b9b40b80199923b664bad808cceCraig Topper SmallVectorImpl<Value *> &ReplacedOperands, 276772465ea23d010507d3746adc126d719005981e05Hal Finkel bool IBeforeJ) { 2768de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 2769de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2770de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned p = 0, o = NumOperands-1; p < NumOperands; ++p, --o) { 2771de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Iterate backward so that we look at the store pointer 2772de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // first and know whether or not we need to flip the inputs. 2773de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2774de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<LoadInst>(I) || (o == 1 && isa<StoreInst>(I))) { 2775de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This is the pointer for a load/store instruction. 2776202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ReplacedOperands[o] = getReplacementPointerInput(Context, I, J, o); 2777de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 27786173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } else if (isa<CallInst>(I)) { 2779de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Function *F = cast<CallInst>(I)->getCalledFunction(); 2780a77728415857196035c0090f7b2749d7971811a2Hal Finkel Intrinsic::ID IID = (Intrinsic::ID) F->getIntrinsicID(); 27816173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel if (o == NumOperands-1) { 27826173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel BasicBlock &BB = *I->getParent(); 2783bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 27846173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel Module *M = BB.getParent()->getParent(); 278564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeI = I->getType(); 278664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *ArgTypeJ = J->getType(); 278764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *VArgType = getVecTypeForPair(ArgTypeI, ArgTypeJ); 2788bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 2789a77728415857196035c0090f7b2749d7971811a2Hal Finkel ReplacedOperands[o] = Intrinsic::getDeclaration(M, IID, VArgType); 27906173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 2791dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines } else if ((IID == Intrinsic::powi || IID == Intrinsic::ctlz || 2792dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines IID == Intrinsic::cttz) && o == 1) { 2793dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // The second argument of powi/ctlz/cttz is a single integer/constant 2794dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // and we've already checked that both arguments are equal. 2795dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines // As a result, we just keep I's second argument. 27966173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel ReplacedOperands[o] = I->getOperand(o); 27976173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel continue; 27986173ed95daf2f209fe3883faee45967e4800ae75Hal Finkel } 2799de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else if (isa<ShuffleVectorInst>(I) && o == NumOperands-1) { 2800de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ReplacedOperands[o] = getReplacementShuffleMask(Context, I, J); 2801de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 2802de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2803de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 280472465ea23d010507d3746adc126d719005981e05Hal Finkel ReplacedOperands[o] = getReplacementInput(Context, I, J, o, IBeforeJ); 2805de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2806de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2807de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2808de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function creates two values that represent the outputs of the 2809de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // original I and J instructions. These are generally vector shuffles 2810de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // or extracts. In many cases, these will end up being unused and, thus, 2811de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // eliminated by later passes. 2812de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::replaceOutputsOfPair(LLVMContext& Context, Instruction *I, 2813de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *J, Instruction *K, 2814de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2815202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *&K1, Instruction *&K2) { 2816de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (isa<StoreInst>(I)) { 2817de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(I, K); 2818de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AA->replaceWithNewValue(J, K); 2819de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2820de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Type *IType = I->getType(); 282164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Type *JType = J->getType(); 282264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 282364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel VectorType *VType = getVecTypeForPair(IType, JType); 282464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel unsigned numElem = VType->getNumElements(); 282564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 2826611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault unsigned numElemI = getNumScalarElements(IType); 2827611082966190251fed33f3d0cf1b4c0d20ad777bMatt Arsenault unsigned numElemJ = getNumScalarElements(JType); 2828de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2829de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (IType->isVectorTy()) { 283064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemI), Mask2(numElemI); 283164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemI; ++v) { 283264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 283364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemJ+v); 283464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 2835de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 283664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K1 = new ShuffleVectorInst(K, UndefValue::get(VType), 2837202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask1), 283864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 1)); 2839de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 284064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV0 = ConstantInt::get(Type::getInt32Ty(Context), 0); 2841202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K1 = ExtractElementInst::Create(K, CV0, 2842de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 1)); 284364e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 284464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 284564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel if (JType->isVectorTy()) { 284664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel std::vector<Constant*> Mask1(numElemJ), Mask2(numElemJ); 284764e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel for (unsigned v = 0; v < numElemJ; ++v) { 284864e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask1[v] = ConstantInt::get(Type::getInt32Ty(Context), v); 284964e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Mask2[v] = ConstantInt::get(Type::getInt32Ty(Context), numElemI+v); 285064e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } 285164e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel 285264e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel K2 = new ShuffleVectorInst(K, UndefValue::get(VType), 2853202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel ConstantVector::get( Mask2), 285464e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel getReplacementName(K, false, 2)); 285564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel } else { 285664e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Value *CV1 = ConstantInt::get(Type::getInt32Ty(Context), numElem-1); 2857202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K2 = ExtractElementInst::Create(K, CV1, 2858de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel getReplacementName(K, false, 2)); 2859de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2860de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2861de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K1->insertAfter(K); 2862de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K2->insertAfter(K1); 2863de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = K2; 2864de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2865de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2866de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2867de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2868de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel bool BBVectorize::canMoveUsesOfIAfterJ(BasicBlock &BB, 28692f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 2870de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2871de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 287236b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines BasicBlock::iterator L = std::next(BasicBlock::iterator(I)); 2873de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2874de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2875de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2876eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel if (I->mayWriteToMemory()) WriteSet.add(I); 2877eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel 2878de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J; ++L) 28792f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel (void) trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSetPairs); 2880de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2881de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(cast<Instruction>(L) == J && 2882de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel "Tracking has not proceeded far enough to check for dependencies"); 2883de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // If J is now in the use set of I, then trackUsesOfI will return true 2884de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // and we have a dependency cycle (and the fusing operation must abort). 28852f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel return !trackUsesOfI(Users, WriteSet, I, J, true, &LoadMoveSetPairs); 2886de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2887de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2888de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move all uses of the function I (including pairing-induced uses) after J. 2889de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::moveUsesOfIAfterJ(BasicBlock &BB, 28902f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 2891de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *&InsertionPt, 2892de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I, Instruction *J) { 2893de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 289436b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines BasicBlock::iterator L = std::next(BasicBlock::iterator(I)); 2895de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2896de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2897de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2898eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel if (I->mayWriteToMemory()) WriteSet.add(I); 2899eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel 2900de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (; cast<Instruction>(L) != J;) { 29012f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel if (trackUsesOfI(Users, WriteSet, I, L, true, &LoadMoveSetPairs)) { 2902de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Move this instruction 2903de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InstToMove = L; ++L; 2904de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2905de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: moving: " << *InstToMove << 2906de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " to after " << *InsertionPt << "\n"); 2907de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->removeFromParent(); 2908de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InstToMove->insertAfter(InsertionPt); 2909de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel InsertionPt = InstToMove; 2910de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } else { 2911de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++L; 2912de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2913de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2914de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2915de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2916de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Collect all load instruction that are in the move set of a given first 2917de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair member. These loads depend on the first instruction, I, and so need 2918de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // to be moved after J (the second instruction) when the pair is fused. 2919de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectPairLoadMoveSet(BasicBlock &BB, 2920de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 292197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &LoadMoveSet, 29222f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs, 2923de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I) { 2924de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Skip to the first instruction past I. 292536b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines BasicBlock::iterator L = std::next(BasicBlock::iterator(I)); 2926de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2927de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseSet<Value *> Users; 2928de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel AliasSetTracker WriteSet(*AA); 2929eaa8f5533f9f678fe3c56aec0201a34e46eaaf54Hal Finkel if (I->mayWriteToMemory()) WriteSet.add(I); 2930de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2931de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Note: We cannot end the loop when we reach J because J could be moved 2932de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // farther down the use chain by another instruction pairing. Also, J 2933de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be before I if this is an inverted input. 2934de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator E = BB.end(); cast<Instruction>(L) != E; ++L) { 2935de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (trackUsesOfI(Users, WriteSet, I, L)) { 29362f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel if (L->mayReadFromMemory()) { 293797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel LoadMoveSet[L].push_back(I); 29382f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel LoadMoveSetPairs.insert(ValuePair(L, I)); 29392f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel } 2940de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2941de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2942de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2943de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2944de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // In cases where both load/stores and the computation of their pointers 2945de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // are chosen for vectorization, we can end up in a situation where the 2946de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // aliasing analysis starts returning different query results as the 2947de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // process of fusing instruction pairs continues. Because the algorithm 2948f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // relies on finding the same use dags here as were found earlier, we'll 2949de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to precompute the necessary aliasing information here and then 2950de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // manually update it during the fusion process. 2951de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::collectLoadMoveSet(BasicBlock &BB, 2952de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<Value *> &PairableInsts, 2953de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *> &ChosenPairs, 295497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > &LoadMoveSet, 29552f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> &LoadMoveSetPairs) { 2956de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<Value *>::iterator PI = PairableInsts.begin(), 2957de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel PIE = PairableInsts.end(); PI != PIE; ++PI) { 2958de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(*PI); 2959de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) continue; 2960de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2961de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first); 29622f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel collectPairLoadMoveSet(BB, ChosenPairs, LoadMoveSet, 29632f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel LoadMoveSetPairs, I); 2964de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2965de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 2966de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 2967ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // When the first instruction in each pair is cloned, it will inherit its 2968ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // parent's metadata. This metadata must be combined with that of the other 2969ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel // instruction in a safe way. 2970ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel void BBVectorize::combineMetadata(Instruction *K, const Instruction *J) { 2971ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel SmallVector<std::pair<unsigned, MDNode*>, 4> Metadata; 2972ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->getAllMetadataOtherThanDebugLoc(Metadata); 2973ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel for (unsigned i = 0, n = Metadata.size(); i < n; ++i) { 2974ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel unsigned Kind = Metadata[i].first; 2975ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *JMD = J->getMetadata(Kind); 2976ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel MDNode *KMD = Metadata[i].second; 2977ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2978ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel switch (Kind) { 2979ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel default: 2980dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines K->setMetadata(Kind, nullptr); // Remove unknown metadata 2981ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2982ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_tbaa: 2983ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericTBAA(JMD, KMD)); 2984ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2985ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel case LLVMContext::MD_fpmath: 2986ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel K->setMetadata(Kind, MDNode::getMostGenericFPMath(JMD, KMD)); 2987ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel break; 2988ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2989ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2990ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel } 2991ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 2992de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // This function fuses the chosen instruction pairs into vector instructions, 2993de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // taking care preserve any needed scalar outputs and, then, it reorders the 2994de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // remaining instructions as needed (users of the first member of the pair 2995de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // need to be moved to after the location of the second member of the pair 2996de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // because the vector instruction is inserted in the location of the pair's 2997de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // second member). 2998de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel void BBVectorize::fuseChosenPairs(BasicBlock &BB, 299997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel std::vector<Value *> &PairableInsts, 300097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, Value *> &ChosenPairs, 300197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseSet<ValuePair> &FixedOrderPairs, 300297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned> &PairConnectionTypes, 300397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairs, 300497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> > &ConnectedPairDeps) { 3005de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel LLVMContext& Context = BB.getContext(); 3006de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3007de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // During the vectorization process, the order of the pairs to be fused 3008de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // could be flipped. So we'll add each pair, flipped, into the ChosenPairs 3009de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // list. After a pair is fused, the flipped pair is removed from the list. 301072465ea23d010507d3746adc126d719005981e05Hal Finkel DenseSet<ValuePair> FlippedPairs; 3011de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (DenseMap<Value *, Value *>::iterator P = ChosenPairs.begin(), 3012de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = ChosenPairs.end(); P != E; ++P) 301372465ea23d010507d3746adc126d719005981e05Hal Finkel FlippedPairs.insert(ValuePair(P->second, P->first)); 301472465ea23d010507d3746adc126d719005981e05Hal Finkel for (DenseSet<ValuePair>::iterator P = FlippedPairs.begin(), 3015de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel E = FlippedPairs.end(); P != E; ++P) 3016de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.insert(*P); 3017de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 301897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> > LoadMoveSet; 30192f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel DenseSet<ValuePair> LoadMoveSetPairs; 30202f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel collectLoadMoveSet(BB, PairableInsts, ChosenPairs, 30212f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel LoadMoveSet, LoadMoveSetPairs); 3022de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3023de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: initial: \n" << BB << "\n"); 3024de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3025de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (BasicBlock::iterator PI = BB.getFirstInsertionPt(); PI != BB.end();) { 3026de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator P = ChosenPairs.find(PI); 3027de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (P == ChosenPairs.end()) { 3028de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 3029de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 3030de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3031de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3032de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (getDepthFactor(P->first) == 0) { 3033de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // These instructions are not really fused, but are tracked as though 3034de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // they are. Any case in which it would be interesting to fuse them 3035de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // will be taken care of by InstCombine. 3036de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 3037de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 3038de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 3039de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3040de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3041de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *I = cast<Instruction>(P->first), 3042de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel *J = cast<Instruction>(P->second); 3043de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3044de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusing: " << *I << 3045de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << "\n"); 3046de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3047de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Remove the pair and flipped pair from the list. 3048de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DenseMap<Value *, Value *>::iterator FP = ChosenPairs.find(P->second); 3049de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel assert(FP != ChosenPairs.end() && "Flipped pair not found in list"); 3050de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(FP); 3051de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ChosenPairs.erase(P); 3052de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 30532f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel if (!canMoveUsesOfIAfterJ(BB, LoadMoveSetPairs, I, J)) { 3054de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: fusion of: " << *I << 3055de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " <-> " << *J << 3056de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel " aborted because of non-trivial dependency cycle\n"); 3057de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel --NumFusedOps; 3058de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 3059de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel continue; 3060de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3061de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3062a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel // If the pair must have the other order, then flip it. 3063a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel bool FlipPairOrder = FixedOrderPairs.count(ValuePair(J, I)); 306472465ea23d010507d3746adc126d719005981e05Hal Finkel if (!FlipPairOrder && !FixedOrderPairs.count(ValuePair(I, J))) { 306572465ea23d010507d3746adc126d719005981e05Hal Finkel // This pair does not have a fixed order, and so we might want to 306672465ea23d010507d3746adc126d719005981e05Hal Finkel // flip it if that will yield fewer shuffles. We count the number 306772465ea23d010507d3746adc126d719005981e05Hal Finkel // of dependencies connected via swaps, and those directly connected, 306872465ea23d010507d3746adc126d719005981e05Hal Finkel // and flip the order if the number of swaps is greater. 306972465ea23d010507d3746adc126d719005981e05Hal Finkel bool OrigOrder = true; 307097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator IJ = 307197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairDeps.find(ValuePair(I, J)); 307297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (IJ == ConnectedPairDeps.end()) { 307397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel IJ = ConnectedPairDeps.find(ValuePair(J, I)); 307472465ea23d010507d3746adc126d719005981e05Hal Finkel OrigOrder = false; 307572465ea23d010507d3746adc126d719005981e05Hal Finkel } 307672465ea23d010507d3746adc126d719005981e05Hal Finkel 307797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (IJ != ConnectedPairDeps.end()) { 307872465ea23d010507d3746adc126d719005981e05Hal Finkel unsigned NumDepsDirect = 0, NumDepsSwap = 0; 307997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator T = IJ->second.begin(), 308097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel TE = IJ->second.end(); T != TE; ++T) { 308197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel VPPair Q(IJ->first, *T); 308272465ea23d010507d3746adc126d719005981e05Hal Finkel DenseMap<VPPair, unsigned>::iterator R = 308397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel PairConnectionTypes.find(VPPair(Q.second, Q.first)); 308472465ea23d010507d3746adc126d719005981e05Hal Finkel assert(R != PairConnectionTypes.end() && 308572465ea23d010507d3746adc126d719005981e05Hal Finkel "Cannot find pair connection type"); 308672465ea23d010507d3746adc126d719005981e05Hal Finkel if (R->second == PairConnectionDirect) 308772465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsDirect; 308872465ea23d010507d3746adc126d719005981e05Hal Finkel else if (R->second == PairConnectionSwap) 308972465ea23d010507d3746adc126d719005981e05Hal Finkel ++NumDepsSwap; 309072465ea23d010507d3746adc126d719005981e05Hal Finkel } 309172465ea23d010507d3746adc126d719005981e05Hal Finkel 309272465ea23d010507d3746adc126d719005981e05Hal Finkel if (!OrigOrder) 309372465ea23d010507d3746adc126d719005981e05Hal Finkel std::swap(NumDepsDirect, NumDepsSwap); 309472465ea23d010507d3746adc126d719005981e05Hal Finkel 309572465ea23d010507d3746adc126d719005981e05Hal Finkel if (NumDepsSwap > NumDepsDirect) { 309672465ea23d010507d3746adc126d719005981e05Hal Finkel FlipPairOrder = true; 309772465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(dbgs() << "BBV: reordering pair: " << *I << 309872465ea23d010507d3746adc126d719005981e05Hal Finkel " <-> " << *J << "\n"); 309972465ea23d010507d3746adc126d719005981e05Hal Finkel } 310072465ea23d010507d3746adc126d719005981e05Hal Finkel } 310172465ea23d010507d3746adc126d719005981e05Hal Finkel } 3102282969ed3641ffa426e0440d3824dd219152b2d8Hal Finkel 3103202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel Instruction *L = I, *H = J; 3104a9779bfbc9ab0cf3f157453fd0afd110b04a9fdcHal Finkel if (FlipPairOrder) 3105202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel std::swap(H, L); 3106202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel 310772465ea23d010507d3746adc126d719005981e05Hal Finkel // If the pair being fused uses the opposite order from that in the pair 310872465ea23d010507d3746adc126d719005981e05Hal Finkel // connection map, then we need to flip the types. 310997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<ValuePair, std::vector<ValuePair> >::iterator HL = 311097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel ConnectedPairs.find(ValuePair(H, L)); 311197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (HL != ConnectedPairs.end()) 311297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<ValuePair>::iterator T = HL->second.begin(), 311397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel TE = HL->second.end(); T != TE; ++T) { 311497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel VPPair Q(HL->first, *T); 311597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<VPPair, unsigned>::iterator R = PairConnectionTypes.find(Q); 311697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel assert(R != PairConnectionTypes.end() && 311797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel "Cannot find pair connection type"); 311897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (R->second == PairConnectionDirect) 311997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel R->second = PairConnectionSwap; 312097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel else if (R->second == PairConnectionSwap) 312197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel R->second = PairConnectionDirect; 312297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel } 312372465ea23d010507d3746adc126d719005981e05Hal Finkel 312472465ea23d010507d3746adc126d719005981e05Hal Finkel bool LBeforeH = !FlipPairOrder; 3125de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel unsigned NumOperands = I->getNumOperands(); 3126de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SmallVector<Value *, 3> ReplacedOperands(NumOperands); 312772465ea23d010507d3746adc126d719005981e05Hal Finkel getReplacementInputsForPair(Context, L, H, ReplacedOperands, 312872465ea23d010507d3746adc126d719005981e05Hal Finkel LBeforeH); 3129de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3130de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Make a copy of the original operation, change its type to the vector 3131de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // type and replace its operands with the vector operands. 313272465ea23d010507d3746adc126d719005981e05Hal Finkel Instruction *K = L->clone(); 313372465ea23d010507d3746adc126d719005981e05Hal Finkel if (L->hasName()) 313472465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(L); 313572465ea23d010507d3746adc126d719005981e05Hal Finkel else if (H->hasName()) 313672465ea23d010507d3746adc126d719005981e05Hal Finkel K->takeName(H); 3137de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3138de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(K)) 3139202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel K->mutateType(getVecTypeForPair(L->getType(), H->getType())); 3140de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 314172465ea23d010507d3746adc126d719005981e05Hal Finkel combineMetadata(K, H); 3142430b9079c614cd3f45015a6516590d33742cc802Hal Finkel K->intersectOptionalDataWith(H); 3143ab4684e26fe21857d8c8bc6ba7a5234c35117c83Hal Finkel 3144de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (unsigned o = 0; o < NumOperands; ++o) 3145de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->setOperand(o, ReplacedOperands[o]); 3146de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3147de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel K->insertAfter(J); 3148de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3149de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instruction insertion point: 3150de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel Instruction *InsertionPt = K; 3151dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines Instruction *K1 = nullptr, *K2 = nullptr; 3152202d1cb8a587a9513d8bb65bf4a3d88a55132860Hal Finkel replaceOutputsOfPair(Context, L, H, K, InsertionPt, K1, K2); 3153de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3154f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // The use dag of the first original instruction must be moved to after 3155f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // the location of the second instruction. The entire use dag of the 3156f64a7a83bea5f1d2ab1e71231616c6cb0487d56eHal Finkel // first instruction is disjoint from the input dag of the second 3157de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // (by definition), and so commutes with it. 3158de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 31592f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel moveUsesOfIAfterJ(BB, LoadMoveSetPairs, InsertionPt, I, J); 3160de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3161de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (!isa<StoreInst>(I)) { 316272465ea23d010507d3746adc126d719005981e05Hal Finkel L->replaceAllUsesWith(K1); 316372465ea23d010507d3746adc126d719005981e05Hal Finkel H->replaceAllUsesWith(K2); 316472465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(L, K1); 316572465ea23d010507d3746adc126d719005981e05Hal Finkel AA->replaceWithNewValue(H, K2); 3166de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3167de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3168de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Instructions that may read from memory may be in the load move set. 3169de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Once an instruction is fused, we no longer need its move set, and so 3170de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // the values of the map never need to be updated. However, when a load 3171de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // is fused, we need to merge the entries from both instructions in the 3172de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // pair in case those instructions were in the move set of some other 3173de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // yet-to-be-fused pair. The loads in question are the keys of the map. 3174de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (I->mayReadFromMemory()) { 3175de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel std::vector<ValuePair> NewSetMembers; 317697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> >::iterator II = 317797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel LoadMoveSet.find(I); 317897a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (II != LoadMoveSet.end()) 317997a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<Value *>::iterator N = II->second.begin(), 318097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel NE = II->second.end(); N != NE; ++N) 318197a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel NewSetMembers.push_back(ValuePair(K, *N)); 318297a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel DenseMap<Value *, std::vector<Value *> >::iterator JJ = 318397a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel LoadMoveSet.find(J); 318497a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel if (JJ != LoadMoveSet.end()) 318597a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel for (std::vector<Value *>::iterator N = JJ->second.begin(), 318697a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel NE = JJ->second.end(); N != NE; ++N) 318797a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel NewSetMembers.push_back(ValuePair(K, *N)); 3188de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel for (std::vector<ValuePair>::iterator A = NewSetMembers.begin(), 31892f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel AE = NewSetMembers.end(); A != AE; ++A) { 319097a241b173a1413df5a93fdd891ddfac36dabad9Hal Finkel LoadMoveSet[A->first].push_back(A->second); 31912f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel LoadMoveSetPairs.insert(*A); 31922f0e63cc16feb39480805bd00f53bbe5e3031d29Hal Finkel } 3193de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3194de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3195de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel // Before removing I, set the iterator to the next instruction. 319636b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen Hines PI = std::next(BasicBlock::iterator(I)); 3197de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel if (cast<Instruction>(PI) == J) 3198de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel ++PI; 3199de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3200de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(I); 3201de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel SE->forgetValue(J); 3202de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel I->eraseFromParent(); 3203de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel J->eraseFromParent(); 320472465ea23d010507d3746adc126d719005981e05Hal Finkel 320572465ea23d010507d3746adc126d719005981e05Hal Finkel DEBUG(if (PrintAfterEveryPair) dbgs() << "BBV: block is now: \n" << 320672465ea23d010507d3746adc126d719005981e05Hal Finkel BB << "\n"); 3207de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3208de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3209de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel DEBUG(dbgs() << "BBV: final: \n" << BB << "\n"); 3210de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel } 3211de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 3212de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3213de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelchar BBVectorize::ID = 0; 3214de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkelstatic const char bb_vectorize_name[] = "Basic-Block Vectorization"; 3215de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_BEGIN(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 3216de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_AG_DEPENDENCY(AliasAnalysis) 32178bd6c52396ab6e7955fdcc1bce099b7cba29a308Chandler CarruthINITIALIZE_AG_DEPENDENCY(TargetTransformInfo) 321836b56886974eae4f9c5ebc96befd3e7bfe5de338Stephen HinesINITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass) 3219de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_DEPENDENCY(ScalarEvolution) 3220de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal FinkelINITIALIZE_PASS_END(BBVectorize, BBV_NAME, bb_vectorize_name, false, false) 3221de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3222bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengBasicBlockPass *llvm::createBBVectorizePass(const VectorizeConfig &C) { 3223bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng return new BBVectorize(C); 3224de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel} 3225de5e5ec3045a73a06b1054417f9ac6c02929e9ceHal Finkel 3226bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengbool 3227bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zhengllvm::vectorizeBasicBlock(Pass *P, BasicBlock &BB, const VectorizeConfig &C) { 3228bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng BBVectorize BBVectorizer(P, C); 322987825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng return BBVectorizer.vectorizeBB(BB); 323087825e7970a361ce5a8bab19bc880ff7f6242ca2Hongbin Zheng} 3231bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng 3232bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng//===----------------------------------------------------------------------===// 3233bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin ZhengVectorizeConfig::VectorizeConfig() { 3234bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng VectorBits = ::VectorBits; 3235768edf3cd037aab10391abc279f71470df8e3156Hal Finkel VectorizeBools = !::NoBools; 323686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeInts = !::NoInts; 323786312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFloats = !::NoFloats; 3238f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizePointers = !::NoPointers; 323986312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeCasts = !::NoCasts; 324086312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMath = !::NoMath; 3241dce4a407a24b04eebc6a376f8e62b41aaa7b071fStephen Hines VectorizeBitManipulations = !::NoBitManipulation; 324286312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeFMA = !::NoFMA; 3243fc3665c87519850f629c9565535e3be447e10addHal Finkel VectorizeSelect = !::NoSelect; 3244e415f96b6a43ac8861148a11a4258bc38c247e8fHal Finkel VectorizeCmp = !::NoCmp; 3245f3f5a1e6f77a842ccb24cc81766437da5197d712Hal Finkel VectorizeGEP = !::NoGEP; 324686312cc15f29ce2bbd9647b94862e068045280c3Hongbin Zheng VectorizeMemOps = !::NoMemOps; 3247bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng AlignedOnly = ::AlignedOnly; 3248bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng ReqChainDepth= ::ReqChainDepth; 3249bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SearchLimit = ::SearchLimit; 3250bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxCandPairsForCycleCheck = ::MaxCandPairsForCycleCheck; 3251bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng SplatBreaksChain = ::SplatBreaksChain; 3252bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxInsts = ::MaxInsts; 3253ab90084bca42b74a5b5edad9b416bd81e105dad0Hal Finkel MaxPairs = ::MaxPairs; 3254bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng MaxIter = ::MaxIter; 325564e1b28643d87e70734deb5f3d2d298e859c2fd2Hal Finkel Pow2LenOnly = ::Pow2LenOnly; 3256bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng NoMemOpBoost = ::NoMemOpBoost; 3257bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng FastDep = ::FastDep; 3258bef377b7d7ce31edb40c87f8786d1b7bb6cdd6b1Hongbin Zheng} 3259