ValueEnumerator.cpp revision 9207a2e495c8363606861e4f034504ec5c153dab
14cc499d6e5ec602309501873449c938af61170b2Stephen Hines//===-- ValueEnumerator.cpp - Number values and types for bitcode writer --===// 24cc499d6e5ec602309501873449c938af61170b2Stephen Hines// 34cc499d6e5ec602309501873449c938af61170b2Stephen Hines// The LLVM Compiler Infrastructure 44cc499d6e5ec602309501873449c938af61170b2Stephen Hines// 54cc499d6e5ec602309501873449c938af61170b2Stephen Hines// This file is distributed under the University of Illinois Open Source 64cc499d6e5ec602309501873449c938af61170b2Stephen Hines// License. See LICENSE.TXT for details. 74cc499d6e5ec602309501873449c938af61170b2Stephen Hines// 84cc499d6e5ec602309501873449c938af61170b2Stephen Hines//===----------------------------------------------------------------------===// 94cc499d6e5ec602309501873449c938af61170b2Stephen Hines// 104cc499d6e5ec602309501873449c938af61170b2Stephen Hines// This file implements the ValueEnumerator class. 114cc499d6e5ec602309501873449c938af61170b2Stephen Hines// 124cc499d6e5ec602309501873449c938af61170b2Stephen Hines//===----------------------------------------------------------------------===// 134cc499d6e5ec602309501873449c938af61170b2Stephen Hines 144cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "ValueEnumerator.h" 154cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/ADT/SmallPtrSet.h" 164cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/ADT/STLExtras.h" 174cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/Constants.h" 184cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/DerivedTypes.h" 194cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/Module.h" 204cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/ValueSymbolTable.h" 214cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include "llvm/Instructions.h" 224cc499d6e5ec602309501873449c938af61170b2Stephen Hines#include <algorithm> 234cc499d6e5ec602309501873449c938af61170b2Stephen Hinesusing namespace llvm; 244cc499d6e5ec602309501873449c938af61170b2Stephen Hines 254cc499d6e5ec602309501873449c938af61170b2Stephen Hinesstatic bool isIntegerValue(const std::pair<const Value*, unsigned> &V) { 264cc499d6e5ec602309501873449c938af61170b2Stephen Hines return V.first->getType()->isIntegerTy(); 274cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 284cc499d6e5ec602309501873449c938af61170b2Stephen Hines 294cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// ValueEnumerator - Enumerate module-level information. 304cc499d6e5ec602309501873449c938af61170b2Stephen HinesValueEnumerator::ValueEnumerator(const Module *M) { 314cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the global variables. 324cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_global_iterator I = M->global_begin(), 334cc499d6e5ec602309501873449c938af61170b2Stephen Hines E = M->global_end(); I != E; ++I) 344cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I); 354cc499d6e5ec602309501873449c938af61170b2Stephen Hines 364cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the functions. 374cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_iterator I = M->begin(), E = M->end(); I != E; ++I) { 384cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I); 394cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateAttributes(cast<Function>(I)->getAttributes()); 404cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 414cc499d6e5ec602309501873449c938af61170b2Stephen Hines 424cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the aliases. 434cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end(); 444cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 454cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I); 464cc499d6e5ec602309501873449c938af61170b2Stephen Hines 474cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Remember what is the cutoff between globalvalue's and other constants. 484cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned FirstConstant = Values.size(); 494cc499d6e5ec602309501873449c938af61170b2Stephen Hines 504cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the global variable initializers. 514cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_global_iterator I = M->global_begin(), 524cc499d6e5ec602309501873449c938af61170b2Stephen Hines E = M->global_end(); I != E; ++I) 534cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (I->hasInitializer()) 544cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I->getInitializer()); 554cc499d6e5ec602309501873449c938af61170b2Stephen Hines 564cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the aliasees. 574cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_alias_iterator I = M->alias_begin(), E = M->alias_end(); 584cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 594cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I->getAliasee()); 604cc499d6e5ec602309501873449c938af61170b2Stephen Hines 614cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Insert constants and metadata that are named at module level into the slot 624cc499d6e5ec602309501873449c938af61170b2Stephen Hines // pool so that the module symbol table can refer to them... 634cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValueSymbolTable(M->getValueSymbolTable()); 644cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateNamedMetadata(M); 654cc499d6e5ec602309501873449c938af61170b2Stephen Hines 664cc499d6e5ec602309501873449c938af61170b2Stephen Hines SmallVector<std::pair<unsigned, MDNode*>, 8> MDs; 674cc499d6e5ec602309501873449c938af61170b2Stephen Hines 684cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate types used by function bodies and argument lists. 694cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_iterator F = M->begin(), E = M->end(); F != E; ++F) { 704cc499d6e5ec602309501873449c938af61170b2Stephen Hines 714cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end(); 724cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 734cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(I->getType()); 744cc499d6e5ec602309501873449c938af61170b2Stephen Hines 754cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB) 764cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E;++I){ 774cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (User::const_op_iterator OI = I->op_begin(), E = I->op_end(); 784cc499d6e5ec602309501873449c938af61170b2Stephen Hines OI != E; ++OI) { 794cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MDNode *MD = dyn_cast<MDNode>(*OI)) 804cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MD->isFunctionLocal() && MD->getFunction()) 814cc499d6e5ec602309501873449c938af61170b2Stephen Hines // These will get enumerated during function-incorporation. 824cc499d6e5ec602309501873449c938af61170b2Stephen Hines continue; 834cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateOperandType(*OI); 844cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 854cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(I->getType()); 864cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (const CallInst *CI = dyn_cast<CallInst>(I)) 874cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateAttributes(CI->getAttributes()); 884cc499d6e5ec602309501873449c938af61170b2Stephen Hines else if (const InvokeInst *II = dyn_cast<InvokeInst>(I)) 894cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateAttributes(II->getAttributes()); 904cc499d6e5ec602309501873449c938af61170b2Stephen Hines 914cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate metadata attached with this instruction. 924cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDs.clear(); 934cc499d6e5ec602309501873449c938af61170b2Stephen Hines I->getAllMetadataOtherThanDebugLoc(MDs); 944cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = MDs.size(); i != e; ++i) 954cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMetadata(MDs[i].second); 964cc499d6e5ec602309501873449c938af61170b2Stephen Hines 974cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (!I->getDebugLoc().isUnknown()) { 984cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDNode *Scope, *IA; 994cc499d6e5ec602309501873449c938af61170b2Stephen Hines I->getDebugLoc().getScopeAndInlinedAt(Scope, IA, I->getContext()); 1004cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Scope) EnumerateMetadata(Scope); 1014cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (IA) EnumerateMetadata(IA); 1024cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 1034cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 1044cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 1054cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1064cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Optimize constant ordering. 1074cc499d6e5ec602309501873449c938af61170b2Stephen Hines OptimizeConstants(FirstConstant, Values.size()); 1084cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1094cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1104cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1114cc499d6e5ec602309501873449c938af61170b2Stephen Hinesunsigned ValueEnumerator::getInstructionID(const Instruction *Inst) const { 1124cc499d6e5ec602309501873449c938af61170b2Stephen Hines InstructionMapType::const_iterator I = InstructionMap.find(Inst); 1134cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(I != InstructionMap.end() && "Instruction is not mapped!"); 1144cc499d6e5ec602309501873449c938af61170b2Stephen Hines return I->second; 1154cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1164cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1174cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::setInstructionID(const Instruction *I) { 1184cc499d6e5ec602309501873449c938af61170b2Stephen Hines InstructionMap[I] = InstructionCount++; 1194cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1204cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1214cc499d6e5ec602309501873449c938af61170b2Stephen Hinesunsigned ValueEnumerator::getValueID(const Value *V) const { 1224cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (isa<MDNode>(V) || isa<MDString>(V)) { 1234cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMapType::const_iterator I = MDValueMap.find(V); 1244cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(I != MDValueMap.end() && "Value not in slotcalculator!"); 1254cc499d6e5ec602309501873449c938af61170b2Stephen Hines return I->second-1; 1264cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 1274cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1284cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMapType::const_iterator I = ValueMap.find(V); 1294cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(I != ValueMap.end() && "Value not in slotcalculator!"); 1304cc499d6e5ec602309501873449c938af61170b2Stephen Hines return I->second-1; 1314cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1324cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1334cc499d6e5ec602309501873449c938af61170b2Stephen Hines// Optimize constant ordering. 1344cc499d6e5ec602309501873449c938af61170b2Stephen Hinesnamespace { 1354cc499d6e5ec602309501873449c938af61170b2Stephen Hines struct CstSortPredicate { 1364cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueEnumerator &VE; 1374cc499d6e5ec602309501873449c938af61170b2Stephen Hines explicit CstSortPredicate(ValueEnumerator &ve) : VE(ve) {} 1384cc499d6e5ec602309501873449c938af61170b2Stephen Hines bool operator()(const std::pair<const Value*, unsigned> &LHS, 1394cc499d6e5ec602309501873449c938af61170b2Stephen Hines const std::pair<const Value*, unsigned> &RHS) { 1404cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Sort by plane. 1414cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (LHS.first->getType() != RHS.first->getType()) 1424cc499d6e5ec602309501873449c938af61170b2Stephen Hines return VE.getTypeID(LHS.first->getType()) < 1434cc499d6e5ec602309501873449c938af61170b2Stephen Hines VE.getTypeID(RHS.first->getType()); 1444cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Then by frequency. 1454cc499d6e5ec602309501873449c938af61170b2Stephen Hines return LHS.second > RHS.second; 1464cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 1474cc499d6e5ec602309501873449c938af61170b2Stephen Hines }; 1484cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1494cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1504cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// OptimizeConstants - Reorder constant pool for denser encoding. 1514cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::OptimizeConstants(unsigned CstStart, unsigned CstEnd) { 1524cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (CstStart == CstEnd || CstStart+1 == CstEnd) return; 1534cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1544cc499d6e5ec602309501873449c938af61170b2Stephen Hines CstSortPredicate P(*this); 1554cc499d6e5ec602309501873449c938af61170b2Stephen Hines std::stable_sort(Values.begin()+CstStart, Values.begin()+CstEnd, P); 1564cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1574cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Ensure that integer constants are at the start of the constant pool. This 1584cc499d6e5ec602309501873449c938af61170b2Stephen Hines // is important so that GEP structure indices come before gep constant exprs. 1594cc499d6e5ec602309501873449c938af61170b2Stephen Hines std::partition(Values.begin()+CstStart, Values.begin()+CstEnd, 1604cc499d6e5ec602309501873449c938af61170b2Stephen Hines isIntegerValue); 1614cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1624cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Rebuild the modified portion of ValueMap. 1634cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (; CstStart != CstEnd; ++CstStart) 1644cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMap[Values[CstStart].first] = CstStart+1; 1654cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1664cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1674cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1684cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// EnumerateValueSymbolTable - Insert all of the values in the specified symbol 1694cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// table into the values table. 1704cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateValueSymbolTable(const ValueSymbolTable &VST) { 1714cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (ValueSymbolTable::const_iterator VI = VST.begin(), VE = VST.end(); 1724cc499d6e5ec602309501873449c938af61170b2Stephen Hines VI != VE; ++VI) 1734cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(VI->getValue()); 1744cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1754cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1764cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// EnumerateNamedMetadata - Insert all of the values referenced by 1774cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// named metadata in the specified module. 1784cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateNamedMetadata(const Module *M) { 1794cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Module::const_named_metadata_iterator I = M->named_metadata_begin(), 1804cc499d6e5ec602309501873449c938af61170b2Stephen Hines E = M->named_metadata_end(); I != E; ++I) 1814cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateNamedMDNode(I); 1824cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1834cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1844cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateNamedMDNode(const NamedMDNode *MD) { 1854cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i) 1864cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMetadata(MD->getOperand(i)); 1874cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 1884cc499d6e5ec602309501873449c938af61170b2Stephen Hines 1894cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// EnumerateMDNodeOperands - Enumerate all non-function-local values 1904cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// and types referenced by the given MDNode. 1914cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateMDNodeOperands(const MDNode *N) { 1924cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) { 1934cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Value *V = N->getOperand(i)) { 1944cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (isa<MDNode>(V) || isa<MDString>(V)) 1954cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMetadata(V); 1964cc499d6e5ec602309501873449c938af61170b2Stephen Hines else if (!isa<Instruction>(V) && !isa<Argument>(V)) 1974cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(V); 1984cc499d6e5ec602309501873449c938af61170b2Stephen Hines } else 1994cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(Type::getVoidTy(N->getContext())); 2004cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2014cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 2024cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2034cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateMetadata(const Value *MD) { 2044cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert((isa<MDNode>(MD) || isa<MDString>(MD)) && "Invalid metadata kind"); 2054cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2064cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the type of this value. 2074cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(MD->getType()); 2084cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2094cc499d6e5ec602309501873449c938af61170b2Stephen Hines const MDNode *N = dyn_cast<MDNode>(MD); 2104cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2114cc499d6e5ec602309501873449c938af61170b2Stephen Hines // In the module-level pass, skip function-local nodes themselves, but 2124cc499d6e5ec602309501873449c938af61170b2Stephen Hines // do walk their operands. 2134cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (N && N->isFunctionLocal() && N->getFunction()) { 2144cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMDNodeOperands(N); 2154cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 2164cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2174cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2184cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Check to see if it's already in! 2194cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned &MDValueID = MDValueMap[MD]; 2204cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MDValueID) { 2214cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Increment use count. 2224cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValues[MDValueID-1].second++; 2234cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 2244cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2254cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValues.push_back(std::make_pair(MD, 1U)); 2264cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValueID = MDValues.size(); 2274cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2284cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate all non-function-local operands. 2294cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (N) 2304cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMDNodeOperands(N); 2314cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 2324cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2334cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// EnumerateFunctionLocalMetadataa - Incorporate function-local metadata 2344cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// information reachable from the given MDNode. 2354cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateFunctionLocalMetadata(const MDNode *N) { 2364cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(N->isFunctionLocal() && N->getFunction() && 2374cc499d6e5ec602309501873449c938af61170b2Stephen Hines "EnumerateFunctionLocalMetadata called on non-function-local mdnode!"); 2384cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2394cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the type of this value. 2404cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(N->getType()); 2414cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2424cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Check to see if it's already in! 2434cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned &MDValueID = MDValueMap[N]; 2444cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MDValueID) { 2454cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Increment use count. 2464cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValues[MDValueID-1].second++; 2474cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 2484cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2494cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValues.push_back(std::make_pair(N, 1U)); 2504cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValueID = MDValues.size(); 2514cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2524cc499d6e5ec602309501873449c938af61170b2Stephen Hines // To incoroporate function-local information visit all function-local 2534cc499d6e5ec602309501873449c938af61170b2Stephen Hines // MDNodes and all function-local values they reference. 2544cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 2554cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Value *V = N->getOperand(i)) { 2564cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MDNode *O = dyn_cast<MDNode>(V)) { 2574cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (O->isFunctionLocal() && O->getFunction()) 2584cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateFunctionLocalMetadata(O); 2594cc499d6e5ec602309501873449c938af61170b2Stephen Hines } else if (isa<Instruction>(V) || isa<Argument>(V)) 2604cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(V); 2614cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2624cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2634cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Also, collect all function-local MDNodes for easy access. 2644cc499d6e5ec602309501873449c938af61170b2Stephen Hines FunctionLocalMDs.push_back(N); 2654cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 2664cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2674cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateValue(const Value *V) { 2684cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(!V->getType()->isVoidTy() && "Can't insert void values!"); 2694cc499d6e5ec602309501873449c938af61170b2Stephen Hines assert(!isa<MDNode>(V) && !isa<MDString>(V) && 2704cc499d6e5ec602309501873449c938af61170b2Stephen Hines "EnumerateValue doesn't handle Metadata!"); 2714cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2724cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Check to see if it's already in! 2734cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned &ValueID = ValueMap[V]; 2744cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (ValueID) { 2754cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Increment use count. 2764cc499d6e5ec602309501873449c938af61170b2Stephen Hines Values[ValueID-1].second++; 2774cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 2784cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 2794cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2804cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate the type of this value. 2814cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(V->getType()); 2824cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2834cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (const Constant *C = dyn_cast<Constant>(V)) { 2844cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (isa<GlobalValue>(C)) { 2854cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Initializers for globals are handled explicitly elsewhere. 2864cc499d6e5ec602309501873449c938af61170b2Stephen Hines } else if (isa<ConstantArray>(C) && cast<ConstantArray>(C)->isString()) { 2874cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Do not enumerate the initializers for an array of simple characters. 2884cc499d6e5ec602309501873449c938af61170b2Stephen Hines // The initializers just pollute the value table, and we emit the strings 2894cc499d6e5ec602309501873449c938af61170b2Stephen Hines // specially. 2904cc499d6e5ec602309501873449c938af61170b2Stephen Hines } else if (C->getNumOperands()) { 2914cc499d6e5ec602309501873449c938af61170b2Stephen Hines // If a constant has operands, enumerate them. This makes sure that if a 2924cc499d6e5ec602309501873449c938af61170b2Stephen Hines // constant has uses (for example an array of const ints), that they are 2934cc499d6e5ec602309501873449c938af61170b2Stephen Hines // inserted also. 2944cc499d6e5ec602309501873449c938af61170b2Stephen Hines 2954cc499d6e5ec602309501873449c938af61170b2Stephen Hines // We prefer to enumerate them with values before we enumerate the user 2964cc499d6e5ec602309501873449c938af61170b2Stephen Hines // itself. This makes it more likely that we can avoid forward references 2974cc499d6e5ec602309501873449c938af61170b2Stephen Hines // in the reader. We know that there can be no cycles in the constants 2984cc499d6e5ec602309501873449c938af61170b2Stephen Hines // graph that don't go through a global variable. 2994cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (User::const_op_iterator I = C->op_begin(), E = C->op_end(); 3004cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 3014cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (!isa<BasicBlock>(*I)) // Don't enumerate BB operand to BlockAddress. 3024cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(*I); 3034cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3044cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Finally, add the value. Doing this could make the ValueID reference be 3054cc499d6e5ec602309501873449c938af61170b2Stephen Hines // dangling, don't reuse it. 3064cc499d6e5ec602309501873449c938af61170b2Stephen Hines Values.push_back(std::make_pair(V, 1U)); 3074cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMap[V] = Values.size(); 3084cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 3094cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 3104cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 3114cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3124cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add the value. 3134cc499d6e5ec602309501873449c938af61170b2Stephen Hines Values.push_back(std::make_pair(V, 1U)); 3144cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueID = Values.size(); 3154cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 3164cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3174cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3184cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateType(Type *Ty) { 3194cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned *TypeID = &TypeMap[Ty]; 3204cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3214cc499d6e5ec602309501873449c938af61170b2Stephen Hines // We've already seen this type. 3224cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (*TypeID) 3234cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 3244cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3254cc499d6e5ec602309501873449c938af61170b2Stephen Hines // If it is a non-anonymous struct, mark the type as being visited so that we 3264cc499d6e5ec602309501873449c938af61170b2Stephen Hines // don't recursively visit it. This is safe because we allow forward 3274cc499d6e5ec602309501873449c938af61170b2Stephen Hines // references of these in the bitcode reader. 3284cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (StructType *STy = dyn_cast<StructType>(Ty)) 3299207a2e495c8363606861e4f034504ec5c153dabLogan Chien if (!STy->isLiteral()) 3304cc499d6e5ec602309501873449c938af61170b2Stephen Hines *TypeID = ~0U; 3314cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3324cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate all of the subtypes before we enumerate this type. This ensures 3334cc499d6e5ec602309501873449c938af61170b2Stephen Hines // that the type will be enumerated in an order that can be directly built. 3344cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); 3354cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 3364cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(*I); 3374cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3384cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Refresh the TypeID pointer in case the table rehashed. 3394cc499d6e5ec602309501873449c938af61170b2Stephen Hines TypeID = &TypeMap[Ty]; 3404cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3414cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Check to see if we got the pointer another way. This can happen when 3424cc499d6e5ec602309501873449c938af61170b2Stephen Hines // enumerating recursive types that hit the base case deeper than they start. 3434cc499d6e5ec602309501873449c938af61170b2Stephen Hines // 3444cc499d6e5ec602309501873449c938af61170b2Stephen Hines // If this is actually a struct that we are treating as forward ref'able, 3454cc499d6e5ec602309501873449c938af61170b2Stephen Hines // then emit the definition now that all of its contents are available. 3464cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (*TypeID && *TypeID != ~0U) 3474cc499d6e5ec602309501873449c938af61170b2Stephen Hines return; 3484cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3494cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add this type now that its contents are all happily enumerated. 3504cc499d6e5ec602309501873449c938af61170b2Stephen Hines Types.push_back(Ty); 3514cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3524cc499d6e5ec602309501873449c938af61170b2Stephen Hines *TypeID = Types.size(); 3534cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 3544cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3554cc499d6e5ec602309501873449c938af61170b2Stephen Hines// Enumerate the types for the specified value. If the value is a constant, 3564cc499d6e5ec602309501873449c938af61170b2Stephen Hines// walk through it, enumerating the types of the constant. 3574cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateOperandType(const Value *V) { 3584cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateType(V->getType()); 3594cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3604cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (const Constant *C = dyn_cast<Constant>(V)) { 3614cc499d6e5ec602309501873449c938af61170b2Stephen Hines // If this constant is already enumerated, ignore it, we know its type must 3624cc499d6e5ec602309501873449c938af61170b2Stephen Hines // be enumerated. 3634cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (ValueMap.count(V)) return; 3644cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3654cc499d6e5ec602309501873449c938af61170b2Stephen Hines // This constant may have operands, make sure to enumerate the types in 3664cc499d6e5ec602309501873449c938af61170b2Stephen Hines // them. 3674cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) { 3684cc499d6e5ec602309501873449c938af61170b2Stephen Hines const Value *Op = C->getOperand(i); 3694cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3704cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Don't enumerate basic blocks here, this happens as operands to 3714cc499d6e5ec602309501873449c938af61170b2Stephen Hines // blockaddress. 3724cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (isa<BasicBlock>(Op)) continue; 3734cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3744cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateOperandType(Op); 3754cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 3764cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3774cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (const MDNode *N = dyn_cast<MDNode>(V)) { 3784cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 3794cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Value *Elem = N->getOperand(i)) 3804cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateOperandType(Elem); 3814cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 3824cc499d6e5ec602309501873449c938af61170b2Stephen Hines } else if (isa<MDString>(V) || isa<MDNode>(V)) 3834cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateMetadata(V); 3844cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 3854cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3864cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::EnumerateAttributes(const AttrListPtr &PAL) { 3874cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (PAL.isEmpty()) return; // null is always 0. 3884cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Do a lookup. 3894cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned &Entry = AttributeMap[PAL.getRawPointer()]; 3904cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Entry == 0) { 3914cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Never saw this before, add it. 3924cc499d6e5ec602309501873449c938af61170b2Stephen Hines Attributes.push_back(PAL); 3934cc499d6e5ec602309501873449c938af61170b2Stephen Hines Entry = Attributes.size(); 3944cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 3954cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 3964cc499d6e5ec602309501873449c938af61170b2Stephen Hines 3974cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::incorporateFunction(const Function &F) { 3984cc499d6e5ec602309501873449c938af61170b2Stephen Hines InstructionCount = 0; 3994cc499d6e5ec602309501873449c938af61170b2Stephen Hines NumModuleValues = Values.size(); 4004cc499d6e5ec602309501873449c938af61170b2Stephen Hines NumModuleMDValues = MDValues.size(); 4014cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4024cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Adding function arguments to the value table. 4034cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_arg_iterator I = F.arg_begin(), E = F.arg_end(); 4044cc499d6e5ec602309501873449c938af61170b2Stephen Hines I != E; ++I) 4054cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I); 4064cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4074cc499d6e5ec602309501873449c938af61170b2Stephen Hines FirstFuncConstantID = Values.size(); 4084cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4094cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add all function-level constants to the value table. 4104cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 4114cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) 4124cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (User::const_op_iterator OI = I->op_begin(), E = I->op_end(); 4134cc499d6e5ec602309501873449c938af61170b2Stephen Hines OI != E; ++OI) { 4144cc499d6e5ec602309501873449c938af61170b2Stephen Hines if ((isa<Constant>(*OI) && !isa<GlobalValue>(*OI)) || 4154cc499d6e5ec602309501873449c938af61170b2Stephen Hines isa<InlineAsm>(*OI)) 4164cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(*OI); 4174cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4184cc499d6e5ec602309501873449c938af61170b2Stephen Hines BasicBlocks.push_back(BB); 4194cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMap[BB] = BasicBlocks.size(); 4204cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4214cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4224cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Optimize the constant layout. 4234cc499d6e5ec602309501873449c938af61170b2Stephen Hines OptimizeConstants(FirstFuncConstantID, Values.size()); 4244cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4254cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add the function's parameter attributes so they are available for use in 4264cc499d6e5ec602309501873449c938af61170b2Stephen Hines // the function's instruction. 4274cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateAttributes(F.getAttributes()); 4284cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4294cc499d6e5ec602309501873449c938af61170b2Stephen Hines FirstInstID = Values.size(); 4304cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4314cc499d6e5ec602309501873449c938af61170b2Stephen Hines SmallVector<MDNode *, 8> FnLocalMDVector; 4324cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add all of the instructions. 4334cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB) { 4344cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (BasicBlock::const_iterator I = BB->begin(), E = BB->end(); I!=E; ++I) { 4354cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (User::const_op_iterator OI = I->op_begin(), E = I->op_end(); 4364cc499d6e5ec602309501873449c938af61170b2Stephen Hines OI != E; ++OI) { 4374cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MDNode *MD = dyn_cast<MDNode>(*OI)) 4384cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (MD->isFunctionLocal() && MD->getFunction()) 4394cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Enumerate metadata after the instructions they might refer to. 4404cc499d6e5ec602309501873449c938af61170b2Stephen Hines FnLocalMDVector.push_back(MD); 4414cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4424cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4434cc499d6e5ec602309501873449c938af61170b2Stephen Hines SmallVector<std::pair<unsigned, MDNode*>, 8> MDs; 4444cc499d6e5ec602309501873449c938af61170b2Stephen Hines I->getAllMetadataOtherThanDebugLoc(MDs); 4454cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = MDs.size(); i != e; ++i) { 4464cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDNode *N = MDs[i].second; 4474cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (N->isFunctionLocal() && N->getFunction()) 4484cc499d6e5ec602309501873449c938af61170b2Stephen Hines FnLocalMDVector.push_back(N); 4494cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4504cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4514cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (!I->getType()->isVoidTy()) 4524cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateValue(I); 4534cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4544cc499d6e5ec602309501873449c938af61170b2Stephen Hines } 4554cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4564cc499d6e5ec602309501873449c938af61170b2Stephen Hines // Add all of the function-local metadata. 4574cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i) 4584cc499d6e5ec602309501873449c938af61170b2Stephen Hines EnumerateFunctionLocalMetadata(FnLocalMDVector[i]); 4594cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 4604cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4614cc499d6e5ec602309501873449c938af61170b2Stephen Hinesvoid ValueEnumerator::purgeFunction() { 4624cc499d6e5ec602309501873449c938af61170b2Stephen Hines /// Remove purged values from the ValueMap. 4634cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = NumModuleValues, e = Values.size(); i != e; ++i) 4644cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMap.erase(Values[i].first); 4654cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = NumModuleMDValues, e = MDValues.size(); i != e; ++i) 4664cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValueMap.erase(MDValues[i].first); 4674cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (unsigned i = 0, e = BasicBlocks.size(); i != e; ++i) 4684cc499d6e5ec602309501873449c938af61170b2Stephen Hines ValueMap.erase(BasicBlocks[i]); 4694cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4704cc499d6e5ec602309501873449c938af61170b2Stephen Hines Values.resize(NumModuleValues); 4714cc499d6e5ec602309501873449c938af61170b2Stephen Hines MDValues.resize(NumModuleMDValues); 4724cc499d6e5ec602309501873449c938af61170b2Stephen Hines BasicBlocks.clear(); 4734cc499d6e5ec602309501873449c938af61170b2Stephen Hines FunctionLocalMDs.clear(); 4744cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 4754cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4764cc499d6e5ec602309501873449c938af61170b2Stephen Hinesstatic void IncorporateFunctionInfoGlobalBBIDs(const Function *F, 4774cc499d6e5ec602309501873449c938af61170b2Stephen Hines DenseMap<const BasicBlock*, unsigned> &IDMap) { 4784cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned Counter = 0; 4794cc499d6e5ec602309501873449c938af61170b2Stephen Hines for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB) 4804cc499d6e5ec602309501873449c938af61170b2Stephen Hines IDMap[BB] = ++Counter; 4814cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 4824cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4834cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// getGlobalBasicBlockID - This returns the function-specific ID for the 4844cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// specified basic block. This is relatively expensive information, so it 4854cc499d6e5ec602309501873449c938af61170b2Stephen Hines/// should only be used by rare constructs such as address-of-label. 4864cc499d6e5ec602309501873449c938af61170b2Stephen Hinesunsigned ValueEnumerator::getGlobalBasicBlockID(const BasicBlock *BB) const { 4874cc499d6e5ec602309501873449c938af61170b2Stephen Hines unsigned &Idx = GlobalBasicBlockIDs[BB]; 4884cc499d6e5ec602309501873449c938af61170b2Stephen Hines if (Idx != 0) 4894cc499d6e5ec602309501873449c938af61170b2Stephen Hines return Idx-1; 4904cc499d6e5ec602309501873449c938af61170b2Stephen Hines 4914cc499d6e5ec602309501873449c938af61170b2Stephen Hines IncorporateFunctionInfoGlobalBBIDs(BB->getParent(), GlobalBasicBlockIDs); 4924cc499d6e5ec602309501873449c938af61170b2Stephen Hines return getGlobalBasicBlockID(BB); 4934cc499d6e5ec602309501873449c938af61170b2Stephen Hines} 4944cc499d6e5ec602309501873449c938af61170b2Stephen Hines 495