0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===- NVPTXLowerAggrCopies.cpp - ------------------------------*- C++ -*--===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
2 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
3 // The LLVM Compiler Infrastructure
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
4 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
5 // This file is distributed under the University of Illinois Open Source
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
6 // License. See LICENSE.TXT for details.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
7 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
8 //===----------------------------------------------------------------------===//
|
95
|
9 //
|
|
10 // \file
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 // Lower aggregate copies, memset, memcpy, memmov intrinsics into loops when
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 // the size is large or is not a compile-time constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 #include "NVPTXLowerAggrCopies.h"
|
121
|
17 #include "llvm/Analysis/TargetTransformInfo.h"
|
95
|
18 #include "llvm/CodeGen/StackProtector.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 #include "llvm/IR/Constants.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20 #include "llvm/IR/DataLayout.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
21 #include "llvm/IR/Function.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
22 #include "llvm/IR/IRBuilder.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 #include "llvm/IR/Instructions.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 #include "llvm/IR/IntrinsicInst.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 #include "llvm/IR/Intrinsics.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26 #include "llvm/IR/LLVMContext.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 #include "llvm/IR/Module.h"
|
95
|
28 #include "llvm/Support/Debug.h"
|
|
29 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
|
121
|
30 #include "llvm/Transforms/Utils/LowerMemIntrinsics.h"
|
95
|
31
|
|
32 #define DEBUG_TYPE "nvptx"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
33
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
34 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
35
|
95
|
36 namespace {
|
|
37
|
|
38 // actual analysis class, which is a functionpass
|
|
39 struct NVPTXLowerAggrCopies : public FunctionPass {
|
|
40 static char ID;
|
|
41
|
|
42 NVPTXLowerAggrCopies() : FunctionPass(ID) {}
|
|
43
|
|
44 void getAnalysisUsage(AnalysisUsage &AU) const override {
|
|
45 AU.addPreserved<StackProtector>();
|
121
|
46 AU.addRequired<TargetTransformInfoWrapperPass>();
|
95
|
47 }
|
|
48
|
|
49 bool runOnFunction(Function &F) override;
|
|
50
|
|
51 static const unsigned MaxAggrCopySize = 128;
|
|
52
|
120
|
53 StringRef getPassName() const override {
|
95
|
54 return "Lower aggregate copies/intrinsics into loops";
|
|
55 }
|
|
56 };
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
57
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
58 char NVPTXLowerAggrCopies::ID = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
59
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
60 bool NVPTXLowerAggrCopies::runOnFunction(Function &F) {
|
95
|
61 SmallVector<LoadInst *, 4> AggrLoads;
|
|
62 SmallVector<MemIntrinsic *, 4> MemCalls;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
63
|
95
|
64 const DataLayout &DL = F.getParent()->getDataLayout();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
65 LLVMContext &Context = F.getParent()->getContext();
|
121
|
66 const TargetTransformInfo &TTI =
|
|
67 getAnalysis<TargetTransformInfoWrapperPass>().getTTI(F);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
68
|
95
|
69 // Collect all aggregate loads and mem* calls.
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
70 for (Function::iterator BI = F.begin(), BE = F.end(); BI != BE; ++BI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
71 for (BasicBlock::iterator II = BI->begin(), IE = BI->end(); II != IE;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
72 ++II) {
|
95
|
73 if (LoadInst *LI = dyn_cast<LoadInst>(II)) {
|
|
74 if (!LI->hasOneUse())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
75 continue;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
76
|
95
|
77 if (DL.getTypeStoreSize(LI->getType()) < MaxAggrCopySize)
|
|
78 continue;
|
|
79
|
|
80 if (StoreInst *SI = dyn_cast<StoreInst>(LI->user_back())) {
|
|
81 if (SI->getOperand(0) != LI)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
82 continue;
|
95
|
83 AggrLoads.push_back(LI);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
84 }
|
95
|
85 } else if (MemIntrinsic *IntrCall = dyn_cast<MemIntrinsic>(II)) {
|
|
86 // Convert intrinsic calls with variable size or with constant size
|
|
87 // larger than the MaxAggrCopySize threshold.
|
|
88 if (ConstantInt *LenCI = dyn_cast<ConstantInt>(IntrCall->getLength())) {
|
|
89 if (LenCI->getZExtValue() >= MaxAggrCopySize) {
|
|
90 MemCalls.push_back(IntrCall);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
91 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
92 } else {
|
95
|
93 MemCalls.push_back(IntrCall);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
94 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
95 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
96 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
97 }
|
95
|
98
|
|
99 if (AggrLoads.size() == 0 && MemCalls.size() == 0) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
100 return false;
|
95
|
101 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
102
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
103 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
104 // Do the transformation of an aggr load/copy/set to a loop
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
105 //
|
95
|
106 for (LoadInst *LI : AggrLoads) {
|
|
107 StoreInst *SI = dyn_cast<StoreInst>(*LI->user_begin());
|
|
108 Value *SrcAddr = LI->getOperand(0);
|
|
109 Value *DstAddr = SI->getOperand(1);
|
|
110 unsigned NumLoads = DL.getTypeStoreSize(LI->getType());
|
121
|
111 ConstantInt *CopyLen =
|
|
112 ConstantInt::get(Type::getInt32Ty(Context), NumLoads);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
113
|
121
|
114 if (!TTI.useWideIRMemcpyLoopLowering()) {
|
|
115 createMemCpyLoop(/* ConvertedInst */ SI,
|
|
116 /* SrcAddr */ SrcAddr, /* DstAddr */ DstAddr,
|
|
117 /* CopyLen */ CopyLen,
|
|
118 /* SrcAlign */ LI->getAlignment(),
|
|
119 /* DestAlign */ SI->getAlignment(),
|
|
120 /* SrcIsVolatile */ LI->isVolatile(),
|
|
121 /* DstIsVolatile */ SI->isVolatile());
|
|
122 } else {
|
|
123 createMemCpyLoopKnownSize(/* ConvertedInst */ SI,
|
|
124 /* SrcAddr */ SrcAddr, /* DstAddr */ DstAddr,
|
|
125 /* CopyLen */ CopyLen,
|
|
126 /* SrcAlign */ LI->getAlignment(),
|
|
127 /* DestAlign */ SI->getAlignment(),
|
|
128 /* SrcIsVolatile */ LI->isVolatile(),
|
|
129 /* DstIsVolatile */ SI->isVolatile(), TTI);
|
|
130 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
131
|
95
|
132 SI->eraseFromParent();
|
|
133 LI->eraseFromParent();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
134 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
135
|
95
|
136 // Transform mem* intrinsic calls.
|
|
137 for (MemIntrinsic *MemCall : MemCalls) {
|
|
138 if (MemCpyInst *Memcpy = dyn_cast<MemCpyInst>(MemCall)) {
|
121
|
139 expandMemCpyAsLoop(Memcpy, TTI);
|
95
|
140 } else if (MemMoveInst *Memmove = dyn_cast<MemMoveInst>(MemCall)) {
|
121
|
141 expandMemMoveAsLoop(Memmove);
|
95
|
142 } else if (MemSetInst *Memset = dyn_cast<MemSetInst>(MemCall)) {
|
121
|
143 expandMemSetAsLoop(Memset);
|
95
|
144 }
|
|
145 MemCall->eraseFromParent();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
146 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
147
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
148 return true;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
149 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
150
|
95
|
151 } // namespace
|
|
152
|
|
153 namespace llvm {
|
|
154 void initializeNVPTXLowerAggrCopiesPass(PassRegistry &);
|
|
155 }
|
|
156
|
|
157 INITIALIZE_PASS(NVPTXLowerAggrCopies, "nvptx-lower-aggr-copies",
|
|
158 "Lower aggregate copies, and llvm.mem* intrinsics into loops",
|
|
159 false, false)
|
|
160
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
161 FunctionPass *llvm::createLowerAggrCopies() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
162 return new NVPTXLowerAggrCopies();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
163 }
|