blob: e7ccc8df1e5f8998a77bd1a17bee3bcb3852b8a6 [file] [log] [blame]
Chris Lattnerc1d10d62007-04-22 06:24:45 +00001//===-- Bitcode/Writer/ValueEnumerator.h - Number values --------*- C++ -*-===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Chris Lattnerc1d10d62007-04-22 06:24:45 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This class gives values and types Unique ID's.
11//
12//===----------------------------------------------------------------------===//
13
Benjamin Kramera7c40ef2014-08-13 16:26:38 +000014#ifndef LLVM_LIB_BITCODE_WRITER_VALUEENUMERATOR_H
15#define LLVM_LIB_BITCODE_WRITER_VALUEENUMERATOR_H
Chris Lattnerc1d10d62007-04-22 06:24:45 +000016
17#include "llvm/ADT/DenseMap.h"
David Majnemerdad0a642014-06-27 18:19:56 +000018#include "llvm/ADT/UniqueVector.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000019#include "llvm/IR/Attributes.h"
Benjamin Kramer391be792016-01-27 19:29:56 +000020#include "llvm/IR/Metadata.h"
Benjamin Kramer45275a42016-01-27 18:03:37 +000021#include "llvm/IR/Type.h"
Duncan P. N. Exon Smith1f66c852014-07-28 21:19:41 +000022#include "llvm/IR/UseListOrder.h"
Chris Lattnerc1d10d62007-04-22 06:24:45 +000023#include <vector>
24
25namespace llvm {
26
Chris Lattnerc1d10d62007-04-22 06:24:45 +000027class Type;
Chris Lattner7c37b012007-04-26 04:42:16 +000028class Value;
Devang Patelaf206b82009-09-18 19:26:43 +000029class Instruction;
Chris Lattner7c37b012007-04-26 04:42:16 +000030class BasicBlock;
David Majnemerdad0a642014-06-27 18:19:56 +000031class Comdat;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000032class Function;
Chris Lattner7c37b012007-04-26 04:42:16 +000033class Module;
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +000034class Metadata;
35class LocalAsMetadata;
Devang Pateldf84e8b2010-06-02 23:05:04 +000036class MDNode;
Duncan P. N. Exon Smithc1965312016-04-21 01:55:12 +000037class MDOperand;
Devang Patel99ff5a82010-01-09 00:30:14 +000038class NamedMDNode;
Reid Klecknerb5180542017-03-21 16:57:19 +000039class AttributeList;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000040class ValueSymbolTable;
Devang Patelfcfee0f2010-01-07 19:39:36 +000041class MDSymbolTable;
Chad Rosier78037a92011-12-07 20:44:46 +000042class raw_ostream;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000043
Benjamin Kramer079b96e2013-09-11 18:05:11 +000044class ValueEnumerator {
Chris Lattnerc1d10d62007-04-22 06:24:45 +000045public:
Chris Lattner229907c2011-07-18 04:54:35 +000046 typedef std::vector<Type*> TypeList;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000047
48 // For each value, we remember its Value* and occurrence frequency.
49 typedef std::vector<std::pair<const Value*, unsigned> > ValueList;
Duncan P. N. Exon Smith1f66c852014-07-28 21:19:41 +000050
Reid Klecknerb4a2d182017-04-24 20:38:30 +000051 /// Attribute groups as encoded in bitcode are almost AttributeSets, but they
52 /// include the AttributeList index, so we have to track that in our map.
53 typedef std::pair<unsigned, AttributeSet> IndexAndAttrSet;
54
Duncan P. N. Exon Smith1f66c852014-07-28 21:19:41 +000055 UseListOrderStack UseListOrders;
56
Chris Lattnerc1d10d62007-04-22 06:24:45 +000057private:
Chris Lattner229907c2011-07-18 04:54:35 +000058 typedef DenseMap<Type*, unsigned> TypeMapType;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000059 TypeMapType TypeMap;
Chris Lattner52523562007-04-24 00:16:04 +000060 TypeList Types;
Chris Lattnerc1d10d62007-04-22 06:24:45 +000061
Chris Lattnerc1d10d62007-04-22 06:24:45 +000062 typedef DenseMap<const Value*, unsigned> ValueMapType;
63 ValueMapType ValueMap;
Chris Lattner52523562007-04-24 00:16:04 +000064 ValueList Values;
David Majnemerdad0a642014-06-27 18:19:56 +000065
66 typedef UniqueVector<const Comdat *> ComdatSetType;
67 ComdatSetType Comdats;
68
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +000069 std::vector<const Metadata *> MDs;
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +000070 std::vector<const Metadata *> FunctionMDs;
71
72 /// Index of information about a piece of metadata.
73 struct MDIndex {
74 unsigned F = 0; ///< The ID of the function for this metadata, if any.
75 unsigned ID = 0; ///< The implicit ID of this metadata in bitcode.
76
77 MDIndex() = default;
78 explicit MDIndex(unsigned F) : F(F) {}
79
80 /// Check if this has a function tag, and it's different from NewF.
81 bool hasDifferentFunction(unsigned NewF) const { return F && F != NewF; }
82
83 /// Fetch the MD this references out of the given metadata array.
84 const Metadata *get(ArrayRef<const Metadata *> MDs) const {
85 assert(ID && "Expected non-zero ID");
86 assert(ID <= MDs.size() && "Expected valid ID");
87 return MDs[ID - 1];
88 }
89 };
Duncan P. N. Exon Smith9695eb32016-04-19 03:46:51 +000090
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +000091 typedef DenseMap<const Metadata *, MDIndex> MetadataMapType;
Teresa Johnson61b406e2015-12-29 23:00:22 +000092 MetadataMapType MetadataMap;
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +000093
94 /// Range of metadata IDs, as a half-open range.
95 struct MDRange {
96 unsigned First = 0;
97 unsigned Last = 0;
98
99 /// Number of strings in the prefix of the metadata range.
100 unsigned NumStrings = 0;
101
Dimitry Andric59e5cb42016-12-12 19:05:52 +0000102 MDRange() {}
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000103 explicit MDRange(unsigned First) : First(First) {}
104 };
105 SmallDenseMap<unsigned, MDRange, 1> FunctionMDInfo;
106
Duncan P. N. Exon Smith458593a2015-04-14 23:45:11 +0000107 bool ShouldPreserveUseListOrder;
Joe Abbey2ad8df22012-11-25 15:23:39 +0000108
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000109 typedef DenseMap<IndexAndAttrSet, unsigned> AttributeGroupMapType;
Bill Wendling92ed7002013-02-11 22:33:26 +0000110 AttributeGroupMapType AttributeGroupMap;
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000111 std::vector<IndexAndAttrSet> AttributeGroups;
Bill Wendling51f612e2013-02-10 23:06:02 +0000112
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000113 typedef DenseMap<AttributeList, unsigned> AttributeListMapType;
114 AttributeListMapType AttributeListMap;
115 std::vector<AttributeList> AttributeLists;
Joe Abbey2ad8df22012-11-25 15:23:39 +0000116
Chris Lattnerf540d742009-10-28 05:24:40 +0000117 /// GlobalBasicBlockIDs - This map memoizes the basic block ID's referenced by
118 /// the "getGlobalBasicBlockID" method.
119 mutable DenseMap<const BasicBlock*, unsigned> GlobalBasicBlockIDs;
Joe Abbey2ad8df22012-11-25 15:23:39 +0000120
Devang Patelaf206b82009-09-18 19:26:43 +0000121 typedef DenseMap<const Instruction*, unsigned> InstructionMapType;
122 InstructionMapType InstructionMap;
123 unsigned InstructionCount;
124
Chris Lattner7c37b012007-04-26 04:42:16 +0000125 /// BasicBlocks - This contains all the basic blocks for the currently
126 /// incorporated function. Their reverse mapping is stored in ValueMap.
127 std::vector<const BasicBlock*> BasicBlocks;
Joe Abbey2ad8df22012-11-25 15:23:39 +0000128
Chris Lattner5f640b92007-04-26 03:50:57 +0000129 /// When a function is incorporated, this is the size of the Values list
130 /// before incorporation.
Chris Lattnere6e364c2007-04-26 05:53:54 +0000131 unsigned NumModuleValues;
Dan Gohmanc828c542010-08-24 02:24:03 +0000132
Teresa Johnson61b406e2015-12-29 23:00:22 +0000133 /// When a function is incorporated, this is the size of the Metadatas list
Dan Gohmanc828c542010-08-24 02:24:03 +0000134 /// before incorporation.
Duncan P. N. Exon Smith93429112016-04-02 15:09:42 +0000135 unsigned NumModuleMDs = 0;
136 unsigned NumMDStrings = 0;
Dan Gohmanc828c542010-08-24 02:24:03 +0000137
Chris Lattnere6e364c2007-04-26 05:53:54 +0000138 unsigned FirstFuncConstantID;
139 unsigned FirstInstID;
Craig Toppera60c0f12012-09-15 17:09:36 +0000140
Aaron Ballmanf9a18972015-02-15 22:54:22 +0000141 ValueEnumerator(const ValueEnumerator &) = delete;
142 void operator=(const ValueEnumerator &) = delete;
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000143public:
Duncan P. N. Exon Smith458593a2015-04-14 23:45:11 +0000144 ValueEnumerator(const Module &M, bool ShouldPreserveUseListOrder);
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000145
Chad Rosier78037a92011-12-07 20:44:46 +0000146 void dump() const;
147 void print(raw_ostream &OS, const ValueMapType &Map, const char *Name) const;
Duncan P. N. Exon Smith5bf8fef2014-12-09 18:38:53 +0000148 void print(raw_ostream &OS, const MetadataMapType &Map,
149 const char *Name) const;
Chad Rosier78037a92011-12-07 20:44:46 +0000150
Devang Patel05eb6172009-08-04 06:00:18 +0000151 unsigned getValueID(const Value *V) const;
Duncan P. N. Exon Smith9a6f64e2015-01-20 01:00:23 +0000152 unsigned getMetadataID(const Metadata *MD) const {
153 auto ID = getMetadataOrNullID(MD);
154 assert(ID != 0 && "Metadata not in slotcalculator!");
155 return ID - 1;
156 }
157 unsigned getMetadataOrNullID(const Metadata *MD) const {
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000158 return MetadataMap.lookup(MD).ID;
Duncan P. N. Exon Smith9a6f64e2015-01-20 01:00:23 +0000159 }
Teresa Johnsond4d3dfd2015-11-20 14:51:27 +0000160 unsigned numMDs() const { return MDs.size(); }
Devang Patel05eb6172009-08-04 06:00:18 +0000161
Duncan P. N. Exon Smith458593a2015-04-14 23:45:11 +0000162 bool shouldPreserveUseListOrder() const { return ShouldPreserveUseListOrder; }
163
Chris Lattner229907c2011-07-18 04:54:35 +0000164 unsigned getTypeID(Type *T) const {
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000165 TypeMapType::const_iterator I = TypeMap.find(T);
166 assert(I != TypeMap.end() && "Type not in ValueEnumerator!");
167 return I->second-1;
168 }
Devang Patelaf206b82009-09-18 19:26:43 +0000169
170 unsigned getInstructionID(const Instruction *I) const;
171 void setInstructionID(const Instruction *I);
172
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000173 unsigned getAttributeListID(AttributeList PAL) const {
Chris Lattner8a923e72008-03-12 17:45:29 +0000174 if (PAL.isEmpty()) return 0; // Null maps to zero.
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000175 AttributeListMapType::const_iterator I = AttributeListMap.find(PAL);
176 assert(I != AttributeListMap.end() && "Attribute not in ValueEnumerator!");
Chris Lattnere4bbad62007-05-03 22:46:43 +0000177 return I->second;
178 }
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000179
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000180 unsigned getAttributeGroupID(IndexAndAttrSet Group) const {
181 if (!Group.second.hasAttributes())
182 return 0; // Null maps to zero.
183 AttributeGroupMapType::const_iterator I = AttributeGroupMap.find(Group);
Bill Wendling92ed7002013-02-11 22:33:26 +0000184 assert(I != AttributeGroupMap.end() && "Attribute not in ValueEnumerator!");
Bill Wendling51f612e2013-02-10 23:06:02 +0000185 return I->second;
186 }
187
Chris Lattnere6e364c2007-04-26 05:53:54 +0000188 /// getFunctionConstantRange - Return the range of values that corresponds to
189 /// function-local constants.
190 void getFunctionConstantRange(unsigned &Start, unsigned &End) const {
191 Start = FirstFuncConstantID;
192 End = FirstInstID;
193 }
Joe Abbey2ad8df22012-11-25 15:23:39 +0000194
Chris Lattner52523562007-04-24 00:16:04 +0000195 const ValueList &getValues() const { return Values; }
Duncan P. N. Exon Smith93429112016-04-02 15:09:42 +0000196
197 /// Check whether the current block has any metadata to emit.
198 bool hasMDs() const { return NumModuleMDs < MDs.size(); }
199
Duncan P. N. Exon Smith0b76b722016-04-02 15:16:56 +0000200 /// Get the MDString metadata for this block.
Duncan P. N. Exon Smith6565a0d2016-03-27 23:17:54 +0000201 ArrayRef<const Metadata *> getMDStrings() const {
Duncan P. N. Exon Smith93429112016-04-02 15:09:42 +0000202 return makeArrayRef(MDs).slice(NumModuleMDs, NumMDStrings);
Duncan P. N. Exon Smith6565a0d2016-03-27 23:17:54 +0000203 }
Duncan P. N. Exon Smith93429112016-04-02 15:09:42 +0000204
Duncan P. N. Exon Smith0b76b722016-04-02 15:16:56 +0000205 /// Get the non-MDString metadata for this block.
Duncan P. N. Exon Smith6565a0d2016-03-27 23:17:54 +0000206 ArrayRef<const Metadata *> getNonMDStrings() const {
Duncan P. N. Exon Smith93429112016-04-02 15:09:42 +0000207 return makeArrayRef(MDs).slice(NumModuleMDs).slice(NumMDStrings);
Devang Pateldf84e8b2010-06-02 23:05:04 +0000208 }
Duncan P. N. Exon Smith6565a0d2016-03-27 23:17:54 +0000209
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000210 const TypeList &getTypes() const { return Types; }
Chris Lattner7c37b012007-04-26 04:42:16 +0000211 const std::vector<const BasicBlock*> &getBasicBlocks() const {
Joe Abbey2ad8df22012-11-25 15:23:39 +0000212 return BasicBlocks;
Chris Lattner7c37b012007-04-26 04:42:16 +0000213 }
Reid Klecknerb4a2d182017-04-24 20:38:30 +0000214 const std::vector<AttributeList> &getAttributeLists() const { return AttributeLists; }
215 const std::vector<IndexAndAttrSet> &getAttributeGroups() const {
Bill Wendling92ed7002013-02-11 22:33:26 +0000216 return AttributeGroups;
Bill Wendling51f612e2013-02-10 23:06:02 +0000217 }
Joe Abbey2ad8df22012-11-25 15:23:39 +0000218
David Majnemerdad0a642014-06-27 18:19:56 +0000219 const ComdatSetType &getComdats() const { return Comdats; }
220 unsigned getComdatID(const Comdat *C) const;
221
Chris Lattnerf540d742009-10-28 05:24:40 +0000222 /// getGlobalBasicBlockID - This returns the function-specific ID for the
223 /// specified basic block. This is relatively expensive information, so it
224 /// should only be used by rare constructs such as address-of-label.
225 unsigned getGlobalBasicBlockID(const BasicBlock *BB) const;
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000226
Chad Rosier6a11b642011-06-03 17:02:19 +0000227 /// incorporateFunction/purgeFunction - If you'd like to deal with a function,
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000228 /// use these two methods to get its data into the ValueEnumerator!
229 ///
Chad Rosier6a11b642011-06-03 17:02:19 +0000230 void incorporateFunction(const Function &F);
231 void purgeFunction();
David Blaikie7b028102015-02-25 00:51:52 +0000232 uint64_t computeBitsRequiredForTypeIndicies() const;
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000233
234private:
Chris Lattner430e80d2007-05-04 05:21:47 +0000235 void OptimizeConstants(unsigned CstStart, unsigned CstEnd);
Joe Abbey2ad8df22012-11-25 15:23:39 +0000236
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000237 /// Reorder the reachable metadata.
238 ///
239 /// This is not just an optimization, but is mandatory for emitting MDString
240 /// correctly.
Duncan P. N. Exon Smith6565a0d2016-03-27 23:17:54 +0000241 void organizeMetadata();
242
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000243 /// Drop the function tag from the transitive operands of the given node.
Duncan P. N. Exon Smith9695eb32016-04-19 03:46:51 +0000244 void dropFunctionFromMetadata(MetadataMapType::value_type &FirstMD);
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000245
246 /// Incorporate the function metadata.
247 ///
248 /// This should be called before enumerating LocalAsMetadata for the
249 /// function.
250 void incorporateFunctionMetadata(const Function &F);
251
Duncan P. N. Exon Smith71480bd2016-04-22 02:33:06 +0000252 /// Enumerate a single instance of metadata with the given function tag.
253 ///
254 /// If \c MD has already been enumerated, check that \c F matches its
255 /// function tag. If not, call \a dropFunctionFromMetadata().
256 ///
257 /// Otherwise, mark \c MD as visited. Assign it an ID, or just return it if
258 /// it's an \a MDNode.
259 const MDNode *enumerateMetadataImpl(unsigned F, const Metadata *MD);
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000260
Peter Collingbourne21521892016-06-21 23:42:48 +0000261 unsigned getMetadataFunctionID(const Function *F) const;
Duncan P. N. Exon Smith30805b22016-04-23 04:59:22 +0000262
263 /// Enumerate reachable metadata in (almost) post-order.
264 ///
265 /// Enumerate all the metadata reachable from MD. We want to minimize the
266 /// cost of reading bitcode records, and so the primary consideration is that
267 /// operands of uniqued nodes are resolved before the nodes are read. This
268 /// avoids re-uniquing them on the context and factors away RAUW support.
269 ///
270 /// This algorithm guarantees that subgraphs of uniqued nodes are in
271 /// post-order. Distinct subgraphs reachable only from a single uniqued node
272 /// will be in post-order.
273 ///
274 /// \note The relative order of a distinct and uniqued node is irrelevant.
275 /// \a organizeMetadata() will later partition distinct nodes ahead of
276 /// uniqued ones.
277 ///{
Peter Collingbourne21521892016-06-21 23:42:48 +0000278 void EnumerateMetadata(const Function *F, const Metadata *MD);
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000279 void EnumerateMetadata(unsigned F, const Metadata *MD);
Duncan P. N. Exon Smith30805b22016-04-23 04:59:22 +0000280 ///}
281
Duncan P. N. Exon Smith520f8542016-04-02 15:22:57 +0000282 void EnumerateFunctionLocalMetadata(const Function &F,
283 const LocalAsMetadata *Local);
284 void EnumerateFunctionLocalMetadata(unsigned F, const LocalAsMetadata *Local);
Devang Patel99ff5a82010-01-09 00:30:14 +0000285 void EnumerateNamedMDNode(const NamedMDNode *NMD);
Victor Hernandez572218b2010-01-14 19:54:11 +0000286 void EnumerateValue(const Value *V);
Chris Lattner229907c2011-07-18 04:54:35 +0000287 void EnumerateType(Type *T);
Victor Hernandez572218b2010-01-14 19:54:11 +0000288 void EnumerateOperandType(const Value *V);
Reid Klecknerb5180542017-03-21 16:57:19 +0000289 void EnumerateAttributes(AttributeList PAL);
Joe Abbey2ad8df22012-11-25 15:23:39 +0000290
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000291 void EnumerateValueSymbolTable(const ValueSymbolTable &ST);
Rafael Espindola49e9bf82014-11-17 20:06:27 +0000292 void EnumerateNamedMetadata(const Module &M);
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000293};
294
Alexander Kornienkof00654e2015-06-23 09:49:53 +0000295} // End llvm namespace
Chris Lattnerc1d10d62007-04-22 06:24:45 +0000296
297#endif