maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
llvm-project/llvm/test/CodeGen/X86/tailcall-cgp-dup.ll

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

147 lines
4.1 KiB
LLVM
Raw Normal View History

[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
Teach CodeGenPrep to look past bitcast when it's duplicating return instruction into predecessor blocks to enable tail call optimization. rdar://11958338 llvm-svn: 160894
2012-07-28 05:21:26 +08:00
; RUN: llc < %s -mtriple=x86_64-apple-darwin | FileCheck %s
[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
; RUN: opt -S -codegenprepare %s -mtriple=x86_64-apple-darwin -o - | FileCheck %s --check-prefix OPT
Teach CodeGenPrep to look past bitcast when it's duplicating return instruction into predecessor blocks to enable tail call optimization. rdar://11958338 llvm-svn: 160894
2012-07-28 05:21:26 +08:00
; Teach CGP to dup returns to enable tail call optimization.
; rdar://9147433
define i32 @foo(i32 %x) nounwind ssp {
Mass update to CodeGen tests to use CHECK-LABEL for labels corresponding to function definitions for more informative error messages. No functionality change and all updated tests passed locally. This update was done with the following bash script: find test/CodeGen -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc.*debug" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_-]*\):\( *\)$FUNC: *\$/;\1\2-LABEL:\3$FUNC:/g" $TEMP done sed -i '' "s/;\(.*\)-LABEL-LABEL:/;\1-LABEL:/" $TEMP sed -i '' "s/;\(.*\)-NEXT-LABEL:/;\1-NEXT:/" $TEMP sed -i '' "s/;\(.*\)-NOT-LABEL:/;\1-NOT:/" $TEMP sed -i '' "s/;\(.*\)-DAG-LABEL:/;\1-DAG:/" $TEMP mv $TEMP $NAME fi done llvm-svn: 186280
2013-07-14 14:24:09 +08:00
; CHECK-LABEL: foo:
Teach CodeGenPrep to look past bitcast when it's duplicating return instruction into predecessor blocks to enable tail call optimization. rdar://11958338 llvm-svn: 160894
2012-07-28 05:21:26 +08:00
entry:
switch i32 %x, label %return [
i32 1, label %sw.bb
i32 2, label %sw.bb1
i32 3, label %sw.bb3
i32 4, label %sw.bb5
i32 5, label %sw.bb7
i32 6, label %sw.bb9
]
sw.bb: ; preds = %entry
; CHECK: jmp _f1
%call = tail call i32 @f1() nounwind
br label %return
sw.bb1: ; preds = %entry
; CHECK: jmp _f2
%call2 = tail call i32 @f2() nounwind
br label %return
sw.bb3: ; preds = %entry
; CHECK: jmp _f3
%call4 = tail call i32 @f3() nounwind
br label %return
sw.bb5: ; preds = %entry
; CHECK: jmp _f4
%call6 = tail call i32 @f4() nounwind
br label %return
sw.bb7: ; preds = %entry
; CHECK: jmp _f5
%call8 = tail call i32 @f5() nounwind
br label %return
sw.bb9: ; preds = %entry
; CHECK: jmp _f6
%call10 = tail call i32 @f6() nounwind
br label %return
return: ; preds = %entry, %sw.bb9, %sw.bb7, %sw.bb5, %sw.bb3, %sw.bb1, %sw.bb
%retval.0 = phi i32 [ %call10, %sw.bb9 ], [ %call8, %sw.bb7 ], [ %call6, %sw.bb5 ], [ %call4, %sw.bb3 ], [ %call2, %sw.bb1 ], [ %call, %sw.bb ], [ 0, %entry ]
ret i32 %retval.0
}
declare i32 @f1()
declare i32 @f2()
declare i32 @f3()
declare i32 @f4()
declare i32 @f5()
declare i32 @f6()
; rdar://11958338
%0 = type opaque
declare i8* @bar(i8*) uwtable optsize noinline ssp
define hidden %0* @thingWithValue(i8* %self) uwtable ssp {
entry:
Mass update to CodeGen tests to use CHECK-LABEL for labels corresponding to function definitions for more informative error messages. No functionality change and all updated tests passed locally. This update was done with the following bash script: find test/CodeGen -name "*.ll" | \ while read NAME; do echo "$NAME" if ! grep -q "^; *RUN: *llc.*debug" $NAME; then TEMP=`mktemp -t temp` cp $NAME $TEMP sed -n "s/^define [^@]*@\([A-Za-z0-9_]*\)(.*$/\1/p" < $NAME | \ while read FUNC; do sed -i '' "s/;\(.*\)\([A-Za-z0-9_-]*\):\( *\)$FUNC: *\$/;\1\2-LABEL:\3$FUNC:/g" $TEMP done sed -i '' "s/;\(.*\)-LABEL-LABEL:/;\1-LABEL:/" $TEMP sed -i '' "s/;\(.*\)-NEXT-LABEL:/;\1-NEXT:/" $TEMP sed -i '' "s/;\(.*\)-NOT-LABEL:/;\1-NOT:/" $TEMP sed -i '' "s/;\(.*\)-DAG-LABEL:/;\1-DAG:/" $TEMP mv $TEMP $NAME fi done llvm-svn: 186280
2013-07-14 14:24:09 +08:00
; CHECK-LABEL: thingWithValue:
Teach CodeGenPrep to look past bitcast when it's duplicating return instruction into predecessor blocks to enable tail call optimization. rdar://11958338 llvm-svn: 160894
2012-07-28 05:21:26 +08:00
; CHECK: jmp _bar
br i1 undef, label %if.then.i, label %if.else.i
if.then.i: ; preds = %entry
br label %someThingWithValue.exit
if.else.i: ; preds = %entry
%call4.i = tail call i8* @bar(i8* undef) optsize
br label %someThingWithValue.exit
someThingWithValue.exit: ; preds = %if.else.i, %if.then.i
%retval.0.in.i = phi i8* [ undef, %if.then.i ], [ %call4.i, %if.else.i ]
%retval.0.i = bitcast i8* %retval.0.in.i to %0*
ret %0* %retval.0.i
}
[CGP] Be less conservative about tail-duplicating a ret to allow tail calls CGP tail-duplicates rets into blocks that end with a call that feed the ret. This puts the call in tail position, potentially allowing the DAG builder to lower it as a tail call. To avoid tail duplication in cases where we won't form the tail call, CGP tried to predict whether this is going to be possible, and avoids doing it when lowering as a tail call will definitely fail. However, it was being too conservative by always throwing away calls to functions with a signext/zeroext attribute on the return type. Instead, we can use the same logic the builder uses to determine whether the attributes work out. Differential Revision: https://reviews.llvm.org/D24315 llvm-svn: 280894
2016-09-08 08:48:37 +08:00
; Correctly handle zext returns.
declare zeroext i1 @foo_i1()
; CHECK-LABEL: zext_i1
; CHECK: jmp _foo_i1
define zeroext i1 @zext_i1(i1 %k) {
entry:
br i1 %k, label %land.end, label %land.rhs
land.rhs: ; preds = %entry
%call1 = tail call zeroext i1 @foo_i1()
br label %land.end
land.end: ; preds = %entry, %land.rhs
%0 = phi i1 [ false, %entry ], [ %call1, %land.rhs ]
ret i1 %0
}
[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
; We need to look through bitcasts when looking for tail calls in phi incoming
; values.
declare i32* @g_ret32()
define i8* @f_ret8(i8* %obj) nounwind {
; OPT-LABEL: @f_ret8(
; OPT-NEXT: entry:
; OPT-NEXT: [[CMP:%.*]] = icmp eq i8* [[OBJ:%.*]], null
; OPT-NEXT: br i1 [[CMP]], label [[RETURN:%.*]], label [[IF_THEN:%.*]]
; OPT: if.then:
; OPT-NEXT: [[PTR:%.*]] = tail call i32* @g_ret32()
; OPT-NEXT: [[CASTED:%.*]] = bitcast i32* [[PTR]] to i8*
[CGP] Look through bitcasts when duplicating returns for tail calls The simple case of: ``` int *callee(); void *caller(void *a) { if (a == NULL) return callee(); return a; } ``` would generate a regular call instead of a tail call because we don't look through the bitcast of the call to `callee` when duplicating the return blocks. Differential Revision: https://reviews.llvm.org/D60837 llvm-svn: 359041
2019-04-24 05:57:46 +08:00
; OPT-NEXT: ret i8* [[CASTED]]
[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
; OPT: return:
[CGP] Look through bitcasts when duplicating returns for tail calls The simple case of: ``` int *callee(); void *caller(void *a) { if (a == NULL) return callee(); return a; } ``` would generate a regular call instead of a tail call because we don't look through the bitcast of the call to `callee` when duplicating the return blocks. Differential Revision: https://reviews.llvm.org/D60837 llvm-svn: 359041
2019-04-24 05:57:46 +08:00
; OPT-NEXT: ret i8* [[OBJ]]
[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
;
; CHECK-LABEL: f_ret8:
; CHECK: ## %bb.0: ## %entry
; CHECK-NEXT: testq %rdi, %rdi
[CGP] Look through bitcasts when duplicating returns for tail calls The simple case of: ``` int *callee(); void *caller(void *a) { if (a == NULL) return callee(); return a; } ``` would generate a regular call instead of a tail call because we don't look through the bitcast of the call to `callee` when duplicating the return blocks. Differential Revision: https://reviews.llvm.org/D60837 llvm-svn: 359041
2019-04-24 05:57:46 +08:00
; CHECK-NEXT: je LBB3_1
; CHECK-NEXT: ## %bb.2: ## %if.then
; CHECK-NEXT: jmp _g_ret32 ## TAILCALL
; CHECK-NEXT: LBB3_1: ## %return
; CHECK-NEXT: movq %rdi, %rax
[X86] Add codegen prepare test exercising a bitcast + tail call In preparation of https://reviews.llvm.org/D60837, add this test where we don't perform a tail call because we don't look through a bitcast. llvm-svn: 359040
2019-04-24 05:57:43 +08:00
; CHECK-NEXT: retq
entry:
%cmp = icmp eq i8* %obj, null
br i1 %cmp, label %return, label %if.then
if.then:
%ptr = tail call i32* @g_ret32()
%casted = bitcast i32* %ptr to i8*
br label %return
return:
%retval = phi i8* [ %casted, %if.then ], [ %obj, %entry ]
ret i8* %retval
}