brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.6 KiB · 668051e Raw
76 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py2; RUN: opt -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s3 4declare i32 @llvm.uadd.sat.i32(i32, i32)5declare i32 @llvm.sadd.sat.i32(i32, i32)6declare i32 @llvm.usub.sat.i32(i32, i32)7declare i32 @llvm.ssub.sat.i32(i32, i32)8declare i32 @llvm.ushl.sat.i32(i32, i32)9declare i32 @llvm.sshl.sat.i32(i32, i32)10 11define i32 @uadd_sat(i32 %x, i32 %y) {12; CHECK-LABEL: 'uadd_sat'13; CHECK-NEXT:  Classifying expressions for: @uadd_sat14; CHECK-NEXT:    %z = call i32 @llvm.uadd.sat.i32(i32 %x, i32 %y)15; CHECK-NEXT:    --> (((-1 + (-1 * %y)) umin %x) + %y)<nuw> U: full-set S: full-set16; CHECK-NEXT:  Determining loop execution counts for: @uadd_sat17;18  %z = call i32 @llvm.uadd.sat.i32(i32 %x, i32 %y)19  ret i32 %z20}21 22define i32 @sadd_sat(i32 %x, i32 %y) {23; CHECK-LABEL: 'sadd_sat'24; CHECK-NEXT:  Classifying expressions for: @sadd_sat25; CHECK-NEXT:    %z = call i32 @llvm.sadd.sat.i32(i32 %x, i32 %y)26; CHECK-NEXT:    --> %z U: full-set S: full-set27; CHECK-NEXT:  Determining loop execution counts for: @sadd_sat28;29  %z = call i32 @llvm.sadd.sat.i32(i32 %x, i32 %y)30  ret i32 %z31}32 33define i32 @usub_sat(i32 %x, i32 %y) {34; CHECK-LABEL: 'usub_sat'35; CHECK-NEXT:  Classifying expressions for: @usub_sat36; CHECK-NEXT:    %z = call i32 @llvm.usub.sat.i32(i32 %x, i32 %y)37; CHECK-NEXT:    --> ((-1 * (%x umin %y)) + %x) U: full-set S: full-set38; CHECK-NEXT:  Determining loop execution counts for: @usub_sat39;40  %z = call i32 @llvm.usub.sat.i32(i32 %x, i32 %y)41  ret i32 %z42}43 44define i32 @ssub_sat(i32 %x, i32 %y) {45; CHECK-LABEL: 'ssub_sat'46; CHECK-NEXT:  Classifying expressions for: @ssub_sat47; CHECK-NEXT:    %z = call i32 @llvm.ssub.sat.i32(i32 %x, i32 %y)48; CHECK-NEXT:    --> %z U: full-set S: full-set49; CHECK-NEXT:  Determining loop execution counts for: @ssub_sat50;51  %z = call i32 @llvm.ssub.sat.i32(i32 %x, i32 %y)52  ret i32 %z53}54 55define i32 @ushl_sat(i32 %x, i32 %y) {56; CHECK-LABEL: 'ushl_sat'57; CHECK-NEXT:  Classifying expressions for: @ushl_sat58; CHECK-NEXT:    %z = call i32 @llvm.ushl.sat.i32(i32 %x, i32 %y)59; CHECK-NEXT:    --> %z U: full-set S: full-set60; CHECK-NEXT:  Determining loop execution counts for: @ushl_sat61;62  %z = call i32 @llvm.ushl.sat.i32(i32 %x, i32 %y)63  ret i32 %z64}65 66define i32 @sshl_sat(i32 %x, i32 %y) {67; CHECK-LABEL: 'sshl_sat'68; CHECK-NEXT:  Classifying expressions for: @sshl_sat69; CHECK-NEXT:    %z = call i32 @llvm.sshl.sat.i32(i32 %x, i32 %y)70; CHECK-NEXT:    --> %z U: full-set S: full-set71; CHECK-NEXT:  Determining loop execution counts for: @sshl_sat72;73  %z = call i32 @llvm.sshl.sat.i32(i32 %x, i32 %y)74  ret i32 %z75}76