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 Function &F : M) {
90 if (F.hasPrefixData())
91 if (!isa<GlobalValue>(F.getPrefixData()))
92 orderValue(F.getPrefixData(), OM);
93 if (F.hasPrologueData())
94 if (!isa<GlobalValue>(F.getPrologueData()))
95 orderValue(F.getPrologueData(), 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 GlobalVariable &G : M.globals())
113 OM.LastGlobalValueID = OM.size();
115 for (const Function &F : M) {
116 if (F.isDeclaration())
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)
123 for (const Argument &A : F.args())
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)) ||
131 for (const BasicBlock &BB : F)
132 for (const Instruction &I : BB)
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()));
150 // We may have lost some users.
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;
160 auto LID = OM.lookup(LU->getUser()).first;
161 auto RID = OM.lookup(RU->getUser()).first;
163 // Global values are processed in reverse order.
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))
172 // If ID is 4, then expect: 7 6 5 1 2 3.
175 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
181 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
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.
189 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
190 return LU->getOperandNo() < RU->getOperandNo();
191 return LU->getOperandNo() > RU->getOperandNo();
195 List.begin(), List.end(),
196 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
197 // Order is already correct.
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;
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");
212 // Already predicted.
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);
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);
228 static UseListOrderStack predictUseListOrder(const Module &M) {
229 OrderMap OM = orderModule(M);
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.
235 // Aside from function order, the order of values doesn't matter much here.
236 UseListOrderStack Stack;
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.
241 for (auto I = M.rbegin(), E = M.rend(); I != E; ++I) {
242 const Function &F = *I;
243 if (F.isDeclaration())
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);
259 // Visit globals last, since the module-level use-list block will be seen
260 // before the function bodies are processed.
261 for (const GlobalVariable &G : M.globals())
262 predictValueUseListOrder(&G, nullptr, OM, Stack);
263 for (const Function &F : M)
264 predictValueUseListOrder(&F, nullptr, OM, Stack);
265 for (const GlobalAlias &A : M.aliases())
266 predictValueUseListOrder(&A, nullptr, OM, Stack);
267 for (const GlobalVariable &G : M.globals())
268 if (G.hasInitializer())
269 predictValueUseListOrder(G.getInitializer(), nullptr, OM, Stack);
270 for (const GlobalAlias &A : M.aliases())
271 predictValueUseListOrder(A.getAliasee(), nullptr, OM, Stack);
272 for (const Function &F : M) {
273 if (F.hasPrefixData())
274 predictValueUseListOrder(F.getPrefixData(), nullptr, OM, Stack);
275 if (F.hasPrologueData())
276 predictValueUseListOrder(F.getPrologueData(), nullptr, OM, Stack);
282 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) {
283 return V.first->getType()->isIntOrIntVectorTy();
286 ValueEnumerator::ValueEnumerator(const Module &M)
287 : HasMDString(false), HasMDLocation(false), HasGenericDebugNode(false) {
288 if (shouldPreserveBitcodeUseListOrder())
289 UseListOrders = predictUseListOrder(M);
291 // Enumerate the global variables.
292 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
296 // Enumerate the functions.
297 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I) {
299 EnumerateAttributes(cast<Function>(I)->getAttributes());
302 // Enumerate the aliases.
303 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
307 // Remember what is the cutoff between globalvalue's and other constants.
308 unsigned FirstConstant = Values.size();
310 // Enumerate the global variable initializers.
311 for (Module::const_global_iterator I = M.global_begin(), E = M.global_end();
313 if (I->hasInitializer())
314 EnumerateValue(I->getInitializer());
316 // Enumerate the aliasees.
317 for (Module::const_alias_iterator I = M.alias_begin(), E = M.alias_end();
319 EnumerateValue(I->getAliasee());
321 // Enumerate the prefix data constants.
322 for (Module::const_iterator I = M.begin(), E = M.end(); I != E; ++I)
323 if (I->hasPrefixData())
324 EnumerateValue(I->getPrefixData());
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());
331 // Enumerate the metadata type.
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()));
337 // Insert constants and metadata that are named at module level into the slot
338 // pool so that the module symbol table can refer to them...
339 EnumerateValueSymbolTable(M.getValueSymbolTable());
340 EnumerateNamedMetadata(M);
342 SmallVector<std::pair<unsigned, MDNode *>, 8> MDs;
344 // Enumerate types used by function bodies and argument lists.
345 for (const Function &F : M) {
346 for (const Argument &A : F.args())
347 EnumerateType(A.getType());
349 for (const BasicBlock &BB : F)
350 for (const Instruction &I : BB) {
351 for (const Use &Op : I.operands()) {
352 auto *MD = dyn_cast<MetadataAsValue>(&Op);
354 EnumerateOperandType(Op);
358 // Local metadata is enumerated during function-incorporation.
359 if (isa<LocalAsMetadata>(MD->getMetadata()))
362 EnumerateMetadata(MD->getMetadata());
364 EnumerateType(I.getType());
365 if (const CallInst *CI = dyn_cast<CallInst>(&I))
366 EnumerateAttributes(CI->getAttributes());
367 else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I))
368 EnumerateAttributes(II->getAttributes());
370 // Enumerate metadata attached with this instruction.
372 I.getAllMetadataOtherThanDebugLoc(MDs);
373 for (unsigned i = 0, e = MDs.size(); i != e; ++i)
374 EnumerateMetadata(MDs[i].second);
376 // Don't enumerate the location directly -- it has a special record
377 // type -- but enumerate its operands.
378 if (MDLocation *L = I.getDebugLoc())
379 EnumerateMDNodeOperands(L);
383 // Optimize constant ordering.
384 OptimizeConstants(FirstConstant, Values.size());
387 unsigned ValueEnumerator::getInstructionID(const Instruction *Inst) const {
388 InstructionMapType::const_iterator I = InstructionMap.find(Inst);
389 assert(I != InstructionMap.end() && "Instruction is not mapped!");
393 unsigned ValueEnumerator::getComdatID(const Comdat *C) const {
394 unsigned ComdatID = Comdats.idFor(C);
395 assert(ComdatID && "Comdat not found!");
399 void ValueEnumerator::setInstructionID(const Instruction *I) {
400 InstructionMap[I] = InstructionCount++;
403 unsigned ValueEnumerator::getValueID(const Value *V) const {
404 if (auto *MD = dyn_cast<MetadataAsValue>(V))
405 return getMetadataID(MD->getMetadata());
407 ValueMapType::const_iterator I = ValueMap.find(V);
408 assert(I != ValueMap.end() && "Value not in slotcalculator!");
412 void ValueEnumerator::dump() const {
413 print(dbgs(), ValueMap, "Default");
415 print(dbgs(), MDValueMap, "MetaData");
419 void ValueEnumerator::print(raw_ostream &OS, const ValueMapType &Map,
420 const char *Name) const {
422 OS << "Map Name: " << Name << "\n";
423 OS << "Size: " << Map.size() << "\n";
424 for (ValueMapType::const_iterator I = Map.begin(),
425 E = Map.end(); I != E; ++I) {
427 const Value *V = I->first;
429 OS << "Value: " << V->getName();
431 OS << "Value: [null]\n";
434 OS << " Uses(" << std::distance(V->use_begin(),V->use_end()) << "):";
435 for (const Use &U : V->uses()) {
436 if (&U != &*V->use_begin())
439 OS << " " << U->getName();
448 void ValueEnumerator::print(raw_ostream &OS, const MetadataMapType &Map,
449 const char *Name) const {
451 OS << "Map Name: " << Name << "\n";
452 OS << "Size: " << Map.size() << "\n";
453 for (auto I = Map.begin(), E = Map.end(); I != E; ++I) {
454 const Metadata *MD = I->first;
455 OS << "Metadata: slot = " << I->second << "\n";
460 /// OptimizeConstants - Reorder constant pool for denser encoding.
461 void ValueEnumerator::OptimizeConstants(unsigned CstStart, unsigned CstEnd) {
462 if (CstStart == CstEnd || CstStart+1 == CstEnd) return;
464 if (shouldPreserveBitcodeUseListOrder())
465 // Optimizing constants makes the use-list order difficult to predict.
466 // Disable it for now when trying to preserve the order.
469 std::stable_sort(Values.begin() + CstStart, Values.begin() + CstEnd,
470 [this](const std::pair<const Value *, unsigned> &LHS,
471 const std::pair<const Value *, unsigned> &RHS) {
473 if (LHS.first->getType() != RHS.first->getType())
474 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
475 // Then by frequency.
476 return LHS.second > RHS.second;
479 // Ensure that integer and vector of integer constants are at the start of the
480 // constant pool. This is important so that GEP structure indices come before
481 // gep constant exprs.
482 std::partition(Values.begin()+CstStart, Values.begin()+CstEnd,
483 isIntOrIntVectorValue);
485 // Rebuild the modified portion of ValueMap.
486 for (; CstStart != CstEnd; ++CstStart)
487 ValueMap[Values[CstStart].first] = CstStart+1;
491 /// EnumerateValueSymbolTable - Insert all of the values in the specified symbol
492 /// table into the values table.
493 void ValueEnumerator::EnumerateValueSymbolTable(const ValueSymbolTable &VST) {
494 for (ValueSymbolTable::const_iterator VI = VST.begin(), VE = VST.end();
496 EnumerateValue(VI->getValue());
499 /// Insert all of the values referenced by named metadata in the specified
501 void ValueEnumerator::EnumerateNamedMetadata(const Module &M) {
502 for (Module::const_named_metadata_iterator I = M.named_metadata_begin(),
503 E = M.named_metadata_end();
505 EnumerateNamedMDNode(I);
508 void ValueEnumerator::EnumerateNamedMDNode(const NamedMDNode *MD) {
509 for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i)
510 EnumerateMetadata(MD->getOperand(i));
513 /// EnumerateMDNodeOperands - Enumerate all non-function-local values
514 /// and types referenced by the given MDNode.
515 void ValueEnumerator::EnumerateMDNodeOperands(const MDNode *N) {
516 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
517 Metadata *MD = N->getOperand(i);
520 assert(!isa<LocalAsMetadata>(MD) && "MDNodes cannot be function-local");
521 EnumerateMetadata(MD);
525 void ValueEnumerator::EnumerateMetadata(const Metadata *MD) {
527 (isa<MDNode>(MD) || isa<MDString>(MD) || isa<ConstantAsMetadata>(MD)) &&
528 "Invalid metadata kind");
530 // Insert a dummy ID to block the co-recursive call to
531 // EnumerateMDNodeOperands() from re-visiting MD in a cyclic graph.
533 // Return early if there's already an ID.
534 if (!MDValueMap.insert(std::make_pair(MD, 0)).second)
537 // Visit operands first to minimize RAUW.
538 if (auto *N = dyn_cast<MDNode>(MD))
539 EnumerateMDNodeOperands(N);
540 else if (auto *C = dyn_cast<ConstantAsMetadata>(MD))
541 EnumerateValue(C->getValue());
543 HasMDString |= isa<MDString>(MD);
544 HasMDLocation |= isa<MDLocation>(MD);
545 HasGenericDebugNode |= isa<GenericDebugNode>(MD);
547 // Replace the dummy ID inserted above with the correct one. MDValueMap may
548 // have changed by inserting operands, so we need a fresh lookup here.
550 MDValueMap[MD] = MDs.size();
553 /// EnumerateFunctionLocalMetadataa - Incorporate function-local metadata
554 /// information reachable from the metadata.
555 void ValueEnumerator::EnumerateFunctionLocalMetadata(
556 const LocalAsMetadata *Local) {
557 // Check to see if it's already in!
558 unsigned &MDValueID = MDValueMap[Local];
562 MDs.push_back(Local);
563 MDValueID = MDs.size();
565 EnumerateValue(Local->getValue());
567 // Also, collect all function-local metadata for easy access.
568 FunctionLocalMDs.push_back(Local);
571 void ValueEnumerator::EnumerateValue(const Value *V) {
572 assert(!V->getType()->isVoidTy() && "Can't insert void values!");
573 assert(!isa<MetadataAsValue>(V) && "EnumerateValue doesn't handle Metadata!");
575 // Check to see if it's already in!
576 unsigned &ValueID = ValueMap[V];
578 // Increment use count.
579 Values[ValueID-1].second++;
583 if (auto *GO = dyn_cast<GlobalObject>(V))
584 if (const Comdat *C = GO->getComdat())
587 // Enumerate the type of this value.
588 EnumerateType(V->getType());
590 if (const Constant *C = dyn_cast<Constant>(V)) {
591 if (isa<GlobalValue>(C)) {
592 // Initializers for globals are handled explicitly elsewhere.
593 } else if (C->getNumOperands()) {
594 // If a constant has operands, enumerate them. This makes sure that if a
595 // constant has uses (for example an array of const ints), that they are
598 // We prefer to enumerate them with values before we enumerate the user
599 // itself. This makes it more likely that we can avoid forward references
600 // in the reader. We know that there can be no cycles in the constants
601 // graph that don't go through a global variable.
602 for (User::const_op_iterator I = C->op_begin(), E = C->op_end();
604 if (!isa<BasicBlock>(*I)) // Don't enumerate BB operand to BlockAddress.
607 // Finally, add the value. Doing this could make the ValueID reference be
608 // dangling, don't reuse it.
609 Values.push_back(std::make_pair(V, 1U));
610 ValueMap[V] = Values.size();
616 Values.push_back(std::make_pair(V, 1U));
617 ValueID = Values.size();
621 void ValueEnumerator::EnumerateType(Type *Ty) {
622 unsigned *TypeID = &TypeMap[Ty];
624 // We've already seen this type.
628 // If it is a non-anonymous struct, mark the type as being visited so that we
629 // don't recursively visit it. This is safe because we allow forward
630 // references of these in the bitcode reader.
631 if (StructType *STy = dyn_cast<StructType>(Ty))
632 if (!STy->isLiteral())
635 // Enumerate all of the subtypes before we enumerate this type. This ensures
636 // that the type will be enumerated in an order that can be directly built.
637 for (Type *SubTy : Ty->subtypes())
638 EnumerateType(SubTy);
640 // Refresh the TypeID pointer in case the table rehashed.
641 TypeID = &TypeMap[Ty];
643 // Check to see if we got the pointer another way. This can happen when
644 // enumerating recursive types that hit the base case deeper than they start.
646 // If this is actually a struct that we are treating as forward ref'able,
647 // then emit the definition now that all of its contents are available.
648 if (*TypeID && *TypeID != ~0U)
651 // Add this type now that its contents are all happily enumerated.
654 *TypeID = Types.size();
657 // Enumerate the types for the specified value. If the value is a constant,
658 // walk through it, enumerating the types of the constant.
659 void ValueEnumerator::EnumerateOperandType(const Value *V) {
660 EnumerateType(V->getType());
662 if (auto *MD = dyn_cast<MetadataAsValue>(V)) {
663 assert(!isa<LocalAsMetadata>(MD->getMetadata()) &&
664 "Function-local metadata should be left for later");
666 EnumerateMetadata(MD->getMetadata());
670 const Constant *C = dyn_cast<Constant>(V);
674 // If this constant is already enumerated, ignore it, we know its type must
676 if (ValueMap.count(C))
679 // This constant may have operands, make sure to enumerate the types in
681 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
682 const Value *Op = C->getOperand(i);
684 // Don't enumerate basic blocks here, this happens as operands to
686 if (isa<BasicBlock>(Op))
689 EnumerateOperandType(Op);
693 void ValueEnumerator::EnumerateAttributes(AttributeSet PAL) {
694 if (PAL.isEmpty()) return; // null is always 0.
697 unsigned &Entry = AttributeMap[PAL];
699 // Never saw this before, add it.
700 Attribute.push_back(PAL);
701 Entry = Attribute.size();
704 // Do lookups for all attribute groups.
705 for (unsigned i = 0, e = PAL.getNumSlots(); i != e; ++i) {
706 AttributeSet AS = PAL.getSlotAttributes(i);
707 unsigned &Entry = AttributeGroupMap[AS];
709 AttributeGroups.push_back(AS);
710 Entry = AttributeGroups.size();
715 void ValueEnumerator::incorporateFunction(const Function &F) {
716 InstructionCount = 0;
717 NumModuleValues = Values.size();
718 NumModuleMDs = MDs.size();
720 // Adding function arguments to the value table.
721 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
725 FirstFuncConstantID = Values.size();
727 // Add all function-level constants to the value table.
728 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
729 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I)
730 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
732 if ((isa<Constant>(*OI) && !isa<GlobalValue>(*OI)) ||
736 BasicBlocks.push_back(BB);
737 ValueMap[BB] = BasicBlocks.size();
740 // Optimize the constant layout.
741 OptimizeConstants(FirstFuncConstantID, Values.size());
743 // Add the function's parameter attributes so they are available for use in
744 // the function's instruction.
745 EnumerateAttributes(F.getAttributes());
747 FirstInstID = Values.size();
749 SmallVector<LocalAsMetadata *, 8> FnLocalMDVector;
750 // Add all of the instructions.
751 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
752 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
753 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
755 if (auto *MD = dyn_cast<MetadataAsValue>(&*OI))
756 if (auto *Local = dyn_cast<LocalAsMetadata>(MD->getMetadata()))
757 // Enumerate metadata after the instructions they might refer to.
758 FnLocalMDVector.push_back(Local);
761 if (!I->getType()->isVoidTy())
766 // Add all of the function-local metadata.
767 for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i)
768 EnumerateFunctionLocalMetadata(FnLocalMDVector[i]);
771 void ValueEnumerator::purgeFunction() {
772 /// Remove purged values from the ValueMap.
773 for (unsigned i = NumModuleValues, e = Values.size(); i != e; ++i)
774 ValueMap.erase(Values[i].first);
775 for (unsigned i = NumModuleMDs, e = MDs.size(); i != e; ++i)
776 MDValueMap.erase(MDs[i]);
777 for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i)
778 ValueMap.erase(BasicBlocks[i]);
780 Values.resize(NumModuleValues);
781 MDs.resize(NumModuleMDs);
783 FunctionLocalMDs.clear();
786 static void IncorporateFunctionInfoGlobalBBIDs(const Function *F,
787 DenseMap<const BasicBlock*, unsigned> &IDMap) {
788 unsigned Counter = 0;
789 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
790 IDMap[BB] = ++Counter;
793 /// getGlobalBasicBlockID - This returns the function-specific ID for the
794 /// specified basic block. This is relatively expensive information, so it
795 /// should only be used by rare constructs such as address-of-label.
796 unsigned ValueEnumerator::getGlobalBasicBlockID(const BasicBlock *BB) const {
797 unsigned &Idx = GlobalBasicBlockIDs[BB];
801 IncorporateFunctionInfoGlobalBBIDs(BB->getParent(), GlobalBasicBlockIDs);
802 return getGlobalBasicBlockID(BB);
805 uint64_t ValueEnumerator::computeBitsRequiredForTypeIndicies() const {
806 return Log2_32_Ceil(getTypes().size() + 1);