[CostModel][X86] Regenerate latency/codesize cost tests
llvm-svn: 330052
This commit is contained in:
parent
0c07ccc4e3
commit
237730a196
|
@ -1,3 +1,4 @@
|
||||||
|
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
|
||||||
; RUN: opt < %s -cost-model -cost-kind=latency -analyze -mtriple=x86_64-unknown-linux-gnu -mcpu=corei7 | FileCheck %s --check-prefix=LATENCY
|
; RUN: opt < %s -cost-model -cost-kind=latency -analyze -mtriple=x86_64-unknown-linux-gnu -mcpu=corei7 | FileCheck %s --check-prefix=LATENCY
|
||||||
; RUN: opt < %s -cost-model -cost-kind=code-size -analyze -mtriple=x86_64-unknown-linux-gnu -mcpu=corei7 | FileCheck %s --check-prefix=CODESIZE
|
; RUN: opt < %s -cost-model -cost-kind=code-size -analyze -mtriple=x86_64-unknown-linux-gnu -mcpu=corei7 | FileCheck %s --check-prefix=CODESIZE
|
||||||
|
|
||||||
|
@ -8,48 +9,41 @@ target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f3
|
||||||
declare { i32, i1 } @llvm.uadd.with.overflow.i32(i32, i32)
|
declare { i32, i1 } @llvm.uadd.with.overflow.i32(i32, i32)
|
||||||
|
|
||||||
define i64 @foo(i64 %arg) {
|
define i64 @foo(i64 %arg) {
|
||||||
|
; LATENCY-LABEL: 'foo'
|
||||||
; LATENCY: cost of 0 {{.*}} alloca i32
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %A1 = alloca i32, align 8
|
||||||
; CODESIZE: cost of 0 {{.*}} alloca i32
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %A2 = alloca i64, i64 undef, align 8
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %I64 = add i64 undef, undef
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 4 for instruction: %1 = load i64, i64* undef, align 4
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %BC = bitcast i8* undef to i32*
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %I2P = inttoptr i64 undef to i8*
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %P2I = ptrtoint i8* undef to i64
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %TC = trunc i64 undef to i32
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %uadd = call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 undef, i32 undef)
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 40 for instruction: call void undef()
|
||||||
|
; LATENCY-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i64 undef
|
||||||
|
;
|
||||||
|
; CODESIZE-LABEL: 'foo'
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %A1 = alloca i32, align 8
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %A2 = alloca i64, i64 undef, align 8
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %I64 = add i64 undef, undef
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %1 = load i64, i64* undef, align 4
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %BC = bitcast i8* undef to i32*
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %I2P = inttoptr i64 undef to i8*
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %P2I = ptrtoint i8* undef to i64
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 0 for instruction: %TC = trunc i64 undef to i32
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: %uadd = call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 undef, i32 undef)
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: call void undef()
|
||||||
|
; CODESIZE-NEXT: Cost Model: Found an estimated cost of 1 for instruction: ret i64 undef
|
||||||
|
;
|
||||||
%A1 = alloca i32, align 8
|
%A1 = alloca i32, align 8
|
||||||
|
|
||||||
; LATENCY: cost of 1 {{.*}} alloca i64, i64 undef
|
|
||||||
; CODESIZE: cost of 1 {{.*}} alloca i64, i64 undef
|
|
||||||
%A2 = alloca i64, i64 undef, align 8
|
%A2 = alloca i64, i64 undef, align 8
|
||||||
|
|
||||||
; LATENCY: cost of 1 {{.*}} %I64 = add
|
|
||||||
; CODESIZE: cost of 1 {{.*}} %I64 = add
|
|
||||||
%I64 = add i64 undef, undef
|
%I64 = add i64 undef, undef
|
||||||
|
|
||||||
; LATENCY: cost of 4 {{.*}} load
|
|
||||||
; CODESIZE: cost of 1 {{.*}} load
|
|
||||||
load i64, i64* undef, align 4
|
load i64, i64* undef, align 4
|
||||||
|
|
||||||
; LATENCY: cost of 0 {{.*}} bitcast
|
|
||||||
; CODESIZE: cost of 0 {{.*}} bitcast
|
|
||||||
%BC = bitcast i8* undef to i32*
|
%BC = bitcast i8* undef to i32*
|
||||||
|
|
||||||
; LATENCY: cost of 0 {{.*}} inttoptr
|
|
||||||
; CODESIZE: cost of 0 {{.*}} inttoptr
|
|
||||||
%I2P = inttoptr i64 undef to i8*
|
%I2P = inttoptr i64 undef to i8*
|
||||||
|
|
||||||
; LATENCY: cost of 0 {{.*}} ptrtoint
|
|
||||||
; CODESIZE: cost of 0 {{.*}} ptrtoint
|
|
||||||
%P2I = ptrtoint i8* undef to i64
|
%P2I = ptrtoint i8* undef to i64
|
||||||
|
|
||||||
; LATENCY: cost of 0 {{.*}} trunc
|
|
||||||
; CODESIZE: cost of 0 {{.*}} trunc
|
|
||||||
%TC = trunc i64 undef to i32
|
%TC = trunc i64 undef to i32
|
||||||
|
|
||||||
; LATENCY: cost of 1 {{.*}} call
|
|
||||||
; CODESIZE: cost of 1 {{.*}} call
|
|
||||||
%uadd = call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 undef, i32 undef)
|
%uadd = call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 undef, i32 undef)
|
||||||
|
|
||||||
; LATENCY: cost of 40 {{.*}} call void undef
|
|
||||||
; CODESIZE: cost of 1 {{.*}} call void undef
|
|
||||||
call void undef()
|
call void undef()
|
||||||
|
|
||||||
; LATENCY: cost of 1 {{.*}} ret
|
|
||||||
; CODESIZE: cost of 1 {{.*}} ret
|
|
||||||
ret i64 undef
|
ret i64 undef
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue