blob: 400b5e2031297893a41173d8862518cc2937024f [file] [log] [blame]
Chris Lattner424132a2003-04-18 04:34:29 +00001//===- ConstantMerge.cpp - Merge duplicate global constants ---------------===//
Misha Brukmanb1c93172005-04-21 23:48:37 +00002//
John Criswell482202a2003-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 Brukmanb1c93172005-04-21 23:48:37 +00007//
John Criswell482202a2003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Chris Lattner4816d632001-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 Lattner28d10352002-09-23 23:00:46 +000013// the program, regardless of whether or not an existing string is available.
Chris Lattner4816d632001-10-18 20:05:37 +000014//
15// Algorithm: ConstantMerge is designed to build up a map of available constants
Chris Lattner28d10352002-09-23 23:00:46 +000016// and eliminate duplicates when it is initialized.
Chris Lattner4816d632001-10-18 20:05:37 +000017//
18//===----------------------------------------------------------------------===//
19
Chris Lattner1631bcb2006-12-19 22:09:18 +000020#define DEBUG_TYPE "constmerge"
Chris Lattnerb0cec702002-07-23 19:57:40 +000021#include "llvm/Transforms/IPO.h"
Chris Lattnerd5d56782002-01-31 00:45:11 +000022#include "llvm/Module.h"
Chris Lattner04805fa2002-02-26 21:46:54 +000023#include "llvm/Pass.h"
Reid Spencer7c16caa2004-09-01 22:55:40 +000024#include "llvm/ADT/Statistic.h"
Reid Spencer557ab152007-02-05 23:32:05 +000025#include "llvm/Support/Compiler.h"
Chris Lattnerf52e03c2003-11-21 21:54:22 +000026using namespace llvm;
Brian Gaeke960707c2003-11-11 22:41:34 +000027
Chris Lattner1631bcb2006-12-19 22:09:18 +000028STATISTIC(NumMerged, "Number of global constants merged");
Chris Lattnereac4dcd2002-10-09 23:16:04 +000029
Chris Lattner1631bcb2006-12-19 22:09:18 +000030namespace {
Reid Spencer557ab152007-02-05 23:32:05 +000031 struct VISIBILITY_HIDDEN ConstantMerge : public ModulePass {
Chris Lattner2ae9cda2002-06-25 15:55:29 +000032 // run - For this pass, process all of the globals in the module,
33 // eliminating duplicate constants.
34 //
Chris Lattner4f2cf032004-09-20 04:48:05 +000035 bool runOnModule(Module &M);
Chris Lattner2ae9cda2002-06-25 15:55:29 +000036 };
Chris Lattner6788f252002-07-23 18:06:30 +000037
Chris Lattnerc2d3d312006-08-27 22:42:52 +000038 RegisterPass<ConstantMerge>X("constmerge","Merge Duplicate Global Constants");
Chris Lattner2ae9cda2002-06-25 15:55:29 +000039}
40
Chris Lattner4f2cf032004-09-20 04:48:05 +000041ModulePass *llvm::createConstantMergePass() { return new ConstantMerge(); }
Chris Lattner2ae9cda2002-06-25 15:55:29 +000042
Chris Lattner4f2cf032004-09-20 04:48:05 +000043bool ConstantMerge::runOnModule(Module &M) {
Chris Lattner7b87fd52006-03-07 17:56:59 +000044 // Map unique constant/section pairs to globals. We don't want to merge
45 // globals in different sections.
46 std::map<std::pair<Constant*, std::string>, GlobalVariable*> CMap;
Chris Lattnerc2ee0542003-12-22 23:49:36 +000047
48 // Replacements - This vector contains a list of replacements to perform.
49 std::vector<std::pair<GlobalVariable*, GlobalVariable*> > Replacements;
50
Chris Lattner56db5e92003-12-28 07:19:08 +000051 bool MadeChange = false;
Chris Lattner4816d632001-10-18 20:05:37 +000052
Chris Lattner56db5e92003-12-28 07:19:08 +000053 // Iterate constant merging while we are still making progress. Merging two
54 // constants together may allow us to merge other constants together if the
55 // second level constants have initializers which point to the globals that
56 // were just merged.
57 while (1) {
58 // First pass: identify all globals that can be merged together, filling in
59 // the Replacements vector. We cannot do the replacement in this pass
60 // because doing so may cause initializers of other globals to be rewritten,
61 // invalidating the Constant* pointers in CMap.
62 //
Chris Lattner6f588392007-04-14 18:06:52 +000063 for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
64 GVI != E; ) {
65 GlobalVariable *GV = GVI++;
66
Chris Lattner02137ee2007-04-14 01:11:54 +000067 // If this GV is dead, remove it.
68 GV->removeDeadConstantUsers();
69 if (GV->use_empty() && GV->hasInternalLinkage()) {
Jeff Cohen4bd0fd32007-04-14 17:18:29 +000070 GV->eraseFromParent();
71 continue;
Chris Lattner02137ee2007-04-14 01:11:54 +000072 }
73
Chris Lattner7b87fd52006-03-07 17:56:59 +000074 // Only process constants with initializers.
Chris Lattner56db5e92003-12-28 07:19:08 +000075 if (GV->isConstant() && GV->hasInitializer()) {
76 Constant *Init = GV->getInitializer();
Misha Brukmanb1c93172005-04-21 23:48:37 +000077
Chris Lattner7b87fd52006-03-07 17:56:59 +000078 // Check to see if the initializer is already known.
79 GlobalVariable *&Slot = CMap[std::make_pair(Init, GV->getSection())];
Misha Brukmanb1c93172005-04-21 23:48:37 +000080
Chris Lattner7b87fd52006-03-07 17:56:59 +000081 if (Slot == 0) { // Nope, add it to the map.
82 Slot = GV;
Chris Lattner56db5e92003-12-28 07:19:08 +000083 } else if (GV->hasInternalLinkage()) { // Yup, this is a duplicate!
84 // Make all uses of the duplicate constant use the canonical version.
Chris Lattner7b87fd52006-03-07 17:56:59 +000085 Replacements.push_back(std::make_pair(GV, Slot));
86 } else if (GV->hasInternalLinkage()) {
Chris Lattner56db5e92003-12-28 07:19:08 +000087 // Make all uses of the duplicate constant use the canonical version.
Chris Lattner7b87fd52006-03-07 17:56:59 +000088 Replacements.push_back(std::make_pair(Slot, GV));
89 Slot = GV;
Chris Lattner56db5e92003-12-28 07:19:08 +000090 }
Chris Lattner4816d632001-10-18 20:05:37 +000091 }
Chris Lattner02137ee2007-04-14 01:11:54 +000092 }
Misha Brukmanb1c93172005-04-21 23:48:37 +000093
Chris Lattner56db5e92003-12-28 07:19:08 +000094 if (Replacements.empty())
95 return MadeChange;
96 CMap.clear();
Misha Brukmanb1c93172005-04-21 23:48:37 +000097
Chris Lattner56db5e92003-12-28 07:19:08 +000098 // Now that we have figured out which replacements must be made, do them all
99 // now. This avoid invalidating the pointers in CMap, which are unneeded
100 // now.
101 for (unsigned i = 0, e = Replacements.size(); i != e; ++i) {
102 // Eliminate any uses of the dead global...
103 Replacements[i].first->replaceAllUsesWith(Replacements[i].second);
Misha Brukmanb1c93172005-04-21 23:48:37 +0000104
Chris Lattner56db5e92003-12-28 07:19:08 +0000105 // Delete the global value from the module...
106 M.getGlobalList().erase(Replacements[i].first);
107 }
Misha Brukmanb1c93172005-04-21 23:48:37 +0000108
Chris Lattner56db5e92003-12-28 07:19:08 +0000109 NumMerged += Replacements.size();
110 Replacements.clear();
Chris Lattnerc2ee0542003-12-22 23:49:36 +0000111 }
Chris Lattnerc2ee0542003-12-22 23:49:36 +0000112}