Skip to content

Commit 344a3d0

Browse files
committed
[MemorySSA] Rename uses in blocks with Phis.
Renaming should include blocks with existing Phis. Resolves PR45927. Differential Revision: https://reviews.llvm.org/D87661
1 parent e30371d commit 344a3d0

File tree

2 files changed

+85
-0
lines changed

2 files changed

+85
-0
lines changed

llvm/lib/Analysis/MemorySSAUpdater.cpp

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -342,6 +342,8 @@ void MemorySSAUpdater::insertDef(MemoryDef *MD, bool RenameUses) {
342342

343343
SmallVector<WeakVH, 8> FixupList(InsertedPHIs.begin(), InsertedPHIs.end());
344344

345+
SmallSet<WeakVH, 8> ExistingPhis;
346+
345347
// Remember the index where we may insert new phis.
346348
unsigned NewPhiIndex = InsertedPHIs.size();
347349
if (!DefBeforeSameBlock) {
@@ -382,6 +384,8 @@ void MemorySSAUpdater::insertDef(MemoryDef *MD, bool RenameUses) {
382384
if (!MPhi) {
383385
MPhi = MSSA->createMemoryPhi(BBIDF);
384386
NewInsertedPHIs.push_back(MPhi);
387+
} else {
388+
ExistingPhis.insert(MPhi);
385389
}
386390
// Add the phis created into the IDF blocks to NonOptPhis, so they are not
387391
// optimized out as trivial by the call to getPreviousDefFromEnd below.
@@ -447,6 +451,13 @@ void MemorySSAUpdater::insertDef(MemoryDef *MD, bool RenameUses) {
447451
if (Phi)
448452
MSSA->renamePass(Phi->getBlock(), nullptr, Visited);
449453
}
454+
// Existing Phi blocks may need renaming too, if an access was previously
455+
// optimized and the inserted Defs "covers" the Optimized value.
456+
for (auto &MP : ExistingPhis) {
457+
MemoryPhi *Phi = dyn_cast_or_null<MemoryPhi>(MP);
458+
if (Phi)
459+
MSSA->renamePass(Phi->getBlock(), nullptr, Visited);
460+
}
450461
}
451462
}
452463

@@ -1322,6 +1333,7 @@ void MemorySSAUpdater::removeMemoryAccess(MemoryAccess *MA, bool OptimizePhis) {
13221333
// Note: We assume MemorySSA is not used in metadata since it's not really
13231334
// part of the IR.
13241335

1336+
assert(NewDefTarget != MA && "Going into an infinite loop");
13251337
while (!MA->use_empty()) {
13261338
Use &U = *MA->use_begin();
13271339
if (auto *MUD = dyn_cast<MemoryUseOrDef>(U.getUser()))
Lines changed: 73 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,73 @@
1+
; RUN: opt -disable-output -loop-simplify -lcssa -licm -print-memoryssa < %s 2>&1 | FileCheck %s
2+
; RUN: opt -disable-output -aa-pipeline=basic-aa -passes='loop-mssa(licm),print<memoryssa>' < %s 2>&1 | FileCheck %s
3+
4+
5+
@a = external dso_local global i16, align 1
6+
@c = external dso_local global i16, align 1
7+
8+
; CHECK-LABEL: @main()
9+
10+
; CHECK: entry:
11+
; CHECK-NEXT: %res.addr.i = alloca i16
12+
; CHECK-NEXT: ; MemoryUse(liveOnEntry)
13+
; CHECK-NEXT: %c.promoted = load i16, i16* @c
14+
; CHECK-NEXT: br label %for.cond.i
15+
16+
; CHECK: for.cond.i:
17+
; CHECK-NEXT: ; [[NO5:.*]] = MemoryPhi({entry,liveOnEntry},{f.exit.i,[[NO5]]})
18+
; CHECK-NEXT: %inc.i1 = phi i16 [ %inc.i, %f.exit.i ], [ %c.promoted, %entry ]
19+
; CHECK-NEXT: %inc.i = add nsw i16 %inc.i1, 1
20+
; CHECK-NEXT: br i1 false, label %f.exit.thread.i, label %f.exit.i
21+
22+
; CHECK: f.exit.thread.i:
23+
; CHECK-NEXT: %inc.i.lcssa = phi i16 [ %inc.i, %for.cond.i ]
24+
; CHECK-NEXT: ; [[NO6:.*]] = MemoryDef([[NO5]])
25+
; CHECK-NEXT: store i16 %inc.i.lcssa, i16* @c, align 1
26+
; CHECK-NEXT: ; [[NO2:.*]] = MemoryDef([[NO6]])
27+
; CHECK-NEXT: store i16 1, i16* @a, align 1
28+
; CHECK-NEXT: ; MemoryUse([[NO2]])
29+
; CHECK-NEXT: %tmp2 = load i16, i16* @c, align 1
30+
; CHECK-NEXT: br label %g.exit
31+
32+
; CHECK: f.exit.i
33+
; CHECK-NEXT: br i1 false, label %g.exit.loopexit, label %for.cond.i
34+
35+
; CHECK: g.exit.loopexit:
36+
; CHECK-NEXT: %inc.i.lcssa2 = phi i16 [ %inc.i, %f.exit.i ]
37+
; CHECK-NEXT: ; [[NO7:.*]] = MemoryDef([[NO5]])
38+
; CHECK-NEXT: store i16 %inc.i.lcssa2, i16* @c, align 1
39+
; CHECK-NEXT: br label %g.exit
40+
41+
; CHECK: g.exit
42+
; CHECK-NEXT: ; [[NO4:.*]] = MemoryPhi({f.exit.thread.i,[[NO2]]},{g.exit.loopexit,[[NO7]]})
43+
; CHECK-NEXT: ; MemoryUse([[NO4]])
44+
; CHECK-NEXT: %tmp1 = load i16, i16* @c, align 1
45+
; CHECK-NEXT: ; [[NO3:.*]] = MemoryDef([[NO4]])
46+
; CHECK-NEXT: store i16 %tmp1, i16* %res.addr.i, align 1
47+
; CHECK-NEXT: ret void
48+
49+
define dso_local void @main() {
50+
entry:
51+
%res.addr.i = alloca i16, align 1
52+
br label %for.cond.i
53+
54+
for.cond.i: ; preds = %f.exit.i, %entry
55+
%tmp0 = load i16, i16* @c, align 1
56+
%inc.i = add nsw i16 %tmp0, 1
57+
store i16 %inc.i, i16* @c, align 1
58+
br i1 false, label %f.exit.thread.i, label %f.exit.i
59+
60+
f.exit.thread.i: ; preds = %for.cond.i
61+
store i16 1, i16* @a, align 1
62+
%tmp2 = load i16, i16* @c, align 1
63+
br label %g.exit
64+
65+
f.exit.i: ; preds = %for.cond.i
66+
br i1 false, label %g.exit, label %for.cond.i
67+
68+
g.exit: ; preds = %f.exit.i, %f.exit.thread.i
69+
%tmp1 = load i16, i16* @c, align 1
70+
store i16 %tmp1, i16* %res.addr.i, align 1
71+
ret void
72+
}
73+

0 commit comments

Comments
 (0)