mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-21 03:53:04 +02:00
14476b73f7
The original patch of the A->B->A BitCast optimization was reverted by r274094 because it may cause infinite loop inside compiler https://llvm.org/bugs/show_bug.cgi?id=27996. The problem is with following code xB = load (type B); xA = load (type A); +yA = (A)xB; B -> A +zAn = PHI[yA, xA]; PHI +zBn = (B)zAn; // A -> B store zAn; store zBn; optimizeBitCastFromPhi generates +zBn = (B)zAn; // A -> B and expects it will be combined with the following store instruction to another store zAn Unfortunately before combineStoreToValueType is called on the store instruction, optimizeBitCastFromPhi is called on the new BitCast again, and this pattern repeats indefinitely. optimizeBitCastFromPhi only generates BitCast for load/store instructions, only the BitCast before store can cause the reexecution of optimizeBitCastFromPhi, and BitCast before store can easily be handled by InstCombineLoadStoreAlloca.cpp. So the solution to the problem is if all users of a CI are store instructions, we should not do optimizeBitCastFromPhi on it. Then optimizeBitCastFromPhi will not be called on the new BitCast instructions. Differential Revision: https://reviews.llvm.org/D23896 llvm-svn: 285116
21 lines
361 B
LLVM
21 lines
361 B
LLVM
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
define void @mem() {
|
|
bb:
|
|
br label %bb6
|
|
|
|
bb6:
|
|
%.0 = phi i8** [ undef, %bb ], [ %t2, %bb6 ]
|
|
%tmp = load i8*, i8** %.0, align 8
|
|
%bc = bitcast i8* %tmp to i8**
|
|
%t1 = load i8*, i8** %bc, align 8
|
|
%t2 = bitcast i8* %t1 to i8**
|
|
br label %bb6
|
|
|
|
bb206:
|
|
ret void
|
|
; CHECK: phi
|
|
; CHECK: bitcast
|
|
; CHECK: load
|
|
}
|