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/DerivedTypes.h"
19 #include "llvm/IR/Instructions.h"
20 #include "llvm/IR/Module.h"
21 #include "llvm/IR/UseListOrder.h"
22 #include "llvm/IR/ValueSymbolTable.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/raw_ostream.h"
30 DenseMap<const Value *, std::pair<unsigned, bool>> IDs;
31 unsigned LastGlobalConstantID;
32 unsigned LastGlobalValueID;
34 OrderMap() : LastGlobalConstantID(0), LastGlobalValueID(0) {}
36 bool isGlobalConstant(unsigned ID) const {
37 return ID <= LastGlobalConstantID;
39 bool isGlobalValue(unsigned ID) const {
40 return ID <= LastGlobalValueID && !isGlobalConstant(ID);
43 unsigned size() const { return IDs.size(); }
44 std::pair<unsigned, bool> &operator[](const Value *V) { return IDs[V]; }
45 std::pair<unsigned, bool> lookup(const Value *V) const {
48 void index(const Value *V) {
49 // Explicitly sequence get-size and insert-value operations to avoid UB.
50 unsigned ID = IDs.size() + 1;
56 static void orderValue(const Value *V, OrderMap &OM) {
57 if (OM.lookup(V).first)
60 if (const Constant *C = dyn_cast<Constant>(V))
61 if (C->getNumOperands() && !isa<GlobalValue>(C))
62 for (const Value *Op : C->operands())
63 if (!isa<BasicBlock>(Op) && !isa<GlobalValue>(Op))
66 // Note: we cannot cache this lookup above, since inserting into the map
67 // changes the map's size, and thus affects the other IDs.
71 static OrderMap orderModule(const Module *M) {
72 // This needs to match the order used by ValueEnumerator::ValueEnumerator()
73 // and ValueEnumerator::incorporateFunction().
76 // In the reader, initializers of GlobalValues are set *after* all the
77 // globals have been read. Rather than awkwardly modeling this behaviour
78 // directly in predictValueUseListOrderImpl(), just assign IDs to
79 // initializers of GlobalValues before GlobalValues themselves to model this
81 for (const GlobalVariable &G : M->globals())
82 if (G.hasInitializer())
83 orderValue(G.getInitializer(), OM);
84 for (const GlobalAlias &A : M->aliases())
85 orderValue(A.getAliasee(), OM);
86 for (const Function &F : *M)
87 if (F.hasPrefixData())
88 orderValue(F.getPrefixData(), OM);
89 OM.LastGlobalConstantID = OM.size();
91 // Initializers of GlobalValues are processed in
92 // BitcodeReader::ResolveGlobalAndAliasInits(). Match the order there rather
93 // than ValueEnumerator, and match the code in predictValueUseListOrderImpl()
94 // by giving IDs in reverse order.
96 // Since GlobalValues never reference each other directly (just through
97 // initializers), their relative IDs only matter for determining order of
98 // uses in their initializers.
99 for (const Function &F : *M)
101 for (const GlobalAlias &A : M->aliases())
103 for (const GlobalVariable &G : M->globals())
105 OM.LastGlobalValueID = OM.size();
107 for (const Function &F : *M) {
108 if (F.isDeclaration())
110 // Here we need to match the union of ValueEnumerator::incorporateFunction()
111 // and WriteFunction(). Basic blocks are implicitly declared before
112 // anything else (by declaring their size).
113 for (const BasicBlock &BB : F)
115 for (const Argument &A : F.args())
117 for (const BasicBlock &BB : F)
118 for (const Instruction &I : BB)
119 for (const Value *Op : I.operands())
120 if ((isa<Constant>(*Op) && !isa<GlobalValue>(*Op)) ||
123 for (const BasicBlock &BB : F)
124 for (const Instruction &I : BB)
130 static void predictValueUseListOrderImpl(const Value *V, const Function *F,
131 unsigned ID, const OrderMap &OM,
132 UseListOrderStack &Stack) {
133 // Predict use-list order for this one.
134 typedef std::pair<const Use *, unsigned> Entry;
135 SmallVector<Entry, 64> List;
136 for (const Use &U : V->uses())
137 // Check if this user will be serialized.
138 if (OM.lookup(U.getUser()).first)
139 List.push_back(std::make_pair(&U, List.size()));
142 // We may have lost some users.
145 bool IsGlobalValue = OM.isGlobalValue(ID);
146 std::sort(List.begin(), List.end(), [&](const Entry &L, const Entry &R) {
147 const Use *LU = L.first;
148 const Use *RU = R.first;
152 auto LID = OM.lookup(LU->getUser()).first;
153 auto RID = OM.lookup(RU->getUser()).first;
155 // Global values are processed in reverse order.
157 // Moreover, initializers of GlobalValues are set *after* all the globals
158 // have been read (despite having earlier IDs). Rather than awkwardly
159 // modeling this behaviour here, orderModule() has assigned IDs to
160 // initializers of GlobalValues before GlobalValues themselves.
161 if (OM.isGlobalValue(LID) && OM.isGlobalValue(RID))
164 // If ID is 4, then expect: 7 6 5 1 2 3.
167 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
173 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
178 // LID and RID are equal, so we have different operands of the same user.
179 // Assume operands are added in order for all instructions.
181 if (!IsGlobalValue) // GlobalValue uses don't get reversed.
182 return LU->getOperandNo() < RU->getOperandNo();
183 return LU->getOperandNo() > RU->getOperandNo();
187 List.begin(), List.end(),
188 [](const Entry &L, const Entry &R) { return L.second < R.second; }))
189 // Order is already correct.
192 // Store the shuffle.
193 Stack.emplace_back(V, F, List.size());
194 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
195 for (size_t I = 0, E = List.size(); I != E; ++I)
196 Stack.back().Shuffle[I] = List[I].second;
199 static void predictValueUseListOrder(const Value *V, const Function *F,
200 OrderMap &OM, UseListOrderStack &Stack) {
201 auto &IDPair = OM[V];
202 assert(IDPair.first && "Unmapped value");
204 // Already predicted.
207 // Do the actual prediction.
208 IDPair.second = true;
209 if (!V->use_empty() && std::next(V->use_begin()) != V->use_end())
210 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack);
212 // Recursive descent into constants.
213 if (const Constant *C = dyn_cast<Constant>(V))
214 if (C->getNumOperands()) // Visit GlobalValues.
215 for (const Value *Op : C->operands())
216 if (isa<Constant>(Op)) // Visit GlobalValues.
217 predictValueUseListOrder(Op, F, OM, Stack);
220 static UseListOrderStack predictUseListOrder(const Module *M) {
221 OrderMap OM = orderModule(M);
223 // Use-list orders need to be serialized after all the users have been added
224 // to a value, or else the shuffles will be incomplete. Store them per
225 // function in a stack.
227 // Aside from function order, the order of values doesn't matter much here.
228 UseListOrderStack Stack;
230 // We want to visit the functions backward now so we can list function-local
231 // constants in the last Function they're used in. Module-level constants
232 // have already been visited above.
233 for (auto I = M->rbegin(), E = M->rend(); I != E; ++I) {
234 const Function &F = *I;
235 if (F.isDeclaration())
237 for (const BasicBlock &BB : F)
238 predictValueUseListOrder(&BB, &F, OM, Stack);
239 for (const Argument &A : F.args())
240 predictValueUseListOrder(&A, &F, OM, Stack);
241 for (const BasicBlock &BB : F)
242 for (const Instruction &I : BB)
243 for (const Value *Op : I.operands())
244 if (isa<Constant>(*Op) || isa<InlineAsm>(*Op)) // Visit GlobalValues.
245 predictValueUseListOrder(Op, &F, OM, Stack);
246 for (const BasicBlock &BB : F)
247 for (const Instruction &I : BB)
248 predictValueUseListOrder(&I, &F, OM, Stack);
251 // Visit globals last, since the module-level use-list block will be seen
252 // before the function bodies are processed.
253 for (const GlobalVariable &G : M->globals())
254 predictValueUseListOrder(&G, nullptr, OM, Stack);
255 for (const Function &F : *M)
256 predictValueUseListOrder(&F, nullptr, OM, Stack);
257 for (const GlobalAlias &A : M->aliases())
258 predictValueUseListOrder(&A, nullptr, OM, Stack);
259 for (const GlobalVariable &G : M->globals())
260 if (G.hasInitializer())
261 predictValueUseListOrder(G.getInitializer(), nullptr, OM, Stack);
262 for (const GlobalAlias &A : M->aliases())
263 predictValueUseListOrder(A.getAliasee(), nullptr, OM, Stack);
264 for (const Function &F : *M)
265 if (F.hasPrefixData())
266 predictValueUseListOrder(F.getPrefixData(), nullptr, OM, Stack);
271 static bool isIntOrIntVectorValue(const std::pair<const Value*, unsigned> &V) {
272 return V.first->getType()->isIntOrIntVectorTy();
275 /// ValueEnumerator - Enumerate module-level information.
276 ValueEnumerator::ValueEnumerator(const Module *M) {
277 if (shouldPreserveBitcodeUseListOrder())
278 UseListOrders = predictUseListOrder(M);
280 // Enumerate the global variables.
281 for (Module::const_global_iterator I = M->global_begin(),
283 E = M->global_end(); I != E; ++I)
286 // Enumerate the functions.
287 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I) {
289 EnumerateAttributes(cast<Function>(I)->getAttributes());
292 // Enumerate the aliases.
293 for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end();
297 // Remember what is the cutoff between globalvalue's and other constants.
298 unsigned FirstConstant = Values.size();
300 // Enumerate the global variable initializers.
301 for (Module::const_global_iterator I = M->global_begin(),
302 E = M->global_end(); I != E; ++I)
303 if (I->hasInitializer())
304 EnumerateValue(I->getInitializer());
306 // Enumerate the aliasees.
307 for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end();
309 EnumerateValue(I->getAliasee());
311 // Enumerate the prefix data constants.
312 for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I)
313 if (I->hasPrefixData())
314 EnumerateValue(I->getPrefixData());
316 // Insert constants and metadata that are named at module level into the slot
317 // pool so that the module symbol table can refer to them...
318 EnumerateValueSymbolTable(M->getValueSymbolTable());
319 EnumerateNamedMetadata(M);
321 SmallVector<std::pair<unsigned, MDNode*>, 8> MDs;
323 // Enumerate types used by function bodies and argument lists.
324 for (const Function &F : *M) {
325 for (const Argument &A : F.args())
326 EnumerateType(A.getType());
328 for (const BasicBlock &BB : F)
329 for (const Instruction &I : BB) {
330 for (const Use &Op : I.operands()) {
331 if (MDNode *MD = dyn_cast<MDNode>(&Op))
332 if (MD->isFunctionLocal() && MD->getFunction())
333 // These will get enumerated during function-incorporation.
335 EnumerateOperandType(Op);
337 EnumerateType(I.getType());
338 if (const CallInst *CI = dyn_cast<CallInst>(&I))
339 EnumerateAttributes(CI->getAttributes());
340 else if (const InvokeInst *II = dyn_cast<InvokeInst>(&I))
341 EnumerateAttributes(II->getAttributes());
343 // Enumerate metadata attached with this instruction.
345 I.getAllMetadataOtherThanDebugLoc(MDs);
346 for (unsigned i = 0, e = MDs.size(); i != e; ++i)
347 EnumerateMetadata(MDs[i].second);
349 if (!I.getDebugLoc().isUnknown()) {
351 I.getDebugLoc().getScopeAndInlinedAt(Scope, IA, I.getContext());
352 if (Scope) EnumerateMetadata(Scope);
353 if (IA) EnumerateMetadata(IA);
358 // Optimize constant ordering.
359 OptimizeConstants(FirstConstant, Values.size());
362 unsigned ValueEnumerator::getInstructionID(const Instruction *Inst) const {
363 InstructionMapType::const_iterator I = InstructionMap.find(Inst);
364 assert(I != InstructionMap.end() && "Instruction is not mapped!");
368 unsigned ValueEnumerator::getComdatID(const Comdat *C) const {
369 unsigned ComdatID = Comdats.idFor(C);
370 assert(ComdatID && "Comdat not found!");
374 void ValueEnumerator::setInstructionID(const Instruction *I) {
375 InstructionMap[I] = InstructionCount++;
378 unsigned ValueEnumerator::getValueID(const Value *V) const {
379 if (isa<MDNode>(V) || isa<MDString>(V)) {
380 ValueMapType::const_iterator I = MDValueMap.find(V);
381 assert(I != MDValueMap.end() && "Value not in slotcalculator!");
385 ValueMapType::const_iterator I = ValueMap.find(V);
386 assert(I != ValueMap.end() && "Value not in slotcalculator!");
390 void ValueEnumerator::dump() const {
391 print(dbgs(), ValueMap, "Default");
393 print(dbgs(), MDValueMap, "MetaData");
397 void ValueEnumerator::print(raw_ostream &OS, const ValueMapType &Map,
398 const char *Name) const {
400 OS << "Map Name: " << Name << "\n";
401 OS << "Size: " << Map.size() << "\n";
402 for (ValueMapType::const_iterator I = Map.begin(),
403 E = Map.end(); I != E; ++I) {
405 const Value *V = I->first;
407 OS << "Value: " << V->getName();
409 OS << "Value: [null]\n";
412 OS << " Uses(" << std::distance(V->use_begin(),V->use_end()) << "):";
413 for (const Use &U : V->uses()) {
414 if (&U != &*V->use_begin())
417 OS << " " << U->getName();
426 /// OptimizeConstants - Reorder constant pool for denser encoding.
427 void ValueEnumerator::OptimizeConstants(unsigned CstStart, unsigned CstEnd) {
428 if (CstStart == CstEnd || CstStart+1 == CstEnd) return;
430 if (shouldPreserveBitcodeUseListOrder())
431 // Optimizing constants makes the use-list order difficult to predict.
432 // Disable it for now when trying to preserve the order.
435 std::stable_sort(Values.begin() + CstStart, Values.begin() + CstEnd,
436 [this](const std::pair<const Value *, unsigned> &LHS,
437 const std::pair<const Value *, unsigned> &RHS) {
439 if (LHS.first->getType() != RHS.first->getType())
440 return getTypeID(LHS.first->getType()) < getTypeID(RHS.first->getType());
441 // Then by frequency.
442 return LHS.second > RHS.second;
445 // Ensure that integer and vector of integer constants are at the start of the
446 // constant pool. This is important so that GEP structure indices come before
447 // gep constant exprs.
448 std::partition(Values.begin()+CstStart, Values.begin()+CstEnd,
449 isIntOrIntVectorValue);
451 // Rebuild the modified portion of ValueMap.
452 for (; CstStart != CstEnd; ++CstStart)
453 ValueMap[Values[CstStart].first] = CstStart+1;
457 /// EnumerateValueSymbolTable - Insert all of the values in the specified symbol
458 /// table into the values table.
459 void ValueEnumerator::EnumerateValueSymbolTable(const ValueSymbolTable &VST) {
460 for (ValueSymbolTable::const_iterator VI = VST.begin(), VE = VST.end();
462 EnumerateValue(VI->getValue());
465 /// EnumerateNamedMetadata - Insert all of the values referenced by
466 /// named metadata in the specified module.
467 void ValueEnumerator::EnumerateNamedMetadata(const Module *M) {
468 for (Module::const_named_metadata_iterator I = M->named_metadata_begin(),
469 E = M->named_metadata_end(); I != E; ++I)
470 EnumerateNamedMDNode(I);
473 void ValueEnumerator::EnumerateNamedMDNode(const NamedMDNode *MD) {
474 for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i)
475 EnumerateMetadata(MD->getOperand(i));
478 /// EnumerateMDNodeOperands - Enumerate all non-function-local values
479 /// and types referenced by the given MDNode.
480 void ValueEnumerator::EnumerateMDNodeOperands(const MDNode *N) {
481 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
482 if (Value *V = N->getOperand(i)) {
483 if (isa<MDNode>(V) || isa<MDString>(V))
484 EnumerateMetadata(V);
485 else if (!isa<Instruction>(V) && !isa<Argument>(V))
488 EnumerateType(Type::getVoidTy(N->getContext()));
492 void ValueEnumerator::EnumerateMetadata(const Value *MD) {
493 assert((isa<MDNode>(MD) || isa<MDString>(MD)) && "Invalid metadata kind");
495 // Enumerate the type of this value.
496 EnumerateType(MD->getType());
498 const MDNode *N = dyn_cast<MDNode>(MD);
500 // In the module-level pass, skip function-local nodes themselves, but
501 // do walk their operands.
502 if (N && N->isFunctionLocal() && N->getFunction()) {
503 EnumerateMDNodeOperands(N);
507 // Check to see if it's already in!
508 unsigned &MDValueID = MDValueMap[MD];
510 // Increment use count.
511 MDValues[MDValueID-1].second++;
514 MDValues.push_back(std::make_pair(MD, 1U));
515 MDValueID = MDValues.size();
517 // Enumerate all non-function-local operands.
519 EnumerateMDNodeOperands(N);
522 /// EnumerateFunctionLocalMetadataa - Incorporate function-local metadata
523 /// information reachable from the given MDNode.
524 void ValueEnumerator::EnumerateFunctionLocalMetadata(const MDNode *N) {
525 assert(N->isFunctionLocal() && N->getFunction() &&
526 "EnumerateFunctionLocalMetadata called on non-function-local mdnode!");
528 // Enumerate the type of this value.
529 EnumerateType(N->getType());
531 // Check to see if it's already in!
532 unsigned &MDValueID = MDValueMap[N];
534 // Increment use count.
535 MDValues[MDValueID-1].second++;
538 MDValues.push_back(std::make_pair(N, 1U));
539 MDValueID = MDValues.size();
541 // To incoroporate function-local information visit all function-local
542 // MDNodes and all function-local values they reference.
543 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
544 if (Value *V = N->getOperand(i)) {
545 if (MDNode *O = dyn_cast<MDNode>(V)) {
546 if (O->isFunctionLocal() && O->getFunction())
547 EnumerateFunctionLocalMetadata(O);
548 } else if (isa<Instruction>(V) || isa<Argument>(V))
552 // Also, collect all function-local MDNodes for easy access.
553 FunctionLocalMDs.push_back(N);
556 void ValueEnumerator::EnumerateValue(const Value *V) {
557 assert(!V->getType()->isVoidTy() && "Can't insert void values!");
558 assert(!isa<MDNode>(V) && !isa<MDString>(V) &&
559 "EnumerateValue doesn't handle Metadata!");
561 // Check to see if it's already in!
562 unsigned &ValueID = ValueMap[V];
564 // Increment use count.
565 Values[ValueID-1].second++;
569 if (auto *GO = dyn_cast<GlobalObject>(V))
570 if (const Comdat *C = GO->getComdat())
573 // Enumerate the type of this value.
574 EnumerateType(V->getType());
576 if (const Constant *C = dyn_cast<Constant>(V)) {
577 if (isa<GlobalValue>(C)) {
578 // Initializers for globals are handled explicitly elsewhere.
579 } else if (C->getNumOperands()) {
580 // If a constant has operands, enumerate them. This makes sure that if a
581 // constant has uses (for example an array of const ints), that they are
584 // We prefer to enumerate them with values before we enumerate the user
585 // itself. This makes it more likely that we can avoid forward references
586 // in the reader. We know that there can be no cycles in the constants
587 // graph that don't go through a global variable.
588 for (User::const_op_iterator I = C->op_begin(), E = C->op_end();
590 if (!isa<BasicBlock>(*I)) // Don't enumerate BB operand to BlockAddress.
593 // Finally, add the value. Doing this could make the ValueID reference be
594 // dangling, don't reuse it.
595 Values.push_back(std::make_pair(V, 1U));
596 ValueMap[V] = Values.size();
602 Values.push_back(std::make_pair(V, 1U));
603 ValueID = Values.size();
607 void ValueEnumerator::EnumerateType(Type *Ty) {
608 unsigned *TypeID = &TypeMap[Ty];
610 // We've already seen this type.
614 // If it is a non-anonymous struct, mark the type as being visited so that we
615 // don't recursively visit it. This is safe because we allow forward
616 // references of these in the bitcode reader.
617 if (StructType *STy = dyn_cast<StructType>(Ty))
618 if (!STy->isLiteral())
621 // Enumerate all of the subtypes before we enumerate this type. This ensures
622 // that the type will be enumerated in an order that can be directly built.
623 for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end();
627 // Refresh the TypeID pointer in case the table rehashed.
628 TypeID = &TypeMap[Ty];
630 // Check to see if we got the pointer another way. This can happen when
631 // enumerating recursive types that hit the base case deeper than they start.
633 // If this is actually a struct that we are treating as forward ref'able,
634 // then emit the definition now that all of its contents are available.
635 if (*TypeID && *TypeID != ~0U)
638 // Add this type now that its contents are all happily enumerated.
641 *TypeID = Types.size();
644 // Enumerate the types for the specified value. If the value is a constant,
645 // walk through it, enumerating the types of the constant.
646 void ValueEnumerator::EnumerateOperandType(const Value *V) {
647 EnumerateType(V->getType());
649 if (const Constant *C = dyn_cast<Constant>(V)) {
650 // If this constant is already enumerated, ignore it, we know its type must
652 if (ValueMap.count(V)) return;
654 // This constant may have operands, make sure to enumerate the types in
656 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
657 const Value *Op = C->getOperand(i);
659 // Don't enumerate basic blocks here, this happens as operands to
661 if (isa<BasicBlock>(Op)) continue;
663 EnumerateOperandType(Op);
666 if (const MDNode *N = dyn_cast<MDNode>(V)) {
667 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
668 if (Value *Elem = N->getOperand(i))
669 EnumerateOperandType(Elem);
671 } else if (isa<MDString>(V) || isa<MDNode>(V))
672 EnumerateMetadata(V);
675 void ValueEnumerator::EnumerateAttributes(AttributeSet PAL) {
676 if (PAL.isEmpty()) return; // null is always 0.
679 unsigned &Entry = AttributeMap[PAL];
681 // Never saw this before, add it.
682 Attribute.push_back(PAL);
683 Entry = Attribute.size();
686 // Do lookups for all attribute groups.
687 for (unsigned i = 0, e = PAL.getNumSlots(); i != e; ++i) {
688 AttributeSet AS = PAL.getSlotAttributes(i);
689 unsigned &Entry = AttributeGroupMap[AS];
691 AttributeGroups.push_back(AS);
692 Entry = AttributeGroups.size();
697 void ValueEnumerator::incorporateFunction(const Function &F) {
698 InstructionCount = 0;
699 NumModuleValues = Values.size();
700 NumModuleMDValues = MDValues.size();
702 // Adding function arguments to the value table.
703 for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end();
707 FirstFuncConstantID = Values.size();
709 // Add all function-level constants to the value table.
710 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
711 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I)
712 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
714 if ((isa<Constant>(*OI) && !isa<GlobalValue>(*OI)) ||
718 BasicBlocks.push_back(BB);
719 ValueMap[BB] = BasicBlocks.size();
722 // Optimize the constant layout.
723 OptimizeConstants(FirstFuncConstantID, Values.size());
725 // Add the function's parameter attributes so they are available for use in
726 // the function's instruction.
727 EnumerateAttributes(F.getAttributes());
729 FirstInstID = Values.size();
731 SmallVector<MDNode *, 8> FnLocalMDVector;
732 // Add all of the instructions.
733 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
734 for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) {
735 for (User::const_op_iterator OI = I->op_begin(), E = I->op_end();
737 if (MDNode *MD = dyn_cast<MDNode>(*OI))
738 if (MD->isFunctionLocal() && MD->getFunction())
739 // Enumerate metadata after the instructions they might refer to.
740 FnLocalMDVector.push_back(MD);
743 SmallVector<std::pair<unsigned, MDNode*>, 8> MDs;
744 I->getAllMetadataOtherThanDebugLoc(MDs);
745 for (unsigned i = 0, e = MDs.size(); i != e; ++i) {
746 MDNode *N = MDs[i].second;
747 if (N->isFunctionLocal() && N->getFunction())
748 FnLocalMDVector.push_back(N);
751 if (!I->getType()->isVoidTy())
756 // Add all of the function-local metadata.
757 for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i)
758 EnumerateFunctionLocalMetadata(FnLocalMDVector[i]);
761 void ValueEnumerator::purgeFunction() {
762 /// Remove purged values from the ValueMap.
763 for (unsigned i = NumModuleValues, e = Values.size(); i != e; ++i)
764 ValueMap.erase(Values[i].first);
765 for (unsigned i = NumModuleMDValues, e = MDValues.size(); i != e; ++i)
766 MDValueMap.erase(MDValues[i].first);
767 for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i)
768 ValueMap.erase(BasicBlocks[i]);
770 Values.resize(NumModuleValues);
771 MDValues.resize(NumModuleMDValues);
773 FunctionLocalMDs.clear();
776 static void IncorporateFunctionInfoGlobalBBIDs(const Function *F,
777 DenseMap<const BasicBlock*, unsigned> &IDMap) {
778 unsigned Counter = 0;
779 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
780 IDMap[BB] = ++Counter;
783 /// getGlobalBasicBlockID - This returns the function-specific ID for the
784 /// specified basic block. This is relatively expensive information, so it
785 /// should only be used by rare constructs such as address-of-label.
786 unsigned ValueEnumerator::getGlobalBasicBlockID(const BasicBlock *BB) const {
787 unsigned &Idx = GlobalBasicBlockIDs[BB];
791 IncorporateFunctionInfoGlobalBBIDs(BB->getParent(), GlobalBasicBlockIDs);
792 return getGlobalBasicBlockID(BB);