1 //===-- ValueEnumerator.cpp - Number values and types for bitcode writer --===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the ValueEnumerator class.
12 //===----------------------------------------------------------------------===//
14 #include "ValueEnumerator.h"
15 #include "llvm/ADT/STLExtras.h"
16 #include "llvm/ADT/SmallPtrSet.h"
17 #include "llvm/IR/Constants.h"
18 #include "llvm/IR/DebugInfoMetadata.h"
19 #include "llvm/IR/DerivedTypes.h"
20 #include "llvm/IR/Instructions.h"
21 #include "llvm/IR/Module.h"
22 #include "llvm/IR/UseListOrder.h"
23 #include "llvm/IR/ValueSymbolTable.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/raw_ostream.h"
31 DenseMap<const Value *, std::pair<unsigned, bool>> IDs;
32 unsigned LastGlobalConstantID;
33 unsigned LastGlobalValueID;
35 OrderMap() : LastGlobalConstantID(0), LastGlobalValueID(0) {}
37 bool isGlobalConstant(unsigned ID) const {
38 return ID <= LastGlobalConstantID;
40 bool isGlobalValue(unsigned ID) const {
41 return ID <= LastGlobalValueID && !isGlobalConstant(ID);
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 {
49 void index(const Value *V) {
50 // Explicitly sequence get-size and insert-value operations to avoid UB.
51 unsigned ID = IDs.size() + 1;
57 static void orderValue(const Value *V, OrderMap &OM) {
58 if (OM.lookup(V).first)
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))
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.
72 static OrderMap orderModule(const Module &M) {
73 // This needs to match the order used by ValueEnumerator::ValueEnumerator()
74 // and ValueEnumerator::incorporateFunction().
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
82 for (const GlobalVariable &G : M.globals())
83 if (G.hasInitializer())
84 if (!isa<GlobalValue>(G.getInitializer()))
85 orderValue(G.getInitializer(), OM);
86 for (const GlobalAlias &A : M.aliases())
87 if (!isa<GlobalValue>(A.getAliasee()))
88 orderValue(A.getAliasee(), OM);
89 for (const GlobalIFunc &I : M.ifuncs())
90 if (!isa<GlobalValue>(I.getResolver()))
91 orderValue(I.getResolver(), OM);
92 for (const Function &F : M) {
93 for (const Use &U : F.operands())
94 if (!isa<GlobalValue>(U.get()))
95 orderValue(U.get(), OM);
97 OM.LastGlobalConstantID = OM.size();
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.
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.
107 for (const Function &F : M)
109 for (const GlobalAlias &A : M.aliases())
111 for (const GlobalIFunc &I : M.ifuncs())
113 for (const GlobalVariable &G : M.globals())
115 OM.LastGlobalValueID = OM.size();
117 for (const Function &F : M) {
118 if (F.isDeclaration())
120 // Here we need to match the union of ValueEnumerator::incorporateFunction()
121 // and WriteFunction(). Basic blocks are implicitly declared before
122 // anything else (by declaring their size).
123 for (const BasicBlock &BB : F)
125 for (const Argument &A : F.args())
127 for (const BasicBlock &BB : F)
128 for (const Instruction &I : BB)
129 for (const Value *Op : I.operands())
130 if ((isa<Constant>(*Op) && !isa<GlobalValue>(*Op)) ||
133 for (const BasicBlock &BB : F)
134 for (const Instruction &I : BB)
140 static void predictValueUseListOrderImpl(const Value *V, const Function *F,
141 unsigned ID, const OrderMap &OM,
142 UseListOrderStack &Stack) {
143 // Predict use-list order for this one.
144 typedef std::pair<const Use *, unsigned> Entry;
145 SmallVector<Entry, 64> List;
146 for (const Use &U : V->uses())
147 // Check if this user will be serialized.
148 if (OM.lookup(U.getUser()).first)
149 List.push_back(std::make_pair(&U, List.size()));
152 // We may have lost some users.
155 bool IsGlobalValue = OM.isGlobalValue(ID);
156 std::sort(List.begin(), List.end(), [&](const Entry &L, const Entry &R) {
157 const Use *LU = L.first;
158 const Use *RU = R.first;
162 auto LID = OM.lookup(LU->getUser()).first;
163 auto RID = OM.lookup(RU->getUser()).first;
165 // Global values are processed in reverse order.
167 // Moreover, initializers of GlobalValues are set *after* all the globals
168 // have been read (despite having earlier IDs). Rather than awkwardly
169 // modeling this behaviour here, orderModule() has assigned IDs to
170 // initializers of GlobalValues before GlobalValues themselves.
171 if (OM.isGlobalValue(LID) && OM.isGlobalValue(RID))
174 // If ID is 4, then expect: 7 6 5 1 2 3.
177 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
183 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
188 // LID and RID are equal, so we have different operands of the same user.
189 // Assume operands are added in order for all instructions.
191 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
192 return LU->getOperandNo() < RU->getOperandNo();
193 return LU->getOperandNo() > RU->getOperandNo();
197 List.begin(), List.end(),
198 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
199 // Order is already correct.
202 // Store the shuffle.
203 Stack.emplace_back(V, F, List.size());
204 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
205 for (size_t I = 0, E = List.size(); I != E; ++I)
206 Stack.back().Shuffle[I] = List[I].second;
209 static void predictValueUseListOrder(const Value *V, const Function *F,
210 OrderMap &OM, UseListOrderStack &Stack) {
211 auto &IDPair = OM[V];
212 assert(IDPair.first && "Unmapped value");
214 // Already predicted.
217 // Do the actual prediction.
218 IDPair.second = true;
219 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
220 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
222 // Recursive descent into constants.
223 if (const Constant *C = dyn_cast<Constant>(V))
224 if (C->getNumOperands()) // Visit GlobalValues.
225 for (const Value *Op : C->operands())
226 if (isa<Constant>(Op)) // Visit GlobalValues.
227 predictValueUseListOrder(Op, F, OM, Stack);
230 static UseListOrderStack predictUseListOrder(const Module &M) {
231 OrderMap OM = orderModule(M);
233 // Use-list orders need to be serialized after all the users have been added
234 // to a value, or else the shuffles will be incomplete. Store them per
235 // function in a stack.
237 // Aside from function order, the order of values doesn't matter much here.
238 UseListOrderStack Stack;
240 // We want to visit the functions backward now so we can list function-local
241 // constants in the last Function they're used in. Module-level constants
242 // have already been visited above.
243 for (auto I = M.rbegin(), E = M.rend(); I != E; ++I) {
244 const Function &F = *I;
245 if (F.isDeclaration())
247 for (const BasicBlock &BB : F)
248 predictValueUseListOrder(&BB, &F, OM, Stack);
249 for (const Argument &A : F.args())
250 predictValueUseListOrder(&A, &F, OM, Stack);
251 for (const BasicBlock &BB : F)
252 for (const Instruction &I : BB)
253 for (const Value *Op : I.operands())
254 if (isa<Constant>(*Op) || isa<InlineAsm>(*Op)) // Visit GlobalValues.
255 predictValueUseListOrder(Op, &F, OM, Stack);
256 for (const BasicBlock &BB : F)
257 for (const Instruction &I : BB)
258 predictValueUseListOrder(&I, &F, OM, Stack);
261 // Visit globals last, since the module-level use-list block will be seen
262 // before the function bodies are processed.
263 for (const GlobalVariable &G : M.globals())
264 predictValueUseListOrder(&G, nullptr, OM, Stack);
265 for (const Function &F : M)
266 predictValueUseListOrder(&F, nullptr, OM, Stack);
267 for (const GlobalAlias &A : M.aliases())
268 predictValueUseListOrder(&A, nullptr, OM, Stack);
269 for (const GlobalIFunc &I : M.ifuncs())
270 predictValueUseListOrder(&I, nullptr, OM, Stack);
271 for (const GlobalVariable &G : M.globals())
272 if (G.hasInitializer())
273 predictValueUseListOrder(G.getInitializer(), nullptr, OM, Stack);
274 for (const GlobalAlias &A : M.aliases())
275 predictValueUseListOrder(A.getAliasee(), nullptr, OM, Stack);
276 for (const GlobalIFunc &I : M.ifuncs())
277 predictValueUseListOrder(I.getResolver(), nullptr, OM, Stack);
278 for (const Function &F : M) {
279 for (const Use &U : F.operands())
280 predictValueUseListOrder(U.get(), nullptr, OM, Stack);
286 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) {
287 return V.first->getType()->isIntOrIntVectorTy();
290 ValueEnumerator::ValueEnumerator(const Module &M,
291 bool ShouldPreserveUseListOrder)
292 : ShouldPreserveUseListOrder(ShouldPreserveUseListOrder) {
293 if (ShouldPreserveUseListOrder)
294 UseListOrders = predictUseListOrder(M);
296 // Enumerate the global variables.
297 for (const GlobalVariable &GV : M.globals())
300 // Enumerate the functions.
301 for (const Function & F : M) {
303 EnumerateAttributes(F.getAttributes());
306 // Enumerate the aliases.
307 for (const GlobalAlias &GA : M.aliases())
310 // Enumerate the ifuncs.
311 for (const GlobalIFunc &GIF : M.ifuncs())
312 EnumerateValue(&GIF);
314 // Remember what is the cutoff between globalvalue's and other constants.
315 unsigned FirstConstant = Values.size();
317 // Enumerate the global variable initializers.
318 for (const GlobalVariable &GV : M.globals())
319 if (GV.hasInitializer())
320 EnumerateValue(GV.getInitializer());
322 // Enumerate the aliasees.
323 for (const GlobalAlias &GA : M.aliases())
324 EnumerateValue(GA.getAliasee());
326 // Enumerate the ifunc resolvers.
327 for (const GlobalIFunc &GIF : M.ifuncs())
328 EnumerateValue(GIF.getResolver());
330 // Enumerate any optional Function data.
331 for (const Function &F : M)
332 for (const Use &U : F.operands())
333 EnumerateValue(U.get());
335 // Enumerate the metadata type.
337 // TODO: Move this to ValueEnumerator::EnumerateOperandType() once bitcode
338 // only encodes the metadata type when it's used as a value.
339 EnumerateType(Type::getMetadataTy(M.getContext()));
341 // Insert constants and metadata that are named at module level into the slot
342 // pool so that the module symbol table can refer to them...
343 EnumerateValueSymbolTable(M.getValueSymbolTable());
344 EnumerateNamedMetadata(M);
346 SmallVector<std::pair<unsigned, MDNode *>, 8> MDs;
347 for (const GlobalVariable &GV : M.globals()) {
349 GV.getAllMetadata(MDs);
350 for (const auto &I : MDs)
351 // FIXME: Pass GV to EnumerateMetadata and arrange for the bitcode writer
352 // to write metadata to the global variable's own metadata block
354 EnumerateMetadata(nullptr, I.second);
357 // Enumerate types used by function bodies and argument lists.
358 for (const Function &F : M) {
359 for (const Argument &A : F.args())
360 EnumerateType(A.getType());
362 // Enumerate metadata attached to this function.
364 F.getAllMetadata(MDs);
365 for (const auto &I : MDs)
366 EnumerateMetadata(F.isDeclaration() ? nullptr : &F, I.second);
368 for (const BasicBlock &BB : F)
369 for (const Instruction &I : BB) {
370 for (const Use &Op : I.operands()) {
371 auto *MD = dyn_cast<MetadataAsValue>(&Op);
373 EnumerateOperandType(Op);
377 // Local metadata is enumerated during function-incorporation.
378 if (isa<LocalAsMetadata>(MD->getMetadata()))
381 EnumerateMetadata(&F, MD->getMetadata());
383 EnumerateType(I.getType());
384 if (const CallInst *CI = dyn_cast<CallInst>(&I))
385 EnumerateAttributes(CI->getAttributes());
386 else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I))
387 EnumerateAttributes(II->getAttributes());
389 // Enumerate metadata attached with this instruction.
391 I.getAllMetadataOtherThanDebugLoc(MDs);
392 for (unsigned i = 0, e = MDs.size(); i != e; ++i)
393 EnumerateMetadata(&F, MDs[i].second);
395 // Don't enumerate the location directly -- it has a special record
396 // type -- but enumerate its operands.
397 if (DILocation *L = I.getDebugLoc())
398 for (const Metadata *Op : L->operands())
399 EnumerateMetadata(&F, Op);
403 // Optimize constant ordering.
404 OptimizeConstants(FirstConstant, Values.size());
406 // Organize metadata ordering.
410 unsigned ValueEnumerator::getInstructionID(const Instruction *Inst) const {
411 InstructionMapType::const_iterator I = InstructionMap.find(Inst);
412 assert(I != InstructionMap.end() && "Instruction is not mapped!");
416 unsigned ValueEnumerator::getComdatID(const Comdat *C) const {
417 unsigned ComdatID = Comdats.idFor(C);
418 assert(ComdatID && "Comdat not found!");
422 void ValueEnumerator::setInstructionID(const Instruction *I) {
423 InstructionMap[I] = InstructionCount++;
426 unsigned ValueEnumerator::getValueID(const Value *V) const {
427 if (auto *MD = dyn_cast<MetadataAsValue>(V))
428 return getMetadataID(MD->getMetadata());
430 ValueMapType::const_iterator I = ValueMap.find(V);
431 assert(I != ValueMap.end() && "Value not in slotcalculator!");
435 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
436 LLVM_DUMP_METHOD void ValueEnumerator::dump() const {
437 print(dbgs(), ValueMap, "Default");
439 print(dbgs(), MetadataMap, "MetaData");
444 void ValueEnumerator::print(raw_ostream &OS, const ValueMapType &Map,
445 const char *Name) const {
447 OS << "Map Name: " << Name << "\n";
448 OS << "Size: " << Map.size() << "\n";
449 for (ValueMapType::const_iterator I = Map.begin(),
450 E = Map.end(); I != E; ++I) {
452 const Value *V = I->first;
454 OS << "Value: " << V->getName();
456 OS << "Value: [null]\n";
460 OS << " Uses(" << std::distance(V->use_begin(),V->use_end()) << "):";
461 for (const Use &U : V->uses()) {
462 if (&U != &*V->use_begin())
465 OS << " " << U->getName();
474 void ValueEnumerator::print(raw_ostream &OS, const MetadataMapType &Map,
475 const char *Name) const {
477 OS << "Map Name: " << Name << "\n";
478 OS << "Size: " << Map.size() << "\n";
479 for (auto I = Map.begin(), E = Map.end(); I != E; ++I) {
480 const Metadata *MD = I->first;
481 OS << "Metadata: slot = " << I->second.ID << "\n";
482 OS << "Metadata: function = " << I->second.F << "\n";
488 /// OptimizeConstants - Reorder constant pool for denser encoding.
489 void ValueEnumerator::OptimizeConstants(unsigned CstStart, unsigned CstEnd) {
490 if (CstStart == CstEnd || CstStart+1 == CstEnd) return;
492 if (ShouldPreserveUseListOrder)
493 // Optimizing constants makes the use-list order difficult to predict.
494 // Disable it for now when trying to preserve the order.
497 std::stable_sort(Values.begin() + CstStart, Values.begin() + CstEnd,
498 [this](const std::pair<const Value *, unsigned> &LHS,
499 const std::pair<const Value *, unsigned> &RHS) {
501 if (LHS.first->getType() != RHS.first->getType())
502 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
503 // Then by frequency.
504 return LHS.second > RHS.second;
507 // Ensure that integer and vector of integer constants are at the start of the
508 // constant pool. This is important so that GEP structure indices come before
509 // gep constant exprs.
510 std::stable_partition(Values.begin() + CstStart, Values.begin() + CstEnd,
511 isIntOrIntVectorValue);
513 // Rebuild the modified portion of ValueMap.
514 for (; CstStart != CstEnd; ++CstStart)
515 ValueMap[Values[CstStart].first] = CstStart+1;
519 /// EnumerateValueSymbolTable - Insert all of the values in the specified symbol
520 /// table into the values table.
521 void ValueEnumerator::EnumerateValueSymbolTable(const ValueSymbolTable &VST) {
522 for (ValueSymbolTable::const_iterator VI = VST.begin(), VE = VST.end();
524 EnumerateValue(VI->getValue());
527 /// Insert all of the values referenced by named metadata in the specified
529 void ValueEnumerator::EnumerateNamedMetadata(const Module &M) {
530 for (const auto &I : M.named_metadata())
531 EnumerateNamedMDNode(&I);
534 void ValueEnumerator::EnumerateNamedMDNode(const NamedMDNode *MD) {
535 for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i)
536 EnumerateMetadata(nullptr, MD->getOperand(i));
539 unsigned ValueEnumerator::getMetadataFunctionID(const Function *F) const {
540 return F ? getValueID(F) + 1 : 0;
543 void ValueEnumerator::EnumerateMetadata(const Function *F, const Metadata *MD) {
544 EnumerateMetadata(getMetadataFunctionID(F), MD);
547 void ValueEnumerator::EnumerateFunctionLocalMetadata(
548 const Function &F, const LocalAsMetadata *Local) {
549 EnumerateFunctionLocalMetadata(getMetadataFunctionID(&F), Local);
552 void ValueEnumerator::dropFunctionFromMetadata(
553 MetadataMapType::value_type &FirstMD) {
554 SmallVector<const MDNode *, 64> Worklist;
555 auto push = [&Worklist](MetadataMapType::value_type &MD) {
556 auto &Entry = MD.second;
558 // Nothing to do if this metadata isn't tagged.
562 // Drop the function tag.
565 // If this is has an ID and is an MDNode, then its operands have entries as
566 // well. We need to drop the function from them too.
568 if (auto *N = dyn_cast<MDNode>(MD.first))
569 Worklist.push_back(N);
572 while (!Worklist.empty())
573 for (const Metadata *Op : Worklist.pop_back_val()->operands()) {
576 auto MD = MetadataMap.find(Op);
577 if (MD != MetadataMap.end())
582 void ValueEnumerator::EnumerateMetadata(unsigned F, const Metadata *MD) {
583 // It's vital for reader efficiency that uniqued subgraphs are done in
584 // post-order; it's expensive when their operands have forward references.
585 // If a distinct node is referenced from a uniqued node, it'll be delayed
586 // until the uniqued subgraph has been completely traversed.
587 SmallVector<const MDNode *, 32> DelayedDistinctNodes;
589 // Start by enumerating MD, and then work through its transitive operands in
590 // post-order. This requires a depth-first search.
591 SmallVector<std::pair<const MDNode *, MDNode::op_iterator>, 32> Worklist;
592 if (const MDNode *N = enumerateMetadataImpl(F, MD))
593 Worklist.push_back(std::make_pair(N, N->op_begin()));
595 while (!Worklist.empty()) {
596 const MDNode *N = Worklist.back().first;
598 // Enumerate operands until we hit a new node. We need to traverse these
599 // nodes' operands before visiting the rest of N's operands.
600 MDNode::op_iterator I = std::find_if(
601 Worklist.back().second, N->op_end(),
602 [&](const Metadata *MD) { return enumerateMetadataImpl(F, MD); });
603 if (I != N->op_end()) {
604 auto *Op = cast<MDNode>(*I);
605 Worklist.back().second = ++I;
607 // Delay traversing Op if it's a distinct node and N is uniqued.
608 if (Op->isDistinct() && !N->isDistinct())
609 DelayedDistinctNodes.push_back(Op);
611 Worklist.push_back(std::make_pair(Op, Op->op_begin()));
615 // All the operands have been visited. Now assign an ID.
618 MetadataMap[N].ID = MDs.size();
620 // Flush out any delayed distinct nodes; these are all the distinct nodes
621 // that are leaves in last uniqued subgraph.
622 if (Worklist.empty() || Worklist.back().first->isDistinct()) {
623 for (const MDNode *N : DelayedDistinctNodes)
624 Worklist.push_back(std::make_pair(N, N->op_begin()));
625 DelayedDistinctNodes.clear();
630 const MDNode *ValueEnumerator::enumerateMetadataImpl(unsigned F, const Metadata *MD) {
635 (isa<MDNode>(MD) || isa<MDString>(MD) || isa<ConstantAsMetadata>(MD)) &&
636 "Invalid metadata kind");
638 auto Insertion = MetadataMap.insert(std::make_pair(MD, MDIndex(F)));
639 MDIndex &Entry = Insertion.first->second;
640 if (!Insertion.second) {
641 // Already mapped. If F doesn't match the function tag, drop it.
642 if (Entry.hasDifferentFunction(F))
643 dropFunctionFromMetadata(*Insertion.first);
647 // Don't assign IDs to metadata nodes.
648 if (auto *N = dyn_cast<MDNode>(MD))
651 // Save the metadata.
653 Entry.ID = MDs.size();
655 // Enumerate the constant, if any.
656 if (auto *C = dyn_cast<ConstantAsMetadata>(MD))
657 EnumerateValue(C->getValue());
662 /// EnumerateFunctionLocalMetadataa - Incorporate function-local metadata
663 /// information reachable from the metadata.
664 void ValueEnumerator::EnumerateFunctionLocalMetadata(
665 unsigned F, const LocalAsMetadata *Local) {
666 assert(F && "Expected a function");
668 // Check to see if it's already in!
669 MDIndex &Index = MetadataMap[Local];
671 assert(Index.F == F && "Expected the same function");
675 MDs.push_back(Local);
677 Index.ID = MDs.size();
679 EnumerateValue(Local->getValue());
682 static unsigned getMetadataTypeOrder(const Metadata *MD) {
683 // Strings are emitted in bulk and must come first.
684 if (isa<MDString>(MD))
687 // ConstantAsMetadata doesn't reference anything. We may as well shuffle it
688 // to the front since we can detect it.
689 auto *N = dyn_cast<MDNode>(MD);
693 // The reader is fast forward references for distinct node operands, but slow
694 // when uniqued operands are unresolved.
695 return N->isDistinct() ? 2 : 3;
698 void ValueEnumerator::organizeMetadata() {
699 assert(MetadataMap.size() == MDs.size() &&
700 "Metadata map and vector out of sync");
705 // Copy out the index information from MetadataMap in order to choose a new
707 SmallVector<MDIndex, 64> Order;
708 Order.reserve(MetadataMap.size());
709 for (const Metadata *MD : MDs)
710 Order.push_back(MetadataMap.lookup(MD));
713 // - by function, then
714 // - by isa<MDString>
715 // and then sort by the original/current ID. Since the IDs are guaranteed to
716 // be unique, the result of std::sort will be deterministic. There's no need
717 // for std::stable_sort.
718 std::sort(Order.begin(), Order.end(), [this](MDIndex LHS, MDIndex RHS) {
719 return std::make_tuple(LHS.F, getMetadataTypeOrder(LHS.get(MDs)), LHS.ID) <
720 std::make_tuple(RHS.F, getMetadataTypeOrder(RHS.get(MDs)), RHS.ID);
723 // Rebuild MDs, index the metadata ranges for each function in FunctionMDs,
724 // and fix up MetadataMap.
725 std::vector<const Metadata *> OldMDs = std::move(MDs);
726 MDs.reserve(OldMDs.size());
727 for (unsigned I = 0, E = Order.size(); I != E && !Order[I].F; ++I) {
728 auto *MD = Order[I].get(OldMDs);
730 MetadataMap[MD].ID = I + 1;
731 if (isa<MDString>(MD))
735 // Return early if there's nothing for the functions.
736 if (MDs.size() == Order.size())
739 // Build the function metadata ranges.
741 FunctionMDs.reserve(OldMDs.size());
743 for (unsigned I = MDs.size(), E = Order.size(), ID = MDs.size(); I != E;
745 unsigned F = Order[I].F;
748 } else if (PrevF != F) {
749 R.Last = FunctionMDs.size();
750 std::swap(R, FunctionMDInfo[PrevF]);
751 R.First = FunctionMDs.size();
757 auto *MD = Order[I].get(OldMDs);
758 FunctionMDs.push_back(MD);
759 MetadataMap[MD].ID = ++ID;
760 if (isa<MDString>(MD))
763 R.Last = FunctionMDs.size();
764 FunctionMDInfo[PrevF] = R;
767 void ValueEnumerator::incorporateFunctionMetadata(const Function &F) {
768 NumModuleMDs = MDs.size();
770 auto R = FunctionMDInfo.lookup(getValueID(&F) + 1);
771 NumMDStrings = R.NumStrings;
772 MDs.insert(MDs.end(), FunctionMDs.begin() + R.First,
773 FunctionMDs.begin() + R.Last);
776 void ValueEnumerator::EnumerateValue(const Value *V) {
777 assert(!V->getType()->isVoidTy() && "Can't insert void values!");
778 assert(!isa<MetadataAsValue>(V) && "EnumerateValue doesn't handle Metadata!");
780 // Check to see if it's already in!
781 unsigned &ValueID = ValueMap[V];
783 // Increment use count.
784 Values[ValueID-1].second++;
788 if (auto *GO = dyn_cast<GlobalObject>(V))
789 if (const Comdat *C = GO->getComdat())
792 // Enumerate the type of this value.
793 EnumerateType(V->getType());
795 if (const Constant *C = dyn_cast<Constant>(V)) {
796 if (isa<GlobalValue>(C)) {
797 // Initializers for globals are handled explicitly elsewhere.
798 } else if (C->getNumOperands()) {
799 // If a constant has operands, enumerate them. This makes sure that if a
800 // constant has uses (for example an array of const ints), that they are
803 // We prefer to enumerate them with values before we enumerate the user
804 // itself. This makes it more likely that we can avoid forward references
805 // in the reader. We know that there can be no cycles in the constants
806 // graph that don't go through a global variable.
807 for (User::const_op_iterator I = C->op_begin(), E = C->op_end();
809 if (!isa<BasicBlock>(*I)) // Don't enumerate BB operand to BlockAddress.
812 // Finally, add the value. Doing this could make the ValueID reference be
813 // dangling, don't reuse it.
814 Values.push_back(std::make_pair(V, 1U));
815 ValueMap[V] = Values.size();
821 Values.push_back(std::make_pair(V, 1U));
822 ValueID = Values.size();
826 void ValueEnumerator::EnumerateType(Type *Ty) {
827 unsigned *TypeID = &TypeMap[Ty];
829 // We've already seen this type.
833 // If it is a non-anonymous struct, mark the type as being visited so that we
834 // don't recursively visit it. This is safe because we allow forward
835 // references of these in the bitcode reader.
836 if (StructType *STy = dyn_cast<StructType>(Ty))
837 if (!STy->isLiteral())
840 // Enumerate all of the subtypes before we enumerate this type. This ensures
841 // that the type will be enumerated in an order that can be directly built.
842 for (Type *SubTy : Ty->subtypes())
843 EnumerateType(SubTy);
845 // Refresh the TypeID pointer in case the table rehashed.
846 TypeID = &TypeMap[Ty];
848 // Check to see if we got the pointer another way. This can happen when
849 // enumerating recursive types that hit the base case deeper than they start.
851 // If this is actually a struct that we are treating as forward ref'able,
852 // then emit the definition now that all of its contents are available.
853 if (*TypeID && *TypeID != ~0U)
856 // Add this type now that its contents are all happily enumerated.
859 *TypeID = Types.size();
862 // Enumerate the types for the specified value. If the value is a constant,
863 // walk through it, enumerating the types of the constant.
864 void ValueEnumerator::EnumerateOperandType(const Value *V) {
865 EnumerateType(V->getType());
867 assert(!isa<MetadataAsValue>(V) && "Unexpected metadata operand");
869 const Constant *C = dyn_cast<Constant>(V);
873 // If this constant is already enumerated, ignore it, we know its type must
875 if (ValueMap.count(C))
878 // This constant may have operands, make sure to enumerate the types in
880 for (const Value *Op : C->operands()) {
881 // Don't enumerate basic blocks here, this happens as operands to
883 if (isa<BasicBlock>(Op))
886 EnumerateOperandType(Op);
890 void ValueEnumerator::EnumerateAttributes(AttributeList PAL) {
891 if (PAL.isEmpty()) return; // null is always 0.
894 unsigned &Entry = AttributeMap[PAL];
896 // Never saw this before, add it.
897 Attribute.push_back(PAL);
898 Entry = Attribute.size();
901 // Do lookups for all attribute groups.
902 for (unsigned i = 0, e = PAL.getNumSlots(); i != e; ++i) {
903 AttributeList AS = PAL.getSlotAttributes(i);
904 unsigned &Entry = AttributeGroupMap[AS];
906 AttributeGroups.push_back(AS);
907 Entry = AttributeGroups.size();
912 void ValueEnumerator::incorporateFunction(const Function &F) {
913 InstructionCount = 0;
914 NumModuleValues = Values.size();
916 // Add global metadata to the function block. This doesn't include
918 incorporateFunctionMetadata(F);
920 // Adding function arguments to the value table.
921 for (const auto &I : F.args())
924 FirstFuncConstantID = Values.size();
926 // Add all function-level constants to the value table.
927 for (const BasicBlock &BB : F) {
928 for (const Instruction &I : BB)
929 for (const Use &OI : I.operands()) {
930 if ((isa<Constant>(OI) && !isa<GlobalValue>(OI)) || isa<InlineAsm>(OI))
933 BasicBlocks.push_back(&BB);
934 ValueMap[&BB] = BasicBlocks.size();
937 // Optimize the constant layout.
938 OptimizeConstants(FirstFuncConstantID, Values.size());
940 // Add the function's parameter attributes so they are available for use in
941 // the function's instruction.
942 EnumerateAttributes(F.getAttributes());
944 FirstInstID = Values.size();
946 SmallVector<LocalAsMetadata *, 8> FnLocalMDVector;
947 // Add all of the instructions.
948 for (const BasicBlock &BB : F) {
949 for (const Instruction &I : BB) {
950 for (const Use &OI : I.operands()) {
951 if (auto *MD = dyn_cast<MetadataAsValue>(&OI))
952 if (auto *Local = dyn_cast<LocalAsMetadata>(MD->getMetadata()))
953 // Enumerate metadata after the instructions they might refer to.
954 FnLocalMDVector.push_back(Local);
957 if (!I.getType()->isVoidTy())
962 // Add all of the function-local metadata.
963 for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i) {
964 // At this point, every local values have been incorporated, we shouldn't
965 // have a metadata operand that references a value that hasn't been seen.
966 assert(ValueMap.count(FnLocalMDVector[i]->getValue()) &&
967 "Missing value for metadata operand");
968 EnumerateFunctionLocalMetadata(F, FnLocalMDVector[i]);
972 void ValueEnumerator::purgeFunction() {
973 /// Remove purged values from the ValueMap.
974 for (unsigned i = NumModuleValues, e = Values.size(); i != e; ++i)
975 ValueMap.erase(Values[i].first);
976 for (unsigned i = NumModuleMDs, e = MDs.size(); i != e; ++i)
977 MetadataMap.erase(MDs[i]);
978 for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i)
979 ValueMap.erase(BasicBlocks[i]);
981 Values.resize(NumModuleValues);
982 MDs.resize(NumModuleMDs);
987 static void IncorporateFunctionInfoGlobalBBIDs(const Function *F,
988 DenseMap<const BasicBlock*, unsigned> &IDMap) {
989 unsigned Counter = 0;
990 for (const BasicBlock &BB : *F)
991 IDMap[&BB] = ++Counter;
994 /// getGlobalBasicBlockID - This returns the function-specific ID for the
995 /// specified basic block. This is relatively expensive information, so it
996 /// should only be used by rare constructs such as address-of-label.
997 unsigned ValueEnumerator::getGlobalBasicBlockID(const BasicBlock *BB) const {
998 unsigned &Idx = GlobalBasicBlockIDs[BB];
1002 IncorporateFunctionInfoGlobalBBIDs(BB->getParent(), GlobalBasicBlockIDs);
1003 return getGlobalBasicBlockID(BB);
1006 uint64_t ValueEnumerator::computeBitsRequiredForTypeIndicies() const {
1007 return Log2_32_Ceil(getTypes().size() + 1);