123 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			LLVM
		
	
	
	
			
		
		
	
	
			123 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			LLVM
		
	
	
	
| ; RUN: opt -S -analyze -scalar-evolution < %s | FileCheck %s
 | |
| 
 | |
| !0 = !{i8 0, i8 127}
 | |
| 
 | |
| define void @f0(i8* %len_addr) {
 | |
| ; CHECK-LABEL: Classifying expressions for: @f0
 | |
|  entry:
 | |
|   %len = load i8, i8* %len_addr, !range !0
 | |
|   %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK:  %len = load i8, i8* %len_addr, !range !0
 | |
| ; CHECK-NEXT:  -->  %len U: [0,127) S: [0,127)
 | |
| ; CHECK:  %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK-NEXT:  -->  %len_norange U: full-set S: full-set
 | |
| 
 | |
|   %t0 = add i8 %len, 1
 | |
|   %t1 = add i8 %len, 2
 | |
| ; CHECK:  %t0 = add i8 %len, 1
 | |
| ; CHECK-NEXT:  -->  (1 + %len)<nuw><nsw> U: [1,-128) S: [1,-128)
 | |
| ; CHECK:  %t1 = add i8 %len, 2
 | |
| ; CHECK-NEXT:  -->  (2 + %len)<nuw> U: [2,-127) S: [2,-127)
 | |
| 
 | |
|   %t2 = sub i8 %len, 1
 | |
|   %t3 = sub i8 %len, 2
 | |
| ; CHECK:  %t2 = sub i8 %len, 1
 | |
| ; CHECK-NEXT:  -->  (-1 + %len)<nsw> U: [-1,126) S: [-1,126)
 | |
| ; CHECK:  %t3 = sub i8 %len, 2
 | |
| ; CHECK-NEXT:  -->  (-2 + %len)<nsw> U: [-2,125) S: [-2,125)
 | |
| 
 | |
|   %q0 = add i8 %len_norange, 1
 | |
|   %q1 = add i8 %len_norange, 2
 | |
| ; CHECK:  %q0 = add i8 %len_norange, 1
 | |
| ; CHECK-NEXT:  -->  (1 + %len_norange) U: full-set S: full-set
 | |
| ; CHECK:  %q1 = add i8 %len_norange, 2
 | |
| ; CHECK-NEXT:  -->  (2 + %len_norange) U: full-set S: full-set
 | |
| 
 | |
|   %q2 = sub i8 %len_norange, 1
 | |
|   %q3 = sub i8 %len_norange, 2
 | |
| ; CHECK:  %q2 = sub i8 %len_norange, 1
 | |
| ; CHECK-NEXT:  -->  (-1 + %len_norange) U: full-set S: full-set
 | |
| ; CHECK:  %q3 = sub i8 %len_norange, 2
 | |
| ; CHECK-NEXT:  -->  (-2 + %len_norange) U: full-set S: full-set
 | |
| 
 | |
|   ret void
 | |
| }
 | |
| 
 | |
| define void @f1(i8* %len_addr) {
 | |
| ; CHECK-LABEL: Classifying expressions for: @f1
 | |
|  entry:
 | |
|   %len = load i8, i8* %len_addr, !range !0
 | |
|   %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK:  %len = load i8, i8* %len_addr, !range !0
 | |
| ; CHECK-NEXT:  -->  %len U: [0,127) S: [0,127)
 | |
| ; CHECK:  %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK-NEXT:  -->  %len_norange U: full-set S: full-set
 | |
| 
 | |
|   %t0 = add i8 %len, -1
 | |
|   %t1 = add i8 %len, -2
 | |
| ; CHECK:  %t0 = add i8 %len, -1
 | |
| ; CHECK-NEXT:  -->  (-1 + %len)<nsw> U: [-1,126) S: [-1,126)
 | |
| ; CHECK:  %t1 = add i8 %len, -2
 | |
| ; CHECK-NEXT:  -->  (-2 + %len)<nsw> U: [-2,125) S: [-2,125)
 | |
| 
 | |
|   %t0.sext = sext i8 %t0 to i16
 | |
|   %t1.sext = sext i8 %t1 to i16
 | |
| ; CHECK:  %t0.sext = sext i8 %t0 to i16
 | |
| ; CHECK-NEXT:  -->  (-1 + (zext i8 %len to i16))<nsw> U: [-1,126) S: [-1,126)
 | |
| ; CHECK:  %t1.sext = sext i8 %t1 to i16
 | |
| ; CHECK-NEXT:  -->  (-2 + (zext i8 %len to i16))<nsw> U: [-2,125) S: [-2,125)
 | |
| 
 | |
|   %q0 = add i8 %len_norange, 1
 | |
|   %q1 = add i8 %len_norange, 2
 | |
| ; CHECK:  %q0 = add i8 %len_norange, 1
 | |
| ; CHECK-NEXT:  -->  (1 + %len_norange) U: full-set S: full-set
 | |
| ; CHECK:  %q1 = add i8 %len_norange, 2
 | |
| ; CHECK-NEXT:  -->  (2 + %len_norange) U: full-set S: full-set
 | |
| 
 | |
|   %q0.sext = sext i8 %q0 to i16
 | |
|   %q1.sext = sext i8 %q1 to i16
 | |
| ; CHECK:  %q0.sext = sext i8 %q0 to i16
 | |
| ; CHECK-NEXT:  -->  (sext i8 (1 + %len_norange) to i16) U: [-128,128) S: [-128,128)
 | |
| ; CHECK:  %q1.sext = sext i8 %q1 to i16
 | |
| ; CHECK-NEXT:  -->  (sext i8 (2 + %len_norange) to i16) U: [-128,128) S: [-128,128)
 | |
| 
 | |
|   ret void
 | |
| }
 | |
| 
 | |
| define void @f2(i8* %len_addr) {
 | |
| ; CHECK-LABEL: Classifying expressions for: @f2
 | |
|  entry:
 | |
|   %len = load i8, i8* %len_addr, !range !0
 | |
|   %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK:  %len = load i8, i8* %len_addr, !range !0
 | |
| ; CHECK-NEXT:  -->  %len U: [0,127) S: [0,127)
 | |
| ; CHECK:  %len_norange = load i8, i8* %len_addr
 | |
| ; CHECK-NEXT:  -->  %len_norange U: full-set S: full-set
 | |
| 
 | |
|   %t0 = add i8 %len, 1
 | |
|   %t1 = add i8 %len, 2
 | |
| ; CHECK:  %t0 = add i8 %len, 1
 | |
| ; CHECK-NEXT:  -->  (1 + %len)<nuw><nsw>
 | |
| ; CHECK:  %t1 = add i8 %len, 2
 | |
| ; CHECK-NEXT:  -->  (2 + %len)<nuw>
 | |
| 
 | |
|   %t0.zext = zext i8 %t0 to i16
 | |
|   %t1.zext = zext i8 %t1 to i16
 | |
| ; CHECK:  %t0.zext = zext i8 %t0 to i16
 | |
| ; CHECK-NEXT: -->  (1 + (zext i8 %len to i16))<nuw><nsw> U: [1,128) S: [1,128)
 | |
| ; CHECK:  %t1.zext = zext i8 %t1 to i16
 | |
| ; CHECK-NEXT:  -->  (2 + (zext i8 %len to i16))<nuw><nsw> U: [2,129) S: [2,129)
 | |
| 
 | |
|   %q0 = add i8 %len_norange, 1
 | |
|   %q1 = add i8 %len_norange, 2
 | |
|   %q0.zext = zext i8 %q0 to i16
 | |
|   %q1.zext = zext i8 %q1 to i16
 | |
| 
 | |
| ; CHECK:  %q0.zext = zext i8 %q0 to i16
 | |
| ; CHECK-NEXT:  -->  (zext i8 (1 + %len_norange) to i16) U: [0,256) S: [0,256)
 | |
| ; CHECK:  %q1.zext = zext i8 %q1 to i16
 | |
| ; CHECK-NEXT:  -->  (zext i8 (2 + %len_norange) to i16) U: [0,256) S: [0,256)
 | |
| 
 | |
|   ret void
 | |
| }
 |