mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-13 14:46:53 +00:00
21e956f318
Summary: D26704 fixed the non-determinism in codegen by sorting basic blocks before iteration so as to have a defined iteration order. As a result we need to fix the names (numbers) of the temporaries in the following unit tests: test/Transforms/Util/MemorySSA/multi-edges.ll test/Transforms/Util/MemorySSA/multiple-backedges-hal.ll Reviewers: dberlin, david2050, mgrang Subscribers: llvm-commits Differential Revision: https://reviews.llvm.org/D26926 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@287575 91177308-0d34-0410-b5e6-96231b3b80d8
33 lines
958 B
LLVM
33 lines
958 B
LLVM
; RUN: opt -basicaa -print-memoryssa -verify-memoryssa -analyze < %s 2>&1 | FileCheck %s
|
|
; RUN: opt -aa-pipeline=basic-aa -passes='print<memoryssa>,verify<memoryssa>' -disable-output < %s 2>&1 | FileCheck %s
|
|
;
|
|
; Makes sure we have a sane model if both successors of some block is the same
|
|
; block.
|
|
|
|
define i32 @foo(i1 %a) {
|
|
entry:
|
|
%0 = alloca i32, align 4
|
|
; CHECK: 1 = MemoryDef(liveOnEntry)
|
|
; CHECK-NEXT: store i32 4
|
|
store i32 4, i32* %0
|
|
br i1 %a, label %Loop.Body, label %Loop.End
|
|
|
|
Loop.Body:
|
|
; CHECK: 3 = MemoryPhi({entry,1},{Loop.End,4})
|
|
; CHECK-NEXT: 2 = MemoryDef(3)
|
|
; CHECK-NEXT: store i32 5
|
|
store i32 5, i32* %0, align 4
|
|
br i1 %a, label %Loop.End, label %Loop.End ; WhyDoWeEvenHaveThatLever.gif
|
|
|
|
Loop.End:
|
|
; CHECK: 4 = MemoryPhi({entry,1},{Loop.Body,2},{Loop.Body,2})
|
|
; CHECK-NEXT: MemoryUse(4)
|
|
; CHECK-NEXT: %1 = load
|
|
%1 = load i32, i32* %0, align 4
|
|
%2 = icmp eq i32 5, %1
|
|
br i1 %2, label %Ret, label %Loop.Body
|
|
|
|
Ret:
|
|
ret i32 %1
|
|
}
|