1*1dc6a8d1SPeter Collingbourne //===- SplitModule.cpp - Split a module into partitions -------------------===//
2*1dc6a8d1SPeter Collingbourne //
3*1dc6a8d1SPeter Collingbourne //                     The LLVM Compiler Infrastructure
4*1dc6a8d1SPeter Collingbourne //
5*1dc6a8d1SPeter Collingbourne // This file is distributed under the University of Illinois Open Source
6*1dc6a8d1SPeter Collingbourne // License. See LICENSE.TXT for details.
7*1dc6a8d1SPeter Collingbourne //
8*1dc6a8d1SPeter Collingbourne //===----------------------------------------------------------------------===//
9*1dc6a8d1SPeter Collingbourne //
10*1dc6a8d1SPeter Collingbourne // This file defines the function llvm::SplitModule, which splits a module
11*1dc6a8d1SPeter Collingbourne // into multiple linkable partitions. It can be used to implement parallel code
12*1dc6a8d1SPeter Collingbourne // generation for link-time optimization.
13*1dc6a8d1SPeter Collingbourne //
14*1dc6a8d1SPeter Collingbourne //===----------------------------------------------------------------------===//
15*1dc6a8d1SPeter Collingbourne 
16*1dc6a8d1SPeter Collingbourne #include "llvm/Transforms/Utils/SplitModule.h"
17*1dc6a8d1SPeter Collingbourne #include "llvm/ADT/Hashing.h"
18*1dc6a8d1SPeter Collingbourne #include "llvm/IR/Function.h"
19*1dc6a8d1SPeter Collingbourne #include "llvm/IR/GlobalAlias.h"
20*1dc6a8d1SPeter Collingbourne #include "llvm/IR/GlobalObject.h"
21*1dc6a8d1SPeter Collingbourne #include "llvm/IR/GlobalValue.h"
22*1dc6a8d1SPeter Collingbourne #include "llvm/IR/Module.h"
23*1dc6a8d1SPeter Collingbourne #include "llvm/Support/MD5.h"
24*1dc6a8d1SPeter Collingbourne #include "llvm/Support/raw_ostream.h"
25*1dc6a8d1SPeter Collingbourne #include "llvm/Transforms/Utils/Cloning.h"
26*1dc6a8d1SPeter Collingbourne 
27*1dc6a8d1SPeter Collingbourne using namespace llvm;
28*1dc6a8d1SPeter Collingbourne 
29*1dc6a8d1SPeter Collingbourne static void externalize(GlobalValue *GV) {
30*1dc6a8d1SPeter Collingbourne   if (GV->hasLocalLinkage()) {
31*1dc6a8d1SPeter Collingbourne     GV->setLinkage(GlobalValue::ExternalLinkage);
32*1dc6a8d1SPeter Collingbourne     GV->setVisibility(GlobalValue::HiddenVisibility);
33*1dc6a8d1SPeter Collingbourne   }
34*1dc6a8d1SPeter Collingbourne 
35*1dc6a8d1SPeter Collingbourne   // Unnamed entities must be named consistently between modules. setName will
36*1dc6a8d1SPeter Collingbourne   // give a distinct name to each such entity.
37*1dc6a8d1SPeter Collingbourne   if (!GV->hasName())
38*1dc6a8d1SPeter Collingbourne     GV->setName("__llvmsplit_unnamed");
39*1dc6a8d1SPeter Collingbourne }
40*1dc6a8d1SPeter Collingbourne 
41*1dc6a8d1SPeter Collingbourne // Returns whether GV should be in partition (0-based) I of N.
42*1dc6a8d1SPeter Collingbourne static bool isInPartition(const GlobalValue *GV, unsigned I, unsigned N) {
43*1dc6a8d1SPeter Collingbourne   if (auto GA = dyn_cast<GlobalAlias>(GV))
44*1dc6a8d1SPeter Collingbourne     if (const GlobalObject *Base = GA->getBaseObject())
45*1dc6a8d1SPeter Collingbourne       GV = Base;
46*1dc6a8d1SPeter Collingbourne 
47*1dc6a8d1SPeter Collingbourne   StringRef Name;
48*1dc6a8d1SPeter Collingbourne   if (const Comdat *C = GV->getComdat())
49*1dc6a8d1SPeter Collingbourne     Name = C->getName();
50*1dc6a8d1SPeter Collingbourne   else
51*1dc6a8d1SPeter Collingbourne     Name = GV->getName();
52*1dc6a8d1SPeter Collingbourne 
53*1dc6a8d1SPeter Collingbourne   // Partition by MD5 hash. We only need a few bits for evenness as the number
54*1dc6a8d1SPeter Collingbourne   // of partitions will generally be in the 1-2 figure range; the low 16 bits
55*1dc6a8d1SPeter Collingbourne   // are enough.
56*1dc6a8d1SPeter Collingbourne   MD5 H;
57*1dc6a8d1SPeter Collingbourne   MD5::MD5Result R;
58*1dc6a8d1SPeter Collingbourne   H.update(Name);
59*1dc6a8d1SPeter Collingbourne   H.final(R);
60*1dc6a8d1SPeter Collingbourne   return (R[0] | (R[1] << 8)) % N == I;
61*1dc6a8d1SPeter Collingbourne }
62*1dc6a8d1SPeter Collingbourne 
63*1dc6a8d1SPeter Collingbourne void llvm::SplitModule(
64*1dc6a8d1SPeter Collingbourne     std::unique_ptr<Module> M, unsigned N,
65*1dc6a8d1SPeter Collingbourne     std::function<void(std::unique_ptr<Module> MPart)> ModuleCallback) {
66*1dc6a8d1SPeter Collingbourne   for (Function &F : *M)
67*1dc6a8d1SPeter Collingbourne     externalize(&F);
68*1dc6a8d1SPeter Collingbourne   for (GlobalVariable &GV : M->globals())
69*1dc6a8d1SPeter Collingbourne     externalize(&GV);
70*1dc6a8d1SPeter Collingbourne   for (GlobalAlias &GA : M->aliases())
71*1dc6a8d1SPeter Collingbourne     externalize(&GA);
72*1dc6a8d1SPeter Collingbourne 
73*1dc6a8d1SPeter Collingbourne   // FIXME: We should be able to reuse M as the last partition instead of
74*1dc6a8d1SPeter Collingbourne   // cloning it.
75*1dc6a8d1SPeter Collingbourne   for (unsigned I = 0; I != N; ++I) {
76*1dc6a8d1SPeter Collingbourne     ValueToValueMapTy VMap;
77*1dc6a8d1SPeter Collingbourne     std::unique_ptr<Module> MPart(
78*1dc6a8d1SPeter Collingbourne         CloneModule(M.get(), VMap, [=](const GlobalValue *GV) {
79*1dc6a8d1SPeter Collingbourne           return isInPartition(GV, I, N);
80*1dc6a8d1SPeter Collingbourne         }));
81*1dc6a8d1SPeter Collingbourne     if (I != 0)
82*1dc6a8d1SPeter Collingbourne       MPart->setModuleInlineAsm("");
83*1dc6a8d1SPeter Collingbourne     ModuleCallback(std::move(MPart));
84*1dc6a8d1SPeter Collingbourne   }
85*1dc6a8d1SPeter Collingbourne }
86