File: memrchr-7.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (83 lines) | stat: -rw-r--r-- 2,517 bytes parent folder | download | duplicates (10)
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
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -passes=instcombine -S | FileCheck %s
;
; Verify that the result of memrchr calls with past-the-end pointers used
; in equality expressions don't cause trouble and either are folded when
; they might be valid or not when they're provably undefined.

declare ptr @memrchr(ptr, i32, i64)


@a5 = constant [5 x i8] c"12345"


; Fold memrchr(a5 + 5, c, 1) == a5 + 5 to an arbitrary constant.
; The call is transformed to a5[5] == c by the memrchr simplifier, with
; a5[5] being indeterminate.  The equality then is the folded with
; an undefined/arbitrary result.

define i1 @call_memrchr_ap5_c_1_eq_a(i32 %c, i64 %n) {
; CHECK-LABEL: @call_memrchr_ap5_c_1_eq_a(
; CHECK-NEXT:    ret i1 poison
;
  %pap5 = getelementptr [5 x i8], ptr @a5, i32 0, i32 5
  %qap5 = getelementptr [5 x i8], ptr @a5, i32 1, i32 0
  %q = call ptr @memrchr(ptr %pap5, i32 %c, i64 1)
  %cmp = icmp eq ptr %q, %qap5
  ret i1 %cmp
}


; Fold memrchr(a5 + 5, c, 5) == a5 + 5 to an arbitrary constant.

define i1 @call_memrchr_ap5_c_5_eq_a(i32 %c, i64 %n) {
; CHECK-LABEL: @call_memrchr_ap5_c_5_eq_a(
; CHECK-NEXT:    ret i1 false
;
  %pap5 = getelementptr [5 x i8], ptr @a5, i32 0, i32 5
  %qap5 = getelementptr [5 x i8], ptr @a5, i32 1, i32 0
  %q = call ptr @memrchr(ptr %pap5, i32 %c, i64 5)
  %cmp = icmp eq ptr %q, %qap5
  ret i1 %cmp
}


; Fold memrchr(a5 + 5, c, n) == a5 to false.

define i1 @fold_memrchr_ap5_c_n_eq_a(i32 %c, i64 %n) {
; CHECK-LABEL: @fold_memrchr_ap5_c_n_eq_a(
; CHECK-NEXT:    ret i1 false
;
  %pap5 = getelementptr [5 x i8], ptr @a5, i32 0, i32 5
  %q = call ptr @memrchr(ptr %pap5, i32 %c, i64 %n)
  %cmp = icmp eq ptr %q, @a5
  ret i1 %cmp
}


; Fold memrchr(a5 + 5, c, n) == null to true on the basis that n must
; be zero in order for the call to be valid.

define i1 @fold_memrchr_ap5_c_n_eqz(i32 %c, i64 %n) {
; CHECK-LABEL: @fold_memrchr_ap5_c_n_eqz(
; CHECK-NEXT:    ret i1 true
;
  %p = getelementptr [5 x i8], ptr @a5, i32 0, i32 5
  %q = call ptr @memrchr(ptr %p, i32 %c, i64 %n)
  %cmp = icmp eq ptr %q, null
  ret i1 %cmp
}


; Fold memrchr(a5 + 5, '\0', n) == null to true again on the basis that
; n must be zero in order for the call to be valid.

define i1 @fold_memrchr_a_nul_n_eqz(i64 %n) {
; CHECK-LABEL: @fold_memrchr_a_nul_n_eqz(
; CHECK-NEXT:    ret i1 true
;
  %p = getelementptr [5 x i8], ptr @a5, i32 0, i32 5
  %q = call ptr @memrchr(ptr %p, i32 0, i64 %n)
  %cmp = icmp eq ptr %q, null
  ret i1 %cmp
}