LLVM  10.0.0svn
MemorySSA.cpp
Go to the documentation of this file.
1 //===- MemorySSA.cpp - Memory SSA Builder ---------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file implements the MemorySSA class.
10 //
11 //===----------------------------------------------------------------------===//
12 
14 #include "llvm/ADT/DenseMap.h"
15 #include "llvm/ADT/DenseMapInfo.h"
16 #include "llvm/ADT/DenseSet.h"
18 #include "llvm/ADT/Hashing.h"
19 #include "llvm/ADT/None.h"
20 #include "llvm/ADT/Optional.h"
21 #include "llvm/ADT/STLExtras.h"
22 #include "llvm/ADT/SmallPtrSet.h"
23 #include "llvm/ADT/SmallVector.h"
24 #include "llvm/ADT/iterator.h"
29 #include "llvm/Config/llvm-config.h"
31 #include "llvm/IR/BasicBlock.h"
32 #include "llvm/IR/Dominators.h"
33 #include "llvm/IR/Function.h"
34 #include "llvm/IR/Instruction.h"
35 #include "llvm/IR/Instructions.h"
36 #include "llvm/IR/IntrinsicInst.h"
37 #include "llvm/IR/Intrinsics.h"
38 #include "llvm/IR/LLVMContext.h"
39 #include "llvm/IR/PassManager.h"
40 #include "llvm/IR/Use.h"
41 #include "llvm/Pass.h"
43 #include "llvm/Support/Casting.h"
45 #include "llvm/Support/Compiler.h"
46 #include "llvm/Support/Debug.h"
50 #include <algorithm>
51 #include <cassert>
52 #include <cstdlib>
53 #include <iterator>
54 #include <memory>
55 #include <utility>
56 
57 using namespace llvm;
58 
59 #define DEBUG_TYPE "memoryssa"
60 
61 INITIALIZE_PASS_BEGIN(MemorySSAWrapperPass, "memoryssa", "Memory SSA", false,
62  true)
66  true)
67 
69  "Memory SSA Printer", false, false)
70 INITIALIZE_PASS_DEPENDENCY(MemorySSAWrapperPass)
71 INITIALIZE_PASS_END(MemorySSAPrinterLegacyPass, "print-memoryssa",
72  "Memory SSA Printer", false, false)
73 
74 static cl::opt<unsigned> MaxCheckLimit(
75  "memssa-check-limit", cl::Hidden, cl::init(100),
76  cl::desc("The maximum number of stores/phis MemorySSA"
77  "will consider trying to walk past (default = 100)"));
78 
79 // Always verify MemorySSA if expensive checking is enabled.
80 #ifdef EXPENSIVE_CHECKS
81 bool llvm::VerifyMemorySSA = true;
82 #else
83 bool llvm::VerifyMemorySSA = false;
84 #endif
85 /// Enables memory ssa as a dependency for loop passes in legacy pass manager.
87  "enable-mssa-loop-dependency", cl::Hidden, cl::init(true),
88  cl::desc("Enable MemorySSA dependency for loop pass manager"));
89 
91  VerifyMemorySSAX("verify-memoryssa", cl::location(VerifyMemorySSA),
92  cl::Hidden, cl::desc("Enable verification of MemorySSA."));
93 
94 namespace llvm {
95 
96 /// An assembly annotator class to print Memory SSA information in
97 /// comments.
99  friend class MemorySSA;
100 
101  const MemorySSA *MSSA;
102 
103 public:
104  MemorySSAAnnotatedWriter(const MemorySSA *M) : MSSA(M) {}
105 
107  formatted_raw_ostream &OS) override {
108  if (MemoryAccess *MA = MSSA->getMemoryAccess(BB))
109  OS << "; " << *MA << "\n";
110  }
111 
113  formatted_raw_ostream &OS) override {
114  if (MemoryAccess *MA = MSSA->getMemoryAccess(I))
115  OS << "; " << *MA << "\n";
116  }
117 };
118 
119 } // end namespace llvm
120 
121 namespace {
122 
123 /// Our current alias analysis API differentiates heavily between calls and
124 /// non-calls, and functions called on one usually assert on the other.
125 /// This class encapsulates the distinction to simplify other code that wants
126 /// "Memory affecting instructions and related data" to use as a key.
127 /// For example, this class is used as a densemap key in the use optimizer.
128 class MemoryLocOrCall {
129 public:
130  bool IsCall = false;
131 
132  MemoryLocOrCall(MemoryUseOrDef *MUD)
133  : MemoryLocOrCall(MUD->getMemoryInst()) {}
134  MemoryLocOrCall(const MemoryUseOrDef *MUD)
135  : MemoryLocOrCall(MUD->getMemoryInst()) {}
136 
137  MemoryLocOrCall(Instruction *Inst) {
138  if (auto *C = dyn_cast<CallBase>(Inst)) {
139  IsCall = true;
140  Call = C;
141  } else {
142  IsCall = false;
143  // There is no such thing as a memorylocation for a fence inst, and it is
144  // unique in that regard.
145  if (!isa<FenceInst>(Inst))
146  Loc = MemoryLocation::get(Inst);
147  }
148  }
149 
150  explicit MemoryLocOrCall(const MemoryLocation &Loc) : Loc(Loc) {}
151 
152  const CallBase *getCall() const {
153  assert(IsCall);
154  return Call;
155  }
156 
157  MemoryLocation getLoc() const {
158  assert(!IsCall);
159  return Loc;
160  }
161 
162  bool operator==(const MemoryLocOrCall &Other) const {
163  if (IsCall != Other.IsCall)
164  return false;
165 
166  if (!IsCall)
167  return Loc == Other.Loc;
168 
169  if (Call->getCalledValue() != Other.Call->getCalledValue())
170  return false;
171 
172  return Call->arg_size() == Other.Call->arg_size() &&
173  std::equal(Call->arg_begin(), Call->arg_end(),
174  Other.Call->arg_begin());
175  }
176 
177 private:
178  union {
179  const CallBase *Call;
180  MemoryLocation Loc;
181  };
182 };
183 
184 } // end anonymous namespace
185 
186 namespace llvm {
187 
188 template <> struct DenseMapInfo<MemoryLocOrCall> {
189  static inline MemoryLocOrCall getEmptyKey() {
190  return MemoryLocOrCall(DenseMapInfo<MemoryLocation>::getEmptyKey());
191  }
192 
193  static inline MemoryLocOrCall getTombstoneKey() {
194  return MemoryLocOrCall(DenseMapInfo<MemoryLocation>::getTombstoneKey());
195  }
196 
197  static unsigned getHashValue(const MemoryLocOrCall &MLOC) {
198  if (!MLOC.IsCall)
199  return hash_combine(
200  MLOC.IsCall,
202 
203  hash_code hash =
205  MLOC.getCall()->getCalledValue()));
206 
207  for (const Value *Arg : MLOC.getCall()->args())
209  return hash;
210  }
211 
212  static bool isEqual(const MemoryLocOrCall &LHS, const MemoryLocOrCall &RHS) {
213  return LHS == RHS;
214  }
215 };
216 
217 } // end namespace llvm
218 
219 /// This does one-way checks to see if Use could theoretically be hoisted above
220 /// MayClobber. This will not check the other way around.
221 ///
222 /// This assumes that, for the purposes of MemorySSA, Use comes directly after
223 /// MayClobber, with no potentially clobbering operations in between them.
224 /// (Where potentially clobbering ops are memory barriers, aliased stores, etc.)
225 static bool areLoadsReorderable(const LoadInst *Use,
226  const LoadInst *MayClobber) {
227  bool VolatileUse = Use->isVolatile();
228  bool VolatileClobber = MayClobber->isVolatile();
229  // Volatile operations may never be reordered with other volatile operations.
230  if (VolatileUse && VolatileClobber)
231  return false;
232  // Otherwise, volatile doesn't matter here. From the language reference:
233  // 'optimizers may change the order of volatile operations relative to
234  // non-volatile operations.'"
235 
236  // If a load is seq_cst, it cannot be moved above other loads. If its ordering
237  // is weaker, it can be moved above other loads. We just need to be sure that
238  // MayClobber isn't an acquire load, because loads can't be moved above
239  // acquire loads.
240  //
241  // Note that this explicitly *does* allow the free reordering of monotonic (or
242  // weaker) loads of the same address.
243  bool SeqCstUse = Use->getOrdering() == AtomicOrdering::SequentiallyConsistent;
244  bool MayClobberIsAcquire = isAtLeastOrStrongerThan(MayClobber->getOrdering(),
246  return !(SeqCstUse || MayClobberIsAcquire);
247 }
248 
249 namespace {
250 
251 struct ClobberAlias {
252  bool IsClobber;
254 };
255 
256 } // end anonymous namespace
257 
258 // Return a pair of {IsClobber (bool), AR (AliasResult)}. It relies on AR being
259 // ignored if IsClobber = false.
260 template <typename AliasAnalysisType>
261 static ClobberAlias
263  const Instruction *UseInst, AliasAnalysisType &AA) {
264  Instruction *DefInst = MD->getMemoryInst();
265  assert(DefInst && "Defining instruction not actually an instruction");
266  const auto *UseCall = dyn_cast<CallBase>(UseInst);
268 
269  if (const IntrinsicInst *II = dyn_cast<IntrinsicInst>(DefInst)) {
270  // These intrinsics will show up as affecting memory, but they are just
271  // markers, mostly.
272  //
273  // FIXME: We probably don't actually want MemorySSA to model these at all
274  // (including creating MemoryAccesses for them): we just end up inventing
275  // clobbers where they don't really exist at all. Please see D43269 for
276  // context.
277  switch (II->getIntrinsicID()) {
278  case Intrinsic::lifetime_start:
279  if (UseCall)
280  return {false, NoAlias};
281  AR = AA.alias(MemoryLocation(II->getArgOperand(1)), UseLoc);
282  return {AR != NoAlias, AR};
283  case Intrinsic::lifetime_end:
284  case Intrinsic::invariant_start:
285  case Intrinsic::invariant_end:
286  case Intrinsic::assume:
287  return {false, NoAlias};
288  case Intrinsic::dbg_addr:
289  case Intrinsic::dbg_declare:
290  case Intrinsic::dbg_label:
291  case Intrinsic::dbg_value:
292  llvm_unreachable("debuginfo shouldn't have associated defs!");
293  default:
294  break;
295  }
296  }
297 
298  if (UseCall) {
299  ModRefInfo I = AA.getModRefInfo(DefInst, UseCall);
300  AR = isMustSet(I) ? MustAlias : MayAlias;
301  return {isModOrRefSet(I), AR};
302  }
303 
304  if (auto *DefLoad = dyn_cast<LoadInst>(DefInst))
305  if (auto *UseLoad = dyn_cast<LoadInst>(UseInst))
306  return {!areLoadsReorderable(UseLoad, DefLoad), MayAlias};
307 
308  ModRefInfo I = AA.getModRefInfo(DefInst, UseLoc);
309  AR = isMustSet(I) ? MustAlias : MayAlias;
310  return {isModSet(I), AR};
311 }
312 
313 template <typename AliasAnalysisType>
314 static ClobberAlias instructionClobbersQuery(MemoryDef *MD,
315  const MemoryUseOrDef *MU,
316  const MemoryLocOrCall &UseMLOC,
317  AliasAnalysisType &AA) {
318  // FIXME: This is a temporary hack to allow a single instructionClobbersQuery
319  // to exist while MemoryLocOrCall is pushed through places.
320  if (UseMLOC.IsCall)
322  AA);
323  return instructionClobbersQuery(MD, UseMLOC.getLoc(), MU->getMemoryInst(),
324  AA);
325 }
326 
327 // Return true when MD may alias MU, return false otherwise.
329  AliasAnalysis &AA) {
330  return instructionClobbersQuery(MD, MU, MemoryLocOrCall(MU), AA).IsClobber;
331 }
332 
333 namespace {
334 
335 struct UpwardsMemoryQuery {
336  // True if our original query started off as a call
337  bool IsCall = false;
338  // The pointer location we started the query with. This will be empty if
339  // IsCall is true.
340  MemoryLocation StartingLoc;
341  // This is the instruction we were querying about.
342  const Instruction *Inst = nullptr;
343  // The MemoryAccess we actually got called with, used to test local domination
344  const MemoryAccess *OriginalAccess = nullptr;
346  bool SkipSelfAccess = false;
347 
348  UpwardsMemoryQuery() = default;
349 
350  UpwardsMemoryQuery(const Instruction *Inst, const MemoryAccess *Access)
351  : IsCall(isa<CallBase>(Inst)), Inst(Inst), OriginalAccess(Access) {
352  if (!IsCall)
353  StartingLoc = MemoryLocation::get(Inst);
354  }
355 };
356 
357 } // end anonymous namespace
358 
359 static bool lifetimeEndsAt(MemoryDef *MD, const MemoryLocation &Loc,
360  BatchAAResults &AA) {
361  Instruction *Inst = MD->getMemoryInst();
362  if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Inst)) {
363  switch (II->getIntrinsicID()) {
364  case Intrinsic::lifetime_end:
365  return AA.alias(MemoryLocation(II->getArgOperand(1)), Loc) == MustAlias;
366  default:
367  return false;
368  }
369  }
370  return false;
371 }
372 
373 template <typename AliasAnalysisType>
374 static bool isUseTriviallyOptimizableToLiveOnEntry(AliasAnalysisType &AA,
375  const Instruction *I) {
376  // If the memory can't be changed, then loads of the memory can't be
377  // clobbered.
378  return isa<LoadInst>(I) && (I->hasMetadata(LLVMContext::MD_invariant_load) ||
379  AA.pointsToConstantMemory(MemoryLocation(
380  cast<LoadInst>(I)->getPointerOperand())));
381 }
382 
383 /// Verifies that `Start` is clobbered by `ClobberAt`, and that nothing
384 /// inbetween `Start` and `ClobberAt` can clobbers `Start`.
385 ///
386 /// This is meant to be as simple and self-contained as possible. Because it
387 /// uses no cache, etc., it can be relatively expensive.
388 ///
389 /// \param Start The MemoryAccess that we want to walk from.
390 /// \param ClobberAt A clobber for Start.
391 /// \param StartLoc The MemoryLocation for Start.
392 /// \param MSSA The MemorySSA instance that Start and ClobberAt belong to.
393 /// \param Query The UpwardsMemoryQuery we used for our search.
394 /// \param AA The AliasAnalysis we used for our search.
395 /// \param AllowImpreciseClobber Always false, unless we do relaxed verify.
396 
397 template <typename AliasAnalysisType>
398 LLVM_ATTRIBUTE_UNUSED static void
400  const MemoryLocation &StartLoc, const MemorySSA &MSSA,
401  const UpwardsMemoryQuery &Query, AliasAnalysisType &AA,
402  bool AllowImpreciseClobber = false) {
403  assert(MSSA.dominates(ClobberAt, Start) && "Clobber doesn't dominate start?");
404 
405  if (MSSA.isLiveOnEntryDef(Start)) {
406  assert(MSSA.isLiveOnEntryDef(ClobberAt) &&
407  "liveOnEntry must clobber itself");
408  return;
409  }
410 
411  bool FoundClobber = false;
414  Worklist.emplace_back(Start, StartLoc);
415  // Walk all paths from Start to ClobberAt, while looking for clobbers. If one
416  // is found, complain.
417  while (!Worklist.empty()) {
418  auto MAP = Worklist.pop_back_val();
419  // All we care about is that nothing from Start to ClobberAt clobbers Start.
420  // We learn nothing from revisiting nodes.
421  if (!VisitedPhis.insert(MAP).second)
422  continue;
423 
424  for (const auto *MA : def_chain(MAP.first)) {
425  if (MA == ClobberAt) {
426  if (const auto *MD = dyn_cast<MemoryDef>(MA)) {
427  // instructionClobbersQuery isn't essentially free, so don't use `|=`,
428  // since it won't let us short-circuit.
429  //
430  // Also, note that this can't be hoisted out of the `Worklist` loop,
431  // since MD may only act as a clobber for 1 of N MemoryLocations.
432  FoundClobber = FoundClobber || MSSA.isLiveOnEntryDef(MD);
433  if (!FoundClobber) {
434  ClobberAlias CA =
435  instructionClobbersQuery(MD, MAP.second, Query.Inst, AA);
436  if (CA.IsClobber) {
437  FoundClobber = true;
438  // Not used: CA.AR;
439  }
440  }
441  }
442  break;
443  }
444 
445  // We should never hit liveOnEntry, unless it's the clobber.
446  assert(!MSSA.isLiveOnEntryDef(MA) && "Hit liveOnEntry before clobber?");
447 
448  if (const auto *MD = dyn_cast<MemoryDef>(MA)) {
449  // If Start is a Def, skip self.
450  if (MD == Start)
451  continue;
452 
453  assert(!instructionClobbersQuery(MD, MAP.second, Query.Inst, AA)
454  .IsClobber &&
455  "Found clobber before reaching ClobberAt!");
456  continue;
457  }
458 
459  if (const auto *MU = dyn_cast<MemoryUse>(MA)) {
460  (void)MU;
461  assert (MU == Start &&
462  "Can only find use in def chain if Start is a use");
463  continue;
464  }
465 
466  assert(isa<MemoryPhi>(MA));
467  Worklist.append(
468  upward_defs_begin({const_cast<MemoryAccess *>(MA), MAP.second}),
469  upward_defs_end());
470  }
471  }
472 
473  // If the verify is done following an optimization, it's possible that
474  // ClobberAt was a conservative clobbering, that we can now infer is not a
475  // true clobbering access. Don't fail the verify if that's the case.
476  // We do have accesses that claim they're optimized, but could be optimized
477  // further. Updating all these can be expensive, so allow it for now (FIXME).
478  if (AllowImpreciseClobber)
479  return;
480 
481  // If ClobberAt is a MemoryPhi, we can assume something above it acted as a
482  // clobber. Otherwise, `ClobberAt` should've acted as a clobber at some point.
483  assert((isa<MemoryPhi>(ClobberAt) || FoundClobber) &&
484  "ClobberAt never acted as a clobber");
485 }
486 
487 namespace {
488 
489 /// Our algorithm for walking (and trying to optimize) clobbers, all wrapped up
490 /// in one class.
491 template <class AliasAnalysisType> class ClobberWalker {
492  /// Save a few bytes by using unsigned instead of size_t.
493  using ListIndex = unsigned;
494 
495  /// Represents a span of contiguous MemoryDefs, potentially ending in a
496  /// MemoryPhi.
497  struct DefPath {
498  MemoryLocation Loc;
499  // Note that, because we always walk in reverse, Last will always dominate
500  // First. Also note that First and Last are inclusive.
501  MemoryAccess *First;
502  MemoryAccess *Last;
503  Optional<ListIndex> Previous;
504 
505  DefPath(const MemoryLocation &Loc, MemoryAccess *First, MemoryAccess *Last,
506  Optional<ListIndex> Previous)
507  : Loc(Loc), First(First), Last(Last), Previous(Previous) {}
508 
509  DefPath(const MemoryLocation &Loc, MemoryAccess *Init,
510  Optional<ListIndex> Previous)
511  : DefPath(Loc, Init, Init, Previous) {}
512  };
513 
514  const MemorySSA &MSSA;
515  AliasAnalysisType &AA;
516  DominatorTree &DT;
517  UpwardsMemoryQuery *Query;
518  unsigned *UpwardWalkLimit;
519 
520  // Phi optimization bookkeeping
523 
524  /// Find the nearest def or phi that `From` can legally be optimized to.
525  const MemoryAccess *getWalkTarget(const MemoryPhi *From) const {
526  assert(From->getNumOperands() && "Phi with no operands?");
527 
528  BasicBlock *BB = From->getBlock();
529  MemoryAccess *Result = MSSA.getLiveOnEntryDef();
530  DomTreeNode *Node = DT.getNode(BB);
531  while ((Node = Node->getIDom())) {
532  auto *Defs = MSSA.getBlockDefs(Node->getBlock());
533  if (Defs)
534  return &*Defs->rbegin();
535  }
536  return Result;
537  }
538 
539  /// Result of calling walkToPhiOrClobber.
540  struct UpwardsWalkResult {
541  /// The "Result" of the walk. Either a clobber, the last thing we walked, or
542  /// both. Include alias info when clobber found.
543  MemoryAccess *Result;
544  bool IsKnownClobber;
546  };
547 
548  /// Walk to the next Phi or Clobber in the def chain starting at Desc.Last.
549  /// This will update Desc.Last as it walks. It will (optionally) also stop at
550  /// StopAt.
551  ///
552  /// This does not test for whether StopAt is a clobber
553  UpwardsWalkResult
554  walkToPhiOrClobber(DefPath &Desc, const MemoryAccess *StopAt = nullptr,
555  const MemoryAccess *SkipStopAt = nullptr) const {
556  assert(!isa<MemoryUse>(Desc.Last) && "Uses don't exist in my world");
557  assert(UpwardWalkLimit && "Need a valid walk limit");
558  bool LimitAlreadyReached = false;
559  // (*UpwardWalkLimit) may be 0 here, due to the loop in tryOptimizePhi. Set
560  // it to 1. This will not do any alias() calls. It either returns in the
561  // first iteration in the loop below, or is set back to 0 if all def chains
562  // are free of MemoryDefs.
563  if (!*UpwardWalkLimit) {
564  *UpwardWalkLimit = 1;
565  LimitAlreadyReached = true;
566  }
567 
568  for (MemoryAccess *Current : def_chain(Desc.Last)) {
569  Desc.Last = Current;
570  if (Current == StopAt || Current == SkipStopAt)
571  return {Current, false, MayAlias};
572 
573  if (auto *MD = dyn_cast<MemoryDef>(Current)) {
574  if (MSSA.isLiveOnEntryDef(MD))
575  return {MD, true, MustAlias};
576 
577  if (!--*UpwardWalkLimit)
578  return {Current, true, MayAlias};
579 
580  ClobberAlias CA =
581  instructionClobbersQuery(MD, Desc.Loc, Query->Inst, AA);
582  if (CA.IsClobber)
583  return {MD, true, CA.AR};
584  }
585  }
586 
587  if (LimitAlreadyReached)
588  *UpwardWalkLimit = 0;
589 
590  assert(isa<MemoryPhi>(Desc.Last) &&
591  "Ended at a non-clobber that's not a phi?");
592  return {Desc.Last, false, MayAlias};
593  }
594 
595  void addSearches(MemoryPhi *Phi, SmallVectorImpl<ListIndex> &PausedSearches,
596  ListIndex PriorNode) {
597  auto UpwardDefs = make_range(upward_defs_begin({Phi, Paths[PriorNode].Loc}),
598  upward_defs_end());
599  for (const MemoryAccessPair &P : UpwardDefs) {
600  PausedSearches.push_back(Paths.size());
601  Paths.emplace_back(P.second, P.first, PriorNode);
602  }
603  }
604 
605  /// Represents a search that terminated after finding a clobber. This clobber
606  /// may or may not be present in the path of defs from LastNode..SearchStart,
607  /// since it may have been retrieved from cache.
608  struct TerminatedPath {
609  MemoryAccess *Clobber;
610  ListIndex LastNode;
611  };
612 
613  /// Get an access that keeps us from optimizing to the given phi.
614  ///
615  /// PausedSearches is an array of indices into the Paths array. Its incoming
616  /// value is the indices of searches that stopped at the last phi optimization
617  /// target. It's left in an unspecified state.
618  ///
619  /// If this returns None, NewPaused is a vector of searches that terminated
620  /// at StopWhere. Otherwise, NewPaused is left in an unspecified state.
622  getBlockingAccess(const MemoryAccess *StopWhere,
623  SmallVectorImpl<ListIndex> &PausedSearches,
624  SmallVectorImpl<ListIndex> &NewPaused,
625  SmallVectorImpl<TerminatedPath> &Terminated) {
626  assert(!PausedSearches.empty() && "No searches to continue?");
627 
628  // BFS vs DFS really doesn't make a difference here, so just do a DFS with
629  // PausedSearches as our stack.
630  while (!PausedSearches.empty()) {
631  ListIndex PathIndex = PausedSearches.pop_back_val();
632  DefPath &Node = Paths[PathIndex];
633 
634  // If we've already visited this path with this MemoryLocation, we don't
635  // need to do so again.
636  //
637  // NOTE: That we just drop these paths on the ground makes caching
638  // behavior sporadic. e.g. given a diamond:
639  // A
640  // B C
641  // D
642  //
643  // ...If we walk D, B, A, C, we'll only cache the result of phi
644  // optimization for A, B, and D; C will be skipped because it dies here.
645  // This arguably isn't the worst thing ever, since:
646  // - We generally query things in a top-down order, so if we got below D
647  // without needing cache entries for {C, MemLoc}, then chances are
648  // that those cache entries would end up ultimately unused.
649  // - We still cache things for A, so C only needs to walk up a bit.
650  // If this behavior becomes problematic, we can fix without a ton of extra
651  // work.
652  if (!VisitedPhis.insert({Node.Last, Node.Loc}).second)
653  continue;
654 
655  const MemoryAccess *SkipStopWhere = nullptr;
656  if (Query->SkipSelfAccess && Node.Loc == Query->StartingLoc) {
657  assert(isa<MemoryDef>(Query->OriginalAccess));
658  SkipStopWhere = Query->OriginalAccess;
659  }
660 
661  UpwardsWalkResult Res = walkToPhiOrClobber(Node,
662  /*StopAt=*/StopWhere,
663  /*SkipStopAt=*/SkipStopWhere);
664  if (Res.IsKnownClobber) {
665  assert(Res.Result != StopWhere && Res.Result != SkipStopWhere);
666 
667  // If this wasn't a cache hit, we hit a clobber when walking. That's a
668  // failure.
669  TerminatedPath Term{Res.Result, PathIndex};
670  if (!MSSA.dominates(Res.Result, StopWhere))
671  return Term;
672 
673  // Otherwise, it's a valid thing to potentially optimize to.
674  Terminated.push_back(Term);
675  continue;
676  }
677 
678  if (Res.Result == StopWhere || Res.Result == SkipStopWhere) {
679  // We've hit our target. Save this path off for if we want to continue
680  // walking. If we are in the mode of skipping the OriginalAccess, and
681  // we've reached back to the OriginalAccess, do not save path, we've
682  // just looped back to self.
683  if (Res.Result != SkipStopWhere)
684  NewPaused.push_back(PathIndex);
685  continue;
686  }
687 
688  assert(!MSSA.isLiveOnEntryDef(Res.Result) && "liveOnEntry is a clobber");
689  addSearches(cast<MemoryPhi>(Res.Result), PausedSearches, PathIndex);
690  }
691 
692  return None;
693  }
694 
695  template <typename T, typename Walker>
696  struct generic_def_path_iterator
697  : public iterator_facade_base<generic_def_path_iterator<T, Walker>,
698  std::forward_iterator_tag, T *> {
699  generic_def_path_iterator() {}
700  generic_def_path_iterator(Walker *W, ListIndex N) : W(W), N(N) {}
701 
702  T &operator*() const { return curNode(); }
703 
704  generic_def_path_iterator &operator++() {
705  N = curNode().Previous;
706  return *this;
707  }
708 
709  bool operator==(const generic_def_path_iterator &O) const {
710  if (N.hasValue() != O.N.hasValue())
711  return false;
712  return !N.hasValue() || *N == *O.N;
713  }
714 
715  private:
716  T &curNode() const { return W->Paths[*N]; }
717 
718  Walker *W = nullptr;
720  };
721 
722  using def_path_iterator = generic_def_path_iterator<DefPath, ClobberWalker>;
723  using const_def_path_iterator =
724  generic_def_path_iterator<const DefPath, const ClobberWalker>;
725 
726  iterator_range<def_path_iterator> def_path(ListIndex From) {
727  return make_range(def_path_iterator(this, From), def_path_iterator());
728  }
729 
730  iterator_range<const_def_path_iterator> const_def_path(ListIndex From) const {
731  return make_range(const_def_path_iterator(this, From),
732  const_def_path_iterator());
733  }
734 
735  struct OptznResult {
736  /// The path that contains our result.
737  TerminatedPath PrimaryClobber;
738  /// The paths that we can legally cache back from, but that aren't
739  /// necessarily the result of the Phi optimization.
740  SmallVector<TerminatedPath, 4> OtherClobbers;
741  };
742 
743  ListIndex defPathIndex(const DefPath &N) const {
744  // The assert looks nicer if we don't need to do &N
745  const DefPath *NP = &N;
746  assert(!Paths.empty() && NP >= &Paths.front() && NP <= &Paths.back() &&
747  "Out of bounds DefPath!");
748  return NP - &Paths.front();
749  }
750 
751  /// Try to optimize a phi as best as we can. Returns a SmallVector of Paths
752  /// that act as legal clobbers. Note that this won't return *all* clobbers.
753  ///
754  /// Phi optimization algorithm tl;dr:
755  /// - Find the earliest def/phi, A, we can optimize to
756  /// - Find if all paths from the starting memory access ultimately reach A
757  /// - If not, optimization isn't possible.
758  /// - Otherwise, walk from A to another clobber or phi, A'.
759  /// - If A' is a def, we're done.
760  /// - If A' is a phi, try to optimize it.
761  ///
762  /// A path is a series of {MemoryAccess, MemoryLocation} pairs. A path
763  /// terminates when a MemoryAccess that clobbers said MemoryLocation is found.
764  OptznResult tryOptimizePhi(MemoryPhi *Phi, MemoryAccess *Start,
765  const MemoryLocation &Loc) {
766  assert(Paths.empty() && VisitedPhis.empty() &&
767  "Reset the optimization state.");
768 
769  Paths.emplace_back(Loc, Start, Phi, None);
770  // Stores how many "valid" optimization nodes we had prior to calling
771  // addSearches/getBlockingAccess. Necessary for caching if we had a blocker.
772  auto PriorPathsSize = Paths.size();
773 
774  SmallVector<ListIndex, 16> PausedSearches;
775  SmallVector<ListIndex, 8> NewPaused;
776  SmallVector<TerminatedPath, 4> TerminatedPaths;
777 
778  addSearches(Phi, PausedSearches, 0);
779 
780  // Moves the TerminatedPath with the "most dominated" Clobber to the end of
781  // Paths.
782  auto MoveDominatedPathToEnd = [&](SmallVectorImpl<TerminatedPath> &Paths) {
783  assert(!Paths.empty() && "Need a path to move");
784  auto Dom = Paths.begin();
785  for (auto I = std::next(Dom), E = Paths.end(); I != E; ++I)
786  if (!MSSA.dominates(I->Clobber, Dom->Clobber))
787  Dom = I;
788  auto Last = Paths.end() - 1;
789  if (Last != Dom)
790  std::iter_swap(Last, Dom);
791  };
792 
793  MemoryPhi *Current = Phi;
794  while (true) {
795  assert(!MSSA.isLiveOnEntryDef(Current) &&
796  "liveOnEntry wasn't treated as a clobber?");
797 
798  const auto *Target = getWalkTarget(Current);
799  // If a TerminatedPath doesn't dominate Target, then it wasn't a legal
800  // optimization for the prior phi.
801  assert(all_of(TerminatedPaths, [&](const TerminatedPath &P) {
802  return MSSA.dominates(P.Clobber, Target);
803  }));
804 
805  // FIXME: This is broken, because the Blocker may be reported to be
806  // liveOnEntry, and we'll happily wait for that to disappear (read: never)
807  // For the moment, this is fine, since we do nothing with blocker info.
808  if (Optional<TerminatedPath> Blocker = getBlockingAccess(
809  Target, PausedSearches, NewPaused, TerminatedPaths)) {
810 
811  // Find the node we started at. We can't search based on N->Last, since
812  // we may have gone around a loop with a different MemoryLocation.
813  auto Iter = find_if(def_path(Blocker->LastNode), [&](const DefPath &N) {
814  return defPathIndex(N) < PriorPathsSize;
815  });
816  assert(Iter != def_path_iterator());
817 
818  DefPath &CurNode = *Iter;
819  assert(CurNode.Last == Current);
820 
821  // Two things:
822  // A. We can't reliably cache all of NewPaused back. Consider a case
823  // where we have two paths in NewPaused; one of which can't optimize
824  // above this phi, whereas the other can. If we cache the second path
825  // back, we'll end up with suboptimal cache entries. We can handle
826  // cases like this a bit better when we either try to find all
827  // clobbers that block phi optimization, or when our cache starts
828  // supporting unfinished searches.
829  // B. We can't reliably cache TerminatedPaths back here without doing
830  // extra checks; consider a case like:
831  // T
832  // / \
833  // D C
834  // \ /
835  // S
836  // Where T is our target, C is a node with a clobber on it, D is a
837  // diamond (with a clobber *only* on the left or right node, N), and
838  // S is our start. Say we walk to D, through the node opposite N
839  // (read: ignoring the clobber), and see a cache entry in the top
840  // node of D. That cache entry gets put into TerminatedPaths. We then
841  // walk up to C (N is later in our worklist), find the clobber, and
842  // quit. If we append TerminatedPaths to OtherClobbers, we'll cache
843  // the bottom part of D to the cached clobber, ignoring the clobber
844  // in N. Again, this problem goes away if we start tracking all
845  // blockers for a given phi optimization.
846  TerminatedPath Result{CurNode.Last, defPathIndex(CurNode)};
847  return {Result, {}};
848  }
849 
850  // If there's nothing left to search, then all paths led to valid clobbers
851  // that we got from our cache; pick the nearest to the start, and allow
852  // the rest to be cached back.
853  if (NewPaused.empty()) {
854  MoveDominatedPathToEnd(TerminatedPaths);
855  TerminatedPath Result = TerminatedPaths.pop_back_val();
856  return {Result, std::move(TerminatedPaths)};
857  }
858 
859  MemoryAccess *DefChainEnd = nullptr;
861  for (ListIndex Paused : NewPaused) {
862  UpwardsWalkResult WR = walkToPhiOrClobber(Paths[Paused]);
863  if (WR.IsKnownClobber)
864  Clobbers.push_back({WR.Result, Paused});
865  else
866  // Micro-opt: If we hit the end of the chain, save it.
867  DefChainEnd = WR.Result;
868  }
869 
870  if (!TerminatedPaths.empty()) {
871  // If we couldn't find the dominating phi/liveOnEntry in the above loop,
872  // do it now.
873  if (!DefChainEnd)
874  for (auto *MA : def_chain(const_cast<MemoryAccess *>(Target)))
875  DefChainEnd = MA;
876 
877  // If any of the terminated paths don't dominate the phi we'll try to
878  // optimize, we need to figure out what they are and quit.
879  const BasicBlock *ChainBB = DefChainEnd->getBlock();
880  for (const TerminatedPath &TP : TerminatedPaths) {
881  // Because we know that DefChainEnd is as "high" as we can go, we
882  // don't need local dominance checks; BB dominance is sufficient.
883  if (DT.dominates(ChainBB, TP.Clobber->getBlock()))
884  Clobbers.push_back(TP);
885  }
886  }
887 
888  // If we have clobbers in the def chain, find the one closest to Current
889  // and quit.
890  if (!Clobbers.empty()) {
891  MoveDominatedPathToEnd(Clobbers);
892  TerminatedPath Result = Clobbers.pop_back_val();
893  return {Result, std::move(Clobbers)};
894  }
895 
896  assert(all_of(NewPaused,
897  [&](ListIndex I) { return Paths[I].Last == DefChainEnd; }));
898 
899  // Because liveOnEntry is a clobber, this must be a phi.
900  auto *DefChainPhi = cast<MemoryPhi>(DefChainEnd);
901 
902  PriorPathsSize = Paths.size();
903  PausedSearches.clear();
904  for (ListIndex I : NewPaused)
905  addSearches(DefChainPhi, PausedSearches, I);
906  NewPaused.clear();
907 
908  Current = DefChainPhi;
909  }
910  }
911 
912  void verifyOptResult(const OptznResult &R) const {
913  assert(all_of(R.OtherClobbers, [&](const TerminatedPath &P) {
914  return MSSA.dominates(P.Clobber, R.PrimaryClobber.Clobber);
915  }));
916  }
917 
918  void resetPhiOptznState() {
919  Paths.clear();
920  VisitedPhis.clear();
921  }
922 
923 public:
924  ClobberWalker(const MemorySSA &MSSA, AliasAnalysisType &AA, DominatorTree &DT)
925  : MSSA(MSSA), AA(AA), DT(DT) {}
926 
927  AliasAnalysisType *getAA() { return &AA; }
928  /// Finds the nearest clobber for the given query, optimizing phis if
929  /// possible.
930  MemoryAccess *findClobber(MemoryAccess *Start, UpwardsMemoryQuery &Q,
931  unsigned &UpWalkLimit) {
932  Query = &Q;
933  UpwardWalkLimit = &UpWalkLimit;
934  // Starting limit must be > 0.
935  if (!UpWalkLimit)
936  UpWalkLimit++;
937 
938  MemoryAccess *Current = Start;
939  // This walker pretends uses don't exist. If we're handed one, silently grab
940  // its def. (This has the nice side-effect of ensuring we never cache uses)
941  if (auto *MU = dyn_cast<MemoryUse>(Start))
942  Current = MU->getDefiningAccess();
943 
944  DefPath FirstDesc(Q.StartingLoc, Current, Current, None);
945  // Fast path for the overly-common case (no crazy phi optimization
946  // necessary)
947  UpwardsWalkResult WalkResult = walkToPhiOrClobber(FirstDesc);
948  MemoryAccess *Result;
949  if (WalkResult.IsKnownClobber) {
950  Result = WalkResult.Result;
951  Q.AR = WalkResult.AR;
952  } else {
953  OptznResult OptRes = tryOptimizePhi(cast<MemoryPhi>(FirstDesc.Last),
954  Current, Q.StartingLoc);
955  verifyOptResult(OptRes);
956  resetPhiOptznState();
957  Result = OptRes.PrimaryClobber.Clobber;
958  }
959 
960 #ifdef EXPENSIVE_CHECKS
961  if (!Q.SkipSelfAccess && *UpwardWalkLimit > 0)
962  checkClobberSanity(Current, Result, Q.StartingLoc, MSSA, Q, AA);
963 #endif
964  return Result;
965  }
966 };
967 
968 struct RenamePassData {
969  DomTreeNode *DTN;
971  MemoryAccess *IncomingVal;
972 
973  RenamePassData(DomTreeNode *D, DomTreeNode::const_iterator It,
974  MemoryAccess *M)
975  : DTN(D), ChildIt(It), IncomingVal(M) {}
976 
977  void swap(RenamePassData &RHS) {
978  std::swap(DTN, RHS.DTN);
979  std::swap(ChildIt, RHS.ChildIt);
980  std::swap(IncomingVal, RHS.IncomingVal);
981  }
982 };
983 
984 } // end anonymous namespace
985 
986 namespace llvm {
987 
988 template <class AliasAnalysisType> class MemorySSA::ClobberWalkerBase {
989  ClobberWalker<AliasAnalysisType> Walker;
990  MemorySSA *MSSA;
991 
992 public:
993  ClobberWalkerBase(MemorySSA *M, AliasAnalysisType *A, DominatorTree *D)
994  : Walker(*M, *A, *D), MSSA(M) {}
995 
996  MemoryAccess *getClobberingMemoryAccessBase(MemoryAccess *,
997  const MemoryLocation &,
998  unsigned &);
999  // Third argument (bool), defines whether the clobber search should skip the
1000  // original queried access. If true, there will be a follow-up query searching
1001  // for a clobber access past "self". Note that the Optimized access is not
1002  // updated if a new clobber is found by this SkipSelf search. If this
1003  // additional query becomes heavily used we may decide to cache the result.
1004  // Walker instantiations will decide how to set the SkipSelf bool.
1005  MemoryAccess *getClobberingMemoryAccessBase(MemoryAccess *, unsigned &, bool);
1006 };
1007 
1008 /// A MemorySSAWalker that does AA walks to disambiguate accesses. It no
1009 /// longer does caching on its own, but the name has been retained for the
1010 /// moment.
1011 template <class AliasAnalysisType>
1012 class MemorySSA::CachingWalker final : public MemorySSAWalker {
1013  ClobberWalkerBase<AliasAnalysisType> *Walker;
1014 
1015 public:
1016  CachingWalker(MemorySSA *M, ClobberWalkerBase<AliasAnalysisType> *W)
1017  : MemorySSAWalker(M), Walker(W) {}
1018  ~CachingWalker() override = default;
1019 
1021 
1022  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, unsigned &UWL) {
1023  return Walker->getClobberingMemoryAccessBase(MA, UWL, false);
1024  }
1025  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA,
1026  const MemoryLocation &Loc,
1027  unsigned &UWL) {
1028  return Walker->getClobberingMemoryAccessBase(MA, Loc, UWL);
1029  }
1030 
1031  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA) override {
1032  unsigned UpwardWalkLimit = MaxCheckLimit;
1033  return getClobberingMemoryAccess(MA, UpwardWalkLimit);
1034  }
1035  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA,
1036  const MemoryLocation &Loc) override {
1037  unsigned UpwardWalkLimit = MaxCheckLimit;
1038  return getClobberingMemoryAccess(MA, Loc, UpwardWalkLimit);
1039  }
1040 
1041  void invalidateInfo(MemoryAccess *MA) override {
1042  if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA))
1043  MUD->resetOptimized();
1044  }
1045 };
1046 
1047 template <class AliasAnalysisType>
1048 class MemorySSA::SkipSelfWalker final : public MemorySSAWalker {
1049  ClobberWalkerBase<AliasAnalysisType> *Walker;
1050 
1051 public:
1052  SkipSelfWalker(MemorySSA *M, ClobberWalkerBase<AliasAnalysisType> *W)
1053  : MemorySSAWalker(M), Walker(W) {}
1054  ~SkipSelfWalker() override = default;
1055 
1057 
1058  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA, unsigned &UWL) {
1059  return Walker->getClobberingMemoryAccessBase(MA, UWL, true);
1060  }
1061  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA,
1062  const MemoryLocation &Loc,
1063  unsigned &UWL) {
1064  return Walker->getClobberingMemoryAccessBase(MA, Loc, UWL);
1065  }
1066 
1067  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA) override {
1068  unsigned UpwardWalkLimit = MaxCheckLimit;
1069  return getClobberingMemoryAccess(MA, UpwardWalkLimit);
1070  }
1071  MemoryAccess *getClobberingMemoryAccess(MemoryAccess *MA,
1072  const MemoryLocation &Loc) override {
1073  unsigned UpwardWalkLimit = MaxCheckLimit;
1074  return getClobberingMemoryAccess(MA, Loc, UpwardWalkLimit);
1075  }
1076 
1077  void invalidateInfo(MemoryAccess *MA) override {
1078  if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA))
1079  MUD->resetOptimized();
1080  }
1081 };
1082 
1083 } // end namespace llvm
1084 
1085 void MemorySSA::renameSuccessorPhis(BasicBlock *BB, MemoryAccess *IncomingVal,
1086  bool RenameAllUses) {
1087  // Pass through values to our successors
1088  for (const BasicBlock *S : successors(BB)) {
1089  auto It = PerBlockAccesses.find(S);
1090  // Rename the phi nodes in our successor block
1091  if (It == PerBlockAccesses.end() || !isa<MemoryPhi>(It->second->front()))
1092  continue;
1093  AccessList *Accesses = It->second.get();
1094  auto *Phi = cast<MemoryPhi>(&Accesses->front());
1095  if (RenameAllUses) {
1096  bool ReplacementDone = false;
1097  for (unsigned I = 0, E = Phi->getNumIncomingValues(); I != E; ++I)
1098  if (Phi->getIncomingBlock(I) == BB) {
1099  Phi->setIncomingValue(I, IncomingVal);
1100  ReplacementDone = true;
1101  }
1102  (void) ReplacementDone;
1103  assert(ReplacementDone && "Incomplete phi during partial rename");
1104  } else
1105  Phi->addIncoming(IncomingVal, BB);
1106  }
1107 }
1108 
1109 /// Rename a single basic block into MemorySSA form.
1110 /// Uses the standard SSA renaming algorithm.
1111 /// \returns The new incoming value.
1112 MemoryAccess *MemorySSA::renameBlock(BasicBlock *BB, MemoryAccess *IncomingVal,
1113  bool RenameAllUses) {
1114  auto It = PerBlockAccesses.find(BB);
1115  // Skip most processing if the list is empty.
1116  if (It != PerBlockAccesses.end()) {
1117  AccessList *Accesses = It->second.get();
1118  for (MemoryAccess &L : *Accesses) {
1119  if (MemoryUseOrDef *MUD = dyn_cast<MemoryUseOrDef>(&L)) {
1120  if (MUD->getDefiningAccess() == nullptr || RenameAllUses)
1121  MUD->setDefiningAccess(IncomingVal);
1122  if (isa<MemoryDef>(&L))
1123  IncomingVal = &L;
1124  } else {
1125  IncomingVal = &L;
1126  }
1127  }
1128  }
1129  return IncomingVal;
1130 }
1131 
1132 /// This is the standard SSA renaming algorithm.
1133 ///
1134 /// We walk the dominator tree in preorder, renaming accesses, and then filling
1135 /// in phi nodes in our successors.
1136 void MemorySSA::renamePass(DomTreeNode *Root, MemoryAccess *IncomingVal,
1138  bool SkipVisited, bool RenameAllUses) {
1139  assert(Root && "Trying to rename accesses in an unreachable block");
1140 
1142  // Skip everything if we already renamed this block and we are skipping.
1143  // Note: You can't sink this into the if, because we need it to occur
1144  // regardless of whether we skip blocks or not.
1145  bool AlreadyVisited = !Visited.insert(Root->getBlock()).second;
1146  if (SkipVisited && AlreadyVisited)
1147  return;
1148 
1149  IncomingVal = renameBlock(Root->getBlock(), IncomingVal, RenameAllUses);
1150  renameSuccessorPhis(Root->getBlock(), IncomingVal, RenameAllUses);
1151  WorkStack.push_back({Root, Root->begin(), IncomingVal});
1152 
1153  while (!WorkStack.empty()) {
1154  DomTreeNode *Node = WorkStack.back().DTN;
1155  DomTreeNode::const_iterator ChildIt = WorkStack.back().ChildIt;
1156  IncomingVal = WorkStack.back().IncomingVal;
1157 
1158  if (ChildIt == Node->end()) {
1159  WorkStack.pop_back();
1160  } else {
1161  DomTreeNode *Child = *ChildIt;
1162  ++WorkStack.back().ChildIt;
1163  BasicBlock *BB = Child->getBlock();
1164  // Note: You can't sink this into the if, because we need it to occur
1165  // regardless of whether we skip blocks or not.
1166  AlreadyVisited = !Visited.insert(BB).second;
1167  if (SkipVisited && AlreadyVisited) {
1168  // We already visited this during our renaming, which can happen when
1169  // being asked to rename multiple blocks. Figure out the incoming val,
1170  // which is the last def.
1171  // Incoming value can only change if there is a block def, and in that
1172  // case, it's the last block def in the list.
1173  if (auto *BlockDefs = getWritableBlockDefs(BB))
1174  IncomingVal = &*BlockDefs->rbegin();
1175  } else
1176  IncomingVal = renameBlock(BB, IncomingVal, RenameAllUses);
1177  renameSuccessorPhis(BB, IncomingVal, RenameAllUses);
1178  WorkStack.push_back({Child, Child->begin(), IncomingVal});
1179  }
1180  }
1181 }
1182 
1183 /// This handles unreachable block accesses by deleting phi nodes in
1184 /// unreachable blocks, and marking all other unreachable MemoryAccess's as
1185 /// being uses of the live on entry definition.
1186 void MemorySSA::markUnreachableAsLiveOnEntry(BasicBlock *BB) {
1187  assert(!DT->isReachableFromEntry(BB) &&
1188  "Reachable block found while handling unreachable blocks");
1189 
1190  // Make sure phi nodes in our reachable successors end up with a
1191  // LiveOnEntryDef for our incoming edge, even though our block is forward
1192  // unreachable. We could just disconnect these blocks from the CFG fully,
1193  // but we do not right now.
1194  for (const BasicBlock *S : successors(BB)) {
1195  if (!DT->isReachableFromEntry(S))
1196  continue;
1197  auto It = PerBlockAccesses.find(S);
1198  // Rename the phi nodes in our successor block
1199  if (It == PerBlockAccesses.end() || !isa<MemoryPhi>(It->second->front()))
1200  continue;
1201  AccessList *Accesses = It->second.get();
1202  auto *Phi = cast<MemoryPhi>(&Accesses->front());
1203  Phi->addIncoming(LiveOnEntryDef.get(), BB);
1204  }
1205 
1206  auto It = PerBlockAccesses.find(BB);
1207  if (It == PerBlockAccesses.end())
1208  return;
1209 
1210  auto &Accesses = It->second;
1211  for (auto AI = Accesses->begin(), AE = Accesses->end(); AI != AE;) {
1212  auto Next = std::next(AI);
1213  // If we have a phi, just remove it. We are going to replace all
1214  // users with live on entry.
1215  if (auto *UseOrDef = dyn_cast<MemoryUseOrDef>(AI))
1216  UseOrDef->setDefiningAccess(LiveOnEntryDef.get());
1217  else
1218  Accesses->erase(AI);
1219  AI = Next;
1220  }
1221 }
1222 
1224  : AA(nullptr), DT(DT), F(Func), LiveOnEntryDef(nullptr), Walker(nullptr),
1225  SkipWalker(nullptr), NextID(0) {
1226  // Build MemorySSA using a batch alias analysis. This reuses the internal
1227  // state that AA collects during an alias()/getModRefInfo() call. This is
1228  // safe because there are no CFG changes while building MemorySSA and can
1229  // significantly reduce the time spent by the compiler in AA, because we will
1230  // make queries about all the instructions in the Function.
1231  BatchAAResults BatchAA(*AA);
1232  buildMemorySSA(BatchAA);
1233  // Intentionally leave AA to nullptr while building so we don't accidently
1234  // use non-batch AliasAnalysis.
1235  this->AA = AA;
1236  // Also create the walker here.
1237  getWalker();
1238 }
1239 
1241  // Drop all our references
1242  for (const auto &Pair : PerBlockAccesses)
1243  for (MemoryAccess &MA : *Pair.second)
1244  MA.dropAllReferences();
1245 }
1246 
1247 MemorySSA::AccessList *MemorySSA::getOrCreateAccessList(const BasicBlock *BB) {
1248  auto Res = PerBlockAccesses.insert(std::make_pair(BB, nullptr));
1249 
1250  if (Res.second)
1251  Res.first->second = std::make_unique<AccessList>();
1252  return Res.first->second.get();
1253 }
1254 
1255 MemorySSA::DefsList *MemorySSA::getOrCreateDefsList(const BasicBlock *BB) {
1256  auto Res = PerBlockDefs.insert(std::make_pair(BB, nullptr));
1257 
1258  if (Res.second)
1259  Res.first->second = std::make_unique<DefsList>();
1260  return Res.first->second.get();
1261 }
1262 
1263 namespace llvm {
1264 
1265 /// This class is a batch walker of all MemoryUse's in the program, and points
1266 /// their defining access at the thing that actually clobbers them. Because it
1267 /// is a batch walker that touches everything, it does not operate like the
1268 /// other walkers. This walker is basically performing a top-down SSA renaming
1269 /// pass, where the version stack is used as the cache. This enables it to be
1270 /// significantly more time and memory efficient than using the regular walker,
1271 /// which is walking bottom-up.
1273 public:
1274  OptimizeUses(MemorySSA *MSSA, CachingWalker<BatchAAResults> *Walker,
1275  BatchAAResults *BAA, DominatorTree *DT)
1276  : MSSA(MSSA), Walker(Walker), AA(BAA), DT(DT) {}
1277 
1278  void optimizeUses();
1279 
1280 private:
1281  /// This represents where a given memorylocation is in the stack.
1282  struct MemlocStackInfo {
1283  // This essentially is keeping track of versions of the stack. Whenever
1284  // the stack changes due to pushes or pops, these versions increase.
1285  unsigned long StackEpoch;
1286  unsigned long PopEpoch;
1287  // This is the lower bound of places on the stack to check. It is equal to
1288  // the place the last stack walk ended.
1289  // Note: Correctness depends on this being initialized to 0, which densemap
1290  // does
1291  unsigned long LowerBound;
1292  const BasicBlock *LowerBoundBlock;
1293  // This is where the last walk for this memory location ended.
1294  unsigned long LastKill;
1295  bool LastKillValid;
1297  };
1298 
1299  void optimizeUsesInBlock(const BasicBlock *, unsigned long &, unsigned long &,
1302 
1303  MemorySSA *MSSA;
1304  CachingWalker<BatchAAResults> *Walker;
1305  BatchAAResults *AA;
1306  DominatorTree *DT;
1307 };
1308 
1309 } // end namespace llvm
1310 
1311 /// Optimize the uses in a given block This is basically the SSA renaming
1312 /// algorithm, with one caveat: We are able to use a single stack for all
1313 /// MemoryUses. This is because the set of *possible* reaching MemoryDefs is
1314 /// the same for every MemoryUse. The *actual* clobbering MemoryDef is just
1315 /// going to be some position in that stack of possible ones.
1316 ///
1317 /// We track the stack positions that each MemoryLocation needs
1318 /// to check, and last ended at. This is because we only want to check the
1319 /// things that changed since last time. The same MemoryLocation should
1320 /// get clobbered by the same store (getModRefInfo does not use invariantness or
1321 /// things like this, and if they start, we can modify MemoryLocOrCall to
1322 /// include relevant data)
1323 void MemorySSA::OptimizeUses::optimizeUsesInBlock(
1324  const BasicBlock *BB, unsigned long &StackEpoch, unsigned long &PopEpoch,
1325  SmallVectorImpl<MemoryAccess *> &VersionStack,
1327 
1328  /// If no accesses, nothing to do.
1329  MemorySSA::AccessList *Accesses = MSSA->getWritableBlockAccesses(BB);
1330  if (Accesses == nullptr)
1331  return;
1332 
1333  // Pop everything that doesn't dominate the current block off the stack,
1334  // increment the PopEpoch to account for this.
1335  while (true) {
1336  assert(
1337  !VersionStack.empty() &&
1338  "Version stack should have liveOnEntry sentinel dominating everything");
1339  BasicBlock *BackBlock = VersionStack.back()->getBlock();
1340  if (DT->dominates(BackBlock, BB))
1341  break;
1342  while (VersionStack.back()->getBlock() == BackBlock)
1343  VersionStack.pop_back();
1344  ++PopEpoch;
1345  }
1346 
1347  for (MemoryAccess &MA : *Accesses) {
1348  auto *MU = dyn_cast<MemoryUse>(&MA);
1349  if (!MU) {
1350  VersionStack.push_back(&MA);
1351  ++StackEpoch;
1352  continue;
1353  }
1354 
1355  if (isUseTriviallyOptimizableToLiveOnEntry(*AA, MU->getMemoryInst())) {
1356  MU->setDefiningAccess(MSSA->getLiveOnEntryDef(), true, None);
1357  continue;
1358  }
1359 
1360  MemoryLocOrCall UseMLOC(MU);
1361  auto &LocInfo = LocStackInfo[UseMLOC];
1362  // If the pop epoch changed, it means we've removed stuff from top of
1363  // stack due to changing blocks. We may have to reset the lower bound or
1364  // last kill info.
1365  if (LocInfo.PopEpoch != PopEpoch) {
1366  LocInfo.PopEpoch = PopEpoch;
1367  LocInfo.StackEpoch = StackEpoch;
1368  // If the lower bound was in something that no longer dominates us, we
1369  // have to reset it.
1370  // We can't simply track stack size, because the stack may have had
1371  // pushes/pops in the meantime.
1372  // XXX: This is non-optimal, but only is slower cases with heavily
1373  // branching dominator trees. To get the optimal number of queries would
1374  // be to make lowerbound and lastkill a per-loc stack, and pop it until
1375  // the top of that stack dominates us. This does not seem worth it ATM.
1376  // A much cheaper optimization would be to always explore the deepest
1377  // branch of the dominator tree first. This will guarantee this resets on
1378  // the smallest set of blocks.
1379  if (LocInfo.LowerBoundBlock && LocInfo.LowerBoundBlock != BB &&
1380  !DT->dominates(LocInfo.LowerBoundBlock, BB)) {
1381  // Reset the lower bound of things to check.
1382  // TODO: Some day we should be able to reset to last kill, rather than
1383  // 0.
1384  LocInfo.LowerBound = 0;
1385  LocInfo.LowerBoundBlock = VersionStack[0]->getBlock();
1386  LocInfo.LastKillValid = false;
1387  }
1388  } else if (LocInfo.StackEpoch != StackEpoch) {
1389  // If all that has changed is the StackEpoch, we only have to check the
1390  // new things on the stack, because we've checked everything before. In
1391  // this case, the lower bound of things to check remains the same.
1392  LocInfo.PopEpoch = PopEpoch;
1393  LocInfo.StackEpoch = StackEpoch;
1394  }
1395  if (!LocInfo.LastKillValid) {
1396  LocInfo.LastKill = VersionStack.size() - 1;
1397  LocInfo.LastKillValid = true;
1398  LocInfo.AR = MayAlias;
1399  }
1400 
1401  // At this point, we should have corrected last kill and LowerBound to be
1402  // in bounds.
1403  assert(LocInfo.LowerBound < VersionStack.size() &&
1404  "Lower bound out of range");
1405  assert(LocInfo.LastKill < VersionStack.size() &&
1406  "Last kill info out of range");
1407  // In any case, the new upper bound is the top of the stack.
1408  unsigned long UpperBound = VersionStack.size() - 1;
1409 
1410  if (UpperBound - LocInfo.LowerBound > MaxCheckLimit) {
1411  LLVM_DEBUG(dbgs() << "MemorySSA skipping optimization of " << *MU << " ("
1412  << *(MU->getMemoryInst()) << ")"
1413  << " because there are "
1414  << UpperBound - LocInfo.LowerBound
1415  << " stores to disambiguate\n");
1416  // Because we did not walk, LastKill is no longer valid, as this may
1417  // have been a kill.
1418  LocInfo.LastKillValid = false;
1419  continue;
1420  }
1421  bool FoundClobberResult = false;
1422  unsigned UpwardWalkLimit = MaxCheckLimit;
1423  while (UpperBound > LocInfo.LowerBound) {
1424  if (isa<MemoryPhi>(VersionStack[UpperBound])) {
1425  // For phis, use the walker, see where we ended up, go there
1426  MemoryAccess *Result =
1427  Walker->getClobberingMemoryAccess(MU, UpwardWalkLimit);
1428  // We are guaranteed to find it or something is wrong
1429  while (VersionStack[UpperBound] != Result) {
1430  assert(UpperBound != 0);
1431  --UpperBound;
1432  }
1433  FoundClobberResult = true;
1434  break;
1435  }
1436 
1437  MemoryDef *MD = cast<MemoryDef>(VersionStack[UpperBound]);
1438  // If the lifetime of the pointer ends at this instruction, it's live on
1439  // entry.
1440  if (!UseMLOC.IsCall && lifetimeEndsAt(MD, UseMLOC.getLoc(), *AA)) {
1441  // Reset UpperBound to liveOnEntryDef's place in the stack
1442  UpperBound = 0;
1443  FoundClobberResult = true;
1444  LocInfo.AR = MustAlias;
1445  break;
1446  }
1447  ClobberAlias CA = instructionClobbersQuery(MD, MU, UseMLOC, *AA);
1448  if (CA.IsClobber) {
1449  FoundClobberResult = true;
1450  LocInfo.AR = CA.AR;
1451  break;
1452  }
1453  --UpperBound;
1454  }
1455 
1456  // Note: Phis always have AliasResult AR set to MayAlias ATM.
1457 
1458  // At the end of this loop, UpperBound is either a clobber, or lower bound
1459  // PHI walking may cause it to be < LowerBound, and in fact, < LastKill.
1460  if (FoundClobberResult || UpperBound < LocInfo.LastKill) {
1461  // We were last killed now by where we got to
1462  if (MSSA->isLiveOnEntryDef(VersionStack[UpperBound]))
1463  LocInfo.AR = None;
1464  MU->setDefiningAccess(VersionStack[UpperBound], true, LocInfo.AR);
1465  LocInfo.LastKill = UpperBound;
1466  } else {
1467  // Otherwise, we checked all the new ones, and now we know we can get to
1468  // LastKill.
1469  MU->setDefiningAccess(VersionStack[LocInfo.LastKill], true, LocInfo.AR);
1470  }
1471  LocInfo.LowerBound = VersionStack.size() - 1;
1472  LocInfo.LowerBoundBlock = BB;
1473  }
1474 }
1475 
1476 /// Optimize uses to point to their actual clobbering definitions.
1478  SmallVector<MemoryAccess *, 16> VersionStack;
1480  VersionStack.push_back(MSSA->getLiveOnEntryDef());
1481 
1482  unsigned long StackEpoch = 1;
1483  unsigned long PopEpoch = 1;
1484  // We perform a non-recursive top-down dominator tree walk.
1485  for (const auto *DomNode : depth_first(DT->getRootNode()))
1486  optimizeUsesInBlock(DomNode->getBlock(), StackEpoch, PopEpoch, VersionStack,
1487  LocStackInfo);
1488 }
1489 
1490 void MemorySSA::placePHINodes(
1491  const SmallPtrSetImpl<BasicBlock *> &DefiningBlocks) {
1492  // Determine where our MemoryPhi's should go
1493  ForwardIDFCalculator IDFs(*DT);
1494  IDFs.setDefiningBlocks(DefiningBlocks);
1496  IDFs.calculate(IDFBlocks);
1497 
1498  // Now place MemoryPhi nodes.
1499  for (auto &BB : IDFBlocks)
1500  createMemoryPhi(BB);
1501 }
1502 
1503 void MemorySSA::buildMemorySSA(BatchAAResults &BAA) {
1504  // We create an access to represent "live on entry", for things like
1505  // arguments or users of globals, where the memory they use is defined before
1506  // the beginning of the function. We do not actually insert it into the IR.
1507  // We do not define a live on exit for the immediate uses, and thus our
1508  // semantics do *not* imply that something with no immediate uses can simply
1509  // be removed.
1510  BasicBlock &StartingPoint = F.getEntryBlock();
1511  LiveOnEntryDef.reset(new MemoryDef(F.getContext(), nullptr, nullptr,
1512  &StartingPoint, NextID++));
1513 
1514  // We maintain lists of memory accesses per-block, trading memory for time. We
1515  // could just look up the memory access for every possible instruction in the
1516  // stream.
1517  SmallPtrSet<BasicBlock *, 32> DefiningBlocks;
1518  // Go through each block, figure out where defs occur, and chain together all
1519  // the accesses.
1520  for (BasicBlock &B : F) {
1521  bool InsertIntoDef = false;
1522  AccessList *Accesses = nullptr;
1523  DefsList *Defs = nullptr;
1524  for (Instruction &I : B) {
1525  MemoryUseOrDef *MUD = createNewAccess(&I, &BAA);
1526  if (!MUD)
1527  continue;
1528 
1529  if (!Accesses)
1530  Accesses = getOrCreateAccessList(&B);
1531  Accesses->push_back(MUD);
1532  if (isa<MemoryDef>(MUD)) {
1533  InsertIntoDef = true;
1534  if (!Defs)
1535  Defs = getOrCreateDefsList(&B);
1536  Defs->push_back(*MUD);
1537  }
1538  }
1539  if (InsertIntoDef)
1540  DefiningBlocks.insert(&B);
1541  }
1542  placePHINodes(DefiningBlocks);
1543 
1544  // Now do regular SSA renaming on the MemoryDef/MemoryUse. Visited will get
1545  // filled in with all blocks.
1547  renamePass(DT->getRootNode(), LiveOnEntryDef.get(), Visited);
1548 
1549  ClobberWalkerBase<BatchAAResults> WalkerBase(this, &BAA, DT);
1550  CachingWalker<BatchAAResults> WalkerLocal(this, &WalkerBase);
1551  OptimizeUses(this, &WalkerLocal, &BAA, DT).optimizeUses();
1552 
1553  // Mark the uses in unreachable blocks as live on entry, so that they go
1554  // somewhere.
1555  for (auto &BB : F)
1556  if (!Visited.count(&BB))
1557  markUnreachableAsLiveOnEntry(&BB);
1558 }
1559 
1560 MemorySSAWalker *MemorySSA::getWalker() { return getWalkerImpl(); }
1561 
1562 MemorySSA::CachingWalker<AliasAnalysis> *MemorySSA::getWalkerImpl() {
1563  if (Walker)
1564  return Walker.get();
1565 
1566  if (!WalkerBase)
1567  WalkerBase =
1568  std::make_unique<ClobberWalkerBase<AliasAnalysis>>(this, AA, DT);
1569 
1570  Walker =
1571  std::make_unique<CachingWalker<AliasAnalysis>>(this, WalkerBase.get());
1572  return Walker.get();
1573 }
1574 
1576  if (SkipWalker)
1577  return SkipWalker.get();
1578 
1579  if (!WalkerBase)
1580  WalkerBase =
1581  std::make_unique<ClobberWalkerBase<AliasAnalysis>>(this, AA, DT);
1582 
1583  SkipWalker =
1584  std::make_unique<SkipSelfWalker<AliasAnalysis>>(this, WalkerBase.get());
1585  return SkipWalker.get();
1586  }
1587 
1588 
1589 // This is a helper function used by the creation routines. It places NewAccess
1590 // into the access and defs lists for a given basic block, at the given
1591 // insertion point.
1593  const BasicBlock *BB,
1594  InsertionPlace Point) {
1595  auto *Accesses = getOrCreateAccessList(BB);
1596  if (Point == Beginning) {
1597  // If it's a phi node, it goes first, otherwise, it goes after any phi
1598  // nodes.
1599  if (isa<MemoryPhi>(NewAccess)) {
1600  Accesses->push_front(NewAccess);
1601  auto *Defs = getOrCreateDefsList(BB);
1602  Defs->push_front(*NewAccess);
1603  } else {
1604  auto AI = find_if_not(
1605  *Accesses, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); });
1606  Accesses->insert(AI, NewAccess);
1607  if (!isa<MemoryUse>(NewAccess)) {
1608  auto *Defs = getOrCreateDefsList(BB);
1609  auto DI = find_if_not(
1610  *Defs, [](const MemoryAccess &MA) { return isa<MemoryPhi>(MA); });
1611  Defs->insert(DI, *NewAccess);
1612  }
1613  }
1614  } else {
1615  Accesses->push_back(NewAccess);
1616  if (!isa<MemoryUse>(NewAccess)) {
1617  auto *Defs = getOrCreateDefsList(BB);
1618  Defs->push_back(*NewAccess);
1619  }
1620  }
1621  BlockNumberingValid.erase(BB);
1622 }
1623 
1625  AccessList::iterator InsertPt) {
1626  auto *Accesses = getWritableBlockAccesses(BB);
1627  bool WasEnd = InsertPt == Accesses->end();
1628  Accesses->insert(AccessList::iterator(InsertPt), What);
1629  if (!isa<MemoryUse>(What)) {
1630  auto *Defs = getOrCreateDefsList(BB);
1631  // If we got asked to insert at the end, we have an easy job, just shove it
1632  // at the end. If we got asked to insert before an existing def, we also get
1633  // an iterator. If we got asked to insert before a use, we have to hunt for
1634  // the next def.
1635  if (WasEnd) {
1636  Defs->push_back(*What);
1637  } else if (isa<MemoryDef>(InsertPt)) {
1638  Defs->insert(InsertPt->getDefsIterator(), *What);
1639  } else {
1640  while (InsertPt != Accesses->end() && !isa<MemoryDef>(InsertPt))
1641  ++InsertPt;
1642  // Either we found a def, or we are inserting at the end
1643  if (InsertPt == Accesses->end())
1644  Defs->push_back(*What);
1645  else
1646  Defs->insert(InsertPt->getDefsIterator(), *What);
1647  }
1648  }
1649  BlockNumberingValid.erase(BB);
1650 }
1651 
1652 void MemorySSA::prepareForMoveTo(MemoryAccess *What, BasicBlock *BB) {
1653  // Keep it in the lookup tables, remove from the lists
1654  removeFromLists(What, false);
1655 
1656  // Note that moving should implicitly invalidate the optimized state of a
1657  // MemoryUse (and Phis can't be optimized). However, it doesn't do so for a
1658  // MemoryDef.
1659  if (auto *MD = dyn_cast<MemoryDef>(What))
1660  MD->resetOptimized();
1661  What->setBlock(BB);
1662 }
1663 
1664 // Move What before Where in the IR. The end result is that What will belong to
1665 // the right lists and have the right Block set, but will not otherwise be
1666 // correct. It will not have the right defining access, and if it is a def,
1667 // things below it will not properly be updated.
1669  AccessList::iterator Where) {
1670  prepareForMoveTo(What, BB);
1671  insertIntoListsBefore(What, BB, Where);
1672 }
1673 
1675  InsertionPlace Point) {
1676  if (isa<MemoryPhi>(What)) {
1677  assert(Point == Beginning &&
1678  "Can only move a Phi at the beginning of the block");
1679  // Update lookup table entry
1680  ValueToMemoryAccess.erase(What->getBlock());
1681  bool Inserted = ValueToMemoryAccess.insert({BB, What}).second;
1682  (void)Inserted;
1683  assert(Inserted && "Cannot move a Phi to a block that already has one");
1684  }
1685 
1686  prepareForMoveTo(What, BB);
1687  insertIntoListsForBlock(What, BB, Point);
1688 }
1689 
1690 MemoryPhi *MemorySSA::createMemoryPhi(BasicBlock *BB) {
1691  assert(!getMemoryAccess(BB) && "MemoryPhi already exists for this BB");
1692  MemoryPhi *Phi = new MemoryPhi(BB->getContext(), BB, NextID++);
1693  // Phi's always are placed at the front of the block.
1695  ValueToMemoryAccess[BB] = Phi;
1696  return Phi;
1697 }
1698 
1700  MemoryAccess *Definition,
1701  const MemoryUseOrDef *Template,
1702  bool CreationMustSucceed) {
1703  assert(!isa<PHINode>(I) && "Cannot create a defined access for a PHI");
1704  MemoryUseOrDef *NewAccess = createNewAccess(I, AA, Template);
1705  if (CreationMustSucceed)
1706  assert(NewAccess != nullptr && "Tried to create a memory access for a "
1707  "non-memory touching instruction");
1708  if (NewAccess)
1709  NewAccess->setDefiningAccess(Definition);
1710  return NewAccess;
1711 }
1712 
1713 // Return true if the instruction has ordering constraints.
1714 // Note specifically that this only considers stores and loads
1715 // because others are still considered ModRef by getModRefInfo.
1716 static inline bool isOrdered(const Instruction *I) {
1717  if (auto *SI = dyn_cast<StoreInst>(I)) {
1718  if (!SI->isUnordered())
1719  return true;
1720  } else if (auto *LI = dyn_cast<LoadInst>(I)) {
1721  if (!LI->isUnordered())
1722  return true;
1723  }
1724  return false;
1725 }
1726 
1727 /// Helper function to create new memory accesses
1728 template <typename AliasAnalysisType>
1729 MemoryUseOrDef *MemorySSA::createNewAccess(Instruction *I,
1730  AliasAnalysisType *AAP,
1731  const MemoryUseOrDef *Template) {
1732  // The assume intrinsic has a control dependency which we model by claiming
1733  // that it writes arbitrarily. Debuginfo intrinsics may be considered
1734  // clobbers when we have a nonstandard AA pipeline. Ignore these fake memory
1735  // dependencies here.
1736  // FIXME: Replace this special casing with a more accurate modelling of
1737  // assume's control dependency.
1738  if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I))
1739  if (II->getIntrinsicID() == Intrinsic::assume || isa<DbgInfoIntrinsic>(II))
1740  return nullptr;
1741 
1742  bool Def, Use;
1743  if (Template) {
1744  Def = dyn_cast_or_null<MemoryDef>(Template) != nullptr;
1745  Use = dyn_cast_or_null<MemoryUse>(Template) != nullptr;
1746 #if !defined(NDEBUG)
1747  ModRefInfo ModRef = AAP->getModRefInfo(I, None);
1748  bool DefCheck, UseCheck;
1749  DefCheck = isModSet(ModRef) || isOrdered(I);
1750  UseCheck = isRefSet(ModRef);
1751  assert(Def == DefCheck && (Def || Use == UseCheck) && "Invalid template");
1752 #endif
1753  } else {
1754  // Find out what affect this instruction has on memory.
1755  ModRefInfo ModRef = AAP->getModRefInfo(I, None);
1756  // The isOrdered check is used to ensure that volatiles end up as defs
1757  // (atomics end up as ModRef right now anyway). Until we separate the
1758  // ordering chain from the memory chain, this enables people to see at least
1759  // some relative ordering to volatiles. Note that getClobberingMemoryAccess
1760  // will still give an answer that bypasses other volatile loads. TODO:
1761  // Separate memory aliasing and ordering into two different chains so that
1762  // we can precisely represent both "what memory will this read/write/is
1763  // clobbered by" and "what instructions can I move this past".
1764  Def = isModSet(ModRef) || isOrdered(I);
1765  Use = isRefSet(ModRef);
1766  }
1767 
1768  // It's possible for an instruction to not modify memory at all. During
1769  // construction, we ignore them.
1770  if (!Def && !Use)
1771  return nullptr;
1772 
1773  MemoryUseOrDef *MUD;
1774  if (Def)
1775  MUD = new MemoryDef(I->getContext(), nullptr, I, I->getParent(), NextID++);
1776  else
1777  MUD = new MemoryUse(I->getContext(), nullptr, I, I->getParent());
1778  ValueToMemoryAccess[I] = MUD;
1779  return MUD;
1780 }
1781 
1782 /// Returns true if \p Replacer dominates \p Replacee .
1783 bool MemorySSA::dominatesUse(const MemoryAccess *Replacer,
1784  const MemoryAccess *Replacee) const {
1785  if (isa<MemoryUseOrDef>(Replacee))
1786  return DT->dominates(Replacer->getBlock(), Replacee->getBlock());
1787  const auto *MP = cast<MemoryPhi>(Replacee);
1788  // For a phi node, the use occurs in the predecessor block of the phi node.
1789  // Since we may occur multiple times in the phi node, we have to check each
1790  // operand to ensure Replacer dominates each operand where Replacee occurs.
1791  for (const Use &Arg : MP->operands()) {
1792  if (Arg.get() != Replacee &&
1793  !DT->dominates(Replacer->getBlock(), MP->getIncomingBlock(Arg)))
1794  return false;
1795  }
1796  return true;
1797 }
1798 
1799 /// Properly remove \p MA from all of MemorySSA's lookup tables.
1801  assert(MA->use_empty() &&
1802  "Trying to remove memory access that still has uses");
1803  BlockNumbering.erase(MA);
1804  if (auto *MUD = dyn_cast<MemoryUseOrDef>(MA))
1805  MUD->setDefiningAccess(nullptr);
1806  // Invalidate our walker's cache if necessary
1807  if (!isa<MemoryUse>(MA))
1808  getWalker()->invalidateInfo(MA);
1809 
1810  Value *MemoryInst;
1811  if (const auto *MUD = dyn_cast<MemoryUseOrDef>(MA))
1812  MemoryInst = MUD->getMemoryInst();
1813  else
1814  MemoryInst = MA->getBlock();
1815 
1816  auto VMA = ValueToMemoryAccess.find(MemoryInst);
1817  if (VMA->second == MA)
1818  ValueToMemoryAccess.erase(VMA);
1819 }
1820 
1821 /// Properly remove \p MA from all of MemorySSA's lists.
1822 ///
1823 /// Because of the way the intrusive list and use lists work, it is important to
1824 /// do removal in the right order.
1825 /// ShouldDelete defaults to true, and will cause the memory access to also be
1826 /// deleted, not just removed.
1827 void MemorySSA::removeFromLists(MemoryAccess *MA, bool ShouldDelete) {
1828  BasicBlock *BB = MA->getBlock();
1829  // The access list owns the reference, so we erase it from the non-owning list
1830  // first.
1831  if (!isa<MemoryUse>(MA)) {
1832  auto DefsIt = PerBlockDefs.find(BB);
1833  std::unique_ptr<DefsList> &Defs = DefsIt->second;
1834  Defs->remove(*MA);
1835  if (Defs->empty())
1836  PerBlockDefs.erase(DefsIt);
1837  }
1838 
1839  // The erase call here will delete it. If we don't want it deleted, we call
1840  // remove instead.
1841  auto AccessIt = PerBlockAccesses.find(BB);
1842  std::unique_ptr<AccessList> &Accesses = AccessIt->second;
1843  if (ShouldDelete)
1844  Accesses->erase(MA);
1845  else
1846  Accesses->remove(MA);
1847 
1848  if (Accesses->empty()) {
1849  PerBlockAccesses.erase(AccessIt);
1850  BlockNumberingValid.erase(BB);
1851  }
1852 }
1853 
1855  MemorySSAAnnotatedWriter Writer(this);
1856  F.print(OS, &Writer);
1857 }
1858 
1859 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1861 #endif
1862 
1864  verifyDefUses(F);
1866  verifyOrdering(F);
1869  // Previously, the verification used to also verify that the clobberingAccess
1870  // cached by MemorySSA is the same as the clobberingAccess found at a later
1871  // query to AA. This does not hold true in general due to the current fragility
1872  // of BasicAA which has arbitrary caps on the things it analyzes before giving
1873  // up. As a result, transformations that are correct, will lead to BasicAA
1874  // returning different Alias answers before and after that transformation.
1875  // Invalidating MemorySSA is not an option, as the results in BasicAA can be so
1876  // random, in the worst case we'd need to rebuild MemorySSA from scratch after
1877  // every transformation, which defeats the purpose of using it. For such an
1878  // example, see test4 added in D51960.
1879 }
1880 
1882 #if !defined(NDEBUG) && defined(EXPENSIVE_CHECKS)
1883  for (const BasicBlock &BB : F) {
1884  if (MemoryPhi *Phi = getMemoryAccess(&BB)) {
1885  for (unsigned I = 0, E = Phi->getNumIncomingValues(); I != E; ++I) {
1886  auto *Pred = Phi->getIncomingBlock(I);
1887  auto *IncAcc = Phi->getIncomingValue(I);
1888  // If Pred has no unreachable predecessors, get last def looking at
1889  // IDoms. If, while walkings IDoms, any of these has an unreachable
1890  // predecessor, then the incoming def can be any access.
1891  if (auto *DTNode = DT->getNode(Pred)) {
1892  while (DTNode) {
1893  if (auto *DefList = getBlockDefs(DTNode->getBlock())) {
1894  auto *LastAcc = &*(--DefList->end());
1895  assert(LastAcc == IncAcc &&
1896  "Incorrect incoming access into phi.");
1897  break;
1898  }
1899  DTNode = DTNode->getIDom();
1900  }
1901  } else {
1902  // If Pred has unreachable predecessors, but has at least a Def, the
1903  // incoming access can be the last Def in Pred, or it could have been
1904  // optimized to LoE. After an update, though, the LoE may have been
1905  // replaced by another access, so IncAcc may be any access.
1906  // If Pred has unreachable predecessors and no Defs, incoming access
1907  // should be LoE; However, after an update, it may be any access.
1908  }
1909  }
1910  }
1911  }
1912 #endif
1913 }
1914 
1915 /// Verify that all of the blocks we believe to have valid domination numbers
1916 /// actually have valid domination numbers.
1918 #ifndef NDEBUG
1919  if (BlockNumberingValid.empty())
1920  return;
1921 
1922  SmallPtrSet<const BasicBlock *, 16> ValidBlocks = BlockNumberingValid;
1923  for (const BasicBlock &BB : F) {
1924  if (!ValidBlocks.count(&BB))
1925  continue;
1926 
1927  ValidBlocks.erase(&BB);
1928 
1929  const AccessList *Accesses = getBlockAccesses(&BB);
1930  // It's correct to say an empty block has valid numbering.
1931  if (!Accesses)
1932  continue;
1933 
1934  // Block numbering starts at 1.
1935  unsigned long LastNumber = 0;
1936  for (const MemoryAccess &MA : *Accesses) {
1937  auto ThisNumberIter = BlockNumbering.find(&MA);
1938  assert(ThisNumberIter != BlockNumbering.end() &&
1939  "MemoryAccess has no domination number in a valid block!");
1940 
1941  unsigned long ThisNumber = ThisNumberIter->second;
1942  assert(ThisNumber > LastNumber &&
1943  "Domination numbers should be strictly increasing!");
1944  LastNumber = ThisNumber;
1945  }
1946  }
1947 
1948  assert(ValidBlocks.empty() &&
1949  "All valid BasicBlocks should exist in F -- dangling pointers?");
1950 #endif
1951 }
1952 
1953 /// Verify that the order and existence of MemoryAccesses matches the
1954 /// order and existence of memory affecting instructions.
1956 #ifndef NDEBUG
1957  // Walk all the blocks, comparing what the lookups think and what the access
1958  // lists think, as well as the order in the blocks vs the order in the access
1959  // lists.
1960  SmallVector<MemoryAccess *, 32> ActualAccesses;
1962  for (BasicBlock &B : F) {
1963  const AccessList *AL = getBlockAccesses(&B);
1964  const auto *DL = getBlockDefs(&B);
1965  MemoryAccess *Phi = getMemoryAccess(&B);
1966  if (Phi) {
1967  ActualAccesses.push_back(Phi);
1968  ActualDefs.push_back(Phi);
1969  }
1970 
1971  for (Instruction &I : B) {
1972  MemoryAccess *MA = getMemoryAccess(&I);
1973  assert((!MA || (AL && (isa<MemoryUse>(MA) || DL))) &&
1974  "We have memory affecting instructions "
1975  "in this block but they are not in the "
1976  "access list or defs list");
1977  if (MA) {
1978  ActualAccesses.push_back(MA);
1979  if (isa<MemoryDef>(MA))
1980  ActualDefs.push_back(MA);
1981  }
1982  }
1983  // Either we hit the assert, really have no accesses, or we have both
1984  // accesses and an access list.
1985  // Same with defs.
1986  if (!AL && !DL)
1987  continue;
1988  assert(AL->size() == ActualAccesses.size() &&
1989  "We don't have the same number of accesses in the block as on the "
1990  "access list");
1991  assert((DL || ActualDefs.size() == 0) &&
1992  "Either we should have a defs list, or we should have no defs");
1993  assert((!DL || DL->size() == ActualDefs.size()) &&
1994  "We don't have the same number of defs in the block as on the "
1995  "def list");
1996  auto ALI = AL->begin();
1997  auto AAI = ActualAccesses.begin();
1998  while (ALI != AL->end() && AAI != ActualAccesses.end()) {
1999  assert(&*ALI == *AAI && "Not the same accesses in the same order");
2000  ++ALI;
2001  ++AAI;
2002  }
2003  ActualAccesses.clear();
2004  if (DL) {
2005  auto DLI = DL->begin();
2006  auto ADI = ActualDefs.begin();
2007  while (DLI != DL->end() && ADI != ActualDefs.end()) {
2008  assert(&*DLI == *ADI && "Not the same defs in the same order");
2009  ++DLI;
2010  ++ADI;
2011  }
2012  }
2013  ActualDefs.clear();
2014  }
2015 #endif
2016 }
2017 
2018 /// Verify the domination properties of MemorySSA by checking that each
2019 /// definition dominates all of its uses.
2021 #ifndef NDEBUG
2022  for (BasicBlock &B : F) {
2023  // Phi nodes are attached to basic blocks
2024  if (MemoryPhi *MP = getMemoryAccess(&B))
2025  for (const Use &U : MP->uses())
2026  assert(dominates(MP, U) && "Memory PHI does not dominate it's uses");
2027 
2028  for (Instruction &I : B) {
2029  MemoryAccess *MD = dyn_cast_or_null<MemoryDef>(getMemoryAccess(&I));
2030  if (!MD)
2031  continue;
2032 
2033  for (const Use &U : MD->uses())
2034  assert(dominates(MD, U) && "Memory Def does not dominate it's uses");
2035  }
2036  }
2037 #endif
2038 }
2039 
2040 /// Verify the def-use lists in MemorySSA, by verifying that \p Use
2041 /// appears in the use list of \p Def.
2042 void MemorySSA::verifyUseInDefs(MemoryAccess *Def, MemoryAccess *Use) const {
2043 #ifndef NDEBUG
2044  // The live on entry use may cause us to get a NULL def here
2045  if (!Def)
2046  assert(isLiveOnEntryDef(Use) &&
2047  "Null def but use not point to live on entry def");
2048  else
2049  assert(is_contained(Def->users(), Use) &&
2050  "Did not find use in def's use list");
2051 #endif
2052 }
2053 
2054 /// Verify the immediate use information, by walking all the memory
2055 /// accesses and verifying that, for each use, it appears in the
2056 /// appropriate def's use list
2058 #if !defined(NDEBUG) && defined(EXPENSIVE_CHECKS)
2059  for (BasicBlock &B : F) {
2060  // Phi nodes are attached to basic blocks
2061  if (MemoryPhi *Phi = getMemoryAccess(&B)) {
2062  assert(Phi->getNumOperands() == static_cast<unsigned>(std::distance(
2063  pred_begin(&B), pred_end(&B))) &&
2064  "Incomplete MemoryPhi Node");
2065  for (unsigned I = 0, E = Phi->getNumIncomingValues(); I != E; ++I) {
2066  verifyUseInDefs(Phi->getIncomingValue(I), Phi);
2067  assert(find(predecessors(&B), Phi->getIncomingBlock(I)) !=
2068  pred_end(&B) &&
2069  "Incoming phi block not a block predecessor");
2070  }
2071  }
2072 
2073  for (Instruction &I : B) {
2074  if (MemoryUseOrDef *MA = getMemoryAccess(&I)) {
2075  verifyUseInDefs(MA->getDefiningAccess(), MA);
2076  }
2077  }
2078  }
2079 #endif
2080 }
2081 
2082 /// Perform a local numbering on blocks so that instruction ordering can be
2083 /// determined in constant time.
2084 /// TODO: We currently just number in order. If we numbered by N, we could
2085 /// allow at least N-1 sequences of insertBefore or insertAfter (and at least
2086 /// log2(N) sequences of mixed before and after) without needing to invalidate
2087 /// the numbering.
2088 void MemorySSA::renumberBlock(const BasicBlock *B) const {
2089  // The pre-increment ensures the numbers really start at 1.
2090  unsigned long CurrentNumber = 0;
2091  const AccessList *AL = getBlockAccesses(B);
2092  assert(AL != nullptr && "Asking to renumber an empty block");
2093  for (const auto &I : *AL)
2094  BlockNumbering[&I] = ++CurrentNumber;
2095  BlockNumberingValid.insert(B);
2096 }
2097 
2098 /// Determine, for two memory accesses in the same block,
2099 /// whether \p Dominator dominates \p Dominatee.
2100 /// \returns True if \p Dominator dominates \p Dominatee.
2102  const MemoryAccess *Dominatee) const {
2103  const BasicBlock *DominatorBlock = Dominator->getBlock();
2104 
2105  assert((DominatorBlock == Dominatee->getBlock()) &&
2106  "Asking for local domination when accesses are in different blocks!");
2107  // A node dominates itself.
2108  if (Dominatee == Dominator)
2109  return true;
2110 
2111  // When Dominatee is defined on function entry, it is not dominated by another
2112  // memory access.
2113  if (isLiveOnEntryDef(Dominatee))
2114  return false;
2115 
2116  // When Dominator is defined on function entry, it dominates the other memory
2117  // access.
2118  if (isLiveOnEntryDef(Dominator))
2119  return true;
2120 
2121  if (!BlockNumberingValid.count(DominatorBlock))
2122  renumberBlock(DominatorBlock);
2123 
2124  unsigned long DominatorNum = BlockNumbering.lookup(Dominator);
2125  // All numbers start with 1
2126  assert(DominatorNum != 0 && "Block was not numbered properly");
2127  unsigned long DominateeNum = BlockNumbering.lookup(Dominatee);
2128  assert(DominateeNum != 0 && "Block was not numbered properly");
2129  return DominatorNum < DominateeNum;
2130 }
2131 
2132 bool MemorySSA::dominates(const MemoryAccess *Dominator,
2133  const MemoryAccess *Dominatee) const {
2134  if (Dominator == Dominatee)
2135  return true;
2136 
2137  if (isLiveOnEntryDef(Dominatee))
2138  return false;
2139 
2140  if (Dominator->getBlock() != Dominatee->getBlock())
2141  return DT->dominates(Dominator->getBlock(), Dominatee->getBlock());
2142  return locallyDominates(Dominator, Dominatee);
2143 }
2144 
2145 bool MemorySSA::dominates(const MemoryAccess *Dominator,
2146  const Use &Dominatee) const {
2147  if (MemoryPhi *MP = dyn_cast<MemoryPhi>(Dominatee.getUser())) {
2148  BasicBlock *UseBB = MP->getIncomingBlock(Dominatee);
2149  // The def must dominate the incoming block of the phi.
2150  if (UseBB != Dominator->getBlock())
2151  return DT->dominates(Dominator->getBlock(), UseBB);
2152  // If the UseBB and the DefBB are the same, compare locally.
2153  return locallyDominates(Dominator, cast<MemoryAccess>(Dominatee));
2154  }
2155  // If it's not a PHI node use, the normal dominates can already handle it.
2156  return dominates(Dominator, cast<MemoryAccess>(Dominatee.getUser()));
2157 }
2158 
2159 const static char LiveOnEntryStr[] = "liveOnEntry";
2160 
2162  switch (getValueID()) {
2163  case MemoryPhiVal: return static_cast<const MemoryPhi *>(this)->print(OS);
2164  case MemoryDefVal: return static_cast<const MemoryDef *>(this)->print(OS);
2165  case MemoryUseVal: return static_cast<const MemoryUse *>(this)->print(OS);
2166  }
2167  llvm_unreachable("invalid value id");
2168 }
2169 
2171  MemoryAccess *UO = getDefiningAccess();
2172 
2173  auto printID = [&OS](MemoryAccess *A) {
2174  if (A && A->getID())
2175  OS << A->getID();
2176  else
2177  OS << LiveOnEntryStr;
2178  };
2179 
2180  OS << getID() << " = MemoryDef(";
2181  printID(UO);
2182  OS << ")";
2183 
2184  if (isOptimized()) {
2185  OS << "->";
2186  printID(getOptimized());
2187 
2188  if (Optional<AliasResult> AR = getOptimizedAccessType())
2189  OS << " " << *AR;
2190  }
2191 }
2192 
2194  bool First = true;
2195  OS << getID() << " = MemoryPhi(";
2196  for (const auto &Op : operands()) {
2197  BasicBlock *BB = getIncomingBlock(Op);
2198  MemoryAccess *MA = cast<MemoryAccess>(Op);
2199  if (!First)
2200  OS << ',';
2201  else
2202  First = false;
2203 
2204  OS << '{';
2205  if (BB->hasName())
2206  OS << BB->getName();
2207  else
2208  BB->printAsOperand(OS, false);
2209  OS << ',';
2210  if (unsigned ID = MA->getID())
2211  OS << ID;
2212  else
2213  OS << LiveOnEntryStr;
2214  OS << '}';
2215  }
2216  OS << ')';
2217 }
2218 
2220  MemoryAccess *UO = getDefiningAccess();
2221  OS << "MemoryUse(";
2222  if (UO && UO->getID())
2223  OS << UO->getID();
2224  else
2225  OS << LiveOnEntryStr;
2226  OS << ')';
2227 
2228  if (Optional<AliasResult> AR = getOptimizedAccessType())
2229  OS << " " << *AR;
2230 }
2231 
2232 void MemoryAccess::dump() const {
2233 // Cannot completely remove virtual function even in release mode.
2234 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2235  print(dbgs());
2236  dbgs() << "\n";
2237 #endif
2238 }
2239 
2241 
2244 }
2245 
2247  AU.setPreservesAll();
2248  AU.addRequired<MemorySSAWrapperPass>();
2249 }
2250 
2252  auto &MSSA = getAnalysis<MemorySSAWrapperPass>().getMSSA();
2253  MSSA.print(dbgs());
2254  if (VerifyMemorySSA)
2255  MSSA.verifyMemorySSA();
2256  return false;
2257 }
2258 
2259 AnalysisKey MemorySSAAnalysis::Key;
2260 
2263  auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
2264  auto &AA = AM.getResult<AAManager>(F);
2265  return MemorySSAAnalysis::Result(std::make_unique<MemorySSA>(F, &AA, &DT));
2266 }
2267 
2269  Function &F, const PreservedAnalyses &PA,
2271  auto PAC = PA.getChecker<MemorySSAAnalysis>();
2272  return !(PAC.preserved() || PAC.preservedSet<AllAnalysesOn<Function>>()) ||
2273  Inv.invalidate<AAManager>(F, PA) ||
2274  Inv.invalidate<DominatorTreeAnalysis>(F, PA);
2275 }
2276 
2279  OS << "MemorySSA for function: " << F.getName() << "\n";
2280  AM.getResult<MemorySSAAnalysis>(F).getMSSA().print(OS);
2281 
2282  return PreservedAnalyses::all();
2283 }
2284 
2287  AM.getResult<MemorySSAAnalysis>(F).getMSSA().verifyMemorySSA();
2288 
2289  return PreservedAnalyses::all();
2290 }
2291 
2292 char MemorySSAWrapperPass::ID = 0;
2293 
2296 }
2297 
2298 void MemorySSAWrapperPass::releaseMemory() { MSSA.reset(); }
2299 
2301  AU.setPreservesAll();
2304 }
2305 
2307  auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
2308  auto &AA = getAnalysis<AAResultsWrapperPass>().getAAResults();
2309  MSSA.reset(new MemorySSA(F, &AA, &DT));
2310  return false;
2311 }
2312 
2313 void MemorySSAWrapperPass::verifyAnalysis() const { MSSA->verifyMemorySSA(); }
2314 
2316  MSSA->print(OS);
2317 }
2318 
2320 
2321 /// Walk the use-def chains starting at \p StartingAccess and find
2322 /// the MemoryAccess that actually clobbers Loc.
2323 ///
2324 /// \returns our clobbering memory access
2325 template <typename AliasAnalysisType>
2326 MemoryAccess *
2327 MemorySSA::ClobberWalkerBase<AliasAnalysisType>::getClobberingMemoryAccessBase(
2328  MemoryAccess *StartingAccess, const MemoryLocation &Loc,
2329  unsigned &UpwardWalkLimit) {
2330  if (isa<MemoryPhi>(StartingAccess))
2331  return StartingAccess;
2332 
2333  auto *StartingUseOrDef = cast<MemoryUseOrDef>(StartingAccess);
2334  if (MSSA->isLiveOnEntryDef(StartingUseOrDef))
2335  return StartingUseOrDef;
2336 
2337  Instruction *I = StartingUseOrDef->getMemoryInst();
2338 
2339  // Conservatively, fences are always clobbers, so don't perform the walk if we
2340  // hit a fence.
2341  if (!isa<CallBase>(I) && I->isFenceLike())
2342  return StartingUseOrDef;
2343 
2344  UpwardsMemoryQuery Q;
2345  Q.OriginalAccess = StartingUseOrDef;
2346  Q.StartingLoc = Loc;
2347  Q.Inst = I;
2348  Q.IsCall = false;
2349 
2350  // Unlike the other function, do not walk to the def of a def, because we are
2351  // handed something we already believe is the clobbering access.
2352  // We never set SkipSelf to true in Q in this method.
2353  MemoryAccess *DefiningAccess = isa<MemoryUse>(StartingUseOrDef)
2354  ? StartingUseOrDef->getDefiningAccess()
2355  : StartingUseOrDef;
2356 
2357  MemoryAccess *Clobber =
2358  Walker.findClobber(DefiningAccess, Q, UpwardWalkLimit);
2359  LLVM_DEBUG(dbgs() << "Starting Memory SSA clobber for " << *I << " is ");
2360  LLVM_DEBUG(dbgs() << *StartingUseOrDef << "\n");
2361  LLVM_DEBUG(dbgs() << "Final Memory SSA clobber for " << *I << " is ");
2362  LLVM_DEBUG(dbgs() << *Clobber << "\n");
2363  return Clobber;
2364 }
2365 
2366 template <typename AliasAnalysisType>
2367 MemoryAccess *
2368 MemorySSA::ClobberWalkerBase<AliasAnalysisType>::getClobberingMemoryAccessBase(
2369  MemoryAccess *MA, unsigned &UpwardWalkLimit, bool SkipSelf) {
2370  auto *StartingAccess = dyn_cast<MemoryUseOrDef>(MA);
2371  // If this is a MemoryPhi, we can't do anything.
2372  if (!StartingAccess)
2373  return MA;
2374 
2375  bool IsOptimized = false;
2376 
2377  // If this is an already optimized use or def, return the optimized result.
2378  // Note: Currently, we store the optimized def result in a separate field,
2379  // since we can't use the defining access.
2380  if (StartingAccess->isOptimized()) {
2381  if (!SkipSelf || !isa<MemoryDef>(StartingAccess))
2382  return StartingAccess->getOptimized();
2383  IsOptimized = true;
2384  }
2385 
2386  const Instruction *I = StartingAccess->getMemoryInst();
2387  // We can't sanely do anything with a fence, since they conservatively clobber
2388  // all memory, and have no locations to get pointers from to try to
2389  // disambiguate.
2390  if (!isa<CallBase>(I) && I->isFenceLike())
2391  return StartingAccess;
2392 
2393  UpwardsMemoryQuery Q(I, StartingAccess);
2394 
2395  if (isUseTriviallyOptimizableToLiveOnEntry(*Walker.getAA(), I)) {
2396  MemoryAccess *LiveOnEntry = MSSA->getLiveOnEntryDef();
2397  StartingAccess->setOptimized(LiveOnEntry);
2398  StartingAccess->setOptimizedAccessType(None);
2399  return LiveOnEntry;
2400  }
2401 
2402  MemoryAccess *OptimizedAccess;
2403  if (!IsOptimized) {
2404  // Start with the thing we already think clobbers this location
2405  MemoryAccess *DefiningAccess = StartingAccess->getDefiningAccess();
2406 
2407  // At this point, DefiningAccess may be the live on entry def.
2408  // If it is, we will not get a better result.
2409  if (MSSA->isLiveOnEntryDef(DefiningAccess)) {
2410  StartingAccess->setOptimized(DefiningAccess);
2411  StartingAccess->setOptimizedAccessType(None);
2412  return DefiningAccess;
2413  }
2414 
2415  OptimizedAccess = Walker.findClobber(DefiningAccess, Q, UpwardWalkLimit);
2416  StartingAccess->setOptimized(OptimizedAccess);
2417  if (MSSA->isLiveOnEntryDef(OptimizedAccess))
2418  StartingAccess->setOptimizedAccessType(None);
2419  else if (Q.AR == MustAlias)
2420  StartingAccess->setOptimizedAccessType(MustAlias);
2421  } else
2422  OptimizedAccess = StartingAccess->getOptimized();
2423 
2424  LLVM_DEBUG(dbgs() << "Starting Memory SSA clobber for " << *I << " is ");
2425  LLVM_DEBUG(dbgs() << *StartingAccess << "\n");
2426  LLVM_DEBUG(dbgs() << "Optimized Memory SSA clobber for " << *I << " is ");
2427  LLVM_DEBUG(dbgs() << *OptimizedAccess << "\n");
2428 
2429  MemoryAccess *Result;
2430  if (SkipSelf && isa<MemoryPhi>(OptimizedAccess) &&
2431  isa<MemoryDef>(StartingAccess) && UpwardWalkLimit) {
2432  assert(isa<MemoryDef>(Q.OriginalAccess));
2433  Q.SkipSelfAccess = true;
2434  Result = Walker.findClobber(OptimizedAccess, Q, UpwardWalkLimit);
2435  } else
2436  Result = OptimizedAccess;
2437 
2438  LLVM_DEBUG(dbgs() << "Result Memory SSA clobber [SkipSelf = " << SkipSelf);
2439  LLVM_DEBUG(dbgs() << "] for " << *I << " is " << *Result << "\n");
2440 
2441  return Result;
2442 }
2443 
2444 MemoryAccess *
2446  if (auto *Use = dyn_cast<MemoryUseOrDef>(MA))
2447  return Use->getDefiningAccess();
2448  return MA;
2449 }
2450 
2452  MemoryAccess *StartingAccess, const MemoryLocation &) {
2453  if (auto *Use = dyn_cast<MemoryUseOrDef>(StartingAccess))
2454  return Use->getDefiningAccess();
2455  return StartingAccess;
2456 }
2457 
2458 void MemoryPhi::deleteMe(DerivedUser *Self) {
2459  delete static_cast<MemoryPhi *>(Self);
2460 }
2461 
2462 void MemoryDef::deleteMe(DerivedUser *Self) {
2463  delete static_cast<MemoryDef *>(Self);
2464 }
2465 
2466 void MemoryUse::deleteMe(DerivedUser *Self) {
2467  delete static_cast<MemoryUse *>(Self);
2468 }
MemorySSAWalker * getWalker()
Definition: MemorySSA.cpp:1560
bool runOnFunction(Function &) override
runOnFunction - Virtual method overriden by subclasses to do the per-function processing of the pass...
Definition: MemorySSA.cpp:2306
The access may reference and may modify the value stored in memory.
uint64_t CallInst * C
void initializeMemorySSAWrapperPassPass(PassRegistry &)
AccessList * getWritableBlockAccesses(const BasicBlock *BB) const
Definition: MemorySSA.h:803
reference emplace_back(ArgTypes &&... Args)
Definition: SmallVector.h:641
typename std::vector< DomTreeNodeBase *>::const_iterator const_iterator
bool invalidate(IRUnitT &IR, const PreservedAnalyses &PA)
Trigger the invalidation of some other analysis pass if not already handled and return whether it was...
Definition: PassManager.h:666
iterator_range< use_iterator > uses()
Definition: Value.h:374
static PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
void dropAllReferences()
Drop all references to operands.
Definition: User.h:294
Atomic ordering constants.
bool VerifyMemorySSA
Enables verification of MemorySSA.
Definition: MemorySSA.cpp:83
bool isFenceLike() const
Return true if this instruction behaves like a memory fence: it can load or store to memory location ...
Definition: Instruction.h:561
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
Definition: PassManager.h:776
void print(raw_ostream &OS) const
Definition: MemorySSA.cpp:2193
This class represents lattice values for constants.
Definition: AllocatorList.h:23
#define LLVM_DUMP_METHOD
Mark debug helper function definitions like dump() that should not be stripped from debug builds...
Definition: Compiler.h:476
bool dominates(const MemoryAccess *A, const MemoryAccess *B) const
Given two memory accesses in potentially different blocks, determine whether MemoryAccess A dominates...
Definition: MemorySSA.cpp:2132
A Module instance is used to store all the information related to an LLVM module. ...
Definition: Module.h:65
void push_back(reference Node)
Insert a node at the back; never copies.
Definition: simple_ilist.h:147
formatted_raw_ostream - A raw_ostream that wraps another one and keeps track of line and column posit...
This class provides various memory handling functions that manipulate MemoryBlock instances...
Definition: Memory.h:53
const AccessList * getBlockAccesses(const BasicBlock *BB) const
Return the list of MemoryAccess&#39;s for a given basic block.
Definition: MemorySSA.h:758
This provides a very simple, boring adaptor for a begin and end iterator into a range type...
void getAnalysisUsage(AnalysisUsage &AU) const override
getAnalysisUsage - This function should be overriden by passes that need analysis information to do t...
Definition: MemorySSA.cpp:2246
Optional< std::vector< StOtherPiece > > Other
Definition: ELFYAML.cpp:948
The two locations do not alias at all.
Definition: AliasAnalysis.h:84
Extension point for the Value hierarchy.
Definition: DerivedUser.h:27
Represents a read-write access to memory, whether it is a must-alias, or a may-alias.
Definition: MemorySSA.h:375
AtomicOrdering getOrdering() const
Returns the ordering constraint of this load instruction.
Definition: Instructions.h:247
static const char LiveOnEntryStr[]
Definition: MemorySSA.cpp:2159
LLVMContext & getContext() const
All values hold a context through their type.
Definition: Value.cpp:733
unsigned second
void getAnalysisUsage(AnalysisUsage &AU) const override
getAnalysisUsage - This function should be overriden by passes that need analysis information to do t...
Definition: MemorySSA.cpp:2300
bool all_of(R &&range, UnaryPredicate P)
Provide wrappers to std::all_of which take ranges instead of having to pass begin/end explicitly...
Definition: STLExtras.h:1165
Base class for all callable instructions (InvokeInst and CallInst) Holds everything related to callin...
Definition: InstrTypes.h:1100
Analysis pass which computes a DominatorTree.
Definition: Dominators.h:230
F(f)
block Block Frequency true
An instruction for reading from memory.
Definition: Instructions.h:167
memoryssa
Definition: MemorySSA.cpp:65
LLVM_READONLY APFloat maximum(const APFloat &A, const APFloat &B)
Implements IEEE 754-2018 maximum semantics.
Definition: APFloat.h:1277
This defines the Use class.
void print(raw_ostream &OS) const
Definition: MemorySSA.cpp:2170
void calculate(SmallVectorImpl< NodeTy *> &IDFBlocks)
Calculate iterated dominance frontiers.
MemorySSA(Function &, AliasAnalysis *, DominatorTree *)
Definition: MemorySSA.cpp:1223
LLVMContext & getContext() const
Get the context in which this basic block lives.
Definition: BasicBlock.cpp:32
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
Definition: SmallPtrSet.h:343
PreservedAnalysisChecker getChecker() const
Build a checker for this PreservedAnalyses and the specified analysis type.
Definition: PassManager.h:311
INITIALIZE_PASS_BEGIN(MemorySSAWrapperPass, "memoryssa", "Memory SSA", false, true) INITIALIZE_PASS_END(MemorySSAWrapperPass
OptimizeUses(MemorySSA *MSSA, CachingWalker< BatchAAResults > *Walker, BatchAAResults *BAA, DominatorTree *DT)
Definition: MemorySSA.cpp:1274
std::pair< iterator, bool > insert(const std::pair< KeyT, ValueT > &KV)
Definition: DenseMap.h:195
Represents read-only accesses to memory.
Definition: MemorySSA.h:319
This class is a batch walker of all MemoryUse&#39;s in the program, and points their defining access at t...
Definition: MemorySSA.cpp:1272
AnalysisUsage & addRequired()
#define INITIALIZE_PASS_DEPENDENCY(depName)
Definition: PassSupport.h:50
Legacy analysis pass which computes MemorySSA.
Definition: MemorySSA.h:965
bool isVolatile() const
Return true if this is a load from a volatile memory location.
Definition: Instructions.h:231
static bool lifetimeEndsAt(MemoryDef *MD, const MemoryLocation &Loc, BatchAAResults &AA)
Definition: MemorySSA.cpp:359
void renamePass(BasicBlock *BB, MemoryAccess *IncomingVal, SmallPtrSetImpl< BasicBlock *> &Visited)
Definition: MemorySSA.h:822
MemoryUseOrDef * createDefinedAccess(Instruction *, MemoryAccess *, const MemoryUseOrDef *Template=nullptr, bool CreationMustSucceed=true)
Definition: MemorySSA.cpp:1699
A Use represents the edge between a Value definition and its users.
Definition: Use.h:55
static bool defClobbersUseOrDef(MemoryDef *MD, const MemoryUseOrDef *MU, AliasAnalysis &AA)
Definition: MemorySSA.cpp:328
MemorySSAAnnotatedWriter(const MemorySSA *M)
Definition: MemorySSA.cpp:104
This class consists of common code factored out of the SmallVector class to reduce code duplication b...
Definition: APFloat.h:41
Encapsulates MemorySSA, including all data associated with memory accesses.
Definition: MemorySSA.h:703
const DefsList * getBlockDefs(const BasicBlock *BB) const
Return the list of MemoryDef&#39;s and MemoryPhi&#39;s for a given basic block.
Definition: MemorySSA.h:766
void insertIntoListsForBlock(MemoryAccess *, const BasicBlock *, InsertionPlace)
Definition: MemorySSA.cpp:1592
bool hasMetadata() const
Return true if this instruction has any metadata attached to it.
Definition: Instruction.h:224
static bool isOrdered(const Instruction *I)
Definition: MemorySSA.cpp:1716
APInt operator*(APInt a, uint64_t RHS)
Definition: APInt.h:2097
void verifyDefUses(Function &F) const
Verify the immediate use information, by walking all the memory accesses and verifying that...
Definition: MemorySSA.cpp:2057
void verifyAnalysis() const override
verifyAnalysis() - This member can be implemented by a analysis pass to check state of analysis infor...
Definition: MemorySSA.cpp:2313
A simple intrusive list implementation.
Definition: simple_ilist.h:78
LLVM_NODISCARD bool isMustSet(const ModRefInfo MRI)
User * getUser() const LLVM_READONLY
Returns the User that contains this Use.
Definition: Use.cpp:40
#define F(x, y, z)
Definition: MD5.cpp:55
static int getID(struct InternalInstruction *insn, const void *miiArg)
MemoryUseOrDef * getMemoryAccess(const Instruction *I) const
Given a memory Mod/Ref&#39;ing instruction, get the MemorySSA access associated with it.
Definition: MemorySSA.h:720
upward_defs_iterator upward_defs_end()
Definition: MemorySSA.h:1248
early cse memssa
Definition: EarlyCSE.cpp:1424
Memory SSA
Definition: MemorySSA.cpp:65
This class is a wrapper over an AAResults, and it is intended to be used only when there are no IR ch...
void emitBasicBlockStartAnnot(const BasicBlock *BB, formatted_raw_ostream &OS) override
emitBasicBlockStartAnnot - This may be implemented to emit a string right after the basic block label...
Definition: MemorySSA.cpp:106
void dump() const
Definition: MemorySSA.cpp:1860
static cl::opt< bool, true > VerifyMemorySSAX("verify-memoryssa", cl::location(VerifyMemorySSA), cl::Hidden, cl::desc("Enable verification of MemorySSA."))
This is the generic walker interface for walkers of MemorySSA.
Definition: MemorySSA.h:996
CRTP base class which implements the entire standard iterator facade in terms of a minimal subset of ...
Definition: iterator.h:67
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree...
Definition: Dominators.h:144
bool isAtLeastOrStrongerThan(AtomicOrdering ao, AtomicOrdering other)
An assembly annotator class to print Memory SSA information in comments.
Definition: MemorySSA.cpp:98
void removeFromLookups(MemoryAccess *)
Properly remove MA from all of MemorySSA&#39;s lookup tables.
Definition: MemorySSA.cpp:1800
NodeT * getBlock() const
#define P(N)
static MemoryLocation get(const LoadInst *LI)
Return a location with information about the memory reference by the given instruction.
initializer< Ty > init(const Ty &Val)
Definition: CommandLine.h:432
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:153
MemorySSAWalker * getSkipSelfWalker()
Definition: MemorySSA.cpp:1575
bool hasName() const
Definition: Value.h:251
LLVM Basic Block Representation.
Definition: BasicBlock.h:57
DomTreeNodeBase * getIDom() const
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
LLVM_NODISCARD bool empty() const
Definition: SmallPtrSet.h:91
A manager for alias analyses.
std::pair< iterator, bool > insert(const ValueT &V)
Definition: DenseSet.h:187
static bool isEqual(const MemoryLocOrCall &LHS, const MemoryLocOrCall &RHS)
Definition: MemorySSA.cpp:212
std::pair< iterator, bool > insert(PtrType Ptr)
Inserts Ptr if and only if there is no element in the container equal to Ptr.
Definition: SmallPtrSet.h:370
early cse Early CSE w MemorySSA
Definition: EarlyCSE.cpp:1424
void dump() const
Definition: MemorySSA.cpp:2232
Interval::pred_iterator pred_begin(Interval *I)
pred_begin/pred_end - define methods so that Intervals may be used just like BasicBlocks can with the...
Definition: Interval.h:112
InsertionPlace
Used in various insertion functions to specify whether we are talking about the beginning or end of a...
Definition: MemorySSA.h:788
Represent the analysis usage information of a pass.
void print(raw_ostream &OS) const
Definition: MemorySSA.cpp:2161
#define LLVM_ATTRIBUTE_UNUSED
Definition: Compiler.h:172
FunctionPass class - This class is used to implement most global optimizations.
Definition: Pass.h:284
amdgpu Simplify well known AMD library false FunctionCallee Value * Arg
Interval::pred_iterator pred_end(Interval *I)
Definition: Interval.h:115
void verifyDomination(Function &F) const
Verify the domination properties of MemorySSA by checking that each definition dominates all of its u...
Definition: MemorySSA.cpp:2020
static void print(raw_ostream &Out, object::Archive::Kind Kind, T Val)
size_type count(ConstPtrType Ptr) const
count - Return 1 if the specified pointer is in the set, 0 otherwise.
Definition: SmallPtrSet.h:381
Memory true print Memory SSA Printer
Definition: MemorySSA.cpp:71
auto find_if(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range))
Provide wrappers to std::find_if which take ranges instead of having to pass begin/end explicitly...
Definition: STLExtras.h:1193
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM)
Definition: MemorySSA.cpp:2285
auto find_if_not(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range))
Definition: STLExtras.h:1198
virtual void invalidateInfo(MemoryAccess *)
Given a memory access, invalidate anything this walker knows about that access.
Definition: MemorySSA.h:1054
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: PassManager.h:159
size_t size() const
Definition: SmallVector.h:52
DomTreeNodeBase< NodeT > * getNode(const NodeT *BB) const
getNode - return the (Post)DominatorTree node for the specified basic block.
auto find(R &&Range, const T &Val) -> decltype(adl_begin(Range))
Provide wrappers to std::find which take ranges instead of having to pass begin/end explicitly...
Definition: STLExtras.h:1186
An intrusive list with ownership and callbacks specified/controlled by ilist_traits, only with API safe for polymorphic types.
Definition: ilist.h:388
void printAsOperand(raw_ostream &O, bool PrintType=true, const Module *M=nullptr) const
Print the name of this Value out to the specified raw_ostream.
Definition: AsmWriter.cpp:4355
INITIALIZE_PASS_END(RegBankSelect, DEBUG_TYPE, "Assign register bank of generic virtual registers", false, false) RegBankSelect
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
Memory true print Memory SSA static false cl::opt< unsigned > MaxCheckLimit("memssa-check-limit", cl::Hidden, cl::init(100), cl::desc("The maximum number of stores/phis MemorySSA" "will consider trying to walk past (default = 100)"))
void optimizeUses()
Optimize uses to point to their actual clobbering definitions.
Definition: MemorySSA.cpp:1477
The two locations may or may not alias. This is the least precise result.
Definition: AliasAnalysis.h:86
static bool isUseTriviallyOptimizableToLiveOnEntry(AliasAnalysisType &AA, const Instruction *I)
Definition: MemorySSA.cpp:374
void setDefiningBlocks(const SmallPtrSetImpl< NodeTy *> &Blocks)
Give the IDF calculator the set of blocks in which the value is defined.
Representation for a specific memory location.
The two locations precisely alias each other.
Definition: AliasAnalysis.h:90
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
void verifyOrdering(Function &F) const
Verify that the order and existence of MemoryAccesses matches the order and existence of memory affec...
Definition: MemorySSA.cpp:1955
void setDefiningAccess(MemoryAccess *DMA, bool Optimized=false, Optional< AliasResult > AR=MayAlias)
Definition: MemorySSA.h:299
unsigned getNumOperands() const
Definition: User.h:191
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements...
Definition: SmallPtrSet.h:417
BlockVerifier::State From
void verifyMemorySSA() const
Verify that MemorySSA is self consistent (IE definitions dominate all uses, uses appear in the right ...
Definition: MemorySSA.cpp:1863
bool erase(PtrType Ptr)
erase - If the set contains the specified pointer, remove it and return true, otherwise return false...
Definition: SmallPtrSet.h:377
static LLVM_ATTRIBUTE_UNUSED void checkClobberSanity(const MemoryAccess *Start, MemoryAccess *ClobberAt, const MemoryLocation &StartLoc, const MemorySSA &MSSA, const UpwardsMemoryQuery &Query, AliasAnalysisType &AA, bool AllowImpreciseClobber=false)
Verifies that Start is clobbered by ClobberAt, and that nothing inbetween Start and ClobberAt can clo...
Definition: MemorySSA.cpp:399
bool locallyDominates(const MemoryAccess *A, const MemoryAccess *B) const
Given two memory accesses in the same basic block, determine whether MemoryAccess A dominates MemoryA...
Definition: MemorySSA.cpp:2101
This is a &#39;vector&#39; (really, a variable-sized array), optimized for the case when the array is small...
Definition: SmallVector.h:837
bool dominates(const Instruction *Def, const Use &U) const
Return true if Def dominates a use in User.
Definition: Dominators.cpp:248
bool runOnFunction(Function &) override
runOnFunction - Virtual method overriden by subclasses to do the per-function processing of the pass...
Definition: MemorySSA.cpp:2251
An analysis that produces MemorySSA for a function.
Definition: MemorySSA.h:926
LLVM_NODISCARD T pop_back_val()
Definition: SmallVector.h:374
BasicBlock * getBlock() const
Definition: MemorySSA.h:159
static GCRegistry::Add< StatepointGC > D("statepoint-example", "an example strategy for statepoint")
bool invalidate(Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &Inv)
Definition: MemorySSA.cpp:2268
pred_range predecessors(BasicBlock *BB)
Definition: CFG.h:124
#define MAP(n)
void emitInstructionAnnot(const Instruction *I, formatted_raw_ostream &OS) override
emitInstructionAnnot - This may be implemented to emit a string right before an instruction is emitte...
Definition: MemorySSA.cpp:112
MemoryAccess * getLiveOnEntryDef() const
Definition: MemorySSA.h:742
void print(raw_ostream &OS) const
Definition: MemorySSA.cpp:2219
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:132
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition: BitVector.h:940
A range adaptor for a pair of iterators.
void removeFromLists(MemoryAccess *, bool ShouldDelete=true)
Properly remove MA from all of MemorySSA&#39;s lists.
Definition: MemorySSA.cpp:1827
Target - Wrapper for Target specific information.
void push_back(pointer val)
Definition: ilist.h:311
hash_code hash_combine(const Ts &...args)
Combine values into a single hash_code.
Definition: Hashing.h:600
Class that has the common methods + fields of memory uses/defs.
Definition: MemorySSA.h:247
void setPreservesAll()
Set by analyses that do not transform their input at all.
iterator_range< user_iterator > users()
Definition: Value.h:419
An opaque object representing a hash code.
Definition: Hashing.h:71
Instruction * getMemoryInst() const
Get the instruction that this MemoryUse represents.
Definition: MemorySSA.h:254
void append(in_iter in_start, in_iter in_end)
Add the specified range to the end of the SmallVector.
Definition: SmallVector.h:387
void initializeMemorySSAPrinterLegacyPassPass(PassRegistry &)
LLVM_NODISCARD bool isModSet(const ModRefInfo MRI)
MemorySSAWalker(MemorySSA *)
Definition: MemorySSA.cpp:2319
iterator_range< def_chain_iterator< T > > def_chain(T MA, MemoryAccess *UpTo=nullptr)
Definition: MemorySSA.h:1299
cl::opt< bool > EnableMSSALoopDependency
Enables memory ssa as a dependency for loop passes.
LLVM_NODISCARD bool empty() const
Definition: SmallVector.h:55
void releaseMemory() override
releaseMemory() - This member can be implemented by a pass if it wants to be able to release its memo...
Definition: MemorySSA.cpp:2298
This file provides utility analysis objects describing memory locations.
StringRef getName() const
Return a constant reference to the value&#39;s name.
Definition: Value.cpp:214
#define I(x, y, z)
Definition: MD5.cpp:58
#define N
void moveTo(MemoryUseOrDef *What, BasicBlock *BB, AccessList::iterator Where)
Definition: MemorySSA.cpp:1668
MemoryAccess * getClobberingMemoryAccess(MemoryAccess *) override
Does the same thing as getClobberingMemoryAccess(const Instruction *I), but takes a MemoryAccess inst...
Definition: MemorySSA.cpp:2445
LLVM_NODISCARD std::enable_if<!is_simple_type< Y >::value, typename cast_retty< X, const Y >::ret_type >::type dyn_cast(const Y &Val)
Definition: Casting.h:332
bool isLiveOnEntryDef(const MemoryAccess *MA) const
Return true if MA represents the live on entry value.
Definition: MemorySSA.h:738
AnalysisUsage & addRequiredTransitive()
const Value * getPointerOperand(const Value *V)
A helper function that returns the pointer operand of a load, store or GEP instruction.
API to communicate dependencies between analyses during invalidation.
Definition: PassManager.h:648
iterator_range< df_iterator< T > > depth_first(const T &G)
MemoryAccess * getClobberingMemoryAccess(const Instruction *I)
Given a memory Mod/Ref/ModRef&#39;ing instruction, calling this will give you the nearest dominating Memo...
Definition: MemorySSA.h:1025
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM)
Definition: MemorySSA.cpp:2277
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This templated class represents "all analyses that operate over <a particular IR unit>" (e...
Definition: PassManager.h:91
Result run(Function &F, FunctionAnalysisManager &AM)
Definition: MemorySSA.cpp:2261
static bool areLoadsReorderable(const LoadInst *Use, const LoadInst *MayClobber)
This does one-way checks to see if Use could theoretically be hoisted above MayClobber.
Definition: MemorySSA.cpp:225
LLVM Value Representation.
Definition: Value.h:73
static MemoryLocOrCall getTombstoneKey()
Definition: MemorySSA.cpp:193
succ_range successors(Instruction *I)
Definition: CFG.h:259
upward_defs_iterator upward_defs_begin(const MemoryAccessPair &Pair)
Definition: MemorySSA.h:1244
AliasResult alias(const MemoryLocation &LocA, const MemoryLocation &LocB)
unsigned getID() const
Used for debugging and tracking things about MemoryAccesses.
Definition: MemorySSA.h:664
This class implements an extremely fast bulk output stream that can only output to a stream...
Definition: raw_ostream.h:45
static ClobberAlias instructionClobbersQuery(const MemoryDef *MD, const MemoryLocation &UseLoc, const Instruction *UseInst, AliasAnalysisType &AA)
Definition: MemorySSA.cpp:262
ModRefInfo
Flags indicating whether a memory access modifies or references memory.
static unsigned getHashValue(const MemoryLocOrCall &MLOC)
Definition: MemorySSA.cpp:197
This file exposes an interface to building/using memory SSA to walk memory instructions using a use/d...
hexagon cext opt
A container for analyses that lazily runs them and caches their results.
Legacy analysis pass which computes a DominatorTree.
Definition: Dominators.h:259
void setBlock(BasicBlock *BB)
Used by MemorySSA to change the block of a MemoryAccess when it is moved.
Definition: MemorySSA.h:212
LLVM_NODISCARD bool isModOrRefSet(const ModRefInfo MRI)
bool operator==(uint64_t V1, const APInt &V2)
Definition: APInt.h:1973
void verifyPrevDefInPhis(Function &F) const
Definition: MemorySSA.cpp:1881
void verifyDominationNumbers(const Function &F) const
Verify that all of the blocks we believe to have valid domination numbers actually have valid dominat...
Definition: MemorySSA.cpp:1917
A wrapper pass to provide the legacy pass manager access to a suitably prepared AAResults object...
Represents phi nodes for memory accesses.
Definition: MemorySSA.h:481
void print(raw_ostream &) const
Definition: MemorySSA.cpp:1854
This header defines various interfaces for pass management in LLVM.
#define LLVM_DEBUG(X)
Definition: Debug.h:122
static MemoryLocOrCall getEmptyKey()
Definition: MemorySSA.cpp:189
void insertIntoListsBefore(MemoryAccess *, const BasicBlock *, AccessList::iterator)
Definition: MemorySSA.cpp:1624
A special type used by analysis passes to provide an address that identifies that particular analysis...
Definition: PassManager.h:70
bool use_empty() const
Definition: Value.h:342
LocationClass< Ty > location(Ty &L)
Definition: CommandLine.h:448
hexagon widen stores
reverse_iterator rbegin()
Definition: simple_ilist.h:121
std::pair< MemoryAccess *, MemoryLocation > MemoryAccessPair
Definition: MemorySSA.h:1075
A wrapper class for inspecting calls to intrinsic functions.
Definition: IntrinsicInst.h:43
const BasicBlock * getParent() const
Definition: Instruction.h:66
void print(raw_ostream &OS, const Module *M=nullptr) const override
print - Print out the internal state of the pass.
Definition: MemorySSA.cpp:2315
bool is_contained(R &&Range, const E &Element)
Wrapper function around std::find to detect if an element exists in a container.
Definition: STLExtras.h:1224
LLVM_NODISCARD bool isRefSet(const ModRefInfo MRI)