forked from OSchip/llvm-project
parent
f62ea8ef4b
commit
2f7bb1be42
|
@ -1,4 +1,4 @@
|
||||||
; RUN: llvm-as < %s | opt -mem2reg | llvm-dis | not grep alloca
|
; RUN: llvm-as < %s | opt -instcombine -mem2reg | llvm-dis | not grep alloca
|
||||||
;
|
;
|
||||||
; This tests to see if mem2reg can promote alloca instructions whose addresses
|
; This tests to see if mem2reg can promote alloca instructions whose addresses
|
||||||
; are used by PHI nodes that are immediately loaded. The LLVM C++ front-end
|
; are used by PHI nodes that are immediately loaded. The LLVM C++ front-end
|
||||||
|
@ -6,12 +6,14 @@
|
||||||
; lvalues), so handling this simple extension is quite useful.
|
; lvalues), so handling this simple extension is quite useful.
|
||||||
;
|
;
|
||||||
; This testcase is what the following program looks like when it reaches
|
; This testcase is what the following program looks like when it reaches
|
||||||
; mem2reg:
|
; instcombine:
|
||||||
;
|
;
|
||||||
; template<typename T>
|
; template<typename T>
|
||||||
; const T& max(const T& a1, const T& a2) { return a1 < a2 ? a1 : a2; }
|
; const T& max(const T& a1, const T& a2) { return a1 < a2 ? a1 : a2; }
|
||||||
; int main() { return max(0, 1); }
|
; int main() { return max(0, 1); }
|
||||||
;
|
;
|
||||||
|
; This test checks to make sure the combination of instcombine and mem2reg
|
||||||
|
; perform the transformation.
|
||||||
|
|
||||||
int %main() {
|
int %main() {
|
||||||
entry:
|
entry:
|
||||||
|
|
|
@ -1,6 +1,7 @@
|
||||||
; Test promotion of loads that use the result of a select instruction.
|
; Test promotion of loads that use the result of a select instruction. This
|
||||||
|
; should be simplified by the instcombine pass.
|
||||||
|
|
||||||
; RUN: llvm-as < %s | opt -mem2reg | llvm-dis | not grep alloca
|
; RUN: llvm-as < %s | opt -instcombine -mem2reg | llvm-dis | not grep alloca
|
||||||
|
|
||||||
int %main() {
|
int %main() {
|
||||||
%mem_tmp.0 = alloca int ; <int*> [#uses=3]
|
%mem_tmp.0 = alloca int ; <int*> [#uses=3]
|
||||||
|
|
Loading…
Reference in New Issue