blob: 3c05f88027a623d9804d0bd65233b5c560840477 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===- ConstantMerge.cpp - Merge duplicate global constants ---------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner081ce942007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This file defines the interface to a pass that merges duplicate global
11// constants together into a single constant that is shared. This is useful
12// because some passes (ie TraceValues) insert a lot of string constants into
13// the program, regardless of whether or not an existing string is available.
14//
15// Algorithm: ConstantMerge is designed to build up a map of available constants
16// and eliminate duplicates when it is initialized.
17//
18//===----------------------------------------------------------------------===//
19
20#define DEBUG_TYPE "constmerge"
21#include "llvm/Transforms/IPO.h"
Chris Lattner93d4f352010-02-12 18:17:23 +000022#include "llvm/DerivedTypes.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000023#include "llvm/Module.h"
24#include "llvm/Pass.h"
Chris Lattner93d4f352010-02-12 18:17:23 +000025#include "llvm/ADT/DenseMap.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000026#include "llvm/ADT/Statistic.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000027using namespace llvm;
28
29STATISTIC(NumMerged, "Number of global constants merged");
30
31namespace {
Nick Lewycky492d06e2009-10-25 06:33:48 +000032 struct ConstantMerge : public ModulePass {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000033 static char ID; // Pass identification, replacement for typeid
Dan Gohman26f8c272008-09-04 17:05:41 +000034 ConstantMerge() : ModulePass(&ID) {}
Dan Gohmanf17a25c2007-07-18 16:29:46 +000035
36 // run - For this pass, process all of the globals in the module,
37 // eliminating duplicate constants.
38 //
39 bool runOnModule(Module &M);
40 };
Dan Gohmanf17a25c2007-07-18 16:29:46 +000041}
42
Dan Gohman089efff2008-05-13 00:00:25 +000043char ConstantMerge::ID = 0;
44static RegisterPass<ConstantMerge>
45X("constmerge", "Merge Duplicate Global Constants");
46
Dan Gohmanf17a25c2007-07-18 16:29:46 +000047ModulePass *llvm::createConstantMergePass() { return new ConstantMerge(); }
48
49bool ConstantMerge::runOnModule(Module &M) {
50 // Map unique constant/section pairs to globals. We don't want to merge
51 // globals in different sections.
Chris Lattner93d4f352010-02-12 18:17:23 +000052 DenseMap<Constant*, GlobalVariable*> CMap;
Dan Gohmanf17a25c2007-07-18 16:29:46 +000053
54 // Replacements - This vector contains a list of replacements to perform.
Chris Lattner93d4f352010-02-12 18:17:23 +000055 SmallVector<std::pair<GlobalVariable*, GlobalVariable*>, 32> Replacements;
Dan Gohmanf17a25c2007-07-18 16:29:46 +000056
57 bool MadeChange = false;
58
59 // Iterate constant merging while we are still making progress. Merging two
60 // constants together may allow us to merge other constants together if the
61 // second level constants have initializers which point to the globals that
62 // were just merged.
63 while (1) {
64 // First pass: identify all globals that can be merged together, filling in
65 // the Replacements vector. We cannot do the replacement in this pass
66 // because doing so may cause initializers of other globals to be rewritten,
67 // invalidating the Constant* pointers in CMap.
68 //
69 for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
70 GVI != E; ) {
71 GlobalVariable *GV = GVI++;
72
73 // If this GV is dead, remove it.
74 GV->removeDeadConstantUsers();
Rafael Espindolaa168fc92009-01-15 20:18:42 +000075 if (GV->use_empty() && GV->hasLocalLinkage()) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000076 GV->eraseFromParent();
77 continue;
78 }
79
Chris Lattner93d4f352010-02-12 18:17:23 +000080 // Only process constants with initializers in the default addres space.
81 if (!GV->isConstant() ||!GV->hasDefinitiveInitializer() ||
82 GV->getType()->getAddressSpace() != 0 || !GV->getSection().empty())
83 continue;
84
85 Constant *Init = GV->getInitializer();
Dan Gohmanf17a25c2007-07-18 16:29:46 +000086
Chris Lattner93d4f352010-02-12 18:17:23 +000087 // Check to see if the initializer is already known.
88 GlobalVariable *&Slot = CMap[Init];
Dan Gohmanf17a25c2007-07-18 16:29:46 +000089
Chris Lattner93d4f352010-02-12 18:17:23 +000090 if (Slot == 0) { // Nope, add it to the map.
91 Slot = GV;
92 } else if (GV->hasLocalLinkage()) { // Yup, this is a duplicate!
93 // Make all uses of the duplicate constant use the canonical version.
94 Replacements.push_back(std::make_pair(GV, Slot));
Dan Gohmanf17a25c2007-07-18 16:29:46 +000095 }
96 }
97
98 if (Replacements.empty())
99 return MadeChange;
100 CMap.clear();
101
102 // Now that we have figured out which replacements must be made, do them all
103 // now. This avoid invalidating the pointers in CMap, which are unneeded
104 // now.
105 for (unsigned i = 0, e = Replacements.size(); i != e; ++i) {
Chris Lattner93d4f352010-02-12 18:17:23 +0000106 // Eliminate any uses of the dead global.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000107 Replacements[i].first->replaceAllUsesWith(Replacements[i].second);
108
Chris Lattner93d4f352010-02-12 18:17:23 +0000109 // Delete the global value from the module.
110 Replacements[i].first->eraseFromParent();
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000111 }
112
113 NumMerged += Replacements.size();
114 Replacements.clear();
115 }
116}