File: pr46786.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 (132 lines) | stat: -rw-r--r-- 7,096 bytes parent folder | download | duplicates (12)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
; RUN: opt < %s -disable-output "-passes=print<scalar-evolution>" 2>&1 | FileCheck %s

source_filename = "input.cpp"
target datalayout = "e-m:e-p:32:32-i64:64-n32:64-S128"

; Function Attrs: nofree
define ptr @FSE_decompress_usingDTable(ptr %arg, i32 %arg1, i32 %arg2, i32 %arg3) local_unnamed_addr #0 {
; CHECK-LABEL: 'FSE_decompress_usingDTable'
; CHECK-NEXT:  Classifying expressions for: @FSE_decompress_usingDTable
; CHECK-NEXT:    %i = getelementptr inbounds i8, ptr %arg, i32 %arg2
; CHECK-NEXT:    --> (%arg2 + %arg) U: full-set S: full-set
; CHECK-NEXT:    %i4 = sub nsw i32 0, %arg1
; CHECK-NEXT:    --> (-1 * %arg1) U: full-set S: full-set
; CHECK-NEXT:    %i5 = getelementptr inbounds i8, ptr %i, i32 %i4
; CHECK-NEXT:    --> ((-1 * %arg1) + %arg2 + %arg) U: full-set S: full-set
; CHECK-NEXT:    %i7 = select i1 %i6, i32 %arg2, i32 %arg1
; CHECK-NEXT:    --> ((-1 * (ptrtoint ptr %arg to i32)) + (((-1 * %arg1) + (ptrtoint ptr %arg to i32) + %arg2) umin (ptrtoint ptr %arg to i32)) + %arg1) U: full-set S: full-set
; CHECK-NEXT:    %i8 = sub i32 %arg3, %i7
; CHECK-NEXT:    --> ((-1 * (((-1 * %arg1) + (ptrtoint ptr %arg to i32) + %arg2) umin (ptrtoint ptr %arg to i32))) + (-1 * %arg1) + (ptrtoint ptr %arg to i32) + %arg3) U: full-set S: full-set
; CHECK-NEXT:    %i9 = getelementptr inbounds i8, ptr %arg, i32 %i8
; CHECK-NEXT:    --> ((-1 * (((-1 * %arg1) + (ptrtoint ptr %arg to i32) + %arg2) umin (ptrtoint ptr %arg to i32))) + (-1 * %arg1) + (ptrtoint ptr %arg to i32) + %arg3 + %arg) U: full-set S: full-set
; CHECK-NEXT:  Determining loop execution counts for: @FSE_decompress_usingDTable
;
bb:
  %i = getelementptr inbounds i8, ptr %arg, i32 %arg2
  %i4 = sub nsw i32 0, %arg1
  %i5 = getelementptr inbounds i8, ptr %i, i32 %i4
  %i6 = icmp ult ptr %i5, %arg
  %i7 = select i1 %i6, i32 %arg2, i32 %arg1
  %i8 = sub i32 %arg3, %i7
  %i9 = getelementptr inbounds i8, ptr %arg, i32 %i8
  ret ptr %i9
}

define ptr @test_01(ptr %p) {
; CHECK-LABEL: 'test_01'
; CHECK-NEXT:  Classifying expressions for: @test_01
; CHECK-NEXT:    %p1 = getelementptr i8, ptr %p, i32 2
; CHECK-NEXT:    --> (2 + %p) U: full-set S: full-set
; CHECK-NEXT:    %p2 = getelementptr i8, ptr %p, i32 1
; CHECK-NEXT:    --> (1 + %p) U: full-set S: full-set
; CHECK-NEXT:    %index = select i1 %cmp, i32 2, i32 1
; CHECK-NEXT:    --> ((-1 * (ptrtoint ptr %p to i32)) + ((1 + (ptrtoint ptr %p to i32)) umax (2 + (ptrtoint ptr %p to i32)))) U: full-set S: full-set
; CHECK-NEXT:    %neg_index = sub i32 0, %index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) umax (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32)) U: full-set S: full-set
; CHECK-NEXT:    %gep = getelementptr i8, ptr %p, i32 %neg_index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) umax (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32) + %p) U: full-set S: full-set
; CHECK-NEXT:  Determining loop execution counts for: @test_01
;
  %p1 = getelementptr i8, ptr %p, i32 2
  %p2 = getelementptr i8, ptr %p, i32 1
  %cmp = icmp ugt ptr %p1, %p2
  %index = select i1 %cmp, i32 2, i32 1
  %neg_index = sub i32 0, %index
  %gep = getelementptr i8, ptr %p, i32 %neg_index
  ret ptr %gep
}

define ptr @test_02(ptr %p) {
; CHECK-LABEL: 'test_02'
; CHECK-NEXT:  Classifying expressions for: @test_02
; CHECK-NEXT:    %p1 = getelementptr i8, ptr %p, i32 2
; CHECK-NEXT:    --> (2 + %p) U: full-set S: full-set
; CHECK-NEXT:    %p2 = getelementptr i8, ptr %p, i32 1
; CHECK-NEXT:    --> (1 + %p) U: full-set S: full-set
; CHECK-NEXT:    %index = select i1 %cmp, i32 2, i32 1
; CHECK-NEXT:    --> ((-1 * (ptrtoint ptr %p to i32)) + ((1 + (ptrtoint ptr %p to i32)) smax (2 + (ptrtoint ptr %p to i32)))) U: full-set S: full-set
; CHECK-NEXT:    %neg_index = sub i32 0, %index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) smax (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32)) U: full-set S: full-set
; CHECK-NEXT:    %gep = getelementptr i8, ptr %p, i32 %neg_index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) smax (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32) + %p) U: full-set S: full-set
; CHECK-NEXT:  Determining loop execution counts for: @test_02
;
  %p1 = getelementptr i8, ptr %p, i32 2
  %p2 = getelementptr i8, ptr %p, i32 1
  %cmp = icmp sgt ptr %p1, %p2
  %index = select i1 %cmp, i32 2, i32 1
  %neg_index = sub i32 0, %index
  %gep = getelementptr i8, ptr %p, i32 %neg_index
  ret ptr %gep
}

define ptr @test_03(ptr %p) {
; CHECK-LABEL: 'test_03'
; CHECK-NEXT:  Classifying expressions for: @test_03
; CHECK-NEXT:    %p1 = getelementptr i8, ptr %p, i32 2
; CHECK-NEXT:    --> (2 + %p) U: full-set S: full-set
; CHECK-NEXT:    %p2 = getelementptr i8, ptr %p, i32 1
; CHECK-NEXT:    --> (1 + %p) U: full-set S: full-set
; CHECK-NEXT:    %index = select i1 %cmp, i32 2, i32 1
; CHECK-NEXT:    --> ((-1 * (ptrtoint ptr %p to i32)) + ((1 + (ptrtoint ptr %p to i32)) umin (2 + (ptrtoint ptr %p to i32)))) U: full-set S: full-set
; CHECK-NEXT:    %neg_index = sub i32 0, %index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) umin (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32)) U: full-set S: full-set
; CHECK-NEXT:    %gep = getelementptr i8, ptr %p, i32 %neg_index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) umin (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32) + %p) U: full-set S: full-set
; CHECK-NEXT:  Determining loop execution counts for: @test_03
;
  %p1 = getelementptr i8, ptr %p, i32 2
  %p2 = getelementptr i8, ptr %p, i32 1
  %cmp = icmp ult ptr %p1, %p2
  %index = select i1 %cmp, i32 2, i32 1
  %neg_index = sub i32 0, %index
  %gep = getelementptr i8, ptr %p, i32 %neg_index
  ret ptr %gep
}

define ptr @test_04(ptr %p) {
; CHECK-LABEL: 'test_04'
; CHECK-NEXT:  Classifying expressions for: @test_04
; CHECK-NEXT:    %p1 = getelementptr i8, ptr %p, i32 2
; CHECK-NEXT:    --> (2 + %p) U: full-set S: full-set
; CHECK-NEXT:    %p2 = getelementptr i8, ptr %p, i32 1
; CHECK-NEXT:    --> (1 + %p) U: full-set S: full-set
; CHECK-NEXT:    %index = select i1 %cmp, i32 2, i32 1
; CHECK-NEXT:    --> ((-1 * (ptrtoint ptr %p to i32)) + ((1 + (ptrtoint ptr %p to i32)) smin (2 + (ptrtoint ptr %p to i32)))) U: full-set S: full-set
; CHECK-NEXT:    %neg_index = sub i32 0, %index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) smin (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32)) U: full-set S: full-set
; CHECK-NEXT:    %gep = getelementptr i8, ptr %p, i32 %neg_index
; CHECK-NEXT:    --> ((-1 * ((1 + (ptrtoint ptr %p to i32)) smin (2 + (ptrtoint ptr %p to i32)))) + (ptrtoint ptr %p to i32) + %p) U: full-set S: full-set
; CHECK-NEXT:  Determining loop execution counts for: @test_04
;
  %p1 = getelementptr i8, ptr %p, i32 2
  %p2 = getelementptr i8, ptr %p, i32 1
  %cmp = icmp slt ptr %p1, %p2
  %index = select i1 %cmp, i32 2, i32 1
  %neg_index = sub i32 0, %index
  %gep = getelementptr i8, ptr %p, i32 %neg_index
  ret ptr %gep
}

attributes #0 = { nofree }