blob: 5a00aae7e8a292f02dbdf19a5d13bc53cc85d0cf [file] [log] [blame]
Rafael Espindolacaabe222015-12-10 14:19:35 +00001//===- lib/Linker/IRMover.cpp ---------------------------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
10#include "llvm/Linker/IRMover.h"
11#include "LinkDiagnosticInfo.h"
12#include "llvm/ADT/SetVector.h"
13#include "llvm/ADT/SmallString.h"
14#include "llvm/ADT/Triple.h"
15#include "llvm/IR/Constants.h"
Teresa Johnson0e7c82c2015-12-18 17:51:37 +000016#include "llvm/IR/DebugInfo.h"
Rafael Espindolacaabe222015-12-10 14:19:35 +000017#include "llvm/IR/DiagnosticPrinter.h"
Teresa Johnsone5a61912015-12-17 17:14:09 +000018#include "llvm/IR/GVMaterializer.h"
Artur Pilipenko6c7a8ab2016-06-24 15:10:29 +000019#include "llvm/IR/Intrinsics.h"
Rafael Espindolacaabe222015-12-10 14:19:35 +000020#include "llvm/IR/TypeFinder.h"
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +000021#include "llvm/Support/Error.h"
Rafael Espindolacaabe222015-12-10 14:19:35 +000022#include "llvm/Transforms/Utils/Cloning.h"
Benjamin Kramer82de7d32016-05-27 14:27:24 +000023#include <utility>
Rafael Espindolacaabe222015-12-10 14:19:35 +000024using namespace llvm;
25
26//===----------------------------------------------------------------------===//
27// TypeMap implementation.
28//===----------------------------------------------------------------------===//
29
30namespace {
31class TypeMapTy : public ValueMapTypeRemapper {
32 /// This is a mapping from a source type to a destination type to use.
33 DenseMap<Type *, Type *> MappedTypes;
34
35 /// When checking to see if two subgraphs are isomorphic, we speculatively
36 /// add types to MappedTypes, but keep track of them here in case we need to
37 /// roll back.
38 SmallVector<Type *, 16> SpeculativeTypes;
39
40 SmallVector<StructType *, 16> SpeculativeDstOpaqueTypes;
41
42 /// This is a list of non-opaque structs in the source module that are mapped
43 /// to an opaque struct in the destination module.
44 SmallVector<StructType *, 16> SrcDefinitionsToResolve;
45
46 /// This is the set of opaque types in the destination modules who are
47 /// getting a body from the source module.
48 SmallPtrSet<StructType *, 16> DstResolvedOpaqueTypes;
49
50public:
51 TypeMapTy(IRMover::IdentifiedStructTypeSet &DstStructTypesSet)
52 : DstStructTypesSet(DstStructTypesSet) {}
53
54 IRMover::IdentifiedStructTypeSet &DstStructTypesSet;
55 /// Indicate that the specified type in the destination module is conceptually
56 /// equivalent to the specified type in the source module.
57 void addTypeMapping(Type *DstTy, Type *SrcTy);
58
59 /// Produce a body for an opaque type in the dest module from a type
60 /// definition in the source module.
61 void linkDefinedTypeBodies();
62
63 /// Return the mapped type to use for the specified input type from the
64 /// source module.
65 Type *get(Type *SrcTy);
66 Type *get(Type *SrcTy, SmallPtrSet<StructType *, 8> &Visited);
67
68 void finishType(StructType *DTy, StructType *STy, ArrayRef<Type *> ETypes);
69
70 FunctionType *get(FunctionType *T) {
71 return cast<FunctionType>(get((Type *)T));
72 }
73
74private:
75 Type *remapType(Type *SrcTy) override { return get(SrcTy); }
76
77 bool areTypesIsomorphic(Type *DstTy, Type *SrcTy);
78};
79}
80
81void TypeMapTy::addTypeMapping(Type *DstTy, Type *SrcTy) {
82 assert(SpeculativeTypes.empty());
83 assert(SpeculativeDstOpaqueTypes.empty());
84
85 // Check to see if these types are recursively isomorphic and establish a
86 // mapping between them if so.
87 if (!areTypesIsomorphic(DstTy, SrcTy)) {
88 // Oops, they aren't isomorphic. Just discard this request by rolling out
89 // any speculative mappings we've established.
90 for (Type *Ty : SpeculativeTypes)
91 MappedTypes.erase(Ty);
92
93 SrcDefinitionsToResolve.resize(SrcDefinitionsToResolve.size() -
94 SpeculativeDstOpaqueTypes.size());
95 for (StructType *Ty : SpeculativeDstOpaqueTypes)
96 DstResolvedOpaqueTypes.erase(Ty);
97 } else {
98 for (Type *Ty : SpeculativeTypes)
99 if (auto *STy = dyn_cast<StructType>(Ty))
100 if (STy->hasName())
101 STy->setName("");
102 }
103 SpeculativeTypes.clear();
104 SpeculativeDstOpaqueTypes.clear();
105}
106
107/// Recursively walk this pair of types, returning true if they are isomorphic,
108/// false if they are not.
109bool TypeMapTy::areTypesIsomorphic(Type *DstTy, Type *SrcTy) {
110 // Two types with differing kinds are clearly not isomorphic.
111 if (DstTy->getTypeID() != SrcTy->getTypeID())
112 return false;
113
114 // If we have an entry in the MappedTypes table, then we have our answer.
115 Type *&Entry = MappedTypes[SrcTy];
116 if (Entry)
117 return Entry == DstTy;
118
119 // Two identical types are clearly isomorphic. Remember this
120 // non-speculatively.
121 if (DstTy == SrcTy) {
122 Entry = DstTy;
123 return true;
124 }
125
126 // Okay, we have two types with identical kinds that we haven't seen before.
127
128 // If this is an opaque struct type, special case it.
129 if (StructType *SSTy = dyn_cast<StructType>(SrcTy)) {
130 // Mapping an opaque type to any struct, just keep the dest struct.
131 if (SSTy->isOpaque()) {
132 Entry = DstTy;
133 SpeculativeTypes.push_back(SrcTy);
134 return true;
135 }
136
137 // Mapping a non-opaque source type to an opaque dest. If this is the first
138 // type that we're mapping onto this destination type then we succeed. Keep
139 // the dest, but fill it in later. If this is the second (different) type
140 // that we're trying to map onto the same opaque type then we fail.
141 if (cast<StructType>(DstTy)->isOpaque()) {
142 // We can only map one source type onto the opaque destination type.
143 if (!DstResolvedOpaqueTypes.insert(cast<StructType>(DstTy)).second)
144 return false;
145 SrcDefinitionsToResolve.push_back(SSTy);
146 SpeculativeTypes.push_back(SrcTy);
147 SpeculativeDstOpaqueTypes.push_back(cast<StructType>(DstTy));
148 Entry = DstTy;
149 return true;
150 }
151 }
152
153 // If the number of subtypes disagree between the two types, then we fail.
154 if (SrcTy->getNumContainedTypes() != DstTy->getNumContainedTypes())
155 return false;
156
157 // Fail if any of the extra properties (e.g. array size) of the type disagree.
158 if (isa<IntegerType>(DstTy))
159 return false; // bitwidth disagrees.
160 if (PointerType *PT = dyn_cast<PointerType>(DstTy)) {
161 if (PT->getAddressSpace() != cast<PointerType>(SrcTy)->getAddressSpace())
162 return false;
163
164 } else if (FunctionType *FT = dyn_cast<FunctionType>(DstTy)) {
165 if (FT->isVarArg() != cast<FunctionType>(SrcTy)->isVarArg())
166 return false;
167 } else if (StructType *DSTy = dyn_cast<StructType>(DstTy)) {
168 StructType *SSTy = cast<StructType>(SrcTy);
169 if (DSTy->isLiteral() != SSTy->isLiteral() ||
170 DSTy->isPacked() != SSTy->isPacked())
171 return false;
172 } else if (ArrayType *DATy = dyn_cast<ArrayType>(DstTy)) {
173 if (DATy->getNumElements() != cast<ArrayType>(SrcTy)->getNumElements())
174 return false;
175 } else if (VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
176 if (DVTy->getNumElements() != cast<VectorType>(SrcTy)->getNumElements())
177 return false;
178 }
179
180 // Otherwise, we speculate that these two types will line up and recursively
181 // check the subelements.
182 Entry = DstTy;
183 SpeculativeTypes.push_back(SrcTy);
184
185 for (unsigned I = 0, E = SrcTy->getNumContainedTypes(); I != E; ++I)
186 if (!areTypesIsomorphic(DstTy->getContainedType(I),
187 SrcTy->getContainedType(I)))
188 return false;
189
190 // If everything seems to have lined up, then everything is great.
191 return true;
192}
193
194void TypeMapTy::linkDefinedTypeBodies() {
195 SmallVector<Type *, 16> Elements;
196 for (StructType *SrcSTy : SrcDefinitionsToResolve) {
197 StructType *DstSTy = cast<StructType>(MappedTypes[SrcSTy]);
198 assert(DstSTy->isOpaque());
199
200 // Map the body of the source type over to a new body for the dest type.
201 Elements.resize(SrcSTy->getNumElements());
202 for (unsigned I = 0, E = Elements.size(); I != E; ++I)
203 Elements[I] = get(SrcSTy->getElementType(I));
204
205 DstSTy->setBody(Elements, SrcSTy->isPacked());
206 DstStructTypesSet.switchToNonOpaque(DstSTy);
207 }
208 SrcDefinitionsToResolve.clear();
209 DstResolvedOpaqueTypes.clear();
210}
211
212void TypeMapTy::finishType(StructType *DTy, StructType *STy,
213 ArrayRef<Type *> ETypes) {
214 DTy->setBody(ETypes, STy->isPacked());
215
216 // Steal STy's name.
217 if (STy->hasName()) {
218 SmallString<16> TmpName = STy->getName();
219 STy->setName("");
220 DTy->setName(TmpName);
221 }
222
223 DstStructTypesSet.addNonOpaque(DTy);
224}
225
226Type *TypeMapTy::get(Type *Ty) {
227 SmallPtrSet<StructType *, 8> Visited;
228 return get(Ty, Visited);
229}
230
231Type *TypeMapTy::get(Type *Ty, SmallPtrSet<StructType *, 8> &Visited) {
232 // If we already have an entry for this type, return it.
233 Type **Entry = &MappedTypes[Ty];
234 if (*Entry)
235 return *Entry;
236
237 // These are types that LLVM itself will unique.
238 bool IsUniqued = !isa<StructType>(Ty) || cast<StructType>(Ty)->isLiteral();
239
240#ifndef NDEBUG
241 if (!IsUniqued) {
242 for (auto &Pair : MappedTypes) {
243 assert(!(Pair.first != Ty && Pair.second == Ty) &&
244 "mapping to a source type");
245 }
246 }
247#endif
248
249 if (!IsUniqued && !Visited.insert(cast<StructType>(Ty)).second) {
250 StructType *DTy = StructType::create(Ty->getContext());
251 return *Entry = DTy;
252 }
253
254 // If this is not a recursive type, then just map all of the elements and
255 // then rebuild the type from inside out.
256 SmallVector<Type *, 4> ElementTypes;
257
258 // If there are no element types to map, then the type is itself. This is
259 // true for the anonymous {} struct, things like 'float', integers, etc.
260 if (Ty->getNumContainedTypes() == 0 && IsUniqued)
261 return *Entry = Ty;
262
263 // Remap all of the elements, keeping track of whether any of them change.
264 bool AnyChange = false;
265 ElementTypes.resize(Ty->getNumContainedTypes());
266 for (unsigned I = 0, E = Ty->getNumContainedTypes(); I != E; ++I) {
267 ElementTypes[I] = get(Ty->getContainedType(I), Visited);
268 AnyChange |= ElementTypes[I] != Ty->getContainedType(I);
269 }
270
271 // If we found our type while recursively processing stuff, just use it.
272 Entry = &MappedTypes[Ty];
273 if (*Entry) {
274 if (auto *DTy = dyn_cast<StructType>(*Entry)) {
275 if (DTy->isOpaque()) {
276 auto *STy = cast<StructType>(Ty);
277 finishType(DTy, STy, ElementTypes);
278 }
279 }
280 return *Entry;
281 }
282
283 // If all of the element types mapped directly over and the type is not
284 // a nomed struct, then the type is usable as-is.
285 if (!AnyChange && IsUniqued)
286 return *Entry = Ty;
287
288 // Otherwise, rebuild a modified type.
289 switch (Ty->getTypeID()) {
290 default:
291 llvm_unreachable("unknown derived type to remap");
292 case Type::ArrayTyID:
293 return *Entry = ArrayType::get(ElementTypes[0],
294 cast<ArrayType>(Ty)->getNumElements());
295 case Type::VectorTyID:
296 return *Entry = VectorType::get(ElementTypes[0],
297 cast<VectorType>(Ty)->getNumElements());
298 case Type::PointerTyID:
299 return *Entry = PointerType::get(ElementTypes[0],
300 cast<PointerType>(Ty)->getAddressSpace());
301 case Type::FunctionTyID:
302 return *Entry = FunctionType::get(ElementTypes[0],
303 makeArrayRef(ElementTypes).slice(1),
304 cast<FunctionType>(Ty)->isVarArg());
305 case Type::StructTyID: {
306 auto *STy = cast<StructType>(Ty);
307 bool IsPacked = STy->isPacked();
308 if (IsUniqued)
309 return *Entry = StructType::get(Ty->getContext(), ElementTypes, IsPacked);
310
311 // If the type is opaque, we can just use it directly.
312 if (STy->isOpaque()) {
313 DstStructTypesSet.addOpaque(STy);
314 return *Entry = Ty;
315 }
316
317 if (StructType *OldT =
318 DstStructTypesSet.findNonOpaque(ElementTypes, IsPacked)) {
319 STy->setName("");
320 return *Entry = OldT;
321 }
322
323 if (!AnyChange) {
324 DstStructTypesSet.addNonOpaque(STy);
325 return *Entry = Ty;
326 }
327
328 StructType *DTy = StructType::create(Ty->getContext());
329 finishType(DTy, STy, ElementTypes);
330 return *Entry = DTy;
331 }
332 }
333}
334
335LinkDiagnosticInfo::LinkDiagnosticInfo(DiagnosticSeverity Severity,
336 const Twine &Msg)
337 : DiagnosticInfo(DK_Linker, Severity), Msg(Msg) {}
338void LinkDiagnosticInfo::print(DiagnosticPrinter &DP) const { DP << Msg; }
339
340//===----------------------------------------------------------------------===//
Teresa Johnsonbef54362015-12-18 19:28:59 +0000341// IRLinker implementation.
Rafael Espindolacaabe222015-12-10 14:19:35 +0000342//===----------------------------------------------------------------------===//
343
344namespace {
345class IRLinker;
346
347/// Creates prototypes for functions that are lazily linked on the fly. This
348/// speeds up linking for modules with many/ lazily linked functions of which
349/// few get used.
350class GlobalValueMaterializer final : public ValueMaterializer {
Mehdi Amini33661072016-03-11 22:19:06 +0000351 IRLinker &TheIRLinker;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000352
353public:
Mehdi Amini33661072016-03-11 22:19:06 +0000354 GlobalValueMaterializer(IRLinker &TheIRLinker) : TheIRLinker(TheIRLinker) {}
Mehdi Aminicc8c1072016-05-25 21:03:21 +0000355 Value *materialize(Value *V) override;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000356};
357
358class LocalValueMaterializer final : public ValueMaterializer {
Mehdi Amini33661072016-03-11 22:19:06 +0000359 IRLinker &TheIRLinker;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000360
361public:
Mehdi Amini33661072016-03-11 22:19:06 +0000362 LocalValueMaterializer(IRLinker &TheIRLinker) : TheIRLinker(TheIRLinker) {}
Mehdi Aminicc8c1072016-05-25 21:03:21 +0000363 Value *materialize(Value *V) override;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000364};
365
Duncan P. N. Exon Smith565a0aa2016-04-17 23:30:31 +0000366/// Type of the Metadata map in \a ValueToValueMapTy.
367typedef DenseMap<const Metadata *, TrackingMDRef> MDMapT;
368
Rafael Espindolacaabe222015-12-10 14:19:35 +0000369/// This is responsible for keeping track of the state used for moving data
370/// from SrcM to DstM.
371class IRLinker {
372 Module &DstM;
Rafael Espindola40358fb2016-02-16 18:50:12 +0000373 std::unique_ptr<Module> SrcM;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000374
Mehdi Amini33661072016-03-11 22:19:06 +0000375 /// See IRMover::move().
Rafael Espindolacaabe222015-12-10 14:19:35 +0000376 std::function<void(GlobalValue &, IRMover::ValueAdder)> AddLazyFor;
377
378 TypeMapTy TypeMap;
379 GlobalValueMaterializer GValMaterializer;
380 LocalValueMaterializer LValMaterializer;
381
Duncan P. N. Exon Smith565a0aa2016-04-17 23:30:31 +0000382 /// A metadata map that's shared between IRLinker instances.
383 MDMapT &SharedMDs;
384
Rafael Espindolacaabe222015-12-10 14:19:35 +0000385 /// Mapping of values from what they used to be in Src, to what they are now
386 /// in DstM. ValueToValueMapTy is a ValueMap, which involves some overhead
387 /// due to the use of Value handles which the Linker doesn't actually need,
388 /// but this allows us to reuse the ValueMapper code.
389 ValueToValueMapTy ValueMap;
390 ValueToValueMapTy AliasValueMap;
391
392 DenseSet<GlobalValue *> ValuesToLink;
393 std::vector<GlobalValue *> Worklist;
394
395 void maybeAdd(GlobalValue *GV) {
396 if (ValuesToLink.insert(GV).second)
397 Worklist.push_back(GV);
398 }
399
Rafael Espindolacaabe222015-12-10 14:19:35 +0000400 /// Set to true when all global value body linking is complete (including
401 /// lazy linking). Used to prevent metadata linking from creating new
402 /// references.
403 bool DoneLinkingBodies = false;
404
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000405 /// The Error encountered during materialization. We use an Optional here to
406 /// avoid needing to manage an unconsumed success value.
407 Optional<Error> FoundError;
408 void setError(Error E) {
409 if (E)
410 FoundError = std::move(E);
411 }
412
413 /// Most of the errors produced by this module are inconvertible StringErrors.
414 /// This convenience function lets us return one of those more easily.
415 Error stringErr(const Twine &T) {
416 return make_error<StringError>(T, inconvertibleErrorCode());
417 }
Rafael Espindolacaabe222015-12-10 14:19:35 +0000418
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000419 /// Entry point for mapping values and alternate context for mapping aliases.
420 ValueMapper Mapper;
421 unsigned AliasMCID;
Teresa Johnsone5a61912015-12-17 17:14:09 +0000422
Rafael Espindolacaabe222015-12-10 14:19:35 +0000423 /// Handles cloning of a global values from the source module into
424 /// the destination module, including setting the attributes and visibility.
425 GlobalValue *copyGlobalValueProto(const GlobalValue *SGV, bool ForDefinition);
426
Rafael Espindolacaabe222015-12-10 14:19:35 +0000427 void emitWarning(const Twine &Message) {
Rafael Espindola40358fb2016-02-16 18:50:12 +0000428 SrcM->getContext().diagnose(LinkDiagnosticInfo(DS_Warning, Message));
Rafael Espindolacaabe222015-12-10 14:19:35 +0000429 }
430
431 /// Given a global in the source module, return the global in the
432 /// destination module that is being linked to, if any.
433 GlobalValue *getLinkedToGlobal(const GlobalValue *SrcGV) {
434 // If the source has no name it can't link. If it has local linkage,
435 // there is no name match-up going on.
436 if (!SrcGV->hasName() || SrcGV->hasLocalLinkage())
437 return nullptr;
438
439 // Otherwise see if we have a match in the destination module's symtab.
440 GlobalValue *DGV = DstM.getNamedValue(SrcGV->getName());
441 if (!DGV)
442 return nullptr;
443
444 // If we found a global with the same name in the dest module, but it has
445 // internal linkage, we are really not doing any linkage here.
446 if (DGV->hasLocalLinkage())
447 return nullptr;
448
449 // Otherwise, we do in fact link to the destination global.
450 return DGV;
451 }
452
453 void computeTypeMapping();
454
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000455 Expected<Constant *> linkAppendingVarProto(GlobalVariable *DstGV,
456 const GlobalVariable *SrcGV);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000457
Mehdi Amini33661072016-03-11 22:19:06 +0000458 /// Given the GlobaValue \p SGV in the source module, and the matching
459 /// GlobalValue \p DGV (if any), return true if the linker will pull \p SGV
460 /// into the destination module.
461 ///
462 /// Note this code may call the client-provided \p AddLazyFor.
Rafael Espindolacaabe222015-12-10 14:19:35 +0000463 bool shouldLink(GlobalValue *DGV, GlobalValue &SGV);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000464 Expected<Constant *> linkGlobalValueProto(GlobalValue *GV, bool ForAlias);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000465
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000466 Error linkModuleFlagsMetadata();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000467
Peter Collingbourned4135bb2016-09-13 01:12:59 +0000468 void linkGlobalVariable(GlobalVariable &Dst, GlobalVariable &Src);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000469 Error linkFunctionBody(Function &Dst, Function &Src);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000470 void linkAliasBody(GlobalAlias &Dst, GlobalAlias &Src);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000471 Error linkGlobalValueBody(GlobalValue &Dst, GlobalValue &Src);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000472
473 /// Functions that take care of cloning a specific global value type
474 /// into the destination module.
475 GlobalVariable *copyGlobalVariableProto(const GlobalVariable *SGVar);
476 Function *copyFunctionProto(const Function *SF);
477 GlobalValue *copyGlobalAliasProto(const GlobalAlias *SGA);
478
479 void linkNamedMDNodes();
480
481public:
Duncan P. N. Exon Smith565a0aa2016-04-17 23:30:31 +0000482 IRLinker(Module &DstM, MDMapT &SharedMDs,
483 IRMover::IdentifiedStructTypeSet &Set, std::unique_ptr<Module> SrcM,
484 ArrayRef<GlobalValue *> ValuesToLink,
Teresa Johnsonb703c772016-03-29 18:24:19 +0000485 std::function<void(GlobalValue &, IRMover::ValueAdder)> AddLazyFor)
Benjamin Kramer82de7d32016-05-27 14:27:24 +0000486 : DstM(DstM), SrcM(std::move(SrcM)), AddLazyFor(std::move(AddLazyFor)),
487 TypeMap(Set), GValMaterializer(*this), LValMaterializer(*this),
488 SharedMDs(SharedMDs),
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000489 Mapper(ValueMap, RF_MoveDistinctMDs | RF_IgnoreMissingLocals, &TypeMap,
490 &GValMaterializer),
491 AliasMCID(Mapper.registerAlternateMappingContext(AliasValueMap,
492 &LValMaterializer)) {
Duncan P. N. Exon Smitha4810fa2016-04-19 16:57:24 +0000493 ValueMap.getMDMap() = std::move(SharedMDs);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000494 for (GlobalValue *GV : ValuesToLink)
495 maybeAdd(GV);
Teresa Johnsoncc428572015-12-30 19:32:24 +0000496 }
Duncan P. N. Exon Smitha4810fa2016-04-19 16:57:24 +0000497 ~IRLinker() { SharedMDs = std::move(*ValueMap.getMDMap()); }
Teresa Johnsoncc428572015-12-30 19:32:24 +0000498
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000499 Error run();
Mehdi Amini53a66722016-05-25 21:01:51 +0000500 Value *materialize(Value *V, bool ForAlias);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000501};
502}
503
504/// The LLVM SymbolTable class autorenames globals that conflict in the symbol
505/// table. This is good for all clients except for us. Go through the trouble
506/// to force this back.
507static void forceRenaming(GlobalValue *GV, StringRef Name) {
508 // If the global doesn't force its name or if it already has the right name,
509 // there is nothing for us to do.
510 if (GV->hasLocalLinkage() || GV->getName() == Name)
511 return;
512
513 Module *M = GV->getParent();
514
515 // If there is a conflict, rename the conflict.
516 if (GlobalValue *ConflictGV = M->getNamedValue(Name)) {
517 GV->takeName(ConflictGV);
518 ConflictGV->setName(Name); // This will cause ConflictGV to get renamed
519 assert(ConflictGV->getName() != Name && "forceRenaming didn't work");
520 } else {
521 GV->setName(Name); // Force the name back
522 }
523}
524
Mehdi Aminicc8c1072016-05-25 21:03:21 +0000525Value *GlobalValueMaterializer::materialize(Value *SGV) {
Mehdi Amini53a66722016-05-25 21:01:51 +0000526 return TheIRLinker.materialize(SGV, false);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000527}
528
Mehdi Aminicc8c1072016-05-25 21:03:21 +0000529Value *LocalValueMaterializer::materialize(Value *SGV) {
Mehdi Amini53a66722016-05-25 21:01:51 +0000530 return TheIRLinker.materialize(SGV, true);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000531}
532
Mehdi Amini53a66722016-05-25 21:01:51 +0000533Value *IRLinker::materialize(Value *V, bool ForAlias) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000534 auto *SGV = dyn_cast<GlobalValue>(V);
535 if (!SGV)
536 return nullptr;
537
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000538 Expected<Constant *> NewProto = linkGlobalValueProto(SGV, ForAlias);
539 if (!NewProto) {
540 setError(NewProto.takeError());
541 return nullptr;
542 }
543 if (!*NewProto)
544 return nullptr;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000545
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000546 GlobalValue *New = dyn_cast<GlobalValue>(*NewProto);
Mehdi Amini53a66722016-05-25 21:01:51 +0000547 if (!New)
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000548 return *NewProto;
Mehdi Amini53a66722016-05-25 21:01:51 +0000549
Rafael Espindolacaabe222015-12-10 14:19:35 +0000550 // If we already created the body, just return.
551 if (auto *F = dyn_cast<Function>(New)) {
552 if (!F->isDeclaration())
Mehdi Amini53a66722016-05-25 21:01:51 +0000553 return New;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000554 } else if (auto *V = dyn_cast<GlobalVariable>(New)) {
Duncan P. N. Exon Smith0fdaf8c2016-04-17 19:40:20 +0000555 if (V->hasInitializer() || V->hasAppendingLinkage())
Mehdi Amini53a66722016-05-25 21:01:51 +0000556 return New;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000557 } else {
558 auto *A = cast<GlobalAlias>(New);
559 if (A->getAliasee())
Mehdi Amini53a66722016-05-25 21:01:51 +0000560 return New;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000561 }
562
Mehdi Amini3d4f3a02016-05-25 21:00:44 +0000563 // When linking a global for an alias, it will always be linked. However we
564 // need to check if it was not already scheduled to satify a reference from a
565 // regular global value initializer. We know if it has been schedule if the
566 // "New" GlobalValue that is mapped here for the alias is the same as the one
567 // already mapped. If there is an entry in the ValueMap but the value is
568 // different, it means that the value already had a definition in the
569 // destination module (linkonce for instance), but we need a new definition
570 // for the alias ("New" will be different.
Mehdi Amini53a66722016-05-25 21:01:51 +0000571 if (ForAlias && ValueMap.lookup(SGV) == New)
572 return New;
Mehdi Amini3d4f3a02016-05-25 21:00:44 +0000573
Mehdi Amini53a66722016-05-25 21:01:51 +0000574 if (ForAlias || shouldLink(New, *SGV))
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000575 setError(linkGlobalValueBody(*New, *SGV));
Mehdi Amini53a66722016-05-25 21:01:51 +0000576
577 return New;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000578}
579
580/// Loop through the global variables in the src module and merge them into the
581/// dest module.
582GlobalVariable *IRLinker::copyGlobalVariableProto(const GlobalVariable *SGVar) {
583 // No linking to be performed or linking from the source: simply create an
584 // identical version of the symbol over in the dest module... the
585 // initializer will be filled in later by LinkGlobalInits.
586 GlobalVariable *NewDGV =
Manuel Jacob5f6eaac2016-01-16 20:30:46 +0000587 new GlobalVariable(DstM, TypeMap.get(SGVar->getValueType()),
Rafael Espindolacaabe222015-12-10 14:19:35 +0000588 SGVar->isConstant(), GlobalValue::ExternalLinkage,
589 /*init*/ nullptr, SGVar->getName(),
590 /*insertbefore*/ nullptr, SGVar->getThreadLocalMode(),
591 SGVar->getType()->getAddressSpace());
592 NewDGV->setAlignment(SGVar->getAlignment());
593 return NewDGV;
594}
595
596/// Link the function in the source module into the destination module if
597/// needed, setting up mapping information.
598Function *IRLinker::copyFunctionProto(const Function *SF) {
599 // If there is no linkage to be performed or we are linking from the source,
600 // bring SF over.
601 return Function::Create(TypeMap.get(SF->getFunctionType()),
602 GlobalValue::ExternalLinkage, SF->getName(), &DstM);
603}
604
605/// Set up prototypes for any aliases that come over from the source module.
606GlobalValue *IRLinker::copyGlobalAliasProto(const GlobalAlias *SGA) {
607 // If there is no linkage to be performed or we're linking from the source,
608 // bring over SGA.
609 auto *Ty = TypeMap.get(SGA->getValueType());
610 return GlobalAlias::create(Ty, SGA->getType()->getPointerAddressSpace(),
611 GlobalValue::ExternalLinkage, SGA->getName(),
612 &DstM);
613}
614
615GlobalValue *IRLinker::copyGlobalValueProto(const GlobalValue *SGV,
616 bool ForDefinition) {
617 GlobalValue *NewGV;
618 if (auto *SGVar = dyn_cast<GlobalVariable>(SGV)) {
619 NewGV = copyGlobalVariableProto(SGVar);
620 } else if (auto *SF = dyn_cast<Function>(SGV)) {
621 NewGV = copyFunctionProto(SF);
622 } else {
623 if (ForDefinition)
624 NewGV = copyGlobalAliasProto(cast<GlobalAlias>(SGV));
625 else
626 NewGV = new GlobalVariable(
Manuel Jacob5f6eaac2016-01-16 20:30:46 +0000627 DstM, TypeMap.get(SGV->getValueType()),
Rafael Espindolacaabe222015-12-10 14:19:35 +0000628 /*isConstant*/ false, GlobalValue::ExternalLinkage,
629 /*init*/ nullptr, SGV->getName(),
630 /*insertbefore*/ nullptr, SGV->getThreadLocalMode(),
631 SGV->getType()->getAddressSpace());
632 }
633
634 if (ForDefinition)
635 NewGV->setLinkage(SGV->getLinkage());
Mehdi Amini113adde2016-04-19 16:11:05 +0000636 else if (SGV->hasExternalWeakLinkage())
Rafael Espindolacaabe222015-12-10 14:19:35 +0000637 NewGV->setLinkage(GlobalValue::ExternalWeakLinkage);
638
639 NewGV->copyAttributesFrom(SGV);
Teresa Johnson5fe40052016-01-12 00:24:24 +0000640
Peter Collingbourne4f7c16d2016-06-24 17:42:21 +0000641 if (auto *NewGO = dyn_cast<GlobalObject>(NewGV)) {
642 // Metadata for global variables and function declarations is copied eagerly.
643 if (isa<GlobalVariable>(SGV) || SGV->isDeclaration())
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000644 NewGO->copyMetadata(cast<GlobalObject>(SGV), 0);
Peter Collingbourne4f7c16d2016-06-24 17:42:21 +0000645 }
646
Teresa Johnson5fe40052016-01-12 00:24:24 +0000647 // Remove these copied constants in case this stays a declaration, since
648 // they point to the source module. If the def is linked the values will
649 // be mapped in during linkFunctionBody.
650 if (auto *NewF = dyn_cast<Function>(NewGV)) {
651 NewF->setPersonalityFn(nullptr);
652 NewF->setPrefixData(nullptr);
653 NewF->setPrologueData(nullptr);
654 }
655
Rafael Espindolacaabe222015-12-10 14:19:35 +0000656 return NewGV;
657}
658
659/// Loop over all of the linked values to compute type mappings. For example,
660/// if we link "extern Foo *x" and "Foo *x = NULL", then we have two struct
661/// types 'Foo' but one got renamed when the module was loaded into the same
662/// LLVMContext.
663void IRLinker::computeTypeMapping() {
Rafael Espindola40358fb2016-02-16 18:50:12 +0000664 for (GlobalValue &SGV : SrcM->globals()) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000665 GlobalValue *DGV = getLinkedToGlobal(&SGV);
666 if (!DGV)
667 continue;
668
669 if (!DGV->hasAppendingLinkage() || !SGV.hasAppendingLinkage()) {
670 TypeMap.addTypeMapping(DGV->getType(), SGV.getType());
671 continue;
672 }
673
674 // Unify the element type of appending arrays.
Manuel Jacob5f6eaac2016-01-16 20:30:46 +0000675 ArrayType *DAT = cast<ArrayType>(DGV->getValueType());
676 ArrayType *SAT = cast<ArrayType>(SGV.getValueType());
Rafael Espindolacaabe222015-12-10 14:19:35 +0000677 TypeMap.addTypeMapping(DAT->getElementType(), SAT->getElementType());
678 }
679
Rafael Espindola40358fb2016-02-16 18:50:12 +0000680 for (GlobalValue &SGV : *SrcM)
Rafael Espindolacaabe222015-12-10 14:19:35 +0000681 if (GlobalValue *DGV = getLinkedToGlobal(&SGV))
682 TypeMap.addTypeMapping(DGV->getType(), SGV.getType());
683
Rafael Espindola40358fb2016-02-16 18:50:12 +0000684 for (GlobalValue &SGV : SrcM->aliases())
Rafael Espindolacaabe222015-12-10 14:19:35 +0000685 if (GlobalValue *DGV = getLinkedToGlobal(&SGV))
686 TypeMap.addTypeMapping(DGV->getType(), SGV.getType());
687
688 // Incorporate types by name, scanning all the types in the source module.
689 // At this point, the destination module may have a type "%foo = { i32 }" for
690 // example. When the source module got loaded into the same LLVMContext, if
691 // it had the same type, it would have been renamed to "%foo.42 = { i32 }".
Rafael Espindola40358fb2016-02-16 18:50:12 +0000692 std::vector<StructType *> Types = SrcM->getIdentifiedStructTypes();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000693 for (StructType *ST : Types) {
694 if (!ST->hasName())
695 continue;
696
697 // Check to see if there is a dot in the name followed by a digit.
698 size_t DotPos = ST->getName().rfind('.');
699 if (DotPos == 0 || DotPos == StringRef::npos ||
700 ST->getName().back() == '.' ||
701 !isdigit(static_cast<unsigned char>(ST->getName()[DotPos + 1])))
702 continue;
703
704 // Check to see if the destination module has a struct with the prefix name.
705 StructType *DST = DstM.getTypeByName(ST->getName().substr(0, DotPos));
706 if (!DST)
707 continue;
708
709 // Don't use it if this actually came from the source module. They're in
710 // the same LLVMContext after all. Also don't use it unless the type is
711 // actually used in the destination module. This can happen in situations
712 // like this:
713 //
714 // Module A Module B
715 // -------- --------
716 // %Z = type { %A } %B = type { %C.1 }
717 // %A = type { %B.1, [7 x i8] } %C.1 = type { i8* }
718 // %B.1 = type { %C } %A.2 = type { %B.3, [5 x i8] }
719 // %C = type { i8* } %B.3 = type { %C.1 }
720 //
721 // When we link Module B with Module A, the '%B' in Module B is
722 // used. However, that would then use '%C.1'. But when we process '%C.1',
723 // we prefer to take the '%C' version. So we are then left with both
724 // '%C.1' and '%C' being used for the same types. This leads to some
725 // variables using one type and some using the other.
726 if (TypeMap.DstStructTypesSet.hasType(DST))
727 TypeMap.addTypeMapping(DST, ST);
728 }
729
730 // Now that we have discovered all of the type equivalences, get a body for
731 // any 'opaque' types in the dest module that are now resolved.
732 TypeMap.linkDefinedTypeBodies();
733}
734
735static void getArrayElements(const Constant *C,
736 SmallVectorImpl<Constant *> &Dest) {
737 unsigned NumElements = cast<ArrayType>(C->getType())->getNumElements();
738
739 for (unsigned i = 0; i != NumElements; ++i)
740 Dest.push_back(C->getAggregateElement(i));
741}
742
743/// If there were any appending global variables, link them together now.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000744Expected<Constant *>
745IRLinker::linkAppendingVarProto(GlobalVariable *DstGV,
746 const GlobalVariable *SrcGV) {
Manuel Jacob5f6eaac2016-01-16 20:30:46 +0000747 Type *EltTy = cast<ArrayType>(TypeMap.get(SrcGV->getValueType()))
Rafael Espindolacaabe222015-12-10 14:19:35 +0000748 ->getElementType();
749
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000750 // FIXME: This upgrade is done during linking to support the C API. Once the
751 // old form is deprecated, we should move this upgrade to
752 // llvm::UpgradeGlobalVariable() and simplify the logic here and in
753 // Mapper::mapAppendingVariable() in ValueMapper.cpp.
Rafael Espindolacaabe222015-12-10 14:19:35 +0000754 StringRef Name = SrcGV->getName();
755 bool IsNewStructor = false;
756 bool IsOldStructor = false;
757 if (Name == "llvm.global_ctors" || Name == "llvm.global_dtors") {
758 if (cast<StructType>(EltTy)->getNumElements() == 3)
759 IsNewStructor = true;
760 else
761 IsOldStructor = true;
762 }
763
764 PointerType *VoidPtrTy = Type::getInt8Ty(SrcGV->getContext())->getPointerTo();
765 if (IsOldStructor) {
766 auto &ST = *cast<StructType>(EltTy);
767 Type *Tys[3] = {ST.getElementType(0), ST.getElementType(1), VoidPtrTy};
768 EltTy = StructType::get(SrcGV->getContext(), Tys, false);
769 }
770
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000771 uint64_t DstNumElements = 0;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000772 if (DstGV) {
Manuel Jacob5f6eaac2016-01-16 20:30:46 +0000773 ArrayType *DstTy = cast<ArrayType>(DstGV->getValueType());
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000774 DstNumElements = DstTy->getNumElements();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000775
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000776 if (!SrcGV->hasAppendingLinkage() || !DstGV->hasAppendingLinkage())
777 return stringErr(
Rafael Espindolacaabe222015-12-10 14:19:35 +0000778 "Linking globals named '" + SrcGV->getName() +
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000779 "': can only link appending global with another appending "
780 "global!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000781
782 // Check to see that they two arrays agree on type.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000783 if (EltTy != DstTy->getElementType())
784 return stringErr("Appending variables with different element types!");
785 if (DstGV->isConstant() != SrcGV->isConstant())
786 return stringErr("Appending variables linked with different const'ness!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000787
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000788 if (DstGV->getAlignment() != SrcGV->getAlignment())
789 return stringErr(
Rafael Espindolacaabe222015-12-10 14:19:35 +0000790 "Appending variables with different alignment need to be linked!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000791
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000792 if (DstGV->getVisibility() != SrcGV->getVisibility())
793 return stringErr(
Rafael Espindolacaabe222015-12-10 14:19:35 +0000794 "Appending variables with different visibility need to be linked!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000795
Peter Collingbourne96efdd62016-06-14 21:01:22 +0000796 if (DstGV->hasGlobalUnnamedAddr() != SrcGV->hasGlobalUnnamedAddr())
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000797 return stringErr(
Rafael Espindolacaabe222015-12-10 14:19:35 +0000798 "Appending variables with different unnamed_addr need to be linked!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000799
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000800 if (DstGV->getSection() != SrcGV->getSection())
801 return stringErr(
Rafael Espindolacaabe222015-12-10 14:19:35 +0000802 "Appending variables with different section name need to be linked!");
Rafael Espindolacaabe222015-12-10 14:19:35 +0000803 }
804
Rafael Espindolacaabe222015-12-10 14:19:35 +0000805 SmallVector<Constant *, 16> SrcElements;
806 getArrayElements(SrcGV->getInitializer(), SrcElements);
807
Justin Bogner375f71e2016-08-15 22:41:42 +0000808 if (IsNewStructor) {
809 auto It = remove_if(SrcElements, [this](Constant *E) {
810 auto *Key =
811 dyn_cast<GlobalValue>(E->getAggregateElement(2)->stripPointerCasts());
812 if (!Key)
813 return false;
814 GlobalValue *DGV = getLinkedToGlobal(Key);
815 return !shouldLink(DGV, *Key);
816 });
817 SrcElements.erase(It, SrcElements.end());
818 }
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000819 uint64_t NewSize = DstNumElements + SrcElements.size();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000820 ArrayType *NewType = ArrayType::get(EltTy, NewSize);
821
822 // Create the new global variable.
823 GlobalVariable *NG = new GlobalVariable(
824 DstM, NewType, SrcGV->isConstant(), SrcGV->getLinkage(),
825 /*init*/ nullptr, /*name*/ "", DstGV, SrcGV->getThreadLocalMode(),
826 SrcGV->getType()->getAddressSpace());
827
828 NG->copyAttributesFrom(SrcGV);
829 forceRenaming(NG, SrcGV->getName());
830
831 Constant *Ret = ConstantExpr::getBitCast(NG, TypeMap.get(SrcGV->getType()));
832
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000833 Mapper.scheduleMapAppendingVariable(*NG,
834 DstGV ? DstGV->getInitializer() : nullptr,
835 IsOldStructor, SrcElements);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000836
837 // Replace any uses of the two global variables with uses of the new
838 // global.
839 if (DstGV) {
840 DstGV->replaceAllUsesWith(ConstantExpr::getBitCast(NG, DstGV->getType()));
841 DstGV->eraseFromParent();
842 }
843
844 return Ret;
845}
846
Rafael Espindolacaabe222015-12-10 14:19:35 +0000847bool IRLinker::shouldLink(GlobalValue *DGV, GlobalValue &SGV) {
Davide Italiano95339652016-06-07 14:55:04 +0000848 if (ValuesToLink.count(&SGV) || SGV.hasLocalLinkage())
Rafael Espindolacaabe222015-12-10 14:19:35 +0000849 return true;
850
Rafael Espindola55a7ae52016-01-20 22:38:23 +0000851 if (DGV && !DGV->isDeclarationForLinker())
Rafael Espindolacaabe222015-12-10 14:19:35 +0000852 return false;
853
854 if (SGV.hasAvailableExternallyLinkage())
855 return true;
856
Davide Italiano95339652016-06-07 14:55:04 +0000857 if (SGV.isDeclaration() || DoneLinkingBodies)
Rafael Espindola15ca14c2016-04-21 14:56:33 +0000858 return false;
Mehdi Amini33661072016-03-11 22:19:06 +0000859
860 // Callback to the client to give a chance to lazily add the Global to the
861 // list of value to link.
862 bool LazilyAdded = false;
863 AddLazyFor(SGV, [this, &LazilyAdded](GlobalValue &GV) {
864 maybeAdd(&GV);
865 LazilyAdded = true;
866 });
867 return LazilyAdded;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000868}
869
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000870Expected<Constant *> IRLinker::linkGlobalValueProto(GlobalValue *SGV,
871 bool ForAlias) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000872 GlobalValue *DGV = getLinkedToGlobal(SGV);
873
874 bool ShouldLink = shouldLink(DGV, *SGV);
875
876 // just missing from map
877 if (ShouldLink) {
878 auto I = ValueMap.find(SGV);
879 if (I != ValueMap.end())
880 return cast<Constant>(I->second);
881
882 I = AliasValueMap.find(SGV);
883 if (I != AliasValueMap.end())
884 return cast<Constant>(I->second);
885 }
886
Mehdi Amini33661072016-03-11 22:19:06 +0000887 if (!ShouldLink && ForAlias)
888 DGV = nullptr;
Rafael Espindolacaabe222015-12-10 14:19:35 +0000889
890 // Handle the ultra special appending linkage case first.
891 assert(!DGV || SGV->hasAppendingLinkage() == DGV->hasAppendingLinkage());
892 if (SGV->hasAppendingLinkage())
893 return linkAppendingVarProto(cast_or_null<GlobalVariable>(DGV),
894 cast<GlobalVariable>(SGV));
895
896 GlobalValue *NewGV;
Rafael Espindola55a7ae52016-01-20 22:38:23 +0000897 if (DGV && !ShouldLink) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000898 NewGV = DGV;
899 } else {
900 // If we are done linking global value bodies (i.e. we are performing
901 // metadata linking), don't link in the global value due to this
902 // reference, simply map it to null.
903 if (DoneLinkingBodies)
904 return nullptr;
905
906 NewGV = copyGlobalValueProto(SGV, ShouldLink);
Evgeniy Stepanov9fb70f52016-01-20 22:05:50 +0000907 if (ShouldLink || !ForAlias)
Rafael Espindolacaabe222015-12-10 14:19:35 +0000908 forceRenaming(NewGV, SGV->getName());
909 }
Artur Pilipenko6c7a8ab2016-06-24 15:10:29 +0000910
911 // Overloaded intrinsics have overloaded types names as part of their
912 // names. If we renamed overloaded types we should rename the intrinsic
913 // as well.
914 if (Function *F = dyn_cast<Function>(NewGV))
915 if (auto Remangled = Intrinsic::remangleIntrinsicFunction(F))
916 NewGV = Remangled.getValue();
917
Rafael Espindolacaabe222015-12-10 14:19:35 +0000918 if (ShouldLink || ForAlias) {
919 if (const Comdat *SC = SGV->getComdat()) {
920 if (auto *GO = dyn_cast<GlobalObject>(NewGV)) {
921 Comdat *DC = DstM.getOrInsertComdat(SC->getName());
922 DC->setSelectionKind(SC->getSelectionKind());
923 GO->setComdat(DC);
924 }
925 }
926 }
927
928 if (!ShouldLink && ForAlias)
929 NewGV->setLinkage(GlobalValue::InternalLinkage);
930
931 Constant *C = NewGV;
932 if (DGV)
933 C = ConstantExpr::getBitCast(NewGV, TypeMap.get(SGV->getType()));
934
935 if (DGV && NewGV != DGV) {
936 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewGV, DGV->getType()));
937 DGV->eraseFromParent();
938 }
939
940 return C;
941}
942
943/// Update the initializers in the Dest module now that all globals that may be
944/// referenced are in Dest.
Peter Collingbourned4135bb2016-09-13 01:12:59 +0000945void IRLinker::linkGlobalVariable(GlobalVariable &Dst, GlobalVariable &Src) {
946 Dst.copyMetadata(&Src, 0);
947
Rafael Espindolacaabe222015-12-10 14:19:35 +0000948 // Figure out what the initializer looks like in the dest module.
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000949 Mapper.scheduleMapGlobalInitializer(Dst, *Src.getInitializer());
Rafael Espindolacaabe222015-12-10 14:19:35 +0000950}
951
952/// Copy the source function over into the dest function and fix up references
953/// to values. At this point we know that Dest is an external function, and
954/// that Src is not.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000955Error IRLinker::linkFunctionBody(Function &Dst, Function &Src) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000956 assert(Dst.isDeclaration() && !Src.isDeclaration());
957
958 // Materialize if needed.
959 if (std::error_code EC = Src.materialize())
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000960 return errorCodeToError(EC);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000961
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000962 // Link in the operands without remapping.
Rafael Espindolacaabe222015-12-10 14:19:35 +0000963 if (Src.hasPrefixData())
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000964 Dst.setPrefixData(Src.getPrefixData());
Rafael Espindolacaabe222015-12-10 14:19:35 +0000965 if (Src.hasPrologueData())
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000966 Dst.setPrologueData(Src.getPrologueData());
Rafael Espindolacaabe222015-12-10 14:19:35 +0000967 if (Src.hasPersonalityFn())
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000968 Dst.setPersonalityFn(Src.getPersonalityFn());
Rafael Espindolacaabe222015-12-10 14:19:35 +0000969
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000970 // Copy over the metadata attachments without remapping.
Peter Collingbourne7efd7502016-06-24 21:21:32 +0000971 Dst.copyMetadata(&Src, 0);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000972
Duncan P. N. Exon Smithbdfc9842016-04-06 06:38:15 +0000973 // Steal arguments and splice the body of Src into Dst.
974 Dst.stealArgumentListFrom(Src);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000975 Dst.getBasicBlockList().splice(Dst.end(), Src.getBasicBlockList());
976
Duncan P. N. Exon Smithbb2c3e12016-04-08 19:26:32 +0000977 // Everything has been moved over. Remap it.
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000978 Mapper.scheduleRemapFunction(Dst);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000979 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000980}
981
982void IRLinker::linkAliasBody(GlobalAlias &Dst, GlobalAlias &Src) {
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +0000983 Mapper.scheduleMapGlobalAliasee(Dst, *Src.getAliasee(), AliasMCID);
Rafael Espindolacaabe222015-12-10 14:19:35 +0000984}
985
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000986Error IRLinker::linkGlobalValueBody(GlobalValue &Dst, GlobalValue &Src) {
Rafael Espindolacaabe222015-12-10 14:19:35 +0000987 if (auto *F = dyn_cast<Function>(&Src))
988 return linkFunctionBody(cast<Function>(Dst), *F);
989 if (auto *GVar = dyn_cast<GlobalVariable>(&Src)) {
Peter Collingbourned4135bb2016-09-13 01:12:59 +0000990 linkGlobalVariable(cast<GlobalVariable>(Dst), *GVar);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000991 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000992 }
993 linkAliasBody(cast<GlobalAlias>(Dst), cast<GlobalAlias>(Src));
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +0000994 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +0000995}
996
997/// Insert all of the named MDNodes in Src into the Dest module.
998void IRLinker::linkNamedMDNodes() {
Rafael Espindola40358fb2016-02-16 18:50:12 +0000999 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata();
1000 for (const NamedMDNode &NMD : SrcM->named_metadata()) {
Rafael Espindolacaabe222015-12-10 14:19:35 +00001001 // Don't link module flags here. Do them separately.
1002 if (&NMD == SrcModFlags)
1003 continue;
1004 NamedMDNode *DestNMD = DstM.getOrInsertNamedMetadata(NMD.getName());
1005 // Add Src elements into Dest node.
Duncan P. N. Exon Smith8a15dab2016-04-15 23:32:44 +00001006 for (const MDNode *Op : NMD.operands())
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +00001007 DestNMD->addOperand(Mapper.mapMDNode(*Op));
Rafael Espindolacaabe222015-12-10 14:19:35 +00001008 }
1009}
1010
1011/// Merge the linker flags in Src into the Dest module.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001012Error IRLinker::linkModuleFlagsMetadata() {
Rafael Espindolacaabe222015-12-10 14:19:35 +00001013 // If the source module has no module flags, we are done.
Rafael Espindola40358fb2016-02-16 18:50:12 +00001014 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001015 if (!SrcModFlags)
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001016 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001017
1018 // If the destination module doesn't have module flags yet, then just copy
1019 // over the source module's flags.
1020 NamedMDNode *DstModFlags = DstM.getOrInsertModuleFlagsMetadata();
1021 if (DstModFlags->getNumOperands() == 0) {
1022 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I)
1023 DstModFlags->addOperand(SrcModFlags->getOperand(I));
1024
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001025 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001026 }
1027
1028 // First build a map of the existing module flags and requirements.
1029 DenseMap<MDString *, std::pair<MDNode *, unsigned>> Flags;
1030 SmallSetVector<MDNode *, 16> Requirements;
1031 for (unsigned I = 0, E = DstModFlags->getNumOperands(); I != E; ++I) {
1032 MDNode *Op = DstModFlags->getOperand(I);
1033 ConstantInt *Behavior = mdconst::extract<ConstantInt>(Op->getOperand(0));
1034 MDString *ID = cast<MDString>(Op->getOperand(1));
1035
1036 if (Behavior->getZExtValue() == Module::Require) {
1037 Requirements.insert(cast<MDNode>(Op->getOperand(2)));
1038 } else {
1039 Flags[ID] = std::make_pair(Op, I);
1040 }
1041 }
1042
1043 // Merge in the flags from the source module, and also collect its set of
1044 // requirements.
1045 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I) {
1046 MDNode *SrcOp = SrcModFlags->getOperand(I);
1047 ConstantInt *SrcBehavior =
1048 mdconst::extract<ConstantInt>(SrcOp->getOperand(0));
1049 MDString *ID = cast<MDString>(SrcOp->getOperand(1));
1050 MDNode *DstOp;
1051 unsigned DstIndex;
1052 std::tie(DstOp, DstIndex) = Flags.lookup(ID);
1053 unsigned SrcBehaviorValue = SrcBehavior->getZExtValue();
1054
1055 // If this is a requirement, add it and continue.
1056 if (SrcBehaviorValue == Module::Require) {
1057 // If the destination module does not already have this requirement, add
1058 // it.
1059 if (Requirements.insert(cast<MDNode>(SrcOp->getOperand(2)))) {
1060 DstModFlags->addOperand(SrcOp);
1061 }
1062 continue;
1063 }
1064
1065 // If there is no existing flag with this ID, just add it.
1066 if (!DstOp) {
1067 Flags[ID] = std::make_pair(SrcOp, DstModFlags->getNumOperands());
1068 DstModFlags->addOperand(SrcOp);
1069 continue;
1070 }
1071
1072 // Otherwise, perform a merge.
1073 ConstantInt *DstBehavior =
1074 mdconst::extract<ConstantInt>(DstOp->getOperand(0));
1075 unsigned DstBehaviorValue = DstBehavior->getZExtValue();
1076
1077 // If either flag has override behavior, handle it first.
1078 if (DstBehaviorValue == Module::Override) {
1079 // Diagnose inconsistent flags which both have override behavior.
1080 if (SrcBehaviorValue == Module::Override &&
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001081 SrcOp->getOperand(2) != DstOp->getOperand(2))
1082 return stringErr("linking module flags '" + ID->getString() +
1083 "': IDs have conflicting override values");
Rafael Espindolacaabe222015-12-10 14:19:35 +00001084 continue;
1085 } else if (SrcBehaviorValue == Module::Override) {
1086 // Update the destination flag to that of the source.
1087 DstModFlags->setOperand(DstIndex, SrcOp);
1088 Flags[ID].first = SrcOp;
1089 continue;
1090 }
1091
1092 // Diagnose inconsistent merge behavior types.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001093 if (SrcBehaviorValue != DstBehaviorValue)
1094 return stringErr("linking module flags '" + ID->getString() +
1095 "': IDs have conflicting behaviors");
Rafael Espindolacaabe222015-12-10 14:19:35 +00001096
1097 auto replaceDstValue = [&](MDNode *New) {
1098 Metadata *FlagOps[] = {DstOp->getOperand(0), ID, New};
1099 MDNode *Flag = MDNode::get(DstM.getContext(), FlagOps);
1100 DstModFlags->setOperand(DstIndex, Flag);
1101 Flags[ID].first = Flag;
1102 };
1103
1104 // Perform the merge for standard behavior types.
1105 switch (SrcBehaviorValue) {
1106 case Module::Require:
1107 case Module::Override:
1108 llvm_unreachable("not possible");
1109 case Module::Error: {
1110 // Emit an error if the values differ.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001111 if (SrcOp->getOperand(2) != DstOp->getOperand(2))
1112 return stringErr("linking module flags '" + ID->getString() +
1113 "': IDs have conflicting values");
Rafael Espindolacaabe222015-12-10 14:19:35 +00001114 continue;
1115 }
1116 case Module::Warning: {
1117 // Emit a warning if the values differ.
1118 if (SrcOp->getOperand(2) != DstOp->getOperand(2)) {
1119 emitWarning("linking module flags '" + ID->getString() +
1120 "': IDs have conflicting values");
1121 }
1122 continue;
1123 }
1124 case Module::Append: {
1125 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2));
1126 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2));
1127 SmallVector<Metadata *, 8> MDs;
1128 MDs.reserve(DstValue->getNumOperands() + SrcValue->getNumOperands());
1129 MDs.append(DstValue->op_begin(), DstValue->op_end());
1130 MDs.append(SrcValue->op_begin(), SrcValue->op_end());
1131
1132 replaceDstValue(MDNode::get(DstM.getContext(), MDs));
1133 break;
1134 }
1135 case Module::AppendUnique: {
1136 SmallSetVector<Metadata *, 16> Elts;
1137 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2));
1138 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2));
1139 Elts.insert(DstValue->op_begin(), DstValue->op_end());
1140 Elts.insert(SrcValue->op_begin(), SrcValue->op_end());
1141
1142 replaceDstValue(MDNode::get(DstM.getContext(),
1143 makeArrayRef(Elts.begin(), Elts.end())));
1144 break;
1145 }
1146 }
1147 }
1148
1149 // Check all of the requirements.
1150 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
1151 MDNode *Requirement = Requirements[I];
1152 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
1153 Metadata *ReqValue = Requirement->getOperand(1);
1154
1155 MDNode *Op = Flags[Flag].first;
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001156 if (!Op || Op->getOperand(2) != ReqValue)
1157 return stringErr("linking module flags '" + Flag->getString() +
1158 "': does not have the required value");
Rafael Espindolacaabe222015-12-10 14:19:35 +00001159 }
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001160 return Error::success();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001161}
1162
1163// This function returns true if the triples match.
1164static bool triplesMatch(const Triple &T0, const Triple &T1) {
1165 // If vendor is apple, ignore the version number.
1166 if (T0.getVendor() == Triple::Apple)
1167 return T0.getArch() == T1.getArch() && T0.getSubArch() == T1.getSubArch() &&
1168 T0.getVendor() == T1.getVendor() && T0.getOS() == T1.getOS();
1169
1170 return T0 == T1;
1171}
1172
1173// This function returns the merged triple.
1174static std::string mergeTriples(const Triple &SrcTriple,
1175 const Triple &DstTriple) {
1176 // If vendor is apple, pick the triple with the larger version number.
1177 if (SrcTriple.getVendor() == Triple::Apple)
1178 if (DstTriple.isOSVersionLT(SrcTriple))
1179 return SrcTriple.str();
1180
1181 return DstTriple.str();
1182}
1183
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001184Error IRLinker::run() {
Teresa Johnson0556e222016-03-10 18:47:03 +00001185 // Ensure metadata materialized before value mapping.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001186 if (SrcM->getMaterializer())
1187 if (std::error_code EC = SrcM->getMaterializer()->materializeMetadata())
1188 return errorCodeToError(EC);
Teresa Johnson0556e222016-03-10 18:47:03 +00001189
Rafael Espindolacaabe222015-12-10 14:19:35 +00001190 // Inherit the target data from the source module if the destination module
1191 // doesn't have one already.
1192 if (DstM.getDataLayout().isDefault())
Rafael Espindola40358fb2016-02-16 18:50:12 +00001193 DstM.setDataLayout(SrcM->getDataLayout());
Rafael Espindolacaabe222015-12-10 14:19:35 +00001194
Rafael Espindola40358fb2016-02-16 18:50:12 +00001195 if (SrcM->getDataLayout() != DstM.getDataLayout()) {
Rafael Espindolacaabe222015-12-10 14:19:35 +00001196 emitWarning("Linking two modules of different data layouts: '" +
Rafael Espindola40358fb2016-02-16 18:50:12 +00001197 SrcM->getModuleIdentifier() + "' is '" +
1198 SrcM->getDataLayoutStr() + "' whereas '" +
Rafael Espindolacaabe222015-12-10 14:19:35 +00001199 DstM.getModuleIdentifier() + "' is '" +
1200 DstM.getDataLayoutStr() + "'\n");
1201 }
1202
1203 // Copy the target triple from the source to dest if the dest's is empty.
Rafael Espindola40358fb2016-02-16 18:50:12 +00001204 if (DstM.getTargetTriple().empty() && !SrcM->getTargetTriple().empty())
1205 DstM.setTargetTriple(SrcM->getTargetTriple());
Rafael Espindolacaabe222015-12-10 14:19:35 +00001206
Rafael Espindola40358fb2016-02-16 18:50:12 +00001207 Triple SrcTriple(SrcM->getTargetTriple()), DstTriple(DstM.getTargetTriple());
Rafael Espindolacaabe222015-12-10 14:19:35 +00001208
Rafael Espindola40358fb2016-02-16 18:50:12 +00001209 if (!SrcM->getTargetTriple().empty() && !triplesMatch(SrcTriple, DstTriple))
Rafael Espindolacaabe222015-12-10 14:19:35 +00001210 emitWarning("Linking two modules of different target triples: " +
Rafael Espindola40358fb2016-02-16 18:50:12 +00001211 SrcM->getModuleIdentifier() + "' is '" +
1212 SrcM->getTargetTriple() + "' whereas '" +
1213 DstM.getModuleIdentifier() + "' is '" + DstM.getTargetTriple() +
1214 "'\n");
Rafael Espindolacaabe222015-12-10 14:19:35 +00001215
1216 DstM.setTargetTriple(mergeTriples(SrcTriple, DstTriple));
1217
1218 // Append the module inline asm string.
Rafael Espindola40358fb2016-02-16 18:50:12 +00001219 if (!SrcM->getModuleInlineAsm().empty()) {
Rafael Espindolacaabe222015-12-10 14:19:35 +00001220 if (DstM.getModuleInlineAsm().empty())
Rafael Espindola40358fb2016-02-16 18:50:12 +00001221 DstM.setModuleInlineAsm(SrcM->getModuleInlineAsm());
Rafael Espindolacaabe222015-12-10 14:19:35 +00001222 else
1223 DstM.setModuleInlineAsm(DstM.getModuleInlineAsm() + "\n" +
Rafael Espindola40358fb2016-02-16 18:50:12 +00001224 SrcM->getModuleInlineAsm());
Rafael Espindolacaabe222015-12-10 14:19:35 +00001225 }
1226
1227 // Loop over all of the linked values to compute type mappings.
1228 computeTypeMapping();
1229
1230 std::reverse(Worklist.begin(), Worklist.end());
1231 while (!Worklist.empty()) {
1232 GlobalValue *GV = Worklist.back();
1233 Worklist.pop_back();
1234
1235 // Already mapped.
1236 if (ValueMap.find(GV) != ValueMap.end() ||
1237 AliasValueMap.find(GV) != AliasValueMap.end())
1238 continue;
1239
1240 assert(!GV->isDeclaration());
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +00001241 Mapper.mapValue(*GV);
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001242 if (FoundError)
1243 return std::move(*FoundError);
Rafael Espindolacaabe222015-12-10 14:19:35 +00001244 }
1245
1246 // Note that we are done linking global value bodies. This prevents
1247 // metadata linking from creating new references.
1248 DoneLinkingBodies = true;
Duncan P. N. Exon Smith39423b02016-04-16 02:29:55 +00001249 Mapper.addFlags(RF_NullMapMissingGlobalValues);
Rafael Espindolacaabe222015-12-10 14:19:35 +00001250
1251 // Remap all of the named MDNodes in Src into the DstM module. We do this
1252 // after linking GlobalValues so that MDNodes that reference GlobalValues
1253 // are properly remapped.
Teresa Johnsonb703c772016-03-29 18:24:19 +00001254 linkNamedMDNodes();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001255
Teresa Johnsonb703c772016-03-29 18:24:19 +00001256 // Merge the module flags into the DstM module.
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001257 return linkModuleFlagsMetadata();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001258}
1259
1260IRMover::StructTypeKeyInfo::KeyTy::KeyTy(ArrayRef<Type *> E, bool P)
1261 : ETypes(E), IsPacked(P) {}
1262
1263IRMover::StructTypeKeyInfo::KeyTy::KeyTy(const StructType *ST)
1264 : ETypes(ST->elements()), IsPacked(ST->isPacked()) {}
1265
1266bool IRMover::StructTypeKeyInfo::KeyTy::operator==(const KeyTy &That) const {
Davide Italiano95339652016-06-07 14:55:04 +00001267 return IsPacked == That.IsPacked && ETypes == That.ETypes;
Rafael Espindolacaabe222015-12-10 14:19:35 +00001268}
1269
1270bool IRMover::StructTypeKeyInfo::KeyTy::operator!=(const KeyTy &That) const {
1271 return !this->operator==(That);
1272}
1273
1274StructType *IRMover::StructTypeKeyInfo::getEmptyKey() {
1275 return DenseMapInfo<StructType *>::getEmptyKey();
1276}
1277
1278StructType *IRMover::StructTypeKeyInfo::getTombstoneKey() {
1279 return DenseMapInfo<StructType *>::getTombstoneKey();
1280}
1281
1282unsigned IRMover::StructTypeKeyInfo::getHashValue(const KeyTy &Key) {
1283 return hash_combine(hash_combine_range(Key.ETypes.begin(), Key.ETypes.end()),
1284 Key.IsPacked);
1285}
1286
1287unsigned IRMover::StructTypeKeyInfo::getHashValue(const StructType *ST) {
1288 return getHashValue(KeyTy(ST));
1289}
1290
1291bool IRMover::StructTypeKeyInfo::isEqual(const KeyTy &LHS,
1292 const StructType *RHS) {
1293 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
1294 return false;
1295 return LHS == KeyTy(RHS);
1296}
1297
1298bool IRMover::StructTypeKeyInfo::isEqual(const StructType *LHS,
1299 const StructType *RHS) {
Davide Italiano95339652016-06-07 14:55:04 +00001300 if (RHS == getEmptyKey() || RHS == getTombstoneKey())
1301 return LHS == RHS;
Rafael Espindolacaabe222015-12-10 14:19:35 +00001302 return KeyTy(LHS) == KeyTy(RHS);
1303}
1304
1305void IRMover::IdentifiedStructTypeSet::addNonOpaque(StructType *Ty) {
1306 assert(!Ty->isOpaque());
1307 NonOpaqueStructTypes.insert(Ty);
1308}
1309
1310void IRMover::IdentifiedStructTypeSet::switchToNonOpaque(StructType *Ty) {
1311 assert(!Ty->isOpaque());
1312 NonOpaqueStructTypes.insert(Ty);
1313 bool Removed = OpaqueStructTypes.erase(Ty);
1314 (void)Removed;
1315 assert(Removed);
1316}
1317
1318void IRMover::IdentifiedStructTypeSet::addOpaque(StructType *Ty) {
1319 assert(Ty->isOpaque());
1320 OpaqueStructTypes.insert(Ty);
1321}
1322
1323StructType *
1324IRMover::IdentifiedStructTypeSet::findNonOpaque(ArrayRef<Type *> ETypes,
1325 bool IsPacked) {
1326 IRMover::StructTypeKeyInfo::KeyTy Key(ETypes, IsPacked);
1327 auto I = NonOpaqueStructTypes.find_as(Key);
Davide Italiano95339652016-06-07 14:55:04 +00001328 return I == NonOpaqueStructTypes.end() ? nullptr : *I;
Rafael Espindolacaabe222015-12-10 14:19:35 +00001329}
1330
1331bool IRMover::IdentifiedStructTypeSet::hasType(StructType *Ty) {
1332 if (Ty->isOpaque())
1333 return OpaqueStructTypes.count(Ty);
1334 auto I = NonOpaqueStructTypes.find(Ty);
Davide Italiano95339652016-06-07 14:55:04 +00001335 return I == NonOpaqueStructTypes.end() ? false : *I == Ty;
Rafael Espindolacaabe222015-12-10 14:19:35 +00001336}
1337
Rafael Espindola9d2bfc42015-12-14 23:17:03 +00001338IRMover::IRMover(Module &M) : Composite(M) {
Rafael Espindolacaabe222015-12-10 14:19:35 +00001339 TypeFinder StructTypes;
1340 StructTypes.run(M, true);
1341 for (StructType *Ty : StructTypes) {
1342 if (Ty->isOpaque())
1343 IdentifiedStructTypes.addOpaque(Ty);
1344 else
1345 IdentifiedStructTypes.addNonOpaque(Ty);
1346 }
Mehdi Aminiebb34342016-09-03 21:12:33 +00001347 // Self-map metadatas in the destination module. This is needed when
1348 // DebugTypeODRUniquing is enabled on the LLVMContext, since metadata in the
1349 // destination module may be reached from the source module.
1350 for (auto *MD : StructTypes.getVisitedMetadata()) {
1351 SharedMDs[MD].reset(const_cast<MDNode *>(MD));
1352 }
Rafael Espindolacaabe222015-12-10 14:19:35 +00001353}
1354
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001355Error IRMover::move(
Rafael Espindola40358fb2016-02-16 18:50:12 +00001356 std::unique_ptr<Module> Src, ArrayRef<GlobalValue *> ValuesToLink,
Teresa Johnsonb703c772016-03-29 18:24:19 +00001357 std::function<void(GlobalValue &, ValueAdder Add)> AddLazyFor) {
Duncan P. N. Exon Smith565a0aa2016-04-17 23:30:31 +00001358 IRLinker TheIRLinker(Composite, SharedMDs, IdentifiedStructTypes,
Benjamin Kramerd3f4c052016-06-12 16:13:55 +00001359 std::move(Src), ValuesToLink, std::move(AddLazyFor));
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001360 Error E = TheIRLinker.run();
Rafael Espindolacaabe222015-12-10 14:19:35 +00001361 Composite.dropTriviallyDeadConstantArrays();
Peter Collingbourne1eaa97f2016-05-27 05:21:35 +00001362 return E;
Rafael Espindolacaabe222015-12-10 14:19:35 +00001363}