1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
;=========================== begin_copyright_notice ============================
;
; Copyright (C) 2025 Intel Corporation
;
; SPDX-License-Identifier: MIT
;
;============================ end_copyright_notice =============================
; REQUIRES: llvm-14-plus
; RUN: igc_opt -opaque-pointers -igc-divrem-increment-reduction -S < %s | FileCheck %s
; ------------------------------------------------
;
; Nested increment reduction, optimization for second udiv/urem group based on result of first
;
; Nested decrement reduction, optimization disabled for now
; ------------------------------------------------
; CHECK-LABEL: @test_int_divrem_increment_reduction
define void @test_int_divrem_increment_reduction(i32 %a, i32 %b, i32 %c, ptr %dest1, ptr %dest2, ptr %dest3, ptr %dest4) {
; First DivRemGroup, retain
%quo = udiv i32 %a, %b
%rem = urem i32 %a, %b
%nested_quo = udiv i32 %quo, %c
%nested_rem = urem i32 %quo, %c
%next = add i32 %a, 1
; Next DivRemGroup, first DivRemPair optimization
; CHECK: [[PREINC_REM:%.*]] = add i32 %rem, 1
; CHECK-NEXT: [[PREINC_REM_TEST:%.*]] = icmp eq i32 [[PREINC_REM]], %b
; CHECK-NEXT: [[PREINC_QUO:%.*]] = add i32 %quo, 1
; CHECK-NEXT: [[NEW_NEXT_QUO:%.*]] = select i1 [[PREINC_REM_TEST]], i32 [[PREINC_QUO]], i32 %quo
; CHECK-NEXT: [[NEW_NEXT_REM:%.*]] = select i1 [[PREINC_REM_TEST]], i32 0, i32 [[PREINC_REM]]
; Check that original udiv/urem is deleted
; CHECK-NOT: udiv
; CHECK-NOT: urem
%next_quo = udiv i32 %next, %b
%next_rem = urem i32 %next, %b
; Next DivRemGroup, second (nested) DivRemPair optimization
; CHECK: [[PREINC_NESTED_REM:%.*]] = add i32 %nested_rem, 1
; CHECK-NEXT: [[PREINC_NESTED_REM_TEST:%.*]] = icmp eq i32 [[PREINC_NESTED_REM]], %c
; CHECK-NEXT: [[PREINC_NESTED_QUO:%.*]] = add i32 %nested_quo, 1
; CHECK-NEXT: [[NESTED_QUO_COND:%.*]] = and i1 [[PREINC_NESTED_REM_TEST]], [[PREINC_REM_TEST]]
; CHECK-NEXT: [[NEW_NEXT_NESTED_QUO:%.*]] = select i1 [[NESTED_QUO_COND]], i32 [[PREINC_NESTED_QUO]], i32 %nested_quo
; CHECK-NEXT: [[NEW_NEXT_NESTED_REM:%.*]] = select i1 [[PREINC_NESTED_REM_TEST]], i32 0, i32 [[PREINC_NESTED_REM]]
; CHECK-NEXT: [[MERGE_NEXT_NESTED_REM:%.*]] = select i1 [[PREINC_REM_TEST]], i32 [[NEW_NEXT_NESTED_REM]], i32 %nested_rem
; Check that original next nested udiv/urem is deleted
; CHECK-NOT: udiv
; CHECK-NOT: urem
%next_nested_quo = udiv i32 %next_quo, %c
%next_nested_rem = urem i32 %next_quo, %c
; Check that original uses are replaced
; CHECK: store i32 [[NEW_NEXT_QUO]], ptr %dest1
; CHECK: store i32 [[NEW_NEXT_REM]], ptr %dest2
; CHECK: store i32 [[NEW_NEXT_NESTED_QUO]], ptr %dest3
; CHECK: store i32 [[MERGE_NEXT_NESTED_REM]], ptr %dest4
store i32 %next_quo, ptr %dest1
store i32 %next_rem, ptr %dest2
store i32 %next_nested_quo, ptr %dest3
store i32 %next_nested_rem, ptr %dest4
ret void
}
; CHECK-LABEL: @test_int_divrem_decrement_reduction
define void @test_int_divrem_decrement_reduction(i32 %a, i32 %b, i32 %c, ptr %dest1, ptr %dest2, ptr %dest3, ptr %dest4) {
; First DivRemGroup, retain
%quo = udiv i32 %a, %b
%rem = urem i32 %a, %b
%nested_quo = udiv i32 %quo, %c
%nested_rem = urem i32 %quo, %c
%next = sub i32 %a, 1
; Next DivRemGroup, TODO: Negative offset DivRemPair optimization
; Ensure unoptimized result emitted for now
; CHECK: udiv i32 %next, %b
; CHECK: urem i32 %next, %b
; CHECK: udiv i32 %next_quo, %c
; CHECK: urem i32 %next_quo, %c
%next_quo = udiv i32 %next, %b
%next_rem = urem i32 %next, %b
%next_nested_quo = udiv i32 %next_quo, %c
%next_nested_rem = urem i32 %next_quo, %c
store i32 %next_quo, ptr %dest1
store i32 %next_rem, ptr %dest2
store i32 %next_nested_quo, ptr %dest3
store i32 %next_nested_rem, ptr %dest4
ret void
}
|
