1 //===- lib/Linker/IRMover.cpp ---------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "llvm/Linker/IRMover.h" 11 #include "LinkDiagnosticInfo.h" 12 #include "llvm/ADT/SetVector.h" 13 #include "llvm/ADT/SmallString.h" 14 #include "llvm/ADT/Triple.h" 15 #include "llvm/IR/Constants.h" 16 #include "llvm/IR/DebugInfo.h" 17 #include "llvm/IR/DiagnosticPrinter.h" 18 #include "llvm/IR/GVMaterializer.h" 19 #include "llvm/IR/Intrinsics.h" 20 #include "llvm/IR/TypeFinder.h" 21 #include "llvm/Support/Error.h" 22 #include "llvm/Transforms/Utils/Cloning.h" 23 #include <utility> 24 using namespace llvm; 25 26 //===----------------------------------------------------------------------===// 27 // TypeMap implementation. 28 //===----------------------------------------------------------------------===// 29 30 namespace { 31 class TypeMapTy : public ValueMapTypeRemapper { 32 /// This is a mapping from a source type to a destination type to use. 33 DenseMap<Type *, Type *> MappedTypes; 34 35 /// When checking to see if two subgraphs are isomorphic, we speculatively 36 /// add types to MappedTypes, but keep track of them here in case we need to 37 /// roll back. 38 SmallVector<Type *, 16> SpeculativeTypes; 39 40 SmallVector<StructType *, 16> SpeculativeDstOpaqueTypes; 41 42 /// This is a list of non-opaque structs in the source module that are mapped 43 /// to an opaque struct in the destination module. 44 SmallVector<StructType *, 16> SrcDefinitionsToResolve; 45 46 /// This is the set of opaque types in the destination modules who are 47 /// getting a body from the source module. 48 SmallPtrSet<StructType *, 16> DstResolvedOpaqueTypes; 49 50 public: 51 TypeMapTy(IRMover::IdentifiedStructTypeSet &DstStructTypesSet) 52 : DstStructTypesSet(DstStructTypesSet) {} 53 54 IRMover::IdentifiedStructTypeSet &DstStructTypesSet; 55 /// Indicate that the specified type in the destination module is conceptually 56 /// equivalent to the specified type in the source module. 57 void addTypeMapping(Type *DstTy, Type *SrcTy); 58 59 /// Produce a body for an opaque type in the dest module from a type 60 /// definition in the source module. 61 void linkDefinedTypeBodies(); 62 63 /// Return the mapped type to use for the specified input type from the 64 /// source module. 65 Type *get(Type *SrcTy); 66 Type *get(Type *SrcTy, SmallPtrSet<StructType *, 8> &Visited); 67 68 void finishType(StructType *DTy, StructType *STy, ArrayRef<Type *> ETypes); 69 70 FunctionType *get(FunctionType *T) { 71 return cast<FunctionType>(get((Type *)T)); 72 } 73 74 private: 75 Type *remapType(Type *SrcTy) override { return get(SrcTy); } 76 77 bool areTypesIsomorphic(Type *DstTy, Type *SrcTy); 78 }; 79 } 80 81 void TypeMapTy::addTypeMapping(Type *DstTy, Type *SrcTy) { 82 assert(SpeculativeTypes.empty()); 83 assert(SpeculativeDstOpaqueTypes.empty()); 84 85 // Check to see if these types are recursively isomorphic and establish a 86 // mapping between them if so. 87 if (!areTypesIsomorphic(DstTy, SrcTy)) { 88 // Oops, they aren't isomorphic. Just discard this request by rolling out 89 // any speculative mappings we've established. 90 for (Type *Ty : SpeculativeTypes) 91 MappedTypes.erase(Ty); 92 93 SrcDefinitionsToResolve.resize(SrcDefinitionsToResolve.size() - 94 SpeculativeDstOpaqueTypes.size()); 95 for (StructType *Ty : SpeculativeDstOpaqueTypes) 96 DstResolvedOpaqueTypes.erase(Ty); 97 } else { 98 for (Type *Ty : SpeculativeTypes) 99 if (auto *STy = dyn_cast<StructType>(Ty)) 100 if (STy->hasName()) 101 STy->setName(""); 102 } 103 SpeculativeTypes.clear(); 104 SpeculativeDstOpaqueTypes.clear(); 105 } 106 107 /// Recursively walk this pair of types, returning true if they are isomorphic, 108 /// false if they are not. 109 bool TypeMapTy::areTypesIsomorphic(Type *DstTy, Type *SrcTy) { 110 // Two types with differing kinds are clearly not isomorphic. 111 if (DstTy->getTypeID() != SrcTy->getTypeID()) 112 return false; 113 114 // If we have an entry in the MappedTypes table, then we have our answer. 115 Type *&Entry = MappedTypes[SrcTy]; 116 if (Entry) 117 return Entry == DstTy; 118 119 // Two identical types are clearly isomorphic. Remember this 120 // non-speculatively. 121 if (DstTy == SrcTy) { 122 Entry = DstTy; 123 return true; 124 } 125 126 // Okay, we have two types with identical kinds that we haven't seen before. 127 128 // If this is an opaque struct type, special case it. 129 if (StructType *SSTy = dyn_cast<StructType>(SrcTy)) { 130 // Mapping an opaque type to any struct, just keep the dest struct. 131 if (SSTy->isOpaque()) { 132 Entry = DstTy; 133 SpeculativeTypes.push_back(SrcTy); 134 return true; 135 } 136 137 // Mapping a non-opaque source type to an opaque dest. If this is the first 138 // type that we're mapping onto this destination type then we succeed. Keep 139 // the dest, but fill it in later. If this is the second (different) type 140 // that we're trying to map onto the same opaque type then we fail. 141 if (cast<StructType>(DstTy)->isOpaque()) { 142 // We can only map one source type onto the opaque destination type. 143 if (!DstResolvedOpaqueTypes.insert(cast<StructType>(DstTy)).second) 144 return false; 145 SrcDefinitionsToResolve.push_back(SSTy); 146 SpeculativeTypes.push_back(SrcTy); 147 SpeculativeDstOpaqueTypes.push_back(cast<StructType>(DstTy)); 148 Entry = DstTy; 149 return true; 150 } 151 } 152 153 // If the number of subtypes disagree between the two types, then we fail. 154 if (SrcTy->getNumContainedTypes() != DstTy->getNumContainedTypes()) 155 return false; 156 157 // Fail if any of the extra properties (e.g. array size) of the type disagree. 158 if (isa<IntegerType>(DstTy)) 159 return false; // bitwidth disagrees. 160 if (PointerType *PT = dyn_cast<PointerType>(DstTy)) { 161 if (PT->getAddressSpace() != cast<PointerType>(SrcTy)->getAddressSpace()) 162 return false; 163 164 } else if (FunctionType *FT = dyn_cast<FunctionType>(DstTy)) { 165 if (FT->isVarArg() != cast<FunctionType>(SrcTy)->isVarArg()) 166 return false; 167 } else if (StructType *DSTy = dyn_cast<StructType>(DstTy)) { 168 StructType *SSTy = cast<StructType>(SrcTy); 169 if (DSTy->isLiteral() != SSTy->isLiteral() || 170 DSTy->isPacked() != SSTy->isPacked()) 171 return false; 172 } else if (auto *DSeqTy = dyn_cast<SequentialType>(DstTy)) { 173 if (DSeqTy->getNumElements() != 174 cast<SequentialType>(SrcTy)->getNumElements()) 175 return false; 176 } 177 178 // Otherwise, we speculate that these two types will line up and recursively 179 // check the subelements. 180 Entry = DstTy; 181 SpeculativeTypes.push_back(SrcTy); 182 183 for (unsigned I = 0, E = SrcTy->getNumContainedTypes(); I != E; ++I) 184 if (!areTypesIsomorphic(DstTy->getContainedType(I), 185 SrcTy->getContainedType(I))) 186 return false; 187 188 // If everything seems to have lined up, then everything is great. 189 return true; 190 } 191 192 void TypeMapTy::linkDefinedTypeBodies() { 193 SmallVector<Type *, 16> Elements; 194 for (StructType *SrcSTy : SrcDefinitionsToResolve) { 195 StructType *DstSTy = cast<StructType>(MappedTypes[SrcSTy]); 196 assert(DstSTy->isOpaque()); 197 198 // Map the body of the source type over to a new body for the dest type. 199 Elements.resize(SrcSTy->getNumElements()); 200 for (unsigned I = 0, E = Elements.size(); I != E; ++I) 201 Elements[I] = get(SrcSTy->getElementType(I)); 202 203 DstSTy->setBody(Elements, SrcSTy->isPacked()); 204 DstStructTypesSet.switchToNonOpaque(DstSTy); 205 } 206 SrcDefinitionsToResolve.clear(); 207 DstResolvedOpaqueTypes.clear(); 208 } 209 210 void TypeMapTy::finishType(StructType *DTy, StructType *STy, 211 ArrayRef<Type *> ETypes) { 212 DTy->setBody(ETypes, STy->isPacked()); 213 214 // Steal STy's name. 215 if (STy->hasName()) { 216 SmallString<16> TmpName = STy->getName(); 217 STy->setName(""); 218 DTy->setName(TmpName); 219 } 220 221 DstStructTypesSet.addNonOpaque(DTy); 222 } 223 224 Type *TypeMapTy::get(Type *Ty) { 225 SmallPtrSet<StructType *, 8> Visited; 226 return get(Ty, Visited); 227 } 228 229 Type *TypeMapTy::get(Type *Ty, SmallPtrSet<StructType *, 8> &Visited) { 230 // If we already have an entry for this type, return it. 231 Type **Entry = &MappedTypes[Ty]; 232 if (*Entry) 233 return *Entry; 234 235 // These are types that LLVM itself will unique. 236 bool IsUniqued = !isa<StructType>(Ty) || cast<StructType>(Ty)->isLiteral(); 237 238 #ifndef NDEBUG 239 if (!IsUniqued) { 240 for (auto &Pair : MappedTypes) { 241 assert(!(Pair.first != Ty && Pair.second == Ty) && 242 "mapping to a source type"); 243 } 244 } 245 #endif 246 247 if (!IsUniqued && !Visited.insert(cast<StructType>(Ty)).second) { 248 StructType *DTy = StructType::create(Ty->getContext()); 249 return *Entry = DTy; 250 } 251 252 // If this is not a recursive type, then just map all of the elements and 253 // then rebuild the type from inside out. 254 SmallVector<Type *, 4> ElementTypes; 255 256 // If there are no element types to map, then the type is itself. This is 257 // true for the anonymous {} struct, things like 'float', integers, etc. 258 if (Ty->getNumContainedTypes() == 0 && IsUniqued) 259 return *Entry = Ty; 260 261 // Remap all of the elements, keeping track of whether any of them change. 262 bool AnyChange = false; 263 ElementTypes.resize(Ty->getNumContainedTypes()); 264 for (unsigned I = 0, E = Ty->getNumContainedTypes(); I != E; ++I) { 265 ElementTypes[I] = get(Ty->getContainedType(I), Visited); 266 AnyChange |= ElementTypes[I] != Ty->getContainedType(I); 267 } 268 269 // If we found our type while recursively processing stuff, just use it. 270 Entry = &MappedTypes[Ty]; 271 if (*Entry) { 272 if (auto *DTy = dyn_cast<StructType>(*Entry)) { 273 if (DTy->isOpaque()) { 274 auto *STy = cast<StructType>(Ty); 275 finishType(DTy, STy, ElementTypes); 276 } 277 } 278 return *Entry; 279 } 280 281 // If all of the element types mapped directly over and the type is not 282 // a named struct, then the type is usable as-is. 283 if (!AnyChange && IsUniqued) 284 return *Entry = Ty; 285 286 // Otherwise, rebuild a modified type. 287 switch (Ty->getTypeID()) { 288 default: 289 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 auto *STy = cast<StructType>(Ty); 305 bool IsPacked = STy->isPacked(); 306 if (IsUniqued) 307 return *Entry = StructType::get(Ty->getContext(), ElementTypes, IsPacked); 308 309 // If the type is opaque, we can just use it directly. 310 if (STy->isOpaque()) { 311 DstStructTypesSet.addOpaque(STy); 312 return *Entry = Ty; 313 } 314 315 if (StructType *OldT = 316 DstStructTypesSet.findNonOpaque(ElementTypes, IsPacked)) { 317 STy->setName(""); 318 return *Entry = OldT; 319 } 320 321 if (!AnyChange) { 322 DstStructTypesSet.addNonOpaque(STy); 323 return *Entry = Ty; 324 } 325 326 StructType *DTy = StructType::create(Ty->getContext()); 327 finishType(DTy, STy, ElementTypes); 328 return *Entry = DTy; 329 } 330 } 331 } 332 333 LinkDiagnosticInfo::LinkDiagnosticInfo(DiagnosticSeverity Severity, 334 const Twine &Msg) 335 : DiagnosticInfo(DK_Linker, Severity), Msg(Msg) {} 336 void LinkDiagnosticInfo::print(DiagnosticPrinter &DP) const { DP << Msg; } 337 338 //===----------------------------------------------------------------------===// 339 // IRLinker implementation. 340 //===----------------------------------------------------------------------===// 341 342 namespace { 343 class IRLinker; 344 345 /// Creates prototypes for functions that are lazily linked on the fly. This 346 /// speeds up linking for modules with many/ lazily linked functions of which 347 /// few get used. 348 class GlobalValueMaterializer final : public ValueMaterializer { 349 IRLinker &TheIRLinker; 350 351 public: 352 GlobalValueMaterializer(IRLinker &TheIRLinker) : TheIRLinker(TheIRLinker) {} 353 Value *materialize(Value *V) override; 354 }; 355 356 class LocalValueMaterializer final : public ValueMaterializer { 357 IRLinker &TheIRLinker; 358 359 public: 360 LocalValueMaterializer(IRLinker &TheIRLinker) : TheIRLinker(TheIRLinker) {} 361 Value *materialize(Value *V) override; 362 }; 363 364 /// Type of the Metadata map in \a ValueToValueMapTy. 365 typedef DenseMap<const Metadata *, TrackingMDRef> MDMapT; 366 367 /// This is responsible for keeping track of the state used for moving data 368 /// from SrcM to DstM. 369 class IRLinker { 370 Module &DstM; 371 std::unique_ptr<Module> SrcM; 372 373 /// See IRMover::move(). 374 std::function<void(GlobalValue &, IRMover::ValueAdder)> AddLazyFor; 375 376 TypeMapTy TypeMap; 377 GlobalValueMaterializer GValMaterializer; 378 LocalValueMaterializer LValMaterializer; 379 380 /// A metadata map that's shared between IRLinker instances. 381 MDMapT &SharedMDs; 382 383 /// Mapping of values from what they used to be in Src, to what they are now 384 /// in DstM. ValueToValueMapTy is a ValueMap, which involves some overhead 385 /// due to the use of Value handles which the Linker doesn't actually need, 386 /// but this allows us to reuse the ValueMapper code. 387 ValueToValueMapTy ValueMap; 388 ValueToValueMapTy AliasValueMap; 389 390 DenseSet<GlobalValue *> ValuesToLink; 391 std::vector<GlobalValue *> Worklist; 392 393 void maybeAdd(GlobalValue *GV) { 394 if (ValuesToLink.insert(GV).second) 395 Worklist.push_back(GV); 396 } 397 398 /// Flag whether the ModuleInlineAsm string in Src should be linked with 399 /// (concatenated into) the ModuleInlineAsm string for the destination 400 /// module. It should be true for full LTO, but not when importing for 401 /// ThinLTO, otherwise we can have duplicate symbols. 402 bool LinkModuleInlineAsm; 403 404 /// Set to true when all global value body linking is complete (including 405 /// lazy linking). Used to prevent metadata linking from creating new 406 /// references. 407 bool DoneLinkingBodies = false; 408 409 /// The Error encountered during materialization. We use an Optional here to 410 /// avoid needing to manage an unconsumed success value. 411 Optional<Error> FoundError; 412 void setError(Error E) { 413 if (E) 414 FoundError = std::move(E); 415 } 416 417 /// Most of the errors produced by this module are inconvertible StringErrors. 418 /// This convenience function lets us return one of those more easily. 419 Error stringErr(const Twine &T) { 420 return make_error<StringError>(T, inconvertibleErrorCode()); 421 } 422 423 /// Entry point for mapping values and alternate context for mapping aliases. 424 ValueMapper Mapper; 425 unsigned AliasMCID; 426 427 /// Handles cloning of a global values from the source module into 428 /// the destination module, including setting the attributes and visibility. 429 GlobalValue *copyGlobalValueProto(const GlobalValue *SGV, bool ForDefinition); 430 431 void emitWarning(const Twine &Message) { 432 SrcM->getContext().diagnose(LinkDiagnosticInfo(DS_Warning, Message)); 433 } 434 435 /// Given a global in the source module, return the global in the 436 /// destination module that is being linked to, if any. 437 GlobalValue *getLinkedToGlobal(const GlobalValue *SrcGV) { 438 // If the source has no name it can't link. If it has local linkage, 439 // there is no name match-up going on. 440 if (!SrcGV->hasName() || SrcGV->hasLocalLinkage()) 441 return nullptr; 442 443 // Otherwise see if we have a match in the destination module's symtab. 444 GlobalValue *DGV = DstM.getNamedValue(SrcGV->getName()); 445 if (!DGV) 446 return nullptr; 447 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()) 451 return nullptr; 452 453 // Otherwise, we do in fact link to the destination global. 454 return DGV; 455 } 456 457 void computeTypeMapping(); 458 459 Expected<Constant *> linkAppendingVarProto(GlobalVariable *DstGV, 460 const GlobalVariable *SrcGV); 461 462 /// Given the GlobaValue \p SGV in the source module, and the matching 463 /// GlobalValue \p DGV (if any), return true if the linker will pull \p SGV 464 /// into the destination module. 465 /// 466 /// Note this code may call the client-provided \p AddLazyFor. 467 bool shouldLink(GlobalValue *DGV, GlobalValue &SGV); 468 Expected<Constant *> linkGlobalValueProto(GlobalValue *GV, bool ForAlias); 469 470 Error linkModuleFlagsMetadata(); 471 472 void linkGlobalVariable(GlobalVariable &Dst, GlobalVariable &Src); 473 Error linkFunctionBody(Function &Dst, Function &Src); 474 void linkAliasBody(GlobalAlias &Dst, GlobalAlias &Src); 475 Error linkGlobalValueBody(GlobalValue &Dst, GlobalValue &Src); 476 477 /// Functions that take care of cloning a specific global value type 478 /// into the destination module. 479 GlobalVariable *copyGlobalVariableProto(const GlobalVariable *SGVar); 480 Function *copyFunctionProto(const Function *SF); 481 GlobalValue *copyGlobalAliasProto(const GlobalAlias *SGA); 482 483 void linkNamedMDNodes(); 484 485 public: 486 IRLinker(Module &DstM, MDMapT &SharedMDs, 487 IRMover::IdentifiedStructTypeSet &Set, std::unique_ptr<Module> SrcM, 488 ArrayRef<GlobalValue *> ValuesToLink, 489 std::function<void(GlobalValue &, IRMover::ValueAdder)> AddLazyFor, 490 bool LinkModuleInlineAsm) 491 : DstM(DstM), SrcM(std::move(SrcM)), AddLazyFor(std::move(AddLazyFor)), 492 TypeMap(Set), GValMaterializer(*this), LValMaterializer(*this), 493 SharedMDs(SharedMDs), LinkModuleInlineAsm(LinkModuleInlineAsm), 494 Mapper(ValueMap, RF_MoveDistinctMDs | RF_IgnoreMissingLocals, &TypeMap, 495 &GValMaterializer), 496 AliasMCID(Mapper.registerAlternateMappingContext(AliasValueMap, 497 &LValMaterializer)) { 498 ValueMap.getMDMap() = std::move(SharedMDs); 499 for (GlobalValue *GV : ValuesToLink) 500 maybeAdd(GV); 501 } 502 ~IRLinker() { SharedMDs = std::move(*ValueMap.getMDMap()); } 503 504 Error run(); 505 Value *materialize(Value *V, bool ForAlias); 506 }; 507 } 508 509 /// The LLVM SymbolTable class autorenames globals that conflict in the symbol 510 /// table. This is good for all clients except for us. Go through the trouble 511 /// to force this back. 512 static void forceRenaming(GlobalValue *GV, StringRef Name) { 513 // If the global doesn't force its name or if it already has the right name, 514 // there is nothing for us to do. 515 if (GV->hasLocalLinkage() || GV->getName() == Name) 516 return; 517 518 Module *M = GV->getParent(); 519 520 // If there is a conflict, rename the conflict. 521 if (GlobalValue *ConflictGV = M->getNamedValue(Name)) { 522 GV->takeName(ConflictGV); 523 ConflictGV->setName(Name); // This will cause ConflictGV to get renamed 524 assert(ConflictGV->getName() != Name && "forceRenaming didn't work"); 525 } else { 526 GV->setName(Name); // Force the name back 527 } 528 } 529 530 Value *GlobalValueMaterializer::materialize(Value *SGV) { 531 return TheIRLinker.materialize(SGV, false); 532 } 533 534 Value *LocalValueMaterializer::materialize(Value *SGV) { 535 return TheIRLinker.materialize(SGV, true); 536 } 537 538 Value *IRLinker::materialize(Value *V, bool ForAlias) { 539 auto *SGV = dyn_cast<GlobalValue>(V); 540 if (!SGV) 541 return nullptr; 542 543 Expected<Constant *> NewProto = linkGlobalValueProto(SGV, ForAlias); 544 if (!NewProto) { 545 setError(NewProto.takeError()); 546 return nullptr; 547 } 548 if (!*NewProto) 549 return nullptr; 550 551 GlobalValue *New = dyn_cast<GlobalValue>(*NewProto); 552 if (!New) 553 return *NewProto; 554 555 // If we already created the body, just return. 556 if (auto *F = dyn_cast<Function>(New)) { 557 if (!F->isDeclaration()) 558 return New; 559 } else if (auto *V = dyn_cast<GlobalVariable>(New)) { 560 if (V->hasInitializer() || V->hasAppendingLinkage()) 561 return New; 562 } else { 563 auto *A = cast<GlobalAlias>(New); 564 if (A->getAliasee()) 565 return New; 566 } 567 568 // When linking a global for an alias, it will always be linked. However we 569 // need to check if it was not already scheduled to satisfy a reference from a 570 // regular global value initializer. We know if it has been schedule if the 571 // "New" GlobalValue that is mapped here for the alias is the same as the one 572 // already mapped. If there is an entry in the ValueMap but the value is 573 // different, it means that the value already had a definition in the 574 // destination module (linkonce for instance), but we need a new definition 575 // for the alias ("New" will be different. 576 if (ForAlias && ValueMap.lookup(SGV) == New) 577 return New; 578 579 if (ForAlias || shouldLink(New, *SGV)) 580 setError(linkGlobalValueBody(*New, *SGV)); 581 582 return New; 583 } 584 585 /// Loop through the global variables in the src module and merge them into the 586 /// dest module. 587 GlobalVariable *IRLinker::copyGlobalVariableProto(const GlobalVariable *SGVar) { 588 // No linking to be performed or linking from the source: simply create an 589 // identical version of the symbol over in the dest module... the 590 // initializer will be filled in later by LinkGlobalInits. 591 GlobalVariable *NewDGV = 592 new GlobalVariable(DstM, TypeMap.get(SGVar->getValueType()), 593 SGVar->isConstant(), GlobalValue::ExternalLinkage, 594 /*init*/ nullptr, SGVar->getName(), 595 /*insertbefore*/ nullptr, SGVar->getThreadLocalMode(), 596 SGVar->getType()->getAddressSpace()); 597 NewDGV->setAlignment(SGVar->getAlignment()); 598 return NewDGV; 599 } 600 601 /// Link the function in the source module into the destination module if 602 /// needed, setting up mapping information. 603 Function *IRLinker::copyFunctionProto(const Function *SF) { 604 // If there is no linkage to be performed or we are linking from the source, 605 // bring SF over. 606 return Function::Create(TypeMap.get(SF->getFunctionType()), 607 GlobalValue::ExternalLinkage, SF->getName(), &DstM); 608 } 609 610 /// Set up prototypes for any aliases that come over from the source module. 611 GlobalValue *IRLinker::copyGlobalAliasProto(const GlobalAlias *SGA) { 612 // If there is no linkage to be performed or we're linking from the source, 613 // bring over SGA. 614 auto *Ty = TypeMap.get(SGA->getValueType()); 615 return GlobalAlias::create(Ty, SGA->getType()->getPointerAddressSpace(), 616 GlobalValue::ExternalLinkage, SGA->getName(), 617 &DstM); 618 } 619 620 GlobalValue *IRLinker::copyGlobalValueProto(const GlobalValue *SGV, 621 bool ForDefinition) { 622 GlobalValue *NewGV; 623 if (auto *SGVar = dyn_cast<GlobalVariable>(SGV)) { 624 NewGV = copyGlobalVariableProto(SGVar); 625 } else if (auto *SF = dyn_cast<Function>(SGV)) { 626 NewGV = copyFunctionProto(SF); 627 } else { 628 if (ForDefinition) 629 NewGV = copyGlobalAliasProto(cast<GlobalAlias>(SGV)); 630 else 631 NewGV = new GlobalVariable( 632 DstM, TypeMap.get(SGV->getValueType()), 633 /*isConstant*/ false, GlobalValue::ExternalLinkage, 634 /*init*/ nullptr, SGV->getName(), 635 /*insertbefore*/ nullptr, SGV->getThreadLocalMode(), 636 SGV->getType()->getAddressSpace()); 637 } 638 639 if (ForDefinition) 640 NewGV->setLinkage(SGV->getLinkage()); 641 else if (SGV->hasExternalWeakLinkage()) 642 NewGV->setLinkage(GlobalValue::ExternalWeakLinkage); 643 644 NewGV->copyAttributesFrom(SGV); 645 646 if (auto *NewGO = dyn_cast<GlobalObject>(NewGV)) { 647 // Metadata for global variables and function declarations is copied eagerly. 648 if (isa<GlobalVariable>(SGV) || SGV->isDeclaration()) 649 NewGO->copyMetadata(cast<GlobalObject>(SGV), 0); 650 } 651 652 // Remove these copied constants in case this stays a declaration, since 653 // they point to the source module. If the def is linked the values will 654 // be mapped in during linkFunctionBody. 655 if (auto *NewF = dyn_cast<Function>(NewGV)) { 656 NewF->setPersonalityFn(nullptr); 657 NewF->setPrefixData(nullptr); 658 NewF->setPrologueData(nullptr); 659 } 660 661 return NewGV; 662 } 663 664 /// Loop over all of the linked values to compute type mappings. For example, 665 /// if we link "extern Foo *x" and "Foo *x = NULL", then we have two struct 666 /// types 'Foo' but one got renamed when the module was loaded into the same 667 /// LLVMContext. 668 void IRLinker::computeTypeMapping() { 669 for (GlobalValue &SGV : SrcM->globals()) { 670 GlobalValue *DGV = getLinkedToGlobal(&SGV); 671 if (!DGV) 672 continue; 673 674 if (!DGV->hasAppendingLinkage() || !SGV.hasAppendingLinkage()) { 675 TypeMap.addTypeMapping(DGV->getType(), SGV.getType()); 676 continue; 677 } 678 679 // Unify the element type of appending arrays. 680 ArrayType *DAT = cast<ArrayType>(DGV->getValueType()); 681 ArrayType *SAT = cast<ArrayType>(SGV.getValueType()); 682 TypeMap.addTypeMapping(DAT->getElementType(), SAT->getElementType()); 683 } 684 685 for (GlobalValue &SGV : *SrcM) 686 if (GlobalValue *DGV = getLinkedToGlobal(&SGV)) 687 TypeMap.addTypeMapping(DGV->getType(), SGV.getType()); 688 689 for (GlobalValue &SGV : SrcM->aliases()) 690 if (GlobalValue *DGV = getLinkedToGlobal(&SGV)) 691 TypeMap.addTypeMapping(DGV->getType(), SGV.getType()); 692 693 // Incorporate types by name, scanning all the types in the source module. 694 // At this point, the destination module may have a type "%foo = { i32 }" for 695 // example. When the source module got loaded into the same LLVMContext, if 696 // it had the same type, it would have been renamed to "%foo.42 = { i32 }". 697 std::vector<StructType *> Types = SrcM->getIdentifiedStructTypes(); 698 for (StructType *ST : Types) { 699 if (!ST->hasName()) 700 continue; 701 702 if (TypeMap.DstStructTypesSet.hasType(ST)) { 703 // This is actually a type from the destination module. 704 // getIdentifiedStructTypes() can have found it by walking debug info 705 // metadata nodes, some of which get linked by name when ODR Type Uniquing 706 // is enabled on the Context, from the source to the destination module. 707 continue; 708 } 709 710 // Check to see if there is a dot in the name followed by a digit. 711 size_t DotPos = ST->getName().rfind('.'); 712 if (DotPos == 0 || DotPos == StringRef::npos || 713 ST->getName().back() == '.' || 714 !isdigit(static_cast<unsigned char>(ST->getName()[DotPos + 1]))) 715 continue; 716 717 // Check to see if the destination module has a struct with the prefix name. 718 StructType *DST = DstM.getTypeByName(ST->getName().substr(0, DotPos)); 719 if (!DST) 720 continue; 721 722 // Don't use it if this actually came from the source module. They're in 723 // the same LLVMContext after all. Also don't use it unless the type is 724 // actually used in the destination module. This can happen in situations 725 // like this: 726 // 727 // Module A Module B 728 // -------- -------- 729 // %Z = type { %A } %B = type { %C.1 } 730 // %A = type { %B.1, [7 x i8] } %C.1 = type { i8* } 731 // %B.1 = type { %C } %A.2 = type { %B.3, [5 x i8] } 732 // %C = type { i8* } %B.3 = type { %C.1 } 733 // 734 // When we link Module B with Module A, the '%B' in Module B is 735 // used. However, that would then use '%C.1'. But when we process '%C.1', 736 // we prefer to take the '%C' version. So we are then left with both 737 // '%C.1' and '%C' being used for the same types. This leads to some 738 // variables using one type and some using the other. 739 if (TypeMap.DstStructTypesSet.hasType(DST)) 740 TypeMap.addTypeMapping(DST, ST); 741 } 742 743 // Now that we have discovered all of the type equivalences, get a body for 744 // any 'opaque' types in the dest module that are now resolved. 745 TypeMap.linkDefinedTypeBodies(); 746 } 747 748 static void getArrayElements(const Constant *C, 749 SmallVectorImpl<Constant *> &Dest) { 750 unsigned NumElements = cast<ArrayType>(C->getType())->getNumElements(); 751 752 for (unsigned i = 0; i != NumElements; ++i) 753 Dest.push_back(C->getAggregateElement(i)); 754 } 755 756 /// If there were any appending global variables, link them together now. 757 Expected<Constant *> 758 IRLinker::linkAppendingVarProto(GlobalVariable *DstGV, 759 const GlobalVariable *SrcGV) { 760 Type *EltTy = cast<ArrayType>(TypeMap.get(SrcGV->getValueType())) 761 ->getElementType(); 762 763 // FIXME: This upgrade is done during linking to support the C API. Once the 764 // old form is deprecated, we should move this upgrade to 765 // llvm::UpgradeGlobalVariable() and simplify the logic here and in 766 // Mapper::mapAppendingVariable() in ValueMapper.cpp. 767 StringRef Name = SrcGV->getName(); 768 bool IsNewStructor = false; 769 bool IsOldStructor = false; 770 if (Name == "llvm.global_ctors" || Name == "llvm.global_dtors") { 771 if (cast<StructType>(EltTy)->getNumElements() == 3) 772 IsNewStructor = true; 773 else 774 IsOldStructor = true; 775 } 776 777 PointerType *VoidPtrTy = Type::getInt8Ty(SrcGV->getContext())->getPointerTo(); 778 if (IsOldStructor) { 779 auto &ST = *cast<StructType>(EltTy); 780 Type *Tys[3] = {ST.getElementType(0), ST.getElementType(1), VoidPtrTy}; 781 EltTy = StructType::get(SrcGV->getContext(), Tys, false); 782 } 783 784 uint64_t DstNumElements = 0; 785 if (DstGV) { 786 ArrayType *DstTy = cast<ArrayType>(DstGV->getValueType()); 787 DstNumElements = DstTy->getNumElements(); 788 789 if (!SrcGV->hasAppendingLinkage() || !DstGV->hasAppendingLinkage()) 790 return stringErr( 791 "Linking globals named '" + SrcGV->getName() + 792 "': can only link appending global with another appending " 793 "global!"); 794 795 // Check to see that they two arrays agree on type. 796 if (EltTy != DstTy->getElementType()) 797 return stringErr("Appending variables with different element types!"); 798 if (DstGV->isConstant() != SrcGV->isConstant()) 799 return stringErr("Appending variables linked with different const'ness!"); 800 801 if (DstGV->getAlignment() != SrcGV->getAlignment()) 802 return stringErr( 803 "Appending variables with different alignment need to be linked!"); 804 805 if (DstGV->getVisibility() != SrcGV->getVisibility()) 806 return stringErr( 807 "Appending variables with different visibility need to be linked!"); 808 809 if (DstGV->hasGlobalUnnamedAddr() != SrcGV->hasGlobalUnnamedAddr()) 810 return stringErr( 811 "Appending variables with different unnamed_addr need to be linked!"); 812 813 if (DstGV->getSection() != SrcGV->getSection()) 814 return stringErr( 815 "Appending variables with different section name need to be linked!"); 816 } 817 818 SmallVector<Constant *, 16> SrcElements; 819 getArrayElements(SrcGV->getInitializer(), SrcElements); 820 821 if (IsNewStructor) { 822 auto It = remove_if(SrcElements, [this](Constant *E) { 823 auto *Key = 824 dyn_cast<GlobalValue>(E->getAggregateElement(2)->stripPointerCasts()); 825 if (!Key) 826 return false; 827 GlobalValue *DGV = getLinkedToGlobal(Key); 828 return !shouldLink(DGV, *Key); 829 }); 830 SrcElements.erase(It, SrcElements.end()); 831 } 832 uint64_t NewSize = DstNumElements + SrcElements.size(); 833 ArrayType *NewType = ArrayType::get(EltTy, NewSize); 834 835 // Create the new global variable. 836 GlobalVariable *NG = new GlobalVariable( 837 DstM, NewType, SrcGV->isConstant(), SrcGV->getLinkage(), 838 /*init*/ nullptr, /*name*/ "", DstGV, SrcGV->getThreadLocalMode(), 839 SrcGV->getType()->getAddressSpace()); 840 841 NG->copyAttributesFrom(SrcGV); 842 forceRenaming(NG, SrcGV->getName()); 843 844 Constant *Ret = ConstantExpr::getBitCast(NG, TypeMap.get(SrcGV->getType())); 845 846 Mapper.scheduleMapAppendingVariable(*NG, 847 DstGV ? DstGV->getInitializer() : nullptr, 848 IsOldStructor, SrcElements); 849 850 // Replace any uses of the two global variables with uses of the new 851 // global. 852 if (DstGV) { 853 DstGV->replaceAllUsesWith(ConstantExpr::getBitCast(NG, DstGV->getType())); 854 DstGV->eraseFromParent(); 855 } 856 857 return Ret; 858 } 859 860 bool IRLinker::shouldLink(GlobalValue *DGV, GlobalValue &SGV) { 861 if (ValuesToLink.count(&SGV) || SGV.hasLocalLinkage()) 862 return true; 863 864 if (DGV && !DGV->isDeclarationForLinker()) 865 return false; 866 867 if (SGV.hasAvailableExternallyLinkage()) 868 return true; 869 870 if (SGV.isDeclaration() || DoneLinkingBodies) 871 return false; 872 873 // Callback to the client to give a chance to lazily add the Global to the 874 // list of value to link. 875 bool LazilyAdded = false; 876 AddLazyFor(SGV, [this, &LazilyAdded](GlobalValue &GV) { 877 maybeAdd(&GV); 878 LazilyAdded = true; 879 }); 880 return LazilyAdded; 881 } 882 883 Expected<Constant *> IRLinker::linkGlobalValueProto(GlobalValue *SGV, 884 bool ForAlias) { 885 GlobalValue *DGV = getLinkedToGlobal(SGV); 886 887 bool ShouldLink = shouldLink(DGV, *SGV); 888 889 // just missing from map 890 if (ShouldLink) { 891 auto I = ValueMap.find(SGV); 892 if (I != ValueMap.end()) 893 return cast<Constant>(I->second); 894 895 I = AliasValueMap.find(SGV); 896 if (I != AliasValueMap.end()) 897 return cast<Constant>(I->second); 898 } 899 900 if (!ShouldLink && ForAlias) 901 DGV = nullptr; 902 903 // Handle the ultra special appending linkage case first. 904 assert(!DGV || SGV->hasAppendingLinkage() == DGV->hasAppendingLinkage()); 905 if (SGV->hasAppendingLinkage()) 906 return linkAppendingVarProto(cast_or_null<GlobalVariable>(DGV), 907 cast<GlobalVariable>(SGV)); 908 909 GlobalValue *NewGV; 910 if (DGV && !ShouldLink) { 911 NewGV = DGV; 912 } else { 913 // If we are done linking global value bodies (i.e. we are performing 914 // metadata linking), don't link in the global value due to this 915 // reference, simply map it to null. 916 if (DoneLinkingBodies) 917 return nullptr; 918 919 NewGV = copyGlobalValueProto(SGV, ShouldLink); 920 if (ShouldLink || !ForAlias) 921 forceRenaming(NewGV, SGV->getName()); 922 } 923 924 // Overloaded intrinsics have overloaded types names as part of their 925 // names. If we renamed overloaded types we should rename the intrinsic 926 // as well. 927 if (Function *F = dyn_cast<Function>(NewGV)) 928 if (auto Remangled = Intrinsic::remangleIntrinsicFunction(F)) 929 NewGV = Remangled.getValue(); 930 931 if (ShouldLink || ForAlias) { 932 if (const Comdat *SC = SGV->getComdat()) { 933 if (auto *GO = dyn_cast<GlobalObject>(NewGV)) { 934 Comdat *DC = DstM.getOrInsertComdat(SC->getName()); 935 DC->setSelectionKind(SC->getSelectionKind()); 936 GO->setComdat(DC); 937 } 938 } 939 } 940 941 if (!ShouldLink && ForAlias) 942 NewGV->setLinkage(GlobalValue::InternalLinkage); 943 944 Constant *C = NewGV; 945 if (DGV) 946 C = ConstantExpr::getBitCast(NewGV, TypeMap.get(SGV->getType())); 947 948 if (DGV && NewGV != DGV) { 949 DGV->replaceAllUsesWith(ConstantExpr::getBitCast(NewGV, DGV->getType())); 950 DGV->eraseFromParent(); 951 } 952 953 return C; 954 } 955 956 /// Update the initializers in the Dest module now that all globals that may be 957 /// referenced are in Dest. 958 void IRLinker::linkGlobalVariable(GlobalVariable &Dst, GlobalVariable &Src) { 959 // Figure out what the initializer looks like in the dest module. 960 Mapper.scheduleMapGlobalInitializer(Dst, *Src.getInitializer()); 961 } 962 963 /// Copy the source function over into the dest function and fix up references 964 /// to values. At this point we know that Dest is an external function, and 965 /// that Src is not. 966 Error IRLinker::linkFunctionBody(Function &Dst, Function &Src) { 967 assert(Dst.isDeclaration() && !Src.isDeclaration()); 968 969 // Materialize if needed. 970 if (Error Err = Src.materialize()) 971 return Err; 972 973 // Link in the operands without remapping. 974 if (Src.hasPrefixData()) 975 Dst.setPrefixData(Src.getPrefixData()); 976 if (Src.hasPrologueData()) 977 Dst.setPrologueData(Src.getPrologueData()); 978 if (Src.hasPersonalityFn()) 979 Dst.setPersonalityFn(Src.getPersonalityFn()); 980 981 // Copy over the metadata attachments without remapping. 982 Dst.copyMetadata(&Src, 0); 983 984 // Steal arguments and splice the body of Src into Dst. 985 Dst.stealArgumentListFrom(Src); 986 Dst.getBasicBlockList().splice(Dst.end(), Src.getBasicBlockList()); 987 988 // Everything has been moved over. Remap it. 989 Mapper.scheduleRemapFunction(Dst); 990 return Error::success(); 991 } 992 993 void IRLinker::linkAliasBody(GlobalAlias &Dst, GlobalAlias &Src) { 994 Mapper.scheduleMapGlobalAliasee(Dst, *Src.getAliasee(), AliasMCID); 995 } 996 997 Error IRLinker::linkGlobalValueBody(GlobalValue &Dst, GlobalValue &Src) { 998 if (auto *F = dyn_cast<Function>(&Src)) 999 return linkFunctionBody(cast<Function>(Dst), *F); 1000 if (auto *GVar = dyn_cast<GlobalVariable>(&Src)) { 1001 linkGlobalVariable(cast<GlobalVariable>(Dst), *GVar); 1002 return Error::success(); 1003 } 1004 linkAliasBody(cast<GlobalAlias>(Dst), cast<GlobalAlias>(Src)); 1005 return Error::success(); 1006 } 1007 1008 /// Insert all of the named MDNodes in Src into the Dest module. 1009 void IRLinker::linkNamedMDNodes() { 1010 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata(); 1011 for (const NamedMDNode &NMD : SrcM->named_metadata()) { 1012 // Don't link module flags here. Do them separately. 1013 if (&NMD == SrcModFlags) 1014 continue; 1015 NamedMDNode *DestNMD = DstM.getOrInsertNamedMetadata(NMD.getName()); 1016 // Add Src elements into Dest node. 1017 for (const MDNode *Op : NMD.operands()) 1018 DestNMD->addOperand(Mapper.mapMDNode(*Op)); 1019 } 1020 } 1021 1022 /// Merge the linker flags in Src into the Dest module. 1023 Error IRLinker::linkModuleFlagsMetadata() { 1024 // If the source module has no module flags, we are done. 1025 const NamedMDNode *SrcModFlags = SrcM->getModuleFlagsMetadata(); 1026 if (!SrcModFlags) 1027 return Error::success(); 1028 1029 // If the destination module doesn't have module flags yet, then just copy 1030 // over the source module's flags. 1031 NamedMDNode *DstModFlags = DstM.getOrInsertModuleFlagsMetadata(); 1032 if (DstModFlags->getNumOperands() == 0) { 1033 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I) 1034 DstModFlags->addOperand(SrcModFlags->getOperand(I)); 1035 1036 return Error::success(); 1037 } 1038 1039 // First build a map of the existing module flags and requirements. 1040 DenseMap<MDString *, std::pair<MDNode *, unsigned>> Flags; 1041 SmallSetVector<MDNode *, 16> Requirements; 1042 for (unsigned I = 0, E = DstModFlags->getNumOperands(); I != E; ++I) { 1043 MDNode *Op = DstModFlags->getOperand(I); 1044 ConstantInt *Behavior = mdconst::extract<ConstantInt>(Op->getOperand(0)); 1045 MDString *ID = cast<MDString>(Op->getOperand(1)); 1046 1047 if (Behavior->getZExtValue() == Module::Require) { 1048 Requirements.insert(cast<MDNode>(Op->getOperand(2))); 1049 } else { 1050 Flags[ID] = std::make_pair(Op, I); 1051 } 1052 } 1053 1054 // Merge in the flags from the source module, and also collect its set of 1055 // requirements. 1056 for (unsigned I = 0, E = SrcModFlags->getNumOperands(); I != E; ++I) { 1057 MDNode *SrcOp = SrcModFlags->getOperand(I); 1058 ConstantInt *SrcBehavior = 1059 mdconst::extract<ConstantInt>(SrcOp->getOperand(0)); 1060 MDString *ID = cast<MDString>(SrcOp->getOperand(1)); 1061 MDNode *DstOp; 1062 unsigned DstIndex; 1063 std::tie(DstOp, DstIndex) = Flags.lookup(ID); 1064 unsigned SrcBehaviorValue = SrcBehavior->getZExtValue(); 1065 1066 // If this is a requirement, add it and continue. 1067 if (SrcBehaviorValue == Module::Require) { 1068 // If the destination module does not already have this requirement, add 1069 // it. 1070 if (Requirements.insert(cast<MDNode>(SrcOp->getOperand(2)))) { 1071 DstModFlags->addOperand(SrcOp); 1072 } 1073 continue; 1074 } 1075 1076 // If there is no existing flag with this ID, just add it. 1077 if (!DstOp) { 1078 Flags[ID] = std::make_pair(SrcOp, DstModFlags->getNumOperands()); 1079 DstModFlags->addOperand(SrcOp); 1080 continue; 1081 } 1082 1083 // Otherwise, perform a merge. 1084 ConstantInt *DstBehavior = 1085 mdconst::extract<ConstantInt>(DstOp->getOperand(0)); 1086 unsigned DstBehaviorValue = DstBehavior->getZExtValue(); 1087 1088 // If either flag has override behavior, handle it first. 1089 if (DstBehaviorValue == Module::Override) { 1090 // Diagnose inconsistent flags which both have override behavior. 1091 if (SrcBehaviorValue == Module::Override && 1092 SrcOp->getOperand(2) != DstOp->getOperand(2)) 1093 return stringErr("linking module flags '" + ID->getString() + 1094 "': IDs have conflicting override values"); 1095 continue; 1096 } else if (SrcBehaviorValue == Module::Override) { 1097 // Update the destination flag to that of the source. 1098 DstModFlags->setOperand(DstIndex, SrcOp); 1099 Flags[ID].first = SrcOp; 1100 continue; 1101 } 1102 1103 // Diagnose inconsistent merge behavior types. 1104 if (SrcBehaviorValue != DstBehaviorValue) 1105 return stringErr("linking module flags '" + ID->getString() + 1106 "': IDs have conflicting behaviors"); 1107 1108 auto replaceDstValue = [&](MDNode *New) { 1109 Metadata *FlagOps[] = {DstOp->getOperand(0), ID, New}; 1110 MDNode *Flag = MDNode::get(DstM.getContext(), FlagOps); 1111 DstModFlags->setOperand(DstIndex, Flag); 1112 Flags[ID].first = Flag; 1113 }; 1114 1115 // Perform the merge for standard behavior types. 1116 switch (SrcBehaviorValue) { 1117 case Module::Require: 1118 case Module::Override: 1119 llvm_unreachable("not possible"); 1120 case Module::Error: { 1121 // Emit an error if the values differ. 1122 if (SrcOp->getOperand(2) != DstOp->getOperand(2)) 1123 return stringErr("linking module flags '" + ID->getString() + 1124 "': IDs have conflicting values"); 1125 continue; 1126 } 1127 case Module::Warning: { 1128 // Emit a warning if the values differ. 1129 if (SrcOp->getOperand(2) != DstOp->getOperand(2)) { 1130 emitWarning("linking module flags '" + ID->getString() + 1131 "': IDs have conflicting values"); 1132 } 1133 continue; 1134 } 1135 case Module::Append: { 1136 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2)); 1137 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2)); 1138 SmallVector<Metadata *, 8> MDs; 1139 MDs.reserve(DstValue->getNumOperands() + SrcValue->getNumOperands()); 1140 MDs.append(DstValue->op_begin(), DstValue->op_end()); 1141 MDs.append(SrcValue->op_begin(), SrcValue->op_end()); 1142 1143 replaceDstValue(MDNode::get(DstM.getContext(), MDs)); 1144 break; 1145 } 1146 case Module::AppendUnique: { 1147 SmallSetVector<Metadata *, 16> Elts; 1148 MDNode *DstValue = cast<MDNode>(DstOp->getOperand(2)); 1149 MDNode *SrcValue = cast<MDNode>(SrcOp->getOperand(2)); 1150 Elts.insert(DstValue->op_begin(), DstValue->op_end()); 1151 Elts.insert(SrcValue->op_begin(), SrcValue->op_end()); 1152 1153 replaceDstValue(MDNode::get(DstM.getContext(), 1154 makeArrayRef(Elts.begin(), Elts.end()))); 1155 break; 1156 } 1157 } 1158 } 1159 1160 // Check all of the requirements. 1161 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) { 1162 MDNode *Requirement = Requirements[I]; 1163 MDString *Flag = cast<MDString>(Requirement->getOperand(0)); 1164 Metadata *ReqValue = Requirement->getOperand(1); 1165 1166 MDNode *Op = Flags[Flag].first; 1167 if (!Op || Op->getOperand(2) != ReqValue) 1168 return stringErr("linking module flags '" + Flag->getString() + 1169 "': does not have the required value"); 1170 } 1171 return Error::success(); 1172 } 1173 1174 // This function returns true if the triples match. 1175 static bool triplesMatch(const Triple &T0, const Triple &T1) { 1176 // If vendor is apple, ignore the version number. 1177 if (T0.getVendor() == Triple::Apple) 1178 return T0.getArch() == T1.getArch() && T0.getSubArch() == T1.getSubArch() && 1179 T0.getVendor() == T1.getVendor() && T0.getOS() == T1.getOS(); 1180 1181 return T0 == T1; 1182 } 1183 1184 // This function returns the merged triple. 1185 static std::string mergeTriples(const Triple &SrcTriple, 1186 const Triple &DstTriple) { 1187 // If vendor is apple, pick the triple with the larger version number. 1188 if (SrcTriple.getVendor() == Triple::Apple) 1189 if (DstTriple.isOSVersionLT(SrcTriple)) 1190 return SrcTriple.str(); 1191 1192 return DstTriple.str(); 1193 } 1194 1195 Error IRLinker::run() { 1196 // Ensure metadata materialized before value mapping. 1197 if (SrcM->getMaterializer()) 1198 if (Error Err = SrcM->getMaterializer()->materializeMetadata()) 1199 return Err; 1200 1201 // Inherit the target data from the source module if the destination module 1202 // doesn't have one already. 1203 if (DstM.getDataLayout().isDefault()) 1204 DstM.setDataLayout(SrcM->getDataLayout()); 1205 1206 if (SrcM->getDataLayout() != DstM.getDataLayout()) { 1207 emitWarning("Linking two modules of different data layouts: '" + 1208 SrcM->getModuleIdentifier() + "' is '" + 1209 SrcM->getDataLayoutStr() + "' whereas '" + 1210 DstM.getModuleIdentifier() + "' is '" + 1211 DstM.getDataLayoutStr() + "'\n"); 1212 } 1213 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()); 1217 1218 Triple SrcTriple(SrcM->getTargetTriple()), DstTriple(DstM.getTargetTriple()); 1219 1220 if (!SrcM->getTargetTriple().empty() && !triplesMatch(SrcTriple, DstTriple)) 1221 emitWarning("Linking two modules of different target triples: " + 1222 SrcM->getModuleIdentifier() + "' is '" + 1223 SrcM->getTargetTriple() + "' whereas '" + 1224 DstM.getModuleIdentifier() + "' is '" + DstM.getTargetTriple() + 1225 "'\n"); 1226 1227 DstM.setTargetTriple(mergeTriples(SrcTriple, DstTriple)); 1228 1229 // Append the module inline asm string. 1230 if (LinkModuleInlineAsm && !SrcM->getModuleInlineAsm().empty()) { 1231 if (DstM.getModuleInlineAsm().empty()) 1232 DstM.setModuleInlineAsm(SrcM->getModuleInlineAsm()); 1233 else 1234 DstM.setModuleInlineAsm(DstM.getModuleInlineAsm() + "\n" + 1235 SrcM->getModuleInlineAsm()); 1236 } 1237 1238 // Loop over all of the linked values to compute type mappings. 1239 computeTypeMapping(); 1240 1241 std::reverse(Worklist.begin(), Worklist.end()); 1242 while (!Worklist.empty()) { 1243 GlobalValue *GV = Worklist.back(); 1244 Worklist.pop_back(); 1245 1246 // Already mapped. 1247 if (ValueMap.find(GV) != ValueMap.end() || 1248 AliasValueMap.find(GV) != AliasValueMap.end()) 1249 continue; 1250 1251 assert(!GV->isDeclaration()); 1252 Mapper.mapValue(*GV); 1253 if (FoundError) 1254 return std::move(*FoundError); 1255 } 1256 1257 // Note that we are done linking global value bodies. This prevents 1258 // metadata linking from creating new references. 1259 DoneLinkingBodies = true; 1260 Mapper.addFlags(RF_NullMapMissingGlobalValues); 1261 1262 // Remap all of the named MDNodes in Src into the DstM module. We do this 1263 // after linking GlobalValues so that MDNodes that reference GlobalValues 1264 // are properly remapped. 1265 linkNamedMDNodes(); 1266 1267 // Merge the module flags into the DstM module. 1268 return linkModuleFlagsMetadata(); 1269 } 1270 1271 IRMover::StructTypeKeyInfo::KeyTy::KeyTy(ArrayRef<Type *> E, bool P) 1272 : ETypes(E), IsPacked(P) {} 1273 1274 IRMover::StructTypeKeyInfo::KeyTy::KeyTy(const StructType *ST) 1275 : ETypes(ST->elements()), IsPacked(ST->isPacked()) {} 1276 1277 bool IRMover::StructTypeKeyInfo::KeyTy::operator==(const KeyTy &That) const { 1278 return IsPacked == That.IsPacked && ETypes == That.ETypes; 1279 } 1280 1281 bool IRMover::StructTypeKeyInfo::KeyTy::operator!=(const KeyTy &That) const { 1282 return !this->operator==(That); 1283 } 1284 1285 StructType *IRMover::StructTypeKeyInfo::getEmptyKey() { 1286 return DenseMapInfo<StructType *>::getEmptyKey(); 1287 } 1288 1289 StructType *IRMover::StructTypeKeyInfo::getTombstoneKey() { 1290 return DenseMapInfo<StructType *>::getTombstoneKey(); 1291 } 1292 1293 unsigned IRMover::StructTypeKeyInfo::getHashValue(const KeyTy &Key) { 1294 return hash_combine(hash_combine_range(Key.ETypes.begin(), Key.ETypes.end()), 1295 Key.IsPacked); 1296 } 1297 1298 unsigned IRMover::StructTypeKeyInfo::getHashValue(const StructType *ST) { 1299 return getHashValue(KeyTy(ST)); 1300 } 1301 1302 bool IRMover::StructTypeKeyInfo::isEqual(const KeyTy &LHS, 1303 const StructType *RHS) { 1304 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 1305 return false; 1306 return LHS == KeyTy(RHS); 1307 } 1308 1309 bool IRMover::StructTypeKeyInfo::isEqual(const StructType *LHS, 1310 const StructType *RHS) { 1311 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 1312 return LHS == RHS; 1313 return KeyTy(LHS) == KeyTy(RHS); 1314 } 1315 1316 void IRMover::IdentifiedStructTypeSet::addNonOpaque(StructType *Ty) { 1317 assert(!Ty->isOpaque()); 1318 NonOpaqueStructTypes.insert(Ty); 1319 } 1320 1321 void IRMover::IdentifiedStructTypeSet::switchToNonOpaque(StructType *Ty) { 1322 assert(!Ty->isOpaque()); 1323 NonOpaqueStructTypes.insert(Ty); 1324 bool Removed = OpaqueStructTypes.erase(Ty); 1325 (void)Removed; 1326 assert(Removed); 1327 } 1328 1329 void IRMover::IdentifiedStructTypeSet::addOpaque(StructType *Ty) { 1330 assert(Ty->isOpaque()); 1331 OpaqueStructTypes.insert(Ty); 1332 } 1333 1334 StructType * 1335 IRMover::IdentifiedStructTypeSet::findNonOpaque(ArrayRef<Type *> ETypes, 1336 bool IsPacked) { 1337 IRMover::StructTypeKeyInfo::KeyTy Key(ETypes, IsPacked); 1338 auto I = NonOpaqueStructTypes.find_as(Key); 1339 return I == NonOpaqueStructTypes.end() ? nullptr : *I; 1340 } 1341 1342 bool IRMover::IdentifiedStructTypeSet::hasType(StructType *Ty) { 1343 if (Ty->isOpaque()) 1344 return OpaqueStructTypes.count(Ty); 1345 auto I = NonOpaqueStructTypes.find(Ty); 1346 return I == NonOpaqueStructTypes.end() ? false : *I == Ty; 1347 } 1348 1349 IRMover::IRMover(Module &M) : Composite(M) { 1350 TypeFinder StructTypes; 1351 StructTypes.run(M, /* OnlyNamed */ false); 1352 for (StructType *Ty : StructTypes) { 1353 if (Ty->isOpaque()) 1354 IdentifiedStructTypes.addOpaque(Ty); 1355 else 1356 IdentifiedStructTypes.addNonOpaque(Ty); 1357 } 1358 // Self-map metadatas in the destination module. This is needed when 1359 // DebugTypeODRUniquing is enabled on the LLVMContext, since metadata in the 1360 // destination module may be reached from the source module. 1361 for (auto *MD : StructTypes.getVisitedMetadata()) { 1362 SharedMDs[MD].reset(const_cast<MDNode *>(MD)); 1363 } 1364 } 1365 1366 Error IRMover::move( 1367 std::unique_ptr<Module> Src, ArrayRef<GlobalValue *> ValuesToLink, 1368 std::function<void(GlobalValue &, ValueAdder Add)> AddLazyFor, 1369 bool LinkModuleInlineAsm) { 1370 IRLinker TheIRLinker(Composite, SharedMDs, IdentifiedStructTypes, 1371 std::move(Src), ValuesToLink, std::move(AddLazyFor), 1372 LinkModuleInlineAsm); 1373 Error E = TheIRLinker.run(); 1374 Composite.dropTriviallyDeadConstantArrays(); 1375 return E; 1376 } 1377