1 //===- SROA.cpp - Scalar Replacement Of Aggregates ------------------------===//
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 transformation implements the well known scalar replacement of
11 /// aggregates transformation. It tries to identify promotable elements of an
12 /// aggregate alloca, and promote them to registers. It will also try to
13 /// convert uses of an element (or set of elements) of an alloca into a vector
14 /// or bitfield-style integer scalar if appropriate.
16 /// It works to do this with minimal slicing of the alloca so that regions
17 /// which are merely transferred in and out of external memory remain unchanged
18 /// and are not decomposed to scalar code.
20 /// Because this also performs alloca promotion, it can be thought of as also
21 /// serving the purpose of SSA formation. The algorithm iterates on the
22 /// function until all opportunities for promotion have been realized.
24 //===----------------------------------------------------------------------===//
26 #define DEBUG_TYPE "sroa"
27 #include "llvm/Transforms/Scalar.h"
28 #include "llvm/ADT/STLExtras.h"
29 #include "llvm/ADT/SetVector.h"
30 #include "llvm/ADT/SmallVector.h"
31 #include "llvm/ADT/Statistic.h"
32 #include "llvm/Analysis/Loads.h"
33 #include "llvm/Analysis/PtrUseVisitor.h"
34 #include "llvm/Analysis/ValueTracking.h"
35 #include "llvm/DIBuilder.h"
36 #include "llvm/DebugInfo.h"
37 #include "llvm/IR/Constants.h"
38 #include "llvm/IR/DataLayout.h"
39 #include "llvm/IR/DerivedTypes.h"
40 #include "llvm/IR/Dominators.h"
41 #include "llvm/IR/Function.h"
42 #include "llvm/IR/IRBuilder.h"
43 #include "llvm/IR/Instructions.h"
44 #include "llvm/IR/IntrinsicInst.h"
45 #include "llvm/IR/LLVMContext.h"
46 #include "llvm/IR/Operator.h"
47 #include "llvm/InstVisitor.h"
48 #include "llvm/Pass.h"
49 #include "llvm/Support/CommandLine.h"
50 #include "llvm/Support/Compiler.h"
51 #include "llvm/Support/Debug.h"
52 #include "llvm/Support/ErrorHandling.h"
53 #include "llvm/Support/MathExtras.h"
54 #include "llvm/Support/TimeValue.h"
55 #include "llvm/Support/raw_ostream.h"
56 #include "llvm/Transforms/Utils/Local.h"
57 #include "llvm/Transforms/Utils/PromoteMemToReg.h"
58 #include "llvm/Transforms/Utils/SSAUpdater.h"
60 #if __cplusplus >= 201103L && !defined(NDEBUG)
61 // We only use this for a debug check in C++11
67 STATISTIC(NumAllocasAnalyzed, "Number of allocas analyzed for replacement");
68 STATISTIC(NumAllocaPartitions, "Number of alloca partitions formed");
69 STATISTIC(MaxPartitionsPerAlloca, "Maximum number of partitions per alloca");
70 STATISTIC(NumAllocaPartitionUses, "Number of alloca partition uses rewritten");
71 STATISTIC(MaxUsesPerAllocaPartition, "Maximum number of uses of a partition");
72 STATISTIC(NumNewAllocas, "Number of new, smaller allocas introduced");
73 STATISTIC(NumPromoted, "Number of allocas promoted to SSA values");
74 STATISTIC(NumLoadsSpeculated, "Number of loads speculated to allow promotion");
75 STATISTIC(NumDeleted, "Number of instructions deleted");
76 STATISTIC(NumVectorized, "Number of vectorized aggregates");
78 /// Hidden option to force the pass to not use DomTree and mem2reg, instead
79 /// forming SSA values through the SSAUpdater infrastructure.
81 ForceSSAUpdater("force-ssa-updater", cl::init(false), cl::Hidden);
83 /// Hidden option to enable randomly shuffling the slices to help uncover
84 /// instability in their order.
85 static cl::opt<bool> SROARandomShuffleSlices("sroa-random-shuffle-slices",
86 cl::init(false), cl::Hidden);
88 /// Hidden option to experiment with completely strict handling of inbounds
90 static cl::opt<bool> SROAStrictInbounds("sroa-strict-inbounds",
91 cl::init(false), cl::Hidden);
94 /// \brief A custom IRBuilder inserter which prefixes all names if they are
96 template <bool preserveNames = true>
97 class IRBuilderPrefixedInserter :
98 public IRBuilderDefaultInserter<preserveNames> {
102 void SetNamePrefix(const Twine &P) { Prefix = P.str(); }
105 void InsertHelper(Instruction *I, const Twine &Name, BasicBlock *BB,
106 BasicBlock::iterator InsertPt) const {
107 IRBuilderDefaultInserter<preserveNames>::InsertHelper(
108 I, Name.isTriviallyEmpty() ? Name : Prefix + Name, BB, InsertPt);
112 // Specialization for not preserving the name is trivial.
114 class IRBuilderPrefixedInserter<false> :
115 public IRBuilderDefaultInserter<false> {
117 void SetNamePrefix(const Twine &P) {}
120 /// \brief Provide a typedef for IRBuilder that drops names in release builds.
122 typedef llvm::IRBuilder<true, ConstantFolder,
123 IRBuilderPrefixedInserter<true> > IRBuilderTy;
125 typedef llvm::IRBuilder<false, ConstantFolder,
126 IRBuilderPrefixedInserter<false> > IRBuilderTy;
131 /// \brief A used slice of an alloca.
133 /// This structure represents a slice of an alloca used by some instruction. It
134 /// stores both the begin and end offsets of this use, a pointer to the use
135 /// itself, and a flag indicating whether we can classify the use as splittable
136 /// or not when forming partitions of the alloca.
138 /// \brief The beginning offset of the range.
139 uint64_t BeginOffset;
141 /// \brief The ending offset, not included in the range.
144 /// \brief Storage for both the use of this slice and whether it can be
146 PointerIntPair<Use *, 1, bool> UseAndIsSplittable;
149 Slice() : BeginOffset(), EndOffset() {}
150 Slice(uint64_t BeginOffset, uint64_t EndOffset, Use *U, bool IsSplittable)
151 : BeginOffset(BeginOffset), EndOffset(EndOffset),
152 UseAndIsSplittable(U, IsSplittable) {}
154 uint64_t beginOffset() const { return BeginOffset; }
155 uint64_t endOffset() const { return EndOffset; }
157 bool isSplittable() const { return UseAndIsSplittable.getInt(); }
158 void makeUnsplittable() { UseAndIsSplittable.setInt(false); }
160 Use *getUse() const { return UseAndIsSplittable.getPointer(); }
162 bool isDead() const { return getUse() == 0; }
163 void kill() { UseAndIsSplittable.setPointer(0); }
165 /// \brief Support for ordering ranges.
167 /// This provides an ordering over ranges such that start offsets are
168 /// always increasing, and within equal start offsets, the end offsets are
169 /// decreasing. Thus the spanning range comes first in a cluster with the
170 /// same start position.
171 bool operator<(const Slice &RHS) const {
172 if (beginOffset() < RHS.beginOffset()) return true;
173 if (beginOffset() > RHS.beginOffset()) return false;
174 if (isSplittable() != RHS.isSplittable()) return !isSplittable();
175 if (endOffset() > RHS.endOffset()) return true;
179 /// \brief Support comparison with a single offset to allow binary searches.
180 friend LLVM_ATTRIBUTE_UNUSED bool operator<(const Slice &LHS,
181 uint64_t RHSOffset) {
182 return LHS.beginOffset() < RHSOffset;
184 friend LLVM_ATTRIBUTE_UNUSED bool operator<(uint64_t LHSOffset,
186 return LHSOffset < RHS.beginOffset();
189 bool operator==(const Slice &RHS) const {
190 return isSplittable() == RHS.isSplittable() &&
191 beginOffset() == RHS.beginOffset() && endOffset() == RHS.endOffset();
193 bool operator!=(const Slice &RHS) const { return !operator==(RHS); }
195 } // end anonymous namespace
198 template <typename T> struct isPodLike;
199 template <> struct isPodLike<Slice> {
200 static const bool value = true;
205 /// \brief Representation of the alloca slices.
207 /// This class represents the slices of an alloca which are formed by its
208 /// various uses. If a pointer escapes, we can't fully build a representation
209 /// for the slices used and we reflect that in this structure. The uses are
210 /// stored, sorted by increasing beginning offset and with unsplittable slices
211 /// starting at a particular offset before splittable slices.
214 /// \brief Construct the slices of a particular alloca.
215 AllocaSlices(const DataLayout &DL, AllocaInst &AI);
217 /// \brief Test whether a pointer to the allocation escapes our analysis.
219 /// If this is true, the slices are never fully built and should be
221 bool isEscaped() const { return PointerEscapingInstr; }
223 /// \brief Support for iterating over the slices.
225 typedef SmallVectorImpl<Slice>::iterator iterator;
226 iterator begin() { return Slices.begin(); }
227 iterator end() { return Slices.end(); }
229 typedef SmallVectorImpl<Slice>::const_iterator const_iterator;
230 const_iterator begin() const { return Slices.begin(); }
231 const_iterator end() const { return Slices.end(); }
234 /// \brief Allow iterating the dead users for this alloca.
236 /// These are instructions which will never actually use the alloca as they
237 /// are outside the allocated range. They are safe to replace with undef and
240 typedef SmallVectorImpl<Instruction *>::const_iterator dead_user_iterator;
241 dead_user_iterator dead_user_begin() const { return DeadUsers.begin(); }
242 dead_user_iterator dead_user_end() const { return DeadUsers.end(); }
245 /// \brief Allow iterating the dead expressions referring to this alloca.
247 /// These are operands which have cannot actually be used to refer to the
248 /// alloca as they are outside its range and the user doesn't correct for
249 /// that. These mostly consist of PHI node inputs and the like which we just
250 /// need to replace with undef.
252 typedef SmallVectorImpl<Use *>::const_iterator dead_op_iterator;
253 dead_op_iterator dead_op_begin() const { return DeadOperands.begin(); }
254 dead_op_iterator dead_op_end() const { return DeadOperands.end(); }
257 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
258 void print(raw_ostream &OS, const_iterator I, StringRef Indent = " ") const;
259 void printSlice(raw_ostream &OS, const_iterator I,
260 StringRef Indent = " ") const;
261 void printUse(raw_ostream &OS, const_iterator I,
262 StringRef Indent = " ") const;
263 void print(raw_ostream &OS) const;
264 void dump(const_iterator I) const;
269 template <typename DerivedT, typename RetT = void> class BuilderBase;
271 friend class AllocaSlices::SliceBuilder;
273 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
274 /// \brief Handle to alloca instruction to simplify method interfaces.
278 /// \brief The instruction responsible for this alloca not having a known set
281 /// When an instruction (potentially) escapes the pointer to the alloca, we
282 /// store a pointer to that here and abort trying to form slices of the
283 /// alloca. This will be null if the alloca slices are analyzed successfully.
284 Instruction *PointerEscapingInstr;
286 /// \brief The slices of the alloca.
288 /// We store a vector of the slices formed by uses of the alloca here. This
289 /// vector is sorted by increasing begin offset, and then the unsplittable
290 /// slices before the splittable ones. See the Slice inner class for more
292 SmallVector<Slice, 8> Slices;
294 /// \brief Instructions which will become dead if we rewrite the alloca.
296 /// Note that these are not separated by slice. This is because we expect an
297 /// alloca to be completely rewritten or not rewritten at all. If rewritten,
298 /// all these instructions can simply be removed and replaced with undef as
299 /// they come from outside of the allocated space.
300 SmallVector<Instruction *, 8> DeadUsers;
302 /// \brief Operands which will become dead if we rewrite the alloca.
304 /// These are operands that in their particular use can be replaced with
305 /// undef when we rewrite the alloca. These show up in out-of-bounds inputs
306 /// to PHI nodes and the like. They aren't entirely dead (there might be
307 /// a GEP back into the bounds using it elsewhere) and nor is the PHI, but we
308 /// want to swap this particular input for undef to simplify the use lists of
310 SmallVector<Use *, 8> DeadOperands;
314 static Value *foldSelectInst(SelectInst &SI) {
315 // If the condition being selected on is a constant or the same value is
316 // being selected between, fold the select. Yes this does (rarely) happen
318 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI.getCondition()))
319 return SI.getOperand(1+CI->isZero());
320 if (SI.getOperand(1) == SI.getOperand(2))
321 return SI.getOperand(1);
326 /// \brief Builder for the alloca slices.
328 /// This class builds a set of alloca slices by recursively visiting the uses
329 /// of an alloca and making a slice for each load and store at each offset.
330 class AllocaSlices::SliceBuilder : public PtrUseVisitor<SliceBuilder> {
331 friend class PtrUseVisitor<SliceBuilder>;
332 friend class InstVisitor<SliceBuilder>;
333 typedef PtrUseVisitor<SliceBuilder> Base;
335 const uint64_t AllocSize;
338 SmallDenseMap<Instruction *, unsigned> MemTransferSliceMap;
339 SmallDenseMap<Instruction *, uint64_t> PHIOrSelectSizes;
341 /// \brief Set to de-duplicate dead instructions found in the use walk.
342 SmallPtrSet<Instruction *, 4> VisitedDeadInsts;
345 SliceBuilder(const DataLayout &DL, AllocaInst &AI, AllocaSlices &S)
346 : PtrUseVisitor<SliceBuilder>(DL),
347 AllocSize(DL.getTypeAllocSize(AI.getAllocatedType())), S(S) {}
350 void markAsDead(Instruction &I) {
351 if (VisitedDeadInsts.insert(&I))
352 S.DeadUsers.push_back(&I);
355 void insertUse(Instruction &I, const APInt &Offset, uint64_t Size,
356 bool IsSplittable = false) {
357 // Completely skip uses which have a zero size or start either before or
358 // past the end of the allocation.
359 if (Size == 0 || Offset.uge(AllocSize)) {
360 DEBUG(dbgs() << "WARNING: Ignoring " << Size << " byte use @" << Offset
361 << " which has zero size or starts outside of the "
362 << AllocSize << " byte alloca:\n"
363 << " alloca: " << S.AI << "\n"
364 << " use: " << I << "\n");
365 return markAsDead(I);
368 uint64_t BeginOffset = Offset.getZExtValue();
369 uint64_t EndOffset = BeginOffset + Size;
371 // Clamp the end offset to the end of the allocation. Note that this is
372 // formulated to handle even the case where "BeginOffset + Size" overflows.
373 // This may appear superficially to be something we could ignore entirely,
374 // but that is not so! There may be widened loads or PHI-node uses where
375 // some instructions are dead but not others. We can't completely ignore
376 // them, and so have to record at least the information here.
377 assert(AllocSize >= BeginOffset); // Established above.
378 if (Size > AllocSize - BeginOffset) {
379 DEBUG(dbgs() << "WARNING: Clamping a " << Size << " byte use @" << Offset
380 << " to remain within the " << AllocSize << " byte alloca:\n"
381 << " alloca: " << S.AI << "\n"
382 << " use: " << I << "\n");
383 EndOffset = AllocSize;
386 S.Slices.push_back(Slice(BeginOffset, EndOffset, U, IsSplittable));
389 void visitBitCastInst(BitCastInst &BC) {
391 return markAsDead(BC);
393 return Base::visitBitCastInst(BC);
396 void visitGetElementPtrInst(GetElementPtrInst &GEPI) {
397 if (GEPI.use_empty())
398 return markAsDead(GEPI);
400 if (SROAStrictInbounds && GEPI.isInBounds()) {
401 // FIXME: This is a manually un-factored variant of the basic code inside
402 // of GEPs with checking of the inbounds invariant specified in the
403 // langref in a very strict sense. If we ever want to enable
404 // SROAStrictInbounds, this code should be factored cleanly into
405 // PtrUseVisitor, but it is easier to experiment with SROAStrictInbounds
406 // by writing out the code here where we have tho underlying allocation
407 // size readily available.
408 APInt GEPOffset = Offset;
409 for (gep_type_iterator GTI = gep_type_begin(GEPI),
410 GTE = gep_type_end(GEPI);
412 ConstantInt *OpC = dyn_cast<ConstantInt>(GTI.getOperand());
416 // Handle a struct index, which adds its field offset to the pointer.
417 if (StructType *STy = dyn_cast<StructType>(*GTI)) {
418 unsigned ElementIdx = OpC->getZExtValue();
419 const StructLayout *SL = DL.getStructLayout(STy);
421 APInt(Offset.getBitWidth(), SL->getElementOffset(ElementIdx));
423 // For array or vector indices, scale the index by the size of the type.
424 APInt Index = OpC->getValue().sextOrTrunc(Offset.getBitWidth());
425 GEPOffset += Index * APInt(Offset.getBitWidth(),
426 DL.getTypeAllocSize(GTI.getIndexedType()));
429 // If this index has computed an intermediate pointer which is not
430 // inbounds, then the result of the GEP is a poison value and we can
431 // delete it and all uses.
432 if (GEPOffset.ugt(AllocSize))
433 return markAsDead(GEPI);
437 return Base::visitGetElementPtrInst(GEPI);
440 void handleLoadOrStore(Type *Ty, Instruction &I, const APInt &Offset,
441 uint64_t Size, bool IsVolatile) {
442 // We allow splitting of loads and stores where the type is an integer type
443 // and cover the entire alloca. This prevents us from splitting over
445 // FIXME: In the great blue eventually, we should eagerly split all integer
446 // loads and stores, and then have a separate step that merges adjacent
447 // alloca partitions into a single partition suitable for integer widening.
448 // Or we should skip the merge step and rely on GVN and other passes to
449 // merge adjacent loads and stores that survive mem2reg.
451 Ty->isIntegerTy() && !IsVolatile && Offset == 0 && Size >= AllocSize;
453 insertUse(I, Offset, Size, IsSplittable);
456 void visitLoadInst(LoadInst &LI) {
457 assert((!LI.isSimple() || LI.getType()->isSingleValueType()) &&
458 "All simple FCA loads should have been pre-split");
461 return PI.setAborted(&LI);
463 uint64_t Size = DL.getTypeStoreSize(LI.getType());
464 return handleLoadOrStore(LI.getType(), LI, Offset, Size, LI.isVolatile());
467 void visitStoreInst(StoreInst &SI) {
468 Value *ValOp = SI.getValueOperand();
470 return PI.setEscapedAndAborted(&SI);
472 return PI.setAborted(&SI);
474 uint64_t Size = DL.getTypeStoreSize(ValOp->getType());
476 // If this memory access can be shown to *statically* extend outside the
477 // bounds of of the allocation, it's behavior is undefined, so simply
478 // ignore it. Note that this is more strict than the generic clamping
479 // behavior of insertUse. We also try to handle cases which might run the
481 // FIXME: We should instead consider the pointer to have escaped if this
482 // function is being instrumented for addressing bugs or race conditions.
483 if (Size > AllocSize || Offset.ugt(AllocSize - Size)) {
484 DEBUG(dbgs() << "WARNING: Ignoring " << Size << " byte store @" << Offset
485 << " which extends past the end of the " << AllocSize
487 << " alloca: " << S.AI << "\n"
488 << " use: " << SI << "\n");
489 return markAsDead(SI);
492 assert((!SI.isSimple() || ValOp->getType()->isSingleValueType()) &&
493 "All simple FCA stores should have been pre-split");
494 handleLoadOrStore(ValOp->getType(), SI, Offset, Size, SI.isVolatile());
498 void visitMemSetInst(MemSetInst &II) {
499 assert(II.getRawDest() == *U && "Pointer use is not the destination?");
500 ConstantInt *Length = dyn_cast<ConstantInt>(II.getLength());
501 if ((Length && Length->getValue() == 0) ||
502 (IsOffsetKnown && Offset.uge(AllocSize)))
503 // Zero-length mem transfer intrinsics can be ignored entirely.
504 return markAsDead(II);
507 return PI.setAborted(&II);
509 insertUse(II, Offset,
510 Length ? Length->getLimitedValue()
511 : AllocSize - Offset.getLimitedValue(),
515 void visitMemTransferInst(MemTransferInst &II) {
516 ConstantInt *Length = dyn_cast<ConstantInt>(II.getLength());
517 if (Length && Length->getValue() == 0)
518 // Zero-length mem transfer intrinsics can be ignored entirely.
519 return markAsDead(II);
521 // Because we can visit these intrinsics twice, also check to see if the
522 // first time marked this instruction as dead. If so, skip it.
523 if (VisitedDeadInsts.count(&II))
527 return PI.setAborted(&II);
529 // This side of the transfer is completely out-of-bounds, and so we can
530 // nuke the entire transfer. However, we also need to nuke the other side
531 // if already added to our partitions.
532 // FIXME: Yet another place we really should bypass this when
533 // instrumenting for ASan.
534 if (Offset.uge(AllocSize)) {
535 SmallDenseMap<Instruction *, unsigned>::iterator MTPI = MemTransferSliceMap.find(&II);
536 if (MTPI != MemTransferSliceMap.end())
537 S.Slices[MTPI->second].kill();
538 return markAsDead(II);
541 uint64_t RawOffset = Offset.getLimitedValue();
542 uint64_t Size = Length ? Length->getLimitedValue()
543 : AllocSize - RawOffset;
545 // Check for the special case where the same exact value is used for both
547 if (*U == II.getRawDest() && *U == II.getRawSource()) {
548 // For non-volatile transfers this is a no-op.
549 if (!II.isVolatile())
550 return markAsDead(II);
552 return insertUse(II, Offset, Size, /*IsSplittable=*/false);
555 // If we have seen both source and destination for a mem transfer, then
556 // they both point to the same alloca.
558 SmallDenseMap<Instruction *, unsigned>::iterator MTPI;
559 llvm::tie(MTPI, Inserted) =
560 MemTransferSliceMap.insert(std::make_pair(&II, S.Slices.size()));
561 unsigned PrevIdx = MTPI->second;
563 Slice &PrevP = S.Slices[PrevIdx];
565 // Check if the begin offsets match and this is a non-volatile transfer.
566 // In that case, we can completely elide the transfer.
567 if (!II.isVolatile() && PrevP.beginOffset() == RawOffset) {
569 return markAsDead(II);
572 // Otherwise we have an offset transfer within the same alloca. We can't
574 PrevP.makeUnsplittable();
577 // Insert the use now that we've fixed up the splittable nature.
578 insertUse(II, Offset, Size, /*IsSplittable=*/Inserted && Length);
580 // Check that we ended up with a valid index in the map.
581 assert(S.Slices[PrevIdx].getUse()->getUser() == &II &&
582 "Map index doesn't point back to a slice with this user.");
585 // Disable SRoA for any intrinsics except for lifetime invariants.
586 // FIXME: What about debug intrinsics? This matches old behavior, but
587 // doesn't make sense.
588 void visitIntrinsicInst(IntrinsicInst &II) {
590 return PI.setAborted(&II);
592 if (II.getIntrinsicID() == Intrinsic::lifetime_start ||
593 II.getIntrinsicID() == Intrinsic::lifetime_end) {
594 ConstantInt *Length = cast<ConstantInt>(II.getArgOperand(0));
595 uint64_t Size = std::min(AllocSize - Offset.getLimitedValue(),
596 Length->getLimitedValue());
597 insertUse(II, Offset, Size, true);
601 Base::visitIntrinsicInst(II);
604 Instruction *hasUnsafePHIOrSelectUse(Instruction *Root, uint64_t &Size) {
605 // We consider any PHI or select that results in a direct load or store of
606 // the same offset to be a viable use for slicing purposes. These uses
607 // are considered unsplittable and the size is the maximum loaded or stored
609 SmallPtrSet<Instruction *, 4> Visited;
610 SmallVector<std::pair<Instruction *, Instruction *>, 4> Uses;
611 Visited.insert(Root);
612 Uses.push_back(std::make_pair(cast<Instruction>(*U), Root));
613 // If there are no loads or stores, the access is dead. We mark that as
614 // a size zero access.
617 Instruction *I, *UsedI;
618 llvm::tie(UsedI, I) = Uses.pop_back_val();
620 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
621 Size = std::max(Size, DL.getTypeStoreSize(LI->getType()));
624 if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
625 Value *Op = SI->getOperand(0);
628 Size = std::max(Size, DL.getTypeStoreSize(Op->getType()));
632 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I)) {
633 if (!GEP->hasAllZeroIndices())
635 } else if (!isa<BitCastInst>(I) && !isa<PHINode>(I) &&
636 !isa<SelectInst>(I)) {
640 for (Value::use_iterator UI = I->use_begin(), UE = I->use_end(); UI != UE;
642 if (Visited.insert(cast<Instruction>(*UI)))
643 Uses.push_back(std::make_pair(I, cast<Instruction>(*UI)));
644 } while (!Uses.empty());
649 void visitPHINode(PHINode &PN) {
651 return markAsDead(PN);
653 return PI.setAborted(&PN);
655 // See if we already have computed info on this node.
656 uint64_t &PHISize = PHIOrSelectSizes[&PN];
658 // This is a new PHI node, check for an unsafe use of the PHI node.
659 if (Instruction *UnsafeI = hasUnsafePHIOrSelectUse(&PN, PHISize))
660 return PI.setAborted(UnsafeI);
663 // For PHI and select operands outside the alloca, we can't nuke the entire
664 // phi or select -- the other side might still be relevant, so we special
665 // case them here and use a separate structure to track the operands
666 // themselves which should be replaced with undef.
667 // FIXME: This should instead be escaped in the event we're instrumenting
668 // for address sanitization.
669 if (Offset.uge(AllocSize)) {
670 S.DeadOperands.push_back(U);
674 insertUse(PN, Offset, PHISize);
677 void visitSelectInst(SelectInst &SI) {
679 return markAsDead(SI);
680 if (Value *Result = foldSelectInst(SI)) {
682 // If the result of the constant fold will be the pointer, recurse
683 // through the select as if we had RAUW'ed it.
686 // Otherwise the operand to the select is dead, and we can replace it
688 S.DeadOperands.push_back(U);
693 return PI.setAborted(&SI);
695 // See if we already have computed info on this node.
696 uint64_t &SelectSize = PHIOrSelectSizes[&SI];
698 // This is a new Select, check for an unsafe use of it.
699 if (Instruction *UnsafeI = hasUnsafePHIOrSelectUse(&SI, SelectSize))
700 return PI.setAborted(UnsafeI);
703 // For PHI and select operands outside the alloca, we can't nuke the entire
704 // phi or select -- the other side might still be relevant, so we special
705 // case them here and use a separate structure to track the operands
706 // themselves which should be replaced with undef.
707 // FIXME: This should instead be escaped in the event we're instrumenting
708 // for address sanitization.
709 if (Offset.uge(AllocSize)) {
710 S.DeadOperands.push_back(U);
714 insertUse(SI, Offset, SelectSize);
717 /// \brief Disable SROA entirely if there are unhandled users of the alloca.
718 void visitInstruction(Instruction &I) {
723 AllocaSlices::AllocaSlices(const DataLayout &DL, AllocaInst &AI)
725 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
728 PointerEscapingInstr(0) {
729 SliceBuilder PB(DL, AI, *this);
730 SliceBuilder::PtrInfo PtrI = PB.visitPtr(AI);
731 if (PtrI.isEscaped() || PtrI.isAborted()) {
732 // FIXME: We should sink the escape vs. abort info into the caller nicely,
733 // possibly by just storing the PtrInfo in the AllocaSlices.
734 PointerEscapingInstr = PtrI.getEscapingInst() ? PtrI.getEscapingInst()
735 : PtrI.getAbortingInst();
736 assert(PointerEscapingInstr && "Did not track a bad instruction");
740 Slices.erase(std::remove_if(Slices.begin(), Slices.end(),
741 std::mem_fun_ref(&Slice::isDead)),
744 #if __cplusplus >= 201103L && !defined(NDEBUG)
745 if (SROARandomShuffleSlices) {
746 std::mt19937 MT(static_cast<unsigned>(sys::TimeValue::now().msec()));
747 std::shuffle(Slices.begin(), Slices.end(), MT);
751 // Sort the uses. This arranges for the offsets to be in ascending order,
752 // and the sizes to be in descending order.
753 std::sort(Slices.begin(), Slices.end());
756 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
758 void AllocaSlices::print(raw_ostream &OS, const_iterator I,
759 StringRef Indent) const {
760 printSlice(OS, I, Indent);
761 printUse(OS, I, Indent);
764 void AllocaSlices::printSlice(raw_ostream &OS, const_iterator I,
765 StringRef Indent) const {
766 OS << Indent << "[" << I->beginOffset() << "," << I->endOffset() << ")"
767 << " slice #" << (I - begin())
768 << (I->isSplittable() ? " (splittable)" : "") << "\n";
771 void AllocaSlices::printUse(raw_ostream &OS, const_iterator I,
772 StringRef Indent) const {
773 OS << Indent << " used by: " << *I->getUse()->getUser() << "\n";
776 void AllocaSlices::print(raw_ostream &OS) const {
777 if (PointerEscapingInstr) {
778 OS << "Can't analyze slices for alloca: " << AI << "\n"
779 << " A pointer to this alloca escaped by:\n"
780 << " " << *PointerEscapingInstr << "\n";
784 OS << "Slices of alloca: " << AI << "\n";
785 for (const_iterator I = begin(), E = end(); I != E; ++I)
789 LLVM_DUMP_METHOD void AllocaSlices::dump(const_iterator I) const {
792 LLVM_DUMP_METHOD void AllocaSlices::dump() const { print(dbgs()); }
794 #endif // !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
797 /// \brief Implementation of LoadAndStorePromoter for promoting allocas.
799 /// This subclass of LoadAndStorePromoter adds overrides to handle promoting
800 /// the loads and stores of an alloca instruction, as well as updating its
801 /// debug information. This is used when a domtree is unavailable and thus
802 /// mem2reg in its full form can't be used to handle promotion of allocas to
804 class AllocaPromoter : public LoadAndStorePromoter {
808 SmallVector<DbgDeclareInst *, 4> DDIs;
809 SmallVector<DbgValueInst *, 4> DVIs;
812 AllocaPromoter(const SmallVectorImpl<Instruction *> &Insts, SSAUpdater &S,
813 AllocaInst &AI, DIBuilder &DIB)
814 : LoadAndStorePromoter(Insts, S), AI(AI), DIB(DIB) {}
816 void run(const SmallVectorImpl<Instruction*> &Insts) {
817 // Retain the debug information attached to the alloca for use when
818 // rewriting loads and stores.
819 if (MDNode *DebugNode = MDNode::getIfExists(AI.getContext(), &AI)) {
820 for (Value::use_iterator UI = DebugNode->use_begin(),
821 UE = DebugNode->use_end();
823 if (DbgDeclareInst *DDI = dyn_cast<DbgDeclareInst>(*UI))
825 else if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(*UI))
829 LoadAndStorePromoter::run(Insts);
831 // While we have the debug information, clear it off of the alloca. The
832 // caller takes care of deleting the alloca.
833 while (!DDIs.empty())
834 DDIs.pop_back_val()->eraseFromParent();
835 while (!DVIs.empty())
836 DVIs.pop_back_val()->eraseFromParent();
839 virtual bool isInstInList(Instruction *I,
840 const SmallVectorImpl<Instruction*> &Insts) const {
842 if (LoadInst *LI = dyn_cast<LoadInst>(I))
843 Ptr = LI->getOperand(0);
845 Ptr = cast<StoreInst>(I)->getPointerOperand();
847 // Only used to detect cycles, which will be rare and quickly found as
848 // we're walking up a chain of defs rather than down through uses.
849 SmallPtrSet<Value *, 4> Visited;
855 if (BitCastInst *BCI = dyn_cast<BitCastInst>(Ptr))
856 Ptr = BCI->getOperand(0);
857 else if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(Ptr))
858 Ptr = GEPI->getPointerOperand();
862 } while (Visited.insert(Ptr));
867 virtual void updateDebugInfo(Instruction *Inst) const {
868 for (SmallVectorImpl<DbgDeclareInst *>::const_iterator I = DDIs.begin(),
869 E = DDIs.end(); I != E; ++I) {
870 DbgDeclareInst *DDI = *I;
871 if (StoreInst *SI = dyn_cast<StoreInst>(Inst))
872 ConvertDebugDeclareToDebugValue(DDI, SI, DIB);
873 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst))
874 ConvertDebugDeclareToDebugValue(DDI, LI, DIB);
876 for (SmallVectorImpl<DbgValueInst *>::const_iterator I = DVIs.begin(),
877 E = DVIs.end(); I != E; ++I) {
878 DbgValueInst *DVI = *I;
880 if (StoreInst *SI = dyn_cast<StoreInst>(Inst)) {
881 // If an argument is zero extended then use argument directly. The ZExt
882 // may be zapped by an optimization pass in future.
883 if (ZExtInst *ZExt = dyn_cast<ZExtInst>(SI->getOperand(0)))
884 Arg = dyn_cast<Argument>(ZExt->getOperand(0));
885 else if (SExtInst *SExt = dyn_cast<SExtInst>(SI->getOperand(0)))
886 Arg = dyn_cast<Argument>(SExt->getOperand(0));
888 Arg = SI->getValueOperand();
889 } else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) {
890 Arg = LI->getPointerOperand();
894 Instruction *DbgVal =
895 DIB.insertDbgValueIntrinsic(Arg, 0, DIVariable(DVI->getVariable()),
897 DbgVal->setDebugLoc(DVI->getDebugLoc());
901 } // end anon namespace
905 /// \brief An optimization pass providing Scalar Replacement of Aggregates.
907 /// This pass takes allocations which can be completely analyzed (that is, they
908 /// don't escape) and tries to turn them into scalar SSA values. There are
909 /// a few steps to this process.
911 /// 1) It takes allocations of aggregates and analyzes the ways in which they
912 /// are used to try to split them into smaller allocations, ideally of
913 /// a single scalar data type. It will split up memcpy and memset accesses
914 /// as necessary and try to isolate individual scalar accesses.
915 /// 2) It will transform accesses into forms which are suitable for SSA value
916 /// promotion. This can be replacing a memset with a scalar store of an
917 /// integer value, or it can involve speculating operations on a PHI or
918 /// select to be a PHI or select of the results.
919 /// 3) Finally, this will try to detect a pattern of accesses which map cleanly
920 /// onto insert and extract operations on a vector value, and convert them to
921 /// this form. By doing so, it will enable promotion of vector aggregates to
922 /// SSA vector values.
923 class SROA : public FunctionPass {
924 const bool RequiresDomTree;
927 const DataLayout *DL;
930 /// \brief Worklist of alloca instructions to simplify.
932 /// Each alloca in the function is added to this. Each new alloca formed gets
933 /// added to it as well to recursively simplify unless that alloca can be
934 /// directly promoted. Finally, each time we rewrite a use of an alloca other
935 /// the one being actively rewritten, we add it back onto the list if not
936 /// already present to ensure it is re-visited.
937 SetVector<AllocaInst *, SmallVector<AllocaInst *, 16> > Worklist;
939 /// \brief A collection of instructions to delete.
940 /// We try to batch deletions to simplify code and make things a bit more
942 SetVector<Instruction *, SmallVector<Instruction *, 8> > DeadInsts;
944 /// \brief Post-promotion worklist.
946 /// Sometimes we discover an alloca which has a high probability of becoming
947 /// viable for SROA after a round of promotion takes place. In those cases,
948 /// the alloca is enqueued here for re-processing.
950 /// Note that we have to be very careful to clear allocas out of this list in
951 /// the event they are deleted.
952 SetVector<AllocaInst *, SmallVector<AllocaInst *, 16> > PostPromotionWorklist;
954 /// \brief A collection of alloca instructions we can directly promote.
955 std::vector<AllocaInst *> PromotableAllocas;
957 /// \brief A worklist of PHIs to speculate prior to promoting allocas.
959 /// All of these PHIs have been checked for the safety of speculation and by
960 /// being speculated will allow promoting allocas currently in the promotable
962 SetVector<PHINode *, SmallVector<PHINode *, 2> > SpeculatablePHIs;
964 /// \brief A worklist of select instructions to speculate prior to promoting
967 /// All of these select instructions have been checked for the safety of
968 /// speculation and by being speculated will allow promoting allocas
969 /// currently in the promotable queue.
970 SetVector<SelectInst *, SmallVector<SelectInst *, 2> > SpeculatableSelects;
973 SROA(bool RequiresDomTree = true)
974 : FunctionPass(ID), RequiresDomTree(RequiresDomTree),
976 initializeSROAPass(*PassRegistry::getPassRegistry());
978 bool runOnFunction(Function &F);
979 void getAnalysisUsage(AnalysisUsage &AU) const;
981 const char *getPassName() const { return "SROA"; }
985 friend class PHIOrSelectSpeculator;
986 friend class AllocaSliceRewriter;
988 bool rewritePartition(AllocaInst &AI, AllocaSlices &S,
989 AllocaSlices::iterator B, AllocaSlices::iterator E,
990 int64_t BeginOffset, int64_t EndOffset,
991 ArrayRef<AllocaSlices::iterator> SplitUses);
992 bool splitAlloca(AllocaInst &AI, AllocaSlices &S);
993 bool runOnAlloca(AllocaInst &AI);
994 void clobberUse(Use &U);
995 void deleteDeadInstructions(SmallPtrSet<AllocaInst *, 4> &DeletedAllocas);
996 bool promoteAllocas(Function &F);
1002 FunctionPass *llvm::createSROAPass(bool RequiresDomTree) {
1003 return new SROA(RequiresDomTree);
1006 INITIALIZE_PASS_BEGIN(SROA, "sroa", "Scalar Replacement Of Aggregates",
1008 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
1009 INITIALIZE_PASS_END(SROA, "sroa", "Scalar Replacement Of Aggregates",
1012 /// Walk the range of a partitioning looking for a common type to cover this
1013 /// sequence of slices.
1014 static Type *findCommonType(AllocaSlices::const_iterator B,
1015 AllocaSlices::const_iterator E,
1016 uint64_t EndOffset) {
1018 bool TyIsCommon = true;
1019 IntegerType *ITy = 0;
1021 // Note that we need to look at *every* alloca slice's Use to ensure we
1022 // always get consistent results regardless of the order of slices.
1023 for (AllocaSlices::const_iterator I = B; I != E; ++I) {
1024 Use *U = I->getUse();
1025 if (isa<IntrinsicInst>(*U->getUser()))
1027 if (I->beginOffset() != B->beginOffset() || I->endOffset() != EndOffset)
1031 if (LoadInst *LI = dyn_cast<LoadInst>(U->getUser())) {
1032 UserTy = LI->getType();
1033 } else if (StoreInst *SI = dyn_cast<StoreInst>(U->getUser())) {
1034 UserTy = SI->getValueOperand()->getType();
1037 if (!UserTy || (Ty && Ty != UserTy))
1038 TyIsCommon = false; // Give up on anything but an iN type.
1042 if (IntegerType *UserITy = dyn_cast_or_null<IntegerType>(UserTy)) {
1043 // If the type is larger than the partition, skip it. We only encounter
1044 // this for split integer operations where we want to use the type of the
1045 // entity causing the split. Also skip if the type is not a byte width
1047 if (UserITy->getBitWidth() % 8 != 0 ||
1048 UserITy->getBitWidth() / 8 > (EndOffset - B->beginOffset()))
1051 // Track the largest bitwidth integer type used in this way in case there
1052 // is no common type.
1053 if (!ITy || ITy->getBitWidth() < UserITy->getBitWidth())
1058 return TyIsCommon ? Ty : ITy;
1061 /// PHI instructions that use an alloca and are subsequently loaded can be
1062 /// rewritten to load both input pointers in the pred blocks and then PHI the
1063 /// results, allowing the load of the alloca to be promoted.
1065 /// %P2 = phi [i32* %Alloca, i32* %Other]
1066 /// %V = load i32* %P2
1068 /// %V1 = load i32* %Alloca -> will be mem2reg'd
1070 /// %V2 = load i32* %Other
1072 /// %V = phi [i32 %V1, i32 %V2]
1074 /// We can do this to a select if its only uses are loads and if the operands
1075 /// to the select can be loaded unconditionally.
1077 /// FIXME: This should be hoisted into a generic utility, likely in
1078 /// Transforms/Util/Local.h
1079 static bool isSafePHIToSpeculate(PHINode &PN,
1080 const DataLayout *DL = 0) {
1081 // For now, we can only do this promotion if the load is in the same block
1082 // as the PHI, and if there are no stores between the phi and load.
1083 // TODO: Allow recursive phi users.
1084 // TODO: Allow stores.
1085 BasicBlock *BB = PN.getParent();
1086 unsigned MaxAlign = 0;
1087 bool HaveLoad = false;
1088 for (Value::use_iterator UI = PN.use_begin(), UE = PN.use_end(); UI != UE;
1090 LoadInst *LI = dyn_cast<LoadInst>(*UI);
1091 if (LI == 0 || !LI->isSimple())
1094 // For now we only allow loads in the same block as the PHI. This is
1095 // a common case that happens when instcombine merges two loads through
1097 if (LI->getParent() != BB)
1100 // Ensure that there are no instructions between the PHI and the load that
1102 for (BasicBlock::iterator BBI = &PN; &*BBI != LI; ++BBI)
1103 if (BBI->mayWriteToMemory())
1106 MaxAlign = std::max(MaxAlign, LI->getAlignment());
1113 // We can only transform this if it is safe to push the loads into the
1114 // predecessor blocks. The only thing to watch out for is that we can't put
1115 // a possibly trapping load in the predecessor if it is a critical edge.
1116 for (unsigned Idx = 0, Num = PN.getNumIncomingValues(); Idx != Num; ++Idx) {
1117 TerminatorInst *TI = PN.getIncomingBlock(Idx)->getTerminator();
1118 Value *InVal = PN.getIncomingValue(Idx);
1120 // If the value is produced by the terminator of the predecessor (an
1121 // invoke) or it has side-effects, there is no valid place to put a load
1122 // in the predecessor.
1123 if (TI == InVal || TI->mayHaveSideEffects())
1126 // If the predecessor has a single successor, then the edge isn't
1128 if (TI->getNumSuccessors() == 1)
1131 // If this pointer is always safe to load, or if we can prove that there
1132 // is already a load in the block, then we can move the load to the pred
1134 if (InVal->isDereferenceablePointer() ||
1135 isSafeToLoadUnconditionally(InVal, TI, MaxAlign, DL))
1144 static void speculatePHINodeLoads(PHINode &PN) {
1145 DEBUG(dbgs() << " original: " << PN << "\n");
1147 Type *LoadTy = cast<PointerType>(PN.getType())->getElementType();
1148 IRBuilderTy PHIBuilder(&PN);
1149 PHINode *NewPN = PHIBuilder.CreatePHI(LoadTy, PN.getNumIncomingValues(),
1150 PN.getName() + ".sroa.speculated");
1152 // Get the TBAA tag and alignment to use from one of the loads. It doesn't
1153 // matter which one we get and if any differ.
1154 LoadInst *SomeLoad = cast<LoadInst>(*PN.use_begin());
1155 MDNode *TBAATag = SomeLoad->getMetadata(LLVMContext::MD_tbaa);
1156 unsigned Align = SomeLoad->getAlignment();
1158 // Rewrite all loads of the PN to use the new PHI.
1159 while (!PN.use_empty()) {
1160 LoadInst *LI = cast<LoadInst>(*PN.use_begin());
1161 LI->replaceAllUsesWith(NewPN);
1162 LI->eraseFromParent();
1165 // Inject loads into all of the pred blocks.
1166 for (unsigned Idx = 0, Num = PN.getNumIncomingValues(); Idx != Num; ++Idx) {
1167 BasicBlock *Pred = PN.getIncomingBlock(Idx);
1168 TerminatorInst *TI = Pred->getTerminator();
1169 Value *InVal = PN.getIncomingValue(Idx);
1170 IRBuilderTy PredBuilder(TI);
1172 LoadInst *Load = PredBuilder.CreateLoad(
1173 InVal, (PN.getName() + ".sroa.speculate.load." + Pred->getName()));
1174 ++NumLoadsSpeculated;
1175 Load->setAlignment(Align);
1177 Load->setMetadata(LLVMContext::MD_tbaa, TBAATag);
1178 NewPN->addIncoming(Load, Pred);
1181 DEBUG(dbgs() << " speculated to: " << *NewPN << "\n");
1182 PN.eraseFromParent();
1185 /// Select instructions that use an alloca and are subsequently loaded can be
1186 /// rewritten to load both input pointers and then select between the result,
1187 /// allowing the load of the alloca to be promoted.
1189 /// %P2 = select i1 %cond, i32* %Alloca, i32* %Other
1190 /// %V = load i32* %P2
1192 /// %V1 = load i32* %Alloca -> will be mem2reg'd
1193 /// %V2 = load i32* %Other
1194 /// %V = select i1 %cond, i32 %V1, i32 %V2
1196 /// We can do this to a select if its only uses are loads and if the operand
1197 /// to the select can be loaded unconditionally.
1198 static bool isSafeSelectToSpeculate(SelectInst &SI, const DataLayout *DL = 0) {
1199 Value *TValue = SI.getTrueValue();
1200 Value *FValue = SI.getFalseValue();
1201 bool TDerefable = TValue->isDereferenceablePointer();
1202 bool FDerefable = FValue->isDereferenceablePointer();
1204 for (Value::use_iterator UI = SI.use_begin(), UE = SI.use_end(); UI != UE;
1206 LoadInst *LI = dyn_cast<LoadInst>(*UI);
1207 if (LI == 0 || !LI->isSimple())
1210 // Both operands to the select need to be dereferencable, either
1211 // absolutely (e.g. allocas) or at this point because we can see other
1214 !isSafeToLoadUnconditionally(TValue, LI, LI->getAlignment(), DL))
1217 !isSafeToLoadUnconditionally(FValue, LI, LI->getAlignment(), DL))
1224 static void speculateSelectInstLoads(SelectInst &SI) {
1225 DEBUG(dbgs() << " original: " << SI << "\n");
1227 IRBuilderTy IRB(&SI);
1228 Value *TV = SI.getTrueValue();
1229 Value *FV = SI.getFalseValue();
1230 // Replace the loads of the select with a select of two loads.
1231 while (!SI.use_empty()) {
1232 LoadInst *LI = cast<LoadInst>(*SI.use_begin());
1233 assert(LI->isSimple() && "We only speculate simple loads");
1235 IRB.SetInsertPoint(LI);
1237 IRB.CreateLoad(TV, LI->getName() + ".sroa.speculate.load.true");
1239 IRB.CreateLoad(FV, LI->getName() + ".sroa.speculate.load.false");
1240 NumLoadsSpeculated += 2;
1242 // Transfer alignment and TBAA info if present.
1243 TL->setAlignment(LI->getAlignment());
1244 FL->setAlignment(LI->getAlignment());
1245 if (MDNode *Tag = LI->getMetadata(LLVMContext::MD_tbaa)) {
1246 TL->setMetadata(LLVMContext::MD_tbaa, Tag);
1247 FL->setMetadata(LLVMContext::MD_tbaa, Tag);
1250 Value *V = IRB.CreateSelect(SI.getCondition(), TL, FL,
1251 LI->getName() + ".sroa.speculated");
1253 DEBUG(dbgs() << " speculated to: " << *V << "\n");
1254 LI->replaceAllUsesWith(V);
1255 LI->eraseFromParent();
1257 SI.eraseFromParent();
1260 /// \brief Build a GEP out of a base pointer and indices.
1262 /// This will return the BasePtr if that is valid, or build a new GEP
1263 /// instruction using the IRBuilder if GEP-ing is needed.
1264 static Value *buildGEP(IRBuilderTy &IRB, Value *BasePtr,
1265 SmallVectorImpl<Value *> &Indices, Twine NamePrefix) {
1266 if (Indices.empty())
1269 // A single zero index is a no-op, so check for this and avoid building a GEP
1271 if (Indices.size() == 1 && cast<ConstantInt>(Indices.back())->isZero())
1274 return IRB.CreateInBoundsGEP(BasePtr, Indices, NamePrefix + "sroa_idx");
1277 /// \brief Get a natural GEP off of the BasePtr walking through Ty toward
1278 /// TargetTy without changing the offset of the pointer.
1280 /// This routine assumes we've already established a properly offset GEP with
1281 /// Indices, and arrived at the Ty type. The goal is to continue to GEP with
1282 /// zero-indices down through type layers until we find one the same as
1283 /// TargetTy. If we can't find one with the same type, we at least try to use
1284 /// one with the same size. If none of that works, we just produce the GEP as
1285 /// indicated by Indices to have the correct offset.
1286 static Value *getNaturalGEPWithType(IRBuilderTy &IRB, const DataLayout &DL,
1287 Value *BasePtr, Type *Ty, Type *TargetTy,
1288 SmallVectorImpl<Value *> &Indices,
1291 return buildGEP(IRB, BasePtr, Indices, NamePrefix);
1293 // See if we can descend into a struct and locate a field with the correct
1295 unsigned NumLayers = 0;
1296 Type *ElementTy = Ty;
1298 if (ElementTy->isPointerTy())
1300 if (SequentialType *SeqTy = dyn_cast<SequentialType>(ElementTy)) {
1301 ElementTy = SeqTy->getElementType();
1302 // Note that we use the default address space as this index is over an
1303 // array or a vector, not a pointer.
1304 Indices.push_back(IRB.getInt(APInt(DL.getPointerSizeInBits(0), 0)));
1305 } else if (StructType *STy = dyn_cast<StructType>(ElementTy)) {
1306 if (STy->element_begin() == STy->element_end())
1307 break; // Nothing left to descend into.
1308 ElementTy = *STy->element_begin();
1309 Indices.push_back(IRB.getInt32(0));
1314 } while (ElementTy != TargetTy);
1315 if (ElementTy != TargetTy)
1316 Indices.erase(Indices.end() - NumLayers, Indices.end());
1318 return buildGEP(IRB, BasePtr, Indices, NamePrefix);
1321 /// \brief Recursively compute indices for a natural GEP.
1323 /// This is the recursive step for getNaturalGEPWithOffset that walks down the
1324 /// element types adding appropriate indices for the GEP.
1325 static Value *getNaturalGEPRecursively(IRBuilderTy &IRB, const DataLayout &DL,
1326 Value *Ptr, Type *Ty, APInt &Offset,
1328 SmallVectorImpl<Value *> &Indices,
1331 return getNaturalGEPWithType(IRB, DL, Ptr, Ty, TargetTy, Indices, NamePrefix);
1333 // We can't recurse through pointer types.
1334 if (Ty->isPointerTy())
1337 // We try to analyze GEPs over vectors here, but note that these GEPs are
1338 // extremely poorly defined currently. The long-term goal is to remove GEPing
1339 // over a vector from the IR completely.
1340 if (VectorType *VecTy = dyn_cast<VectorType>(Ty)) {
1341 unsigned ElementSizeInBits = DL.getTypeSizeInBits(VecTy->getScalarType());
1342 if (ElementSizeInBits % 8)
1343 return 0; // GEPs over non-multiple of 8 size vector elements are invalid.
1344 APInt ElementSize(Offset.getBitWidth(), ElementSizeInBits / 8);
1345 APInt NumSkippedElements = Offset.sdiv(ElementSize);
1346 if (NumSkippedElements.ugt(VecTy->getNumElements()))
1348 Offset -= NumSkippedElements * ElementSize;
1349 Indices.push_back(IRB.getInt(NumSkippedElements));
1350 return getNaturalGEPRecursively(IRB, DL, Ptr, VecTy->getElementType(),
1351 Offset, TargetTy, Indices, NamePrefix);
1354 if (ArrayType *ArrTy = dyn_cast<ArrayType>(Ty)) {
1355 Type *ElementTy = ArrTy->getElementType();
1356 APInt ElementSize(Offset.getBitWidth(), DL.getTypeAllocSize(ElementTy));
1357 APInt NumSkippedElements = Offset.sdiv(ElementSize);
1358 if (NumSkippedElements.ugt(ArrTy->getNumElements()))
1361 Offset -= NumSkippedElements * ElementSize;
1362 Indices.push_back(IRB.getInt(NumSkippedElements));
1363 return getNaturalGEPRecursively(IRB, DL, Ptr, ElementTy, Offset, TargetTy,
1364 Indices, NamePrefix);
1367 StructType *STy = dyn_cast<StructType>(Ty);
1371 const StructLayout *SL = DL.getStructLayout(STy);
1372 uint64_t StructOffset = Offset.getZExtValue();
1373 if (StructOffset >= SL->getSizeInBytes())
1375 unsigned Index = SL->getElementContainingOffset(StructOffset);
1376 Offset -= APInt(Offset.getBitWidth(), SL->getElementOffset(Index));
1377 Type *ElementTy = STy->getElementType(Index);
1378 if (Offset.uge(DL.getTypeAllocSize(ElementTy)))
1379 return 0; // The offset points into alignment padding.
1381 Indices.push_back(IRB.getInt32(Index));
1382 return getNaturalGEPRecursively(IRB, DL, Ptr, ElementTy, Offset, TargetTy,
1383 Indices, NamePrefix);
1386 /// \brief Get a natural GEP from a base pointer to a particular offset and
1387 /// resulting in a particular type.
1389 /// The goal is to produce a "natural" looking GEP that works with the existing
1390 /// composite types to arrive at the appropriate offset and element type for
1391 /// a pointer. TargetTy is the element type the returned GEP should point-to if
1392 /// possible. We recurse by decreasing Offset, adding the appropriate index to
1393 /// Indices, and setting Ty to the result subtype.
1395 /// If no natural GEP can be constructed, this function returns null.
1396 static Value *getNaturalGEPWithOffset(IRBuilderTy &IRB, const DataLayout &DL,
1397 Value *Ptr, APInt Offset, Type *TargetTy,
1398 SmallVectorImpl<Value *> &Indices,
1400 PointerType *Ty = cast<PointerType>(Ptr->getType());
1402 // Don't consider any GEPs through an i8* as natural unless the TargetTy is
1404 if (Ty == IRB.getInt8PtrTy(Ty->getAddressSpace()) && TargetTy->isIntegerTy(8))
1407 Type *ElementTy = Ty->getElementType();
1408 if (!ElementTy->isSized())
1409 return 0; // We can't GEP through an unsized element.
1410 APInt ElementSize(Offset.getBitWidth(), DL.getTypeAllocSize(ElementTy));
1411 if (ElementSize == 0)
1412 return 0; // Zero-length arrays can't help us build a natural GEP.
1413 APInt NumSkippedElements = Offset.sdiv(ElementSize);
1415 Offset -= NumSkippedElements * ElementSize;
1416 Indices.push_back(IRB.getInt(NumSkippedElements));
1417 return getNaturalGEPRecursively(IRB, DL, Ptr, ElementTy, Offset, TargetTy,
1418 Indices, NamePrefix);
1421 /// \brief Compute an adjusted pointer from Ptr by Offset bytes where the
1422 /// resulting pointer has PointerTy.
1424 /// This tries very hard to compute a "natural" GEP which arrives at the offset
1425 /// and produces the pointer type desired. Where it cannot, it will try to use
1426 /// the natural GEP to arrive at the offset and bitcast to the type. Where that
1427 /// fails, it will try to use an existing i8* and GEP to the byte offset and
1428 /// bitcast to the type.
1430 /// The strategy for finding the more natural GEPs is to peel off layers of the
1431 /// pointer, walking back through bit casts and GEPs, searching for a base
1432 /// pointer from which we can compute a natural GEP with the desired
1433 /// properties. The algorithm tries to fold as many constant indices into
1434 /// a single GEP as possible, thus making each GEP more independent of the
1435 /// surrounding code.
1436 static Value *getAdjustedPtr(IRBuilderTy &IRB, const DataLayout &DL, Value *Ptr,
1437 APInt Offset, Type *PointerTy,
1439 // Even though we don't look through PHI nodes, we could be called on an
1440 // instruction in an unreachable block, which may be on a cycle.
1441 SmallPtrSet<Value *, 4> Visited;
1442 Visited.insert(Ptr);
1443 SmallVector<Value *, 4> Indices;
1445 // We may end up computing an offset pointer that has the wrong type. If we
1446 // never are able to compute one directly that has the correct type, we'll
1447 // fall back to it, so keep it around here.
1448 Value *OffsetPtr = 0;
1450 // Remember any i8 pointer we come across to re-use if we need to do a raw
1453 APInt Int8PtrOffset(Offset.getBitWidth(), 0);
1455 Type *TargetTy = PointerTy->getPointerElementType();
1458 // First fold any existing GEPs into the offset.
1459 while (GEPOperator *GEP = dyn_cast<GEPOperator>(Ptr)) {
1460 APInt GEPOffset(Offset.getBitWidth(), 0);
1461 if (!GEP->accumulateConstantOffset(DL, GEPOffset))
1463 Offset += GEPOffset;
1464 Ptr = GEP->getPointerOperand();
1465 if (!Visited.insert(Ptr))
1469 // See if we can perform a natural GEP here.
1471 if (Value *P = getNaturalGEPWithOffset(IRB, DL, Ptr, Offset, TargetTy,
1472 Indices, NamePrefix)) {
1473 if (P->getType() == PointerTy) {
1474 // Zap any offset pointer that we ended up computing in previous rounds.
1475 if (OffsetPtr && OffsetPtr->use_empty())
1476 if (Instruction *I = dyn_cast<Instruction>(OffsetPtr))
1477 I->eraseFromParent();
1485 // Stash this pointer if we've found an i8*.
1486 if (Ptr->getType()->isIntegerTy(8)) {
1488 Int8PtrOffset = Offset;
1491 // Peel off a layer of the pointer and update the offset appropriately.
1492 if (Operator::getOpcode(Ptr) == Instruction::BitCast) {
1493 Ptr = cast<Operator>(Ptr)->getOperand(0);
1494 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(Ptr)) {
1495 if (GA->mayBeOverridden())
1497 Ptr = GA->getAliasee();
1501 assert(Ptr->getType()->isPointerTy() && "Unexpected operand type!");
1502 } while (Visited.insert(Ptr));
1506 Int8Ptr = IRB.CreateBitCast(
1507 Ptr, IRB.getInt8PtrTy(PointerTy->getPointerAddressSpace()),
1508 NamePrefix + "sroa_raw_cast");
1509 Int8PtrOffset = Offset;
1512 OffsetPtr = Int8PtrOffset == 0 ? Int8Ptr :
1513 IRB.CreateInBoundsGEP(Int8Ptr, IRB.getInt(Int8PtrOffset),
1514 NamePrefix + "sroa_raw_idx");
1518 // On the off chance we were targeting i8*, guard the bitcast here.
1519 if (Ptr->getType() != PointerTy)
1520 Ptr = IRB.CreateBitCast(Ptr, PointerTy, NamePrefix + "sroa_cast");
1525 /// \brief Test whether we can convert a value from the old to the new type.
1527 /// This predicate should be used to guard calls to convertValue in order to
1528 /// ensure that we only try to convert viable values. The strategy is that we
1529 /// will peel off single element struct and array wrappings to get to an
1530 /// underlying value, and convert that value.
1531 static bool canConvertValue(const DataLayout &DL, Type *OldTy, Type *NewTy) {
1534 if (IntegerType *OldITy = dyn_cast<IntegerType>(OldTy))
1535 if (IntegerType *NewITy = dyn_cast<IntegerType>(NewTy))
1536 if (NewITy->getBitWidth() >= OldITy->getBitWidth())
1538 if (DL.getTypeSizeInBits(NewTy) != DL.getTypeSizeInBits(OldTy))
1540 if (!NewTy->isSingleValueType() || !OldTy->isSingleValueType())
1543 // We can convert pointers to integers and vice-versa. Same for vectors
1544 // of pointers and integers.
1545 OldTy = OldTy->getScalarType();
1546 NewTy = NewTy->getScalarType();
1547 if (NewTy->isPointerTy() || OldTy->isPointerTy()) {
1548 if (NewTy->isPointerTy() && OldTy->isPointerTy())
1550 if (NewTy->isIntegerTy() || OldTy->isIntegerTy())
1558 /// \brief Generic routine to convert an SSA value to a value of a different
1561 /// This will try various different casting techniques, such as bitcasts,
1562 /// inttoptr, and ptrtoint casts. Use the \c canConvertValue predicate to test
1563 /// two types for viability with this routine.
1564 static Value *convertValue(const DataLayout &DL, IRBuilderTy &IRB, Value *V,
1566 Type *OldTy = V->getType();
1567 assert(canConvertValue(DL, OldTy, NewTy) && "Value not convertable to type");
1572 if (IntegerType *OldITy = dyn_cast<IntegerType>(OldTy))
1573 if (IntegerType *NewITy = dyn_cast<IntegerType>(NewTy))
1574 if (NewITy->getBitWidth() > OldITy->getBitWidth())
1575 return IRB.CreateZExt(V, NewITy);
1577 // See if we need inttoptr for this type pair. A cast involving both scalars
1578 // and vectors requires and additional bitcast.
1579 if (OldTy->getScalarType()->isIntegerTy() &&
1580 NewTy->getScalarType()->isPointerTy()) {
1581 // Expand <2 x i32> to i8* --> <2 x i32> to i64 to i8*
1582 if (OldTy->isVectorTy() && !NewTy->isVectorTy())
1583 return IRB.CreateIntToPtr(IRB.CreateBitCast(V, DL.getIntPtrType(NewTy)),
1586 // Expand i128 to <2 x i8*> --> i128 to <2 x i64> to <2 x i8*>
1587 if (!OldTy->isVectorTy() && NewTy->isVectorTy())
1588 return IRB.CreateIntToPtr(IRB.CreateBitCast(V, DL.getIntPtrType(NewTy)),
1591 return IRB.CreateIntToPtr(V, NewTy);
1594 // See if we need ptrtoint for this type pair. A cast involving both scalars
1595 // and vectors requires and additional bitcast.
1596 if (OldTy->getScalarType()->isPointerTy() &&
1597 NewTy->getScalarType()->isIntegerTy()) {
1598 // Expand <2 x i8*> to i128 --> <2 x i8*> to <2 x i64> to i128
1599 if (OldTy->isVectorTy() && !NewTy->isVectorTy())
1600 return IRB.CreateBitCast(IRB.CreatePtrToInt(V, DL.getIntPtrType(OldTy)),
1603 // Expand i8* to <2 x i32> --> i8* to i64 to <2 x i32>
1604 if (!OldTy->isVectorTy() && NewTy->isVectorTy())
1605 return IRB.CreateBitCast(IRB.CreatePtrToInt(V, DL.getIntPtrType(OldTy)),
1608 return IRB.CreatePtrToInt(V, NewTy);
1611 return IRB.CreateBitCast(V, NewTy);
1614 /// \brief Test whether the given slice use can be promoted to a vector.
1616 /// This function is called to test each entry in a partioning which is slated
1617 /// for a single slice.
1618 static bool isVectorPromotionViableForSlice(
1619 const DataLayout &DL, AllocaSlices &S, uint64_t SliceBeginOffset,
1620 uint64_t SliceEndOffset, VectorType *Ty, uint64_t ElementSize,
1621 AllocaSlices::const_iterator I) {
1622 // First validate the slice offsets.
1623 uint64_t BeginOffset =
1624 std::max(I->beginOffset(), SliceBeginOffset) - SliceBeginOffset;
1625 uint64_t BeginIndex = BeginOffset / ElementSize;
1626 if (BeginIndex * ElementSize != BeginOffset ||
1627 BeginIndex >= Ty->getNumElements())
1629 uint64_t EndOffset =
1630 std::min(I->endOffset(), SliceEndOffset) - SliceBeginOffset;
1631 uint64_t EndIndex = EndOffset / ElementSize;
1632 if (EndIndex * ElementSize != EndOffset || EndIndex > Ty->getNumElements())
1635 assert(EndIndex > BeginIndex && "Empty vector!");
1636 uint64_t NumElements = EndIndex - BeginIndex;
1638 (NumElements == 1) ? Ty->getElementType()
1639 : VectorType::get(Ty->getElementType(), NumElements);
1642 Type::getIntNTy(Ty->getContext(), NumElements * ElementSize * 8);
1644 Use *U = I->getUse();
1646 if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(U->getUser())) {
1647 if (MI->isVolatile())
1649 if (!I->isSplittable())
1650 return false; // Skip any unsplittable intrinsics.
1651 } else if (U->get()->getType()->getPointerElementType()->isStructTy()) {
1652 // Disable vector promotion when there are loads or stores of an FCA.
1654 } else if (LoadInst *LI = dyn_cast<LoadInst>(U->getUser())) {
1655 if (LI->isVolatile())
1657 Type *LTy = LI->getType();
1658 if (SliceBeginOffset > I->beginOffset() ||
1659 SliceEndOffset < I->endOffset()) {
1660 assert(LTy->isIntegerTy());
1663 if (!canConvertValue(DL, SliceTy, LTy))
1665 } else if (StoreInst *SI = dyn_cast<StoreInst>(U->getUser())) {
1666 if (SI->isVolatile())
1668 Type *STy = SI->getValueOperand()->getType();
1669 if (SliceBeginOffset > I->beginOffset() ||
1670 SliceEndOffset < I->endOffset()) {
1671 assert(STy->isIntegerTy());
1674 if (!canConvertValue(DL, STy, SliceTy))
1683 /// \brief Test whether the given alloca partitioning and range of slices can be
1684 /// promoted to a vector.
1686 /// This is a quick test to check whether we can rewrite a particular alloca
1687 /// partition (and its newly formed alloca) into a vector alloca with only
1688 /// whole-vector loads and stores such that it could be promoted to a vector
1689 /// SSA value. We only can ensure this for a limited set of operations, and we
1690 /// don't want to do the rewrites unless we are confident that the result will
1691 /// be promotable, so we have an early test here.
1693 isVectorPromotionViable(const DataLayout &DL, Type *AllocaTy, AllocaSlices &S,
1694 uint64_t SliceBeginOffset, uint64_t SliceEndOffset,
1695 AllocaSlices::const_iterator I,
1696 AllocaSlices::const_iterator E,
1697 ArrayRef<AllocaSlices::iterator> SplitUses) {
1698 VectorType *Ty = dyn_cast<VectorType>(AllocaTy);
1702 uint64_t ElementSize = DL.getTypeSizeInBits(Ty->getScalarType());
1704 // While the definition of LLVM vectors is bitpacked, we don't support sizes
1705 // that aren't byte sized.
1706 if (ElementSize % 8)
1708 assert((DL.getTypeSizeInBits(Ty) % 8) == 0 &&
1709 "vector size not a multiple of element size?");
1713 if (!isVectorPromotionViableForSlice(DL, S, SliceBeginOffset,
1714 SliceEndOffset, Ty, ElementSize, I))
1717 for (ArrayRef<AllocaSlices::iterator>::const_iterator SUI = SplitUses.begin(),
1718 SUE = SplitUses.end();
1720 if (!isVectorPromotionViableForSlice(DL, S, SliceBeginOffset,
1721 SliceEndOffset, Ty, ElementSize, *SUI))
1727 /// \brief Test whether a slice of an alloca is valid for integer widening.
1729 /// This implements the necessary checking for the \c isIntegerWideningViable
1730 /// test below on a single slice of the alloca.
1731 static bool isIntegerWideningViableForSlice(const DataLayout &DL,
1733 uint64_t AllocBeginOffset,
1734 uint64_t Size, AllocaSlices &S,
1735 AllocaSlices::const_iterator I,
1736 bool &WholeAllocaOp) {
1737 uint64_t RelBegin = I->beginOffset() - AllocBeginOffset;
1738 uint64_t RelEnd = I->endOffset() - AllocBeginOffset;
1740 // We can't reasonably handle cases where the load or store extends past
1741 // the end of the aloca's type and into its padding.
1745 Use *U = I->getUse();
1747 if (LoadInst *LI = dyn_cast<LoadInst>(U->getUser())) {
1748 if (LI->isVolatile())
1750 if (RelBegin == 0 && RelEnd == Size)
1751 WholeAllocaOp = true;
1752 if (IntegerType *ITy = dyn_cast<IntegerType>(LI->getType())) {
1753 if (ITy->getBitWidth() < DL.getTypeStoreSizeInBits(ITy))
1755 } else if (RelBegin != 0 || RelEnd != Size ||
1756 !canConvertValue(DL, AllocaTy, LI->getType())) {
1757 // Non-integer loads need to be convertible from the alloca type so that
1758 // they are promotable.
1761 } else if (StoreInst *SI = dyn_cast<StoreInst>(U->getUser())) {
1762 Type *ValueTy = SI->getValueOperand()->getType();
1763 if (SI->isVolatile())
1765 if (RelBegin == 0 && RelEnd == Size)
1766 WholeAllocaOp = true;
1767 if (IntegerType *ITy = dyn_cast<IntegerType>(ValueTy)) {
1768 if (ITy->getBitWidth() < DL.getTypeStoreSizeInBits(ITy))
1770 } else if (RelBegin != 0 || RelEnd != Size ||
1771 !canConvertValue(DL, ValueTy, AllocaTy)) {
1772 // Non-integer stores need to be convertible to the alloca type so that
1773 // they are promotable.
1776 } else if (MemIntrinsic *MI = dyn_cast<MemIntrinsic>(U->getUser())) {
1777 if (MI->isVolatile() || !isa<Constant>(MI->getLength()))
1779 if (!I->isSplittable())
1780 return false; // Skip any unsplittable intrinsics.
1781 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(U->getUser())) {
1782 if (II->getIntrinsicID() != Intrinsic::lifetime_start &&
1783 II->getIntrinsicID() != Intrinsic::lifetime_end)
1792 /// \brief Test whether the given alloca partition's integer operations can be
1793 /// widened to promotable ones.
1795 /// This is a quick test to check whether we can rewrite the integer loads and
1796 /// stores to a particular alloca into wider loads and stores and be able to
1797 /// promote the resulting alloca.
1799 isIntegerWideningViable(const DataLayout &DL, Type *AllocaTy,
1800 uint64_t AllocBeginOffset, AllocaSlices &S,
1801 AllocaSlices::const_iterator I,
1802 AllocaSlices::const_iterator E,
1803 ArrayRef<AllocaSlices::iterator> SplitUses) {
1804 uint64_t SizeInBits = DL.getTypeSizeInBits(AllocaTy);
1805 // Don't create integer types larger than the maximum bitwidth.
1806 if (SizeInBits > IntegerType::MAX_INT_BITS)
1809 // Don't try to handle allocas with bit-padding.
1810 if (SizeInBits != DL.getTypeStoreSizeInBits(AllocaTy))
1813 // We need to ensure that an integer type with the appropriate bitwidth can
1814 // be converted to the alloca type, whatever that is. We don't want to force
1815 // the alloca itself to have an integer type if there is a more suitable one.
1816 Type *IntTy = Type::getIntNTy(AllocaTy->getContext(), SizeInBits);
1817 if (!canConvertValue(DL, AllocaTy, IntTy) ||
1818 !canConvertValue(DL, IntTy, AllocaTy))
1821 uint64_t Size = DL.getTypeStoreSize(AllocaTy);
1823 // While examining uses, we ensure that the alloca has a covering load or
1824 // store. We don't want to widen the integer operations only to fail to
1825 // promote due to some other unsplittable entry (which we may make splittable
1826 // later). However, if there are only splittable uses, go ahead and assume
1827 // that we cover the alloca.
1828 bool WholeAllocaOp = (I != E) ? false : DL.isLegalInteger(SizeInBits);
1831 if (!isIntegerWideningViableForSlice(DL, AllocaTy, AllocBeginOffset, Size,
1832 S, I, WholeAllocaOp))
1835 for (ArrayRef<AllocaSlices::iterator>::const_iterator SUI = SplitUses.begin(),
1836 SUE = SplitUses.end();
1838 if (!isIntegerWideningViableForSlice(DL, AllocaTy, AllocBeginOffset, Size,
1839 S, *SUI, WholeAllocaOp))
1842 return WholeAllocaOp;
1845 static Value *extractInteger(const DataLayout &DL, IRBuilderTy &IRB, Value *V,
1846 IntegerType *Ty, uint64_t Offset,
1847 const Twine &Name) {
1848 DEBUG(dbgs() << " start: " << *V << "\n");
1849 IntegerType *IntTy = cast<IntegerType>(V->getType());
1850 assert(DL.getTypeStoreSize(Ty) + Offset <= DL.getTypeStoreSize(IntTy) &&
1851 "Element extends past full value");
1852 uint64_t ShAmt = 8*Offset;
1853 if (DL.isBigEndian())
1854 ShAmt = 8*(DL.getTypeStoreSize(IntTy) - DL.getTypeStoreSize(Ty) - Offset);
1856 V = IRB.CreateLShr(V, ShAmt, Name + ".shift");
1857 DEBUG(dbgs() << " shifted: " << *V << "\n");
1859 assert(Ty->getBitWidth() <= IntTy->getBitWidth() &&
1860 "Cannot extract to a larger integer!");
1862 V = IRB.CreateTrunc(V, Ty, Name + ".trunc");
1863 DEBUG(dbgs() << " trunced: " << *V << "\n");
1868 static Value *insertInteger(const DataLayout &DL, IRBuilderTy &IRB, Value *Old,
1869 Value *V, uint64_t Offset, const Twine &Name) {
1870 IntegerType *IntTy = cast<IntegerType>(Old->getType());
1871 IntegerType *Ty = cast<IntegerType>(V->getType());
1872 assert(Ty->getBitWidth() <= IntTy->getBitWidth() &&
1873 "Cannot insert a larger integer!");
1874 DEBUG(dbgs() << " start: " << *V << "\n");
1876 V = IRB.CreateZExt(V, IntTy, Name + ".ext");
1877 DEBUG(dbgs() << " extended: " << *V << "\n");
1879 assert(DL.getTypeStoreSize(Ty) + Offset <= DL.getTypeStoreSize(IntTy) &&
1880 "Element store outside of alloca store");
1881 uint64_t ShAmt = 8*Offset;
1882 if (DL.isBigEndian())
1883 ShAmt = 8*(DL.getTypeStoreSize(IntTy) - DL.getTypeStoreSize(Ty) - Offset);
1885 V = IRB.CreateShl(V, ShAmt, Name + ".shift");
1886 DEBUG(dbgs() << " shifted: " << *V << "\n");
1889 if (ShAmt || Ty->getBitWidth() < IntTy->getBitWidth()) {
1890 APInt Mask = ~Ty->getMask().zext(IntTy->getBitWidth()).shl(ShAmt);
1891 Old = IRB.CreateAnd(Old, Mask, Name + ".mask");
1892 DEBUG(dbgs() << " masked: " << *Old << "\n");
1893 V = IRB.CreateOr(Old, V, Name + ".insert");
1894 DEBUG(dbgs() << " inserted: " << *V << "\n");
1899 static Value *extractVector(IRBuilderTy &IRB, Value *V,
1900 unsigned BeginIndex, unsigned EndIndex,
1901 const Twine &Name) {
1902 VectorType *VecTy = cast<VectorType>(V->getType());
1903 unsigned NumElements = EndIndex - BeginIndex;
1904 assert(NumElements <= VecTy->getNumElements() && "Too many elements!");
1906 if (NumElements == VecTy->getNumElements())
1909 if (NumElements == 1) {
1910 V = IRB.CreateExtractElement(V, IRB.getInt32(BeginIndex),
1912 DEBUG(dbgs() << " extract: " << *V << "\n");
1916 SmallVector<Constant*, 8> Mask;
1917 Mask.reserve(NumElements);
1918 for (unsigned i = BeginIndex; i != EndIndex; ++i)
1919 Mask.push_back(IRB.getInt32(i));
1920 V = IRB.CreateShuffleVector(V, UndefValue::get(V->getType()),
1921 ConstantVector::get(Mask),
1923 DEBUG(dbgs() << " shuffle: " << *V << "\n");
1927 static Value *insertVector(IRBuilderTy &IRB, Value *Old, Value *V,
1928 unsigned BeginIndex, const Twine &Name) {
1929 VectorType *VecTy = cast<VectorType>(Old->getType());
1930 assert(VecTy && "Can only insert a vector into a vector");
1932 VectorType *Ty = dyn_cast<VectorType>(V->getType());
1934 // Single element to insert.
1935 V = IRB.CreateInsertElement(Old, V, IRB.getInt32(BeginIndex),
1937 DEBUG(dbgs() << " insert: " << *V << "\n");
1941 assert(Ty->getNumElements() <= VecTy->getNumElements() &&
1942 "Too many elements!");
1943 if (Ty->getNumElements() == VecTy->getNumElements()) {
1944 assert(V->getType() == VecTy && "Vector type mismatch");
1947 unsigned EndIndex = BeginIndex + Ty->getNumElements();
1949 // When inserting a smaller vector into the larger to store, we first
1950 // use a shuffle vector to widen it with undef elements, and then
1951 // a second shuffle vector to select between the loaded vector and the
1953 SmallVector<Constant*, 8> Mask;
1954 Mask.reserve(VecTy->getNumElements());
1955 for (unsigned i = 0; i != VecTy->getNumElements(); ++i)
1956 if (i >= BeginIndex && i < EndIndex)
1957 Mask.push_back(IRB.getInt32(i - BeginIndex));
1959 Mask.push_back(UndefValue::get(IRB.getInt32Ty()));
1960 V = IRB.CreateShuffleVector(V, UndefValue::get(V->getType()),
1961 ConstantVector::get(Mask),
1963 DEBUG(dbgs() << " shuffle: " << *V << "\n");
1966 for (unsigned i = 0; i != VecTy->getNumElements(); ++i)
1967 Mask.push_back(IRB.getInt1(i >= BeginIndex && i < EndIndex));
1969 V = IRB.CreateSelect(ConstantVector::get(Mask), V, Old, Name + "blend");
1971 DEBUG(dbgs() << " blend: " << *V << "\n");
1976 /// \brief Visitor to rewrite instructions using p particular slice of an alloca
1977 /// to use a new alloca.
1979 /// Also implements the rewriting to vector-based accesses when the partition
1980 /// passes the isVectorPromotionViable predicate. Most of the rewriting logic
1982 class AllocaSliceRewriter : public InstVisitor<AllocaSliceRewriter, bool> {
1983 // Befriend the base class so it can delegate to private visit methods.
1984 friend class llvm::InstVisitor<AllocaSliceRewriter, bool>;
1985 typedef llvm::InstVisitor<AllocaSliceRewriter, bool> Base;
1987 const DataLayout &DL;
1990 AllocaInst &OldAI, &NewAI;
1991 const uint64_t NewAllocaBeginOffset, NewAllocaEndOffset;
1994 // If we are rewriting an alloca partition which can be written as pure
1995 // vector operations, we stash extra information here. When VecTy is
1996 // non-null, we have some strict guarantees about the rewritten alloca:
1997 // - The new alloca is exactly the size of the vector type here.
1998 // - The accesses all either map to the entire vector or to a single
2000 // - The set of accessing instructions is only one of those handled above
2001 // in isVectorPromotionViable. Generally these are the same access kinds
2002 // which are promotable via mem2reg.
2005 uint64_t ElementSize;
2007 // This is a convenience and flag variable that will be null unless the new
2008 // alloca's integer operations should be widened to this integer type due to
2009 // passing isIntegerWideningViable above. If it is non-null, the desired
2010 // integer type will be stored here for easy access during rewriting.
2013 // The original offset of the slice currently being rewritten relative to
2014 // the original alloca.
2015 uint64_t BeginOffset, EndOffset;
2016 // The new offsets of the slice currently being rewritten relative to the
2018 uint64_t NewBeginOffset, NewEndOffset;
2024 Instruction *OldPtr;
2026 // Track post-rewrite users which are PHI nodes and Selects.
2027 SmallPtrSetImpl<PHINode *> &PHIUsers;
2028 SmallPtrSetImpl<SelectInst *> &SelectUsers;
2030 // Utility IR builder, whose name prefix is setup for each visited use, and
2031 // the insertion point is set to point to the user.
2035 AllocaSliceRewriter(const DataLayout &DL, AllocaSlices &S, SROA &Pass,
2036 AllocaInst &OldAI, AllocaInst &NewAI,
2037 uint64_t NewAllocaBeginOffset,
2038 uint64_t NewAllocaEndOffset, bool IsVectorPromotable,
2039 bool IsIntegerPromotable,
2040 SmallPtrSetImpl<PHINode *> &PHIUsers,
2041 SmallPtrSetImpl<SelectInst *> &SelectUsers)
2042 : DL(DL), S(S), Pass(Pass), OldAI(OldAI), NewAI(NewAI),
2043 NewAllocaBeginOffset(NewAllocaBeginOffset),
2044 NewAllocaEndOffset(NewAllocaEndOffset),
2045 NewAllocaTy(NewAI.getAllocatedType()),
2046 VecTy(IsVectorPromotable ? cast<VectorType>(NewAllocaTy) : 0),
2047 ElementTy(VecTy ? VecTy->getElementType() : 0),
2048 ElementSize(VecTy ? DL.getTypeSizeInBits(ElementTy) / 8 : 0),
2049 IntTy(IsIntegerPromotable
2052 DL.getTypeSizeInBits(NewAI.getAllocatedType()))
2054 BeginOffset(), EndOffset(), IsSplittable(), IsSplit(), OldUse(),
2055 OldPtr(), PHIUsers(PHIUsers), SelectUsers(SelectUsers),
2056 IRB(NewAI.getContext(), ConstantFolder()) {
2058 assert((DL.getTypeSizeInBits(ElementTy) % 8) == 0 &&
2059 "Only multiple-of-8 sized vector elements are viable");
2062 assert((!IsVectorPromotable && !IsIntegerPromotable) ||
2063 IsVectorPromotable != IsIntegerPromotable);
2066 bool visit(AllocaSlices::const_iterator I) {
2067 bool CanSROA = true;
2068 BeginOffset = I->beginOffset();
2069 EndOffset = I->endOffset();
2070 IsSplittable = I->isSplittable();
2072 BeginOffset < NewAllocaBeginOffset || EndOffset > NewAllocaEndOffset;
2074 // Compute the intersecting offset range.
2075 assert(BeginOffset < NewAllocaEndOffset);
2076 assert(EndOffset > NewAllocaBeginOffset);
2077 NewBeginOffset = std::max(BeginOffset, NewAllocaBeginOffset);
2078 NewEndOffset = std::min(EndOffset, NewAllocaEndOffset);
2080 SliceSize = NewEndOffset - NewBeginOffset;
2082 OldUse = I->getUse();
2083 OldPtr = cast<Instruction>(OldUse->get());
2085 Instruction *OldUserI = cast<Instruction>(OldUse->getUser());
2086 IRB.SetInsertPoint(OldUserI);
2087 IRB.SetCurrentDebugLocation(OldUserI->getDebugLoc());
2088 IRB.SetNamePrefix(Twine(NewAI.getName()) + "." + Twine(BeginOffset) + ".");
2090 CanSROA &= visit(cast<Instruction>(OldUse->getUser()));
2097 // Make sure the other visit overloads are visible.
2100 // Every instruction which can end up as a user must have a rewrite rule.
2101 bool visitInstruction(Instruction &I) {
2102 DEBUG(dbgs() << " !!!! Cannot rewrite: " << I << "\n");
2103 llvm_unreachable("No rewrite rule for this instruction!");
2106 Value *getNewAllocaSlicePtr(IRBuilderTy &IRB, Type *PointerTy) {
2107 // Note that the offset computation can use BeginOffset or NewBeginOffset
2108 // interchangeably for unsplit slices.
2109 assert(IsSplit || BeginOffset == NewBeginOffset);
2110 uint64_t Offset = NewBeginOffset - NewAllocaBeginOffset;
2113 StringRef OldName = OldPtr->getName();
2114 // Skip through the last '.sroa.' component of the name.
2115 size_t LastSROAPrefix = OldName.rfind(".sroa.");
2116 if (LastSROAPrefix != StringRef::npos) {
2117 OldName = OldName.substr(LastSROAPrefix + strlen(".sroa."));
2118 // Look for an SROA slice index.
2119 size_t IndexEnd = OldName.find_first_not_of("0123456789");
2120 if (IndexEnd != StringRef::npos && OldName[IndexEnd] == '.') {
2121 // Strip the index and look for the offset.
2122 OldName = OldName.substr(IndexEnd + 1);
2123 size_t OffsetEnd = OldName.find_first_not_of("0123456789");
2124 if (OffsetEnd != StringRef::npos && OldName[OffsetEnd] == '.')
2125 // Strip the offset.
2126 OldName = OldName.substr(OffsetEnd + 1);
2129 // Strip any SROA suffixes as well.
2130 OldName = OldName.substr(0, OldName.find(".sroa_"));
2133 return getAdjustedPtr(IRB, DL, &NewAI,
2134 APInt(DL.getPointerSizeInBits(), Offset), PointerTy,
2136 Twine(OldName) + "."
2143 /// \brief Compute suitable alignment to access this slice of the *new* alloca.
2145 /// You can optionally pass a type to this routine and if that type's ABI
2146 /// alignment is itself suitable, this will return zero.
2147 unsigned getSliceAlign(Type *Ty = 0) {
2148 unsigned NewAIAlign = NewAI.getAlignment();
2150 NewAIAlign = DL.getABITypeAlignment(NewAI.getAllocatedType());
2151 unsigned Align = MinAlign(NewAIAlign, NewBeginOffset - NewAllocaBeginOffset);
2152 return (Ty && Align == DL.getABITypeAlignment(Ty)) ? 0 : Align;
2155 unsigned getIndex(uint64_t Offset) {
2156 assert(VecTy && "Can only call getIndex when rewriting a vector");
2157 uint64_t RelOffset = Offset - NewAllocaBeginOffset;
2158 assert(RelOffset / ElementSize < UINT32_MAX && "Index out of bounds");
2159 uint32_t Index = RelOffset / ElementSize;
2160 assert(Index * ElementSize == RelOffset);
2164 void deleteIfTriviallyDead(Value *V) {
2165 Instruction *I = cast<Instruction>(V);
2166 if (isInstructionTriviallyDead(I))
2167 Pass.DeadInsts.insert(I);
2170 Value *rewriteVectorizedLoadInst() {
2171 unsigned BeginIndex = getIndex(NewBeginOffset);
2172 unsigned EndIndex = getIndex(NewEndOffset);
2173 assert(EndIndex > BeginIndex && "Empty vector!");
2175 Value *V = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2177 return extractVector(IRB, V, BeginIndex, EndIndex, "vec");
2180 Value *rewriteIntegerLoad(LoadInst &LI) {
2181 assert(IntTy && "We cannot insert an integer to the alloca");
2182 assert(!LI.isVolatile());
2183 Value *V = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2185 V = convertValue(DL, IRB, V, IntTy);
2186 assert(NewBeginOffset >= NewAllocaBeginOffset && "Out of bounds offset");
2187 uint64_t Offset = NewBeginOffset - NewAllocaBeginOffset;
2188 if (Offset > 0 || NewEndOffset < NewAllocaEndOffset)
2189 V = extractInteger(DL, IRB, V, cast<IntegerType>(LI.getType()), Offset,
2194 bool visitLoadInst(LoadInst &LI) {
2195 DEBUG(dbgs() << " original: " << LI << "\n");
2196 Value *OldOp = LI.getOperand(0);
2197 assert(OldOp == OldPtr);
2199 Type *TargetTy = IsSplit ? Type::getIntNTy(LI.getContext(), SliceSize * 8)
2201 bool IsPtrAdjusted = false;
2204 V = rewriteVectorizedLoadInst();
2205 } else if (IntTy && LI.getType()->isIntegerTy()) {
2206 V = rewriteIntegerLoad(LI);
2207 } else if (NewBeginOffset == NewAllocaBeginOffset &&
2208 canConvertValue(DL, NewAllocaTy, LI.getType())) {
2209 V = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2210 LI.isVolatile(), LI.getName());
2212 Type *LTy = TargetTy->getPointerTo();
2213 V = IRB.CreateAlignedLoad(getNewAllocaSlicePtr(IRB, LTy),
2214 getSliceAlign(TargetTy), LI.isVolatile(),
2216 IsPtrAdjusted = true;
2218 V = convertValue(DL, IRB, V, TargetTy);
2221 assert(!LI.isVolatile());
2222 assert(LI.getType()->isIntegerTy() &&
2223 "Only integer type loads and stores are split");
2224 assert(SliceSize < DL.getTypeStoreSize(LI.getType()) &&
2225 "Split load isn't smaller than original load");
2226 assert(LI.getType()->getIntegerBitWidth() ==
2227 DL.getTypeStoreSizeInBits(LI.getType()) &&
2228 "Non-byte-multiple bit width");
2229 // Move the insertion point just past the load so that we can refer to it.
2230 IRB.SetInsertPoint(llvm::next(BasicBlock::iterator(&LI)));
2231 // Create a placeholder value with the same type as LI to use as the
2232 // basis for the new value. This allows us to replace the uses of LI with
2233 // the computed value, and then replace the placeholder with LI, leaving
2234 // LI only used for this computation.
2236 = new LoadInst(UndefValue::get(LI.getType()->getPointerTo()));
2237 V = insertInteger(DL, IRB, Placeholder, V, NewBeginOffset,
2239 LI.replaceAllUsesWith(V);
2240 Placeholder->replaceAllUsesWith(&LI);
2243 LI.replaceAllUsesWith(V);
2246 Pass.DeadInsts.insert(&LI);
2247 deleteIfTriviallyDead(OldOp);
2248 DEBUG(dbgs() << " to: " << *V << "\n");
2249 return !LI.isVolatile() && !IsPtrAdjusted;
2252 bool rewriteVectorizedStoreInst(Value *V, StoreInst &SI, Value *OldOp) {
2253 if (V->getType() != VecTy) {
2254 unsigned BeginIndex = getIndex(NewBeginOffset);
2255 unsigned EndIndex = getIndex(NewEndOffset);
2256 assert(EndIndex > BeginIndex && "Empty vector!");
2257 unsigned NumElements = EndIndex - BeginIndex;
2258 assert(NumElements <= VecTy->getNumElements() && "Too many elements!");
2260 (NumElements == 1) ? ElementTy
2261 : VectorType::get(ElementTy, NumElements);
2262 if (V->getType() != SliceTy)
2263 V = convertValue(DL, IRB, V, SliceTy);
2265 // Mix in the existing elements.
2266 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2268 V = insertVector(IRB, Old, V, BeginIndex, "vec");
2270 StoreInst *Store = IRB.CreateAlignedStore(V, &NewAI, NewAI.getAlignment());
2271 Pass.DeadInsts.insert(&SI);
2274 DEBUG(dbgs() << " to: " << *Store << "\n");
2278 bool rewriteIntegerStore(Value *V, StoreInst &SI) {
2279 assert(IntTy && "We cannot extract an integer from the alloca");
2280 assert(!SI.isVolatile());
2281 if (DL.getTypeSizeInBits(V->getType()) != IntTy->getBitWidth()) {
2282 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2284 Old = convertValue(DL, IRB, Old, IntTy);
2285 assert(BeginOffset >= NewAllocaBeginOffset && "Out of bounds offset");
2286 uint64_t Offset = BeginOffset - NewAllocaBeginOffset;
2287 V = insertInteger(DL, IRB, Old, SI.getValueOperand(), Offset,
2290 V = convertValue(DL, IRB, V, NewAllocaTy);
2291 StoreInst *Store = IRB.CreateAlignedStore(V, &NewAI, NewAI.getAlignment());
2292 Pass.DeadInsts.insert(&SI);
2294 DEBUG(dbgs() << " to: " << *Store << "\n");
2298 bool visitStoreInst(StoreInst &SI) {
2299 DEBUG(dbgs() << " original: " << SI << "\n");
2300 Value *OldOp = SI.getOperand(1);
2301 assert(OldOp == OldPtr);
2303 Value *V = SI.getValueOperand();
2305 // Strip all inbounds GEPs and pointer casts to try to dig out any root
2306 // alloca that should be re-examined after promoting this alloca.
2307 if (V->getType()->isPointerTy())
2308 if (AllocaInst *AI = dyn_cast<AllocaInst>(V->stripInBoundsOffsets()))
2309 Pass.PostPromotionWorklist.insert(AI);
2311 if (SliceSize < DL.getTypeStoreSize(V->getType())) {
2312 assert(!SI.isVolatile());
2313 assert(V->getType()->isIntegerTy() &&
2314 "Only integer type loads and stores are split");
2315 assert(V->getType()->getIntegerBitWidth() ==
2316 DL.getTypeStoreSizeInBits(V->getType()) &&
2317 "Non-byte-multiple bit width");
2318 IntegerType *NarrowTy = Type::getIntNTy(SI.getContext(), SliceSize * 8);
2319 V = extractInteger(DL, IRB, V, NarrowTy, NewBeginOffset,
2324 return rewriteVectorizedStoreInst(V, SI, OldOp);
2325 if (IntTy && V->getType()->isIntegerTy())
2326 return rewriteIntegerStore(V, SI);
2329 if (NewBeginOffset == NewAllocaBeginOffset &&
2330 NewEndOffset == NewAllocaEndOffset &&
2331 canConvertValue(DL, V->getType(), NewAllocaTy)) {
2332 V = convertValue(DL, IRB, V, NewAllocaTy);
2333 NewSI = IRB.CreateAlignedStore(V, &NewAI, NewAI.getAlignment(),
2336 Value *NewPtr = getNewAllocaSlicePtr(IRB, V->getType()->getPointerTo());
2337 NewSI = IRB.CreateAlignedStore(V, NewPtr, getSliceAlign(V->getType()),
2341 Pass.DeadInsts.insert(&SI);
2342 deleteIfTriviallyDead(OldOp);
2344 DEBUG(dbgs() << " to: " << *NewSI << "\n");
2345 return NewSI->getPointerOperand() == &NewAI && !SI.isVolatile();
2348 /// \brief Compute an integer value from splatting an i8 across the given
2349 /// number of bytes.
2351 /// Note that this routine assumes an i8 is a byte. If that isn't true, don't
2352 /// call this routine.
2353 /// FIXME: Heed the advice above.
2355 /// \param V The i8 value to splat.
2356 /// \param Size The number of bytes in the output (assuming i8 is one byte)
2357 Value *getIntegerSplat(Value *V, unsigned Size) {
2358 assert(Size > 0 && "Expected a positive number of bytes.");
2359 IntegerType *VTy = cast<IntegerType>(V->getType());
2360 assert(VTy->getBitWidth() == 8 && "Expected an i8 value for the byte");
2364 Type *SplatIntTy = Type::getIntNTy(VTy->getContext(), Size*8);
2365 V = IRB.CreateMul(IRB.CreateZExt(V, SplatIntTy, "zext"),
2366 ConstantExpr::getUDiv(
2367 Constant::getAllOnesValue(SplatIntTy),
2368 ConstantExpr::getZExt(
2369 Constant::getAllOnesValue(V->getType()),
2375 /// \brief Compute a vector splat for a given element value.
2376 Value *getVectorSplat(Value *V, unsigned NumElements) {
2377 V = IRB.CreateVectorSplat(NumElements, V, "vsplat");
2378 DEBUG(dbgs() << " splat: " << *V << "\n");
2382 bool visitMemSetInst(MemSetInst &II) {
2383 DEBUG(dbgs() << " original: " << II << "\n");
2384 assert(II.getRawDest() == OldPtr);
2386 // If the memset has a variable size, it cannot be split, just adjust the
2387 // pointer to the new alloca.
2388 if (!isa<Constant>(II.getLength())) {
2390 assert(NewBeginOffset == BeginOffset);
2391 II.setDest(getNewAllocaSlicePtr(IRB, OldPtr->getType()));
2392 Type *CstTy = II.getAlignmentCst()->getType();
2393 II.setAlignment(ConstantInt::get(CstTy, getSliceAlign()));
2395 deleteIfTriviallyDead(OldPtr);
2399 // Record this instruction for deletion.
2400 Pass.DeadInsts.insert(&II);
2402 Type *AllocaTy = NewAI.getAllocatedType();
2403 Type *ScalarTy = AllocaTy->getScalarType();
2405 // If this doesn't map cleanly onto the alloca type, and that type isn't
2406 // a single value type, just emit a memset.
2407 if (!VecTy && !IntTy &&
2408 (BeginOffset > NewAllocaBeginOffset ||
2409 EndOffset < NewAllocaEndOffset ||
2410 !AllocaTy->isSingleValueType() ||
2411 !DL.isLegalInteger(DL.getTypeSizeInBits(ScalarTy)) ||
2412 DL.getTypeSizeInBits(ScalarTy)%8 != 0)) {
2413 Type *SizeTy = II.getLength()->getType();
2414 Constant *Size = ConstantInt::get(SizeTy, NewEndOffset - NewBeginOffset);
2415 CallInst *New = IRB.CreateMemSet(
2416 getNewAllocaSlicePtr(IRB, OldPtr->getType()), II.getValue(), Size,
2417 getSliceAlign(), II.isVolatile());
2419 DEBUG(dbgs() << " to: " << *New << "\n");
2423 // If we can represent this as a simple value, we have to build the actual
2424 // value to store, which requires expanding the byte present in memset to
2425 // a sensible representation for the alloca type. This is essentially
2426 // splatting the byte to a sufficiently wide integer, splatting it across
2427 // any desired vector width, and bitcasting to the final type.
2431 // If this is a memset of a vectorized alloca, insert it.
2432 assert(ElementTy == ScalarTy);
2434 unsigned BeginIndex = getIndex(NewBeginOffset);
2435 unsigned EndIndex = getIndex(NewEndOffset);
2436 assert(EndIndex > BeginIndex && "Empty vector!");
2437 unsigned NumElements = EndIndex - BeginIndex;
2438 assert(NumElements <= VecTy->getNumElements() && "Too many elements!");
2441 getIntegerSplat(II.getValue(), DL.getTypeSizeInBits(ElementTy) / 8);
2442 Splat = convertValue(DL, IRB, Splat, ElementTy);
2443 if (NumElements > 1)
2444 Splat = getVectorSplat(Splat, NumElements);
2446 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2448 V = insertVector(IRB, Old, Splat, BeginIndex, "vec");
2450 // If this is a memset on an alloca where we can widen stores, insert the
2452 assert(!II.isVolatile());
2454 uint64_t Size = NewEndOffset - NewBeginOffset;
2455 V = getIntegerSplat(II.getValue(), Size);
2457 if (IntTy && (BeginOffset != NewAllocaBeginOffset ||
2458 EndOffset != NewAllocaBeginOffset)) {
2459 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2461 Old = convertValue(DL, IRB, Old, IntTy);
2462 uint64_t Offset = NewBeginOffset - NewAllocaBeginOffset;
2463 V = insertInteger(DL, IRB, Old, V, Offset, "insert");
2465 assert(V->getType() == IntTy &&
2466 "Wrong type for an alloca wide integer!");
2468 V = convertValue(DL, IRB, V, AllocaTy);
2470 // Established these invariants above.
2471 assert(NewBeginOffset == NewAllocaBeginOffset);
2472 assert(NewEndOffset == NewAllocaEndOffset);
2474 V = getIntegerSplat(II.getValue(), DL.getTypeSizeInBits(ScalarTy) / 8);
2475 if (VectorType *AllocaVecTy = dyn_cast<VectorType>(AllocaTy))
2476 V = getVectorSplat(V, AllocaVecTy->getNumElements());
2478 V = convertValue(DL, IRB, V, AllocaTy);
2481 Value *New = IRB.CreateAlignedStore(V, &NewAI, NewAI.getAlignment(),
2484 DEBUG(dbgs() << " to: " << *New << "\n");
2485 return !II.isVolatile();
2488 bool visitMemTransferInst(MemTransferInst &II) {
2489 // Rewriting of memory transfer instructions can be a bit tricky. We break
2490 // them into two categories: split intrinsics and unsplit intrinsics.
2492 DEBUG(dbgs() << " original: " << II << "\n");
2494 bool IsDest = &II.getRawDestUse() == OldUse;
2495 assert((IsDest && II.getRawDest() == OldPtr) ||
2496 (!IsDest && II.getRawSource() == OldPtr));
2498 unsigned SliceAlign = getSliceAlign();
2500 // For unsplit intrinsics, we simply modify the source and destination
2501 // pointers in place. This isn't just an optimization, it is a matter of
2502 // correctness. With unsplit intrinsics we may be dealing with transfers
2503 // within a single alloca before SROA ran, or with transfers that have
2504 // a variable length. We may also be dealing with memmove instead of
2505 // memcpy, and so simply updating the pointers is the necessary for us to
2506 // update both source and dest of a single call.
2507 if (!IsSplittable) {
2508 Value *AdjustedPtr = getNewAllocaSlicePtr(IRB, OldPtr->getType());
2510 II.setDest(AdjustedPtr);
2512 II.setSource(AdjustedPtr);
2514 if (II.getAlignment() > SliceAlign) {
2515 Type *CstTy = II.getAlignmentCst()->getType();
2517 ConstantInt::get(CstTy, MinAlign(II.getAlignment(), SliceAlign)));
2520 DEBUG(dbgs() << " to: " << II << "\n");
2521 deleteIfTriviallyDead(OldPtr);
2524 // For split transfer intrinsics we have an incredibly useful assurance:
2525 // the source and destination do not reside within the same alloca, and at
2526 // least one of them does not escape. This means that we can replace
2527 // memmove with memcpy, and we don't need to worry about all manner of
2528 // downsides to splitting and transforming the operations.
2530 // If this doesn't map cleanly onto the alloca type, and that type isn't
2531 // a single value type, just emit a memcpy.
2533 = !VecTy && !IntTy && (BeginOffset > NewAllocaBeginOffset ||
2534 EndOffset < NewAllocaEndOffset ||
2535 !NewAI.getAllocatedType()->isSingleValueType());
2537 // If we're just going to emit a memcpy, the alloca hasn't changed, and the
2538 // size hasn't been shrunk based on analysis of the viable range, this is
2540 if (EmitMemCpy && &OldAI == &NewAI) {
2541 // Ensure the start lines up.
2542 assert(NewBeginOffset == BeginOffset);
2544 // Rewrite the size as needed.
2545 if (NewEndOffset != EndOffset)
2546 II.setLength(ConstantInt::get(II.getLength()->getType(),
2547 NewEndOffset - NewBeginOffset));
2550 // Record this instruction for deletion.
2551 Pass.DeadInsts.insert(&II);
2553 // Strip all inbounds GEPs and pointer casts to try to dig out any root
2554 // alloca that should be re-examined after rewriting this instruction.
2555 Value *OtherPtr = IsDest ? II.getRawSource() : II.getRawDest();
2557 = dyn_cast<AllocaInst>(OtherPtr->stripInBoundsOffsets())) {
2558 assert(AI != &OldAI && AI != &NewAI &&
2559 "Splittable transfers cannot reach the same alloca on both ends.");
2560 Pass.Worklist.insert(AI);
2563 Type *OtherPtrTy = OtherPtr->getType();
2564 unsigned OtherAS = OtherPtrTy->getPointerAddressSpace();
2566 // Compute the relative offset for the other pointer within the transfer.
2567 unsigned IntPtrWidth = DL.getPointerSizeInBits(OtherAS);
2568 APInt OtherOffset(IntPtrWidth, NewBeginOffset - BeginOffset);
2569 unsigned OtherAlign = MinAlign(II.getAlignment() ? II.getAlignment() : 1,
2570 OtherOffset.zextOrTrunc(64).getZExtValue());
2573 // Compute the other pointer, folding as much as possible to produce
2574 // a single, simple GEP in most cases.
2575 OtherPtr = getAdjustedPtr(IRB, DL, OtherPtr, OtherOffset, OtherPtrTy,
2576 OtherPtr->getName() + ".");
2578 Value *OurPtr = getNewAllocaSlicePtr(IRB, OldPtr->getType());
2579 Type *SizeTy = II.getLength()->getType();
2580 Constant *Size = ConstantInt::get(SizeTy, NewEndOffset - NewBeginOffset);
2582 CallInst *New = IRB.CreateMemCpy(
2583 IsDest ? OurPtr : OtherPtr, IsDest ? OtherPtr : OurPtr, Size,
2584 MinAlign(SliceAlign, OtherAlign), II.isVolatile());
2586 DEBUG(dbgs() << " to: " << *New << "\n");
2590 bool IsWholeAlloca = NewBeginOffset == NewAllocaBeginOffset &&
2591 NewEndOffset == NewAllocaEndOffset;
2592 uint64_t Size = NewEndOffset - NewBeginOffset;
2593 unsigned BeginIndex = VecTy ? getIndex(NewBeginOffset) : 0;
2594 unsigned EndIndex = VecTy ? getIndex(NewEndOffset) : 0;
2595 unsigned NumElements = EndIndex - BeginIndex;
2596 IntegerType *SubIntTy
2597 = IntTy ? Type::getIntNTy(IntTy->getContext(), Size*8) : 0;
2599 // Reset the other pointer type to match the register type we're going to
2600 // use, but using the address space of the original other pointer.
2601 if (VecTy && !IsWholeAlloca) {
2602 if (NumElements == 1)
2603 OtherPtrTy = VecTy->getElementType();
2605 OtherPtrTy = VectorType::get(VecTy->getElementType(), NumElements);
2607 OtherPtrTy = OtherPtrTy->getPointerTo(OtherAS);
2608 } else if (IntTy && !IsWholeAlloca) {
2609 OtherPtrTy = SubIntTy->getPointerTo(OtherAS);
2611 OtherPtrTy = NewAllocaTy->getPointerTo(OtherAS);
2614 Value *SrcPtr = getAdjustedPtr(IRB, DL, OtherPtr, OtherOffset, OtherPtrTy,
2615 OtherPtr->getName() + ".");
2616 unsigned SrcAlign = OtherAlign;
2617 Value *DstPtr = &NewAI;
2618 unsigned DstAlign = SliceAlign;
2620 std::swap(SrcPtr, DstPtr);
2621 std::swap(SrcAlign, DstAlign);
2625 if (VecTy && !IsWholeAlloca && !IsDest) {
2626 Src = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2628 Src = extractVector(IRB, Src, BeginIndex, EndIndex, "vec");
2629 } else if (IntTy && !IsWholeAlloca && !IsDest) {
2630 Src = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2632 Src = convertValue(DL, IRB, Src, IntTy);
2633 uint64_t Offset = NewBeginOffset - NewAllocaBeginOffset;
2634 Src = extractInteger(DL, IRB, Src, SubIntTy, Offset, "extract");
2636 Src = IRB.CreateAlignedLoad(SrcPtr, SrcAlign, II.isVolatile(),
2640 if (VecTy && !IsWholeAlloca && IsDest) {
2641 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2643 Src = insertVector(IRB, Old, Src, BeginIndex, "vec");
2644 } else if (IntTy && !IsWholeAlloca && IsDest) {
2645 Value *Old = IRB.CreateAlignedLoad(&NewAI, NewAI.getAlignment(),
2647 Old = convertValue(DL, IRB, Old, IntTy);
2648 uint64_t Offset = NewBeginOffset - NewAllocaBeginOffset;
2649 Src = insertInteger(DL, IRB, Old, Src, Offset, "insert");
2650 Src = convertValue(DL, IRB, Src, NewAllocaTy);
2653 StoreInst *Store = cast<StoreInst>(
2654 IRB.CreateAlignedStore(Src, DstPtr, DstAlign, II.isVolatile()));
2656 DEBUG(dbgs() << " to: " << *Store << "\n");
2657 return !II.isVolatile();
2660 bool visitIntrinsicInst(IntrinsicInst &II) {
2661 assert(II.getIntrinsicID() == Intrinsic::lifetime_start ||
2662 II.getIntrinsicID() == Intrinsic::lifetime_end);
2663 DEBUG(dbgs() << " original: " << II << "\n");
2664 assert(II.getArgOperand(1) == OldPtr);
2666 // Record this instruction for deletion.
2667 Pass.DeadInsts.insert(&II);
2670 = ConstantInt::get(cast<IntegerType>(II.getArgOperand(0)->getType()),
2671 NewEndOffset - NewBeginOffset);
2672 Value *Ptr = getNewAllocaSlicePtr(IRB, OldPtr->getType());
2674 if (II.getIntrinsicID() == Intrinsic::lifetime_start)
2675 New = IRB.CreateLifetimeStart(Ptr, Size);
2677 New = IRB.CreateLifetimeEnd(Ptr, Size);
2680 DEBUG(dbgs() << " to: " << *New << "\n");
2684 bool visitPHINode(PHINode &PN) {
2685 DEBUG(dbgs() << " original: " << PN << "\n");
2686 assert(BeginOffset >= NewAllocaBeginOffset && "PHIs are unsplittable");
2687 assert(EndOffset <= NewAllocaEndOffset && "PHIs are unsplittable");
2689 // We would like to compute a new pointer in only one place, but have it be
2690 // as local as possible to the PHI. To do that, we re-use the location of
2691 // the old pointer, which necessarily must be in the right position to
2692 // dominate the PHI.
2693 IRBuilderTy PtrBuilder(IRB);
2694 PtrBuilder.SetInsertPoint(OldPtr);
2695 PtrBuilder.SetCurrentDebugLocation(OldPtr->getDebugLoc());
2697 Value *NewPtr = getNewAllocaSlicePtr(PtrBuilder, OldPtr->getType());
2698 // Replace the operands which were using the old pointer.
2699 std::replace(PN.op_begin(), PN.op_end(), cast<Value>(OldPtr), NewPtr);
2701 DEBUG(dbgs() << " to: " << PN << "\n");
2702 deleteIfTriviallyDead(OldPtr);
2704 // PHIs can't be promoted on their own, but often can be speculated. We
2705 // check the speculation outside of the rewriter so that we see the
2706 // fully-rewritten alloca.
2707 PHIUsers.insert(&PN);
2711 bool visitSelectInst(SelectInst &SI) {
2712 DEBUG(dbgs() << " original: " << SI << "\n");
2713 assert((SI.getTrueValue() == OldPtr || SI.getFalseValue() == OldPtr) &&
2714 "Pointer isn't an operand!");
2715 assert(BeginOffset >= NewAllocaBeginOffset && "Selects are unsplittable");
2716 assert(EndOffset <= NewAllocaEndOffset && "Selects are unsplittable");
2718 Value *NewPtr = getNewAllocaSlicePtr(IRB, OldPtr->getType());
2719 // Replace the operands which were using the old pointer.
2720 if (SI.getOperand(1) == OldPtr)
2721 SI.setOperand(1, NewPtr);
2722 if (SI.getOperand(2) == OldPtr)
2723 SI.setOperand(2, NewPtr);
2725 DEBUG(dbgs() << " to: " << SI << "\n");
2726 deleteIfTriviallyDead(OldPtr);
2728 // Selects can't be promoted on their own, but often can be speculated. We
2729 // check the speculation outside of the rewriter so that we see the
2730 // fully-rewritten alloca.
2731 SelectUsers.insert(&SI);
2739 /// \brief Visitor to rewrite aggregate loads and stores as scalar.
2741 /// This pass aggressively rewrites all aggregate loads and stores on
2742 /// a particular pointer (or any pointer derived from it which we can identify)
2743 /// with scalar loads and stores.
2744 class AggLoadStoreRewriter : public InstVisitor<AggLoadStoreRewriter, bool> {
2745 // Befriend the base class so it can delegate to private visit methods.
2746 friend class llvm::InstVisitor<AggLoadStoreRewriter, bool>;
2748 const DataLayout &DL;
2750 /// Queue of pointer uses to analyze and potentially rewrite.
2751 SmallVector<Use *, 8> Queue;
2753 /// Set to prevent us from cycling with phi nodes and loops.
2754 SmallPtrSet<User *, 8> Visited;
2756 /// The current pointer use being rewritten. This is used to dig up the used
2757 /// value (as opposed to the user).
2761 AggLoadStoreRewriter(const DataLayout &DL) : DL(DL) {}
2763 /// Rewrite loads and stores through a pointer and all pointers derived from
2765 bool rewrite(Instruction &I) {
2766 DEBUG(dbgs() << " Rewriting FCA loads and stores...\n");
2768 bool Changed = false;
2769 while (!Queue.empty()) {
2770 U = Queue.pop_back_val();
2771 Changed |= visit(cast<Instruction>(U->getUser()));
2777 /// Enqueue all the users of the given instruction for further processing.
2778 /// This uses a set to de-duplicate users.
2779 void enqueueUsers(Instruction &I) {
2780 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end(); UI != UE;
2782 if (Visited.insert(*UI))
2783 Queue.push_back(&UI.getUse());
2786 // Conservative default is to not rewrite anything.
2787 bool visitInstruction(Instruction &I) { return false; }
2789 /// \brief Generic recursive split emission class.
2790 template <typename Derived>
2793 /// The builder used to form new instructions.
2795 /// The indices which to be used with insert- or extractvalue to select the
2796 /// appropriate value within the aggregate.
2797 SmallVector<unsigned, 4> Indices;
2798 /// The indices to a GEP instruction which will move Ptr to the correct slot
2799 /// within the aggregate.
2800 SmallVector<Value *, 4> GEPIndices;
2801 /// The base pointer of the original op, used as a base for GEPing the
2802 /// split operations.
2805 /// Initialize the splitter with an insertion point, Ptr and start with a
2806 /// single zero GEP index.
2807 OpSplitter(Instruction *InsertionPoint, Value *Ptr)
2808 : IRB(InsertionPoint), GEPIndices(1, IRB.getInt32(0)), Ptr(Ptr) {}
2811 /// \brief Generic recursive split emission routine.
2813 /// This method recursively splits an aggregate op (load or store) into
2814 /// scalar or vector ops. It splits recursively until it hits a single value
2815 /// and emits that single value operation via the template argument.
2817 /// The logic of this routine relies on GEPs and insertvalue and
2818 /// extractvalue all operating with the same fundamental index list, merely
2819 /// formatted differently (GEPs need actual values).
2821 /// \param Ty The type being split recursively into smaller ops.
2822 /// \param Agg The aggregate value being built up or stored, depending on
2823 /// whether this is splitting a load or a store respectively.
2824 void emitSplitOps(Type *Ty, Value *&Agg, const Twine &Name) {
2825 if (Ty->isSingleValueType())
2826 return static_cast<Derived *>(this)->emitFunc(Ty, Agg, Name);
2828 if (ArrayType *ATy = dyn_cast<ArrayType>(Ty)) {
2829 unsigned OldSize = Indices.size();
2831 for (unsigned Idx = 0, Size = ATy->getNumElements(); Idx != Size;
2833 assert(Indices.size() == OldSize && "Did not return to the old size");
2834 Indices.push_back(Idx);
2835 GEPIndices.push_back(IRB.getInt32(Idx));
2836 emitSplitOps(ATy->getElementType(), Agg, Name + "." + Twine(Idx));
2837 GEPIndices.pop_back();
2843 if (StructType *STy = dyn_cast<StructType>(Ty)) {
2844 unsigned OldSize = Indices.size();
2846 for (unsigned Idx = 0, Size = STy->getNumElements(); Idx != Size;
2848 assert(Indices.size() == OldSize && "Did not return to the old size");
2849 Indices.push_back(Idx);
2850 GEPIndices.push_back(IRB.getInt32(Idx));
2851 emitSplitOps(STy->getElementType(Idx), Agg, Name + "." + Twine(Idx));
2852 GEPIndices.pop_back();
2858 llvm_unreachable("Only arrays and structs are aggregate loadable types");
2862 struct LoadOpSplitter : public OpSplitter<LoadOpSplitter> {
2863 LoadOpSplitter(Instruction *InsertionPoint, Value *Ptr)
2864 : OpSplitter<LoadOpSplitter>(InsertionPoint, Ptr) {}
2866 /// Emit a leaf load of a single value. This is called at the leaves of the
2867 /// recursive emission to actually load values.
2868 void emitFunc(Type *Ty, Value *&Agg, const Twine &Name) {
2869 assert(Ty->isSingleValueType());
2870 // Load the single value and insert it using the indices.
2871 Value *GEP = IRB.CreateInBoundsGEP(Ptr, GEPIndices, Name + ".gep");
2872 Value *Load = IRB.CreateLoad(GEP, Name + ".load");
2873 Agg = IRB.CreateInsertValue(Agg, Load, Indices, Name + ".insert");
2874 DEBUG(dbgs() << " to: " << *Load << "\n");
2878 bool visitLoadInst(LoadInst &LI) {
2879 assert(LI.getPointerOperand() == *U);
2880 if (!LI.isSimple() || LI.getType()->isSingleValueType())
2883 // We have an aggregate being loaded, split it apart.
2884 DEBUG(dbgs() << " original: " << LI << "\n");
2885 LoadOpSplitter Splitter(&LI, *U);
2886 Value *V = UndefValue::get(LI.getType());
2887 Splitter.emitSplitOps(LI.getType(), V, LI.getName() + ".fca");
2888 LI.replaceAllUsesWith(V);
2889 LI.eraseFromParent();
2893 struct StoreOpSplitter : public OpSplitter<StoreOpSplitter> {
2894 StoreOpSplitter(Instruction *InsertionPoint, Value *Ptr)
2895 : OpSplitter<StoreOpSplitter>(InsertionPoint, Ptr) {}
2897 /// Emit a leaf store of a single value. This is called at the leaves of the
2898 /// recursive emission to actually produce stores.
2899 void emitFunc(Type *Ty, Value *&Agg, const Twine &Name) {
2900 assert(Ty->isSingleValueType());
2901 // Extract the single value and store it using the indices.
2902 Value *Store = IRB.CreateStore(
2903 IRB.CreateExtractValue(Agg, Indices, Name + ".extract"),
2904 IRB.CreateInBoundsGEP(Ptr, GEPIndices, Name + ".gep"));
2906 DEBUG(dbgs() << " to: " << *Store << "\n");
2910 bool visitStoreInst(StoreInst &SI) {
2911 if (!SI.isSimple() || SI.getPointerOperand() != *U)
2913 Value *V = SI.getValueOperand();
2914 if (V->getType()->isSingleValueType())
2917 // We have an aggregate being stored, split it apart.
2918 DEBUG(dbgs() << " original: " << SI << "\n");
2919 StoreOpSplitter Splitter(&SI, *U);
2920 Splitter.emitSplitOps(V->getType(), V, V->getName() + ".fca");
2921 SI.eraseFromParent();
2925 bool visitBitCastInst(BitCastInst &BC) {
2930 bool visitGetElementPtrInst(GetElementPtrInst &GEPI) {
2935 bool visitPHINode(PHINode &PN) {
2940 bool visitSelectInst(SelectInst &SI) {
2947 /// \brief Strip aggregate type wrapping.
2949 /// This removes no-op aggregate types wrapping an underlying type. It will
2950 /// strip as many layers of types as it can without changing either the type
2951 /// size or the allocated size.
2952 static Type *stripAggregateTypeWrapping(const DataLayout &DL, Type *Ty) {
2953 if (Ty->isSingleValueType())
2956 uint64_t AllocSize = DL.getTypeAllocSize(Ty);
2957 uint64_t TypeSize = DL.getTypeSizeInBits(Ty);
2960 if (ArrayType *ArrTy = dyn_cast<ArrayType>(Ty)) {
2961 InnerTy = ArrTy->getElementType();
2962 } else if (StructType *STy = dyn_cast<StructType>(Ty)) {
2963 const StructLayout *SL = DL.getStructLayout(STy);
2964 unsigned Index = SL->getElementContainingOffset(0);
2965 InnerTy = STy->getElementType(Index);
2970 if (AllocSize > DL.getTypeAllocSize(InnerTy) ||
2971 TypeSize > DL.getTypeSizeInBits(InnerTy))
2974 return stripAggregateTypeWrapping(DL, InnerTy);
2977 /// \brief Try to find a partition of the aggregate type passed in for a given
2978 /// offset and size.
2980 /// This recurses through the aggregate type and tries to compute a subtype
2981 /// based on the offset and size. When the offset and size span a sub-section
2982 /// of an array, it will even compute a new array type for that sub-section,
2983 /// and the same for structs.
2985 /// Note that this routine is very strict and tries to find a partition of the
2986 /// type which produces the *exact* right offset and size. It is not forgiving
2987 /// when the size or offset cause either end of type-based partition to be off.
2988 /// Also, this is a best-effort routine. It is reasonable to give up and not
2989 /// return a type if necessary.
2990 static Type *getTypePartition(const DataLayout &DL, Type *Ty,
2991 uint64_t Offset, uint64_t Size) {
2992 if (Offset == 0 && DL.getTypeAllocSize(Ty) == Size)
2993 return stripAggregateTypeWrapping(DL, Ty);
2994 if (Offset > DL.getTypeAllocSize(Ty) ||
2995 (DL.getTypeAllocSize(Ty) - Offset) < Size)
2998 if (SequentialType *SeqTy = dyn_cast<SequentialType>(Ty)) {
2999 // We can't partition pointers...
3000 if (SeqTy->isPointerTy())
3003 Type *ElementTy = SeqTy->getElementType();
3004 uint64_t ElementSize = DL.getTypeAllocSize(ElementTy);
3005 uint64_t NumSkippedElements = Offset / ElementSize;
3006 if (ArrayType *ArrTy = dyn_cast<ArrayType>(SeqTy)) {
3007 if (NumSkippedElements >= ArrTy->getNumElements())
3009 } else if (VectorType *VecTy = dyn_cast<VectorType>(SeqTy)) {
3010 if (NumSkippedElements >= VecTy->getNumElements())
3013 Offset -= NumSkippedElements * ElementSize;
3015 // First check if we need to recurse.
3016 if (Offset > 0 || Size < ElementSize) {
3017 // Bail if the partition ends in a different array element.
3018 if ((Offset + Size) > ElementSize)
3020 // Recurse through the element type trying to peel off offset bytes.
3021 return getTypePartition(DL, ElementTy, Offset, Size);
3023 assert(Offset == 0);
3025 if (Size == ElementSize)
3026 return stripAggregateTypeWrapping(DL, ElementTy);
3027 assert(Size > ElementSize);
3028 uint64_t NumElements = Size / ElementSize;
3029 if (NumElements * ElementSize != Size)
3031 return ArrayType::get(ElementTy, NumElements);
3034 StructType *STy = dyn_cast<StructType>(Ty);
3038 const StructLayout *SL = DL.getStructLayout(STy);
3039 if (Offset >= SL->getSizeInBytes())
3041 uint64_t EndOffset = Offset + Size;
3042 if (EndOffset > SL->getSizeInBytes())
3045 unsigned Index = SL->getElementContainingOffset(Offset);
3046 Offset -= SL->getElementOffset(Index);
3048 Type *ElementTy = STy->getElementType(Index);
3049 uint64_t ElementSize = DL.getTypeAllocSize(ElementTy);
3050 if (Offset >= ElementSize)
3051 return 0; // The offset points into alignment padding.
3053 // See if any partition must be contained by the element.
3054 if (Offset > 0 || Size < ElementSize) {
3055 if ((Offset + Size) > ElementSize)
3057 return getTypePartition(DL, ElementTy, Offset, Size);
3059 assert(Offset == 0);
3061 if (Size == ElementSize)
3062 return stripAggregateTypeWrapping(DL, ElementTy);
3064 StructType::element_iterator EI = STy->element_begin() + Index,
3065 EE = STy->element_end();
3066 if (EndOffset < SL->getSizeInBytes()) {
3067 unsigned EndIndex = SL->getElementContainingOffset(EndOffset);
3068 if (Index == EndIndex)
3069 return 0; // Within a single element and its padding.
3071 // Don't try to form "natural" types if the elements don't line up with the
3073 // FIXME: We could potentially recurse down through the last element in the
3074 // sub-struct to find a natural end point.
3075 if (SL->getElementOffset(EndIndex) != EndOffset)
3078 assert(Index < EndIndex);
3079 EE = STy->element_begin() + EndIndex;
3082 // Try to build up a sub-structure.
3083 StructType *SubTy = StructType::get(STy->getContext(), makeArrayRef(EI, EE),
3085 const StructLayout *SubSL = DL.getStructLayout(SubTy);
3086 if (Size != SubSL->getSizeInBytes())
3087 return 0; // The sub-struct doesn't have quite the size needed.
3092 /// \brief Rewrite an alloca partition's users.
3094 /// This routine drives both of the rewriting goals of the SROA pass. It tries
3095 /// to rewrite uses of an alloca partition to be conducive for SSA value
3096 /// promotion. If the partition needs a new, more refined alloca, this will
3097 /// build that new alloca, preserving as much type information as possible, and
3098 /// rewrite the uses of the old alloca to point at the new one and have the
3099 /// appropriate new offsets. It also evaluates how successful the rewrite was
3100 /// at enabling promotion and if it was successful queues the alloca to be
3102 bool SROA::rewritePartition(AllocaInst &AI, AllocaSlices &S,
3103 AllocaSlices::iterator B, AllocaSlices::iterator E,
3104 int64_t BeginOffset, int64_t EndOffset,
3105 ArrayRef<AllocaSlices::iterator> SplitUses) {
3106 assert(BeginOffset < EndOffset);
3107 uint64_t SliceSize = EndOffset - BeginOffset;
3109 // Try to compute a friendly type for this partition of the alloca. This
3110 // won't always succeed, in which case we fall back to a legal integer type
3111 // or an i8 array of an appropriate size.
3113 if (Type *CommonUseTy = findCommonType(B, E, EndOffset))
3114 if (DL->getTypeAllocSize(CommonUseTy) >= SliceSize)
3115 SliceTy = CommonUseTy;
3117 if (Type *TypePartitionTy = getTypePartition(*DL, AI.getAllocatedType(),
3118 BeginOffset, SliceSize))
3119 SliceTy = TypePartitionTy;
3120 if ((!SliceTy || (SliceTy->isArrayTy() &&
3121 SliceTy->getArrayElementType()->isIntegerTy())) &&
3122 DL->isLegalInteger(SliceSize * 8))
3123 SliceTy = Type::getIntNTy(*C, SliceSize * 8);
3125 SliceTy = ArrayType::get(Type::getInt8Ty(*C), SliceSize);
3126 assert(DL->getTypeAllocSize(SliceTy) >= SliceSize);
3128 bool IsVectorPromotable = isVectorPromotionViable(
3129 *DL, SliceTy, S, BeginOffset, EndOffset, B, E, SplitUses);
3131 bool IsIntegerPromotable =
3132 !IsVectorPromotable &&
3133 isIntegerWideningViable(*DL, SliceTy, BeginOffset, S, B, E, SplitUses);
3135 // Check for the case where we're going to rewrite to a new alloca of the
3136 // exact same type as the original, and with the same access offsets. In that
3137 // case, re-use the existing alloca, but still run through the rewriter to
3138 // perform phi and select speculation.
3140 if (SliceTy == AI.getAllocatedType()) {
3141 assert(BeginOffset == 0 &&
3142 "Non-zero begin offset but same alloca type");
3144 // FIXME: We should be able to bail at this point with "nothing changed".
3145 // FIXME: We might want to defer PHI speculation until after here.
3147 unsigned Alignment = AI.getAlignment();
3149 // The minimum alignment which users can rely on when the explicit
3150 // alignment is omitted or zero is that required by the ABI for this
3152 Alignment = DL->getABITypeAlignment(AI.getAllocatedType());
3154 Alignment = MinAlign(Alignment, BeginOffset);
3155 // If we will get at least this much alignment from the type alone, leave
3156 // the alloca's alignment unconstrained.
3157 if (Alignment <= DL->getABITypeAlignment(SliceTy))
3159 NewAI = new AllocaInst(SliceTy, 0, Alignment,
3160 AI.getName() + ".sroa." + Twine(B - S.begin()), &AI);
3164 DEBUG(dbgs() << "Rewriting alloca partition "
3165 << "[" << BeginOffset << "," << EndOffset << ") to: " << *NewAI
3168 // Track the high watermark on the worklist as it is only relevant for
3169 // promoted allocas. We will reset it to this point if the alloca is not in
3170 // fact scheduled for promotion.
3171 unsigned PPWOldSize = PostPromotionWorklist.size();
3172 unsigned NumUses = 0;
3173 SmallPtrSet<PHINode *, 8> PHIUsers;
3174 SmallPtrSet<SelectInst *, 8> SelectUsers;
3176 AllocaSliceRewriter Rewriter(*DL, S, *this, AI, *NewAI, BeginOffset,
3177 EndOffset, IsVectorPromotable,
3178 IsIntegerPromotable, PHIUsers, SelectUsers);
3179 bool Promotable = true;
3180 for (ArrayRef<AllocaSlices::iterator>::const_iterator SUI = SplitUses.begin(),
3181 SUE = SplitUses.end();
3182 SUI != SUE; ++SUI) {
3183 DEBUG(dbgs() << " rewriting split ");
3184 DEBUG(S.printSlice(dbgs(), *SUI, ""));
3185 Promotable &= Rewriter.visit(*SUI);
3188 for (AllocaSlices::iterator I = B; I != E; ++I) {
3189 DEBUG(dbgs() << " rewriting ");
3190 DEBUG(S.printSlice(dbgs(), I, ""));
3191 Promotable &= Rewriter.visit(I);
3195 NumAllocaPartitionUses += NumUses;
3196 MaxUsesPerAllocaPartition =
3197 std::max<unsigned>(NumUses, MaxUsesPerAllocaPartition);
3199 // Now that we've processed all the slices in the new partition, check if any
3200 // PHIs or Selects would block promotion.
3201 for (SmallPtrSetImpl<PHINode *>::iterator I = PHIUsers.begin(),
3204 if (!isSafePHIToSpeculate(**I, DL)) {
3207 SelectUsers.clear();
3210 for (SmallPtrSetImpl<SelectInst *>::iterator I = SelectUsers.begin(),
3211 E = SelectUsers.end();
3213 if (!isSafeSelectToSpeculate(**I, DL)) {
3216 SelectUsers.clear();
3221 if (PHIUsers.empty() && SelectUsers.empty()) {
3222 // Promote the alloca.
3223 PromotableAllocas.push_back(NewAI);
3225 // If we have either PHIs or Selects to speculate, add them to those
3226 // worklists and re-queue the new alloca so that we promote in on the
3228 for (SmallPtrSetImpl<PHINode *>::iterator I = PHIUsers.begin(),
3231 SpeculatablePHIs.insert(*I);
3232 for (SmallPtrSetImpl<SelectInst *>::iterator I = SelectUsers.begin(),
3233 E = SelectUsers.end();
3235 SpeculatableSelects.insert(*I);
3236 Worklist.insert(NewAI);
3239 // If we can't promote the alloca, iterate on it to check for new
3240 // refinements exposed by splitting the current alloca. Don't iterate on an
3241 // alloca which didn't actually change and didn't get promoted.
3243 Worklist.insert(NewAI);
3245 // Drop any post-promotion work items if promotion didn't happen.
3246 while (PostPromotionWorklist.size() > PPWOldSize)
3247 PostPromotionWorklist.pop_back();
3254 struct IsSliceEndLessOrEqualTo {
3255 uint64_t UpperBound;
3257 IsSliceEndLessOrEqualTo(uint64_t UpperBound) : UpperBound(UpperBound) {}
3259 bool operator()(const AllocaSlices::iterator &I) {
3260 return I->endOffset() <= UpperBound;
3266 removeFinishedSplitUses(SmallVectorImpl<AllocaSlices::iterator> &SplitUses,
3267 uint64_t &MaxSplitUseEndOffset, uint64_t Offset) {
3268 if (Offset >= MaxSplitUseEndOffset) {
3270 MaxSplitUseEndOffset = 0;
3274 size_t SplitUsesOldSize = SplitUses.size();
3275 SplitUses.erase(std::remove_if(SplitUses.begin(), SplitUses.end(),
3276 IsSliceEndLessOrEqualTo(Offset)),
3278 if (SplitUsesOldSize == SplitUses.size())
3281 // Recompute the max. While this is linear, so is remove_if.
3282 MaxSplitUseEndOffset = 0;
3283 for (SmallVectorImpl<AllocaSlices::iterator>::iterator
3284 SUI = SplitUses.begin(),
3285 SUE = SplitUses.end();
3287 MaxSplitUseEndOffset = std::max((*SUI)->endOffset(), MaxSplitUseEndOffset);
3290 /// \brief Walks the slices of an alloca and form partitions based on them,
3291 /// rewriting each of their uses.
3292 bool SROA::splitAlloca(AllocaInst &AI, AllocaSlices &S) {
3293 if (S.begin() == S.end())
3296 unsigned NumPartitions = 0;
3297 bool Changed = false;
3298 SmallVector<AllocaSlices::iterator, 4> SplitUses;
3299 uint64_t MaxSplitUseEndOffset = 0;
3301 uint64_t BeginOffset = S.begin()->beginOffset();
3303 for (AllocaSlices::iterator SI = S.begin(), SJ = llvm::next(SI), SE = S.end();
3304 SI != SE; SI = SJ) {
3305 uint64_t MaxEndOffset = SI->endOffset();
3307 if (!SI->isSplittable()) {
3308 // When we're forming an unsplittable region, it must always start at the
3309 // first slice and will extend through its end.
3310 assert(BeginOffset == SI->beginOffset());
3312 // Form a partition including all of the overlapping slices with this
3313 // unsplittable slice.
3314 while (SJ != SE && SJ->beginOffset() < MaxEndOffset) {
3315 if (!SJ->isSplittable())
3316 MaxEndOffset = std::max(MaxEndOffset, SJ->endOffset());
3320 assert(SI->isSplittable()); // Established above.
3322 // Collect all of the overlapping splittable slices.
3323 while (SJ != SE && SJ->beginOffset() < MaxEndOffset &&
3324 SJ->isSplittable()) {
3325 MaxEndOffset = std::max(MaxEndOffset, SJ->endOffset());
3329 // Back up MaxEndOffset and SJ if we ended the span early when
3330 // encountering an unsplittable slice.
3331 if (SJ != SE && SJ->beginOffset() < MaxEndOffset) {
3332 assert(!SJ->isSplittable());
3333 MaxEndOffset = SJ->beginOffset();
3337 // Check if we have managed to move the end offset forward yet. If so,
3338 // we'll have to rewrite uses and erase old split uses.
3339 if (BeginOffset < MaxEndOffset) {
3340 // Rewrite a sequence of overlapping slices.
3342 rewritePartition(AI, S, SI, SJ, BeginOffset, MaxEndOffset, SplitUses);
3345 removeFinishedSplitUses(SplitUses, MaxSplitUseEndOffset, MaxEndOffset);
3348 // Accumulate all the splittable slices from the [SI,SJ) region which
3349 // overlap going forward.
3350 for (AllocaSlices::iterator SK = SI; SK != SJ; ++SK)
3351 if (SK->isSplittable() && SK->endOffset() > MaxEndOffset) {
3352 SplitUses.push_back(SK);
3353 MaxSplitUseEndOffset = std::max(SK->endOffset(), MaxSplitUseEndOffset);
3356 // If we're already at the end and we have no split uses, we're done.
3357 if (SJ == SE && SplitUses.empty())
3360 // If we have no split uses or no gap in offsets, we're ready to move to
3362 if (SplitUses.empty() || (SJ != SE && MaxEndOffset == SJ->beginOffset())) {
3363 BeginOffset = SJ->beginOffset();
3367 // Even if we have split slices, if the next slice is splittable and the
3368 // split slices reach it, we can simply set up the beginning offset of the
3369 // next iteration to bridge between them.
3370 if (SJ != SE && SJ->isSplittable() &&
3371 MaxSplitUseEndOffset > SJ->beginOffset()) {
3372 BeginOffset = MaxEndOffset;
3376 // Otherwise, we have a tail of split slices. Rewrite them with an empty
3378 uint64_t PostSplitEndOffset =
3379 SJ == SE ? MaxSplitUseEndOffset : SJ->beginOffset();
3381 Changed |= rewritePartition(AI, S, SJ, SJ, MaxEndOffset, PostSplitEndOffset,
3386 break; // Skip the rest, we don't need to do any cleanup.
3388 removeFinishedSplitUses(SplitUses, MaxSplitUseEndOffset,
3389 PostSplitEndOffset);
3391 // Now just reset the begin offset for the next iteration.
3392 BeginOffset = SJ->beginOffset();
3395 NumAllocaPartitions += NumPartitions;
3396 MaxPartitionsPerAlloca =
3397 std::max<unsigned>(NumPartitions, MaxPartitionsPerAlloca);
3402 /// \brief Clobber a use with undef, deleting the used value if it becomes dead.
3403 void SROA::clobberUse(Use &U) {
3405 // Replace the use with an undef value.
3406 U = UndefValue::get(OldV->getType());
3408 // Check for this making an instruction dead. We have to garbage collect
3409 // all the dead instructions to ensure the uses of any alloca end up being
3411 if (Instruction *OldI = dyn_cast<Instruction>(OldV))
3412 if (isInstructionTriviallyDead(OldI)) {
3413 DeadInsts.insert(OldI);
3417 /// \brief Analyze an alloca for SROA.
3419 /// This analyzes the alloca to ensure we can reason about it, builds
3420 /// the slices of the alloca, and then hands it off to be split and
3421 /// rewritten as needed.
3422 bool SROA::runOnAlloca(AllocaInst &AI) {
3423 DEBUG(dbgs() << "SROA alloca: " << AI << "\n");
3424 ++NumAllocasAnalyzed;
3426 // Special case dead allocas, as they're trivial.
3427 if (AI.use_empty()) {
3428 AI.eraseFromParent();
3432 // Skip alloca forms that this analysis can't handle.
3433 if (AI.isArrayAllocation() || !AI.getAllocatedType()->isSized() ||
3434 DL->getTypeAllocSize(AI.getAllocatedType()) == 0)
3437 bool Changed = false;
3439 // First, split any FCA loads and stores touching this alloca to promote
3440 // better splitting and promotion opportunities.
3441 AggLoadStoreRewriter AggRewriter(*DL);
3442 Changed |= AggRewriter.rewrite(AI);
3444 // Build the slices using a recursive instruction-visiting builder.
3445 AllocaSlices S(*DL, AI);
3446 DEBUG(S.print(dbgs()));
3450 // Delete all the dead users of this alloca before splitting and rewriting it.
3451 for (AllocaSlices::dead_user_iterator DI = S.dead_user_begin(),
3452 DE = S.dead_user_end();
3454 // Free up everything used by this instruction.
3455 for (User::op_iterator DOI = (*DI)->op_begin(), DOE = (*DI)->op_end();
3459 // Now replace the uses of this instruction.
3460 (*DI)->replaceAllUsesWith(UndefValue::get((*DI)->getType()));
3462 // And mark it for deletion.
3463 DeadInsts.insert(*DI);
3466 for (AllocaSlices::dead_op_iterator DO = S.dead_op_begin(),
3467 DE = S.dead_op_end();
3473 // No slices to split. Leave the dead alloca for a later pass to clean up.
3474 if (S.begin() == S.end())
3477 Changed |= splitAlloca(AI, S);
3479 DEBUG(dbgs() << " Speculating PHIs\n");
3480 while (!SpeculatablePHIs.empty())
3481 speculatePHINodeLoads(*SpeculatablePHIs.pop_back_val());
3483 DEBUG(dbgs() << " Speculating Selects\n");
3484 while (!SpeculatableSelects.empty())
3485 speculateSelectInstLoads(*SpeculatableSelects.pop_back_val());
3490 /// \brief Delete the dead instructions accumulated in this run.
3492 /// Recursively deletes the dead instructions we've accumulated. This is done
3493 /// at the very end to maximize locality of the recursive delete and to
3494 /// minimize the problems of invalidated instruction pointers as such pointers
3495 /// are used heavily in the intermediate stages of the algorithm.
3497 /// We also record the alloca instructions deleted here so that they aren't
3498 /// subsequently handed to mem2reg to promote.
3499 void SROA::deleteDeadInstructions(SmallPtrSet<AllocaInst*, 4> &DeletedAllocas) {
3500 while (!DeadInsts.empty()) {
3501 Instruction *I = DeadInsts.pop_back_val();
3502 DEBUG(dbgs() << "Deleting dead instruction: " << *I << "\n");
3504 I->replaceAllUsesWith(UndefValue::get(I->getType()));
3506 for (User::op_iterator OI = I->op_begin(), E = I->op_end(); OI != E; ++OI)
3507 if (Instruction *U = dyn_cast<Instruction>(*OI)) {
3508 // Zero out the operand and see if it becomes trivially dead.
3510 if (isInstructionTriviallyDead(U))
3511 DeadInsts.insert(U);
3514 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
3515 DeletedAllocas.insert(AI);
3518 I->eraseFromParent();
3522 static void enqueueUsersInWorklist(Instruction &I,
3523 SmallVectorImpl<Instruction *> &Worklist,
3524 SmallPtrSet<Instruction *, 8> &Visited) {
3525 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end(); UI != UE;
3527 if (Visited.insert(cast<Instruction>(*UI)))
3528 Worklist.push_back(cast<Instruction>(*UI));
3531 /// \brief Promote the allocas, using the best available technique.
3533 /// This attempts to promote whatever allocas have been identified as viable in
3534 /// the PromotableAllocas list. If that list is empty, there is nothing to do.
3535 /// If there is a domtree available, we attempt to promote using the full power
3536 /// of mem2reg. Otherwise, we build and use the AllocaPromoter above which is
3537 /// based on the SSAUpdater utilities. This function returns whether any
3538 /// promotion occurred.
3539 bool SROA::promoteAllocas(Function &F) {
3540 if (PromotableAllocas.empty())
3543 NumPromoted += PromotableAllocas.size();
3545 if (DT && !ForceSSAUpdater) {
3546 DEBUG(dbgs() << "Promoting allocas with mem2reg...\n");
3547 PromoteMemToReg(PromotableAllocas, *DT);
3548 PromotableAllocas.clear();
3552 DEBUG(dbgs() << "Promoting allocas with SSAUpdater...\n");
3554 DIBuilder DIB(*F.getParent());
3555 SmallVector<Instruction *, 64> Insts;
3557 // We need a worklist to walk the uses of each alloca.
3558 SmallVector<Instruction *, 8> Worklist;
3559 SmallPtrSet<Instruction *, 8> Visited;
3560 SmallVector<Instruction *, 32> DeadInsts;
3562 for (unsigned Idx = 0, Size = PromotableAllocas.size(); Idx != Size; ++Idx) {
3563 AllocaInst *AI = PromotableAllocas[Idx];
3568 enqueueUsersInWorklist(*AI, Worklist, Visited);
3570 while (!Worklist.empty()) {
3571 Instruction *I = Worklist.pop_back_val();
3573 // FIXME: Currently the SSAUpdater infrastructure doesn't reason about
3574 // lifetime intrinsics and so we strip them (and the bitcasts+GEPs
3575 // leading to them) here. Eventually it should use them to optimize the
3576 // scalar values produced.
3577 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
3578 assert(II->getIntrinsicID() == Intrinsic::lifetime_start ||
3579 II->getIntrinsicID() == Intrinsic::lifetime_end);
3580 II->eraseFromParent();
3584 // Push the loads and stores we find onto the list. SROA will already
3585 // have validated that all loads and stores are viable candidates for
3587 if (LoadInst *LI = dyn_cast<LoadInst>(I)) {
3588 assert(LI->getType() == AI->getAllocatedType());
3589 Insts.push_back(LI);
3592 if (StoreInst *SI = dyn_cast<StoreInst>(I)) {
3593 assert(SI->getValueOperand()->getType() == AI->getAllocatedType());
3594 Insts.push_back(SI);
3598 // For everything else, we know that only no-op bitcasts and GEPs will
3599 // make it this far, just recurse through them and recall them for later
3601 DeadInsts.push_back(I);
3602 enqueueUsersInWorklist(*I, Worklist, Visited);
3604 AllocaPromoter(Insts, SSA, *AI, DIB).run(Insts);
3605 while (!DeadInsts.empty())
3606 DeadInsts.pop_back_val()->eraseFromParent();
3607 AI->eraseFromParent();
3610 PromotableAllocas.clear();
3615 /// \brief A predicate to test whether an alloca belongs to a set.
3616 class IsAllocaInSet {
3617 typedef SmallPtrSet<AllocaInst *, 4> SetType;
3621 typedef AllocaInst *argument_type;
3623 IsAllocaInSet(const SetType &Set) : Set(Set) {}
3624 bool operator()(AllocaInst *AI) const { return Set.count(AI); }
3628 bool SROA::runOnFunction(Function &F) {
3629 if (skipOptnoneFunction(F))
3632 DEBUG(dbgs() << "SROA function: " << F.getName() << "\n");
3633 C = &F.getContext();
3634 DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>();
3636 DEBUG(dbgs() << " Skipping SROA -- no target data!\n");
3639 DL = &DLP->getDataLayout();
3640 DominatorTreeWrapperPass *DTWP =
3641 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
3642 DT = DTWP ? &DTWP->getDomTree() : 0;
3644 BasicBlock &EntryBB = F.getEntryBlock();
3645 for (BasicBlock::iterator I = EntryBB.begin(), E = llvm::prior(EntryBB.end());
3647 if (AllocaInst *AI = dyn_cast<AllocaInst>(I))
3648 Worklist.insert(AI);
3650 bool Changed = false;
3651 // A set of deleted alloca instruction pointers which should be removed from
3652 // the list of promotable allocas.
3653 SmallPtrSet<AllocaInst *, 4> DeletedAllocas;
3656 while (!Worklist.empty()) {
3657 Changed |= runOnAlloca(*Worklist.pop_back_val());
3658 deleteDeadInstructions(DeletedAllocas);
3660 // Remove the deleted allocas from various lists so that we don't try to
3661 // continue processing them.
3662 if (!DeletedAllocas.empty()) {
3663 Worklist.remove_if(IsAllocaInSet(DeletedAllocas));
3664 PostPromotionWorklist.remove_if(IsAllocaInSet(DeletedAllocas));
3665 PromotableAllocas.erase(std::remove_if(PromotableAllocas.begin(),
3666 PromotableAllocas.end(),
3667 IsAllocaInSet(DeletedAllocas)),
3668 PromotableAllocas.end());
3669 DeletedAllocas.clear();
3673 Changed |= promoteAllocas(F);
3675 Worklist = PostPromotionWorklist;
3676 PostPromotionWorklist.clear();
3677 } while (!Worklist.empty());
3682 void SROA::getAnalysisUsage(AnalysisUsage &AU) const {
3683 if (RequiresDomTree)
3684 AU.addRequired<DominatorTreeWrapperPass>();
3685 AU.setPreservesCFG();