1 //===- lib/Linker/LinkModules.cpp - Module Linker Implementation ----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the LLVM module linker.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Linker/Linker.h"
15 #include "llvm-c/Linker.h"
16 #include "llvm/ADT/Optional.h"
17 #include "llvm/ADT/SetVector.h"
18 #include "llvm/ADT/SmallString.h"
19 #include "llvm/IR/Constants.h"
20 #include "llvm/IR/Module.h"
21 #include "llvm/IR/TypeFinder.h"
22 #include "llvm/Support/CommandLine.h"
23 #include "llvm/Support/Debug.h"
24 #include "llvm/Support/raw_ostream.h"
25 #include "llvm/Transforms/Utils/Cloning.h"
30 //===----------------------------------------------------------------------===//
31 // TypeMap implementation.
32 //===----------------------------------------------------------------------===//
35 typedef SmallPtrSet<StructType*, 32> TypeSet;
37 class TypeMapTy : public ValueMapTypeRemapper {
38 /// MappedTypes - This is a mapping from a source type to a destination type
40 DenseMap<Type*, Type*> MappedTypes;
42 /// SpeculativeTypes - When checking to see if two subgraphs are isomorphic,
43 /// we speculatively add types to MappedTypes, but keep track of them here in
44 /// case we need to roll back.
45 SmallVector<Type*, 16> SpeculativeTypes;
47 /// SrcDefinitionsToResolve - This is a list of non-opaque structs in the
48 /// source module that are mapped to an opaque struct in the destination
50 SmallVector<StructType*, 16> SrcDefinitionsToResolve;
52 /// DstResolvedOpaqueTypes - This is the set of opaque types in the
53 /// destination modules who are getting a body from the source module.
54 SmallPtrSet<StructType*, 16> DstResolvedOpaqueTypes;
57 TypeMapTy(TypeSet &Set) : DstStructTypesSet(Set) {}
59 TypeSet &DstStructTypesSet;
60 /// addTypeMapping - Indicate that the specified type in the destination
61 /// module is conceptually equivalent to the specified type in the source
63 void addTypeMapping(Type *DstTy, Type *SrcTy);
65 /// linkDefinedTypeBodies - Produce a body for an opaque type in the dest
66 /// module from a type definition in the source module.
67 void linkDefinedTypeBodies();
69 /// get - Return the mapped type to use for the specified input type from the
71 Type *get(Type *SrcTy);
73 FunctionType *get(FunctionType *T) {return cast<FunctionType>(get((Type*)T));}
75 /// dump - Dump out the type map for debugging purposes.
77 for (DenseMap<Type*, Type*>::const_iterator
78 I = MappedTypes.begin(), E = MappedTypes.end(); I != E; ++I) {
79 dbgs() << "TypeMap: ";
88 Type *getImpl(Type *T);
89 /// remapType - Implement the ValueMapTypeRemapper interface.
90 Type *remapType(Type *SrcTy) override {
94 bool areTypesIsomorphic(Type *DstTy, Type *SrcTy);
98 void TypeMapTy::addTypeMapping(Type *DstTy, Type *SrcTy) {
99 Type *&Entry = MappedTypes[SrcTy];
102 if (DstTy == SrcTy) {
107 // Check to see if these types are recursively isomorphic and establish a
108 // mapping between them if so.
109 if (!areTypesIsomorphic(DstTy, SrcTy)) {
110 // Oops, they aren't isomorphic. Just discard this request by rolling out
111 // any speculative mappings we've established.
112 for (unsigned i = 0, e = SpeculativeTypes.size(); i != e; ++i)
113 MappedTypes.erase(SpeculativeTypes[i]);
115 SpeculativeTypes.clear();
118 /// areTypesIsomorphic - Recursively walk this pair of types, returning true
119 /// if they are isomorphic, false if they are not.
120 bool TypeMapTy::areTypesIsomorphic(Type *DstTy, Type *SrcTy) {
121 // Two types with differing kinds are clearly not isomorphic.
122 if (DstTy->getTypeID() != SrcTy->getTypeID()) return false;
124 // If we have an entry in the MappedTypes table, then we have our answer.
125 Type *&Entry = MappedTypes[SrcTy];
127 return Entry == DstTy;
129 // Two identical types are clearly isomorphic. Remember this
130 // non-speculatively.
131 if (DstTy == SrcTy) {
136 // Okay, we have two types with identical kinds that we haven't seen before.
138 // If this is an opaque struct type, special case it.
139 if (StructType *SSTy = dyn_cast<StructType>(SrcTy)) {
140 // Mapping an opaque type to any struct, just keep the dest struct.
141 if (SSTy->isOpaque()) {
143 SpeculativeTypes.push_back(SrcTy);
147 // Mapping a non-opaque source type to an opaque dest. If this is the first
148 // type that we're mapping onto this destination type then we succeed. Keep
149 // the dest, but fill it in later. This doesn't need to be speculative. If
150 // this is the second (different) type that we're trying to map onto the
151 // same opaque type then we fail.
152 if (cast<StructType>(DstTy)->isOpaque()) {
153 // We can only map one source type onto the opaque destination type.
154 if (!DstResolvedOpaqueTypes.insert(cast<StructType>(DstTy)))
156 SrcDefinitionsToResolve.push_back(SSTy);
162 // If the number of subtypes disagree between the two types, then we fail.
163 if (SrcTy->getNumContainedTypes() != DstTy->getNumContainedTypes())
166 // Fail if any of the extra properties (e.g. array size) of the type disagree.
167 if (isa<IntegerType>(DstTy))
168 return false; // bitwidth disagrees.
169 if (PointerType *PT = dyn_cast<PointerType>(DstTy)) {
170 if (PT->getAddressSpace() != cast<PointerType>(SrcTy)->getAddressSpace())
173 } else if (FunctionType *FT = dyn_cast<FunctionType>(DstTy)) {
174 if (FT->isVarArg() != cast<FunctionType>(SrcTy)->isVarArg())
176 } else if (StructType *DSTy = dyn_cast<StructType>(DstTy)) {
177 StructType *SSTy = cast<StructType>(SrcTy);
178 if (DSTy->isLiteral() != SSTy->isLiteral() ||
179 DSTy->isPacked() != SSTy->isPacked())
181 } else if (ArrayType *DATy = dyn_cast<ArrayType>(DstTy)) {
182 if (DATy->getNumElements() != cast<ArrayType>(SrcTy)->getNumElements())
184 } else if (VectorType *DVTy = dyn_cast<VectorType>(DstTy)) {
185 if (DVTy->getNumElements() != cast<VectorType>(SrcTy)->getNumElements())
189 // Otherwise, we speculate that these two types will line up and recursively
190 // check the subelements.
192 SpeculativeTypes.push_back(SrcTy);
194 for (unsigned i = 0, e = SrcTy->getNumContainedTypes(); i != e; ++i)
195 if (!areTypesIsomorphic(DstTy->getContainedType(i),
196 SrcTy->getContainedType(i)))
199 // If everything seems to have lined up, then everything is great.
203 /// linkDefinedTypeBodies - Produce a body for an opaque type in the dest
204 /// module from a type definition in the source module.
205 void TypeMapTy::linkDefinedTypeBodies() {
206 SmallVector<Type*, 16> Elements;
207 SmallString<16> TmpName;
209 // Note that processing entries in this loop (calling 'get') can add new
210 // entries to the SrcDefinitionsToResolve vector.
211 while (!SrcDefinitionsToResolve.empty()) {
212 StructType *SrcSTy = SrcDefinitionsToResolve.pop_back_val();
213 StructType *DstSTy = cast<StructType>(MappedTypes[SrcSTy]);
215 // TypeMap is a many-to-one mapping, if there were multiple types that
216 // provide a body for DstSTy then previous iterations of this loop may have
217 // already handled it. Just ignore this case.
218 if (!DstSTy->isOpaque()) continue;
219 assert(!SrcSTy->isOpaque() && "Not resolving a definition?");
221 // Map the body of the source type over to a new body for the dest type.
222 Elements.resize(SrcSTy->getNumElements());
223 for (unsigned i = 0, e = Elements.size(); i != e; ++i)
224 Elements[i] = getImpl(SrcSTy->getElementType(i));
226 DstSTy->setBody(Elements, SrcSTy->isPacked());
228 // If DstSTy has no name or has a longer name than STy, then viciously steal
230 if (!SrcSTy->hasName()) continue;
231 StringRef SrcName = SrcSTy->getName();
233 if (!DstSTy->hasName() || DstSTy->getName().size() > SrcName.size()) {
234 TmpName.insert(TmpName.end(), SrcName.begin(), SrcName.end());
236 DstSTy->setName(TmpName.str());
241 DstResolvedOpaqueTypes.clear();
244 /// get - Return the mapped type to use for the specified input type from the
246 Type *TypeMapTy::get(Type *Ty) {
247 Type *Result = getImpl(Ty);
249 // If this caused a reference to any struct type, resolve it before returning.
250 if (!SrcDefinitionsToResolve.empty())
251 linkDefinedTypeBodies();
255 /// getImpl - This is the recursive version of get().
256 Type *TypeMapTy::getImpl(Type *Ty) {
257 // If we already have an entry for this type, return it.
258 Type **Entry = &MappedTypes[Ty];
259 if (*Entry) return *Entry;
261 // If this is not a named struct type, then just map all of the elements and
262 // then rebuild the type from inside out.
263 if (!isa<StructType>(Ty) || cast<StructType>(Ty)->isLiteral()) {
264 // If there are no element types to map, then the type is itself. This is
265 // true for the anonymous {} struct, things like 'float', integers, etc.
266 if (Ty->getNumContainedTypes() == 0)
269 // Remap all of the elements, keeping track of whether any of them change.
270 bool AnyChange = false;
271 SmallVector<Type*, 4> ElementTypes;
272 ElementTypes.resize(Ty->getNumContainedTypes());
273 for (unsigned i = 0, e = Ty->getNumContainedTypes(); i != e; ++i) {
274 ElementTypes[i] = getImpl(Ty->getContainedType(i));
275 AnyChange |= ElementTypes[i] != Ty->getContainedType(i);
278 // If we found our type while recursively processing stuff, just use it.
279 Entry = &MappedTypes[Ty];
280 if (*Entry) return *Entry;
282 // If all of the element types mapped directly over, then the type is usable
287 // Otherwise, rebuild a modified type.
288 switch (Ty->getTypeID()) {
289 default: llvm_unreachable("unknown derived type to remap");
290 case Type::ArrayTyID:
291 return *Entry = ArrayType::get(ElementTypes[0],
292 cast<ArrayType>(Ty)->getNumElements());
293 case Type::VectorTyID:
294 return *Entry = VectorType::get(ElementTypes[0],
295 cast<VectorType>(Ty)->getNumElements());
296 case Type::PointerTyID:
297 return *Entry = PointerType::get(ElementTypes[0],
298 cast<PointerType>(Ty)->getAddressSpace());
299 case Type::FunctionTyID:
300 return *Entry = FunctionType::get(ElementTypes[0],
301 makeArrayRef(ElementTypes).slice(1),
302 cast<FunctionType>(Ty)->isVarArg());
303 case Type::StructTyID:
304 // Note that this is only reached for anonymous structs.
305 return *Entry = StructType::get(Ty->getContext(), ElementTypes,
306 cast<StructType>(Ty)->isPacked());
310 // Otherwise, this is an unmapped named struct. If the struct can be directly
311 // mapped over, just use it as-is. This happens in a case when the linked-in
312 // module has something like:
313 // %T = type {%T*, i32}
314 // @GV = global %T* null
315 // where T does not exist at all in the destination module.
317 // The other case we watch for is when the type is not in the destination
318 // module, but that it has to be rebuilt because it refers to something that
319 // is already mapped. For example, if the destination module has:
321 // and the source module has something like
322 // %A' = type { i32 }
323 // %B = type { %A'* }
324 // @GV = global %B* null
325 // then we want to create a new type: "%B = type { %A*}" and have it take the
326 // pristine "%B" name from the source module.
328 // To determine which case this is, we have to recursively walk the type graph
329 // speculating that we'll be able to reuse it unmodified. Only if this is
330 // safe would we map the entire thing over. Because this is an optimization,
331 // and is not required for the prettiness of the linked module, we just skip
332 // it and always rebuild a type here.
333 StructType *STy = cast<StructType>(Ty);
335 // If the type is opaque, we can just use it directly.
336 if (STy->isOpaque()) {
337 // A named structure type from src module is used. Add it to the Set of
338 // identified structs in the destination module.
339 DstStructTypesSet.insert(STy);
343 // Otherwise we create a new type and resolve its body later. This will be
344 // resolved by the top level of get().
345 SrcDefinitionsToResolve.push_back(STy);
346 StructType *DTy = StructType::create(STy->getContext());
347 // A new identified structure type was created. Add it to the set of
348 // identified structs in the destination module.
349 DstStructTypesSet.insert(DTy);
350 DstResolvedOpaqueTypes.insert(DTy);
354 //===----------------------------------------------------------------------===//
355 // ModuleLinker implementation.
356 //===----------------------------------------------------------------------===//
361 /// ValueMaterializerTy - Creates prototypes for functions that are lazily
362 /// linked on the fly. This speeds up linking for modules with many
363 /// lazily linked functions of which few get used.
364 class ValueMaterializerTy : public ValueMaterializer {
367 std::vector<Function*> &LazilyLinkFunctions;
369 ValueMaterializerTy(TypeMapTy &TypeMap, Module *DstM,
370 std::vector<Function*> &LazilyLinkFunctions) :
371 ValueMaterializer(), TypeMap(TypeMap), DstM(DstM),
372 LazilyLinkFunctions(LazilyLinkFunctions) {
375 Value *materializeValueFor(Value *V) override;
378 /// ModuleLinker - This is an implementation class for the LinkModules
379 /// function, which is the entrypoint for this file.
384 ValueMaterializerTy ValMaterializer;
386 /// ValueMap - Mapping of values from what they used to be in Src, to what
387 /// they are now in DstM. ValueToValueMapTy is a ValueMap, which involves
388 /// some overhead due to the use of Value handles which the Linker doesn't
389 /// actually need, but this allows us to reuse the ValueMapper code.
390 ValueToValueMapTy ValueMap;
392 struct AppendingVarInfo {
393 GlobalVariable *NewGV; // New aggregate global in dest module.
394 Constant *DstInit; // Old initializer from dest module.
395 Constant *SrcInit; // Old initializer from src module.
398 std::vector<AppendingVarInfo> AppendingVars;
400 unsigned Mode; // Mode to treat source module.
402 // Set of items not to link in from source.
403 SmallPtrSet<const Value*, 16> DoNotLinkFromSource;
405 // Vector of functions to lazily link in.
406 std::vector<Function*> LazilyLinkFunctions;
408 bool SuppressWarnings;
411 std::string ErrorMsg;
413 ModuleLinker(Module *dstM, TypeSet &Set, Module *srcM, unsigned mode,
414 bool SuppressWarnings=false)
415 : DstM(dstM), SrcM(srcM), TypeMap(Set),
416 ValMaterializer(TypeMap, DstM, LazilyLinkFunctions), Mode(mode),
417 SuppressWarnings(SuppressWarnings) {}
422 /// emitError - Helper method for setting a message and returning an error
424 bool emitError(const Twine &Message) {
425 ErrorMsg = Message.str();
429 /// getLinkageResult - This analyzes the two global values and determines
430 /// what the result will look like in the destination module.
431 bool getLinkageResult(GlobalValue *Dest, const GlobalValue *Src,
432 GlobalValue::LinkageTypes <,
433 GlobalValue::VisibilityTypes &Vis,
436 /// getLinkedToGlobal - Given a global in the source module, return the
437 /// global in the destination module that is being linked to, if any.
438 GlobalValue *getLinkedToGlobal(GlobalValue *SrcGV) {
439 // If the source has no name it can't link. If it has local linkage,
440 // there is no name match-up going on.
441 if (!SrcGV->hasName() || SrcGV->hasLocalLinkage())
444 // Otherwise see if we have a match in the destination module's symtab.
445 GlobalValue *DGV = DstM->getNamedValue(SrcGV->getName());
446 if (!DGV) return nullptr;
448 // If we found a global with the same name in the dest module, but it has
449 // internal linkage, we are really not doing any linkage here.
450 if (DGV->hasLocalLinkage())
453 // Otherwise, we do in fact link to the destination global.
457 void computeTypeMapping();
459 bool linkAppendingVarProto(GlobalVariable *DstGV, GlobalVariable *SrcGV);
460 bool linkGlobalProto(GlobalVariable *SrcGV);
461 bool linkFunctionProto(Function *SrcF);
462 bool linkAliasProto(GlobalAlias *SrcA);
463 bool linkModuleFlagsMetadata();
465 void linkAppendingVarInit(const AppendingVarInfo &AVI);
466 void linkGlobalInits();
467 void linkFunctionBody(Function *Dst, Function *Src);
468 void linkAliasBodies();
469 void linkNamedMDNodes();
473 /// forceRenaming - The LLVM SymbolTable class autorenames globals that conflict
474 /// in the symbol table. This is good for all clients except for us. Go
475 /// through the trouble to force this back.
476 static void forceRenaming(GlobalValue *GV, StringRef Name) {
477 // If the global doesn't force its name or if it already has the right name,
478 // there is nothing for us to do.
479 if (GV->hasLocalLinkage() || GV->getName() == Name)
482 Module *M = GV->getParent();
484 // If there is a conflict, rename the conflict.
485 if (GlobalValue *ConflictGV = M->getNamedValue(Name)) {
486 GV->takeName(ConflictGV);
487 ConflictGV->setName(Name); // This will cause ConflictGV to get renamed
488 assert(ConflictGV->getName() != Name && "forceRenaming didn't work");
490 GV->setName(Name); // Force the name back
494 /// copyGVAttributes - copy additional attributes (those not needed to construct
495 /// a GlobalValue) from the SrcGV to the DestGV.
496 static void copyGVAttributes(GlobalValue *DestGV, const GlobalValue *SrcGV) {
497 // Use the maximum alignment, rather than just copying the alignment of SrcGV.
498 auto *DestGO = dyn_cast<GlobalObject>(DestGV);
501 Alignment = std::max(DestGO->getAlignment(), SrcGV->getAlignment());
503 DestGV->copyAttributesFrom(SrcGV);
506 DestGO->setAlignment(Alignment);
508 forceRenaming(DestGV, SrcGV->getName());
511 static bool isLessConstraining(GlobalValue::VisibilityTypes a,
512 GlobalValue::VisibilityTypes b) {
513 if (a == GlobalValue::HiddenVisibility)
515 if (b == GlobalValue::HiddenVisibility)
517 if (a == GlobalValue::ProtectedVisibility)
519 if (b == GlobalValue::ProtectedVisibility)
524 Value *ValueMaterializerTy::materializeValueFor(Value *V) {
525 Function *SF = dyn_cast<Function>(V);
529 Function *DF = Function::Create(TypeMap.get(SF->getFunctionType()),
530 SF->getLinkage(), SF->getName(), DstM);
531 copyGVAttributes(DF, SF);
533 LazilyLinkFunctions.push_back(SF);
538 /// getLinkageResult - This analyzes the two global values and determines what
539 /// the result will look like in the destination module. In particular, it
540 /// computes the resultant linkage type and visibility, computes whether the
541 /// global in the source should be copied over to the destination (replacing
542 /// the existing one), and computes whether this linkage is an error or not.
543 bool ModuleLinker::getLinkageResult(GlobalValue *Dest, const GlobalValue *Src,
544 GlobalValue::LinkageTypes <,
545 GlobalValue::VisibilityTypes &Vis,
547 assert(Dest && "Must have two globals being queried");
548 assert(!Src->hasLocalLinkage() &&
549 "If Src has internal linkage, Dest shouldn't be set!");
551 bool SrcIsDeclaration = Src->isDeclaration() && !Src->isMaterializable();
552 bool DestIsDeclaration = Dest->isDeclaration();
554 if (SrcIsDeclaration) {
555 // If Src is external or if both Src & Dest are external.. Just link the
556 // external globals, we aren't adding anything.
557 if (Src->hasDLLImportStorageClass()) {
558 // If one of GVs is marked as DLLImport, result should be dllimport'ed.
559 if (DestIsDeclaration) {
561 LT = Src->getLinkage();
563 } else if (Dest->hasExternalWeakLinkage()) {
564 // If the Dest is weak, use the source linkage.
566 LT = Src->getLinkage();
569 LT = Dest->getLinkage();
571 } else if (DestIsDeclaration && !Dest->hasDLLImportStorageClass()) {
572 // If Dest is external but Src is not:
574 LT = Src->getLinkage();
575 } else if (Src->isWeakForLinker()) {
576 // At this point we know that Dest has LinkOnce, External*, Weak, Common,
578 if (Dest->hasExternalWeakLinkage() ||
579 Dest->hasAvailableExternallyLinkage() ||
580 (Dest->hasLinkOnceLinkage() &&
581 (Src->hasWeakLinkage() || Src->hasCommonLinkage()))) {
583 LT = Src->getLinkage();
586 LT = Dest->getLinkage();
588 } else if (Dest->isWeakForLinker()) {
589 // At this point we know that Src has External* or DLL* linkage.
590 if (Src->hasExternalWeakLinkage()) {
592 LT = Dest->getLinkage();
595 LT = GlobalValue::ExternalLinkage;
598 assert((Dest->hasExternalLinkage() || Dest->hasExternalWeakLinkage()) &&
599 (Src->hasExternalLinkage() || Src->hasExternalWeakLinkage()) &&
600 "Unexpected linkage type!");
601 return emitError("Linking globals named '" + Src->getName() +
602 "': symbol multiply defined!");
605 // Compute the visibility. We follow the rules in the System V Application
607 assert(!GlobalValue::isLocalLinkage(LT) &&
608 "Symbols with local linkage should not be merged");
609 Vis = isLessConstraining(Src->getVisibility(), Dest->getVisibility()) ?
610 Dest->getVisibility() : Src->getVisibility();
614 /// computeTypeMapping - Loop over all of the linked values to compute type
615 /// mappings. For example, if we link "extern Foo *x" and "Foo *x = NULL", then
616 /// we have two struct types 'Foo' but one got renamed when the module was
617 /// loaded into the same LLVMContext.
618 void ModuleLinker::computeTypeMapping() {
619 // Incorporate globals.
620 for (Module::global_iterator I = SrcM->global_begin(),
621 E = SrcM->global_end(); I != E; ++I) {
622 GlobalValue *DGV = getLinkedToGlobal(I);
625 if (!DGV->hasAppendingLinkage() || !I->hasAppendingLinkage()) {
626 TypeMap.addTypeMapping(DGV->getType(), I->getType());
630 // Unify the element type of appending arrays.
631 ArrayType *DAT = cast<ArrayType>(DGV->getType()->getElementType());
632 ArrayType *SAT = cast<ArrayType>(I->getType()->getElementType());
633 TypeMap.addTypeMapping(DAT->getElementType(), SAT->getElementType());
636 // Incorporate functions.
637 for (Module::iterator I = SrcM->begin(), E = SrcM->end(); I != E; ++I) {
638 if (GlobalValue *DGV = getLinkedToGlobal(I))
639 TypeMap.addTypeMapping(DGV->getType(), I->getType());
642 // Incorporate types by name, scanning all the types in the source module.
643 // At this point, the destination module may have a type "%foo = { i32 }" for
644 // example. When the source module got loaded into the same LLVMContext, if
645 // it had the same type, it would have been renamed to "%foo.42 = { i32 }".
646 TypeFinder SrcStructTypes;
647 SrcStructTypes.run(*SrcM, true);
648 SmallPtrSet<StructType*, 32> SrcStructTypesSet(SrcStructTypes.begin(),
649 SrcStructTypes.end());
651 for (unsigned i = 0, e = SrcStructTypes.size(); i != e; ++i) {
652 StructType *ST = SrcStructTypes[i];
653 if (!ST->hasName()) continue;
655 // Check to see if there is a dot in the name followed by a digit.
656 size_t DotPos = ST->getName().rfind('.');
657 if (DotPos == 0 || DotPos == StringRef::npos ||
658 ST->getName().back() == '.' ||
659 !isdigit(static_cast<unsigned char>(ST->getName()[DotPos+1])))
662 // Check to see if the destination module has a struct with the prefix name.
663 if (StructType *DST = DstM->getTypeByName(ST->getName().substr(0, DotPos)))
664 // Don't use it if this actually came from the source module. They're in
665 // the same LLVMContext after all. Also don't use it unless the type is
666 // actually used in the destination module. This can happen in situations
671 // %Z = type { %A } %B = type { %C.1 }
672 // %A = type { %B.1, [7 x i8] } %C.1 = type { i8* }
673 // %B.1 = type { %C } %A.2 = type { %B.3, [5 x i8] }
674 // %C = type { i8* } %B.3 = type { %C.1 }
676 // When we link Module B with Module A, the '%B' in Module B is
677 // used. However, that would then use '%C.1'. But when we process '%C.1',
678 // we prefer to take the '%C' version. So we are then left with both
679 // '%C.1' and '%C' being used for the same types. This leads to some
680 // variables using one type and some using the other.
681 if (!SrcStructTypesSet.count(DST) && TypeMap.DstStructTypesSet.count(DST))
682 TypeMap.addTypeMapping(DST, ST);
685 // Don't bother incorporating aliases, they aren't generally typed well.
687 // Now that we have discovered all of the type equivalences, get a body for
688 // any 'opaque' types in the dest module that are now resolved.
689 TypeMap.linkDefinedTypeBodies();
692 /// linkAppendingVarProto - If there were any appending global variables, link
693 /// them together now. Return true on error.
694 bool ModuleLinker::linkAppendingVarProto(GlobalVariable *DstGV,
695 GlobalVariable *SrcGV) {
697 if (!SrcGV->hasAppendingLinkage() || !DstGV->hasAppendingLinkage())
698 return emitError("Linking globals named '" + SrcGV->getName() +
699 "': can only link appending global with another appending global!");
701 ArrayType *DstTy = cast<ArrayType>(DstGV->getType()->getElementType());
703 cast<ArrayType>(TypeMap.get(SrcGV->getType()->getElementType()));
704 Type *EltTy = DstTy->getElementType();
706 // Check to see that they two arrays agree on type.
707 if (EltTy != SrcTy->getElementType())
708 return emitError("Appending variables with different element types!");
709 if (DstGV->isConstant() != SrcGV->isConstant())
710 return emitError("Appending variables linked with different const'ness!");
712 if (DstGV->getAlignment() != SrcGV->getAlignment())
714 "Appending variables with different alignment need to be linked!");
716 if (DstGV->getVisibility() != SrcGV->getVisibility())
718 "Appending variables with different visibility need to be linked!");
720 if (DstGV->hasUnnamedAddr() != SrcGV->hasUnnamedAddr())
722 "Appending variables with different unnamed_addr need to be linked!");
724 if (DstGV->getSection() != SrcGV->getSection())
726 "Appending variables with different section name need to be linked!");
728 uint64_t NewSize = DstTy->getNumElements() + SrcTy->getNumElements();
729 ArrayType *NewType = ArrayType::get(EltTy, NewSize);
731 // Create the new global variable.
733 new GlobalVariable(*DstGV->getParent(), NewType, SrcGV->isConstant(),
734 DstGV->getLinkage(), /*init*/nullptr, /*name*/"", DstGV,
735 DstGV->getThreadLocalMode(),
736 DstGV->getType()->getAddressSpace());
738 // Propagate alignment, visibility and section info.
739 copyGVAttributes(NG, DstGV);
741 AppendingVarInfo AVI;
743 AVI.DstInit = DstGV->getInitializer();
744 AVI.SrcInit = SrcGV->getInitializer();
745 AppendingVars.push_back(AVI);
747 // Replace any uses of the two global variables with uses of the new
749 ValueMap[SrcGV] = ConstantExpr::getBitCast(NG, TypeMap.get(SrcGV->getType()));
751 DstGV->replaceAllUsesWith(ConstantExpr::getBitCast(NG, DstGV->getType()));
752 DstGV->eraseFromParent();
754 // Track the source variable so we don't try to link it.
755 DoNotLinkFromSource.insert(SrcGV);
760 /// linkGlobalProto - Loop through the global variables in the src module and
761 /// merge them into the dest module.
762 bool ModuleLinker::linkGlobalProto(GlobalVariable *SGV) {
763 GlobalValue *DGV = getLinkedToGlobal(SGV);
764 llvm::Optional<GlobalValue::VisibilityTypes> NewVisibility;
765 bool HasUnnamedAddr = SGV->hasUnnamedAddr();
768 // Concatenation of appending linkage variables is magic and handled later.
769 if (DGV->hasAppendingLinkage() || SGV->hasAppendingLinkage())
770 return linkAppendingVarProto(cast<GlobalVariable>(DGV), SGV);
772 // Determine whether linkage of these two globals follows the source
773 // module's definition or the destination module's definition.
774 GlobalValue::LinkageTypes NewLinkage = GlobalValue::InternalLinkage;
775 GlobalValue::VisibilityTypes NV;
776 bool LinkFromSrc = false;
777 if (getLinkageResult(DGV, SGV, NewLinkage, NV, LinkFromSrc))
780 HasUnnamedAddr = HasUnnamedAddr && DGV->hasUnnamedAddr();
782 // If we're not linking from the source, then keep the definition that we
785 // Special case for const propagation.
786 if (GlobalVariable *DGVar = dyn_cast<GlobalVariable>(DGV))
787 if (DGVar->isDeclaration() && SGV->isConstant() && !DGVar->isConstant())
788 DGVar->setConstant(true);
790 // Set calculated linkage, visibility and unnamed_addr.
791 DGV->setLinkage(NewLinkage);
792 DGV->setVisibility(*NewVisibility);
793 DGV->setUnnamedAddr(HasUnnamedAddr);
795 // Make sure to remember this mapping.
796 ValueMap[SGV] = ConstantExpr::getBitCast(DGV,TypeMap.get(SGV->getType()));
798 // Track the source global so that we don't attempt to copy it over when
799 // processing global initializers.
800 DoNotLinkFromSource.insert(SGV);
806 // No linking to be performed or linking from the source: simply create an
807 // identical version of the symbol over in the dest module... the
808 // initializer will be filled in later by LinkGlobalInits.
809 GlobalVariable *NewDGV =
810 new GlobalVariable(*DstM, TypeMap.get(SGV->getType()->getElementType()),
811 SGV->isConstant(), SGV->getLinkage(), /*init*/nullptr,
812 SGV->getName(), /*insertbefore*/nullptr,
813 SGV->getThreadLocalMode(),
814 SGV->getType()->getAddressSpace());
815 // Propagate alignment, visibility and section info.
816 copyGVAttributes(NewDGV, SGV);
818 NewDGV->setVisibility(*NewVisibility);
819 NewDGV->setUnnamedAddr(HasUnnamedAddr);
822 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewDGV, DGV->getType()));
823 DGV->eraseFromParent();
826 // Make sure to remember this mapping.
827 ValueMap[SGV] = NewDGV;
831 /// linkFunctionProto - Link the function in the source module into the
832 /// destination module if needed, setting up mapping information.
833 bool ModuleLinker::linkFunctionProto(Function *SF) {
834 GlobalValue *DGV = getLinkedToGlobal(SF);
835 llvm::Optional<GlobalValue::VisibilityTypes> NewVisibility;
836 bool HasUnnamedAddr = SF->hasUnnamedAddr();
839 GlobalValue::LinkageTypes NewLinkage = GlobalValue::InternalLinkage;
840 bool LinkFromSrc = false;
841 GlobalValue::VisibilityTypes NV;
842 if (getLinkageResult(DGV, SF, NewLinkage, NV, LinkFromSrc))
845 HasUnnamedAddr = HasUnnamedAddr && DGV->hasUnnamedAddr();
848 // Set calculated linkage
849 DGV->setLinkage(NewLinkage);
850 DGV->setVisibility(*NewVisibility);
851 DGV->setUnnamedAddr(HasUnnamedAddr);
853 // Make sure to remember this mapping.
854 ValueMap[SF] = ConstantExpr::getBitCast(DGV, TypeMap.get(SF->getType()));
856 // Track the function from the source module so we don't attempt to remap
858 DoNotLinkFromSource.insert(SF);
864 // If the function is to be lazily linked, don't create it just yet.
865 // The ValueMaterializerTy will deal with creating it if it's used.
866 if (!DGV && (SF->hasLocalLinkage() || SF->hasLinkOnceLinkage() ||
867 SF->hasAvailableExternallyLinkage())) {
868 DoNotLinkFromSource.insert(SF);
872 // If there is no linkage to be performed or we are linking from the source,
874 Function *NewDF = Function::Create(TypeMap.get(SF->getFunctionType()),
875 SF->getLinkage(), SF->getName(), DstM);
876 copyGVAttributes(NewDF, SF);
878 NewDF->setVisibility(*NewVisibility);
879 NewDF->setUnnamedAddr(HasUnnamedAddr);
882 // Any uses of DF need to change to NewDF, with cast.
883 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewDF, DGV->getType()));
884 DGV->eraseFromParent();
887 ValueMap[SF] = NewDF;
891 /// LinkAliasProto - Set up prototypes for any aliases that come over from the
893 bool ModuleLinker::linkAliasProto(GlobalAlias *SGA) {
894 GlobalValue *DGV = getLinkedToGlobal(SGA);
895 llvm::Optional<GlobalValue::VisibilityTypes> NewVisibility;
898 GlobalValue::LinkageTypes NewLinkage = GlobalValue::InternalLinkage;
899 GlobalValue::VisibilityTypes NV;
900 bool LinkFromSrc = false;
901 if (getLinkageResult(DGV, SGA, NewLinkage, NV, LinkFromSrc))
906 // Set calculated linkage.
907 DGV->setLinkage(NewLinkage);
908 DGV->setVisibility(*NewVisibility);
910 // Make sure to remember this mapping.
911 ValueMap[SGA] = ConstantExpr::getBitCast(DGV,TypeMap.get(SGA->getType()));
913 // Track the alias from the source module so we don't attempt to remap it.
914 DoNotLinkFromSource.insert(SGA);
920 // If there is no linkage to be performed or we're linking from the source,
922 GlobalAlias *NewDA = new GlobalAlias(TypeMap.get(SGA->getType()),
923 SGA->getLinkage(), SGA->getName(),
924 /*aliasee*/nullptr, DstM);
925 copyGVAttributes(NewDA, SGA);
927 NewDA->setVisibility(*NewVisibility);
930 // Any uses of DGV need to change to NewDA, with cast.
931 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewDA, DGV->getType()));
932 DGV->eraseFromParent();
935 ValueMap[SGA] = NewDA;
939 static void getArrayElements(Constant *C, SmallVectorImpl<Constant*> &Dest) {
940 unsigned NumElements = cast<ArrayType>(C->getType())->getNumElements();
942 for (unsigned i = 0; i != NumElements; ++i)
943 Dest.push_back(C->getAggregateElement(i));
946 void ModuleLinker::linkAppendingVarInit(const AppendingVarInfo &AVI) {
947 // Merge the initializer.
948 SmallVector<Constant*, 16> Elements;
949 getArrayElements(AVI.DstInit, Elements);
951 Constant *SrcInit = MapValue(AVI.SrcInit, ValueMap, RF_None, &TypeMap, &ValMaterializer);
952 getArrayElements(SrcInit, Elements);
954 ArrayType *NewType = cast<ArrayType>(AVI.NewGV->getType()->getElementType());
955 AVI.NewGV->setInitializer(ConstantArray::get(NewType, Elements));
958 /// linkGlobalInits - Update the initializers in the Dest module now that all
959 /// globals that may be referenced are in Dest.
960 void ModuleLinker::linkGlobalInits() {
961 // Loop over all of the globals in the src module, mapping them over as we go
962 for (Module::const_global_iterator I = SrcM->global_begin(),
963 E = SrcM->global_end(); I != E; ++I) {
965 // Only process initialized GV's or ones not already in dest.
966 if (!I->hasInitializer() || DoNotLinkFromSource.count(I)) continue;
968 // Grab destination global variable.
969 GlobalVariable *DGV = cast<GlobalVariable>(ValueMap[I]);
970 // Figure out what the initializer looks like in the dest module.
971 DGV->setInitializer(MapValue(I->getInitializer(), ValueMap,
972 RF_None, &TypeMap, &ValMaterializer));
976 /// linkFunctionBody - Copy the source function over into the dest function and
977 /// fix up references to values. At this point we know that Dest is an external
978 /// function, and that Src is not.
979 void ModuleLinker::linkFunctionBody(Function *Dst, Function *Src) {
980 assert(Src && Dst && Dst->isDeclaration() && !Src->isDeclaration());
982 // Go through and convert function arguments over, remembering the mapping.
983 Function::arg_iterator DI = Dst->arg_begin();
984 for (Function::arg_iterator I = Src->arg_begin(), E = Src->arg_end();
986 DI->setName(I->getName()); // Copy the name over.
988 // Add a mapping to our mapping.
992 if (Mode == Linker::DestroySource) {
993 // Splice the body of the source function into the dest function.
994 Dst->getBasicBlockList().splice(Dst->end(), Src->getBasicBlockList());
996 // At this point, all of the instructions and values of the function are now
997 // copied over. The only problem is that they are still referencing values in
998 // the Source function as operands. Loop through all of the operands of the
999 // functions and patch them up to point to the local versions.
1000 for (Function::iterator BB = Dst->begin(), BE = Dst->end(); BB != BE; ++BB)
1001 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
1002 RemapInstruction(I, ValueMap, RF_IgnoreMissingEntries,
1003 &TypeMap, &ValMaterializer);
1006 // Clone the body of the function into the dest function.
1007 SmallVector<ReturnInst*, 8> Returns; // Ignore returns.
1008 CloneFunctionInto(Dst, Src, ValueMap, false, Returns, "", nullptr,
1009 &TypeMap, &ValMaterializer);
1012 // There is no need to map the arguments anymore.
1013 for (Function::arg_iterator I = Src->arg_begin(), E = Src->arg_end();
1019 /// linkAliasBodies - Insert all of the aliases in Src into the Dest module.
1020 void ModuleLinker::linkAliasBodies() {
1021 for (Module::alias_iterator I = SrcM->alias_begin(), E = SrcM->alias_end();
1023 if (DoNotLinkFromSource.count(I))
1025 if (Constant *Aliasee = I->getAliasee()) {
1026 GlobalAlias *DA = cast<GlobalAlias>(ValueMap[I]);
1027 DA->setAliasee(MapValue(Aliasee, ValueMap, RF_None,
1028 &TypeMap, &ValMaterializer));
1033 /// linkNamedMDNodes - Insert all of the named MDNodes in Src into the Dest
1035 void ModuleLinker::linkNamedMDNodes() {
1036 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata();
1037 for (Module::const_named_metadata_iterator I = SrcM->named_metadata_begin(),
1038 E = SrcM->named_metadata_end(); I != E; ++I) {
1039 // Don't link module flags here. Do them separately.
1040 if (&*I == SrcModFlags) continue;
1041 NamedMDNode *DestNMD = DstM->getOrInsertNamedMetadata(I->getName());
1042 // Add Src elements into Dest node.
1043 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
1044 DestNMD->addOperand(MapValue(I->getOperand(i), ValueMap,
1045 RF_None, &TypeMap, &ValMaterializer));
1049 /// linkModuleFlagsMetadata - Merge the linker flags in Src into the Dest
1051 bool ModuleLinker::linkModuleFlagsMetadata() {
1052 // If the source module has no module flags, we are done.
1053 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata();
1054 if (!SrcModFlags) return false;
1056 // If the destination module doesn't have module flags yet, then just copy
1057 // over the source module's flags.
1058 NamedMDNode *DstModFlags = DstM->getOrInsertModuleFlagsMetadata();
1059 if (DstModFlags->getNumOperands() == 0) {
1060 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I)
1061 DstModFlags->addOperand(SrcModFlags->getOperand(I));
1066 // First build a map of the existing module flags and requirements.
1067 DenseMap<MDString*, MDNode*> Flags;
1068 SmallSetVector<MDNode*, 16> Requirements;
1069 for (unsigned I = 0, E = DstModFlags->getNumOperands(); I != E; ++I) {
1070 MDNode *Op = DstModFlags->getOperand(I);
1071 ConstantInt *Behavior = cast<ConstantInt>(Op->getOperand(0));
1072 MDString *ID = cast<MDString>(Op->getOperand(1));
1074 if (Behavior->getZExtValue() == Module::Require) {
1075 Requirements.insert(cast<MDNode>(Op->getOperand(2)));
1081 // Merge in the flags from the source module, and also collect its set of
1083 bool HasErr = false;
1084 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I) {
1085 MDNode *SrcOp = SrcModFlags->getOperand(I);
1086 ConstantInt *SrcBehavior = cast<ConstantInt>(SrcOp->getOperand(0));
1087 MDString *ID = cast<MDString>(SrcOp->getOperand(1));
1088 MDNode *DstOp = Flags.lookup(ID);
1089 unsigned SrcBehaviorValue = SrcBehavior->getZExtValue();
1091 // If this is a requirement, add it and continue.
1092 if (SrcBehaviorValue == Module::Require) {
1093 // If the destination module does not already have this requirement, add
1095 if (Requirements.insert(cast<MDNode>(SrcOp->getOperand(2)))) {
1096 DstModFlags->addOperand(SrcOp);
1101 // If there is no existing flag with this ID, just add it.
1104 DstModFlags->addOperand(SrcOp);
1108 // Otherwise, perform a merge.
1109 ConstantInt *DstBehavior = cast<ConstantInt>(DstOp->getOperand(0));
1110 unsigned DstBehaviorValue = DstBehavior->getZExtValue();
1112 // If either flag has override behavior, handle it first.
1113 if (DstBehaviorValue == Module::Override) {
1114 // Diagnose inconsistent flags which both have override behavior.
1115 if (SrcBehaviorValue == Module::Override &&
1116 SrcOp->getOperand(2) != DstOp->getOperand(2)) {
1117 HasErr |= emitError("linking module flags '" + ID->getString() +
1118 "': IDs have conflicting override values");
1121 } else if (SrcBehaviorValue == Module::Override) {
1122 // Update the destination flag to that of the source.
1123 DstOp->replaceOperandWith(0, SrcBehavior);
1124 DstOp->replaceOperandWith(2, SrcOp->getOperand(2));
1128 // Diagnose inconsistent merge behavior types.
1129 if (SrcBehaviorValue != DstBehaviorValue) {
1130 HasErr |= emitError("linking module flags '" + ID->getString() +
1131 "': IDs have conflicting behaviors");
1135 // Perform the merge for standard behavior types.
1136 switch (SrcBehaviorValue) {
1137 case Module::Require:
1138 case Module::Override: assert(0 && "not possible"); break;
1139 case Module::Error: {
1140 // Emit an error if the values differ.
1141 if (SrcOp->getOperand(2) != DstOp->getOperand(2)) {
1142 HasErr |= emitError("linking module flags '" + ID->getString() +
1143 "': IDs have conflicting values");
1147 case Module::Warning: {
1148 // Emit a warning if the values differ.
1149 if (SrcOp->getOperand(2) != DstOp->getOperand(2)) {
1150 if (!SuppressWarnings) {
1151 errs() << "WARNING: linking module flags '" << ID->getString()
1152 << "': IDs have conflicting values";
1157 case Module::Append: {
1158 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2));
1159 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2));
1160 unsigned NumOps = DstValue->getNumOperands() + SrcValue->getNumOperands();
1161 Value **VP, **Values = VP = new Value*[NumOps];
1162 for (unsigned i = 0, e = DstValue->getNumOperands(); i != e; ++i, ++VP)
1163 *VP = DstValue->getOperand(i);
1164 for (unsigned i = 0, e = SrcValue->getNumOperands(); i != e; ++i, ++VP)
1165 *VP = SrcValue->getOperand(i);
1166 DstOp->replaceOperandWith(2, MDNode::get(DstM->getContext(),
1167 ArrayRef<Value*>(Values,
1172 case Module::AppendUnique: {
1173 SmallSetVector<Value*, 16> Elts;
1174 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2));
1175 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2));
1176 for (unsigned i = 0, e = DstValue->getNumOperands(); i != e; ++i)
1177 Elts.insert(DstValue->getOperand(i));
1178 for (unsigned i = 0, e = SrcValue->getNumOperands(); i != e; ++i)
1179 Elts.insert(SrcValue->getOperand(i));
1180 DstOp->replaceOperandWith(2, MDNode::get(DstM->getContext(),
1181 ArrayRef<Value*>(Elts.begin(),
1188 // Check all of the requirements.
1189 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
1190 MDNode *Requirement = Requirements[I];
1191 MDString *Flag = cast<MDString>(Requirement->getOperand(0));
1192 Value *ReqValue = Requirement->getOperand(1);
1194 MDNode *Op = Flags[Flag];
1195 if (!Op || Op->getOperand(2) != ReqValue) {
1196 HasErr |= emitError("linking module flags '" + Flag->getString() +
1197 "': does not have the required value");
1205 bool ModuleLinker::run() {
1206 assert(DstM && "Null destination module");
1207 assert(SrcM && "Null source module");
1209 // Inherit the target data from the source module if the destination module
1210 // doesn't have one already.
1211 if (!DstM->getDataLayout() && SrcM->getDataLayout())
1212 DstM->setDataLayout(SrcM->getDataLayout());
1214 // Copy the target triple from the source to dest if the dest's is empty.
1215 if (DstM->getTargetTriple().empty() && !SrcM->getTargetTriple().empty())
1216 DstM->setTargetTriple(SrcM->getTargetTriple());
1218 if (SrcM->getDataLayout() && DstM->getDataLayout() &&
1219 *SrcM->getDataLayout() != *DstM->getDataLayout()) {
1220 if (!SuppressWarnings) {
1221 errs() << "WARNING: Linking two modules of different data layouts: '"
1222 << SrcM->getModuleIdentifier() << "' is '"
1223 << SrcM->getDataLayoutStr() << "' whereas '"
1224 << DstM->getModuleIdentifier() << "' is '"
1225 << DstM->getDataLayoutStr() << "'\n";
1228 if (!SrcM->getTargetTriple().empty() &&
1229 DstM->getTargetTriple() != SrcM->getTargetTriple()) {
1230 if (!SuppressWarnings) {
1231 errs() << "WARNING: Linking two modules of different target triples: "
1232 << SrcM->getModuleIdentifier() << "' is '"
1233 << SrcM->getTargetTriple() << "' whereas '"
1234 << DstM->getModuleIdentifier() << "' is '"
1235 << DstM->getTargetTriple() << "'\n";
1239 // Append the module inline asm string.
1240 if (!SrcM->getModuleInlineAsm().empty()) {
1241 if (DstM->getModuleInlineAsm().empty())
1242 DstM->setModuleInlineAsm(SrcM->getModuleInlineAsm());
1244 DstM->setModuleInlineAsm(DstM->getModuleInlineAsm()+"\n"+
1245 SrcM->getModuleInlineAsm());
1248 // Loop over all of the linked values to compute type mappings.
1249 computeTypeMapping();
1251 // Insert all of the globals in src into the DstM module... without linking
1252 // initializers (which could refer to functions not yet mapped over).
1253 for (Module::global_iterator I = SrcM->global_begin(),
1254 E = SrcM->global_end(); I != E; ++I)
1255 if (linkGlobalProto(I))
1258 // Link the functions together between the two modules, without doing function
1259 // bodies... this just adds external function prototypes to the DstM
1260 // function... We do this so that when we begin processing function bodies,
1261 // all of the global values that may be referenced are available in our
1263 for (Module::iterator I = SrcM->begin(), E = SrcM->end(); I != E; ++I)
1264 if (linkFunctionProto(I))
1267 // If there were any aliases, link them now.
1268 for (Module::alias_iterator I = SrcM->alias_begin(),
1269 E = SrcM->alias_end(); I != E; ++I)
1270 if (linkAliasProto(I))
1273 for (unsigned i = 0, e = AppendingVars.size(); i != e; ++i)
1274 linkAppendingVarInit(AppendingVars[i]);
1276 // Link in the function bodies that are defined in the source module into
1278 for (Module::iterator SF = SrcM->begin(), E = SrcM->end(); SF != E; ++SF) {
1279 // Skip if not linking from source.
1280 if (DoNotLinkFromSource.count(SF)) continue;
1282 Function *DF = cast<Function>(ValueMap[SF]);
1283 if (SF->hasPrefixData()) {
1284 // Link in the prefix data.
1285 DF->setPrefixData(MapValue(
1286 SF->getPrefixData(), ValueMap, RF_None, &TypeMap, &ValMaterializer));
1289 // Skip if no body (function is external) or materialize.
1290 if (SF->isDeclaration()) {
1291 if (!SF->isMaterializable())
1293 if (SF->Materialize(&ErrorMsg))
1297 linkFunctionBody(DF, SF);
1298 SF->Dematerialize();
1301 // Resolve all uses of aliases with aliasees.
1304 // Remap all of the named MDNodes in Src into the DstM module. We do this
1305 // after linking GlobalValues so that MDNodes that reference GlobalValues
1306 // are properly remapped.
1309 // Merge the module flags into the DstM module.
1310 if (linkModuleFlagsMetadata())
1313 // Update the initializers in the DstM module now that all globals that may
1314 // be referenced are in DstM.
1317 // Process vector of lazily linked in functions.
1318 bool LinkedInAnyFunctions;
1320 LinkedInAnyFunctions = false;
1322 for(std::vector<Function*>::iterator I = LazilyLinkFunctions.begin(),
1323 E = LazilyLinkFunctions.end(); I != E; ++I) {
1328 Function *DF = cast<Function>(ValueMap[SF]);
1329 if (SF->hasPrefixData()) {
1330 // Link in the prefix data.
1331 DF->setPrefixData(MapValue(SF->getPrefixData(),
1338 // Materialize if necessary.
1339 if (SF->isDeclaration()) {
1340 if (!SF->isMaterializable())
1342 if (SF->Materialize(&ErrorMsg))
1346 // Erase from vector *before* the function body is linked - linkFunctionBody could
1348 LazilyLinkFunctions.erase(I);
1350 // Link in function body.
1351 linkFunctionBody(DF, SF);
1352 SF->Dematerialize();
1354 // Set flag to indicate we may have more functions to lazily link in
1355 // since we linked in a function.
1356 LinkedInAnyFunctions = true;
1359 } while (LinkedInAnyFunctions);
1361 // Now that all of the types from the source are used, resolve any structs
1362 // copied over to the dest that didn't exist there.
1363 TypeMap.linkDefinedTypeBodies();
1368 Linker::Linker(Module *M, bool SuppressWarnings)
1369 : Composite(M), SuppressWarnings(SuppressWarnings) {
1370 TypeFinder StructTypes;
1371 StructTypes.run(*M, true);
1372 IdentifiedStructTypes.insert(StructTypes.begin(), StructTypes.end());
1378 void Linker::deleteModule() {
1380 Composite = nullptr;
1383 bool Linker::linkInModule(Module *Src, unsigned Mode, std::string *ErrorMsg) {
1384 ModuleLinker TheLinker(Composite, IdentifiedStructTypes, Src, Mode,
1386 if (TheLinker.run()) {
1388 *ErrorMsg = TheLinker.ErrorMsg;
1394 //===----------------------------------------------------------------------===//
1395 // LinkModules entrypoint.
1396 //===----------------------------------------------------------------------===//
1398 /// LinkModules - This function links two modules together, with the resulting
1399 /// Dest module modified to be the composite of the two input modules. If an
1400 /// error occurs, true is returned and ErrorMsg (if not null) is set to indicate
1401 /// the problem. Upon failure, the Dest module could be in a modified state,
1402 /// and shouldn't be relied on to be consistent.
1403 bool Linker::LinkModules(Module *Dest, Module *Src, unsigned Mode,
1404 std::string *ErrorMsg) {
1406 return L.linkInModule(Src, Mode, ErrorMsg);
1409 //===----------------------------------------------------------------------===//
1411 //===----------------------------------------------------------------------===//
1413 LLVMBool LLVMLinkModules(LLVMModuleRef Dest, LLVMModuleRef Src,
1414 LLVMLinkerMode Mode, char **OutMessages) {
1415 std::string Messages;
1416 LLVMBool Result = Linker::LinkModules(unwrap(Dest), unwrap(Src),
1417 Mode, OutMessages? &Messages : nullptr);
1419 *OutMessages = strdup(Messages.c_str());