blob: 0140228b63a33a3e630270da59a2992264d707ca [file] [log] [blame]
Chris Lattner156bcf32003-04-18 04:34:29 +00001//===- ConstantMerge.cpp - Merge duplicate global constants ---------------===//
John Criswellb576c942003-10-20 19:43:21 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
Chris Lattner475becb2001-10-18 20:05:37 +00009//
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
Chris Lattnere4314ed2002-09-23 23:00:46 +000013// the program, regardless of whether or not an existing string is available.
Chris Lattner475becb2001-10-18 20:05:37 +000014//
15// Algorithm: ConstantMerge is designed to build up a map of available constants
Chris Lattnere4314ed2002-09-23 23:00:46 +000016// and eliminate duplicates when it is initialized.
Chris Lattner475becb2001-10-18 20:05:37 +000017//
18//===----------------------------------------------------------------------===//
19
Chris Lattner9cfea852002-07-23 19:57:40 +000020#include "llvm/Transforms/IPO.h"
Chris Lattner793c6b82002-01-31 00:45:11 +000021#include "llvm/Module.h"
Chris Lattnerbd0ef772002-02-26 21:46:54 +000022#include "llvm/Pass.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000023#include "llvm/ADT/Statistic.h"
Chris Lattner1e2385b2003-11-21 21:54:22 +000024using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000025
Chris Lattner9234d032002-06-25 15:55:29 +000026namespace {
Chris Lattnerc67ebfa2002-10-09 23:16:04 +000027 Statistic<> NumMerged("constmerge", "Number of global constants merged");
28
Chris Lattnerb12914b2004-09-20 04:48:05 +000029 struct ConstantMerge : public ModulePass {
Chris Lattner9234d032002-06-25 15:55:29 +000030 // run - For this pass, process all of the globals in the module,
31 // eliminating duplicate constants.
32 //
Chris Lattnerb12914b2004-09-20 04:48:05 +000033 bool runOnModule(Module &M);
Chris Lattner9234d032002-06-25 15:55:29 +000034 };
Chris Lattneraf41a122002-07-23 18:06:30 +000035
Chris Lattner1e435162002-07-26 21:12:44 +000036 RegisterOpt<ConstantMerge> X("constmerge","Merge Duplicate Global Constants");
Chris Lattner9234d032002-06-25 15:55:29 +000037}
38
Chris Lattnerb12914b2004-09-20 04:48:05 +000039ModulePass *llvm::createConstantMergePass() { return new ConstantMerge(); }
Chris Lattner9234d032002-06-25 15:55:29 +000040
Chris Lattnerb12914b2004-09-20 04:48:05 +000041bool ConstantMerge::runOnModule(Module &M) {
Chris Lattner9234d032002-06-25 15:55:29 +000042 std::map<Constant*, GlobalVariable*> CMap;
Chris Lattnerb9723802003-12-22 23:49:36 +000043
44 // Replacements - This vector contains a list of replacements to perform.
45 std::vector<std::pair<GlobalVariable*, GlobalVariable*> > Replacements;
46
Chris Lattner0898c782003-12-28 07:19:08 +000047 bool MadeChange = false;
Chris Lattner475becb2001-10-18 20:05:37 +000048
Chris Lattner0898c782003-12-28 07:19:08 +000049 // Iterate constant merging while we are still making progress. Merging two
50 // constants together may allow us to merge other constants together if the
51 // second level constants have initializers which point to the globals that
52 // were just merged.
53 while (1) {
54 // First pass: identify all globals that can be merged together, filling in
55 // the Replacements vector. We cannot do the replacement in this pass
56 // because doing so may cause initializers of other globals to be rewritten,
57 // invalidating the Constant* pointers in CMap.
58 //
Chris Lattnere4d5c442005-03-15 04:54:21 +000059 for (Module::global_iterator GV = M.global_begin(), E = M.global_end(); GV != E; ++GV)
Chris Lattner0898c782003-12-28 07:19:08 +000060 // Only process constants with initializers
61 if (GV->isConstant() && GV->hasInitializer()) {
62 Constant *Init = GV->getInitializer();
63
64 // Check to see if the initializer is already known...
65 std::map<Constant*, GlobalVariable*>::iterator I = CMap.find(Init);
66
67 if (I == CMap.end()) { // Nope, add it to the map
68 CMap.insert(I, std::make_pair(Init, GV));
69 } else if (GV->hasInternalLinkage()) { // Yup, this is a duplicate!
70 // Make all uses of the duplicate constant use the canonical version.
71 Replacements.push_back(std::make_pair(GV, I->second));
72 } else if (I->second->hasInternalLinkage()) {
73 // Make all uses of the duplicate constant use the canonical version.
74 Replacements.push_back(std::make_pair(I->second, GV));
75 I->second = GV;
76 }
Chris Lattner475becb2001-10-18 20:05:37 +000077 }
Chris Lattnerb9723802003-12-22 23:49:36 +000078
Chris Lattner0898c782003-12-28 07:19:08 +000079 if (Replacements.empty())
80 return MadeChange;
81 CMap.clear();
82
83 // Now that we have figured out which replacements must be made, do them all
84 // now. This avoid invalidating the pointers in CMap, which are unneeded
85 // now.
86 for (unsigned i = 0, e = Replacements.size(); i != e; ++i) {
87 // Eliminate any uses of the dead global...
88 Replacements[i].first->replaceAllUsesWith(Replacements[i].second);
89
90 // Delete the global value from the module...
91 M.getGlobalList().erase(Replacements[i].first);
92 }
93
94 NumMerged += Replacements.size();
95 Replacements.clear();
Chris Lattnerb9723802003-12-22 23:49:36 +000096 }
Chris Lattnerb9723802003-12-22 23:49:36 +000097}