mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-22 04:22:57 +02:00
07f5a8acc7
In HexagonISelLowering, there is code to handle the case when a function returns an i1 type. In this case, we need to generate extra nodes to copy the result from R0 to a predicate register. The code was returning the wrong value for the chain edge which caused an assert "Wrong topological sorting" when converting the instructions to MIs. This patch fixes the problem by returning the chain for the final copy. Patch by Brendon Cahoon. llvm-svn: 316367
24 lines
576 B
LLVM
24 lines
576 B
LLVM
; RUN: llc -march=hexagon < %s
|
|
; REQUIRES: asserts
|
|
|
|
; Test that the compiler does not assert because the DAG is not correct.
|
|
; CHECK: call foo
|
|
|
|
%returntype = type { i1, i32 }
|
|
|
|
define i32 @test(i32* %a0, i32* %a1, i32* %a2) #0 {
|
|
b3:
|
|
br i1 undef, label %b6, label %b4
|
|
|
|
b4: ; preds = %b3
|
|
%v5 = call %returntype @foo(i32* nonnull undef, i32* %a2, i32* %a0) #0
|
|
ret i32 1
|
|
|
|
b6: ; preds = %b3
|
|
unreachable
|
|
}
|
|
|
|
declare %returntype @foo(i32*, i32*, i32*) #0
|
|
|
|
attributes #0 = { nounwind }
|