0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
1 //===-- ValueEnumerator.cpp - Number values and types for bitcode writer --===//
|
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 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
9 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
10 // This file implements the ValueEnumerator class.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
11 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
12 //===----------------------------------------------------------------------===//
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
13
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
14 #include "ValueEnumerator.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
15 #include "llvm/ADT/STLExtras.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
16 #include "llvm/ADT/SmallPtrSet.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
17 #include "llvm/IR/Constants.h"
|
|
83
|
18 #include "llvm/IR/DebugInfoMetadata.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
19 #include "llvm/IR/DerivedTypes.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
20 #include "llvm/IR/Instructions.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
21 #include "llvm/IR/Module.h"
|
|
77
|
22 #include "llvm/IR/UseListOrder.h"
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
23 #include "llvm/IR/ValueSymbolTable.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
24 #include "llvm/Support/Debug.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
25 #include "llvm/Support/raw_ostream.h"
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
26 #include <algorithm>
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
27 using namespace llvm;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
28
|
|
77
|
29 namespace {
|
|
|
30 struct OrderMap {
|
|
|
31 DenseMap<const Value *, std::pair<unsigned, bool>> IDs;
|
|
|
32 unsigned LastGlobalConstantID;
|
|
|
33 unsigned LastGlobalValueID;
|
|
|
34
|
|
|
35 OrderMap() : LastGlobalConstantID(0), LastGlobalValueID(0) {}
|
|
|
36
|
|
|
37 bool isGlobalConstant(unsigned ID) const {
|
|
|
38 return ID <= LastGlobalConstantID;
|
|
|
39 }
|
|
|
40 bool isGlobalValue(unsigned ID) const {
|
|
|
41 return ID <= LastGlobalValueID && !isGlobalConstant(ID);
|
|
|
42 }
|
|
|
43
|
|
|
44 unsigned size() const { return IDs.size(); }
|
|
|
45 std::pair<unsigned, bool> &operator[](const Value *V) { return IDs[V]; }
|
|
|
46 std::pair<unsigned, bool> lookup(const Value *V) const {
|
|
|
47 return IDs.lookup(V);
|
|
|
48 }
|
|
|
49 void index(const Value *V) {
|
|
|
50 // Explicitly sequence get-size and insert-value operations to avoid UB.
|
|
|
51 unsigned ID = IDs.size() + 1;
|
|
|
52 IDs[V].first = ID;
|
|
|
53 }
|
|
|
54 };
|
|
|
55 }
|
|
|
56
|
|
|
57 static void orderValue(const Value *V, OrderMap &OM) {
|
|
|
58 if (OM.lookup(V).first)
|
|
|
59 return;
|
|
|
60
|
|
|
61 if (const Constant *C = dyn_cast<Constant>(V))
|
|
|
62 if (C->getNumOperands() && !isa<GlobalValue>(C))
|
|
|
63 for (const Value *Op : C->operands())
|
|
|
64 if (!isa<BasicBlock>(Op) && !isa<GlobalValue>(Op))
|
|
|
65 orderValue(Op, OM);
|
|
|
66
|
|
|
67 // Note: we cannot cache this lookup above, since inserting into the map
|
|
|
68 // changes the map's size, and thus affects the other IDs.
|
|
|
69 OM.index(V);
|
|
|
70 }
|
|
|
71
|
|
83
|
72 static OrderMap orderModule(const Module &M) {
|
|
77
|
73 // This needs to match the order used by ValueEnumerator::ValueEnumerator()
|
|
|
74 // and ValueEnumerator::incorporateFunction().
|
|
|
75 OrderMap OM;
|
|
|
76
|
|
|
77 // In the reader, initializers of GlobalValues are set *after* all the
|
|
|
78 // globals have been read. Rather than awkwardly modeling this behaviour
|
|
|
79 // directly in predictValueUseListOrderImpl(), just assign IDs to
|
|
|
80 // initializers of GlobalValues before GlobalValues themselves to model this
|
|
|
81 // implicitly.
|
|
83
|
82 for (const GlobalVariable &G : M.globals())
|
|
77
|
83 if (G.hasInitializer())
|
|
|
84 if (!isa<GlobalValue>(G.getInitializer()))
|
|
|
85 orderValue(G.getInitializer(), OM);
|
|
83
|
86 for (const GlobalAlias &A : M.aliases())
|
|
77
|
87 if (!isa<GlobalValue>(A.getAliasee()))
|
|
|
88 orderValue(A.getAliasee(), OM);
|
|
83
|
89 for (const Function &F : M) {
|
|
77
|
90 if (F.hasPrefixData())
|
|
|
91 if (!isa<GlobalValue>(F.getPrefixData()))
|
|
|
92 orderValue(F.getPrefixData(), OM);
|
|
83
|
93 if (F.hasPrologueData())
|
|
|
94 if (!isa<GlobalValue>(F.getPrologueData()))
|
|
|
95 orderValue(F.getPrologueData(), OM);
|
|
|
96 }
|
|
77
|
97 OM.LastGlobalConstantID = OM.size();
|
|
|
98
|
|
|
99 // Initializers of GlobalValues are processed in
|
|
|
100 // BitcodeReader::ResolveGlobalAndAliasInits(). Match the order there rather
|
|
|
101 // than ValueEnumerator, and match the code in predictValueUseListOrderImpl()
|
|
|
102 // by giving IDs in reverse order.
|
|
|
103 //
|
|
|
104 // Since GlobalValues never reference each other directly (just through
|
|
|
105 // initializers), their relative IDs only matter for determining order of
|
|
|
106 // uses in their initializers.
|
|
83
|
107 for (const Function &F : M)
|
|
77
|
108 orderValue(&F, OM);
|
|
83
|
109 for (const GlobalAlias &A : M.aliases())
|
|
77
|
110 orderValue(&A, OM);
|
|
83
|
111 for (const GlobalVariable &G : M.globals())
|
|
77
|
112 orderValue(&G, OM);
|
|
|
113 OM.LastGlobalValueID = OM.size();
|
|
|
114
|
|
83
|
115 for (const Function &F : M) {
|
|
77
|
116 if (F.isDeclaration())
|
|
|
117 continue;
|
|
|
118 // Here we need to match the union of ValueEnumerator::incorporateFunction()
|
|
|
119 // and WriteFunction(). Basic blocks are implicitly declared before
|
|
|
120 // anything else (by declaring their size).
|
|
|
121 for (const BasicBlock &BB : F)
|
|
|
122 orderValue(&BB, OM);
|
|
|
123 for (const Argument &A : F.args())
|
|
|
124 orderValue(&A, OM);
|
|
|
125 for (const BasicBlock &BB : F)
|
|
|
126 for (const Instruction &I : BB)
|
|
|
127 for (const Value *Op : I.operands())
|
|
|
128 if ((isa<Constant>(*Op) && !isa<GlobalValue>(*Op)) ||
|
|
|
129 isa<InlineAsm>(*Op))
|
|
|
130 orderValue(Op, OM);
|
|
|
131 for (const BasicBlock &BB : F)
|
|
|
132 for (const Instruction &I : BB)
|
|
|
133 orderValue(&I, OM);
|
|
|
134 }
|
|
|
135 return OM;
|
|
|
136 }
|
|
|
137
|
|
|
138 static void predictValueUseListOrderImpl(const Value *V, const Function *F,
|
|
|
139 unsigned ID, const OrderMap &OM,
|
|
|
140 UseListOrderStack &Stack) {
|
|
|
141 // Predict use-list order for this one.
|
|
|
142 typedef std::pair<const Use *, unsigned> Entry;
|
|
|
143 SmallVector<Entry, 64> List;
|
|
|
144 for (const Use &U : V->uses())
|
|
|
145 // Check if this user will be serialized.
|
|
|
146 if (OM.lookup(U.getUser()).first)
|
|
|
147 List.push_back(std::make_pair(&U, List.size()));
|
|
|
148
|
|
|
149 if (List.size() < 2)
|
|
|
150 // We may have lost some users.
|
|
|
151 return;
|
|
|
152
|
|
|
153 bool IsGlobalValue = OM.isGlobalValue(ID);
|
|
|
154 std::sort(List.begin(), List.end(), [&](const Entry &L, const Entry &R) {
|
|
|
155 const Use *LU = L.first;
|
|
|
156 const Use *RU = R.first;
|
|
|
157 if (LU == RU)
|
|
|
158 return false;
|
|
|
159
|
|
|
160 auto LID = OM.lookup(LU->getUser()).first;
|
|
|
161 auto RID = OM.lookup(RU->getUser()).first;
|
|
|
162
|
|
|
163 // Global values are processed in reverse order.
|
|
|
164 //
|
|
|
165 // Moreover, initializers of GlobalValues are set *after* all the globals
|
|
|
166 // have been read (despite having earlier IDs). Rather than awkwardly
|
|
|
167 // modeling this behaviour here, orderModule() has assigned IDs to
|
|
|
168 // initializers of GlobalValues before GlobalValues themselves.
|
|
|
169 if (OM.isGlobalValue(LID) && OM.isGlobalValue(RID))
|
|
|
170 return LID < RID;
|
|
|
171
|
|
|
172 // If ID is 4, then expect: 7 6 5 1 2 3.
|
|
|
173 if (LID < RID) {
|
|
|
174 if (RID <= ID)
|
|
|
175 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
|
|
|
176 return true;
|
|
|
177 return false;
|
|
|
178 }
|
|
|
179 if (RID < LID) {
|
|
|
180 if (LID <= ID)
|
|
|
181 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
|
|
|
182 return false;
|
|
|
183 return true;
|
|
|
184 }
|
|
|
185
|
|
|
186 // LID and RID are equal, so we have different operands of the same user.
|
|
|
187 // Assume operands are added in order for all instructions.
|
|
|
188 if (LID <= ID)
|
|
|
189 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
|
|
|
190 return LU->getOperandNo() < RU->getOperandNo();
|
|
|
191 return LU->getOperandNo() > RU->getOperandNo();
|
|
|
192 });
|
|
|
193
|
|
|
194 if (std::is_sorted(
|
|
|
195 List.begin(), List.end(),
|
|
|
196 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
|
|
|
197 // Order is already correct.
|
|
|
198 return;
|
|
|
199
|
|
|
200 // Store the shuffle.
|
|
|
201 Stack.emplace_back(V, F, List.size());
|
|
|
202 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
|
|
|
203 for (size_t I = 0, E = List.size(); I != E; ++I)
|
|
|
204 Stack.back().Shuffle[I] = List[I].second;
|
|
|
205 }
|
|
|
206
|
|
|
207 static void predictValueUseListOrder(const Value *V, const Function *F,
|
|
|
208 OrderMap &OM, UseListOrderStack &Stack) {
|
|
|
209 auto &IDPair = OM[V];
|
|
|
210 assert(IDPair.first && "Unmapped value");
|
|
|
211 if (IDPair.second)
|
|
|
212 // Already predicted.
|
|
|
213 return;
|
|
|
214
|
|
|
215 // Do the actual prediction.
|
|
|
216 IDPair.second = true;
|
|
|
217 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
|
|
|
218 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
|
|
|
219
|
|
|
220 // Recursive descent into constants.
|
|
|
221 if (const Constant *C = dyn_cast<Constant>(V))
|
|
|
222 if (C->getNumOperands()) // Visit GlobalValues.
|
|
|
223 for (const Value *Op : C->operands())
|
|
|
224 if (isa<Constant>(Op)) // Visit GlobalValues.
|
|
|
225 predictValueUseListOrder(Op, F, OM, Stack);
|
|
|
226 }
|
|
|
227
|
|
83
|
228 static UseListOrderStack predictUseListOrder(const Module &M) {
|
|
77
|
229 OrderMap OM = orderModule(M);
|
|
|
230
|
|
|
231 // Use-list orders need to be serialized after all the users have been added
|
|
|
232 // to a value, or else the shuffles will be incomplete. Store them per
|
|
|
233 // function in a stack.
|
|
|
234 //
|
|
|
235 // Aside from function order, the order of values doesn't matter much here.
|
|
|
236 UseListOrderStack Stack;
|
|
|
237
|
|
|
238 // We want to visit the functions backward now so we can list function-local
|
|
|
239 // constants in the last Function they're used in. Module-level constants
|
|
|
240 // have already been visited above.
|
|
83
|
241 for (auto I = M.rbegin(), E = M.rend(); I != E; ++I) {
|
|
77
|
242 const Function &F = *I;
|
|
|
243 if (F.isDeclaration())
|
|
|
244 continue;
|
|
|
245 for (const BasicBlock &BB : F)
|
|
|
246 predictValueUseListOrder(&BB, &F, OM, Stack);
|
|
|
247 for (const Argument &A : F.args())
|
|
|
248 predictValueUseListOrder(&A, &F, OM, Stack);
|
|
|
249 for (const BasicBlock &BB : F)
|
|
|
250 for (const Instruction &I : BB)
|
|
|
251 for (const Value *Op : I.operands())
|
|
|
252 if (isa<Constant>(*Op) || isa<InlineAsm>(*Op)) // Visit GlobalValues.
|
|
|
253 predictValueUseListOrder(Op, &F, OM, Stack);
|
|
|
254 for (const BasicBlock &BB : F)
|
|
|
255 for (const Instruction &I : BB)
|
|
|
256 predictValueUseListOrder(&I, &F, OM, Stack);
|
|
|
257 }
|
|
|
258
|
|
|
259 // Visit globals last, since the module-level use-list block will be seen
|
|
|
260 // before the function bodies are processed.
|
|
83
|
261 for (const GlobalVariable &G : M.globals())
|
|
77
|
262 predictValueUseListOrder(&G, nullptr, OM, Stack);
|
|
83
|
263 for (const Function &F : M)
|
|
77
|
264 predictValueUseListOrder(&F, nullptr, OM, Stack);
|
|
83
|
265 for (const GlobalAlias &A : M.aliases())
|
|
77
|
266 predictValueUseListOrder(&A, nullptr, OM, Stack);
|
|
83
|
267 for (const GlobalVariable &G : M.globals())
|
|
77
|
268 if (G.hasInitializer())
|
|
|
269 predictValueUseListOrder(G.getInitializer(), nullptr, OM, Stack);
|
|
83
|
270 for (const GlobalAlias &A : M.aliases())
|
|
77
|
271 predictValueUseListOrder(A.getAliasee(), nullptr, OM, Stack);
|
|
83
|
272 for (const Function &F : M) {
|
|
77
|
273 if (F.hasPrefixData())
|
|
|
274 predictValueUseListOrder(F.getPrefixData(), nullptr, OM, Stack);
|
|
83
|
275 if (F.hasPrologueData())
|
|
|
276 predictValueUseListOrder(F.getPrologueData(), nullptr, OM, Stack);
|
|
|
277 }
|
|
77
|
278
|
|
|
279 return Stack;
|
|
|
280 }
|
|
|
281
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
282 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
283 return V.first->getType()->isIntOrIntVectorTy();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
284 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
285
|
|
83
|
286 ValueEnumerator::ValueEnumerator(const Module &M)
|
|
|
287 : HasMDString(false), HasMDLocation(false), HasGenericDebugNode(false) {
|
|
77
|
288 if (shouldPreserveBitcodeUseListOrder())
|
|
|
289 UseListOrders = predictUseListOrder(M);
|
|
|
290
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
291 // Enumerate the global variables.
|
|
83
|
292 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
|
|
|
293 I != E; ++I)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
294 EnumerateValue(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
295
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
296 // Enumerate the functions.
|
|
83
|
297 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
298 EnumerateValue(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
299 EnumerateAttributes(cast<Function>(I)->getAttributes());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
300 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
301
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
302 // Enumerate the aliases.
|
|
83
|
303 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
304 I != E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
305 EnumerateValue(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
306
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
307 // Remember what is the cutoff between globalvalue's and other constants.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
308 unsigned FirstConstant = Values.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
309
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
310 // Enumerate the global variable initializers.
|
|
83
|
311 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
|
|
|
312 I != E; ++I)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
313 if (I->hasInitializer())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
314 EnumerateValue(I->getInitializer());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
315
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
316 // Enumerate the aliasees.
|
|
83
|
317 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
318 I != E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
319 EnumerateValue(I->getAliasee());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
320
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
321 // Enumerate the prefix data constants.
|
|
83
|
322 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
323 if (I->hasPrefixData())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
324 EnumerateValue(I->getPrefixData());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
325
|
|
83
|
326 // Enumerate the prologue data constants.
|
|
|
327 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
|
|
|
328 if (I->hasPrologueData())
|
|
|
329 EnumerateValue(I->getPrologueData());
|
|
|
330
|
|
|
331 // Enumerate the metadata type.
|
|
|
332 //
|
|
|
333 // TODO: Move this to ValueEnumerator::EnumerateOperandType() once bitcode
|
|
|
334 // only encodes the metadata type when it's used as a value.
|
|
|
335 EnumerateType(Type::getMetadataTy(M.getContext()));
|
|
|
336
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
337 // Insert constants and metadata that are named at module level into the slot
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
338 // pool so that the module symbol table can refer to them...
|
|
83
|
339 EnumerateValueSymbolTable(M.getValueSymbolTable());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
340 EnumerateNamedMetadata(M);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
341
|
|
83
|
342 SmallVector<std::pair<unsigned, MDNode *>, 8> MDs;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
343
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
344 // Enumerate types used by function bodies and argument lists.
|
|
83
|
345 for (const Function &F : M) {
|
|
77
|
346 for (const Argument &A : F.args())
|
|
|
347 EnumerateType(A.getType());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
348
|
|
77
|
349 for (const BasicBlock &BB : F)
|
|
|
350 for (const Instruction &I : BB) {
|
|
|
351 for (const Use &Op : I.operands()) {
|
|
83
|
352 auto *MD = dyn_cast<MetadataAsValue>(&Op);
|
|
|
353 if (!MD) {
|
|
|
354 EnumerateOperandType(Op);
|
|
|
355 continue;
|
|
|
356 }
|
|
|
357
|
|
|
358 // Local metadata is enumerated during function-incorporation.
|
|
|
359 if (isa<LocalAsMetadata>(MD->getMetadata()))
|
|
|
360 continue;
|
|
|
361
|
|
|
362 EnumerateMetadata(MD->getMetadata());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
363 }
|
|
77
|
364 EnumerateType(I.getType());
|
|
|
365 if (const CallInst *CI = dyn_cast<CallInst>(&I))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
366 EnumerateAttributes(CI->getAttributes());
|
|
77
|
367 else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
368 EnumerateAttributes(II->getAttributes());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
369
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
370 // Enumerate metadata attached with this instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
371 MDs.clear();
|
|
77
|
372 I.getAllMetadataOtherThanDebugLoc(MDs);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
373 for (unsigned i = 0, e = MDs.size(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
374 EnumerateMetadata(MDs[i].second);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
375
|
|
77
|
376 if (!I.getDebugLoc().isUnknown()) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
377 MDNode *Scope, *IA;
|
|
77
|
378 I.getDebugLoc().getScopeAndInlinedAt(Scope, IA, I.getContext());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
379 if (Scope) EnumerateMetadata(Scope);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
380 if (IA) EnumerateMetadata(IA);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
381 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
382 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
383 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
384
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
385 // Optimize constant ordering.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
386 OptimizeConstants(FirstConstant, Values.size());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
387 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
388
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
389 unsigned ValueEnumerator::getInstructionID(const Instruction *Inst) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
390 InstructionMapType::const_iterator I = InstructionMap.find(Inst);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
391 assert(I != InstructionMap.end() && "Instruction is not mapped!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
392 return I->second;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
393 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
394
|
|
77
|
395 unsigned ValueEnumerator::getComdatID(const Comdat *C) const {
|
|
|
396 unsigned ComdatID = Comdats.idFor(C);
|
|
|
397 assert(ComdatID && "Comdat not found!");
|
|
|
398 return ComdatID;
|
|
|
399 }
|
|
|
400
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
401 void ValueEnumerator::setInstructionID(const Instruction *I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
402 InstructionMap[I] = InstructionCount++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
403 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
404
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
405 unsigned ValueEnumerator::getValueID(const Value *V) const {
|
|
83
|
406 if (auto *MD = dyn_cast<MetadataAsValue>(V))
|
|
|
407 return getMetadataID(MD->getMetadata());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
408
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
409 ValueMapType::const_iterator I = ValueMap.find(V);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
410 assert(I != ValueMap.end() && "Value not in slotcalculator!");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
411 return I->second-1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
412 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
413
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
414 void ValueEnumerator::dump() const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
415 print(dbgs(), ValueMap, "Default");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
416 dbgs() << '\n';
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
417 print(dbgs(), MDValueMap, "MetaData");
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
418 dbgs() << '\n';
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
419 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
420
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
421 void ValueEnumerator::print(raw_ostream &OS, const ValueMapType &Map,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
422 const char *Name) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
423
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
424 OS << "Map Name: " << Name << "\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
425 OS << "Size: " << Map.size() << "\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
426 for (ValueMapType::const_iterator I = Map.begin(),
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
427 E = Map.end(); I != E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
428
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
429 const Value *V = I->first;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
430 if (V->hasName())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
431 OS << "Value: " << V->getName();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
432 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
433 OS << "Value: [null]\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
434 V->dump();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
435
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
436 OS << " Uses(" << std::distance(V->use_begin(),V->use_end()) << "):";
|
|
77
|
437 for (const Use &U : V->uses()) {
|
|
|
438 if (&U != &*V->use_begin())
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
439 OS << ",";
|
|
77
|
440 if(U->hasName())
|
|
|
441 OS << " " << U->getName();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
442 else
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
443 OS << " [null]";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
444
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
445 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
446 OS << "\n\n";
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
447 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
448 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
449
|
|
83
|
450 void ValueEnumerator::print(raw_ostream &OS, const MetadataMapType &Map,
|
|
|
451 const char *Name) const {
|
|
|
452
|
|
|
453 OS << "Map Name: " << Name << "\n";
|
|
|
454 OS << "Size: " << Map.size() << "\n";
|
|
|
455 for (auto I = Map.begin(), E = Map.end(); I != E; ++I) {
|
|
|
456 const Metadata *MD = I->first;
|
|
|
457 OS << "Metadata: slot = " << I->second << "\n";
|
|
|
458 MD->print(OS);
|
|
|
459 }
|
|
|
460 }
|
|
|
461
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
462 /// OptimizeConstants - Reorder constant pool for denser encoding.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
463 void ValueEnumerator::OptimizeConstants(unsigned CstStart, unsigned CstEnd) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
464 if (CstStart == CstEnd || CstStart+1 == CstEnd) return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
465
|
|
77
|
466 if (shouldPreserveBitcodeUseListOrder())
|
|
|
467 // Optimizing constants makes the use-list order difficult to predict.
|
|
|
468 // Disable it for now when trying to preserve the order.
|
|
|
469 return;
|
|
|
470
|
|
|
471 std::stable_sort(Values.begin() + CstStart, Values.begin() + CstEnd,
|
|
|
472 [this](const std::pair<const Value *, unsigned> &LHS,
|
|
|
473 const std::pair<const Value *, unsigned> &RHS) {
|
|
|
474 // Sort by plane.
|
|
|
475 if (LHS.first->getType() != RHS.first->getType())
|
|
|
476 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
|
|
|
477 // Then by frequency.
|
|
|
478 return LHS.second > RHS.second;
|
|
|
479 });
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
480
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
481 // Ensure that integer and vector of integer constants are at the start of the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
482 // constant pool. This is important so that GEP structure indices come before
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
483 // gep constant exprs.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
484 std::partition(Values.begin()+CstStart, Values.begin()+CstEnd,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
485 isIntOrIntVectorValue);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
486
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
487 // Rebuild the modified portion of ValueMap.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
488 for (; CstStart != CstEnd; ++CstStart)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
489 ValueMap[Values[CstStart].first] = CstStart+1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
490 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
491
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
492
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
493 /// EnumerateValueSymbolTable - Insert all of the values in the specified symbol
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
494 /// table into the values table.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
495 void ValueEnumerator::EnumerateValueSymbolTable(const ValueSymbolTable &VST) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
496 for (ValueSymbolTable::const_iterator VI = VST.begin(), VE = VST.end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
497 VI != VE; ++VI)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
498 EnumerateValue(VI->getValue());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
499 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
500
|
|
83
|
501 /// Insert all of the values referenced by named metadata in the specified
|
|
|
502 /// module.
|
|
|
503 void ValueEnumerator::EnumerateNamedMetadata(const Module &M) {
|
|
|
504 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
|
|
|
505 E = M.named_metadata_end();
|
|
|
506 I != E; ++I)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
507 EnumerateNamedMDNode(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
508 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
509
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
510 void ValueEnumerator::EnumerateNamedMDNode(const NamedMDNode *MD) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
511 for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
512 EnumerateMetadata(MD->getOperand(i));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
513 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
514
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
515 /// EnumerateMDNodeOperands - Enumerate all non-function-local values
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
516 /// and types referenced by the given MDNode.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
517 void ValueEnumerator::EnumerateMDNodeOperands(const MDNode *N) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
518 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
|
|
83
|
519 Metadata *MD = N->getOperand(i);
|
|
|
520 if (!MD)
|
|
|
521 continue;
|
|
|
522 assert(!isa<LocalAsMetadata>(MD) && "MDNodes cannot be function-local");
|
|
|
523 EnumerateMetadata(MD);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
524 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
525 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
526
|
|
83
|
527 void ValueEnumerator::EnumerateMetadata(const Metadata *MD) {
|
|
|
528 assert(
|
|
|
529 (isa<MDNode>(MD) || isa<MDString>(MD) || isa<ConstantAsMetadata>(MD)) &&
|
|
|
530 "Invalid metadata kind");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
531
|
|
83
|
532 // Insert a dummy ID to block the co-recursive call to
|
|
|
533 // EnumerateMDNodeOperands() from re-visiting MD in a cyclic graph.
|
|
|
534 //
|
|
|
535 // Return early if there's already an ID.
|
|
|
536 if (!MDValueMap.insert(std::make_pair(MD, 0)).second)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
537 return;
|
|
83
|
538
|
|
|
539 // Visit operands first to minimize RAUW.
|
|
|
540 if (auto *N = dyn_cast<MDNode>(MD))
|
|
|
541 EnumerateMDNodeOperands(N);
|
|
|
542 else if (auto *C = dyn_cast<ConstantAsMetadata>(MD))
|
|
|
543 EnumerateValue(C->getValue());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
544
|
|
83
|
545 HasMDString |= isa<MDString>(MD);
|
|
|
546 HasMDLocation |= isa<MDLocation>(MD);
|
|
|
547 HasGenericDebugNode |= isa<GenericDebugNode>(MD);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
548
|
|
83
|
549 // Replace the dummy ID inserted above with the correct one. MDValueMap may
|
|
|
550 // have changed by inserting operands, so we need a fresh lookup here.
|
|
|
551 MDs.push_back(MD);
|
|
|
552 MDValueMap[MD] = MDs.size();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
553 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
554
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
555 /// EnumerateFunctionLocalMetadataa - Incorporate function-local metadata
|
|
83
|
556 /// information reachable from the metadata.
|
|
|
557 void ValueEnumerator::EnumerateFunctionLocalMetadata(
|
|
|
558 const LocalAsMetadata *Local) {
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
559 // Check to see if it's already in!
|
|
83
|
560 unsigned &MDValueID = MDValueMap[Local];
|
|
|
561 if (MDValueID)
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
562 return;
|
|
83
|
563
|
|
|
564 MDs.push_back(Local);
|
|
|
565 MDValueID = MDs.size();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
566
|
|
83
|
567 EnumerateValue(Local->getValue());
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
568
|
|
83
|
569 // Also, collect all function-local metadata for easy access.
|
|
|
570 FunctionLocalMDs.push_back(Local);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
571 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
572
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
573 void ValueEnumerator::EnumerateValue(const Value *V) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
574 assert(!V->getType()->isVoidTy() && "Can't insert void values!");
|
|
83
|
575 assert(!isa<MetadataAsValue>(V) && "EnumerateValue doesn't handle Metadata!");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
576
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
577 // Check to see if it's already in!
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
578 unsigned &ValueID = ValueMap[V];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
579 if (ValueID) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
580 // Increment use count.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
581 Values[ValueID-1].second++;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
582 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
583 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
584
|
|
77
|
585 if (auto *GO = dyn_cast<GlobalObject>(V))
|
|
|
586 if (const Comdat *C = GO->getComdat())
|
|
|
587 Comdats.insert(C);
|
|
|
588
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
589 // Enumerate the type of this value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
590 EnumerateType(V->getType());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
591
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
592 if (const Constant *C = dyn_cast<Constant>(V)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
593 if (isa<GlobalValue>(C)) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
594 // Initializers for globals are handled explicitly elsewhere.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
595 } else if (C->getNumOperands()) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
596 // If a constant has operands, enumerate them. This makes sure that if a
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
597 // constant has uses (for example an array of const ints), that they are
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
598 // inserted also.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
599
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
600 // We prefer to enumerate them with values before we enumerate the user
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
601 // itself. This makes it more likely that we can avoid forward references
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
602 // in the reader. We know that there can be no cycles in the constants
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
603 // graph that don't go through a global variable.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
604 for (User::const_op_iterator I = C->op_begin(), E = C->op_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
605 I != E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
606 if (!isa<BasicBlock>(*I)) // Don't enumerate BB operand to BlockAddress.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
607 EnumerateValue(*I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
608
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
609 // Finally, add the value. Doing this could make the ValueID reference be
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
610 // dangling, don't reuse it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
611 Values.push_back(std::make_pair(V, 1U));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
612 ValueMap[V] = Values.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
613 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
614 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
615 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
616
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
617 // Add the value.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
618 Values.push_back(std::make_pair(V, 1U));
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
619 ValueID = Values.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
620 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
621
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
622
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
623 void ValueEnumerator::EnumerateType(Type *Ty) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
624 unsigned *TypeID = &TypeMap[Ty];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
625
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
626 // We've already seen this type.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
627 if (*TypeID)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
628 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
629
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
630 // If it is a non-anonymous struct, mark the type as being visited so that we
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
631 // don't recursively visit it. This is safe because we allow forward
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
632 // references of these in the bitcode reader.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
633 if (StructType *STy = dyn_cast<StructType>(Ty))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
634 if (!STy->isLiteral())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
635 *TypeID = ~0U;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
636
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
637 // Enumerate all of the subtypes before we enumerate this type. This ensures
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
638 // that the type will be enumerated in an order that can be directly built.
|
|
83
|
639 for (Type *SubTy : Ty->subtypes())
|
|
|
640 EnumerateType(SubTy);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
641
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
642 // Refresh the TypeID pointer in case the table rehashed.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
643 TypeID = &TypeMap[Ty];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
644
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
645 // Check to see if we got the pointer another way. This can happen when
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
646 // enumerating recursive types that hit the base case deeper than they start.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
647 //
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
648 // If this is actually a struct that we are treating as forward ref'able,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
649 // then emit the definition now that all of its contents are available.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
650 if (*TypeID && *TypeID != ~0U)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
651 return;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
652
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
653 // Add this type now that its contents are all happily enumerated.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
654 Types.push_back(Ty);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
655
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
656 *TypeID = Types.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
657 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
658
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
659 // Enumerate the types for the specified value. If the value is a constant,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
660 // walk through it, enumerating the types of the constant.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
661 void ValueEnumerator::EnumerateOperandType(const Value *V) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
662 EnumerateType(V->getType());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
663
|
|
83
|
664 if (auto *MD = dyn_cast<MetadataAsValue>(V)) {
|
|
|
665 assert(!isa<LocalAsMetadata>(MD->getMetadata()) &&
|
|
|
666 "Function-local metadata should be left for later");
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
667
|
|
83
|
668 EnumerateMetadata(MD->getMetadata());
|
|
|
669 return;
|
|
|
670 }
|
|
|
671
|
|
|
672 const Constant *C = dyn_cast<Constant>(V);
|
|
|
673 if (!C)
|
|
|
674 return;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
675
|
|
83
|
676 // If this constant is already enumerated, ignore it, we know its type must
|
|
|
677 // be enumerated.
|
|
|
678 if (ValueMap.count(C))
|
|
|
679 return;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
680
|
|
83
|
681 // This constant may have operands, make sure to enumerate the types in
|
|
|
682 // them.
|
|
|
683 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
|
|
|
684 const Value *Op = C->getOperand(i);
|
|
|
685
|
|
|
686 // Don't enumerate basic blocks here, this happens as operands to
|
|
|
687 // blockaddress.
|
|
|
688 if (isa<BasicBlock>(Op))
|
|
|
689 continue;
|
|
|
690
|
|
|
691 EnumerateOperandType(Op);
|
|
|
692 }
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
693 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
694
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
695 void ValueEnumerator::EnumerateAttributes(AttributeSet PAL) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
696 if (PAL.isEmpty()) return; // null is always 0.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
697
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
698 // Do a lookup.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
699 unsigned &Entry = AttributeMap[PAL];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
700 if (Entry == 0) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
701 // Never saw this before, add it.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
702 Attribute.push_back(PAL);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
703 Entry = Attribute.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
704 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
705
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
706 // Do lookups for all attribute groups.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
707 for (unsigned i = 0, e = PAL.getNumSlots(); i != e; ++i) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
708 AttributeSet AS = PAL.getSlotAttributes(i);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
709 unsigned &Entry = AttributeGroupMap[AS];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
710 if (Entry == 0) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
711 AttributeGroups.push_back(AS);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
712 Entry = AttributeGroups.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
713 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
714 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
715 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
716
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
717 void ValueEnumerator::incorporateFunction(const Function &F) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
718 InstructionCount = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
719 NumModuleValues = Values.size();
|
|
83
|
720 NumModuleMDs = MDs.size();
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
721
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
722 // Adding function arguments to the value table.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
723 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
724 I != E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
725 EnumerateValue(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
726
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
727 FirstFuncConstantID = Values.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
728
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
729 // Add all function-level constants to the value table.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
730 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
731 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
732 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
733 OI != E; ++OI) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
734 if ((isa<Constant>(*OI) && !isa<GlobalValue>(*OI)) ||
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
735 isa<InlineAsm>(*OI))
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
736 EnumerateValue(*OI);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
737 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
738 BasicBlocks.push_back(BB);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
739 ValueMap[BB] = BasicBlocks.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
740 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
741
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
742 // Optimize the constant layout.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
743 OptimizeConstants(FirstFuncConstantID, Values.size());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
744
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
745 // Add the function's parameter attributes so they are available for use in
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
746 // the function's instruction.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
747 EnumerateAttributes(F.getAttributes());
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
748
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
749 FirstInstID = Values.size();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
750
|
|
83
|
751 SmallVector<LocalAsMetadata *, 8> FnLocalMDVector;
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
752 // Add all of the instructions.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
753 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
754 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
755 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
756 OI != E; ++OI) {
|
|
83
|
757 if (auto *MD = dyn_cast<MetadataAsValue>(&*OI))
|
|
|
758 if (auto *Local = dyn_cast<LocalAsMetadata>(MD->getMetadata()))
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
759 // Enumerate metadata after the instructions they might refer to.
|
|
83
|
760 FnLocalMDVector.push_back(Local);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
761 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
762
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
763 if (!I->getType()->isVoidTy())
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
764 EnumerateValue(I);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
765 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
766 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
767
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
768 // Add all of the function-local metadata.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
769 for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
770 EnumerateFunctionLocalMetadata(FnLocalMDVector[i]);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
771 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
772
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
773 void ValueEnumerator::purgeFunction() {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
774 /// Remove purged values from the ValueMap.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
775 for (unsigned i = NumModuleValues, e = Values.size(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
776 ValueMap.erase(Values[i].first);
|
|
83
|
777 for (unsigned i = NumModuleMDs, e = MDs.size(); i != e; ++i)
|
|
|
778 MDValueMap.erase(MDs[i]);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
779 for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
780 ValueMap.erase(BasicBlocks[i]);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
781
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
782 Values.resize(NumModuleValues);
|
|
83
|
783 MDs.resize(NumModuleMDs);
|
0
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
784 BasicBlocks.clear();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
785 FunctionLocalMDs.clear();
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
786 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
787
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
788 static void IncorporateFunctionInfoGlobalBBIDs(const Function *F,
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
789 DenseMap<const BasicBlock*, unsigned> &IDMap) {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
790 unsigned Counter = 0;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
791 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
792 IDMap[BB] = ++Counter;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
793 }
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
794
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
795 /// getGlobalBasicBlockID - This returns the function-specific ID for the
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
796 /// specified basic block. This is relatively expensive information, so it
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
797 /// should only be used by rare constructs such as address-of-label.
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
798 unsigned ValueEnumerator::getGlobalBasicBlockID(const BasicBlock *BB) const {
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
799 unsigned &Idx = GlobalBasicBlockIDs[BB];
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
800 if (Idx != 0)
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
801 return Idx-1;
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
802
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
803 IncorporateFunctionInfoGlobalBBIDs(BB->getParent(), GlobalBasicBlockIDs);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
804 return getGlobalBasicBlockID(BB);
|
Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
parents:
diff
changeset
|
805 }
|
