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/SmallPtrSet.h"
33 #include "llvm/ADT/SmallVector.h"
34 #include "llvm/ADT/Statistic.h"
35 #include "llvm/ADT/StringExtras.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");
55 struct VISIBILITY_HIDDEN GlobalOpt : public ModulePass {
56 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
57 AU.addRequired<TargetData>();
59 static char ID; // Pass identification, replacement for typeid
60 GlobalOpt() : ModulePass((intptr_t)&ID) {}
62 bool runOnModule(Module &M);
65 GlobalVariable *FindGlobalCtors(Module &M);
66 bool OptimizeFunctions(Module &M);
67 bool OptimizeGlobalVars(Module &M);
68 bool OptimizeGlobalCtorsList(GlobalVariable *&GCL);
69 bool ProcessInternalGlobal(GlobalVariable *GV,Module::global_iterator &GVI);
73 char GlobalOpt::ID = 0;
74 static RegisterPass<GlobalOpt> X("globalopt", "Global Variable Optimizer");
76 ModulePass *llvm::createGlobalOptimizerPass() { return new GlobalOpt(); }
80 /// GlobalStatus - As we analyze each global, keep track of some information
81 /// about it. If we find out that the address of the global is taken, none of
82 /// this info will be accurate.
83 struct VISIBILITY_HIDDEN GlobalStatus {
84 /// isLoaded - True if the global is ever loaded. If the global isn't ever
85 /// loaded it can be deleted.
88 /// StoredType - Keep track of what stores to the global look like.
91 /// NotStored - There is no store to this global. It can thus be marked
95 /// isInitializerStored - This global is stored to, but the only thing
96 /// stored is the constant it was initialized with. This is only tracked
97 /// for scalar globals.
100 /// isStoredOnce - This global is stored to, but only its initializer and
101 /// one other value is ever stored to it. If this global isStoredOnce, we
102 /// track the value stored to it in StoredOnceValue below. This is only
103 /// tracked for scalar globals.
106 /// isStored - This global is stored to by multiple values or something else
107 /// that we cannot track.
111 /// StoredOnceValue - If only one value (besides the initializer constant) is
112 /// ever stored to this global, keep track of what value it is.
113 Value *StoredOnceValue;
115 /// AccessingFunction/HasMultipleAccessingFunctions - These start out
116 /// null/false. When the first accessing function is noticed, it is recorded.
117 /// When a second different accessing function is noticed,
118 /// HasMultipleAccessingFunctions is set to true.
119 Function *AccessingFunction;
120 bool HasMultipleAccessingFunctions;
122 /// HasNonInstructionUser - Set to true if this global has a user that is not
123 /// an instruction (e.g. a constant expr or GV initializer).
124 bool HasNonInstructionUser;
126 /// HasPHIUser - Set to true if this global has a user that is a PHI node.
129 GlobalStatus() : isLoaded(false), StoredType(NotStored), StoredOnceValue(0),
130 AccessingFunction(0), HasMultipleAccessingFunctions(false),
131 HasNonInstructionUser(false), HasPHIUser(false) {}
136 /// ConstantIsDead - Return true if the specified constant is (transitively)
137 /// dead. The constant may be used by other constants (e.g. constant arrays and
138 /// constant exprs) as long as they are dead, but it cannot be used by anything
140 static bool ConstantIsDead(Constant *C) {
141 if (isa<GlobalValue>(C)) return false;
143 for (Value::use_iterator UI = C->use_begin(), E = C->use_end(); UI != E; ++UI)
144 if (Constant *CU = dyn_cast<Constant>(*UI)) {
145 if (!ConstantIsDead(CU)) return false;
152 /// AnalyzeGlobal - Look at all uses of the global and fill in the GlobalStatus
153 /// structure. If the global has its address taken, return true to indicate we
154 /// can't do anything with it.
156 static bool AnalyzeGlobal(Value *V, GlobalStatus &GS,
157 std::set<PHINode*> &PHIUsers) {
158 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI)
159 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(*UI)) {
160 GS.HasNonInstructionUser = true;
162 if (AnalyzeGlobal(CE, GS, PHIUsers)) return true;
164 } else if (Instruction *I = dyn_cast<Instruction>(*UI)) {
165 if (!GS.HasMultipleAccessingFunctions) {
166 Function *F = I->getParent()->getParent();
167 if (GS.AccessingFunction == 0)
168 GS.AccessingFunction = F;
169 else if (GS.AccessingFunction != F)
170 GS.HasMultipleAccessingFunctions = true;
172 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
174 if (LI->isVolatile()) return true; // Don't hack on volatile loads.
175 } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
176 // Don't allow a store OF the address, only stores TO the address.
177 if (SI->getOperand(0) == V) return true;
179 if (SI->isVolatile()) return true; // Don't hack on volatile stores.
181 // If this is a direct store to the global (i.e., the global is a scalar
182 // value, not an aggregate), keep more specific information about
184 if (GS.StoredType != GlobalStatus::isStored) {
185 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(SI->getOperand(1))){
186 Value *StoredVal = SI->getOperand(0);
187 if (StoredVal == GV->getInitializer()) {
188 if (GS.StoredType < GlobalStatus::isInitializerStored)
189 GS.StoredType = GlobalStatus::isInitializerStored;
190 } else if (isa<LoadInst>(StoredVal) &&
191 cast<LoadInst>(StoredVal)->getOperand(0) == GV) {
193 if (GS.StoredType < GlobalStatus::isInitializerStored)
194 GS.StoredType = GlobalStatus::isInitializerStored;
195 } else if (GS.StoredType < GlobalStatus::isStoredOnce) {
196 GS.StoredType = GlobalStatus::isStoredOnce;
197 GS.StoredOnceValue = StoredVal;
198 } else if (GS.StoredType == GlobalStatus::isStoredOnce &&
199 GS.StoredOnceValue == StoredVal) {
202 GS.StoredType = GlobalStatus::isStored;
205 GS.StoredType = GlobalStatus::isStored;
208 } else if (isa<GetElementPtrInst>(I)) {
209 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
210 } else if (isa<SelectInst>(I)) {
211 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
212 } else if (PHINode *PN = dyn_cast<PHINode>(I)) {
213 // PHI nodes we can check just like select or GEP instructions, but we
214 // have to be careful about infinite recursion.
215 if (PHIUsers.insert(PN).second) // Not already visited.
216 if (AnalyzeGlobal(I, GS, PHIUsers)) return true;
217 GS.HasPHIUser = true;
218 } else if (isa<CmpInst>(I)) {
219 } else if (isa<MemCpyInst>(I) || isa<MemMoveInst>(I)) {
220 if (I->getOperand(1) == V)
221 GS.StoredType = GlobalStatus::isStored;
222 if (I->getOperand(2) == V)
224 } else if (isa<MemSetInst>(I)) {
225 assert(I->getOperand(1) == V && "Memset only takes one pointer!");
226 GS.StoredType = GlobalStatus::isStored;
228 return true; // Any other non-load instruction might take address!
230 } else if (Constant *C = dyn_cast<Constant>(*UI)) {
231 GS.HasNonInstructionUser = true;
232 // We might have a dead and dangling constant hanging off of here.
233 if (!ConstantIsDead(C))
236 GS.HasNonInstructionUser = true;
237 // Otherwise must be some other user.
244 static Constant *getAggregateConstantElement(Constant *Agg, Constant *Idx) {
245 ConstantInt *CI = dyn_cast<ConstantInt>(Idx);
247 unsigned IdxV = CI->getZExtValue();
249 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(Agg)) {
250 if (IdxV < CS->getNumOperands()) return CS->getOperand(IdxV);
251 } else if (ConstantArray *CA = dyn_cast<ConstantArray>(Agg)) {
252 if (IdxV < CA->getNumOperands()) return CA->getOperand(IdxV);
253 } else if (ConstantVector *CP = dyn_cast<ConstantVector>(Agg)) {
254 if (IdxV < CP->getNumOperands()) return CP->getOperand(IdxV);
255 } else if (isa<ConstantAggregateZero>(Agg)) {
256 if (const StructType *STy = dyn_cast<StructType>(Agg->getType())) {
257 if (IdxV < STy->getNumElements())
258 return Constant::getNullValue(STy->getElementType(IdxV));
259 } else if (const SequentialType *STy =
260 dyn_cast<SequentialType>(Agg->getType())) {
261 return Constant::getNullValue(STy->getElementType());
263 } else if (isa<UndefValue>(Agg)) {
264 if (const StructType *STy = dyn_cast<StructType>(Agg->getType())) {
265 if (IdxV < STy->getNumElements())
266 return UndefValue::get(STy->getElementType(IdxV));
267 } else if (const SequentialType *STy =
268 dyn_cast<SequentialType>(Agg->getType())) {
269 return UndefValue::get(STy->getElementType());
276 /// CleanupConstantGlobalUsers - We just marked GV constant. Loop over all
277 /// users of the global, cleaning up the obvious ones. This is largely just a
278 /// quick scan over the use list to clean up the easy and obvious cruft. This
279 /// returns true if it made a change.
280 static bool CleanupConstantGlobalUsers(Value *V, Constant *Init) {
281 bool Changed = false;
282 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;) {
285 if (LoadInst *LI = dyn_cast<LoadInst>(U)) {
287 // Replace the load with the initializer.
288 LI->replaceAllUsesWith(Init);
289 LI->eraseFromParent();
292 } else if (StoreInst *SI = dyn_cast<StoreInst>(U)) {
293 // Store must be unreachable or storing Init into the global.
294 SI->eraseFromParent();
296 } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(U)) {
297 if (CE->getOpcode() == Instruction::GetElementPtr) {
298 Constant *SubInit = 0;
300 SubInit = ConstantFoldLoadThroughGEPConstantExpr(Init, CE);
301 Changed |= CleanupConstantGlobalUsers(CE, SubInit);
302 } else if (CE->getOpcode() == Instruction::BitCast &&
303 isa<PointerType>(CE->getType())) {
304 // Pointer cast, delete any stores and memsets to the global.
305 Changed |= CleanupConstantGlobalUsers(CE, 0);
308 if (CE->use_empty()) {
309 CE->destroyConstant();
312 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(U)) {
313 // Do not transform "gepinst (gep constexpr (GV))" here, because forming
314 // "gepconstexpr (gep constexpr (GV))" will cause the two gep's to fold
315 // and will invalidate our notion of what Init is.
316 Constant *SubInit = 0;
317 if (!isa<ConstantExpr>(GEP->getOperand(0))) {
319 dyn_cast_or_null<ConstantExpr>(ConstantFoldInstruction(GEP));
320 if (Init && CE && CE->getOpcode() == Instruction::GetElementPtr)
321 SubInit = ConstantFoldLoadThroughGEPConstantExpr(Init, CE);
323 Changed |= CleanupConstantGlobalUsers(GEP, SubInit);
325 if (GEP->use_empty()) {
326 GEP->eraseFromParent();
329 } else if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(U)) { // memset/cpy/mv
330 if (MI->getRawDest() == V) {
331 MI->eraseFromParent();
335 } else if (Constant *C = dyn_cast<Constant>(U)) {
336 // If we have a chain of dead constantexprs or other things dangling from
337 // us, and if they are all dead, nuke them without remorse.
338 if (ConstantIsDead(C)) {
339 C->destroyConstant();
340 // This could have invalidated UI, start over from scratch.
341 CleanupConstantGlobalUsers(V, Init);
349 /// isSafeSROAElementUse - Return true if the specified instruction is a safe
350 /// user of a derived expression from a global that we want to SROA.
351 static bool isSafeSROAElementUse(Value *V) {
352 // We might have a dead and dangling constant hanging off of here.
353 if (Constant *C = dyn_cast<Constant>(V))
354 return ConstantIsDead(C);
356 Instruction *I = dyn_cast<Instruction>(V);
357 if (!I) return false;
360 if (isa<LoadInst>(I)) return true;
362 // Stores *to* the pointer are ok.
363 if (StoreInst *SI = dyn_cast<StoreInst>(I))
364 return SI->getOperand(0) != V;
366 // Otherwise, it must be a GEP.
367 GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I);
368 if (GEPI == 0) return false;
370 if (GEPI->getNumOperands() < 3 || !isa<Constant>(GEPI->getOperand(1)) ||
371 !cast<Constant>(GEPI->getOperand(1))->isNullValue())
374 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
376 if (!isSafeSROAElementUse(*I))
382 /// IsUserOfGlobalSafeForSRA - U is a direct user of the specified global value.
383 /// Look at it and its uses and decide whether it is safe to SROA this global.
385 static bool IsUserOfGlobalSafeForSRA(User *U, GlobalValue *GV) {
386 // The user of the global must be a GEP Inst or a ConstantExpr GEP.
387 if (!isa<GetElementPtrInst>(U) &&
388 (!isa<ConstantExpr>(U) ||
389 cast<ConstantExpr>(U)->getOpcode() != Instruction::GetElementPtr))
392 // Check to see if this ConstantExpr GEP is SRA'able. In particular, we
393 // don't like < 3 operand CE's, and we don't like non-constant integer
394 // indices. This enforces that all uses are 'gep GV, 0, C, ...' for some
396 if (U->getNumOperands() < 3 || !isa<Constant>(U->getOperand(1)) ||
397 !cast<Constant>(U->getOperand(1))->isNullValue() ||
398 !isa<ConstantInt>(U->getOperand(2)))
401 gep_type_iterator GEPI = gep_type_begin(U), E = gep_type_end(U);
402 ++GEPI; // Skip over the pointer index.
404 // If this is a use of an array allocation, do a bit more checking for sanity.
405 if (const ArrayType *AT = dyn_cast<ArrayType>(*GEPI)) {
406 uint64_t NumElements = AT->getNumElements();
407 ConstantInt *Idx = cast<ConstantInt>(U->getOperand(2));
409 // Check to make sure that index falls within the array. If not,
410 // something funny is going on, so we won't do the optimization.
412 if (Idx->getZExtValue() >= NumElements)
415 // We cannot scalar repl this level of the array unless any array
416 // sub-indices are in-range constants. In particular, consider:
417 // A[0][i]. We cannot know that the user isn't doing invalid things like
418 // allowing i to index an out-of-range subscript that accesses A[1].
420 // Scalar replacing *just* the outer index of the array is probably not
421 // going to be a win anyway, so just give up.
422 for (++GEPI; // Skip array index.
423 GEPI != E && (isa<ArrayType>(*GEPI) || isa<VectorType>(*GEPI));
425 uint64_t NumElements;
426 if (const ArrayType *SubArrayTy = dyn_cast<ArrayType>(*GEPI))
427 NumElements = SubArrayTy->getNumElements();
429 NumElements = cast<VectorType>(*GEPI)->getNumElements();
431 ConstantInt *IdxVal = dyn_cast<ConstantInt>(GEPI.getOperand());
432 if (!IdxVal || IdxVal->getZExtValue() >= NumElements)
437 for (Value::use_iterator I = U->use_begin(), E = U->use_end(); I != E; ++I)
438 if (!isSafeSROAElementUse(*I))
443 /// GlobalUsersSafeToSRA - Look at all uses of the global and decide whether it
444 /// is safe for us to perform this transformation.
446 static bool GlobalUsersSafeToSRA(GlobalValue *GV) {
447 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end();
449 if (!IsUserOfGlobalSafeForSRA(*UI, GV))
456 /// SRAGlobal - Perform scalar replacement of aggregates on the specified global
457 /// variable. This opens the door for other optimizations by exposing the
458 /// behavior of the program in a more fine-grained way. We have determined that
459 /// this transformation is safe already. We return the first global variable we
460 /// insert so that the caller can reprocess it.
461 static GlobalVariable *SRAGlobal(GlobalVariable *GV, const TargetData &TD) {
462 // Make sure this global only has simple uses that we can SRA.
463 if (!GlobalUsersSafeToSRA(GV))
466 assert(GV->hasInternalLinkage() && !GV->isConstant());
467 Constant *Init = GV->getInitializer();
468 const Type *Ty = Init->getType();
470 std::vector<GlobalVariable*> NewGlobals;
471 Module::GlobalListType &Globals = GV->getParent()->getGlobalList();
473 // Get the alignment of the global, either explicit or target-specific.
474 unsigned StartAlignment = GV->getAlignment();
475 if (StartAlignment == 0)
476 StartAlignment = TD.getABITypeAlignment(GV->getType());
478 if (const StructType *STy = dyn_cast<StructType>(Ty)) {
479 NewGlobals.reserve(STy->getNumElements());
480 const StructLayout &Layout = *TD.getStructLayout(STy);
481 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i) {
482 Constant *In = getAggregateConstantElement(Init,
483 ConstantInt::get(Type::Int32Ty, i));
484 assert(In && "Couldn't get element of initializer?");
485 GlobalVariable *NGV = new GlobalVariable(STy->getElementType(i), false,
486 GlobalVariable::InternalLinkage,
487 In, GV->getName()+"."+utostr(i),
489 GV->isThreadLocal());
490 Globals.insert(GV, NGV);
491 NewGlobals.push_back(NGV);
493 // Calculate the known alignment of the field. If the original aggregate
494 // had 256 byte alignment for example, something might depend on that:
495 // propagate info to each field.
496 uint64_t FieldOffset = Layout.getElementOffset(i);
497 unsigned NewAlign = (unsigned)MinAlign(StartAlignment, FieldOffset);
498 if (NewAlign > TD.getABITypeAlignment(STy->getElementType(i)))
499 NGV->setAlignment(NewAlign);
501 } else if (const SequentialType *STy = dyn_cast<SequentialType>(Ty)) {
502 unsigned NumElements = 0;
503 if (const ArrayType *ATy = dyn_cast<ArrayType>(STy))
504 NumElements = ATy->getNumElements();
506 NumElements = cast<VectorType>(STy)->getNumElements();
508 if (NumElements > 16 && GV->hasNUsesOrMore(16))
509 return 0; // It's not worth it.
510 NewGlobals.reserve(NumElements);
512 uint64_t EltSize = TD.getABITypeSize(STy->getElementType());
513 unsigned EltAlign = TD.getABITypeAlignment(STy->getElementType());
514 for (unsigned i = 0, e = NumElements; i != e; ++i) {
515 Constant *In = getAggregateConstantElement(Init,
516 ConstantInt::get(Type::Int32Ty, i));
517 assert(In && "Couldn't get element of initializer?");
519 GlobalVariable *NGV = new GlobalVariable(STy->getElementType(), false,
520 GlobalVariable::InternalLinkage,
521 In, GV->getName()+"."+utostr(i),
523 GV->isThreadLocal());
524 Globals.insert(GV, NGV);
525 NewGlobals.push_back(NGV);
527 // Calculate the known alignment of the field. If the original aggregate
528 // had 256 byte alignment for example, something might depend on that:
529 // propagate info to each field.
530 unsigned NewAlign = (unsigned)MinAlign(StartAlignment, EltSize*i);
531 if (NewAlign > EltAlign)
532 NGV->setAlignment(NewAlign);
536 if (NewGlobals.empty())
539 DOUT << "PERFORMING GLOBAL SRA ON: " << *GV;
541 Constant *NullInt = Constant::getNullValue(Type::Int32Ty);
543 // Loop over all of the uses of the global, replacing the constantexpr geps,
544 // with smaller constantexpr geps or direct references.
545 while (!GV->use_empty()) {
546 User *GEP = GV->use_back();
547 assert(((isa<ConstantExpr>(GEP) &&
548 cast<ConstantExpr>(GEP)->getOpcode()==Instruction::GetElementPtr)||
549 isa<GetElementPtrInst>(GEP)) && "NonGEP CE's are not SRAable!");
551 // Ignore the 1th operand, which has to be zero or else the program is quite
552 // broken (undefined). Get the 2nd operand, which is the structure or array
554 unsigned Val = cast<ConstantInt>(GEP->getOperand(2))->getZExtValue();
555 if (Val >= NewGlobals.size()) Val = 0; // Out of bound array access.
557 Value *NewPtr = NewGlobals[Val];
559 // Form a shorter GEP if needed.
560 if (GEP->getNumOperands() > 3) {
561 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(GEP)) {
562 SmallVector<Constant*, 8> Idxs;
563 Idxs.push_back(NullInt);
564 for (unsigned i = 3, e = CE->getNumOperands(); i != e; ++i)
565 Idxs.push_back(CE->getOperand(i));
566 NewPtr = ConstantExpr::getGetElementPtr(cast<Constant>(NewPtr),
567 &Idxs[0], Idxs.size());
569 GetElementPtrInst *GEPI = cast<GetElementPtrInst>(GEP);
570 SmallVector<Value*, 8> Idxs;
571 Idxs.push_back(NullInt);
572 for (unsigned i = 3, e = GEPI->getNumOperands(); i != e; ++i)
573 Idxs.push_back(GEPI->getOperand(i));
574 NewPtr = GetElementPtrInst::Create(NewPtr, Idxs.begin(), Idxs.end(),
575 GEPI->getName()+"."+utostr(Val), GEPI);
578 GEP->replaceAllUsesWith(NewPtr);
580 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(GEP))
581 GEPI->eraseFromParent();
583 cast<ConstantExpr>(GEP)->destroyConstant();
586 // Delete the old global, now that it is dead.
590 // Loop over the new globals array deleting any globals that are obviously
591 // dead. This can arise due to scalarization of a structure or an array that
592 // has elements that are dead.
593 unsigned FirstGlobal = 0;
594 for (unsigned i = 0, e = NewGlobals.size(); i != e; ++i)
595 if (NewGlobals[i]->use_empty()) {
596 Globals.erase(NewGlobals[i]);
597 if (FirstGlobal == i) ++FirstGlobal;
600 return FirstGlobal != NewGlobals.size() ? NewGlobals[FirstGlobal] : 0;
603 /// AllUsesOfValueWillTrapIfNull - Return true if all users of the specified
604 /// value will trap if the value is dynamically null. PHIs keeps track of any
605 /// phi nodes we've seen to avoid reprocessing them.
606 static bool AllUsesOfValueWillTrapIfNull(Value *V,
607 SmallPtrSet<PHINode*, 8> &PHIs) {
608 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI)
609 if (isa<LoadInst>(*UI)) {
611 } else if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
612 if (SI->getOperand(0) == V) {
613 //cerr << "NONTRAPPING USE: " << **UI;
614 return false; // Storing the value.
616 } else if (CallInst *CI = dyn_cast<CallInst>(*UI)) {
617 if (CI->getOperand(0) != V) {
618 //cerr << "NONTRAPPING USE: " << **UI;
619 return false; // Not calling the ptr
621 } else if (InvokeInst *II = dyn_cast<InvokeInst>(*UI)) {
622 if (II->getOperand(0) != V) {
623 //cerr << "NONTRAPPING USE: " << **UI;
624 return false; // Not calling the ptr
626 } else if (BitCastInst *CI = dyn_cast<BitCastInst>(*UI)) {
627 if (!AllUsesOfValueWillTrapIfNull(CI, PHIs)) return false;
628 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(*UI)) {
629 if (!AllUsesOfValueWillTrapIfNull(GEPI, PHIs)) return false;
630 } else if (PHINode *PN = dyn_cast<PHINode>(*UI)) {
631 // If we've already seen this phi node, ignore it, it has already been
634 return AllUsesOfValueWillTrapIfNull(PN, PHIs);
635 } else if (isa<ICmpInst>(*UI) &&
636 isa<ConstantPointerNull>(UI->getOperand(1))) {
637 // Ignore setcc X, null
639 //cerr << "NONTRAPPING USE: " << **UI;
645 /// AllUsesOfLoadedValueWillTrapIfNull - Return true if all uses of any loads
646 /// from GV will trap if the loaded value is null. Note that this also permits
647 /// comparisons of the loaded value against null, as a special case.
648 static bool AllUsesOfLoadedValueWillTrapIfNull(GlobalVariable *GV) {
649 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end(); UI!=E; ++UI)
650 if (LoadInst *LI = dyn_cast<LoadInst>(*UI)) {
651 SmallPtrSet<PHINode*, 8> PHIs;
652 if (!AllUsesOfValueWillTrapIfNull(LI, PHIs))
654 } else if (isa<StoreInst>(*UI)) {
655 // Ignore stores to the global.
657 // We don't know or understand this user, bail out.
658 //cerr << "UNKNOWN USER OF GLOBAL!: " << **UI;
665 static bool OptimizeAwayTrappingUsesOfValue(Value *V, Constant *NewV) {
666 bool Changed = false;
667 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ) {
668 Instruction *I = cast<Instruction>(*UI++);
669 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
670 LI->setOperand(0, NewV);
672 } else if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
673 if (SI->getOperand(1) == V) {
674 SI->setOperand(1, NewV);
677 } else if (isa<CallInst>(I) || isa<InvokeInst>(I)) {
678 if (I->getOperand(0) == V) {
679 // Calling through the pointer! Turn into a direct call, but be careful
680 // that the pointer is not also being passed as an argument.
681 I->setOperand(0, NewV);
683 bool PassedAsArg = false;
684 for (unsigned i = 1, e = I->getNumOperands(); i != e; ++i)
685 if (I->getOperand(i) == V) {
687 I->setOperand(i, NewV);
691 // Being passed as an argument also. Be careful to not invalidate UI!
695 } else if (CastInst *CI = dyn_cast<CastInst>(I)) {
696 Changed |= OptimizeAwayTrappingUsesOfValue(CI,
697 ConstantExpr::getCast(CI->getOpcode(),
698 NewV, CI->getType()));
699 if (CI->use_empty()) {
701 CI->eraseFromParent();
703 } else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(I)) {
704 // Should handle GEP here.
705 SmallVector<Constant*, 8> Idxs;
706 Idxs.reserve(GEPI->getNumOperands()-1);
707 for (User::op_iterator i = GEPI->op_begin() + 1, e = GEPI->op_end();
709 if (Constant *C = dyn_cast<Constant>(*i))
713 if (Idxs.size() == GEPI->getNumOperands()-1)
714 Changed |= OptimizeAwayTrappingUsesOfValue(GEPI,
715 ConstantExpr::getGetElementPtr(NewV, &Idxs[0],
717 if (GEPI->use_empty()) {
719 GEPI->eraseFromParent();
728 /// OptimizeAwayTrappingUsesOfLoads - The specified global has only one non-null
729 /// value stored into it. If there are uses of the loaded value that would trap
730 /// if the loaded value is dynamically null, then we know that they cannot be
731 /// reachable with a null optimize away the load.
732 static bool OptimizeAwayTrappingUsesOfLoads(GlobalVariable *GV, Constant *LV) {
733 std::vector<LoadInst*> Loads;
734 bool Changed = false;
736 // Replace all uses of loads with uses of uses of the stored value.
737 for (Value::use_iterator GUI = GV->use_begin(), E = GV->use_end();
739 if (LoadInst *LI = dyn_cast<LoadInst>(*GUI)) {
741 Changed |= OptimizeAwayTrappingUsesOfValue(LI, LV);
743 // If we get here we could have stores, selects, or phi nodes whose values
745 assert((isa<StoreInst>(*GUI) || isa<PHINode>(*GUI) ||
746 isa<SelectInst>(*GUI) || isa<ConstantExpr>(*GUI)) &&
747 "Only expect load and stores!");
751 DOUT << "OPTIMIZED LOADS FROM STORED ONCE POINTER: " << *GV;
755 // Delete all of the loads we can, keeping track of whether we nuked them all!
756 bool AllLoadsGone = true;
757 while (!Loads.empty()) {
758 LoadInst *L = Loads.back();
759 if (L->use_empty()) {
760 L->eraseFromParent();
763 AllLoadsGone = false;
768 // If we nuked all of the loads, then none of the stores are needed either,
769 // nor is the global.
771 DOUT << " *** GLOBAL NOW DEAD!\n";
772 CleanupConstantGlobalUsers(GV, 0);
773 if (GV->use_empty()) {
774 GV->eraseFromParent();
782 /// ConstantPropUsersOf - Walk the use list of V, constant folding all of the
783 /// instructions that are foldable.
784 static void ConstantPropUsersOf(Value *V) {
785 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; )
786 if (Instruction *I = dyn_cast<Instruction>(*UI++))
787 if (Constant *NewC = ConstantFoldInstruction(I)) {
788 I->replaceAllUsesWith(NewC);
790 // Advance UI to the next non-I use to avoid invalidating it!
791 // Instructions could multiply use V.
792 while (UI != E && *UI == I)
794 I->eraseFromParent();
798 /// OptimizeGlobalAddressOfMalloc - This function takes the specified global
799 /// variable, and transforms the program as if it always contained the result of
800 /// the specified malloc. Because it is always the result of the specified
801 /// malloc, there is no reason to actually DO the malloc. Instead, turn the
802 /// malloc into a global, and any loads of GV as uses of the new global.
803 static GlobalVariable *OptimizeGlobalAddressOfMalloc(GlobalVariable *GV,
805 DOUT << "PROMOTING MALLOC GLOBAL: " << *GV << " MALLOC = " << *MI;
806 ConstantInt *NElements = cast<ConstantInt>(MI->getArraySize());
808 if (NElements->getZExtValue() != 1) {
809 // If we have an array allocation, transform it to a single element
810 // allocation to make the code below simpler.
811 Type *NewTy = ArrayType::get(MI->getAllocatedType(),
812 NElements->getZExtValue());
814 new MallocInst(NewTy, Constant::getNullValue(Type::Int32Ty),
815 MI->getAlignment(), MI->getName(), MI);
817 Indices[0] = Indices[1] = Constant::getNullValue(Type::Int32Ty);
818 Value *NewGEP = GetElementPtrInst::Create(NewMI, Indices, Indices + 2,
819 NewMI->getName()+".el0", MI);
820 MI->replaceAllUsesWith(NewGEP);
821 MI->eraseFromParent();
825 // Create the new global variable. The contents of the malloc'd memory is
826 // undefined, so initialize with an undef value.
827 Constant *Init = UndefValue::get(MI->getAllocatedType());
828 GlobalVariable *NewGV = new GlobalVariable(MI->getAllocatedType(), false,
829 GlobalValue::InternalLinkage, Init,
830 GV->getName()+".body",
832 GV->isThreadLocal());
833 // FIXME: This new global should have the alignment returned by malloc. Code
834 // could depend on malloc returning large alignment (on the mac, 16 bytes) but
835 // this would only guarantee some lower alignment.
836 GV->getParent()->getGlobalList().insert(GV, NewGV);
838 // Anything that used the malloc now uses the global directly.
839 MI->replaceAllUsesWith(NewGV);
841 Constant *RepValue = NewGV;
842 if (NewGV->getType() != GV->getType()->getElementType())
843 RepValue = ConstantExpr::getBitCast(RepValue,
844 GV->getType()->getElementType());
846 // If there is a comparison against null, we will insert a global bool to
847 // keep track of whether the global was initialized yet or not.
848 GlobalVariable *InitBool =
849 new GlobalVariable(Type::Int1Ty, false, GlobalValue::InternalLinkage,
850 ConstantInt::getFalse(), GV->getName()+".init",
851 (Module *)NULL, GV->isThreadLocal());
852 bool InitBoolUsed = false;
854 // Loop over all uses of GV, processing them in turn.
855 std::vector<StoreInst*> Stores;
856 while (!GV->use_empty())
857 if (LoadInst *LI = dyn_cast<LoadInst>(GV->use_back())) {
858 while (!LI->use_empty()) {
859 Use &LoadUse = LI->use_begin().getUse();
860 if (!isa<ICmpInst>(LoadUse.getUser()))
863 ICmpInst *CI = cast<ICmpInst>(LoadUse.getUser());
864 // Replace the cmp X, 0 with a use of the bool value.
865 Value *LV = new LoadInst(InitBool, InitBool->getName()+".val", CI);
867 switch (CI->getPredicate()) {
868 default: assert(0 && "Unknown ICmp Predicate!");
869 case ICmpInst::ICMP_ULT:
870 case ICmpInst::ICMP_SLT:
871 LV = ConstantInt::getFalse(); // X < null -> always false
873 case ICmpInst::ICMP_ULE:
874 case ICmpInst::ICMP_SLE:
875 case ICmpInst::ICMP_EQ:
876 LV = BinaryOperator::CreateNot(LV, "notinit", CI);
878 case ICmpInst::ICMP_NE:
879 case ICmpInst::ICMP_UGE:
880 case ICmpInst::ICMP_SGE:
881 case ICmpInst::ICMP_UGT:
882 case ICmpInst::ICMP_SGT:
885 CI->replaceAllUsesWith(LV);
886 CI->eraseFromParent();
889 LI->eraseFromParent();
891 StoreInst *SI = cast<StoreInst>(GV->use_back());
892 // The global is initialized when the store to it occurs.
893 new StoreInst(ConstantInt::getTrue(), InitBool, SI);
894 SI->eraseFromParent();
897 // If the initialization boolean was used, insert it, otherwise delete it.
899 while (!InitBool->use_empty()) // Delete initializations
900 cast<Instruction>(InitBool->use_back())->eraseFromParent();
903 GV->getParent()->getGlobalList().insert(GV, InitBool);
906 // Now the GV is dead, nuke it and the malloc.
907 GV->eraseFromParent();
908 MI->eraseFromParent();
910 // To further other optimizations, loop over all users of NewGV and try to
911 // constant prop them. This will promote GEP instructions with constant
912 // indices into GEP constant-exprs, which will allow global-opt to hack on it.
913 ConstantPropUsersOf(NewGV);
914 if (RepValue != NewGV)
915 ConstantPropUsersOf(RepValue);
920 /// ValueIsOnlyUsedLocallyOrStoredToOneGlobal - Scan the use-list of V checking
921 /// to make sure that there are no complex uses of V. We permit simple things
922 /// like dereferencing the pointer, but not storing through the address, unless
923 /// it is to the specified global.
924 static bool ValueIsOnlyUsedLocallyOrStoredToOneGlobal(Instruction *V,
926 SmallPtrSet<PHINode*, 8> &PHIs) {
927 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E; ++UI)
928 if (isa<LoadInst>(*UI) || isa<CmpInst>(*UI)) {
930 } else if (StoreInst *SI = dyn_cast<StoreInst>(*UI)) {
931 if (SI->getOperand(0) == V && SI->getOperand(1) != GV)
932 return false; // Storing the pointer itself... bad.
933 // Otherwise, storing through it, or storing into GV... fine.
934 } else if (isa<GetElementPtrInst>(*UI)) {
935 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(cast<Instruction>(*UI),
938 } else if (PHINode *PN = dyn_cast<PHINode>(*UI)) {
939 // PHIs are ok if all uses are ok. Don't infinitely recurse through PHI
942 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(PN, GV, PHIs))
950 /// ReplaceUsesOfMallocWithGlobal - The Alloc pointer is stored into GV
951 /// somewhere. Transform all uses of the allocation into loads from the
952 /// global and uses of the resultant pointer. Further, delete the store into
953 /// GV. This assumes that these value pass the
954 /// 'ValueIsOnlyUsedLocallyOrStoredToOneGlobal' predicate.
955 static void ReplaceUsesOfMallocWithGlobal(Instruction *Alloc,
956 GlobalVariable *GV) {
957 while (!Alloc->use_empty()) {
958 Instruction *U = cast<Instruction>(*Alloc->use_begin());
959 Instruction *InsertPt = U;
960 if (StoreInst *SI = dyn_cast<StoreInst>(U)) {
961 // If this is the store of the allocation into the global, remove it.
962 if (SI->getOperand(1) == GV) {
963 SI->eraseFromParent();
966 } else if (PHINode *PN = dyn_cast<PHINode>(U)) {
967 // Insert the load in the corresponding predecessor, not right before the
969 unsigned PredNo = Alloc->use_begin().getOperandNo()/2;
970 InsertPt = PN->getIncomingBlock(PredNo)->getTerminator();
973 // Insert a load from the global, and use it instead of the malloc.
974 Value *NL = new LoadInst(GV, GV->getName()+".val", InsertPt);
975 U->replaceUsesOfWith(Alloc, NL);
979 /// GlobalLoadUsesSimpleEnoughForHeapSRA - If all users of values loaded from
980 /// GV are simple enough to perform HeapSRA, return true.
981 static bool GlobalLoadUsesSimpleEnoughForHeapSRA(GlobalVariable *GV,
983 for (Value::use_iterator UI = GV->use_begin(), E = GV->use_end(); UI != E;
985 if (LoadInst *LI = dyn_cast<LoadInst>(*UI)) {
986 // We permit two users of the load: setcc comparing against the null
987 // pointer, and a getelementptr of a specific form.
988 for (Value::use_iterator UI = LI->use_begin(), E = LI->use_end();
990 // Comparison against null is ok.
991 if (ICmpInst *ICI = dyn_cast<ICmpInst>(*UI)) {
992 if (!isa<ConstantPointerNull>(ICI->getOperand(1)))
997 // getelementptr is also ok, but only a simple form.
998 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(*UI)) {
999 // Must index into the array and into the struct.
1000 if (GEPI->getNumOperands() < 3)
1003 // Otherwise the GEP is ok.
1007 if (PHINode *PN = dyn_cast<PHINode>(*UI)) {
1008 // We have a phi of a load from the global. We can only handle this
1009 // if the other PHI'd values are actually the same. In this case,
1010 // the rewriter will just drop the phi entirely.
1011 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
1012 Value *IV = PN->getIncomingValue(i);
1013 if (IV == LI) continue; // Trivial the same.
1015 // If the phi'd value is from the malloc that initializes the value,
1017 if (IV == MI) continue;
1019 // Otherwise, we don't know what it is.
1025 // Otherwise we don't know what this is, not ok.
1032 /// GetHeapSROALoad - Return the load for the specified field of the HeapSROA'd
1033 /// value, lazily creating it on demand.
1034 static Value *GetHeapSROALoad(Instruction *Load, unsigned FieldNo,
1035 const std::vector<GlobalVariable*> &FieldGlobals,
1036 std::vector<Value *> &InsertedLoadsForPtr) {
1037 if (InsertedLoadsForPtr.size() <= FieldNo)
1038 InsertedLoadsForPtr.resize(FieldNo+1);
1039 if (InsertedLoadsForPtr[FieldNo] == 0)
1040 InsertedLoadsForPtr[FieldNo] = new LoadInst(FieldGlobals[FieldNo],
1041 Load->getName()+".f" +
1042 utostr(FieldNo), Load);
1043 return InsertedLoadsForPtr[FieldNo];
1046 /// RewriteHeapSROALoadUser - Given a load instruction and a value derived from
1047 /// the load, rewrite the derived value to use the HeapSRoA'd load.
1048 static void RewriteHeapSROALoadUser(LoadInst *Load, Instruction *LoadUser,
1049 const std::vector<GlobalVariable*> &FieldGlobals,
1050 std::vector<Value *> &InsertedLoadsForPtr) {
1051 // If this is a comparison against null, handle it.
1052 if (ICmpInst *SCI = dyn_cast<ICmpInst>(LoadUser)) {
1053 assert(isa<ConstantPointerNull>(SCI->getOperand(1)));
1054 // If we have a setcc of the loaded pointer, we can use a setcc of any
1057 if (InsertedLoadsForPtr.empty()) {
1058 NPtr = GetHeapSROALoad(Load, 0, FieldGlobals, InsertedLoadsForPtr);
1060 NPtr = InsertedLoadsForPtr.back();
1063 Value *New = new ICmpInst(SCI->getPredicate(), NPtr,
1064 Constant::getNullValue(NPtr->getType()),
1065 SCI->getName(), SCI);
1066 SCI->replaceAllUsesWith(New);
1067 SCI->eraseFromParent();
1071 // Handle 'getelementptr Ptr, Idx, uint FieldNo ...'
1072 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(LoadUser)) {
1073 assert(GEPI->getNumOperands() >= 3 && isa<ConstantInt>(GEPI->getOperand(2))
1074 && "Unexpected GEPI!");
1076 // Load the pointer for this field.
1077 unsigned FieldNo = cast<ConstantInt>(GEPI->getOperand(2))->getZExtValue();
1078 Value *NewPtr = GetHeapSROALoad(Load, FieldNo,
1079 FieldGlobals, InsertedLoadsForPtr);
1081 // Create the new GEP idx vector.
1082 SmallVector<Value*, 8> GEPIdx;
1083 GEPIdx.push_back(GEPI->getOperand(1));
1084 GEPIdx.append(GEPI->op_begin()+3, GEPI->op_end());
1086 Value *NGEPI = GetElementPtrInst::Create(NewPtr,
1087 GEPIdx.begin(), GEPIdx.end(),
1088 GEPI->getName(), GEPI);
1089 GEPI->replaceAllUsesWith(NGEPI);
1090 GEPI->eraseFromParent();
1094 // Handle PHI nodes. PHI nodes must be merging in the same values, plus
1095 // potentially the original malloc. Insert phi nodes for each field, then
1096 // process uses of the PHI.
1097 PHINode *PN = cast<PHINode>(LoadUser);
1098 std::vector<Value *> PHIsForField;
1099 PHIsForField.resize(FieldGlobals.size());
1100 for (unsigned i = 0, e = FieldGlobals.size(); i != e; ++i) {
1101 Value *LoadV = GetHeapSROALoad(Load, i, FieldGlobals, InsertedLoadsForPtr);
1103 PHINode *FieldPN = PHINode::Create(LoadV->getType(),
1104 PN->getName()+"."+utostr(i), PN);
1105 // Fill in the predecessor values.
1106 for (unsigned pred = 0, e = PN->getNumIncomingValues(); pred != e; ++pred) {
1107 // Each predecessor either uses the load or the original malloc.
1108 Value *InVal = PN->getIncomingValue(pred);
1109 BasicBlock *BB = PN->getIncomingBlock(pred);
1111 if (isa<MallocInst>(InVal)) {
1112 // Insert a reload from the global in the predecessor.
1113 NewVal = GetHeapSROALoad(BB->getTerminator(), i, FieldGlobals,
1116 NewVal = InsertedLoadsForPtr[i];
1118 FieldPN->addIncoming(NewVal, BB);
1120 PHIsForField[i] = FieldPN;
1123 // Since PHIsForField specifies a phi for every input value, the lazy inserter
1124 // will never insert a load.
1125 while (!PN->use_empty())
1126 RewriteHeapSROALoadUser(Load, PN->use_back(), FieldGlobals, PHIsForField);
1127 PN->eraseFromParent();
1130 /// RewriteUsesOfLoadForHeapSRoA - We are performing Heap SRoA on a global. Ptr
1131 /// is a value loaded from the global. Eliminate all uses of Ptr, making them
1132 /// use FieldGlobals instead. All uses of loaded values satisfy
1133 /// GlobalLoadUsesSimpleEnoughForHeapSRA.
1134 static void RewriteUsesOfLoadForHeapSRoA(LoadInst *Load,
1135 const std::vector<GlobalVariable*> &FieldGlobals) {
1136 std::vector<Value *> InsertedLoadsForPtr;
1137 //InsertedLoadsForPtr.resize(FieldGlobals.size());
1138 while (!Load->use_empty())
1139 RewriteHeapSROALoadUser(Load, Load->use_back(),
1140 FieldGlobals, InsertedLoadsForPtr);
1143 /// PerformHeapAllocSRoA - MI is an allocation of an array of structures. Break
1144 /// it up into multiple allocations of arrays of the fields.
1145 static GlobalVariable *PerformHeapAllocSRoA(GlobalVariable *GV, MallocInst *MI){
1146 DOUT << "SROA HEAP ALLOC: " << *GV << " MALLOC = " << *MI;
1147 const StructType *STy = cast<StructType>(MI->getAllocatedType());
1149 // There is guaranteed to be at least one use of the malloc (storing
1150 // it into GV). If there are other uses, change them to be uses of
1151 // the global to simplify later code. This also deletes the store
1153 ReplaceUsesOfMallocWithGlobal(MI, GV);
1155 // Okay, at this point, there are no users of the malloc. Insert N
1156 // new mallocs at the same place as MI, and N globals.
1157 std::vector<GlobalVariable*> FieldGlobals;
1158 std::vector<MallocInst*> FieldMallocs;
1160 for (unsigned FieldNo = 0, e = STy->getNumElements(); FieldNo != e;++FieldNo){
1161 const Type *FieldTy = STy->getElementType(FieldNo);
1162 const Type *PFieldTy = PointerType::getUnqual(FieldTy);
1164 GlobalVariable *NGV =
1165 new GlobalVariable(PFieldTy, false, GlobalValue::InternalLinkage,
1166 Constant::getNullValue(PFieldTy),
1167 GV->getName() + ".f" + utostr(FieldNo), GV,
1168 GV->isThreadLocal());
1169 FieldGlobals.push_back(NGV);
1171 MallocInst *NMI = new MallocInst(FieldTy, MI->getArraySize(),
1172 MI->getName() + ".f" + utostr(FieldNo),MI);
1173 FieldMallocs.push_back(NMI);
1174 new StoreInst(NMI, NGV, MI);
1177 // The tricky aspect of this transformation is handling the case when malloc
1178 // fails. In the original code, malloc failing would set the result pointer
1179 // of malloc to null. In this case, some mallocs could succeed and others
1180 // could fail. As such, we emit code that looks like this:
1181 // F0 = malloc(field0)
1182 // F1 = malloc(field1)
1183 // F2 = malloc(field2)
1184 // if (F0 == 0 || F1 == 0 || F2 == 0) {
1185 // if (F0) { free(F0); F0 = 0; }
1186 // if (F1) { free(F1); F1 = 0; }
1187 // if (F2) { free(F2); F2 = 0; }
1189 Value *RunningOr = 0;
1190 for (unsigned i = 0, e = FieldMallocs.size(); i != e; ++i) {
1191 Value *Cond = new ICmpInst(ICmpInst::ICMP_EQ, FieldMallocs[i],
1192 Constant::getNullValue(FieldMallocs[i]->getType()),
1195 RunningOr = Cond; // First seteq
1197 RunningOr = BinaryOperator::CreateOr(RunningOr, Cond, "tmp", MI);
1200 // Split the basic block at the old malloc.
1201 BasicBlock *OrigBB = MI->getParent();
1202 BasicBlock *ContBB = OrigBB->splitBasicBlock(MI, "malloc_cont");
1204 // Create the block to check the first condition. Put all these blocks at the
1205 // end of the function as they are unlikely to be executed.
1206 BasicBlock *NullPtrBlock = BasicBlock::Create("malloc_ret_null",
1207 OrigBB->getParent());
1209 // Remove the uncond branch from OrigBB to ContBB, turning it into a cond
1210 // branch on RunningOr.
1211 OrigBB->getTerminator()->eraseFromParent();
1212 BranchInst::Create(NullPtrBlock, ContBB, RunningOr, OrigBB);
1214 // Within the NullPtrBlock, we need to emit a comparison and branch for each
1215 // pointer, because some may be null while others are not.
1216 for (unsigned i = 0, e = FieldGlobals.size(); i != e; ++i) {
1217 Value *GVVal = new LoadInst(FieldGlobals[i], "tmp", NullPtrBlock);
1218 Value *Cmp = new ICmpInst(ICmpInst::ICMP_NE, GVVal,
1219 Constant::getNullValue(GVVal->getType()),
1220 "tmp", NullPtrBlock);
1221 BasicBlock *FreeBlock = BasicBlock::Create("free_it", OrigBB->getParent());
1222 BasicBlock *NextBlock = BasicBlock::Create("next", OrigBB->getParent());
1223 BranchInst::Create(FreeBlock, NextBlock, Cmp, NullPtrBlock);
1225 // Fill in FreeBlock.
1226 new FreeInst(GVVal, FreeBlock);
1227 new StoreInst(Constant::getNullValue(GVVal->getType()), FieldGlobals[i],
1229 BranchInst::Create(NextBlock, FreeBlock);
1231 NullPtrBlock = NextBlock;
1234 BranchInst::Create(ContBB, NullPtrBlock);
1236 // MI is no longer needed, remove it.
1237 MI->eraseFromParent();
1240 // Okay, the malloc site is completely handled. All of the uses of GV are now
1241 // loads, and all uses of those loads are simple. Rewrite them to use loads
1242 // of the per-field globals instead.
1243 while (!GV->use_empty()) {
1244 if (LoadInst *LI = dyn_cast<LoadInst>(GV->use_back())) {
1245 RewriteUsesOfLoadForHeapSRoA(LI, FieldGlobals);
1246 LI->eraseFromParent();
1248 // Must be a store of null.
1249 StoreInst *SI = cast<StoreInst>(GV->use_back());
1250 assert(isa<Constant>(SI->getOperand(0)) &&
1251 cast<Constant>(SI->getOperand(0))->isNullValue() &&
1252 "Unexpected heap-sra user!");
1254 // Insert a store of null into each global.
1255 for (unsigned i = 0, e = FieldGlobals.size(); i != e; ++i) {
1257 Constant::getNullValue(FieldGlobals[i]->getType()->getElementType());
1258 new StoreInst(Null, FieldGlobals[i], SI);
1260 // Erase the original store.
1261 SI->eraseFromParent();
1265 // The old global is now dead, remove it.
1266 GV->eraseFromParent();
1269 return FieldGlobals[0];
1273 // OptimizeOnceStoredGlobal - Try to optimize globals based on the knowledge
1274 // that only one value (besides its initializer) is ever stored to the global.
1275 static bool OptimizeOnceStoredGlobal(GlobalVariable *GV, Value *StoredOnceVal,
1276 Module::global_iterator &GVI,
1278 if (CastInst *CI = dyn_cast<CastInst>(StoredOnceVal))
1279 StoredOnceVal = CI->getOperand(0);
1280 else if (GetElementPtrInst *GEPI =dyn_cast<GetElementPtrInst>(StoredOnceVal)){
1281 // "getelementptr Ptr, 0, 0, 0" is really just a cast.
1282 bool IsJustACast = true;
1283 for (User::op_iterator i = GEPI->op_begin() + 1, e = GEPI->op_end();
1285 if (!isa<Constant>(*i) ||
1286 !cast<Constant>(*i)->isNullValue()) {
1287 IsJustACast = false;
1291 StoredOnceVal = GEPI->getOperand(0);
1294 // If we are dealing with a pointer global that is initialized to null and
1295 // only has one (non-null) value stored into it, then we can optimize any
1296 // users of the loaded value (often calls and loads) that would trap if the
1298 if (isa<PointerType>(GV->getInitializer()->getType()) &&
1299 GV->getInitializer()->isNullValue()) {
1300 if (Constant *SOVC = dyn_cast<Constant>(StoredOnceVal)) {
1301 if (GV->getInitializer()->getType() != SOVC->getType())
1302 SOVC = ConstantExpr::getBitCast(SOVC, GV->getInitializer()->getType());
1304 // Optimize away any trapping uses of the loaded value.
1305 if (OptimizeAwayTrappingUsesOfLoads(GV, SOVC))
1307 } else if (MallocInst *MI = dyn_cast<MallocInst>(StoredOnceVal)) {
1308 // If this is a malloc of an abstract type, don't touch it.
1309 if (!MI->getAllocatedType()->isSized())
1312 // We can't optimize this global unless all uses of it are *known* to be
1313 // of the malloc value, not of the null initializer value (consider a use
1314 // that compares the global's value against zero to see if the malloc has
1315 // been reached). To do this, we check to see if all uses of the global
1316 // would trap if the global were null: this proves that they must all
1317 // happen after the malloc.
1318 if (!AllUsesOfLoadedValueWillTrapIfNull(GV))
1321 // We can't optimize this if the malloc itself is used in a complex way,
1322 // for example, being stored into multiple globals. This allows the
1323 // malloc to be stored into the specified global, loaded setcc'd, and
1324 // GEP'd. These are all things we could transform to using the global
1327 SmallPtrSet<PHINode*, 8> PHIs;
1328 if (!ValueIsOnlyUsedLocallyOrStoredToOneGlobal(MI, GV, PHIs))
1333 // If we have a global that is only initialized with a fixed size malloc,
1334 // transform the program to use global memory instead of malloc'd memory.
1335 // This eliminates dynamic allocation, avoids an indirection accessing the
1336 // data, and exposes the resultant global to further GlobalOpt.
1337 if (ConstantInt *NElements = dyn_cast<ConstantInt>(MI->getArraySize())) {
1338 // Restrict this transformation to only working on small allocations
1339 // (2048 bytes currently), as we don't want to introduce a 16M global or
1341 if (NElements->getZExtValue()*
1342 TD.getABITypeSize(MI->getAllocatedType()) < 2048) {
1343 GVI = OptimizeGlobalAddressOfMalloc(GV, MI);
1348 // If the allocation is an array of structures, consider transforming this
1349 // into multiple malloc'd arrays, one for each field. This is basically
1350 // SRoA for malloc'd memory.
1351 if (const StructType *AllocTy =
1352 dyn_cast<StructType>(MI->getAllocatedType())) {
1353 // This the structure has an unreasonable number of fields, leave it
1355 if (AllocTy->getNumElements() <= 16 && AllocTy->getNumElements() > 0 &&
1356 GlobalLoadUsesSimpleEnoughForHeapSRA(GV, MI)) {
1357 GVI = PerformHeapAllocSRoA(GV, MI);
1367 /// TryToShrinkGlobalToBoolean - At this point, we have learned that the only
1368 /// two values ever stored into GV are its initializer and OtherVal. See if we
1369 /// can shrink the global into a boolean and select between the two values
1370 /// whenever it is used. This exposes the values to other scalar optimizations.
1371 static bool TryToShrinkGlobalToBoolean(GlobalVariable *GV, Constant *OtherVal) {
1372 const Type *GVElType = GV->getType()->getElementType();
1374 // If GVElType is already i1, it is already shrunk. If the type of the GV is
1375 // an FP value or vector, don't do this optimization because a select between
1376 // them is very expensive and unlikely to lead to later simplification.
1377 if (GVElType == Type::Int1Ty || GVElType->isFloatingPoint() ||
1378 isa<VectorType>(GVElType))
1381 // Walk the use list of the global seeing if all the uses are load or store.
1382 // If there is anything else, bail out.
1383 for (Value::use_iterator I = GV->use_begin(), E = GV->use_end(); I != E; ++I)
1384 if (!isa<LoadInst>(I) && !isa<StoreInst>(I))
1387 DOUT << " *** SHRINKING TO BOOL: " << *GV;
1389 // Create the new global, initializing it to false.
1390 GlobalVariable *NewGV = new GlobalVariable(Type::Int1Ty, false,
1391 GlobalValue::InternalLinkage, ConstantInt::getFalse(),
1394 GV->isThreadLocal());
1395 GV->getParent()->getGlobalList().insert(GV, NewGV);
1397 Constant *InitVal = GV->getInitializer();
1398 assert(InitVal->getType() != Type::Int1Ty && "No reason to shrink to bool!");
1400 // If initialized to zero and storing one into the global, we can use a cast
1401 // instead of a select to synthesize the desired value.
1402 bool IsOneZero = false;
1403 if (ConstantInt *CI = dyn_cast<ConstantInt>(OtherVal))
1404 IsOneZero = InitVal->isNullValue() && CI->isOne();
1406 while (!GV->use_empty()) {
1407 Instruction *UI = cast<Instruction>(GV->use_back());
1408 if (StoreInst *SI = dyn_cast<StoreInst>(UI)) {
1409 // Change the store into a boolean store.
1410 bool StoringOther = SI->getOperand(0) == OtherVal;
1411 // Only do this if we weren't storing a loaded value.
1413 if (StoringOther || SI->getOperand(0) == InitVal)
1414 StoreVal = ConstantInt::get(Type::Int1Ty, StoringOther);
1416 // Otherwise, we are storing a previously loaded copy. To do this,
1417 // change the copy from copying the original value to just copying the
1419 Instruction *StoredVal = cast<Instruction>(SI->getOperand(0));
1421 // If we're already replaced the input, StoredVal will be a cast or
1422 // select instruction. If not, it will be a load of the original
1424 if (LoadInst *LI = dyn_cast<LoadInst>(StoredVal)) {
1425 assert(LI->getOperand(0) == GV && "Not a copy!");
1426 // Insert a new load, to preserve the saved value.
1427 StoreVal = new LoadInst(NewGV, LI->getName()+".b", LI);
1429 assert((isa<CastInst>(StoredVal) || isa<SelectInst>(StoredVal)) &&
1430 "This is not a form that we understand!");
1431 StoreVal = StoredVal->getOperand(0);
1432 assert(isa<LoadInst>(StoreVal) && "Not a load of NewGV!");
1435 new StoreInst(StoreVal, NewGV, SI);
1437 // Change the load into a load of bool then a select.
1438 LoadInst *LI = cast<LoadInst>(UI);
1439 LoadInst *NLI = new LoadInst(NewGV, LI->getName()+".b", LI);
1442 NSI = new ZExtInst(NLI, LI->getType(), "", LI);
1444 NSI = SelectInst::Create(NLI, OtherVal, InitVal, "", LI);
1446 LI->replaceAllUsesWith(NSI);
1448 UI->eraseFromParent();
1451 GV->eraseFromParent();
1456 /// ProcessInternalGlobal - Analyze the specified global variable and optimize
1457 /// it if possible. If we make a change, return true.
1458 bool GlobalOpt::ProcessInternalGlobal(GlobalVariable *GV,
1459 Module::global_iterator &GVI) {
1460 std::set<PHINode*> PHIUsers;
1462 GV->removeDeadConstantUsers();
1464 if (GV->use_empty()) {
1465 DOUT << "GLOBAL DEAD: " << *GV;
1466 GV->eraseFromParent();
1471 if (!AnalyzeGlobal(GV, GS, PHIUsers)) {
1473 cerr << "Global: " << *GV;
1474 cerr << " isLoaded = " << GS.isLoaded << "\n";
1475 cerr << " StoredType = ";
1476 switch (GS.StoredType) {
1477 case GlobalStatus::NotStored: cerr << "NEVER STORED\n"; break;
1478 case GlobalStatus::isInitializerStored: cerr << "INIT STORED\n"; break;
1479 case GlobalStatus::isStoredOnce: cerr << "STORED ONCE\n"; break;
1480 case GlobalStatus::isStored: cerr << "stored\n"; break;
1482 if (GS.StoredType == GlobalStatus::isStoredOnce && GS.StoredOnceValue)
1483 cerr << " StoredOnceValue = " << *GS.StoredOnceValue << "\n";
1484 if (GS.AccessingFunction && !GS.HasMultipleAccessingFunctions)
1485 cerr << " AccessingFunction = " << GS.AccessingFunction->getName()
1487 cerr << " HasMultipleAccessingFunctions = "
1488 << GS.HasMultipleAccessingFunctions << "\n";
1489 cerr << " HasNonInstructionUser = " << GS.HasNonInstructionUser<<"\n";
1493 // If this is a first class global and has only one accessing function
1494 // and this function is main (which we know is not recursive we can make
1495 // this global a local variable) we replace the global with a local alloca
1496 // in this function.
1498 // NOTE: It doesn't make sense to promote non single-value types since we
1499 // are just replacing static memory to stack memory.
1500 if (!GS.HasMultipleAccessingFunctions &&
1501 GS.AccessingFunction && !GS.HasNonInstructionUser &&
1502 GV->getType()->getElementType()->isSingleValueType() &&
1503 GS.AccessingFunction->getName() == "main" &&
1504 GS.AccessingFunction->hasExternalLinkage()) {
1505 DOUT << "LOCALIZING GLOBAL: " << *GV;
1506 Instruction* FirstI = GS.AccessingFunction->getEntryBlock().begin();
1507 const Type* ElemTy = GV->getType()->getElementType();
1508 // FIXME: Pass Global's alignment when globals have alignment
1509 AllocaInst* Alloca = new AllocaInst(ElemTy, NULL, GV->getName(), FirstI);
1510 if (!isa<UndefValue>(GV->getInitializer()))
1511 new StoreInst(GV->getInitializer(), Alloca, FirstI);
1513 GV->replaceAllUsesWith(Alloca);
1514 GV->eraseFromParent();
1519 // If the global is never loaded (but may be stored to), it is dead.
1522 DOUT << "GLOBAL NEVER LOADED: " << *GV;
1524 // Delete any stores we can find to the global. We may not be able to
1525 // make it completely dead though.
1526 bool Changed = CleanupConstantGlobalUsers(GV, GV->getInitializer());
1528 // If the global is dead now, delete it.
1529 if (GV->use_empty()) {
1530 GV->eraseFromParent();
1536 } else if (GS.StoredType <= GlobalStatus::isInitializerStored) {
1537 DOUT << "MARKING CONSTANT: " << *GV;
1538 GV->setConstant(true);
1540 // Clean up any obviously simplifiable users now.
1541 CleanupConstantGlobalUsers(GV, GV->getInitializer());
1543 // If the global is dead now, just nuke it.
1544 if (GV->use_empty()) {
1545 DOUT << " *** Marking constant allowed us to simplify "
1546 << "all users and delete global!\n";
1547 GV->eraseFromParent();
1553 } else if (!GV->getInitializer()->getType()->isSingleValueType()) {
1554 if (GlobalVariable *FirstNewGV = SRAGlobal(GV,
1555 getAnalysis<TargetData>())) {
1556 GVI = FirstNewGV; // Don't skip the newly produced globals!
1559 } else if (GS.StoredType == GlobalStatus::isStoredOnce) {
1560 // If the initial value for the global was an undef value, and if only
1561 // one other value was stored into it, we can just change the
1562 // initializer to be an undef value, then delete all stores to the
1563 // global. This allows us to mark it constant.
1564 if (Constant *SOVConstant = dyn_cast<Constant>(GS.StoredOnceValue))
1565 if (isa<UndefValue>(GV->getInitializer())) {
1566 // Change the initial value here.
1567 GV->setInitializer(SOVConstant);
1569 // Clean up any obviously simplifiable users now.
1570 CleanupConstantGlobalUsers(GV, GV->getInitializer());
1572 if (GV->use_empty()) {
1573 DOUT << " *** Substituting initializer allowed us to "
1574 << "simplify all users and delete global!\n";
1575 GV->eraseFromParent();
1584 // Try to optimize globals based on the knowledge that only one value
1585 // (besides its initializer) is ever stored to the global.
1586 if (OptimizeOnceStoredGlobal(GV, GS.StoredOnceValue, GVI,
1587 getAnalysis<TargetData>()))
1590 // Otherwise, if the global was not a boolean, we can shrink it to be a
1592 if (Constant *SOVConstant = dyn_cast<Constant>(GS.StoredOnceValue))
1593 if (TryToShrinkGlobalToBoolean(GV, SOVConstant)) {
1602 /// OnlyCalledDirectly - Return true if the specified function is only called
1603 /// directly. In other words, its address is never taken.
1604 static bool OnlyCalledDirectly(Function *F) {
1605 for (Value::use_iterator UI = F->use_begin(), E = F->use_end(); UI != E;++UI){
1606 Instruction *User = dyn_cast<Instruction>(*UI);
1607 if (!User) return false;
1608 if (!isa<CallInst>(User) && !isa<InvokeInst>(User)) return false;
1610 // See if the function address is passed as an argument.
1611 for (User::op_iterator i = User->op_begin() + 1, e = User->op_end();
1613 if (*i == F) return false;
1618 /// ChangeCalleesToFastCall - Walk all of the direct calls of the specified
1619 /// function, changing them to FastCC.
1620 static void ChangeCalleesToFastCall(Function *F) {
1621 for (Value::use_iterator UI = F->use_begin(), E = F->use_end(); UI != E;++UI){
1622 CallSite User(cast<Instruction>(*UI));
1623 User.setCallingConv(CallingConv::Fast);
1627 static PAListPtr StripNest(const PAListPtr &Attrs) {
1628 for (unsigned i = 0, e = Attrs.getNumSlots(); i != e; ++i) {
1629 if ((Attrs.getSlot(i).Attrs & ParamAttr::Nest) == 0)
1632 // There can be only one.
1633 return Attrs.removeAttr(Attrs.getSlot(i).Index, ParamAttr::Nest);
1639 static void RemoveNestAttribute(Function *F) {
1640 F->setParamAttrs(StripNest(F->getParamAttrs()));
1641 for (Value::use_iterator UI = F->use_begin(), E = F->use_end(); UI != E;++UI){
1642 CallSite User(cast<Instruction>(*UI));
1643 User.setParamAttrs(StripNest(User.getParamAttrs()));
1647 bool GlobalOpt::OptimizeFunctions(Module &M) {
1648 bool Changed = false;
1649 // Optimize functions.
1650 for (Module::iterator FI = M.begin(), E = M.end(); FI != E; ) {
1652 F->removeDeadConstantUsers();
1653 if (F->use_empty() && (F->hasInternalLinkage() ||
1654 F->hasLinkOnceLinkage())) {
1655 M.getFunctionList().erase(F);
1658 } else if (F->hasInternalLinkage()) {
1659 if (F->getCallingConv() == CallingConv::C && !F->isVarArg() &&
1660 OnlyCalledDirectly(F)) {
1661 // If this function has C calling conventions, is not a varargs
1662 // function, and is only called directly, promote it to use the Fast
1663 // calling convention.
1664 F->setCallingConv(CallingConv::Fast);
1665 ChangeCalleesToFastCall(F);
1670 if (F->getParamAttrs().hasAttrSomewhere(ParamAttr::Nest) &&
1671 OnlyCalledDirectly(F)) {
1672 // The function is not used by a trampoline intrinsic, so it is safe
1673 // to remove the 'nest' attribute.
1674 RemoveNestAttribute(F);
1683 bool GlobalOpt::OptimizeGlobalVars(Module &M) {
1684 bool Changed = false;
1685 for (Module::global_iterator GVI = M.global_begin(), E = M.global_end();
1687 GlobalVariable *GV = GVI++;
1688 if (!GV->isConstant() && GV->hasInternalLinkage() &&
1689 GV->hasInitializer())
1690 Changed |= ProcessInternalGlobal(GV, GVI);
1695 /// FindGlobalCtors - Find the llvm.globalctors list, verifying that all
1696 /// initializers have an init priority of 65535.
1697 GlobalVariable *GlobalOpt::FindGlobalCtors(Module &M) {
1698 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
1700 if (I->getName() == "llvm.global_ctors") {
1701 // Found it, verify it's an array of { int, void()* }.
1702 const ArrayType *ATy =dyn_cast<ArrayType>(I->getType()->getElementType());
1704 const StructType *STy = dyn_cast<StructType>(ATy->getElementType());
1705 if (!STy || STy->getNumElements() != 2 ||
1706 STy->getElementType(0) != Type::Int32Ty) return 0;
1707 const PointerType *PFTy = dyn_cast<PointerType>(STy->getElementType(1));
1708 if (!PFTy) return 0;
1709 const FunctionType *FTy = dyn_cast<FunctionType>(PFTy->getElementType());
1710 if (!FTy || FTy->getReturnType() != Type::VoidTy || FTy->isVarArg() ||
1711 FTy->getNumParams() != 0)
1714 // Verify that the initializer is simple enough for us to handle.
1715 if (!I->hasInitializer()) return 0;
1716 ConstantArray *CA = dyn_cast<ConstantArray>(I->getInitializer());
1718 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i)
1719 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(*i)) {
1720 if (isa<ConstantPointerNull>(CS->getOperand(1)))
1723 // Must have a function or null ptr.
1724 if (!isa<Function>(CS->getOperand(1)))
1727 // Init priority must be standard.
1728 ConstantInt *CI = dyn_cast<ConstantInt>(CS->getOperand(0));
1729 if (!CI || CI->getZExtValue() != 65535)
1740 /// ParseGlobalCtors - Given a llvm.global_ctors list that we can understand,
1741 /// return a list of the functions and null terminator as a vector.
1742 static std::vector<Function*> ParseGlobalCtors(GlobalVariable *GV) {
1743 ConstantArray *CA = cast<ConstantArray>(GV->getInitializer());
1744 std::vector<Function*> Result;
1745 Result.reserve(CA->getNumOperands());
1746 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i) {
1747 ConstantStruct *CS = cast<ConstantStruct>(*i);
1748 Result.push_back(dyn_cast<Function>(CS->getOperand(1)));
1753 /// InstallGlobalCtors - Given a specified llvm.global_ctors list, install the
1754 /// specified array, returning the new global to use.
1755 static GlobalVariable *InstallGlobalCtors(GlobalVariable *GCL,
1756 const std::vector<Function*> &Ctors) {
1757 // If we made a change, reassemble the initializer list.
1758 std::vector<Constant*> CSVals;
1759 CSVals.push_back(ConstantInt::get(Type::Int32Ty, 65535));
1760 CSVals.push_back(0);
1762 // Create the new init list.
1763 std::vector<Constant*> CAList;
1764 for (unsigned i = 0, e = Ctors.size(); i != e; ++i) {
1766 CSVals[1] = Ctors[i];
1768 const Type *FTy = FunctionType::get(Type::VoidTy,
1769 std::vector<const Type*>(), false);
1770 const PointerType *PFTy = PointerType::getUnqual(FTy);
1771 CSVals[1] = Constant::getNullValue(PFTy);
1772 CSVals[0] = ConstantInt::get(Type::Int32Ty, 2147483647);
1774 CAList.push_back(ConstantStruct::get(CSVals));
1777 // Create the array initializer.
1778 const Type *StructTy =
1779 cast<ArrayType>(GCL->getType()->getElementType())->getElementType();
1780 Constant *CA = ConstantArray::get(ArrayType::get(StructTy, CAList.size()),
1783 // If we didn't change the number of elements, don't create a new GV.
1784 if (CA->getType() == GCL->getInitializer()->getType()) {
1785 GCL->setInitializer(CA);
1789 // Create the new global and insert it next to the existing list.
1790 GlobalVariable *NGV = new GlobalVariable(CA->getType(), GCL->isConstant(),
1791 GCL->getLinkage(), CA, "",
1793 GCL->isThreadLocal());
1794 GCL->getParent()->getGlobalList().insert(GCL, NGV);
1797 // Nuke the old list, replacing any uses with the new one.
1798 if (!GCL->use_empty()) {
1800 if (V->getType() != GCL->getType())
1801 V = ConstantExpr::getBitCast(V, GCL->getType());
1802 GCL->replaceAllUsesWith(V);
1804 GCL->eraseFromParent();
1813 static Constant *getVal(std::map<Value*, Constant*> &ComputedValues,
1815 if (Constant *CV = dyn_cast<Constant>(V)) return CV;
1816 Constant *R = ComputedValues[V];
1817 assert(R && "Reference to an uncomputed value!");
1821 /// isSimpleEnoughPointerToCommit - Return true if this constant is simple
1822 /// enough for us to understand. In particular, if it is a cast of something,
1823 /// we punt. We basically just support direct accesses to globals and GEP's of
1824 /// globals. This should be kept up to date with CommitValueTo.
1825 static bool isSimpleEnoughPointerToCommit(Constant *C) {
1826 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(C)) {
1827 if (!GV->hasExternalLinkage() && !GV->hasInternalLinkage())
1828 return false; // do not allow weak/linkonce/dllimport/dllexport linkage.
1829 return !GV->isDeclaration(); // reject external globals.
1831 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C))
1832 // Handle a constantexpr gep.
1833 if (CE->getOpcode() == Instruction::GetElementPtr &&
1834 isa<GlobalVariable>(CE->getOperand(0))) {
1835 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
1836 if (!GV->hasExternalLinkage() && !GV->hasInternalLinkage())
1837 return false; // do not allow weak/linkonce/dllimport/dllexport linkage.
1838 return GV->hasInitializer() &&
1839 ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE);
1844 /// EvaluateStoreInto - Evaluate a piece of a constantexpr store into a global
1845 /// initializer. This returns 'Init' modified to reflect 'Val' stored into it.
1846 /// At this point, the GEP operands of Addr [0, OpNo) have been stepped into.
1847 static Constant *EvaluateStoreInto(Constant *Init, Constant *Val,
1848 ConstantExpr *Addr, unsigned OpNo) {
1849 // Base case of the recursion.
1850 if (OpNo == Addr->getNumOperands()) {
1851 assert(Val->getType() == Init->getType() && "Type mismatch!");
1855 if (const StructType *STy = dyn_cast<StructType>(Init->getType())) {
1856 std::vector<Constant*> Elts;
1858 // Break up the constant into its elements.
1859 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(Init)) {
1860 for (User::op_iterator i = CS->op_begin(), e = CS->op_end(); i != e; ++i)
1861 Elts.push_back(cast<Constant>(*i));
1862 } else if (isa<ConstantAggregateZero>(Init)) {
1863 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
1864 Elts.push_back(Constant::getNullValue(STy->getElementType(i)));
1865 } else if (isa<UndefValue>(Init)) {
1866 for (unsigned i = 0, e = STy->getNumElements(); i != e; ++i)
1867 Elts.push_back(UndefValue::get(STy->getElementType(i)));
1869 assert(0 && "This code is out of sync with "
1870 " ConstantFoldLoadThroughGEPConstantExpr");
1873 // Replace the element that we are supposed to.
1874 ConstantInt *CU = cast<ConstantInt>(Addr->getOperand(OpNo));
1875 unsigned Idx = CU->getZExtValue();
1876 assert(Idx < STy->getNumElements() && "Struct index out of range!");
1877 Elts[Idx] = EvaluateStoreInto(Elts[Idx], Val, Addr, OpNo+1);
1879 // Return the modified struct.
1880 return ConstantStruct::get(&Elts[0], Elts.size(), STy->isPacked());
1882 ConstantInt *CI = cast<ConstantInt>(Addr->getOperand(OpNo));
1883 const ArrayType *ATy = cast<ArrayType>(Init->getType());
1885 // Break up the array into elements.
1886 std::vector<Constant*> Elts;
1887 if (ConstantArray *CA = dyn_cast<ConstantArray>(Init)) {
1888 for (User::op_iterator i = CA->op_begin(), e = CA->op_end(); i != e; ++i)
1889 Elts.push_back(cast<Constant>(*i));
1890 } else if (isa<ConstantAggregateZero>(Init)) {
1891 Constant *Elt = Constant::getNullValue(ATy->getElementType());
1892 Elts.assign(ATy->getNumElements(), Elt);
1893 } else if (isa<UndefValue>(Init)) {
1894 Constant *Elt = UndefValue::get(ATy->getElementType());
1895 Elts.assign(ATy->getNumElements(), Elt);
1897 assert(0 && "This code is out of sync with "
1898 " ConstantFoldLoadThroughGEPConstantExpr");
1901 assert(CI->getZExtValue() < ATy->getNumElements());
1902 Elts[CI->getZExtValue()] =
1903 EvaluateStoreInto(Elts[CI->getZExtValue()], Val, Addr, OpNo+1);
1904 return ConstantArray::get(ATy, Elts);
1908 /// CommitValueTo - We have decided that Addr (which satisfies the predicate
1909 /// isSimpleEnoughPointerToCommit) should get Val as its value. Make it happen.
1910 static void CommitValueTo(Constant *Val, Constant *Addr) {
1911 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Addr)) {
1912 assert(GV->hasInitializer());
1913 GV->setInitializer(Val);
1917 ConstantExpr *CE = cast<ConstantExpr>(Addr);
1918 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
1920 Constant *Init = GV->getInitializer();
1921 Init = EvaluateStoreInto(Init, Val, CE, 2);
1922 GV->setInitializer(Init);
1925 /// ComputeLoadResult - Return the value that would be computed by a load from
1926 /// P after the stores reflected by 'memory' have been performed. If we can't
1927 /// decide, return null.
1928 static Constant *ComputeLoadResult(Constant *P,
1929 const std::map<Constant*, Constant*> &Memory) {
1930 // If this memory location has been recently stored, use the stored value: it
1931 // is the most up-to-date.
1932 std::map<Constant*, Constant*>::const_iterator I = Memory.find(P);
1933 if (I != Memory.end()) return I->second;
1936 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(P)) {
1937 if (GV->hasInitializer())
1938 return GV->getInitializer();
1942 // Handle a constantexpr getelementptr.
1943 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(P))
1944 if (CE->getOpcode() == Instruction::GetElementPtr &&
1945 isa<GlobalVariable>(CE->getOperand(0))) {
1946 GlobalVariable *GV = cast<GlobalVariable>(CE->getOperand(0));
1947 if (GV->hasInitializer())
1948 return ConstantFoldLoadThroughGEPConstantExpr(GV->getInitializer(), CE);
1951 return 0; // don't know how to evaluate.
1954 /// EvaluateFunction - Evaluate a call to function F, returning true if
1955 /// successful, false if we can't evaluate it. ActualArgs contains the formal
1956 /// arguments for the function.
1957 static bool EvaluateFunction(Function *F, Constant *&RetVal,
1958 const std::vector<Constant*> &ActualArgs,
1959 std::vector<Function*> &CallStack,
1960 std::map<Constant*, Constant*> &MutatedMemory,
1961 std::vector<GlobalVariable*> &AllocaTmps) {
1962 // Check to see if this function is already executing (recursion). If so,
1963 // bail out. TODO: we might want to accept limited recursion.
1964 if (std::find(CallStack.begin(), CallStack.end(), F) != CallStack.end())
1967 CallStack.push_back(F);
1969 /// Values - As we compute SSA register values, we store their contents here.
1970 std::map<Value*, Constant*> Values;
1972 // Initialize arguments to the incoming values specified.
1974 for (Function::arg_iterator AI = F->arg_begin(), E = F->arg_end(); AI != E;
1976 Values[AI] = ActualArgs[ArgNo];
1978 /// ExecutedBlocks - We only handle non-looping, non-recursive code. As such,
1979 /// we can only evaluate any one basic block at most once. This set keeps
1980 /// track of what we have executed so we can detect recursive cases etc.
1981 std::set<BasicBlock*> ExecutedBlocks;
1983 // CurInst - The current instruction we're evaluating.
1984 BasicBlock::iterator CurInst = F->begin()->begin();
1986 // This is the main evaluation loop.
1988 Constant *InstResult = 0;
1990 if (StoreInst *SI = dyn_cast<StoreInst>(CurInst)) {
1991 if (SI->isVolatile()) return false; // no volatile accesses.
1992 Constant *Ptr = getVal(Values, SI->getOperand(1));
1993 if (!isSimpleEnoughPointerToCommit(Ptr))
1994 // If this is too complex for us to commit, reject it.
1996 Constant *Val = getVal(Values, SI->getOperand(0));
1997 MutatedMemory[Ptr] = Val;
1998 } else if (BinaryOperator *BO = dyn_cast<BinaryOperator>(CurInst)) {
1999 InstResult = ConstantExpr::get(BO->getOpcode(),
2000 getVal(Values, BO->getOperand(0)),
2001 getVal(Values, BO->getOperand(1)));
2002 } else if (CmpInst *CI = dyn_cast<CmpInst>(CurInst)) {
2003 InstResult = ConstantExpr::getCompare(CI->getPredicate(),
2004 getVal(Values, CI->getOperand(0)),
2005 getVal(Values, CI->getOperand(1)));
2006 } else if (CastInst *CI = dyn_cast<CastInst>(CurInst)) {
2007 InstResult = ConstantExpr::getCast(CI->getOpcode(),
2008 getVal(Values, CI->getOperand(0)),
2010 } else if (SelectInst *SI = dyn_cast<SelectInst>(CurInst)) {
2011 InstResult = ConstantExpr::getSelect(getVal(Values, SI->getOperand(0)),
2012 getVal(Values, SI->getOperand(1)),
2013 getVal(Values, SI->getOperand(2)));
2014 } else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(CurInst)) {
2015 Constant *P = getVal(Values, GEP->getOperand(0));
2016 SmallVector<Constant*, 8> GEPOps;
2017 for (User::op_iterator i = GEP->op_begin() + 1, e = GEP->op_end();
2019 GEPOps.push_back(getVal(Values, *i));
2020 InstResult = ConstantExpr::getGetElementPtr(P, &GEPOps[0], GEPOps.size());
2021 } else if (LoadInst *LI = dyn_cast<LoadInst>(CurInst)) {
2022 if (LI->isVolatile()) return false; // no volatile accesses.
2023 InstResult = ComputeLoadResult(getVal(Values, LI->getOperand(0)),
2025 if (InstResult == 0) return false; // Could not evaluate load.
2026 } else if (AllocaInst *AI = dyn_cast<AllocaInst>(CurInst)) {
2027 if (AI->isArrayAllocation()) return false; // Cannot handle array allocs.
2028 const Type *Ty = AI->getType()->getElementType();
2029 AllocaTmps.push_back(new GlobalVariable(Ty, false,
2030 GlobalValue::InternalLinkage,
2031 UndefValue::get(Ty),
2033 InstResult = AllocaTmps.back();
2034 } else if (CallInst *CI = dyn_cast<CallInst>(CurInst)) {
2035 // Cannot handle inline asm.
2036 if (isa<InlineAsm>(CI->getOperand(0))) return false;
2038 // Resolve function pointers.
2039 Function *Callee = dyn_cast<Function>(getVal(Values, CI->getOperand(0)));
2040 if (!Callee) return false; // Cannot resolve.
2042 std::vector<Constant*> Formals;
2043 for (User::op_iterator i = CI->op_begin() + 1, e = CI->op_end();
2045 Formals.push_back(getVal(Values, *i));
2047 if (Callee->isDeclaration()) {
2048 // If this is a function we can constant fold, do it.
2049 if (Constant *C = ConstantFoldCall(Callee, &Formals[0],
2056 if (Callee->getFunctionType()->isVarArg())
2061 // Execute the call, if successful, use the return value.
2062 if (!EvaluateFunction(Callee, RetVal, Formals, CallStack,
2063 MutatedMemory, AllocaTmps))
2065 InstResult = RetVal;
2067 } else if (isa<TerminatorInst>(CurInst)) {
2068 BasicBlock *NewBB = 0;
2069 if (BranchInst *BI = dyn_cast<BranchInst>(CurInst)) {
2070 if (BI->isUnconditional()) {
2071 NewBB = BI->getSuccessor(0);
2074 dyn_cast<ConstantInt>(getVal(Values, BI->getCondition()));
2075 if (!Cond) return false; // Cannot determine.
2077 NewBB = BI->getSuccessor(!Cond->getZExtValue());
2079 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(CurInst)) {
2081 dyn_cast<ConstantInt>(getVal(Values, SI->getCondition()));
2082 if (!Val) return false; // Cannot determine.
2083 NewBB = SI->getSuccessor(SI->findCaseValue(Val));
2084 } else if (ReturnInst *RI = dyn_cast<ReturnInst>(CurInst)) {
2085 if (RI->getNumOperands())
2086 RetVal = getVal(Values, RI->getOperand(0));
2088 CallStack.pop_back(); // return from fn.
2089 return true; // We succeeded at evaluating this ctor!
2091 // invoke, unwind, unreachable.
2092 return false; // Cannot handle this terminator.
2095 // Okay, we succeeded in evaluating this control flow. See if we have
2096 // executed the new block before. If so, we have a looping function,
2097 // which we cannot evaluate in reasonable time.
2098 if (!ExecutedBlocks.insert(NewBB).second)
2099 return false; // looped!
2101 // Okay, we have never been in this block before. Check to see if there
2102 // are any PHI nodes. If so, evaluate them with information about where
2104 BasicBlock *OldBB = CurInst->getParent();
2105 CurInst = NewBB->begin();
2107 for (; (PN = dyn_cast<PHINode>(CurInst)); ++CurInst)
2108 Values[PN] = getVal(Values, PN->getIncomingValueForBlock(OldBB));
2110 // Do NOT increment CurInst. We know that the terminator had no value.
2113 // Did not know how to evaluate this!
2117 if (!CurInst->use_empty())
2118 Values[CurInst] = InstResult;
2120 // Advance program counter.
2125 /// EvaluateStaticConstructor - Evaluate static constructors in the function, if
2126 /// we can. Return true if we can, false otherwise.
2127 static bool EvaluateStaticConstructor(Function *F) {
2128 /// MutatedMemory - For each store we execute, we update this map. Loads
2129 /// check this to get the most up-to-date value. If evaluation is successful,
2130 /// this state is committed to the process.
2131 std::map<Constant*, Constant*> MutatedMemory;
2133 /// AllocaTmps - To 'execute' an alloca, we create a temporary global variable
2134 /// to represent its body. This vector is needed so we can delete the
2135 /// temporary globals when we are done.
2136 std::vector<GlobalVariable*> AllocaTmps;
2138 /// CallStack - This is used to detect recursion. In pathological situations
2139 /// we could hit exponential behavior, but at least there is nothing
2141 std::vector<Function*> CallStack;
2143 // Call the function.
2144 Constant *RetValDummy;
2145 bool EvalSuccess = EvaluateFunction(F, RetValDummy, std::vector<Constant*>(),
2146 CallStack, MutatedMemory, AllocaTmps);
2148 // We succeeded at evaluation: commit the result.
2149 DOUT << "FULLY EVALUATED GLOBAL CTOR FUNCTION '"
2150 << F->getName() << "' to " << MutatedMemory.size()
2152 for (std::map<Constant*, Constant*>::iterator I = MutatedMemory.begin(),
2153 E = MutatedMemory.end(); I != E; ++I)
2154 CommitValueTo(I->second, I->first);
2157 // At this point, we are done interpreting. If we created any 'alloca'
2158 // temporaries, release them now.
2159 while (!AllocaTmps.empty()) {
2160 GlobalVariable *Tmp = AllocaTmps.back();
2161 AllocaTmps.pop_back();
2163 // If there are still users of the alloca, the program is doing something
2164 // silly, e.g. storing the address of the alloca somewhere and using it
2165 // later. Since this is undefined, we'll just make it be null.
2166 if (!Tmp->use_empty())
2167 Tmp->replaceAllUsesWith(Constant::getNullValue(Tmp->getType()));
2176 /// OptimizeGlobalCtorsList - Simplify and evaluation global ctors if possible.
2177 /// Return true if anything changed.
2178 bool GlobalOpt::OptimizeGlobalCtorsList(GlobalVariable *&GCL) {
2179 std::vector<Function*> Ctors = ParseGlobalCtors(GCL);
2180 bool MadeChange = false;
2181 if (Ctors.empty()) return false;
2183 // Loop over global ctors, optimizing them when we can.
2184 for (unsigned i = 0; i != Ctors.size(); ++i) {
2185 Function *F = Ctors[i];
2186 // Found a null terminator in the middle of the list, prune off the rest of
2189 if (i != Ctors.size()-1) {
2196 // We cannot simplify external ctor functions.
2197 if (F->empty()) continue;
2199 // If we can evaluate the ctor at compile time, do.
2200 if (EvaluateStaticConstructor(F)) {
2201 Ctors.erase(Ctors.begin()+i);
2204 ++NumCtorsEvaluated;
2209 if (!MadeChange) return false;
2211 GCL = InstallGlobalCtors(GCL, Ctors);
2216 bool GlobalOpt::runOnModule(Module &M) {
2217 bool Changed = false;
2219 // Try to find the llvm.globalctors list.
2220 GlobalVariable *GlobalCtors = FindGlobalCtors(M);
2222 bool LocalChange = true;
2223 while (LocalChange) {
2224 LocalChange = false;
2226 // Delete functions that are trivially dead, ccc -> fastcc
2227 LocalChange |= OptimizeFunctions(M);
2229 // Optimize global_ctors list.
2231 LocalChange |= OptimizeGlobalCtorsList(GlobalCtors);
2233 // Optimize non-address-taken globals.
2234 LocalChange |= OptimizeGlobalVars(M);
2235 Changed |= LocalChange;
2238 // TODO: Move all global ctors functions to the end of the module for code