llvm-project

Форк
0
/
debugcounter-divrempairs.ll 
91 строка · 2.5 Кб
1
; REQUIRES: asserts
2
; RUN: opt < %s -passes=div-rem-pairs -debug-counter=div-rem-pairs-transform=1 \
3
; RUN: -S -mtriple=x86_64-unknown-unknown    | FileCheck %s
4
;; Test that, with debug counters on, we only skip the first div-rem-pairs opportunity, optimize one after it,
5
;; and then ignore all the others. There is 1 optimization opportunity in f1, 2 in f2, and another 1 in f3,
6
;; only the first one in f2 will be performed.
7

8
define i64 @f1(i64 %a, i64 %b) {
9
; CHECK-LABEL: @f1(
10
; CHECK-NEXT:  entry:
11
; CHECK-NEXT:    [[REM:%.*]] = urem i64 %a, %b
12
; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i64 [[REM]], 42
13
; CHECK-NEXT:    br i1 [[CMP]], label %if, label %end
14
; CHECK:       if:
15
; CHECK-NEXT:    [[DIV:%.*]] = udiv i64 %a, %b
16
; CHECK-NEXT:    br label %end
17
; CHECK:       end:
18
; CHECK-NEXT:    [[RET:%.*]] = phi i64 [ [[DIV]], %if ], [ 3, %entry ]
19
; CHECK-NEXT:    ret i64 [[RET]]
20
;
21
entry:
22
  %rem = urem i64 %a, %b
23
  %cmp = icmp eq i64 %rem, 42
24
  br i1 %cmp, label %if, label %end
25

26
if:
27
  %div = udiv i64 %a, %b
28
  br label %end
29

30
end:
31
  %ret = phi i64 [ %div, %if ], [ 3, %entry ]
32
  ret i64 %ret
33
}
34

35
define i16 @f2(i16 %a, i16 %b) {
36
; CHECK-LABEL: @f2(
37
; CHECK-NEXT:  entry:
38
; CHECK-NEXT:    [[DIV1:%.*]] = sdiv i16 %a, %b
39
; CHECK-NEXT:    [[REM1:%.*]] = srem i16 %a, %b
40
; CHECK-NEXT:    [[DIV2:%.*]] = udiv i16 %a, %b
41
; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i16 [[DIV1]], 42
42
; CHECK-NEXT:    br i1 [[CMP]], label %if, label %end
43
; CHECK:       if:
44
; CHECK-NEXT:    [[REM2:%.*]] = urem i16 %a, %b
45
; CHECK-NEXT:    br label %end
46
; CHECK:       end:
47
; CHECK-NEXT:    [[RET:%.*]] = phi i16 [ [[REM1]], %if ], [ 3, %entry ]
48
; CHECK-NEXT:    ret i16 [[RET]]
49
;
50
entry:
51
  %div1 = sdiv i16 %a, %b
52
  %div2 = udiv i16 %a, %b
53
  %cmp = icmp eq i16 %div1, 42
54
  br i1 %cmp, label %if, label %end
55

56
if:
57
  %rem1 = srem i16 %a, %b
58
  %rem2 = urem i16 %a, %b
59
  br label %end
60

61
end:
62
  %ret = phi i16 [ %rem1, %if ], [ 3, %entry ]
63
  ret i16 %ret
64
}
65

66
define i32 @f3(i32 %a, i32 %b) {
67
; CHECK-LABEL: @f3(
68
; CHECK-NEXT:  entry:
69
; CHECK-NEXT:    [[REM:%.*]] = srem i32 %a, %b
70
; CHECK-NEXT:    [[CMP:%.*]] = icmp eq i32 [[REM]], 42
71
; CHECK-NEXT:    br i1 [[CMP]], label %if, label %end
72
; CHECK:       if:
73
; CHECK-NEXT:    [[DIV:%.*]] = sdiv i32 %a, %b
74
; CHECK-NEXT:    br label %end
75
; CHECK:       end:
76
; CHECK-NEXT:    [[RET:%.*]] = phi i32 [ [[DIV]], %if ], [ 3, %entry ]
77
; CHECK-NEXT:    ret i32 [[RET]]
78
;
79
entry:
80
  %rem = srem i32 %a, %b
81
  %cmp = icmp eq i32 %rem, 42
82
  br i1 %cmp, label %if, label %end
83

84
if:
85
  %div = sdiv i32 %a, %b
86
  br label %end
87

88
end:
89
  %ret = phi i32 [ %div, %if ], [ 3, %entry ]
90
  ret i32 %ret
91
}
92

Использование cookies

Мы используем файлы cookie в соответствии с Политикой конфиденциальности и Политикой использования cookies.

Нажимая кнопку «Принимаю», Вы даете АО «СберТех» согласие на обработку Ваших персональных данных в целях совершенствования нашего веб-сайта и Сервиса GitVerse, а также повышения удобства их использования.

Запретить использование cookies Вы можете самостоятельно в настройках Вашего браузера.