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 // Specifically, this:
13 // * Merges global variables between the two modules
14 // * Uninit + Uninit = Init, Init + Uninit = Init, Init + Init = Error if !=
15 // * Merges functions between two modules
17 //===----------------------------------------------------------------------===//
19 #include "llvm/Linker.h"
20 #include "llvm/Constants.h"
21 #include "llvm/DerivedTypes.h"
22 #include "llvm/LLVMContext.h"
23 #include "llvm/Module.h"
24 #include "llvm/TypeSymbolTable.h"
25 #include "llvm/ValueSymbolTable.h"
26 #include "llvm/Instructions.h"
27 #include "llvm/Assembly/Writer.h"
28 #include "llvm/Support/Streams.h"
29 #include "llvm/Support/ErrorHandling.h"
30 #include "llvm/System/Path.h"
31 #include "llvm/ADT/DenseMap.h"
35 // Error - Simple wrapper function to conditionally assign to E and return true.
36 // This just makes error return conditions a little bit simpler...
37 static inline bool Error(std::string *E, const Twine &Message) {
38 if (E) *E = Message.str();
42 // Function: ResolveTypes()
45 // Attempt to link the two specified types together.
48 // DestTy - The type to which we wish to resolve.
49 // SrcTy - The original type which we want to resolve.
52 // DestST - The symbol table in which the new type should be placed.
55 // true - There is an error and the types cannot yet be linked.
58 static bool ResolveTypes(const Type *DestTy, const Type *SrcTy) {
59 if (DestTy == SrcTy) return false; // If already equal, noop
60 assert(DestTy && SrcTy && "Can't handle null types");
62 if (const OpaqueType *OT = dyn_cast<OpaqueType>(DestTy)) {
63 // Type _is_ in module, just opaque...
64 const_cast<OpaqueType*>(OT)->refineAbstractTypeTo(SrcTy);
65 } else if (const OpaqueType *OT = dyn_cast<OpaqueType>(SrcTy)) {
66 const_cast<OpaqueType*>(OT)->refineAbstractTypeTo(DestTy);
68 return true; // Cannot link types... not-equal and neither is opaque.
73 /// LinkerTypeMap - This implements a map of types that is stable
74 /// even if types are resolved/refined to other types. This is not a general
75 /// purpose map, it is specific to the linker's use.
77 class LinkerTypeMap : public AbstractTypeUser {
78 typedef DenseMap<const Type*, PATypeHolder> TheMapTy;
81 LinkerTypeMap(const LinkerTypeMap&); // DO NOT IMPLEMENT
82 void operator=(const LinkerTypeMap&); // DO NOT IMPLEMENT
86 for (DenseMap<const Type*, PATypeHolder>::iterator I = TheMap.begin(),
87 E = TheMap.end(); I != E; ++I)
88 I->first->removeAbstractTypeUser(this);
91 /// lookup - Return the value for the specified type or null if it doesn't
93 const Type *lookup(const Type *Ty) const {
94 TheMapTy::const_iterator I = TheMap.find(Ty);
95 if (I != TheMap.end()) return I->second;
99 /// erase - Remove the specified type, returning true if it was in the set.
100 bool erase(const Type *Ty) {
101 if (!TheMap.erase(Ty))
103 if (Ty->isAbstract())
104 Ty->removeAbstractTypeUser(this);
108 /// insert - This returns true if the pointer was new to the set, false if it
109 /// was already in the set.
110 bool insert(const Type *Src, const Type *Dst) {
111 if (!TheMap.insert(std::make_pair(Src, PATypeHolder(Dst))).second)
112 return false; // Already in map.
113 if (Src->isAbstract())
114 Src->addAbstractTypeUser(this);
119 /// refineAbstractType - The callback method invoked when an abstract type is
120 /// resolved to another type. An object must override this method to update
121 /// its internal state to reference NewType instead of OldType.
123 virtual void refineAbstractType(const DerivedType *OldTy,
125 TheMapTy::iterator I = TheMap.find(OldTy);
126 const Type *DstTy = I->second;
129 if (OldTy->isAbstract())
130 OldTy->removeAbstractTypeUser(this);
132 // Don't reinsert into the map if the key is concrete now.
133 if (NewTy->isAbstract())
134 insert(NewTy, DstTy);
137 /// The other case which AbstractTypeUsers must be aware of is when a type
138 /// makes the transition from being abstract (where it has clients on it's
139 /// AbstractTypeUsers list) to concrete (where it does not). This method
140 /// notifies ATU's when this occurs for a type.
141 virtual void typeBecameConcrete(const DerivedType *AbsTy) {
143 AbsTy->removeAbstractTypeUser(this);
147 virtual void dump() const {
148 cerr << "AbstractTypeSet!\n";
154 // RecursiveResolveTypes - This is just like ResolveTypes, except that it
155 // recurses down into derived types, merging the used types if the parent types
157 static bool RecursiveResolveTypesI(const Type *DstTy, const Type *SrcTy,
158 LinkerTypeMap &Pointers) {
159 if (DstTy == SrcTy) return false; // If already equal, noop
161 // If we found our opaque type, resolve it now!
162 if (isa<OpaqueType>(DstTy) || isa<OpaqueType>(SrcTy))
163 return ResolveTypes(DstTy, SrcTy);
165 // Two types cannot be resolved together if they are of different primitive
166 // type. For example, we cannot resolve an int to a float.
167 if (DstTy->getTypeID() != SrcTy->getTypeID()) return true;
169 // If neither type is abstract, then they really are just different types.
170 if (!DstTy->isAbstract() && !SrcTy->isAbstract())
173 // Otherwise, resolve the used type used by this derived type...
174 switch (DstTy->getTypeID()) {
177 case Type::FunctionTyID: {
178 const FunctionType *DstFT = cast<FunctionType>(DstTy);
179 const FunctionType *SrcFT = cast<FunctionType>(SrcTy);
180 if (DstFT->isVarArg() != SrcFT->isVarArg() ||
181 DstFT->getNumContainedTypes() != SrcFT->getNumContainedTypes())
184 // Use TypeHolder's so recursive resolution won't break us.
185 PATypeHolder ST(SrcFT), DT(DstFT);
186 for (unsigned i = 0, e = DstFT->getNumContainedTypes(); i != e; ++i) {
187 const Type *SE = ST->getContainedType(i), *DE = DT->getContainedType(i);
188 if (SE != DE && RecursiveResolveTypesI(DE, SE, Pointers))
193 case Type::StructTyID: {
194 const StructType *DstST = cast<StructType>(DstTy);
195 const StructType *SrcST = cast<StructType>(SrcTy);
196 if (DstST->getNumContainedTypes() != SrcST->getNumContainedTypes())
199 PATypeHolder ST(SrcST), DT(DstST);
200 for (unsigned i = 0, e = DstST->getNumContainedTypes(); i != e; ++i) {
201 const Type *SE = ST->getContainedType(i), *DE = DT->getContainedType(i);
202 if (SE != DE && RecursiveResolveTypesI(DE, SE, Pointers))
207 case Type::ArrayTyID: {
208 const ArrayType *DAT = cast<ArrayType>(DstTy);
209 const ArrayType *SAT = cast<ArrayType>(SrcTy);
210 if (DAT->getNumElements() != SAT->getNumElements()) return true;
211 return RecursiveResolveTypesI(DAT->getElementType(), SAT->getElementType(),
214 case Type::VectorTyID: {
215 const VectorType *DVT = cast<VectorType>(DstTy);
216 const VectorType *SVT = cast<VectorType>(SrcTy);
217 if (DVT->getNumElements() != SVT->getNumElements()) return true;
218 return RecursiveResolveTypesI(DVT->getElementType(), SVT->getElementType(),
221 case Type::PointerTyID: {
222 const PointerType *DstPT = cast<PointerType>(DstTy);
223 const PointerType *SrcPT = cast<PointerType>(SrcTy);
225 if (DstPT->getAddressSpace() != SrcPT->getAddressSpace())
228 // If this is a pointer type, check to see if we have already seen it. If
229 // so, we are in a recursive branch. Cut off the search now. We cannot use
230 // an associative container for this search, because the type pointers (keys
231 // in the container) change whenever types get resolved.
232 if (SrcPT->isAbstract())
233 if (const Type *ExistingDestTy = Pointers.lookup(SrcPT))
234 return ExistingDestTy != DstPT;
236 if (DstPT->isAbstract())
237 if (const Type *ExistingSrcTy = Pointers.lookup(DstPT))
238 return ExistingSrcTy != SrcPT;
239 // Otherwise, add the current pointers to the vector to stop recursion on
241 if (DstPT->isAbstract())
242 Pointers.insert(DstPT, SrcPT);
243 if (SrcPT->isAbstract())
244 Pointers.insert(SrcPT, DstPT);
246 return RecursiveResolveTypesI(DstPT->getElementType(),
247 SrcPT->getElementType(), Pointers);
252 static bool RecursiveResolveTypes(const Type *DestTy, const Type *SrcTy) {
253 LinkerTypeMap PointerTypes;
254 return RecursiveResolveTypesI(DestTy, SrcTy, PointerTypes);
258 // LinkTypes - Go through the symbol table of the Src module and see if any
259 // types are named in the src module that are not named in the Dst module.
260 // Make sure there are no type name conflicts.
261 static bool LinkTypes(Module *Dest, const Module *Src, std::string *Err) {
262 TypeSymbolTable *DestST = &Dest->getTypeSymbolTable();
263 const TypeSymbolTable *SrcST = &Src->getTypeSymbolTable();
265 // Look for a type plane for Type's...
266 TypeSymbolTable::const_iterator TI = SrcST->begin();
267 TypeSymbolTable::const_iterator TE = SrcST->end();
268 if (TI == TE) return false; // No named types, do nothing.
270 // Some types cannot be resolved immediately because they depend on other
271 // types being resolved to each other first. This contains a list of types we
272 // are waiting to recheck.
273 std::vector<std::string> DelayedTypesToResolve;
275 for ( ; TI != TE; ++TI ) {
276 const std::string &Name = TI->first;
277 const Type *RHS = TI->second;
279 // Check to see if this type name is already in the dest module.
280 Type *Entry = DestST->lookup(Name);
282 // If the name is just in the source module, bring it over to the dest.
285 DestST->insert(Name, const_cast<Type*>(RHS));
286 } else if (ResolveTypes(Entry, RHS)) {
287 // They look different, save the types 'till later to resolve.
288 DelayedTypesToResolve.push_back(Name);
292 // Iteratively resolve types while we can...
293 while (!DelayedTypesToResolve.empty()) {
294 // Loop over all of the types, attempting to resolve them if possible...
295 unsigned OldSize = DelayedTypesToResolve.size();
297 // Try direct resolution by name...
298 for (unsigned i = 0; i != DelayedTypesToResolve.size(); ++i) {
299 const std::string &Name = DelayedTypesToResolve[i];
300 Type *T1 = SrcST->lookup(Name);
301 Type *T2 = DestST->lookup(Name);
302 if (!ResolveTypes(T2, T1)) {
303 // We are making progress!
304 DelayedTypesToResolve.erase(DelayedTypesToResolve.begin()+i);
309 // Did we not eliminate any types?
310 if (DelayedTypesToResolve.size() == OldSize) {
311 // Attempt to resolve subelements of types. This allows us to merge these
312 // two types: { int* } and { opaque* }
313 for (unsigned i = 0, e = DelayedTypesToResolve.size(); i != e; ++i) {
314 const std::string &Name = DelayedTypesToResolve[i];
315 if (!RecursiveResolveTypes(SrcST->lookup(Name), DestST->lookup(Name))) {
316 // We are making progress!
317 DelayedTypesToResolve.erase(DelayedTypesToResolve.begin()+i);
319 // Go back to the main loop, perhaps we can resolve directly by name
325 // If we STILL cannot resolve the types, then there is something wrong.
326 if (DelayedTypesToResolve.size() == OldSize) {
327 // Remove the symbol name from the destination.
328 DelayedTypesToResolve.pop_back();
338 static void PrintMap(const std::map<const Value*, Value*> &M) {
339 for (std::map<const Value*, Value*>::const_iterator I = M.begin(), E =M.end();
341 cerr << " Fr: " << (void*)I->first << " ";
343 cerr << " To: " << (void*)I->second << " ";
351 // RemapOperand - Use ValueMap to convert constants from one module to another.
352 static Value *RemapOperand(const Value *In,
353 std::map<const Value*, Value*> &ValueMap,
354 LLVMContext &Context) {
355 std::map<const Value*,Value*>::const_iterator I = ValueMap.find(In);
356 if (I != ValueMap.end())
359 // Check to see if it's a constant that we are interested in transforming.
361 if (const Constant *CPV = dyn_cast<Constant>(In)) {
362 if ((!isa<DerivedType>(CPV->getType()) && !isa<ConstantExpr>(CPV)) ||
363 isa<ConstantInt>(CPV) || isa<ConstantAggregateZero>(CPV))
364 return const_cast<Constant*>(CPV); // Simple constants stay identical.
366 if (const ConstantArray *CPA = dyn_cast<ConstantArray>(CPV)) {
367 std::vector<Constant*> Operands(CPA->getNumOperands());
368 for (unsigned i = 0, e = CPA->getNumOperands(); i != e; ++i)
369 Operands[i] =cast<Constant>(RemapOperand(CPA->getOperand(i), ValueMap,
372 ConstantArray::get(cast<ArrayType>(CPA->getType()), Operands);
373 } else if (const ConstantStruct *CPS = dyn_cast<ConstantStruct>(CPV)) {
374 std::vector<Constant*> Operands(CPS->getNumOperands());
375 for (unsigned i = 0, e = CPS->getNumOperands(); i != e; ++i)
376 Operands[i] =cast<Constant>(RemapOperand(CPS->getOperand(i), ValueMap,
379 ConstantStruct::get(cast<StructType>(CPS->getType()), Operands);
380 } else if (isa<ConstantPointerNull>(CPV) || isa<UndefValue>(CPV)) {
381 Result = const_cast<Constant*>(CPV);
382 } else if (const ConstantVector *CP = dyn_cast<ConstantVector>(CPV)) {
383 std::vector<Constant*> Operands(CP->getNumOperands());
384 for (unsigned i = 0, e = CP->getNumOperands(); i != e; ++i)
385 Operands[i] = cast<Constant>(RemapOperand(CP->getOperand(i), ValueMap,
387 Result = ConstantVector::get(Operands);
388 } else if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(CPV)) {
389 std::vector<Constant*> Ops;
390 for (unsigned i = 0, e = CE->getNumOperands(); i != e; ++i)
391 Ops.push_back(cast<Constant>(RemapOperand(CE->getOperand(i),ValueMap,
393 Result = CE->getWithOperands(Ops);
395 assert(!isa<GlobalValue>(CPV) && "Unmapped global?");
396 llvm_unreachable("Unknown type of derived type constant value!");
398 } else if (isa<InlineAsm>(In)) {
399 Result = const_cast<Value*>(In);
402 // Cache the mapping in our local map structure
404 ValueMap[In] = Result;
409 cerr << "LinkModules ValueMap: \n";
412 cerr << "Couldn't remap value: " << (void*)In << " " << *In << "\n";
413 llvm_unreachable("Couldn't remap value!");
418 /// ForceRenaming - The LLVM SymbolTable class autorenames globals that conflict
419 /// in the symbol table. This is good for all clients except for us. Go
420 /// through the trouble to force this back.
421 static void ForceRenaming(GlobalValue *GV, const std::string &Name) {
422 assert(GV->getName() != Name && "Can't force rename to self");
423 ValueSymbolTable &ST = GV->getParent()->getValueSymbolTable();
425 // If there is a conflict, rename the conflict.
426 if (GlobalValue *ConflictGV = cast_or_null<GlobalValue>(ST.lookup(Name))) {
427 assert(ConflictGV->hasLocalLinkage() &&
428 "Not conflicting with a static global, should link instead!");
429 GV->takeName(ConflictGV);
430 ConflictGV->setName(Name); // This will cause ConflictGV to get renamed
431 assert(ConflictGV->getName() != Name && "ForceRenaming didn't work");
433 GV->setName(Name); // Force the name back
437 /// CopyGVAttributes - copy additional attributes (those not needed to construct
438 /// a GlobalValue) from the SrcGV to the DestGV.
439 static void CopyGVAttributes(GlobalValue *DestGV, const GlobalValue *SrcGV) {
440 // Use the maximum alignment, rather than just copying the alignment of SrcGV.
441 unsigned Alignment = std::max(DestGV->getAlignment(), SrcGV->getAlignment());
442 DestGV->copyAttributesFrom(SrcGV);
443 DestGV->setAlignment(Alignment);
446 /// GetLinkageResult - This analyzes the two global values and determines what
447 /// the result will look like in the destination module. In particular, it
448 /// computes the resultant linkage type, computes whether the global in the
449 /// source should be copied over to the destination (replacing the existing
450 /// one), and computes whether this linkage is an error or not. It also performs
451 /// visibility checks: we cannot link together two symbols with different
453 static bool GetLinkageResult(GlobalValue *Dest, const GlobalValue *Src,
454 GlobalValue::LinkageTypes <, bool &LinkFromSrc,
456 assert((!Dest || !Src->hasLocalLinkage()) &&
457 "If Src has internal linkage, Dest shouldn't be set!");
459 // Linking something to nothing.
461 LT = Src->getLinkage();
462 } else if (Src->isDeclaration()) {
463 // If Src is external or if both Src & Dest are external.. Just link the
464 // external globals, we aren't adding anything.
465 if (Src->hasDLLImportLinkage()) {
466 // If one of GVs has DLLImport linkage, result should be dllimport'ed.
467 if (Dest->isDeclaration()) {
469 LT = Src->getLinkage();
471 } else if (Dest->hasExternalWeakLinkage()) {
472 // If the Dest is weak, use the source linkage.
474 LT = Src->getLinkage();
477 LT = Dest->getLinkage();
479 } else if (Dest->isDeclaration() && !Dest->hasDLLImportLinkage()) {
480 // If Dest is external but Src is not:
482 LT = Src->getLinkage();
483 } else if (Src->hasAppendingLinkage() || Dest->hasAppendingLinkage()) {
484 if (Src->getLinkage() != Dest->getLinkage())
485 return Error(Err, "Linking globals named '" + Src->getName() +
486 "': can only link appending global with another appending global!");
487 LinkFromSrc = true; // Special cased.
488 LT = Src->getLinkage();
489 } else if (Src->isWeakForLinker()) {
490 // At this point we know that Dest has LinkOnce, External*, Weak, Common,
492 if (Dest->hasExternalWeakLinkage() ||
493 Dest->hasAvailableExternallyLinkage() ||
494 (Dest->hasLinkOnceLinkage() &&
495 (Src->hasWeakLinkage() || Src->hasCommonLinkage()))) {
497 LT = Src->getLinkage();
500 LT = Dest->getLinkage();
502 } else if (Dest->isWeakForLinker()) {
503 // At this point we know that Src has External* or DLL* linkage.
504 if (Src->hasExternalWeakLinkage()) {
506 LT = Dest->getLinkage();
509 LT = GlobalValue::ExternalLinkage;
512 assert((Dest->hasExternalLinkage() ||
513 Dest->hasDLLImportLinkage() ||
514 Dest->hasDLLExportLinkage() ||
515 Dest->hasExternalWeakLinkage()) &&
516 (Src->hasExternalLinkage() ||
517 Src->hasDLLImportLinkage() ||
518 Src->hasDLLExportLinkage() ||
519 Src->hasExternalWeakLinkage()) &&
520 "Unexpected linkage type!");
521 return Error(Err, "Linking globals named '" + Src->getName() +
522 "': symbol multiply defined!");
526 if (Dest && Src->getVisibility() != Dest->getVisibility())
527 if (!Src->isDeclaration() && !Dest->isDeclaration())
528 return Error(Err, "Linking globals named '" + Src->getName() +
529 "': symbols have different visibilities!");
533 // LinkGlobals - Loop through the global variables in the src module and merge
534 // them into the dest module.
535 static bool LinkGlobals(Module *Dest, const Module *Src,
536 std::map<const Value*, Value*> &ValueMap,
537 std::multimap<std::string, GlobalVariable *> &AppendingVars,
539 ValueSymbolTable &DestSymTab = Dest->getValueSymbolTable();
541 // Loop over all of the globals in the src module, mapping them over as we go
542 for (Module::const_global_iterator I = Src->global_begin(),
543 E = Src->global_end(); I != E; ++I) {
544 const GlobalVariable *SGV = I;
545 GlobalValue *DGV = 0;
547 // Check to see if may have to link the global with the global, alias or
549 if (SGV->hasName() && !SGV->hasLocalLinkage())
550 DGV = cast_or_null<GlobalValue>(DestSymTab.lookup(SGV->getName()));
552 // If we found a global with the same name in the dest module, but it has
553 // internal linkage, we are really not doing any linkage here.
554 if (DGV && DGV->hasLocalLinkage())
557 // If types don't agree due to opaque types, try to resolve them.
558 if (DGV && DGV->getType() != SGV->getType())
559 RecursiveResolveTypes(SGV->getType(), DGV->getType());
561 assert((SGV->hasInitializer() || SGV->hasExternalWeakLinkage() ||
562 SGV->hasExternalLinkage() || SGV->hasDLLImportLinkage()) &&
563 "Global must either be external or have an initializer!");
565 GlobalValue::LinkageTypes NewLinkage = GlobalValue::InternalLinkage;
566 bool LinkFromSrc = false;
567 if (GetLinkageResult(DGV, SGV, NewLinkage, LinkFromSrc, Err))
571 // No linking to be performed, simply create an identical version of the
572 // symbol over in the dest module... the initializer will be filled in
573 // later by LinkGlobalInits.
574 GlobalVariable *NewDGV =
575 new GlobalVariable(*Dest, SGV->getType()->getElementType(),
576 SGV->isConstant(), SGV->getLinkage(), /*init*/0,
577 SGV->getName(), 0, false,
578 SGV->getType()->getAddressSpace());
579 // Propagate alignment, visibility and section info.
580 CopyGVAttributes(NewDGV, SGV);
582 // If the LLVM runtime renamed the global, but it is an externally visible
583 // symbol, DGV must be an existing global with internal linkage. Rename
585 if (!NewDGV->hasLocalLinkage() && NewDGV->getName() != SGV->getName())
586 ForceRenaming(NewDGV, SGV->getName());
588 // Make sure to remember this mapping.
589 ValueMap[SGV] = NewDGV;
591 // Keep track that this is an appending variable.
592 if (SGV->hasAppendingLinkage())
593 AppendingVars.insert(std::make_pair(SGV->getName(), NewDGV));
597 // If the visibilities of the symbols disagree and the destination is a
598 // prototype, take the visibility of its input.
599 if (DGV->isDeclaration())
600 DGV->setVisibility(SGV->getVisibility());
602 if (DGV->hasAppendingLinkage()) {
603 // No linking is performed yet. Just insert a new copy of the global, and
604 // keep track of the fact that it is an appending variable in the
605 // AppendingVars map. The name is cleared out so that no linkage is
607 GlobalVariable *NewDGV =
608 new GlobalVariable(*Dest, SGV->getType()->getElementType(),
609 SGV->isConstant(), SGV->getLinkage(), /*init*/0,
611 SGV->getType()->getAddressSpace());
613 // Set alignment allowing CopyGVAttributes merge it with alignment of SGV.
614 NewDGV->setAlignment(DGV->getAlignment());
615 // Propagate alignment, section and visibility info.
616 CopyGVAttributes(NewDGV, SGV);
618 // Make sure to remember this mapping...
619 ValueMap[SGV] = NewDGV;
621 // Keep track that this is an appending variable...
622 AppendingVars.insert(std::make_pair(SGV->getName(), NewDGV));
627 if (isa<GlobalAlias>(DGV))
628 return Error(Err, "Global-Alias Collision on '" + SGV->getName() +
629 "': symbol multiple defined");
631 // If the types don't match, and if we are to link from the source, nuke
632 // DGV and create a new one of the appropriate type. Note that the thing
633 // we are replacing may be a function (if a prototype, weak, etc) or a
635 GlobalVariable *NewDGV =
636 new GlobalVariable(*Dest, SGV->getType()->getElementType(),
637 SGV->isConstant(), NewLinkage, /*init*/0,
638 DGV->getName(), 0, false,
639 SGV->getType()->getAddressSpace());
641 // Propagate alignment, section, and visibility info.
642 CopyGVAttributes(NewDGV, SGV);
643 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewDGV,
646 // DGV will conflict with NewDGV because they both had the same
647 // name. We must erase this now so ForceRenaming doesn't assert
648 // because DGV might not have internal linkage.
649 if (GlobalVariable *Var = dyn_cast<GlobalVariable>(DGV))
650 Var->eraseFromParent();
652 cast<Function>(DGV)->eraseFromParent();
655 // If the symbol table renamed the global, but it is an externally visible
656 // symbol, DGV must be an existing global with internal linkage. Rename.
657 if (NewDGV->getName() != SGV->getName() && !NewDGV->hasLocalLinkage())
658 ForceRenaming(NewDGV, SGV->getName());
660 // Inherit const as appropriate.
661 NewDGV->setConstant(SGV->isConstant());
663 // Make sure to remember this mapping.
664 ValueMap[SGV] = NewDGV;
668 // Not "link from source", keep the one in the DestModule and remap the
671 // Special case for const propagation.
672 if (GlobalVariable *DGVar = dyn_cast<GlobalVariable>(DGV))
673 if (DGVar->isDeclaration() && SGV->isConstant() && !DGVar->isConstant())
674 DGVar->setConstant(true);
676 // SGV is global, but DGV is alias.
677 if (isa<GlobalAlias>(DGV)) {
678 // The only valid mappings are:
679 // - SGV is external declaration, which is effectively a no-op.
680 // - SGV is weak, when we just need to throw SGV out.
681 if (!SGV->isDeclaration() && !SGV->isWeakForLinker())
682 return Error(Err, "Global-Alias Collision on '" + SGV->getName() +
683 "': symbol multiple defined");
686 // Set calculated linkage
687 DGV->setLinkage(NewLinkage);
689 // Make sure to remember this mapping...
690 ValueMap[SGV] = ConstantExpr::getBitCast(DGV, SGV->getType());
695 static GlobalValue::LinkageTypes
696 CalculateAliasLinkage(const GlobalValue *SGV, const GlobalValue *DGV) {
697 GlobalValue::LinkageTypes SL = SGV->getLinkage();
698 GlobalValue::LinkageTypes DL = DGV->getLinkage();
699 if (SL == GlobalValue::ExternalLinkage || DL == GlobalValue::ExternalLinkage)
700 return GlobalValue::ExternalLinkage;
701 else if (SL == GlobalValue::WeakAnyLinkage ||
702 DL == GlobalValue::WeakAnyLinkage)
703 return GlobalValue::WeakAnyLinkage;
704 else if (SL == GlobalValue::WeakODRLinkage ||
705 DL == GlobalValue::WeakODRLinkage)
706 return GlobalValue::WeakODRLinkage;
707 else if (SL == GlobalValue::InternalLinkage &&
708 DL == GlobalValue::InternalLinkage)
709 return GlobalValue::InternalLinkage;
710 else if (SL == GlobalValue::LinkerPrivateLinkage &&
711 DL == GlobalValue::LinkerPrivateLinkage)
712 return GlobalValue::LinkerPrivateLinkage;
714 assert (SL == GlobalValue::PrivateLinkage &&
715 DL == GlobalValue::PrivateLinkage && "Unexpected linkage type");
716 return GlobalValue::PrivateLinkage;
720 // LinkAlias - Loop through the alias in the src module and link them into the
721 // dest module. We're assuming, that all functions/global variables were already
723 static bool LinkAlias(Module *Dest, const Module *Src,
724 std::map<const Value*, Value*> &ValueMap,
726 // Loop over all alias in the src module
727 for (Module::const_alias_iterator I = Src->alias_begin(),
728 E = Src->alias_end(); I != E; ++I) {
729 const GlobalAlias *SGA = I;
730 const GlobalValue *SAliasee = SGA->getAliasedGlobal();
731 GlobalAlias *NewGA = NULL;
733 // Globals were already linked, thus we can just query ValueMap for variant
734 // of SAliasee in Dest.
735 std::map<const Value*,Value*>::const_iterator VMI = ValueMap.find(SAliasee);
736 assert(VMI != ValueMap.end() && "Aliasee not linked");
737 GlobalValue* DAliasee = cast<GlobalValue>(VMI->second);
738 GlobalValue* DGV = NULL;
740 // Try to find something 'similar' to SGA in destination module.
741 if (!DGV && !SGA->hasLocalLinkage()) {
742 DGV = Dest->getNamedAlias(SGA->getName());
744 // If types don't agree due to opaque types, try to resolve them.
745 if (DGV && DGV->getType() != SGA->getType())
746 RecursiveResolveTypes(SGA->getType(), DGV->getType());
749 if (!DGV && !SGA->hasLocalLinkage()) {
750 DGV = Dest->getGlobalVariable(SGA->getName());
752 // If types don't agree due to opaque types, try to resolve them.
753 if (DGV && DGV->getType() != SGA->getType())
754 RecursiveResolveTypes(SGA->getType(), DGV->getType());
757 if (!DGV && !SGA->hasLocalLinkage()) {
758 DGV = Dest->getFunction(SGA->getName());
760 // If types don't agree due to opaque types, try to resolve them.
761 if (DGV && DGV->getType() != SGA->getType())
762 RecursiveResolveTypes(SGA->getType(), DGV->getType());
765 // No linking to be performed on internal stuff.
766 if (DGV && DGV->hasLocalLinkage())
769 if (GlobalAlias *DGA = dyn_cast_or_null<GlobalAlias>(DGV)) {
770 // Types are known to be the same, check whether aliasees equal. As
771 // globals are already linked we just need query ValueMap to find the
773 if (DAliasee == DGA->getAliasedGlobal()) {
774 // This is just two copies of the same alias. Propagate linkage, if
776 DGA->setLinkage(CalculateAliasLinkage(SGA, DGA));
779 // Proceed to 'common' steps
781 return Error(Err, "Alias Collision on '" + SGA->getName()+
782 "': aliases have different aliasees");
783 } else if (GlobalVariable *DGVar = dyn_cast_or_null<GlobalVariable>(DGV)) {
784 // The only allowed way is to link alias with external declaration or weak
786 if (DGVar->isDeclaration() || DGVar->isWeakForLinker()) {
787 // But only if aliasee is global too...
788 if (!isa<GlobalVariable>(DAliasee))
789 return Error(Err, "Global-Alias Collision on '" + SGA->getName() +
790 "': aliasee is not global variable");
792 NewGA = new GlobalAlias(SGA->getType(), SGA->getLinkage(),
793 SGA->getName(), DAliasee, Dest);
794 CopyGVAttributes(NewGA, SGA);
796 // Any uses of DGV need to change to NewGA, with cast, if needed.
797 if (SGA->getType() != DGVar->getType())
798 DGVar->replaceAllUsesWith(ConstantExpr::getBitCast(NewGA,
801 DGVar->replaceAllUsesWith(NewGA);
803 // DGVar will conflict with NewGA because they both had the same
804 // name. We must erase this now so ForceRenaming doesn't assert
805 // because DGV might not have internal linkage.
806 DGVar->eraseFromParent();
808 // Proceed to 'common' steps
810 return Error(Err, "Global-Alias Collision on '" + SGA->getName() +
811 "': symbol multiple defined");
812 } else if (Function *DF = dyn_cast_or_null<Function>(DGV)) {
813 // The only allowed way is to link alias with external declaration or weak
815 if (DF->isDeclaration() || DF->isWeakForLinker()) {
816 // But only if aliasee is function too...
817 if (!isa<Function>(DAliasee))
818 return Error(Err, "Function-Alias Collision on '" + SGA->getName() +
819 "': aliasee is not function");
821 NewGA = new GlobalAlias(SGA->getType(), SGA->getLinkage(),
822 SGA->getName(), DAliasee, Dest);
823 CopyGVAttributes(NewGA, SGA);
825 // Any uses of DF need to change to NewGA, with cast, if needed.
826 if (SGA->getType() != DF->getType())
827 DF->replaceAllUsesWith(ConstantExpr::getBitCast(NewGA,
830 DF->replaceAllUsesWith(NewGA);
832 // DF will conflict with NewGA because they both had the same
833 // name. We must erase this now so ForceRenaming doesn't assert
834 // because DF might not have internal linkage.
835 DF->eraseFromParent();
837 // Proceed to 'common' steps
839 return Error(Err, "Function-Alias Collision on '" + SGA->getName() +
840 "': symbol multiple defined");
842 // No linking to be performed, simply create an identical version of the
843 // alias over in the dest module...
845 NewGA = new GlobalAlias(SGA->getType(), SGA->getLinkage(),
846 SGA->getName(), DAliasee, Dest);
847 CopyGVAttributes(NewGA, SGA);
849 // Proceed to 'common' steps
852 assert(NewGA && "No alias was created in destination module!");
854 // If the symbol table renamed the alias, but it is an externally visible
855 // symbol, DGA must be an global value with internal linkage. Rename it.
856 if (NewGA->getName() != SGA->getName() &&
857 !NewGA->hasLocalLinkage())
858 ForceRenaming(NewGA, SGA->getName());
860 // Remember this mapping so uses in the source module get remapped
861 // later by RemapOperand.
862 ValueMap[SGA] = NewGA;
869 // LinkGlobalInits - Update the initializers in the Dest module now that all
870 // globals that may be referenced are in Dest.
871 static bool LinkGlobalInits(Module *Dest, const Module *Src,
872 std::map<const Value*, Value*> &ValueMap,
874 // Loop over all of the globals in the src module, mapping them over as we go
875 for (Module::const_global_iterator I = Src->global_begin(),
876 E = Src->global_end(); I != E; ++I) {
877 const GlobalVariable *SGV = I;
879 if (SGV->hasInitializer()) { // Only process initialized GV's
880 // Figure out what the initializer looks like in the dest module...
882 cast<Constant>(RemapOperand(SGV->getInitializer(), ValueMap,
883 Dest->getContext()));
884 // Grab destination global variable or alias.
885 GlobalValue *DGV = cast<GlobalValue>(ValueMap[SGV]->stripPointerCasts());
887 // If dest if global variable, check that initializers match.
888 if (GlobalVariable *DGVar = dyn_cast<GlobalVariable>(DGV)) {
889 if (DGVar->hasInitializer()) {
890 if (SGV->hasExternalLinkage()) {
891 if (DGVar->getInitializer() != SInit)
892 return Error(Err, "Global Variable Collision on '" +
894 "': global variables have different initializers");
895 } else if (DGVar->isWeakForLinker()) {
896 // Nothing is required, mapped values will take the new global
898 } else if (SGV->isWeakForLinker()) {
899 // Nothing is required, mapped values will take the new global
901 } else if (DGVar->hasAppendingLinkage()) {
902 llvm_unreachable("Appending linkage unimplemented!");
904 llvm_unreachable("Unknown linkage!");
907 // Copy the initializer over now...
908 DGVar->setInitializer(SInit);
911 // Destination is alias, the only valid situation is when source is
912 // weak. Also, note, that we already checked linkage in LinkGlobals(),
913 // thus we assert here.
914 // FIXME: Should we weaken this assumption, 'dereference' alias and
915 // check for initializer of aliasee?
916 assert(SGV->isWeakForLinker());
923 // LinkFunctionProtos - Link the functions together between the two modules,
924 // without doing function bodies... this just adds external function prototypes
925 // to the Dest function...
927 static bool LinkFunctionProtos(Module *Dest, const Module *Src,
928 std::map<const Value*, Value*> &ValueMap,
930 ValueSymbolTable &DestSymTab = Dest->getValueSymbolTable();
932 // Loop over all of the functions in the src module, mapping them over
933 for (Module::const_iterator I = Src->begin(), E = Src->end(); I != E; ++I) {
934 const Function *SF = I; // SrcFunction
935 GlobalValue *DGV = 0;
937 // Check to see if may have to link the function with the global, alias or
939 if (SF->hasName() && !SF->hasLocalLinkage())
940 DGV = cast_or_null<GlobalValue>(DestSymTab.lookup(SF->getName()));
942 // If we found a global with the same name in the dest module, but it has
943 // internal linkage, we are really not doing any linkage here.
944 if (DGV && DGV->hasLocalLinkage())
947 // If types don't agree due to opaque types, try to resolve them.
948 if (DGV && DGV->getType() != SF->getType())
949 RecursiveResolveTypes(SF->getType(), DGV->getType());
951 GlobalValue::LinkageTypes NewLinkage = GlobalValue::InternalLinkage;
952 bool LinkFromSrc = false;
953 if (GetLinkageResult(DGV, SF, NewLinkage, LinkFromSrc, Err))
956 // If there is no linkage to be performed, just bring over SF without
959 // Function does not already exist, simply insert an function signature
960 // identical to SF into the dest module.
961 Function *NewDF = Function::Create(SF->getFunctionType(),
963 SF->getName(), Dest);
964 CopyGVAttributes(NewDF, SF);
966 // If the LLVM runtime renamed the function, but it is an externally
967 // visible symbol, DF must be an existing function with internal linkage.
969 if (!NewDF->hasLocalLinkage() && NewDF->getName() != SF->getName())
970 ForceRenaming(NewDF, SF->getName());
972 // ... and remember this mapping...
973 ValueMap[SF] = NewDF;
977 // If the visibilities of the symbols disagree and the destination is a
978 // prototype, take the visibility of its input.
979 if (DGV->isDeclaration())
980 DGV->setVisibility(SF->getVisibility());
983 if (isa<GlobalAlias>(DGV))
984 return Error(Err, "Function-Alias Collision on '" + SF->getName() +
985 "': symbol multiple defined");
987 // We have a definition of the same name but different type in the
988 // source module. Copy the prototype to the destination and replace
989 // uses of the destination's prototype with the new prototype.
990 Function *NewDF = Function::Create(SF->getFunctionType(), NewLinkage,
991 SF->getName(), Dest);
992 CopyGVAttributes(NewDF, SF);
994 // Any uses of DF need to change to NewDF, with cast
995 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewDF,
998 // DF will conflict with NewDF because they both had the same. We must
999 // erase this now so ForceRenaming doesn't assert because DF might
1000 // not have internal linkage.
1001 if (GlobalVariable *Var = dyn_cast<GlobalVariable>(DGV))
1002 Var->eraseFromParent();
1004 cast<Function>(DGV)->eraseFromParent();
1006 // If the symbol table renamed the function, but it is an externally
1007 // visible symbol, DF must be an existing function with internal
1008 // linkage. Rename it.
1009 if (NewDF->getName() != SF->getName() && !NewDF->hasLocalLinkage())
1010 ForceRenaming(NewDF, SF->getName());
1012 // Remember this mapping so uses in the source module get remapped
1013 // later by RemapOperand.
1014 ValueMap[SF] = NewDF;
1018 // Not "link from source", keep the one in the DestModule and remap the
1021 if (isa<GlobalAlias>(DGV)) {
1022 // The only valid mappings are:
1023 // - SF is external declaration, which is effectively a no-op.
1024 // - SF is weak, when we just need to throw SF out.
1025 if (!SF->isDeclaration() && !SF->isWeakForLinker())
1026 return Error(Err, "Function-Alias Collision on '" + SF->getName() +
1027 "': symbol multiple defined");
1030 // Set calculated linkage
1031 DGV->setLinkage(NewLinkage);
1033 // Make sure to remember this mapping.
1034 ValueMap[SF] = ConstantExpr::getBitCast(DGV, SF->getType());
1039 // LinkFunctionBody - Copy the source function over into the dest function and
1040 // fix up references to values. At this point we know that Dest is an external
1041 // function, and that Src is not.
1042 static bool LinkFunctionBody(Function *Dest, Function *Src,
1043 std::map<const Value*, Value*> &ValueMap,
1045 assert(Src && Dest && Dest->isDeclaration() && !Src->isDeclaration());
1047 // Go through and convert function arguments over, remembering the mapping.
1048 Function::arg_iterator DI = Dest->arg_begin();
1049 for (Function::arg_iterator I = Src->arg_begin(), E = Src->arg_end();
1050 I != E; ++I, ++DI) {
1051 DI->setName(I->getName()); // Copy the name information over...
1053 // Add a mapping to our local map
1057 // Splice the body of the source function into the dest function.
1058 Dest->getBasicBlockList().splice(Dest->end(), Src->getBasicBlockList());
1060 // At this point, all of the instructions and values of the function are now
1061 // copied over. The only problem is that they are still referencing values in
1062 // the Source function as operands. Loop through all of the operands of the
1063 // functions and patch them up to point to the local versions...
1065 for (Function::iterator BB = Dest->begin(), BE = Dest->end(); BB != BE; ++BB)
1066 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
1067 for (Instruction::op_iterator OI = I->op_begin(), OE = I->op_end();
1069 if (!isa<Instruction>(*OI) && !isa<BasicBlock>(*OI))
1070 *OI = RemapOperand(*OI, ValueMap, Dest->getContext());
1072 // There is no need to map the arguments anymore.
1073 for (Function::arg_iterator I = Src->arg_begin(), E = Src->arg_end();
1081 // LinkFunctionBodies - Link in the function bodies that are defined in the
1082 // source module into the DestModule. This consists basically of copying the
1083 // function over and fixing up references to values.
1084 static bool LinkFunctionBodies(Module *Dest, Module *Src,
1085 std::map<const Value*, Value*> &ValueMap,
1088 // Loop over all of the functions in the src module, mapping them over as we
1090 for (Module::iterator SF = Src->begin(), E = Src->end(); SF != E; ++SF) {
1091 if (!SF->isDeclaration()) { // No body if function is external
1092 Function *DF = dyn_cast<Function>(ValueMap[SF]); // Destination function
1094 // DF not external SF external?
1095 if (DF && DF->isDeclaration())
1096 // Only provide the function body if there isn't one already.
1097 if (LinkFunctionBody(DF, SF, ValueMap, Err))
1104 // LinkAppendingVars - If there were any appending global variables, link them
1105 // together now. Return true on error.
1106 static bool LinkAppendingVars(Module *M,
1107 std::multimap<std::string, GlobalVariable *> &AppendingVars,
1108 std::string *ErrorMsg) {
1109 if (AppendingVars.empty()) return false; // Nothing to do.
1111 LLVMContext &Context = M->getContext();
1113 // Loop over the multimap of appending vars, processing any variables with the
1114 // same name, forming a new appending global variable with both of the
1115 // initializers merged together, then rewrite references to the old variables
1117 std::vector<Constant*> Inits;
1118 while (AppendingVars.size() > 1) {
1119 // Get the first two elements in the map...
1120 std::multimap<std::string,
1121 GlobalVariable*>::iterator Second = AppendingVars.begin(), First=Second++;
1123 // If the first two elements are for different names, there is no pair...
1124 // Otherwise there is a pair, so link them together...
1125 if (First->first == Second->first) {
1126 GlobalVariable *G1 = First->second, *G2 = Second->second;
1127 const ArrayType *T1 = cast<ArrayType>(G1->getType()->getElementType());
1128 const ArrayType *T2 = cast<ArrayType>(G2->getType()->getElementType());
1130 // Check to see that they two arrays agree on type...
1131 if (T1->getElementType() != T2->getElementType())
1132 return Error(ErrorMsg,
1133 "Appending variables with different element types need to be linked!");
1134 if (G1->isConstant() != G2->isConstant())
1135 return Error(ErrorMsg,
1136 "Appending variables linked with different const'ness!");
1138 if (G1->getAlignment() != G2->getAlignment())
1139 return Error(ErrorMsg,
1140 "Appending variables with different alignment need to be linked!");
1142 if (G1->getVisibility() != G2->getVisibility())
1143 return Error(ErrorMsg,
1144 "Appending variables with different visibility need to be linked!");
1146 if (G1->getSection() != G2->getSection())
1147 return Error(ErrorMsg,
1148 "Appending variables with different section name need to be linked!");
1150 unsigned NewSize = T1->getNumElements() + T2->getNumElements();
1151 ArrayType *NewType = ArrayType::get(T1->getElementType(),
1154 G1->setName(""); // Clear G1's name in case of a conflict!
1156 // Create the new global variable...
1157 GlobalVariable *NG =
1158 new GlobalVariable(*M, NewType, G1->isConstant(), G1->getLinkage(),
1159 /*init*/0, First->first, 0, G1->isThreadLocal(),
1160 G1->getType()->getAddressSpace());
1162 // Propagate alignment, visibility and section info.
1163 CopyGVAttributes(NG, G1);
1165 // Merge the initializer...
1166 Inits.reserve(NewSize);
1167 if (ConstantArray *I = dyn_cast<ConstantArray>(G1->getInitializer())) {
1168 for (unsigned i = 0, e = T1->getNumElements(); i != e; ++i)
1169 Inits.push_back(I->getOperand(i));
1171 assert(isa<ConstantAggregateZero>(G1->getInitializer()));
1172 Constant *CV = Context.getNullValue(T1->getElementType());
1173 for (unsigned i = 0, e = T1->getNumElements(); i != e; ++i)
1174 Inits.push_back(CV);
1176 if (ConstantArray *I = dyn_cast<ConstantArray>(G2->getInitializer())) {
1177 for (unsigned i = 0, e = T2->getNumElements(); i != e; ++i)
1178 Inits.push_back(I->getOperand(i));
1180 assert(isa<ConstantAggregateZero>(G2->getInitializer()));
1181 Constant *CV = Context.getNullValue(T2->getElementType());
1182 for (unsigned i = 0, e = T2->getNumElements(); i != e; ++i)
1183 Inits.push_back(CV);
1185 NG->setInitializer(ConstantArray::get(NewType, Inits));
1188 // Replace any uses of the two global variables with uses of the new
1191 // FIXME: This should rewrite simple/straight-forward uses such as
1192 // getelementptr instructions to not use the Cast!
1193 G1->replaceAllUsesWith(ConstantExpr::getBitCast(NG,
1195 G2->replaceAllUsesWith(ConstantExpr::getBitCast(NG,
1198 // Remove the two globals from the module now...
1199 M->getGlobalList().erase(G1);
1200 M->getGlobalList().erase(G2);
1202 // Put the new global into the AppendingVars map so that we can handle
1203 // linking of more than two vars...
1204 Second->second = NG;
1206 AppendingVars.erase(First);
1212 static bool ResolveAliases(Module *Dest) {
1213 for (Module::alias_iterator I = Dest->alias_begin(), E = Dest->alias_end();
1215 if (const GlobalValue *GV = I->resolveAliasedGlobal())
1216 if (GV != I && !GV->isDeclaration())
1217 I->replaceAllUsesWith(const_cast<GlobalValue*>(GV));
1222 // LinkModules - This function links two modules together, with the resulting
1223 // left module modified to be the composite of the two input modules. If an
1224 // error occurs, true is returned and ErrorMsg (if not null) is set to indicate
1225 // the problem. Upon failure, the Dest module could be in a modified state, and
1226 // shouldn't be relied on to be consistent.
1228 Linker::LinkModules(Module *Dest, Module *Src, std::string *ErrorMsg) {
1229 assert(Dest != 0 && "Invalid Destination module");
1230 assert(Src != 0 && "Invalid Source Module");
1232 if (Dest->getDataLayout().empty()) {
1233 if (!Src->getDataLayout().empty()) {
1234 Dest->setDataLayout(Src->getDataLayout());
1236 std::string DataLayout;
1238 if (Dest->getEndianness() == Module::AnyEndianness) {
1239 if (Src->getEndianness() == Module::BigEndian)
1240 DataLayout.append("E");
1241 else if (Src->getEndianness() == Module::LittleEndian)
1242 DataLayout.append("e");
1245 if (Dest->getPointerSize() == Module::AnyPointerSize) {
1246 if (Src->getPointerSize() == Module::Pointer64)
1247 DataLayout.append(DataLayout.length() == 0 ? "p:64:64" : "-p:64:64");
1248 else if (Src->getPointerSize() == Module::Pointer32)
1249 DataLayout.append(DataLayout.length() == 0 ? "p:32:32" : "-p:32:32");
1251 Dest->setDataLayout(DataLayout);
1255 // Copy the target triple from the source to dest if the dest's is empty.
1256 if (Dest->getTargetTriple().empty() && !Src->getTargetTriple().empty())
1257 Dest->setTargetTriple(Src->getTargetTriple());
1259 if (!Src->getDataLayout().empty() && !Dest->getDataLayout().empty() &&
1260 Src->getDataLayout() != Dest->getDataLayout())
1261 cerr << "WARNING: Linking two modules of different data layouts!\n";
1262 if (!Src->getTargetTriple().empty() &&
1263 Dest->getTargetTriple() != Src->getTargetTriple())
1264 cerr << "WARNING: Linking two modules of different target triples!\n";
1266 // Append the module inline asm string.
1267 if (!Src->getModuleInlineAsm().empty()) {
1268 if (Dest->getModuleInlineAsm().empty())
1269 Dest->setModuleInlineAsm(Src->getModuleInlineAsm());
1271 Dest->setModuleInlineAsm(Dest->getModuleInlineAsm()+"\n"+
1272 Src->getModuleInlineAsm());
1275 // Update the destination module's dependent libraries list with the libraries
1276 // from the source module. There's no opportunity for duplicates here as the
1277 // Module ensures that duplicate insertions are discarded.
1278 for (Module::lib_iterator SI = Src->lib_begin(), SE = Src->lib_end();
1280 Dest->addLibrary(*SI);
1282 // LinkTypes - Go through the symbol table of the Src module and see if any
1283 // types are named in the src module that are not named in the Dst module.
1284 // Make sure there are no type name conflicts.
1285 if (LinkTypes(Dest, Src, ErrorMsg))
1288 // ValueMap - Mapping of values from what they used to be in Src, to what they
1290 std::map<const Value*, Value*> ValueMap;
1292 // AppendingVars - Keep track of global variables in the destination module
1293 // with appending linkage. After the module is linked together, they are
1294 // appended and the module is rewritten.
1295 std::multimap<std::string, GlobalVariable *> AppendingVars;
1296 for (Module::global_iterator I = Dest->global_begin(), E = Dest->global_end();
1298 // Add all of the appending globals already in the Dest module to
1300 if (I->hasAppendingLinkage())
1301 AppendingVars.insert(std::make_pair(I->getName(), I));
1304 // Insert all of the globals in src into the Dest module... without linking
1305 // initializers (which could refer to functions not yet mapped over).
1306 if (LinkGlobals(Dest, Src, ValueMap, AppendingVars, ErrorMsg))
1309 // Link the functions together between the two modules, without doing function
1310 // bodies... this just adds external function prototypes to the Dest
1311 // function... We do this so that when we begin processing function bodies,
1312 // all of the global values that may be referenced are available in our
1314 if (LinkFunctionProtos(Dest, Src, ValueMap, ErrorMsg))
1317 // If there were any alias, link them now. We really need to do this now,
1318 // because all of the aliases that may be referenced need to be available in
1320 if (LinkAlias(Dest, Src, ValueMap, ErrorMsg)) return true;
1322 // Update the initializers in the Dest module now that all globals that may
1323 // be referenced are in Dest.
1324 if (LinkGlobalInits(Dest, Src, ValueMap, ErrorMsg)) return true;
1326 // Link in the function bodies that are defined in the source module into the
1327 // DestModule. This consists basically of copying the function over and
1328 // fixing up references to values.
1329 if (LinkFunctionBodies(Dest, Src, ValueMap, ErrorMsg)) return true;
1331 // If there were any appending global variables, link them together now.
1332 if (LinkAppendingVars(Dest, AppendingVars, ErrorMsg)) return true;
1334 // Resolve all uses of aliases with aliasees
1335 if (ResolveAliases(Dest)) return true;
1337 // If the source library's module id is in the dependent library list of the
1338 // destination library, remove it since that module is now linked in.
1340 modId.set(Src->getModuleIdentifier());
1341 if (!modId.isEmpty())
1342 Dest->removeLibrary(modId.getBasename());