blob: c13b69fb51bc92bdd955fc1f573c04c04338019e [file] [log] [blame]
Chris Lattner156bcf32003-04-18 04:34:29 +00001//===- ConstantMerge.cpp - Merge duplicate global constants ---------------===//
Misha Brukmanfd939082005-04-21 23:48:37 +00002//
John Criswellb576c942003-10-20 19:43:21 +00003// 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.
Misha Brukmanfd939082005-04-21 23:48:37 +00007//
John Criswellb576c942003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
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 Lattner86453c52006-12-19 22:09:18 +000020#define DEBUG_TYPE "constmerge"
Chris Lattner9cfea852002-07-23 19:57:40 +000021#include "llvm/Transforms/IPO.h"
Chris Lattner793c6b82002-01-31 00:45:11 +000022#include "llvm/Module.h"
Chris Lattnerbd0ef772002-02-26 21:46:54 +000023#include "llvm/Pass.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000024#include "llvm/ADT/Statistic.h"
Reid Spencer9133fe22007-02-05 23:32:05 +000025#include "llvm/Support/Compiler.h"
Chris Lattner1e2385b2003-11-21 21:54:22 +000026using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000027
Chris Lattner86453c52006-12-19 22:09:18 +000028STATISTIC(NumMerged, "Number of global constants merged");
Chris Lattnerc67ebfa2002-10-09 23:16:04 +000029
Chris Lattner86453c52006-12-19 22:09:18 +000030namespace {
Reid Spencer9133fe22007-02-05 23:32:05 +000031 struct VISIBILITY_HIDDEN ConstantMerge : public ModulePass {
Devang Patel19974732007-05-03 01:11:54 +000032 static char ID; // Pass identifcation, replacement for typeid
Devang Patel794fd752007-05-01 21:15:47 +000033 ConstantMerge() : ModulePass((intptr_t)&ID) {}
34
Chris Lattner9234d032002-06-25 15:55:29 +000035 // run - For this pass, process all of the globals in the module,
36 // eliminating duplicate constants.
37 //
Chris Lattnerb12914b2004-09-20 04:48:05 +000038 bool runOnModule(Module &M);
Chris Lattner9234d032002-06-25 15:55:29 +000039 };
Chris Lattneraf41a122002-07-23 18:06:30 +000040
Devang Patel19974732007-05-03 01:11:54 +000041 char ConstantMerge::ID = 0;
Chris Lattner7f8897f2006-08-27 22:42:52 +000042 RegisterPass<ConstantMerge>X("constmerge","Merge Duplicate Global Constants");
Chris Lattner9234d032002-06-25 15:55:29 +000043}
44
Chris Lattnerb12914b2004-09-20 04:48:05 +000045ModulePass *llvm::createConstantMergePass() { return new ConstantMerge(); }
Chris Lattner9234d032002-06-25 15:55:29 +000046
Chris Lattnerb12914b2004-09-20 04:48:05 +000047bool ConstantMerge::runOnModule(Module &M) {
Chris Lattnere1c173b2006-03-07 17:56:59 +000048 // Map unique constant/section pairs to globals. We don't want to merge
49 // globals in different sections.
50 std::map<std::pair<Constant*, std::string>, GlobalVariable*> CMap;
Chris Lattnerb9723802003-12-22 23:49:36 +000051
52 // Replacements - This vector contains a list of replacements to perform.
53 std::vector<std::pair<GlobalVariable*, GlobalVariable*> > Replacements;
54
Chris Lattner0898c782003-12-28 07:19:08 +000055 bool MadeChange = false;
Chris Lattner475becb2001-10-18 20:05:37 +000056
Chris Lattner0898c782003-12-28 07:19:08 +000057 // Iterate constant merging while we are still making progress. Merging two
58 // constants together may allow us to merge other constants together if the
59 // second level constants have initializers which point to the globals that
60 // were just merged.
61 while (1) {
62 // First pass: identify all globals that can be merged together, filling in
63 // the Replacements vector. We cannot do the replacement in this pass
64 // because doing so may cause initializers of other globals to be rewritten,
65 // invalidating the Constant* pointers in CMap.
66 //
Chris Lattnerae143ce2007-04-14 18:06:52 +000067 for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
68 GVI != E; ) {
69 GlobalVariable *GV = GVI++;
70
Chris Lattner8264a9f2007-04-14 01:11:54 +000071 // If this GV is dead, remove it.
72 GV->removeDeadConstantUsers();
73 if (GV->use_empty() && GV->hasInternalLinkage()) {
Jeff Cohen98a72202007-04-14 17:18:29 +000074 GV->eraseFromParent();
75 continue;
Chris Lattner8264a9f2007-04-14 01:11:54 +000076 }
77
Chris Lattnere1c173b2006-03-07 17:56:59 +000078 // Only process constants with initializers.
Chris Lattner0898c782003-12-28 07:19:08 +000079 if (GV->isConstant() && GV->hasInitializer()) {
80 Constant *Init = GV->getInitializer();
Misha Brukmanfd939082005-04-21 23:48:37 +000081
Chris Lattnere1c173b2006-03-07 17:56:59 +000082 // Check to see if the initializer is already known.
83 GlobalVariable *&Slot = CMap[std::make_pair(Init, GV->getSection())];
Misha Brukmanfd939082005-04-21 23:48:37 +000084
Chris Lattnere1c173b2006-03-07 17:56:59 +000085 if (Slot == 0) { // Nope, add it to the map.
86 Slot = GV;
Chris Lattner0898c782003-12-28 07:19:08 +000087 } else if (GV->hasInternalLinkage()) { // Yup, this is a duplicate!
88 // Make all uses of the duplicate constant use the canonical version.
Chris Lattnere1c173b2006-03-07 17:56:59 +000089 Replacements.push_back(std::make_pair(GV, Slot));
90 } else if (GV->hasInternalLinkage()) {
Chris Lattner0898c782003-12-28 07:19:08 +000091 // Make all uses of the duplicate constant use the canonical version.
Chris Lattnere1c173b2006-03-07 17:56:59 +000092 Replacements.push_back(std::make_pair(Slot, GV));
93 Slot = GV;
Chris Lattner0898c782003-12-28 07:19:08 +000094 }
Chris Lattner475becb2001-10-18 20:05:37 +000095 }
Chris Lattner8264a9f2007-04-14 01:11:54 +000096 }
Misha Brukmanfd939082005-04-21 23:48:37 +000097
Chris Lattner0898c782003-12-28 07:19:08 +000098 if (Replacements.empty())
99 return MadeChange;
100 CMap.clear();
Misha Brukmanfd939082005-04-21 23:48:37 +0000101
Chris Lattner0898c782003-12-28 07:19:08 +0000102 // 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) {
106 // Eliminate any uses of the dead global...
107 Replacements[i].first->replaceAllUsesWith(Replacements[i].second);
Misha Brukmanfd939082005-04-21 23:48:37 +0000108
Chris Lattner0898c782003-12-28 07:19:08 +0000109 // Delete the global value from the module...
110 M.getGlobalList().erase(Replacements[i].first);
111 }
Misha Brukmanfd939082005-04-21 23:48:37 +0000112
Chris Lattner0898c782003-12-28 07:19:08 +0000113 NumMerged += Replacements.size();
114 Replacements.clear();
Chris Lattnerb9723802003-12-22 23:49:36 +0000115 }
Chris Lattnerb9723802003-12-22 23:49:36 +0000116}