Skip to content

Commit 8e2a5bd

Browse files
author
Simon Dardis
committedNov 13, 2017
[CodeGenPrepare] Check that erased sunken address are not reused
CodeGenPrepare sinks address computations from one basic block to another and attempts to reuse address computations that have already been sunk. If the same address computation appears twice with the first instance as an operand of a load whose result is an operand to a simplifable select, CodeGenPrepare simplifies the select and recursively erases the now dead instructions. CodeGenPrepare then attempts to use the erased address computation for the second load. Fix this by erasing the cached address value if it has zero uses before looking for the address value in the sunken address map. This partially resolves PR35209. Thanks to Alexander Richardson for reporting the issue! Reviewers: john.brawn Differential Revision: https://reviews.llvm.org/D39841 llvm-svn: 318032
1 parent aecd4f5 commit 8e2a5bd

File tree

3 files changed

+72
-1
lines changed

3 files changed

+72
-1
lines changed
 

‎llvm/lib/CodeGen/CodeGenPrepare.cpp

+6-1
Original file line numberDiff line numberDiff line change
@@ -4358,7 +4358,12 @@ bool CodeGenPrepare::optimizeMemoryInst(Instruction *MemoryInst, Value *Addr,
43584358
// Now that we determined the addressing expression we want to use and know
43594359
// that we have to sink it into this block. Check to see if we have already
43604360
// done this for some other load/store instr in this block. If so, reuse the
4361-
// computation.
4361+
// computation. Before attempting reuse, check if the address is valid as it
4362+
// may have been erased.
4363+
auto I = SunkAddrs.find(Addr);
4364+
if (I != SunkAddrs.end() && I->second && I->second->user_empty())
4365+
SunkAddrs.erase(I);
4366+
43624367
Value *&SunkAddr = SunkAddrs[Addr];
43634368
if (SunkAddr) {
43644369
DEBUG(dbgs() << "CGP: Reusing nonlocal addrmode: " << AddrMode << " for "
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
if not 'Mips' in config.root.targets:
2+
config.unsupported = True
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,64 @@
1+
; RUN: opt -S -mtriple=mips64-mti-linux-gnu -codegenprepare < %s | FileCheck %s
2+
3+
; Test that if an address that was sunk from a dominating bb, used in a
4+
; select that is erased along with its' trivally dead operand, that the
5+
; sunken address is not reused if the same address computation occurs
6+
; after the select. Previously, this caused a ICE.
7+
8+
%struct.az = type { i32, %struct.bt* }
9+
%struct.bt = type { i32 }
10+
%struct.f = type { %struct.ax, %union.anon }
11+
%struct.ax = type { %struct.az* }
12+
%union.anon = type { %struct.bd }
13+
%struct.bd = type { i64 }
14+
%struct.bg = type { i32, i32 }
15+
%struct.ap = type { i32, i32 }
16+
17+
@ch = common global %struct.f zeroinitializer, align 8
18+
@j = common global %struct.az* null, align 8
19+
@ck = common global i32 0, align 4
20+
@h = common global i32 0, align 4
21+
@.str = private unnamed_addr constant [1 x i8] zeroinitializer, align 1
22+
23+
define internal void @probestart() {
24+
entry:
25+
%0 = load %struct.az*, %struct.az** @j, align 8
26+
%bw = getelementptr inbounds %struct.az, %struct.az* %0, i64 0, i32 1
27+
%1 = load i32, i32* @h, align 4
28+
%cond = icmp eq i32 %1, 0
29+
br i1 %cond, label %sw.bb, label %cl
30+
31+
sw.bb: ; preds = %entry
32+
%call = tail call inreg { i64, i64 } @ba(i32* bitcast (%struct.f* @ch to i32*))
33+
br label %cl
34+
35+
cl: ; preds = %sw.bb, %entry
36+
%2 = load %struct.bt*, %struct.bt** %bw, align 8
37+
%tobool = icmp eq %struct.bt* %2, null
38+
%3 = load i32, i32* @ck, align 4
39+
%.sink5 = select i1 %tobool, i32* getelementptr (%struct.bg, %struct.bg* bitcast (%union.anon* getelementptr inbounds (%struct.f, %struct.f* @ch, i64 0, i32 1) to %struct.bg*), i64 0, i32 1), i32* getelementptr (%struct.ap, %struct.ap* bitcast (%union.anon* getelementptr inbounds (%struct.f, %struct.f* @ch, i64 0, i32 1) to %struct.ap*), i64 0, i32 1)
40+
store i32 %3, i32* %.sink5, align 4
41+
store i32 1, i32* bitcast (i64* getelementptr inbounds (%struct.f, %struct.f* @ch, i64 0, i32 1, i32 0, i32 0) to i32*), align 8
42+
%4 = load %struct.bt*, %struct.bt** %bw, align 8
43+
tail call void (i8*, ...) @a(i8* getelementptr inbounds ([1 x i8], [1 x i8]* @.str, i64 0, i64 0), %struct.bt* %4)
44+
ret void
45+
}
46+
47+
; CHECK-LABEL: @probestart()
48+
; CHECK-LABEL: entry:
49+
; CHECK: %[[I0:[0-9]+]] = load %struct.az*, %struct.az** @j
50+
; CHECK-LABEL: cl:
51+
52+
; CHECK-NOT: %{{[0-9]+}} = load %struct.bt*, %struct.bt** %bw
53+
; CHECK-NOT: %{{[.a-z0-9]}} = select
54+
; CHECK-NOT: %{{[0-9]+}} = load %struct.bt*, %struct.bt** %bw
55+
56+
; CHECK: %[[I1:[0-9]+]] = bitcast %struct.az* %[[I0]] to i8*
57+
; CHECK-NEXT: %sunkaddr = getelementptr i8, i8* %[[I1]], i64 8
58+
; CHECK-NEXT: %[[I2:[0-9]+]] = bitcast i8* %sunkaddr to %struct.bt**
59+
; CHECK-NEXT: %{{[0-9]+}} = load %struct.bt*, %struct.bt** %[[I2]]
60+
; CHECK-NEXT: tail call void (i8*, ...) @a
61+
62+
declare inreg { i64, i64 } @ba(i32*)
63+
64+
declare void @a(i8*, ...)

0 commit comments

Comments
 (0)
Please sign in to comment.