File: reassoc-shl-addi-add.ll

package info (click to toggle)
llvm-toolchain-21 1%3A21.1.4-5
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 2,236,516 kB
  • sloc: cpp: 7,619,569; ansic: 1,433,956; asm: 1,058,748; python: 252,181; f90: 94,671; objc: 70,753; lisp: 42,813; pascal: 18,401; sh: 8,601; ml: 5,111; perl: 4,720; makefile: 3,585; awk: 3,523; javascript: 2,272; xml: 892; fortran: 770
file content (86 lines) | stat: -rw-r--r-- 2,437 bytes parent folder | download | duplicates (8)
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
; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py UTC_ARGS: --version 5
; RUN: llc -mtriple=riscv32-unknown-elf -mattr=+zba %s -o - | FileCheck %s

declare i32 @callee2(i32, i32)
declare i32 @callee3(i32, i32, i32)

; Positive test
; The users of addi aren't more than 2
define void @t1(i32 %a, i32 %b, i32 %c) {
; CHECK-LABEL: t1:
; CHECK:       # %bb.0: # %entry
; CHECK-NEXT:    sh2add a2, a0, a2
; CHECK-NEXT:    sh2add a0, a0, a1
; CHECK-NEXT:    addi a0, a0, 42
; CHECK-NEXT:    addi a1, a2, 42
; CHECK-NEXT:    tail callee2
entry:
  %shl = shl i32 %a, 2
  %add = add nsw i32 %shl, 42
  %add1 = add nsw i32 %add, %b
  %add2 = add nsw i32 %add, %c
  %call = tail call i32 @callee2(i32 %add1, i32 %add2)
  ret void
}

; Negative test
; The users of addi are more than 2.
define void @t2(i32 %a, i32 %b, i32 %c, i32 %d, i32 %e) {
; CHECK-LABEL: t2:
; CHECK:       # %bb.0: # %entry
; CHECK-NEXT:    slli a0, a0, 2
; CHECK-NEXT:    addi a4, a0, 42
; CHECK-NEXT:    add a0, a4, a1
; CHECK-NEXT:    add a1, a4, a2
; CHECK-NEXT:    add a2, a4, a3
; CHECK-NEXT:    tail callee3
entry:
  %shl = shl i32 %a, 2
  %add = add nsw i32 %shl, 42
  %add1 = add nsw i32 %add, %b
  %add2 = add nsw i32 %add, %c
  %add3 = add nsw i32 %add, %d
  %call = tail call i32 @callee3(i32 %add1, i32 %add2, i32 %add3)
  ret void
}

; Negative test
; shl doesn't have one use.
define void @t3(i32 %a, i32 %b, i32 %c, i32 %d) {
; CHECK-LABEL: t3:
; CHECK:       # %bb.0: # %entry
; CHECK-NEXT:    slli a4, a0, 2
; CHECK-NEXT:    addi a5, a4, 45
; CHECK-NEXT:    add a4, a5, a1
; CHECK-NEXT:    add a1, a5, a2
; CHECK-NEXT:    sh2add a2, a0, a3
; CHECK-NEXT:    mv a0, a4
; CHECK-NEXT:    tail callee3
entry:
  %shl = shl i32 %a, 2
  %add = add nsw i32 %shl, 45
  %add1 = add nsw i32 %add, %b
  %add2 = add nsw i32 %add, %c
  %add3 = add nsw i32 %shl, %d
  %call = tail call i32 @callee3(i32 %add1, i32 %add2, i32 %add3)
  ret void
}

; Negative test
; shift amount isn't 1, 2, or 3.
define void @t4(i32 %a, i32 %b, i32 %c, i32 %d) {
; CHECK-LABEL: t4:
; CHECK:       # %bb.0: # %entry
; CHECK-NEXT:    slli a0, a0, 4
; CHECK-NEXT:    addi a3, a0, 45
; CHECK-NEXT:    add a0, a3, a1
; CHECK-NEXT:    add a1, a3, a2
; CHECK-NEXT:    tail callee2
entry:
  %shl = shl i32 %a, 4
  %add = add nsw i32 %shl, 45
  %add1 = add nsw i32 %add, %b
  %add2 = add nsw i32 %add, %c
  %call = tail call i32 @callee2(i32 %add1, i32 %add2)
  ret void
}