1 //===- GlobalOpt.cpp - Optimize Global Variables --------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This pass transforms simple global variables that never have their address
11 // taken. If obviously true, it marks read/write globals as constant, deletes
12 // variables only stored to, etc.
14 //===----------------------------------------------------------------------===//
16 #define DEBUG_TYPE "globalopt"
17 #include "llvm/Transforms/IPO.h"
18 #include "llvm/CallingConv.h"
19 #include "llvm/Constants.h"
20 #include "llvm/DerivedTypes.h"
21 #include "llvm/Instructions.h"
22 #include "llvm/IntrinsicInst.h"
23 #include "llvm/Module.h"
24 #include "llvm/Pass.h"
25 #include "llvm/Analysis/ConstantFolding.h"
26 #include "llvm/Target/TargetData.h"
27 #include "llvm/Support/CallSite.h"
28 #include "llvm/Support/Compiler.h"
29 #include "llvm/Support/Debug.h"
30 #include "llvm/Support/GetElementPtrTypeIterator.h"
31 #include "llvm/Support/MathExtras.h"
32 #include "llvm/ADT/DenseMap.h"
33 #include "llvm/ADT/SmallPtrSet.h"
34 #include "llvm/ADT/SmallVector.h"
35 #include "llvm/ADT/Statistic.h"
36 #include "llvm/ADT/StringExtras.h"
37 #include "llvm/ADT/STLExtras.h"
41 STATISTIC(NumMarked , "Number of globals marked constant");
42 STATISTIC(NumSRA , "Number of aggregate globals broken into scalars");
43 STATISTIC(NumHeapSRA , "Number of heap objects SRA'd");
44 STATISTIC(NumSubstitute,"Number of globals with initializers stored into them");
45 STATISTIC(NumDeleted , "Number of globals deleted");
46 STATISTIC(NumFnDeleted , "Number of functions deleted");
47 STATISTIC(NumGlobUses , "Number of global uses devirtualized");
48 STATISTIC(NumLocalized , "Number of globals localized");
49 STATISTIC(NumShrunkToBool , "Number of global vars shrunk to booleans");
50 STATISTIC(NumFastCallFns , "Number of functions converted to fastcc");
51 STATISTIC(NumCtorsEvaluated, "Number of static ctors evaluated");
52 STATISTIC(NumNestRemoved , "Number of nest attributes removed");
53 STATISTIC(NumAliasesResolved, "Number of global aliases resolved");
54 STATISTIC(NumAliasesRemoved, "Number of global aliases eliminated");
57 struct VISIBILITY_HIDDEN GlobalOpt : public ModulePass {
58 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
59 AU.addRequired<TargetData>();
61 static char ID; // Pass identification, replacement for typeid
62 GlobalOpt() : ModulePass(&ID) {}
64 bool runOnModule(Module &M);
67 GlobalVariable *FindGlobalCtors(Module &M);
68 bool OptimizeFunctions(Module &M);
69 bool OptimizeGlobalVars(Module &M);
70 bool OptimizeGlobalAliases(Module &M);
71 bool OptimizeGlobalCtorsList(GlobalVariable *&GCL);
72 bool ProcessInternalGlobal(GlobalVariable *GV,Module::global_iterator &GVI);
76 char GlobalOpt::ID = 0;
77 static RegisterPass<GlobalOpt> X("globalopt", "Global Variable Optimizer");
79 ModulePass *llvm::createGlobalOptimizerPass() { return new GlobalOpt(); }
83 /// GlobalStatus - As we analyze each global, keep track of some information
84 /// about it. If we find out that the address of the global is taken, none of
85 /// this info will be accurate.
86 struct VISIBILITY_HIDDEN GlobalStatus {
87 /// isLoaded - True if the global is ever loaded. If the global isn't ever
88 /// loaded it can be deleted.
91 /// StoredType - Keep track of what stores to the global look like.
94 /// NotStored - There is no store to this global. It can thus be marked
98 /// isInitializerStored - This global is stored to, but the only thing
99 /// stored is the constant it was initialized with. This is only tracked
100 /// for scalar globals.
103 /// isStoredOnce - This global is stored to, but only its initializer and
104 /// one other value is ever stored to it. If this global isStoredOnce, we
105 /// track the value stored to it in StoredOnceValue below. This is only
106 /// tracked for scalar globals.
109 /// isStored - This global is stored to by multiple values or something else
110 /// that we cannot track.
114 /// StoredOnceValue - If only one value (besides the initializer constant) is
115 /// ever stored to this global, keep track of what value it is.
116 Value *StoredOnceValue;
118 /// AccessingFunction/HasMultipleAccessingFunctions - These start out
119 /// null/false. When the first accessing function is noticed, it is recorded.
120 /// When a second different accessing function is noticed,
121 /// HasMultipleAccessingFunctions is set to true.
122 Function *AccessingFunction;
123 bool HasMultipleAccessingFunctions;
125 /// HasNonInstructionUser - Set to true if this global has a user that is not
126 /// an instruction (e.g. a constant expr or GV initializer).
127 bool HasNonInstructionUser;
129 /// HasPHIUser - Set to true if this global has a user that is a PHI node.
132 GlobalStatus() : isLoaded(false), StoredType(NotStored), StoredOnceValue(0),
133 AccessingFunction(0), HasMultipleAccessingFunctions(false),
134 HasNonInstructionUser(false), HasPHIUser(false) {}
139 // SafeToDestroyConstant - It is safe to destroy a constant iff it is only used
140 // by constants itself. Note that constants cannot be cyclic, so this test is
141 // pretty easy to implement recursively.
143 static bool SafeToDestroyConstant(Constant *C) {
144 if (isa<GlobalValue>(C)) return false;
146 for (Value::use_iterator UI = C->use_begin(), E = C->use_end(); UI != E; ++UI)
147 if (Constant *CU = dyn_cast<Constant>(*UI)) {
148 if (!SafeToDestroyConstant(CU)) return false;
155 /// AnalyzeGlobal - Look at all uses of the global and fill in the GlobalStatus
156 /// structure. If the global has its address taken, return true to indicate we
157 /// can't do anything with it.
159 static bool AnalyzeGlobal(Value *V, GlobalStatus &GS,
160 SmallPtrSet<PHINode*, 16> &PHIUsers) {
161 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI)
162 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(*UI)) {
163 GS.HasNonInstructionUser = true;
165 if (AnalyzeGlobal(CE, GS, PHIUsers)) return true;
167 } else if (Instruction *I = dyn_cast<Instruction>(*UI)) {
168 if (!GS.HasMultipleAccessingFunctions) {
169 Function *F = I->getParent()->getParent();
170 if (GS.AccessingFunction == 0)
171 GS.AccessingFunction = F;
172 else if (GS.AccessingFunction != F)
173 GS.HasMultipleAccessingFunctions = true;
175 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
177 if (LI->isVolatile()) return true; // Don't hack on volatile loads.
178 } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
179 // Don't allow a store OF the address, only stores TO the address.
180 if (SI->getOperand(0) == V) return true;
182 if (SI->isVolatile()) return true; // Don't hack on volatile stores.
184 // If this is a direct store to the global (i.e., the global is a scalar
185 // value, not an aggregate), keep more specific information about
187 if (GS.StoredType != GlobalStatus::isStored) {
188 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(SI->getOperand(1))){
189 Value *StoredVal = SI->getOperand(0);
190 if (StoredVal == GV->getInitializer()) {
191 if (GS.StoredType < GlobalStatus::isInitializerStored)
192 GS.StoredType = GlobalStatus::isInitializerStored;
193 } else if (isa<LoadInst>(StoredVal) &&
194 cast<LoadInst>(StoredVal)->getOperand(0) == GV) {
196 if (GS.StoredType < GlobalStatus::isInitializerStored)
197 GS.StoredType = GlobalStatus::isInitializerStored;
198 } else if (GS.StoredType < GlobalStatus::isStoredOnce) {
199 GS.StoredType = GlobalStatus::isStoredOnce;
200 GS.StoredOnceValue = StoredVal;
201 } else if (GS.StoredType == GlobalStatus::isStoredOnce &&
202 GS.StoredOnceValue == StoredVal) {
205 GS.StoredType = GlobalStatus::isStored;
208 GS.StoredType = GlobalStatus::isStored;
211 } else if (isa<GetElementPtrInst>(I)) {
212 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
213 } else if (isa<SelectInst>(I)) {
214 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
215 } else if (PHINode *PN = dyn_cast<PHINode>(I)) {
216 // PHI nodes we can check just like select or GEP instructions, but we
217 // have to be careful about infinite recursion.
218 if (PHIUsers.insert(PN)) // Not already visited.
219 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
220 GS.HasPHIUser = true;
221 } else if (isa<CmpInst>(I)) {
222 } else if (isa<MemTransferInst>(I)) {
223 if (I->getOperand(1) == V)
224 GS.StoredType = GlobalStatus::isStored;
225 if (I->getOperand(2) == V)
227 } else if (isa<MemSetInst>(I)) {
228 assert(I->getOperand(1) == V && "Memset only takes one pointer!");
229 GS.StoredType = GlobalStatus::isStored;
231 return true; // Any other non-load instruction might take address!
233 } else if (Constant *C = dyn_cast<Constant>(*UI)) {
234 GS.HasNonInstructionUser = true;
235 // We might have a dead and dangling constant hanging off of here.
236 if (!SafeToDestroyConstant(C))
239 GS.HasNonInstructionUser = true;
240 // Otherwise must be some other user.
247 static Constant *getAggregateConstantElement(Constant *Agg, Constant *Idx) {
248 ConstantInt *CI = dyn_cast<ConstantInt>(Idx);
250 unsigned IdxV = CI->getZExtValue();
252 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(Agg)) {
253 if (IdxV < CS->getNumOperands()) return CS->getOperand(IdxV);
254 } else if (ConstantArray *CA = dyn_cast<ConstantArray>(Agg)) {
255 if (IdxV < CA->getNumOperands()) return CA->getOperand(IdxV);
256 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Agg)) {
257 if (IdxV < CP->getNumOperands()) return CP->getOperand(IdxV);
258 } else if (isa<ConstantAggregateZero>(Agg)) {
259 if (const StructType *STy = dyn_cast<StructType>(Agg->getType())) {
260 if (IdxV < STy->getNumElements())
261 return Constant::getNullValue(STy->getElementType(IdxV));
262 } else if (const SequentialType *STy =
263 dyn_cast<SequentialType>(Agg->getType())) {
264 return Constant::getNullValue(STy->getElementType());
266 } else if (isa<UndefValue>(Agg)) {
267 if (const StructType *STy = dyn_cast<StructType>(Agg->getType())) {
268 if (IdxV < STy->getNumElements())
269 return UndefValue::get(STy->getElementType(IdxV));
270 } else if (const SequentialType *STy =
271 dyn_cast<SequentialType>(Agg->getType())) {
272 return UndefValue::get(STy->getElementType());
279 /// CleanupConstantGlobalUsers - We just marked GV constant. Loop over all
280 /// users of the global, cleaning up the obvious ones. This is largely just a
281 /// quick scan over the use list to clean up the easy and obvious cruft. This
282 /// returns true if it made a change.
283 static bool CleanupConstantGlobalUsers(Value *V, Constant *Init) {
284 bool Changed = false;
285 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;) {
288 if (LoadInst *LI = dyn_cast<LoadInst>(U)) {
290 // Replace the load with the initializer.
291 LI->replaceAllUsesWith(Init);
292 LI->eraseFromParent();
295 } else if (StoreInst *SI = dyn_cast<StoreInst>(U)) {
296 // Store must be unreachable or storing Init into the global.
297 SI->eraseFromParent();
299 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(U)) {
300 if (CE->getOpcode() == Instruction::GetElementPtr) {
301 Constant *SubInit = 0;
303 SubInit = ConstantFoldLoadThroughGEPConstantExpr(Init, CE);
304 Changed |= CleanupConstantGlobalUsers(CE, SubInit);
305 } else if (CE->getOpcode() == Instruction::BitCast &&
306 isa<PointerType>(CE->getType())) {
307 // Pointer cast, delete any stores and memsets to the global.
308 Changed |= CleanupConstantGlobalUsers(CE, 0);
311 if (CE->use_empty()) {
312 CE->destroyConstant();
315 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(U)) {
316 // Do not transform "gepinst (gep constexpr (GV))" here, because forming
317 // "gepconstexpr (gep constexpr (GV))" will cause the two gep's to fold
318 // and will invalidate our notion of what Init is.
319 Constant *SubInit = 0;
320 if (!isa<ConstantExpr>(GEP->getOperand(0))) {
322 dyn_cast_or_null<ConstantExpr>(ConstantFoldInstruction(GEP));
323 if (Init && CE && CE->getOpcode() == Instruction::GetElementPtr)
324 SubInit = ConstantFoldLoadThroughGEPConstantExpr(Init, CE);
326 Changed |= CleanupConstantGlobalUsers(GEP, SubInit);
328 if (GEP->use_empty()) {
329 GEP->eraseFromParent();
332 } else if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(U)) { // memset/cpy/mv
333 if (MI->getRawDest() == V) {
334 MI->eraseFromParent();
338 } else if (Constant *C = dyn_cast<Constant>(U)) {
339 // If we have a chain of dead constantexprs or other things dangling from
340 // us, and if they are all dead, nuke them without remorse.
341 if (SafeToDestroyConstant(C)) {
342 C->destroyConstant();
343 // This could have invalidated UI, start over from scratch.
344 CleanupConstantGlobalUsers(V, Init);
352 /// isSafeSROAElementUse - Return true if the specified instruction is a safe
353 /// user of a derived expression from a global that we want to SROA.
354 static bool isSafeSROAElementUse(Value *V) {
355 // We might have a dead and dangling constant hanging off of here.
356 if (Constant *C = dyn_cast<Constant>(V))
357 return SafeToDestroyConstant(C);
359 Instruction *I = dyn_cast<Instruction>(V);
360 if (!I) return false;
363 if (isa<LoadInst>(I)) return true;
365 // Stores *to* the pointer are ok.
366 if (StoreInst *SI = dyn_cast<StoreInst>(I))
367 return SI->getOperand(0) != V;
369 // Otherwise, it must be a GEP.
370 GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I);
371 if (GEPI == 0) return false;
373 if (GEPI->getNumOperands() < 3 || !isa<Constant>(GEPI->getOperand(1)) ||
374 !cast<Constant>(GEPI->getOperand(1))->isNullValue())
377 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
379 if (!isSafeSROAElementUse(*I))
385 /// IsUserOfGlobalSafeForSRA - U is a direct user of the specified global value.
386 /// Look at it and its uses and decide whether it is safe to SROA this global.
388 static bool IsUserOfGlobalSafeForSRA(User *U, GlobalValue *GV) {
389 // The user of the global must be a GEP Inst or a ConstantExpr GEP.
390 if (!isa<GetElementPtrInst>(U) &&
391 (!isa<ConstantExpr>(U) ||
392 cast<ConstantExpr>(U)->getOpcode() != Instruction::GetElementPtr))
395 // Check to see if this ConstantExpr GEP is SRA'able. In particular, we
396 // don't like < 3 operand CE's, and we don't like non-constant integer
397 // indices. This enforces that all uses are 'gep GV, 0, C, ...' for some
399 if (U->getNumOperands() < 3 || !isa<Constant>(U->getOperand(1)) ||
400 !cast<Constant>(U->getOperand(1))->isNullValue() ||
401 !isa<ConstantInt>(U->getOperand(2)))
404 gep_type_iterator GEPI = gep_type_begin(U), E = gep_type_end(U);
405 ++GEPI; // Skip over the pointer index.
407 // If this is a use of an array allocation, do a bit more checking for sanity.
408 if (const ArrayType *AT = dyn_cast<ArrayType>(*GEPI)) {
409 uint64_t NumElements = AT->getNumElements();
410 ConstantInt *Idx = cast<ConstantInt>(U->getOperand(2));
412 // Check to make sure that index falls within the array. If not,
413 // something funny is going on, so we won't do the optimization.
415 if (Idx->getZExtValue() >= NumElements)
418 // We cannot scalar repl this level of the array unless any array
419 // sub-indices are in-range constants. In particular, consider:
420 // A[0][i]. We cannot know that the user isn't doing invalid things like
421 // allowing i to index an out-of-range subscript that accesses A[1].
423 // Scalar replacing *just* the outer index of the array is probably not
424 // going to be a win anyway, so just give up.
425 for (++GEPI; // Skip array index.
426 GEPI != E && (isa<ArrayType>(*GEPI) || isa<VectorType>(*GEPI));
428 uint64_t NumElements;
429 if (const ArrayType *SubArrayTy = dyn_cast<ArrayType>(*GEPI))
430 NumElements = SubArrayTy->getNumElements();
432 NumElements = cast<VectorType>(*GEPI)->getNumElements();
434 ConstantInt *IdxVal = dyn_cast<ConstantInt>(GEPI.getOperand());
435 if (!IdxVal || IdxVal->getZExtValue() >= NumElements)
440 for (Value::use_iterator I = U->use_begin(), E = U->use_end(); I != E; ++I)
441 if (!isSafeSROAElementUse(*I))
446 /// GlobalUsersSafeToSRA - Look at all uses of the global and decide whether it
447 /// is safe for us to perform this transformation.
449 static bool GlobalUsersSafeToSRA(GlobalValue *GV) {
450 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end();
452 if (!IsUserOfGlobalSafeForSRA(*UI, GV))
459 /// SRAGlobal - Perform scalar replacement of aggregates on the specified global
460 /// variable. This opens the door for other optimizations by exposing the
461 /// behavior of the program in a more fine-grained way. We have determined that
462 /// this transformation is safe already. We return the first global variable we
463 /// insert so that the caller can reprocess it.
464 static GlobalVariable *SRAGlobal(GlobalVariable *GV, const TargetData &TD) {
465 // Make sure this global only has simple uses that we can SRA.
466 if (!GlobalUsersSafeToSRA(GV))
469 assert(GV->hasLocalLinkage() && !GV->isConstant());
470 Constant *Init = GV->getInitializer();
471 const Type *Ty = Init->getType();
473 std::vector<GlobalVariable*> NewGlobals;
474 Module::GlobalListType &Globals = GV->getParent()->getGlobalList();
476 // Get the alignment of the global, either explicit or target-specific.
477 unsigned StartAlignment = GV->getAlignment();
478 if (StartAlignment == 0)
479 StartAlignment = TD.getABITypeAlignment(GV->getType());
481 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
482 NewGlobals.reserve(STy->getNumElements());
483 const StructLayout &Layout = *TD.getStructLayout(STy);
484 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
485 Constant *In = getAggregateConstantElement(Init,
486 ConstantInt::get(Type::Int32Ty, i));
487 assert(In && "Couldn't get element of initializer?");
488 GlobalVariable *NGV = new GlobalVariable(STy->getElementType(i), false,
489 GlobalVariable::InternalLinkage,
490 In, GV->getName()+"."+utostr(i),
493 GV->getType()->getAddressSpace());
494 Globals.insert(GV, NGV);
495 NewGlobals.push_back(NGV);
497 // Calculate the known alignment of the field. If the original aggregate
498 // had 256 byte alignment for example, something might depend on that:
499 // propagate info to each field.
500 uint64_t FieldOffset = Layout.getElementOffset(i);
501 unsigned NewAlign = (unsigned)MinAlign(StartAlignment, FieldOffset);
502 if (NewAlign > TD.getABITypeAlignment(STy->getElementType(i)))
503 NGV->setAlignment(NewAlign);
505 } else if (const SequentialType *STy = dyn_cast<SequentialType>(Ty)) {
506 unsigned NumElements = 0;
507 if (const ArrayType *ATy = dyn_cast<ArrayType>(STy))
508 NumElements = ATy->getNumElements();
510 NumElements = cast<VectorType>(STy)->getNumElements();
512 if (NumElements > 16 && GV->hasNUsesOrMore(16))
513 return 0; // It's not worth it.
514 NewGlobals.reserve(NumElements);
516 uint64_t EltSize = TD.getTypeAllocSize(STy->getElementType());
517 unsigned EltAlign = TD.getABITypeAlignment(STy->getElementType());
518 for (unsigned i = 0, e = NumElements; i != e; ++i) {
519 Constant *In = getAggregateConstantElement(Init,
520 ConstantInt::get(Type::Int32Ty, i));
521 assert(In && "Couldn't get element of initializer?");
523 GlobalVariable *NGV = new GlobalVariable(STy->getElementType(), false,
524 GlobalVariable::InternalLinkage,
525 In, GV->getName()+"."+utostr(i),
528 GV->getType()->getAddressSpace());
529 Globals.insert(GV, NGV);
530 NewGlobals.push_back(NGV);
532 // Calculate the known alignment of the field. If the original aggregate
533 // had 256 byte alignment for example, something might depend on that:
534 // propagate info to each field.
535 unsigned NewAlign = (unsigned)MinAlign(StartAlignment, EltSize*i);
536 if (NewAlign > EltAlign)
537 NGV->setAlignment(NewAlign);
541 if (NewGlobals.empty())
544 DOUT << "PERFORMING GLOBAL SRA ON: " << *GV;
546 Constant *NullInt = Constant::getNullValue(Type::Int32Ty);
548 // Loop over all of the uses of the global, replacing the constantexpr geps,
549 // with smaller constantexpr geps or direct references.
550 while (!GV->use_empty()) {
551 User *GEP = GV->use_back();
552 assert(((isa<ConstantExpr>(GEP) &&
553 cast<ConstantExpr>(GEP)->getOpcode()==Instruction::GetElementPtr)||
554 isa<GetElementPtrInst>(GEP)) && "NonGEP CE's are not SRAable!");
556 // Ignore the 1th operand, which has to be zero or else the program is quite
557 // broken (undefined). Get the 2nd operand, which is the structure or array
559 unsigned Val = cast<ConstantInt>(GEP->getOperand(2))->getZExtValue();
560 if (Val >= NewGlobals.size()) Val = 0; // Out of bound array access.
562 Value *NewPtr = NewGlobals[Val];
564 // Form a shorter GEP if needed.
565 if (GEP->getNumOperands() > 3) {
566 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(GEP)) {
567 SmallVector<Constant*, 8> Idxs;
568 Idxs.push_back(NullInt);
569 for (unsigned i = 3, e = CE->getNumOperands(); i != e; ++i)
570 Idxs.push_back(CE->getOperand(i));
571 NewPtr = ConstantExpr::getGetElementPtr(cast<Constant>(NewPtr),
572 &Idxs[0], Idxs.size());
574 GetElementPtrInst *GEPI = cast<GetElementPtrInst>(GEP);
575 SmallVector<Value*, 8> Idxs;
576 Idxs.push_back(NullInt);
577 for (unsigned i = 3, e = GEPI->getNumOperands(); i != e; ++i)
578 Idxs.push_back(GEPI->getOperand(i));
579 NewPtr = GetElementPtrInst::Create(NewPtr, Idxs.begin(), Idxs.end(),
580 GEPI->getName()+"."+utostr(Val), GEPI);
583 GEP->replaceAllUsesWith(NewPtr);
585 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(GEP))
586 GEPI->eraseFromParent();
588 cast<ConstantExpr>(GEP)->destroyConstant();
591 // Delete the old global, now that it is dead.
595 // Loop over the new globals array deleting any globals that are obviously
596 // dead. This can arise due to scalarization of a structure or an array that
597 // has elements that are dead.
598 unsigned FirstGlobal = 0;
599 for (unsigned i = 0, e = NewGlobals.size(); i != e; ++i)
600 if (NewGlobals[i]->use_empty()) {
601 Globals.erase(NewGlobals[i]);
602 if (FirstGlobal == i) ++FirstGlobal;
605 return FirstGlobal != NewGlobals.size() ? NewGlobals[FirstGlobal] : 0;
608 /// AllUsesOfValueWillTrapIfNull - Return true if all users of the specified
609 /// value will trap if the value is dynamically null. PHIs keeps track of any
610 /// phi nodes we've seen to avoid reprocessing them.
611 static bool AllUsesOfValueWillTrapIfNull(Value *V,
612 SmallPtrSet<PHINode*, 8> &PHIs) {
613 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI)
614 if (isa<LoadInst>(*UI)) {
616 } else if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
617 if (SI->getOperand(0) == V) {
618 //cerr << "NONTRAPPING USE: " << **UI;
619 return false; // Storing the value.
621 } else if (CallInst *CI = dyn_cast<CallInst>(*UI)) {
622 if (CI->getOperand(0) != V) {
623 //cerr << "NONTRAPPING USE: " << **UI;
624 return false; // Not calling the ptr
626 } else if (InvokeInst *II = dyn_cast<InvokeInst>(*UI)) {
627 if (II->getOperand(0) != V) {
628 //cerr << "NONTRAPPING USE: " << **UI;
629 return false; // Not calling the ptr
631 } else if (BitCastInst *CI = dyn_cast<BitCastInst>(*UI)) {
632 if (!AllUsesOfValueWillTrapIfNull(CI, PHIs)) return false;
633 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(*UI)) {
634 if (!AllUsesOfValueWillTrapIfNull(GEPI, PHIs)) return false;
635 } else if (PHINode *PN = dyn_cast<PHINode>(*UI)) {
636 // If we've already seen this phi node, ignore it, it has already been
639 return AllUsesOfValueWillTrapIfNull(PN, PHIs);
640 } else if (isa<ICmpInst>(*UI) &&
641 isa<ConstantPointerNull>(UI->getOperand(1))) {
642 // Ignore setcc X, null
644 //cerr << "NONTRAPPING USE: " << **UI;
650 /// AllUsesOfLoadedValueWillTrapIfNull - Return true if all uses of any loads
651 /// from GV will trap if the loaded value is null. Note that this also permits
652 /// comparisons of the loaded value against null, as a special case.
653 static bool AllUsesOfLoadedValueWillTrapIfNull(GlobalVariable *GV) {
654 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end(); UI!=E; ++UI)
655 if (LoadInst *LI = dyn_cast<LoadInst>(*UI)) {
656 SmallPtrSet<PHINode*, 8> PHIs;
657 if (!AllUsesOfValueWillTrapIfNull(LI, PHIs))
659 } else if (isa<StoreInst>(*UI)) {
660 // Ignore stores to the global.
662 // We don't know or understand this user, bail out.
663 //cerr << "UNKNOWN USER OF GLOBAL!: " << **UI;
670 static bool OptimizeAwayTrappingUsesOfValue(Value *V, Constant *NewV) {
671 bool Changed = false;
672 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ) {
673 Instruction *I = cast<Instruction>(*UI++);
674 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
675 LI->setOperand(0, NewV);
677 } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
678 if (SI->getOperand(1) == V) {
679 SI->setOperand(1, NewV);
682 } else if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
683 if (I->getOperand(0) == V) {
684 // Calling through the pointer! Turn into a direct call, but be careful
685 // that the pointer is not also being passed as an argument.
686 I->setOperand(0, NewV);
688 bool PassedAsArg = false;
689 for (unsigned i = 1, e = I->getNumOperands(); i != e; ++i)
690 if (I->getOperand(i) == V) {
692 I->setOperand(i, NewV);
696 // Being passed as an argument also. Be careful to not invalidate UI!
700 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
701 Changed |= OptimizeAwayTrappingUsesOfValue(CI,
702 ConstantExpr::getCast(CI->getOpcode(),
703 NewV, CI->getType()));
704 if (CI->use_empty()) {
706 CI->eraseFromParent();
708 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
709 // Should handle GEP here.
710 SmallVector<Constant*, 8> Idxs;
711 Idxs.reserve(GEPI->getNumOperands()-1);
712 for (User::op_iterator i = GEPI->op_begin() + 1, e = GEPI->op_end();
714 if (Constant *C = dyn_cast<Constant>(*i))
718 if (Idxs.size() == GEPI->getNumOperands()-1)
719 Changed |= OptimizeAwayTrappingUsesOfValue(GEPI,
720 ConstantExpr::getGetElementPtr(NewV, &Idxs[0],
722 if (GEPI->use_empty()) {
724 GEPI->eraseFromParent();
733 /// OptimizeAwayTrappingUsesOfLoads - The specified global has only one non-null
734 /// value stored into it. If there are uses of the loaded value that would trap
735 /// if the loaded value is dynamically null, then we know that they cannot be
736 /// reachable with a null optimize away the load.
737 static bool OptimizeAwayTrappingUsesOfLoads(GlobalVariable *GV, Constant *LV) {
738 bool Changed = false;
740 // Keep track of whether we are able to remove all the uses of the global
741 // other than the store that defines it.
742 bool AllNonStoreUsesGone = true;
744 // Replace all uses of loads with uses of uses of the stored value.
745 for (Value::use_iterator GUI = GV->use_begin(), E = GV->use_end(); GUI != E;){
746 User *GlobalUser = *GUI++;
747 if (LoadInst *LI = dyn_cast<LoadInst>(GlobalUser)) {
748 Changed |= OptimizeAwayTrappingUsesOfValue(LI, LV);
749 // If we were able to delete all uses of the loads
750 if (LI->use_empty()) {
751 LI->eraseFromParent();
754 AllNonStoreUsesGone = false;
756 } else if (isa<StoreInst>(GlobalUser)) {
757 // Ignore the store that stores "LV" to the global.
758 assert(GlobalUser->getOperand(1) == GV &&
759 "Must be storing *to* the global");
761 AllNonStoreUsesGone = false;
763 // If we get here we could have other crazy uses that are transitively
765 assert((isa<PHINode>(GlobalUser) || isa<SelectInst>(GlobalUser) ||
766 isa<ConstantExpr>(GlobalUser)) && "Only expect load and stores!");
771 DOUT << "OPTIMIZED LOADS FROM STORED ONCE POINTER: " << *GV;
775 // If we nuked all of the loads, then none of the stores are needed either,
776 // nor is the global.
777 if (AllNonStoreUsesGone) {
778 DOUT << " *** GLOBAL NOW DEAD!\n";
779 CleanupConstantGlobalUsers(GV, 0);
780 if (GV->use_empty()) {
781 GV->eraseFromParent();
789 /// ConstantPropUsersOf - Walk the use list of V, constant folding all of the
790 /// instructions that are foldable.
791 static void ConstantPropUsersOf(Value *V) {
792 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; )
793 if (Instruction *I = dyn_cast<Instruction>(*UI++))
794 if (Constant *NewC = ConstantFoldInstruction(I)) {
795 I->replaceAllUsesWith(NewC);
797 // Advance UI to the next non-I use to avoid invalidating it!
798 // Instructions could multiply use V.
799 while (UI != E && *UI == I)
801 I->eraseFromParent();
805 /// OptimizeGlobalAddressOfMalloc - This function takes the specified global
806 /// variable, and transforms the program as if it always contained the result of
807 /// the specified malloc. Because it is always the result of the specified
808 /// malloc, there is no reason to actually DO the malloc. Instead, turn the
809 /// malloc into a global, and any loads of GV as uses of the new global.
810 static GlobalVariable *OptimizeGlobalAddressOfMalloc(GlobalVariable *GV,
812 DOUT << "PROMOTING MALLOC GLOBAL: " << *GV << " MALLOC = " << *MI;
813 ConstantInt *NElements = cast<ConstantInt>(MI->getArraySize());
815 if (NElements->getZExtValue() != 1) {
816 // If we have an array allocation, transform it to a single element
817 // allocation to make the code below simpler.
818 Type *NewTy = ArrayType::get(MI->getAllocatedType(),
819 NElements->getZExtValue());
821 new MallocInst(NewTy, Constant::getNullValue(Type::Int32Ty),
822 MI->getAlignment(), MI->getName(), MI);
824 Indices[0] = Indices[1] = Constant::getNullValue(Type::Int32Ty);
825 Value *NewGEP = GetElementPtrInst::Create(NewMI, Indices, Indices + 2,
826 NewMI->getName()+".el0", MI);
827 MI->replaceAllUsesWith(NewGEP);
828 MI->eraseFromParent();
832 // Create the new global variable. The contents of the malloc'd memory is
833 // undefined, so initialize with an undef value.
834 Constant *Init = UndefValue::get(MI->getAllocatedType());
835 GlobalVariable *NewGV = new GlobalVariable(MI->getAllocatedType(), false,
836 GlobalValue::InternalLinkage, Init,
837 GV->getName()+".body",
839 GV->isThreadLocal());
840 // FIXME: This new global should have the alignment returned by malloc. Code
841 // could depend on malloc returning large alignment (on the mac, 16 bytes) but
842 // this would only guarantee some lower alignment.
843 GV->getParent()->getGlobalList().insert(GV, NewGV);
845 // Anything that used the malloc now uses the global directly.
846 MI->replaceAllUsesWith(NewGV);
848 Constant *RepValue = NewGV;
849 if (NewGV->getType() != GV->getType()->getElementType())
850 RepValue = ConstantExpr::getBitCast(RepValue,
851 GV->getType()->getElementType());
853 // If there is a comparison against null, we will insert a global bool to
854 // keep track of whether the global was initialized yet or not.
855 GlobalVariable *InitBool =
856 new GlobalVariable(Type::Int1Ty, false, GlobalValue::InternalLinkage,
857 ConstantInt::getFalse(), GV->getName()+".init",
858 (Module *)NULL, GV->isThreadLocal());
859 bool InitBoolUsed = false;
861 // Loop over all uses of GV, processing them in turn.
862 std::vector<StoreInst*> Stores;
863 while (!GV->use_empty())
864 if (LoadInst *LI = dyn_cast<LoadInst>(GV->use_back())) {
865 while (!LI->use_empty()) {
866 Use &LoadUse = LI->use_begin().getUse();
867 if (!isa<ICmpInst>(LoadUse.getUser()))
870 ICmpInst *CI = cast<ICmpInst>(LoadUse.getUser());
871 // Replace the cmp X, 0 with a use of the bool value.
872 Value *LV = new LoadInst(InitBool, InitBool->getName()+".val", CI);
874 switch (CI->getPredicate()) {
875 default: assert(0 && "Unknown ICmp Predicate!");
876 case ICmpInst::ICMP_ULT:
877 case ICmpInst::ICMP_SLT:
878 LV = ConstantInt::getFalse(); // X < null -> always false
880 case ICmpInst::ICMP_ULE:
881 case ICmpInst::ICMP_SLE:
882 case ICmpInst::ICMP_EQ:
883 LV = BinaryOperator::CreateNot(LV, "notinit", CI);
885 case ICmpInst::ICMP_NE:
886 case ICmpInst::ICMP_UGE:
887 case ICmpInst::ICMP_SGE:
888 case ICmpInst::ICMP_UGT:
889 case ICmpInst::ICMP_SGT:
892 CI->replaceAllUsesWith(LV);
893 CI->eraseFromParent();
896 LI->eraseFromParent();
898 StoreInst *SI = cast<StoreInst>(GV->use_back());
899 // The global is initialized when the store to it occurs.
900 new StoreInst(ConstantInt::getTrue(), InitBool, SI);
901 SI->eraseFromParent();
904 // If the initialization boolean was used, insert it, otherwise delete it.
906 while (!InitBool->use_empty()) // Delete initializations
907 cast<Instruction>(InitBool->use_back())->eraseFromParent();
910 GV->getParent()->getGlobalList().insert(GV, InitBool);
913 // Now the GV is dead, nuke it and the malloc.
914 GV->eraseFromParent();
915 MI->eraseFromParent();
917 // To further other optimizations, loop over all users of NewGV and try to
918 // constant prop them. This will promote GEP instructions with constant
919 // indices into GEP constant-exprs, which will allow global-opt to hack on it.
920 ConstantPropUsersOf(NewGV);
921 if (RepValue != NewGV)
922 ConstantPropUsersOf(RepValue);
927 /// ValueIsOnlyUsedLocallyOrStoredToOneGlobal - Scan the use-list of V checking
928 /// to make sure that there are no complex uses of V. We permit simple things
929 /// like dereferencing the pointer, but not storing through the address, unless
930 /// it is to the specified global.
931 static bool ValueIsOnlyUsedLocallyOrStoredToOneGlobal(Instruction *V,
933 SmallPtrSet<PHINode*, 8> &PHIs) {
934 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
935 Instruction *Inst = cast<Instruction>(*UI);
937 if (isa<LoadInst>(Inst) || isa<CmpInst>(Inst)) {
938 continue; // Fine, ignore.
941 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
942 if (SI->getOperand(0) == V && SI->getOperand(1) != GV)
943 return false; // Storing the pointer itself... bad.
944 continue; // Otherwise, storing through it, or storing into GV... fine.
947 if (isa<GetElementPtrInst>(Inst)) {
948 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(Inst, GV, PHIs))
953 if (PHINode *PN = dyn_cast<PHINode>(Inst)) {
954 // PHIs are ok if all uses are ok. Don't infinitely recurse through PHI
957 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(PN, GV, PHIs))
962 if (BitCastInst *BCI = dyn_cast<BitCastInst>(Inst)) {
963 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(BCI, GV, PHIs))
973 /// ReplaceUsesOfMallocWithGlobal - The Alloc pointer is stored into GV
974 /// somewhere. Transform all uses of the allocation into loads from the
975 /// global and uses of the resultant pointer. Further, delete the store into
976 /// GV. This assumes that these value pass the
977 /// 'ValueIsOnlyUsedLocallyOrStoredToOneGlobal' predicate.
978 static void ReplaceUsesOfMallocWithGlobal(Instruction *Alloc,
979 GlobalVariable *GV) {
980 while (!Alloc->use_empty()) {
981 Instruction *U = cast<Instruction>(*Alloc->use_begin());
982 Instruction *InsertPt = U;
983 if (StoreInst *SI = dyn_cast<StoreInst>(U)) {
984 // If this is the store of the allocation into the global, remove it.
985 if (SI->getOperand(1) == GV) {
986 SI->eraseFromParent();
989 } else if (PHINode *PN = dyn_cast<PHINode>(U)) {
990 // Insert the load in the corresponding predecessor, not right before the
992 InsertPt = PN->getIncomingBlock(Alloc->use_begin())->getTerminator();
993 } else if (isa<BitCastInst>(U)) {
994 // Must be bitcast between the malloc and store to initialize the global.
995 ReplaceUsesOfMallocWithGlobal(U, GV);
996 U->eraseFromParent();
998 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(U)) {
999 // If this is a "GEP bitcast" and the user is a store to the global, then
1000 // just process it as a bitcast.
1001 if (GEPI->hasAllZeroIndices() && GEPI->hasOneUse())
1002 if (StoreInst *SI = dyn_cast<StoreInst>(GEPI->use_back()))
1003 if (SI->getOperand(1) == GV) {
1004 // Must be bitcast GEP between the malloc and store to initialize
1006 ReplaceUsesOfMallocWithGlobal(GEPI, GV);
1007 GEPI->eraseFromParent();
1012 // Insert a load from the global, and use it instead of the malloc.
1013 Value *NL = new LoadInst(GV, GV->getName()+".val", InsertPt);
1014 U->replaceUsesOfWith(Alloc, NL);
1018 /// LoadUsesSimpleEnoughForHeapSRA - Verify that all uses of V (a load, or a phi
1019 /// of a load) are simple enough to perform heap SRA on. This permits GEP's
1020 /// that index through the array and struct field, icmps of null, and PHIs.
1021 static bool LoadUsesSimpleEnoughForHeapSRA(Value *V,
1022 SmallPtrSet<PHINode*, 32> &LoadUsingPHIs,
1023 SmallPtrSet<PHINode*, 32> &LoadUsingPHIsPerLoad) {
1024 // We permit two users of the load: setcc comparing against the null
1025 // pointer, and a getelementptr of a specific form.
1026 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1027 Instruction *User = cast<Instruction>(*UI);
1029 // Comparison against null is ok.
1030 if (ICmpInst *ICI = dyn_cast<ICmpInst>(User)) {
1031 if (!isa<ConstantPointerNull>(ICI->getOperand(1)))
1036 // getelementptr is also ok, but only a simple form.
1037 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(User)) {
1038 // Must index into the array and into the struct.
1039 if (GEPI->getNumOperands() < 3)
1042 // Otherwise the GEP is ok.
1046 if (PHINode *PN = dyn_cast<PHINode>(User)) {
1047 if (!LoadUsingPHIsPerLoad.insert(PN))
1048 // This means some phi nodes are dependent on each other.
1049 // Avoid infinite looping!
1051 if (!LoadUsingPHIs.insert(PN))
1052 // If we have already analyzed this PHI, then it is safe.
1055 // Make sure all uses of the PHI are simple enough to transform.
1056 if (!LoadUsesSimpleEnoughForHeapSRA(PN,
1057 LoadUsingPHIs, LoadUsingPHIsPerLoad))
1063 // Otherwise we don't know what this is, not ok.
1071 /// AllGlobalLoadUsesSimpleEnoughForHeapSRA - If all users of values loaded from
1072 /// GV are simple enough to perform HeapSRA, return true.
1073 static bool AllGlobalLoadUsesSimpleEnoughForHeapSRA(GlobalVariable *GV,
1075 SmallPtrSet<PHINode*, 32> LoadUsingPHIs;
1076 SmallPtrSet<PHINode*, 32> LoadUsingPHIsPerLoad;
1077 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end(); UI != E;
1079 if (LoadInst *LI = dyn_cast<LoadInst>(*UI)) {
1080 if (!LoadUsesSimpleEnoughForHeapSRA(LI, LoadUsingPHIs,
1081 LoadUsingPHIsPerLoad))
1083 LoadUsingPHIsPerLoad.clear();
1086 // If we reach here, we know that all uses of the loads and transitive uses
1087 // (through PHI nodes) are simple enough to transform. However, we don't know
1088 // that all inputs the to the PHI nodes are in the same equivalence sets.
1089 // Check to verify that all operands of the PHIs are either PHIS that can be
1090 // transformed, loads from GV, or MI itself.
1091 for (SmallPtrSet<PHINode*, 32>::iterator I = LoadUsingPHIs.begin(),
1092 E = LoadUsingPHIs.end(); I != E; ++I) {
1094 for (unsigned op = 0, e = PN->getNumIncomingValues(); op != e; ++op) {
1095 Value *InVal = PN->getIncomingValue(op);
1097 // PHI of the stored value itself is ok.
1098 if (InVal == MI) continue;
1100 if (PHINode *InPN = dyn_cast<PHINode>(InVal)) {
1101 // One of the PHIs in our set is (optimistically) ok.
1102 if (LoadUsingPHIs.count(InPN))
1107 // Load from GV is ok.
1108 if (LoadInst *LI = dyn_cast<LoadInst>(InVal))
1109 if (LI->getOperand(0) == GV)
1114 // Anything else is rejected.
1122 static Value *GetHeapSROAValue(Value *V, unsigned FieldNo,
1123 DenseMap<Value*, std::vector<Value*> > &InsertedScalarizedValues,
1124 std::vector<std::pair<PHINode*, unsigned> > &PHIsToRewrite) {
1125 std::vector<Value*> &FieldVals = InsertedScalarizedValues[V];
1127 if (FieldNo >= FieldVals.size())
1128 FieldVals.resize(FieldNo+1);
1130 // If we already have this value, just reuse the previously scalarized
1132 if (Value *FieldVal = FieldVals[FieldNo])
1135 // Depending on what instruction this is, we have several cases.
1137 if (LoadInst *LI = dyn_cast<LoadInst>(V)) {
1138 // This is a scalarized version of the load from the global. Just create
1139 // a new Load of the scalarized global.
1140 Result = new LoadInst(GetHeapSROAValue(LI->getOperand(0), FieldNo,
1141 InsertedScalarizedValues,
1143 LI->getName()+".f" + utostr(FieldNo), LI);
1144 } else if (PHINode *PN = dyn_cast<PHINode>(V)) {
1145 // PN's type is pointer to struct. Make a new PHI of pointer to struct
1147 const StructType *ST =
1148 cast<StructType>(cast<PointerType>(PN->getType())->getElementType());
1150 Result =PHINode::Create(PointerType::getUnqual(ST->getElementType(FieldNo)),
1151 PN->getName()+".f"+utostr(FieldNo), PN);
1152 PHIsToRewrite.push_back(std::make_pair(PN, FieldNo));
1154 assert(0 && "Unknown usable value");
1158 return FieldVals[FieldNo] = Result;
1161 /// RewriteHeapSROALoadUser - Given a load instruction and a value derived from
1162 /// the load, rewrite the derived value to use the HeapSRoA'd load.
1163 static void RewriteHeapSROALoadUser(Instruction *LoadUser,
1164 DenseMap<Value*, std::vector<Value*> > &InsertedScalarizedValues,
1165 std::vector<std::pair<PHINode*, unsigned> > &PHIsToRewrite) {
1166 // If this is a comparison against null, handle it.
1167 if (ICmpInst *SCI = dyn_cast<ICmpInst>(LoadUser)) {
1168 assert(isa<ConstantPointerNull>(SCI->getOperand(1)));
1169 // If we have a setcc of the loaded pointer, we can use a setcc of any
1171 Value *NPtr = GetHeapSROAValue(SCI->getOperand(0), 0,
1172 InsertedScalarizedValues, PHIsToRewrite);
1174 Value *New = new ICmpInst(SCI->getPredicate(), NPtr,
1175 Constant::getNullValue(NPtr->getType()),
1176 SCI->getName(), SCI);
1177 SCI->replaceAllUsesWith(New);
1178 SCI->eraseFromParent();
1182 // Handle 'getelementptr Ptr, Idx, i32 FieldNo ...'
1183 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(LoadUser)) {
1184 assert(GEPI->getNumOperands() >= 3 && isa<ConstantInt>(GEPI->getOperand(2))
1185 && "Unexpected GEPI!");
1187 // Load the pointer for this field.
1188 unsigned FieldNo = cast<ConstantInt>(GEPI->getOperand(2))->getZExtValue();
1189 Value *NewPtr = GetHeapSROAValue(GEPI->getOperand(0), FieldNo,
1190 InsertedScalarizedValues, PHIsToRewrite);
1192 // Create the new GEP idx vector.
1193 SmallVector<Value*, 8> GEPIdx;
1194 GEPIdx.push_back(GEPI->getOperand(1));
1195 GEPIdx.append(GEPI->op_begin()+3, GEPI->op_end());
1197 Value *NGEPI = GetElementPtrInst::Create(NewPtr,
1198 GEPIdx.begin(), GEPIdx.end(),
1199 GEPI->getName(), GEPI);
1200 GEPI->replaceAllUsesWith(NGEPI);
1201 GEPI->eraseFromParent();
1205 // Recursively transform the users of PHI nodes. This will lazily create the
1206 // PHIs that are needed for individual elements. Keep track of what PHIs we
1207 // see in InsertedScalarizedValues so that we don't get infinite loops (very
1208 // antisocial). If the PHI is already in InsertedScalarizedValues, it has
1209 // already been seen first by another load, so its uses have already been
1211 PHINode *PN = cast<PHINode>(LoadUser);
1213 DenseMap<Value*, std::vector<Value*> >::iterator InsertPos;
1214 tie(InsertPos, Inserted) =
1215 InsertedScalarizedValues.insert(std::make_pair(PN, std::vector<Value*>()));
1216 if (!Inserted) return;
1218 // If this is the first time we've seen this PHI, recursively process all
1220 for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end(); UI != E; ) {
1221 Instruction *User = cast<Instruction>(*UI++);
1222 RewriteHeapSROALoadUser(User, InsertedScalarizedValues, PHIsToRewrite);
1226 /// RewriteUsesOfLoadForHeapSRoA - We are performing Heap SRoA on a global. Ptr
1227 /// is a value loaded from the global. Eliminate all uses of Ptr, making them
1228 /// use FieldGlobals instead. All uses of loaded values satisfy
1229 /// AllGlobalLoadUsesSimpleEnoughForHeapSRA.
1230 static void RewriteUsesOfLoadForHeapSRoA(LoadInst *Load,
1231 DenseMap<Value*, std::vector<Value*> > &InsertedScalarizedValues,
1232 std::vector<std::pair<PHINode*, unsigned> > &PHIsToRewrite) {
1233 for (Value::use_iterator UI = Load->use_begin(), E = Load->use_end();
1235 Instruction *User = cast<Instruction>(*UI++);
1236 RewriteHeapSROALoadUser(User, InsertedScalarizedValues, PHIsToRewrite);
1239 if (Load->use_empty()) {
1240 Load->eraseFromParent();
1241 InsertedScalarizedValues.erase(Load);
1245 /// PerformHeapAllocSRoA - MI is an allocation of an array of structures. Break
1246 /// it up into multiple allocations of arrays of the fields.
1247 static GlobalVariable *PerformHeapAllocSRoA(GlobalVariable *GV, MallocInst *MI){
1248 DOUT << "SROA HEAP ALLOC: " << *GV << " MALLOC = " << *MI;
1249 const StructType *STy = cast<StructType>(MI->getAllocatedType());
1251 // There is guaranteed to be at least one use of the malloc (storing
1252 // it into GV). If there are other uses, change them to be uses of
1253 // the global to simplify later code. This also deletes the store
1255 ReplaceUsesOfMallocWithGlobal(MI, GV);
1257 // Okay, at this point, there are no users of the malloc. Insert N
1258 // new mallocs at the same place as MI, and N globals.
1259 std::vector<Value*> FieldGlobals;
1260 std::vector<MallocInst*> FieldMallocs;
1262 for (unsigned FieldNo = 0, e = STy->getNumElements(); FieldNo != e;++FieldNo){
1263 const Type *FieldTy = STy->getElementType(FieldNo);
1264 const Type *PFieldTy = PointerType::getUnqual(FieldTy);
1266 GlobalVariable *NGV =
1267 new GlobalVariable(PFieldTy, false, GlobalValue::InternalLinkage,
1268 Constant::getNullValue(PFieldTy),
1269 GV->getName() + ".f" + utostr(FieldNo), GV,
1270 GV->isThreadLocal());
1271 FieldGlobals.push_back(NGV);
1273 MallocInst *NMI = new MallocInst(FieldTy, MI->getArraySize(),
1274 MI->getName() + ".f" + utostr(FieldNo),MI);
1275 FieldMallocs.push_back(NMI);
1276 new StoreInst(NMI, NGV, MI);
1279 // The tricky aspect of this transformation is handling the case when malloc
1280 // fails. In the original code, malloc failing would set the result pointer
1281 // of malloc to null. In this case, some mallocs could succeed and others
1282 // could fail. As such, we emit code that looks like this:
1283 // F0 = malloc(field0)
1284 // F1 = malloc(field1)
1285 // F2 = malloc(field2)
1286 // if (F0 == 0 || F1 == 0 || F2 == 0) {
1287 // if (F0) { free(F0); F0 = 0; }
1288 // if (F1) { free(F1); F1 = 0; }
1289 // if (F2) { free(F2); F2 = 0; }
1291 Value *RunningOr = 0;
1292 for (unsigned i = 0, e = FieldMallocs.size(); i != e; ++i) {
1293 Value *Cond = new ICmpInst(ICmpInst::ICMP_EQ, FieldMallocs[i],
1294 Constant::getNullValue(FieldMallocs[i]->getType()),
1297 RunningOr = Cond; // First seteq
1299 RunningOr = BinaryOperator::CreateOr(RunningOr, Cond, "tmp", MI);
1302 // Split the basic block at the old malloc.
1303 BasicBlock *OrigBB = MI->getParent();
1304 BasicBlock *ContBB = OrigBB->splitBasicBlock(MI, "malloc_cont");
1306 // Create the block to check the first condition. Put all these blocks at the
1307 // end of the function as they are unlikely to be executed.
1308 BasicBlock *NullPtrBlock = BasicBlock::Create("malloc_ret_null",
1309 OrigBB->getParent());
1311 // Remove the uncond branch from OrigBB to ContBB, turning it into a cond
1312 // branch on RunningOr.
1313 OrigBB->getTerminator()->eraseFromParent();
1314 BranchInst::Create(NullPtrBlock, ContBB, RunningOr, OrigBB);
1316 // Within the NullPtrBlock, we need to emit a comparison and branch for each
1317 // pointer, because some may be null while others are not.
1318 for (unsigned i = 0, e = FieldGlobals.size(); i != e; ++i) {
1319 Value *GVVal = new LoadInst(FieldGlobals[i], "tmp", NullPtrBlock);
1320 Value *Cmp = new ICmpInst(ICmpInst::ICMP_NE, GVVal,
1321 Constant::getNullValue(GVVal->getType()),
1322 "tmp", NullPtrBlock);
1323 BasicBlock *FreeBlock = BasicBlock::Create("free_it", OrigBB->getParent());
1324 BasicBlock *NextBlock = BasicBlock::Create("next", OrigBB->getParent());
1325 BranchInst::Create(FreeBlock, NextBlock, Cmp, NullPtrBlock);
1327 // Fill in FreeBlock.
1328 new FreeInst(GVVal, FreeBlock);
1329 new StoreInst(Constant::getNullValue(GVVal->getType()), FieldGlobals[i],
1331 BranchInst::Create(NextBlock, FreeBlock);
1333 NullPtrBlock = NextBlock;
1336 BranchInst::Create(ContBB, NullPtrBlock);
1338 // MI is no longer needed, remove it.
1339 MI->eraseFromParent();
1341 /// InsertedScalarizedLoads - As we process loads, if we can't immediately
1342 /// update all uses of the load, keep track of what scalarized loads are
1343 /// inserted for a given load.
1344 DenseMap<Value*, std::vector<Value*> > InsertedScalarizedValues;
1345 InsertedScalarizedValues[GV] = FieldGlobals;
1347 std::vector<std::pair<PHINode*, unsigned> > PHIsToRewrite;
1349 // Okay, the malloc site is completely handled. All of the uses of GV are now
1350 // loads, and all uses of those loads are simple. Rewrite them to use loads
1351 // of the per-field globals instead.
1352 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end(); UI != E;) {
1353 Instruction *User = cast<Instruction>(*UI++);
1355 if (LoadInst *LI = dyn_cast<LoadInst>(User)) {
1356 RewriteUsesOfLoadForHeapSRoA(LI, InsertedScalarizedValues, PHIsToRewrite);
1360 // Must be a store of null.
1361 StoreInst *SI = cast<StoreInst>(User);
1362 assert(isa<ConstantPointerNull>(SI->getOperand(0)) &&
1363 "Unexpected heap-sra user!");
1365 // Insert a store of null into each global.
1366 for (unsigned i = 0, e = FieldGlobals.size(); i != e; ++i) {
1367 const PointerType *PT = cast<PointerType>(FieldGlobals[i]->getType());
1368 Constant *Null = Constant::getNullValue(PT->getElementType());
1369 new StoreInst(Null, FieldGlobals[i], SI);
1371 // Erase the original store.
1372 SI->eraseFromParent();
1375 // While we have PHIs that are interesting to rewrite, do it.
1376 while (!PHIsToRewrite.empty()) {
1377 PHINode *PN = PHIsToRewrite.back().first;
1378 unsigned FieldNo = PHIsToRewrite.back().second;
1379 PHIsToRewrite.pop_back();
1380 PHINode *FieldPN = cast<PHINode>(InsertedScalarizedValues[PN][FieldNo]);
1381 assert(FieldPN->getNumIncomingValues() == 0 &&"Already processed this phi");
1383 // Add all the incoming values. This can materialize more phis.
1384 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1385 Value *InVal = PN->getIncomingValue(i);
1386 InVal = GetHeapSROAValue(InVal, FieldNo, InsertedScalarizedValues,
1388 FieldPN->addIncoming(InVal, PN->getIncomingBlock(i));
1392 // Drop all inter-phi links and any loads that made it this far.
1393 for (DenseMap<Value*, std::vector<Value*> >::iterator
1394 I = InsertedScalarizedValues.begin(), E = InsertedScalarizedValues.end();
1396 if (PHINode *PN = dyn_cast<PHINode>(I->first))
1397 PN->dropAllReferences();
1398 else if (LoadInst *LI = dyn_cast<LoadInst>(I->first))
1399 LI->dropAllReferences();
1402 // Delete all the phis and loads now that inter-references are dead.
1403 for (DenseMap<Value*, std::vector<Value*> >::iterator
1404 I = InsertedScalarizedValues.begin(), E = InsertedScalarizedValues.end();
1406 if (PHINode *PN = dyn_cast<PHINode>(I->first))
1407 PN->eraseFromParent();
1408 else if (LoadInst *LI = dyn_cast<LoadInst>(I->first))
1409 LI->eraseFromParent();
1412 // The old global is now dead, remove it.
1413 GV->eraseFromParent();
1416 return cast<GlobalVariable>(FieldGlobals[0]);
1419 /// TryToOptimizeStoreOfMallocToGlobal - This function is called when we see a
1420 /// pointer global variable with a single value stored it that is a malloc or
1422 static bool TryToOptimizeStoreOfMallocToGlobal(GlobalVariable *GV,
1424 Module::global_iterator &GVI,
1426 // If this is a malloc of an abstract type, don't touch it.
1427 if (!MI->getAllocatedType()->isSized())
1430 // We can't optimize this global unless all uses of it are *known* to be
1431 // of the malloc value, not of the null initializer value (consider a use
1432 // that compares the global's value against zero to see if the malloc has
1433 // been reached). To do this, we check to see if all uses of the global
1434 // would trap if the global were null: this proves that they must all
1435 // happen after the malloc.
1436 if (!AllUsesOfLoadedValueWillTrapIfNull(GV))
1439 // We can't optimize this if the malloc itself is used in a complex way,
1440 // for example, being stored into multiple globals. This allows the
1441 // malloc to be stored into the specified global, loaded setcc'd, and
1442 // GEP'd. These are all things we could transform to using the global
1445 SmallPtrSet<PHINode*, 8> PHIs;
1446 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(MI, GV, PHIs))
1451 // If we have a global that is only initialized with a fixed size malloc,
1452 // transform the program to use global memory instead of malloc'd memory.
1453 // This eliminates dynamic allocation, avoids an indirection accessing the
1454 // data, and exposes the resultant global to further GlobalOpt.
1455 if (ConstantInt *NElements = dyn_cast<ConstantInt>(MI->getArraySize())) {
1456 // Restrict this transformation to only working on small allocations
1457 // (2048 bytes currently), as we don't want to introduce a 16M global or
1459 if (NElements->getZExtValue()*
1460 TD.getTypeAllocSize(MI->getAllocatedType()) < 2048) {
1461 GVI = OptimizeGlobalAddressOfMalloc(GV, MI);
1466 // If the allocation is an array of structures, consider transforming this
1467 // into multiple malloc'd arrays, one for each field. This is basically
1468 // SRoA for malloc'd memory.
1469 const Type *AllocTy = MI->getAllocatedType();
1471 // If this is an allocation of a fixed size array of structs, analyze as a
1472 // variable size array. malloc [100 x struct],1 -> malloc struct, 100
1473 if (!MI->isArrayAllocation())
1474 if (const ArrayType *AT = dyn_cast<ArrayType>(AllocTy))
1475 AllocTy = AT->getElementType();
1477 if (const StructType *AllocSTy = dyn_cast<StructType>(AllocTy)) {
1478 // This the structure has an unreasonable number of fields, leave it
1480 if (AllocSTy->getNumElements() <= 16 && AllocSTy->getNumElements() != 0 &&
1481 AllGlobalLoadUsesSimpleEnoughForHeapSRA(GV, MI)) {
1483 // If this is a fixed size array, transform the Malloc to be an alloc of
1484 // structs. malloc [100 x struct],1 -> malloc struct, 100
1485 if (const ArrayType *AT = dyn_cast<ArrayType>(MI->getAllocatedType())) {
1487 new MallocInst(AllocSTy,
1488 ConstantInt::get(Type::Int32Ty, AT->getNumElements()),
1490 NewMI->takeName(MI);
1491 Value *Cast = new BitCastInst(NewMI, MI->getType(), "tmp", MI);
1492 MI->replaceAllUsesWith(Cast);
1493 MI->eraseFromParent();
1497 GVI = PerformHeapAllocSRoA(GV, MI);
1505 // OptimizeOnceStoredGlobal - Try to optimize globals based on the knowledge
1506 // that only one value (besides its initializer) is ever stored to the global.
1507 static bool OptimizeOnceStoredGlobal(GlobalVariable *GV, Value *StoredOnceVal,
1508 Module::global_iterator &GVI,
1510 // Ignore no-op GEPs and bitcasts.
1511 StoredOnceVal = StoredOnceVal->stripPointerCasts();
1513 // If we are dealing with a pointer global that is initialized to null and
1514 // only has one (non-null) value stored into it, then we can optimize any
1515 // users of the loaded value (often calls and loads) that would trap if the
1517 if (isa<PointerType>(GV->getInitializer()->getType()) &&
1518 GV->getInitializer()->isNullValue()) {
1519 if (Constant *SOVC = dyn_cast<Constant>(StoredOnceVal)) {
1520 if (GV->getInitializer()->getType() != SOVC->getType())
1521 SOVC = ConstantExpr::getBitCast(SOVC, GV->getInitializer()->getType());
1523 // Optimize away any trapping uses of the loaded value.
1524 if (OptimizeAwayTrappingUsesOfLoads(GV, SOVC))
1526 } else if (MallocInst *MI = dyn_cast<MallocInst>(StoredOnceVal)) {
1527 if (TryToOptimizeStoreOfMallocToGlobal(GV, MI, GVI, TD))
1535 /// TryToShrinkGlobalToBoolean - At this point, we have learned that the only
1536 /// two values ever stored into GV are its initializer and OtherVal. See if we
1537 /// can shrink the global into a boolean and select between the two values
1538 /// whenever it is used. This exposes the values to other scalar optimizations.
1539 static bool TryToShrinkGlobalToBoolean(GlobalVariable *GV, Constant *OtherVal) {
1540 const Type *GVElType = GV->getType()->getElementType();
1542 // If GVElType is already i1, it is already shrunk. If the type of the GV is
1543 // an FP value, pointer or vector, don't do this optimization because a select
1544 // between them is very expensive and unlikely to lead to later
1545 // simplification. In these cases, we typically end up with "cond ? v1 : v2"
1546 // where v1 and v2 both require constant pool loads, a big loss.
1547 if (GVElType == Type::Int1Ty || GVElType->isFloatingPoint() ||
1548 isa<PointerType>(GVElType) || isa<VectorType>(GVElType))
1551 // Walk the use list of the global seeing if all the uses are load or store.
1552 // If there is anything else, bail out.
1553 for (Value::use_iterator I = GV->use_begin(), E = GV->use_end(); I != E; ++I)
1554 if (!isa<LoadInst>(I) && !isa<StoreInst>(I))
1557 DOUT << " *** SHRINKING TO BOOL: " << *GV;
1559 // Create the new global, initializing it to false.
1560 GlobalVariable *NewGV = new GlobalVariable(Type::Int1Ty, false,
1561 GlobalValue::InternalLinkage, ConstantInt::getFalse(),
1564 GV->isThreadLocal());
1565 GV->getParent()->getGlobalList().insert(GV, NewGV);
1567 Constant *InitVal = GV->getInitializer();
1568 assert(InitVal->getType() != Type::Int1Ty && "No reason to shrink to bool!");
1570 // If initialized to zero and storing one into the global, we can use a cast
1571 // instead of a select to synthesize the desired value.
1572 bool IsOneZero = false;
1573 if (ConstantInt *CI = dyn_cast<ConstantInt>(OtherVal))
1574 IsOneZero = InitVal->isNullValue() && CI->isOne();
1576 while (!GV->use_empty()) {
1577 Instruction *UI = cast<Instruction>(GV->use_back());
1578 if (StoreInst *SI = dyn_cast<StoreInst>(UI)) {
1579 // Change the store into a boolean store.
1580 bool StoringOther = SI->getOperand(0) == OtherVal;
1581 // Only do this if we weren't storing a loaded value.
1583 if (StoringOther || SI->getOperand(0) == InitVal)
1584 StoreVal = ConstantInt::get(Type::Int1Ty, StoringOther);
1586 // Otherwise, we are storing a previously loaded copy. To do this,
1587 // change the copy from copying the original value to just copying the
1589 Instruction *StoredVal = cast<Instruction>(SI->getOperand(0));
1591 // If we're already replaced the input, StoredVal will be a cast or
1592 // select instruction. If not, it will be a load of the original
1594 if (LoadInst *LI = dyn_cast<LoadInst>(StoredVal)) {
1595 assert(LI->getOperand(0) == GV && "Not a copy!");
1596 // Insert a new load, to preserve the saved value.
1597 StoreVal = new LoadInst(NewGV, LI->getName()+".b", LI);
1599 assert((isa<CastInst>(StoredVal) || isa<SelectInst>(StoredVal)) &&
1600 "This is not a form that we understand!");
1601 StoreVal = StoredVal->getOperand(0);
1602 assert(isa<LoadInst>(StoreVal) && "Not a load of NewGV!");
1605 new StoreInst(StoreVal, NewGV, SI);
1607 // Change the load into a load of bool then a select.
1608 LoadInst *LI = cast<LoadInst>(UI);
1609 LoadInst *NLI = new LoadInst(NewGV, LI->getName()+".b", LI);
1612 NSI = new ZExtInst(NLI, LI->getType(), "", LI);
1614 NSI = SelectInst::Create(NLI, OtherVal, InitVal, "", LI);
1616 LI->replaceAllUsesWith(NSI);
1618 UI->eraseFromParent();
1621 GV->eraseFromParent();
1626 /// ProcessInternalGlobal - Analyze the specified global variable and optimize
1627 /// it if possible. If we make a change, return true.
1628 bool GlobalOpt::ProcessInternalGlobal(GlobalVariable *GV,
1629 Module::global_iterator &GVI) {
1630 SmallPtrSet<PHINode*, 16> PHIUsers;
1632 GV->removeDeadConstantUsers();
1634 if (GV->use_empty()) {
1635 DOUT << "GLOBAL DEAD: " << *GV;
1636 GV->eraseFromParent();
1641 if (!AnalyzeGlobal(GV, GS, PHIUsers)) {
1643 cerr << "Global: " << *GV;
1644 cerr << " isLoaded = " << GS.isLoaded << "\n";
1645 cerr << " StoredType = ";
1646 switch (GS.StoredType) {
1647 case GlobalStatus::NotStored: cerr << "NEVER STORED\n"; break;
1648 case GlobalStatus::isInitializerStored: cerr << "INIT STORED\n"; break;
1649 case GlobalStatus::isStoredOnce: cerr << "STORED ONCE\n"; break;
1650 case GlobalStatus::isStored: cerr << "stored\n"; break;
1652 if (GS.StoredType == GlobalStatus::isStoredOnce && GS.StoredOnceValue)
1653 cerr << " StoredOnceValue = " << *GS.StoredOnceValue << "\n";
1654 if (GS.AccessingFunction && !GS.HasMultipleAccessingFunctions)
1655 cerr << " AccessingFunction = " << GS.AccessingFunction->getName()
1657 cerr << " HasMultipleAccessingFunctions = "
1658 << GS.HasMultipleAccessingFunctions << "\n";
1659 cerr << " HasNonInstructionUser = " << GS.HasNonInstructionUser<<"\n";
1663 // If this is a first class global and has only one accessing function
1664 // and this function is main (which we know is not recursive we can make
1665 // this global a local variable) we replace the global with a local alloca
1666 // in this function.
1668 // NOTE: It doesn't make sense to promote non single-value types since we
1669 // are just replacing static memory to stack memory.
1671 // If the global is in different address space, don't bring it to stack.
1672 if (!GS.HasMultipleAccessingFunctions &&
1673 GS.AccessingFunction && !GS.HasNonInstructionUser &&
1674 GV->getType()->getElementType()->isSingleValueType() &&
1675 GS.AccessingFunction->getName() == "main" &&
1676 GS.AccessingFunction->hasExternalLinkage() &&
1677 GV->getType()->getAddressSpace() == 0) {
1678 DOUT << "LOCALIZING GLOBAL: " << *GV;
1679 Instruction* FirstI = GS.AccessingFunction->getEntryBlock().begin();
1680 const Type* ElemTy = GV->getType()->getElementType();
1681 // FIXME: Pass Global's alignment when globals have alignment
1682 AllocaInst* Alloca = new AllocaInst(ElemTy, NULL, GV->getName(), FirstI);
1683 if (!isa<UndefValue>(GV->getInitializer()))
1684 new StoreInst(GV->getInitializer(), Alloca, FirstI);
1686 GV->replaceAllUsesWith(Alloca);
1687 GV->eraseFromParent();
1692 // If the global is never loaded (but may be stored to), it is dead.
1695 DOUT << "GLOBAL NEVER LOADED: " << *GV;
1697 // Delete any stores we can find to the global. We may not be able to
1698 // make it completely dead though.
1699 bool Changed = CleanupConstantGlobalUsers(GV, GV->getInitializer());
1701 // If the global is dead now, delete it.
1702 if (GV->use_empty()) {
1703 GV->eraseFromParent();
1709 } else if (GS.StoredType <= GlobalStatus::isInitializerStored) {
1710 DOUT << "MARKING CONSTANT: " << *GV;
1711 GV->setConstant(true);
1713 // Clean up any obviously simplifiable users now.
1714 CleanupConstantGlobalUsers(GV, GV->getInitializer());
1716 // If the global is dead now, just nuke it.
1717 if (GV->use_empty()) {
1718 DOUT << " *** Marking constant allowed us to simplify "
1719 << "all users and delete global!\n";
1720 GV->eraseFromParent();
1726 } else if (!GV->getInitializer()->getType()->isSingleValueType()) {
1727 if (GlobalVariable *FirstNewGV = SRAGlobal(GV,
1728 getAnalysis<TargetData>())) {
1729 GVI = FirstNewGV; // Don't skip the newly produced globals!
1732 } else if (GS.StoredType == GlobalStatus::isStoredOnce) {
1733 // If the initial value for the global was an undef value, and if only
1734 // one other value was stored into it, we can just change the
1735 // initializer to be the stored value, then delete all stores to the
1736 // global. This allows us to mark it constant.
1737 if (Constant *SOVConstant = dyn_cast<Constant>(GS.StoredOnceValue))
1738 if (isa<UndefValue>(GV->getInitializer())) {
1739 // Change the initial value here.
1740 GV->setInitializer(SOVConstant);
1742 // Clean up any obviously simplifiable users now.
1743 CleanupConstantGlobalUsers(GV, GV->getInitializer());
1745 if (GV->use_empty()) {
1746 DOUT << " *** Substituting initializer allowed us to "
1747 << "simplify all users and delete global!\n";
1748 GV->eraseFromParent();
1757 // Try to optimize globals based on the knowledge that only one value
1758 // (besides its initializer) is ever stored to the global.
1759 if (OptimizeOnceStoredGlobal(GV, GS.StoredOnceValue, GVI,
1760 getAnalysis<TargetData>()))
1763 // Otherwise, if the global was not a boolean, we can shrink it to be a
1765 if (Constant *SOVConstant = dyn_cast<Constant>(GS.StoredOnceValue))
1766 if (TryToShrinkGlobalToBoolean(GV, SOVConstant)) {
1775 /// ChangeCalleesToFastCall - Walk all of the direct calls of the specified
1776 /// function, changing them to FastCC.
1777 static void ChangeCalleesToFastCall(Function *F) {
1778 for (Value::use_iterator UI = F->use_begin(), E = F->use_end(); UI != E;++UI){
1779 CallSite User(cast<Instruction>(*UI));
1780 User.setCallingConv(CallingConv::Fast);
1784 static AttrListPtr StripNest(const AttrListPtr &Attrs) {
1785 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1786 if ((Attrs.getSlot(i).Attrs & Attribute::Nest) == 0)
1789 // There can be only one.
1790 return Attrs.removeAttr(Attrs.getSlot(i).Index, Attribute::Nest);
1796 static void RemoveNestAttribute(Function *F) {
1797 F->setAttributes(StripNest(F->getAttributes()));
1798 for (Value::use_iterator UI = F->use_begin(), E = F->use_end(); UI != E;++UI){
1799 CallSite User(cast<Instruction>(*UI));
1800 User.setAttributes(StripNest(User.getAttributes()));
1804 bool GlobalOpt::OptimizeFunctions(Module &M) {
1805 bool Changed = false;
1806 // Optimize functions.
1807 for (Module::iterator FI = M.begin(), E = M.end(); FI != E; ) {
1809 // Functions without names cannot be referenced outside this module.
1810 if (!F->hasName() && !F->isDeclaration())
1811 F->setLinkage(GlobalValue::InternalLinkage);
1812 F->removeDeadConstantUsers();
1813 if (F->use_empty() && (F->hasLocalLinkage() ||
1814 F->hasLinkOnceLinkage())) {
1815 M.getFunctionList().erase(F);
1818 } else if (F->hasLocalLinkage()) {
1819 if (F->getCallingConv() == CallingConv::C && !F->isVarArg() &&
1820 !F->hasAddressTaken()) {
1821 // If this function has C calling conventions, is not a varargs
1822 // function, and is only called directly, promote it to use the Fast
1823 // calling convention.
1824 F->setCallingConv(CallingConv::Fast);
1825 ChangeCalleesToFastCall(F);
1830 if (F->getAttributes().hasAttrSomewhere(Attribute::Nest) &&
1831 !F->hasAddressTaken()) {
1832 // The function is not used by a trampoline intrinsic, so it is safe
1833 // to remove the 'nest' attribute.
1834 RemoveNestAttribute(F);
1843 bool GlobalOpt::OptimizeGlobalVars(Module &M) {
1844 bool Changed = false;
1845 for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
1847 GlobalVariable *GV = GVI++;
1848 // Global variables without names cannot be referenced outside this module.
1849 if (!GV->hasName() && !GV->isDeclaration())
1850 GV->setLinkage(GlobalValue::InternalLinkage);
1851 if (!GV->isConstant() && GV->hasLocalLinkage() &&
1852 GV->hasInitializer())
1853 Changed |= ProcessInternalGlobal(GV, GVI);
1858 /// FindGlobalCtors - Find the llvm.globalctors list, verifying that all
1859 /// initializers have an init priority of 65535.
1860 GlobalVariable *GlobalOpt::FindGlobalCtors(Module &M) {
1861 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1863 if (I->getName() == "llvm.global_ctors") {
1864 // Found it, verify it's an array of { int, void()* }.
1865 const ArrayType *ATy =dyn_cast<ArrayType>(I->getType()->getElementType());
1867 const StructType *STy = dyn_cast<StructType>(ATy->getElementType());
1868 if (!STy || STy->getNumElements() != 2 ||
1869 STy->getElementType(0) != Type::Int32Ty) return 0;
1870 const PointerType *PFTy = dyn_cast<PointerType>(STy->getElementType(1));
1871 if (!PFTy) return 0;
1872 const FunctionType *FTy = dyn_cast<FunctionType>(PFTy->getElementType());
1873 if (!FTy || FTy->getReturnType() != Type::VoidTy || FTy->isVarArg() ||
1874 FTy->getNumParams() != 0)
1877 // Verify that the initializer is simple enough for us to handle.
1878 if (!I->hasInitializer()) return 0;
1879 ConstantArray *CA = dyn_cast<ConstantArray>(I->getInitializer());
1881 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i)
1882 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(*i)) {
1883 if (isa<ConstantPointerNull>(CS->getOperand(1)))
1886 // Must have a function or null ptr.
1887 if (!isa<Function>(CS->getOperand(1)))
1890 // Init priority must be standard.
1891 ConstantInt *CI = dyn_cast<ConstantInt>(CS->getOperand(0));
1892 if (!CI || CI->getZExtValue() != 65535)
1903 /// ParseGlobalCtors - Given a llvm.global_ctors list that we can understand,
1904 /// return a list of the functions and null terminator as a vector.
1905 static std::vector<Function*> ParseGlobalCtors(GlobalVariable *GV) {
1906 ConstantArray *CA = cast<ConstantArray>(GV->getInitializer());
1907 std::vector<Function*> Result;
1908 Result.reserve(CA->getNumOperands());
1909 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i) {
1910 ConstantStruct *CS = cast<ConstantStruct>(*i);
1911 Result.push_back(dyn_cast<Function>(CS->getOperand(1)));
1916 /// InstallGlobalCtors - Given a specified llvm.global_ctors list, install the
1917 /// specified array, returning the new global to use.
1918 static GlobalVariable *InstallGlobalCtors(GlobalVariable *GCL,
1919 const std::vector<Function*> &Ctors) {
1920 // If we made a change, reassemble the initializer list.
1921 std::vector<Constant*> CSVals;
1922 CSVals.push_back(ConstantInt::get(Type::Int32Ty, 65535));
1923 CSVals.push_back(0);
1925 // Create the new init list.
1926 std::vector<Constant*> CAList;
1927 for (unsigned i = 0, e = Ctors.size(); i != e; ++i) {
1929 CSVals[1] = Ctors[i];
1931 const Type *FTy = FunctionType::get(Type::VoidTy, false);
1932 const PointerType *PFTy = PointerType::getUnqual(FTy);
1933 CSVals[1] = Constant::getNullValue(PFTy);
1934 CSVals[0] = ConstantInt::get(Type::Int32Ty, 2147483647);
1936 CAList.push_back(ConstantStruct::get(CSVals));
1939 // Create the array initializer.
1940 const Type *StructTy =
1941 cast<ArrayType>(GCL->getType()->getElementType())->getElementType();
1942 Constant *CA = ConstantArray::get(ArrayType::get(StructTy, CAList.size()),
1945 // If we didn't change the number of elements, don't create a new GV.
1946 if (CA->getType() == GCL->getInitializer()->getType()) {
1947 GCL->setInitializer(CA);
1951 // Create the new global and insert it next to the existing list.
1952 GlobalVariable *NGV = new GlobalVariable(CA->getType(), GCL->isConstant(),
1953 GCL->getLinkage(), CA, "",
1955 GCL->isThreadLocal());
1956 GCL->getParent()->getGlobalList().insert(GCL, NGV);
1959 // Nuke the old list, replacing any uses with the new one.
1960 if (!GCL->use_empty()) {
1962 if (V->getType() != GCL->getType())
1963 V = ConstantExpr::getBitCast(V, GCL->getType());
1964 GCL->replaceAllUsesWith(V);
1966 GCL->eraseFromParent();
1975 static Constant *getVal(DenseMap<Value*, Constant*> &ComputedValues,
1977 if (Constant *CV = dyn_cast<Constant>(V)) return CV;
1978 Constant *R = ComputedValues[V];
1979 assert(R && "Reference to an uncomputed value!");
1983 /// isSimpleEnoughPointerToCommit - Return true if this constant is simple
1984 /// enough for us to understand. In particular, if it is a cast of something,
1985 /// we punt. We basically just support direct accesses to globals and GEP's of
1986 /// globals. This should be kept up to date with CommitValueTo.
1987 static bool isSimpleEnoughPointerToCommit(Constant *C) {
1988 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(C)) {
1989 if (!GV->hasExternalLinkage() && !GV->hasLocalLinkage())
1990 return false; // do not allow weak/linkonce/dllimport/dllexport linkage.
1991 return !GV->isDeclaration(); // reject external globals.
1993 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C))
1994 // Handle a constantexpr gep.
1995 if (CE->getOpcode() == Instruction::GetElementPtr &&
1996 isa<GlobalVariable>(CE->getOperand(0))) {
1997 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
1998 if (!GV->hasExternalLinkage() && !GV->hasLocalLinkage())
1999 return false; // do not allow weak/linkonce/dllimport/dllexport linkage.
2000 return GV->hasInitializer() &&
2001 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE);
2006 /// EvaluateStoreInto - Evaluate a piece of a constantexpr store into a global
2007 /// initializer. This returns 'Init' modified to reflect 'Val' stored into it.
2008 /// At this point, the GEP operands of Addr [0, OpNo) have been stepped into.
2009 static Constant *EvaluateStoreInto(Constant *Init, Constant *Val,
2010 ConstantExpr *Addr, unsigned OpNo) {
2011 // Base case of the recursion.
2012 if (OpNo == Addr->getNumOperands()) {
2013 assert(Val->getType() == Init->getType() && "Type mismatch!");
2017 if (const StructType *STy = dyn_cast<StructType>(Init->getType())) {
2018 std::vector<Constant*> Elts;
2020 // Break up the constant into its elements.
2021 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(Init)) {
2022 for (User::op_iterator i = CS->op_begin(), e = CS->op_end(); i != e; ++i)
2023 Elts.push_back(cast<Constant>(*i));
2024 } else if (isa<ConstantAggregateZero>(Init)) {
2025 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
2026 Elts.push_back(Constant::getNullValue(STy->getElementType(i)));
2027 } else if (isa<UndefValue>(Init)) {
2028 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
2029 Elts.push_back(UndefValue::get(STy->getElementType(i)));
2031 assert(0 && "This code is out of sync with "
2032 " ConstantFoldLoadThroughGEPConstantExpr");
2035 // Replace the element that we are supposed to.
2036 ConstantInt *CU = cast<ConstantInt>(Addr->getOperand(OpNo));
2037 unsigned Idx = CU->getZExtValue();
2038 assert(Idx < STy->getNumElements() && "Struct index out of range!");
2039 Elts[Idx] = EvaluateStoreInto(Elts[Idx], Val, Addr, OpNo+1);
2041 // Return the modified struct.
2042 return ConstantStruct::get(&Elts[0], Elts.size(), STy->isPacked());
2044 ConstantInt *CI = cast<ConstantInt>(Addr->getOperand(OpNo));
2045 const ArrayType *ATy = cast<ArrayType>(Init->getType());
2047 // Break up the array into elements.
2048 std::vector<Constant*> Elts;
2049 if (ConstantArray *CA = dyn_cast<ConstantArray>(Init)) {
2050 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i)
2051 Elts.push_back(cast<Constant>(*i));
2052 } else if (isa<ConstantAggregateZero>(Init)) {
2053 Constant *Elt = Constant::getNullValue(ATy->getElementType());
2054 Elts.assign(ATy->getNumElements(), Elt);
2055 } else if (isa<UndefValue>(Init)) {
2056 Constant *Elt = UndefValue::get(ATy->getElementType());
2057 Elts.assign(ATy->getNumElements(), Elt);
2059 assert(0 && "This code is out of sync with "
2060 " ConstantFoldLoadThroughGEPConstantExpr");
2063 assert(CI->getZExtValue() < ATy->getNumElements());
2064 Elts[CI->getZExtValue()] =
2065 EvaluateStoreInto(Elts[CI->getZExtValue()], Val, Addr, OpNo+1);
2066 return ConstantArray::get(ATy, Elts);
2070 /// CommitValueTo - We have decided that Addr (which satisfies the predicate
2071 /// isSimpleEnoughPointerToCommit) should get Val as its value. Make it happen.
2072 static void CommitValueTo(Constant *Val, Constant *Addr) {
2073 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Addr)) {
2074 assert(GV->hasInitializer());
2075 GV->setInitializer(Val);
2079 ConstantExpr *CE = cast<ConstantExpr>(Addr);
2080 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
2082 Constant *Init = GV->getInitializer();
2083 Init = EvaluateStoreInto(Init, Val, CE, 2);
2084 GV->setInitializer(Init);
2087 /// ComputeLoadResult - Return the value that would be computed by a load from
2088 /// P after the stores reflected by 'memory' have been performed. If we can't
2089 /// decide, return null.
2090 static Constant *ComputeLoadResult(Constant *P,
2091 const DenseMap<Constant*, Constant*> &Memory) {
2092 // If this memory location has been recently stored, use the stored value: it
2093 // is the most up-to-date.
2094 DenseMap<Constant*, Constant*>::const_iterator I = Memory.find(P);
2095 if (I != Memory.end()) return I->second;
2098 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(P)) {
2099 if (GV->hasInitializer())
2100 return GV->getInitializer();
2104 // Handle a constantexpr getelementptr.
2105 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(P))
2106 if (CE->getOpcode() == Instruction::GetElementPtr &&
2107 isa<GlobalVariable>(CE->getOperand(0))) {
2108 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
2109 if (GV->hasInitializer())
2110 return ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE);
2113 return 0; // don't know how to evaluate.
2116 /// EvaluateFunction - Evaluate a call to function F, returning true if
2117 /// successful, false if we can't evaluate it. ActualArgs contains the formal
2118 /// arguments for the function.
2119 static bool EvaluateFunction(Function *F, Constant *&RetVal,
2120 const std::vector<Constant*> &ActualArgs,
2121 std::vector<Function*> &CallStack,
2122 DenseMap<Constant*, Constant*> &MutatedMemory,
2123 std::vector<GlobalVariable*> &AllocaTmps) {
2124 // Check to see if this function is already executing (recursion). If so,
2125 // bail out. TODO: we might want to accept limited recursion.
2126 if (std::find(CallStack.begin(), CallStack.end(), F) != CallStack.end())
2129 CallStack.push_back(F);
2131 /// Values - As we compute SSA register values, we store their contents here.
2132 DenseMap<Value*, Constant*> Values;
2134 // Initialize arguments to the incoming values specified.
2136 for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end(); AI != E;
2138 Values[AI] = ActualArgs[ArgNo];
2140 /// ExecutedBlocks - We only handle non-looping, non-recursive code. As such,
2141 /// we can only evaluate any one basic block at most once. This set keeps
2142 /// track of what we have executed so we can detect recursive cases etc.
2143 SmallPtrSet<BasicBlock*, 32> ExecutedBlocks;
2145 // CurInst - The current instruction we're evaluating.
2146 BasicBlock::iterator CurInst = F->begin()->begin();
2148 // This is the main evaluation loop.
2150 Constant *InstResult = 0;
2152 if (StoreInst *SI = dyn_cast<StoreInst>(CurInst)) {
2153 if (SI->isVolatile()) return false; // no volatile accesses.
2154 Constant *Ptr = getVal(Values, SI->getOperand(1));
2155 if (!isSimpleEnoughPointerToCommit(Ptr))
2156 // If this is too complex for us to commit, reject it.
2158 Constant *Val = getVal(Values, SI->getOperand(0));
2159 MutatedMemory[Ptr] = Val;
2160 } else if (BinaryOperator *BO = dyn_cast<BinaryOperator>(CurInst)) {
2161 InstResult = ConstantExpr::get(BO->getOpcode(),
2162 getVal(Values, BO->getOperand(0)),
2163 getVal(Values, BO->getOperand(1)));
2164 } else if (CmpInst *CI = dyn_cast<CmpInst>(CurInst)) {
2165 InstResult = ConstantExpr::getCompare(CI->getPredicate(),
2166 getVal(Values, CI->getOperand(0)),
2167 getVal(Values, CI->getOperand(1)));
2168 } else if (CastInst *CI = dyn_cast<CastInst>(CurInst)) {
2169 InstResult = ConstantExpr::getCast(CI->getOpcode(),
2170 getVal(Values, CI->getOperand(0)),
2172 } else if (SelectInst *SI = dyn_cast<SelectInst>(CurInst)) {
2173 InstResult = ConstantExpr::getSelect(getVal(Values, SI->getOperand(0)),
2174 getVal(Values, SI->getOperand(1)),
2175 getVal(Values, SI->getOperand(2)));
2176 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(CurInst)) {
2177 Constant *P = getVal(Values, GEP->getOperand(0));
2178 SmallVector<Constant*, 8> GEPOps;
2179 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end();
2181 GEPOps.push_back(getVal(Values, *i));
2182 InstResult = ConstantExpr::getGetElementPtr(P, &GEPOps[0], GEPOps.size());
2183 } else if (LoadInst *LI = dyn_cast<LoadInst>(CurInst)) {
2184 if (LI->isVolatile()) return false; // no volatile accesses.
2185 InstResult = ComputeLoadResult(getVal(Values, LI->getOperand(0)),
2187 if (InstResult == 0) return false; // Could not evaluate load.
2188 } else if (AllocaInst *AI = dyn_cast<AllocaInst>(CurInst)) {
2189 if (AI->isArrayAllocation()) return false; // Cannot handle array allocs.
2190 const Type *Ty = AI->getType()->getElementType();
2191 AllocaTmps.push_back(new GlobalVariable(Ty, false,
2192 GlobalValue::InternalLinkage,
2193 UndefValue::get(Ty),
2195 InstResult = AllocaTmps.back();
2196 } else if (CallInst *CI = dyn_cast<CallInst>(CurInst)) {
2198 // Debug info can safely be ignored here.
2199 if (isa<DbgInfoIntrinsic>(CI)) {
2204 // Cannot handle inline asm.
2205 if (isa<InlineAsm>(CI->getOperand(0))) return false;
2207 // Resolve function pointers.
2208 Function *Callee = dyn_cast<Function>(getVal(Values, CI->getOperand(0)));
2209 if (!Callee) return false; // Cannot resolve.
2211 std::vector<Constant*> Formals;
2212 for (User::op_iterator i = CI->op_begin() + 1, e = CI->op_end();
2214 Formals.push_back(getVal(Values, *i));
2216 if (Callee->isDeclaration()) {
2217 // If this is a function we can constant fold, do it.
2218 if (Constant *C = ConstantFoldCall(Callee, &Formals[0],
2225 if (Callee->getFunctionType()->isVarArg())
2229 // Execute the call, if successful, use the return value.
2230 if (!EvaluateFunction(Callee, RetVal, Formals, CallStack,
2231 MutatedMemory, AllocaTmps))
2233 InstResult = RetVal;
2235 } else if (isa<TerminatorInst>(CurInst)) {
2236 BasicBlock *NewBB = 0;
2237 if (BranchInst *BI = dyn_cast<BranchInst>(CurInst)) {
2238 if (BI->isUnconditional()) {
2239 NewBB = BI->getSuccessor(0);
2242 dyn_cast<ConstantInt>(getVal(Values, BI->getCondition()));
2243 if (!Cond) return false; // Cannot determine.
2245 NewBB = BI->getSuccessor(!Cond->getZExtValue());
2247 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(CurInst)) {
2249 dyn_cast<ConstantInt>(getVal(Values, SI->getCondition()));
2250 if (!Val) return false; // Cannot determine.
2251 NewBB = SI->getSuccessor(SI->findCaseValue(Val));
2252 } else if (ReturnInst *RI = dyn_cast<ReturnInst>(CurInst)) {
2253 if (RI->getNumOperands())
2254 RetVal = getVal(Values, RI->getOperand(0));
2256 CallStack.pop_back(); // return from fn.
2257 return true; // We succeeded at evaluating this ctor!
2259 // invoke, unwind, unreachable.
2260 return false; // Cannot handle this terminator.
2263 // Okay, we succeeded in evaluating this control flow. See if we have
2264 // executed the new block before. If so, we have a looping function,
2265 // which we cannot evaluate in reasonable time.
2266 if (!ExecutedBlocks.insert(NewBB))
2267 return false; // looped!
2269 // Okay, we have never been in this block before. Check to see if there
2270 // are any PHI nodes. If so, evaluate them with information about where
2272 BasicBlock *OldBB = CurInst->getParent();
2273 CurInst = NewBB->begin();
2275 for (; (PN = dyn_cast<PHINode>(CurInst)); ++CurInst)
2276 Values[PN] = getVal(Values, PN->getIncomingValueForBlock(OldBB));
2278 // Do NOT increment CurInst. We know that the terminator had no value.
2281 // Did not know how to evaluate this!
2285 if (!CurInst->use_empty())
2286 Values[CurInst] = InstResult;
2288 // Advance program counter.
2293 /// EvaluateStaticConstructor - Evaluate static constructors in the function, if
2294 /// we can. Return true if we can, false otherwise.
2295 static bool EvaluateStaticConstructor(Function *F) {
2296 /// MutatedMemory - For each store we execute, we update this map. Loads
2297 /// check this to get the most up-to-date value. If evaluation is successful,
2298 /// this state is committed to the process.
2299 DenseMap<Constant*, Constant*> MutatedMemory;
2301 /// AllocaTmps - To 'execute' an alloca, we create a temporary global variable
2302 /// to represent its body. This vector is needed so we can delete the
2303 /// temporary globals when we are done.
2304 std::vector<GlobalVariable*> AllocaTmps;
2306 /// CallStack - This is used to detect recursion. In pathological situations
2307 /// we could hit exponential behavior, but at least there is nothing
2309 std::vector<Function*> CallStack;
2311 // Call the function.
2312 Constant *RetValDummy;
2313 bool EvalSuccess = EvaluateFunction(F, RetValDummy, std::vector<Constant*>(),
2314 CallStack, MutatedMemory, AllocaTmps);
2316 // We succeeded at evaluation: commit the result.
2317 DOUT << "FULLY EVALUATED GLOBAL CTOR FUNCTION '"
2318 << F->getName() << "' to " << MutatedMemory.size()
2320 for (DenseMap<Constant*, Constant*>::iterator I = MutatedMemory.begin(),
2321 E = MutatedMemory.end(); I != E; ++I)
2322 CommitValueTo(I->second, I->first);
2325 // At this point, we are done interpreting. If we created any 'alloca'
2326 // temporaries, release them now.
2327 while (!AllocaTmps.empty()) {
2328 GlobalVariable *Tmp = AllocaTmps.back();
2329 AllocaTmps.pop_back();
2331 // If there are still users of the alloca, the program is doing something
2332 // silly, e.g. storing the address of the alloca somewhere and using it
2333 // later. Since this is undefined, we'll just make it be null.
2334 if (!Tmp->use_empty())
2335 Tmp->replaceAllUsesWith(Constant::getNullValue(Tmp->getType()));
2344 /// OptimizeGlobalCtorsList - Simplify and evaluation global ctors if possible.
2345 /// Return true if anything changed.
2346 bool GlobalOpt::OptimizeGlobalCtorsList(GlobalVariable *&GCL) {
2347 std::vector<Function*> Ctors = ParseGlobalCtors(GCL);
2348 bool MadeChange = false;
2349 if (Ctors.empty()) return false;
2351 // Loop over global ctors, optimizing them when we can.
2352 for (unsigned i = 0; i != Ctors.size(); ++i) {
2353 Function *F = Ctors[i];
2354 // Found a null terminator in the middle of the list, prune off the rest of
2357 if (i != Ctors.size()-1) {
2364 // We cannot simplify external ctor functions.
2365 if (F->empty()) continue;
2367 // If we can evaluate the ctor at compile time, do.
2368 if (EvaluateStaticConstructor(F)) {
2369 Ctors.erase(Ctors.begin()+i);
2372 ++NumCtorsEvaluated;
2377 if (!MadeChange) return false;
2379 GCL = InstallGlobalCtors(GCL, Ctors);
2383 bool GlobalOpt::OptimizeGlobalAliases(Module &M) {
2384 bool Changed = false;
2386 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
2388 Module::alias_iterator J = I++;
2389 // Aliases without names cannot be referenced outside this module.
2390 if (!J->hasName() && !J->isDeclaration())
2391 J->setLinkage(GlobalValue::InternalLinkage);
2392 // If the aliasee may change at link time, nothing can be done - bail out.
2393 if (J->mayBeOverridden())
2396 Constant *Aliasee = J->getAliasee();
2397 GlobalValue *Target = cast<GlobalValue>(Aliasee->stripPointerCasts());
2398 Target->removeDeadConstantUsers();
2399 bool hasOneUse = Target->hasOneUse() && Aliasee->hasOneUse();
2401 // Make all users of the alias use the aliasee instead.
2402 if (!J->use_empty()) {
2403 J->replaceAllUsesWith(Aliasee);
2404 ++NumAliasesResolved;
2408 // If the aliasee has internal linkage, give it the name and linkage
2409 // of the alias, and delete the alias. This turns:
2410 // define internal ... @f(...)
2411 // @a = alias ... @f
2413 // define ... @a(...)
2414 if (!Target->hasLocalLinkage())
2417 // The transform is only useful if the alias does not have internal linkage.
2418 if (J->hasLocalLinkage())
2421 // Do not perform the transform if multiple aliases potentially target the
2422 // aliasee. This check also ensures that it is safe to replace the section
2423 // and other attributes of the aliasee with those of the alias.
2427 // Give the aliasee the name, linkage and other attributes of the alias.
2428 Target->takeName(J);
2429 Target->setLinkage(J->getLinkage());
2430 Target->GlobalValue::copyAttributesFrom(J);
2432 // Delete the alias.
2433 M.getAliasList().erase(J);
2434 ++NumAliasesRemoved;
2441 bool GlobalOpt::runOnModule(Module &M) {
2442 bool Changed = false;
2444 // Try to find the llvm.globalctors list.
2445 GlobalVariable *GlobalCtors = FindGlobalCtors(M);
2447 bool LocalChange = true;
2448 while (LocalChange) {
2449 LocalChange = false;
2451 // Delete functions that are trivially dead, ccc -> fastcc
2452 LocalChange |= OptimizeFunctions(M);
2454 // Optimize global_ctors list.
2456 LocalChange |= OptimizeGlobalCtorsList(GlobalCtors);
2458 // Optimize non-address-taken globals.
2459 LocalChange |= OptimizeGlobalVars(M);
2461 // Resolve aliases, when possible.
2462 LocalChange |= OptimizeGlobalAliases(M);
2463 Changed |= LocalChange;
2466 // TODO: Move all global ctors functions to the end of the module for code