[llvm] b38bd86 - [SCEV] Regenerate test checks (NFC)
Nikita Popov via llvm-commits
llvm-commits at lists.llvm.org
Tue May 16 02:33:41 PDT 2023
Author: Nikita Popov
Date: 2023-05-16T11:33:21+02:00
New Revision: b38bd860771221e8840a26131fabbce51ebd6a99
URL: https://github.com/llvm/llvm-project/commit/b38bd860771221e8840a26131fabbce51ebd6a99
DIFF: https://github.com/llvm/llvm-project/commit/b38bd860771221e8840a26131fabbce51ebd6a99.diff
LOG: [SCEV] Regenerate test checks (NFC)
Added:
Modified:
llvm/test/Analysis/ScalarEvolution/extract-highbits-variablemask.ll
llvm/test/Analysis/ScalarEvolution/extract-lowbits-variablemask.ll
Removed:
################################################################################
diff --git a/llvm/test/Analysis/ScalarEvolution/extract-highbits-variablemask.ll b/llvm/test/Analysis/ScalarEvolution/extract-highbits-variablemask.ll
index bd191c42ca4c8..051c7d2cf3d6f 100644
--- a/llvm/test/Analysis/ScalarEvolution/extract-highbits-variablemask.ll
+++ b/llvm/test/Analysis/ScalarEvolution/extract-highbits-variablemask.ll
@@ -8,9 +8,9 @@ define i32 @div(i32 %val, i32 %num) nounwind {
; CHECK-LABEL: 'div'
; CHECK-NEXT: Classifying expressions for: @div
; CHECK-NEXT: %tmp1 = udiv i32 %val, %num
-; CHECK-NEXT: --> (%val /u %num) U: full-set S: full-set
+; CHECK-NEXT: --> (%val /u %num) U: full-set S: full-set
; CHECK-NEXT: %tmp2 = mul i32 %tmp1, %num
-; CHECK-NEXT: --> ((%val /u %num) * %num)<nuw> U: full-set S: full-set
+; CHECK-NEXT: --> ((%val /u %num) * %num)<nuw> U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @div
;
%tmp1 = udiv i32 %val, %num
@@ -22,9 +22,9 @@ define i32 @sdiv(i32 %val, i32 %num) nounwind {
; CHECK-LABEL: 'sdiv'
; CHECK-NEXT: Classifying expressions for: @sdiv
; CHECK-NEXT: %tmp1 = sdiv i32 %val, %num
-; CHECK-NEXT: --> %tmp1 U: full-set S: full-set
+; CHECK-NEXT: --> %tmp1 U: full-set S: full-set
; CHECK-NEXT: %tmp2 = mul i32 %tmp1, %num
-; CHECK-NEXT: --> (%num * %tmp1) U: full-set S: full-set
+; CHECK-NEXT: --> (%num * %tmp1) U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @sdiv
;
%tmp1 = sdiv i32 %val, %num
@@ -40,9 +40,9 @@ define i32 @mask_b(i32 %val, i32 %numlowbits) nounwind {
; CHECK-LABEL: 'mask_b'
; CHECK-NEXT: Classifying expressions for: @mask_b
; CHECK-NEXT: %mask = shl i32 -1, %numlowbits
-; CHECK-NEXT: --> %mask U: full-set S: full-set
+; CHECK-NEXT: --> %mask U: full-set S: full-set
; CHECK-NEXT: %masked = and i32 %mask, %val
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_b
;
%mask = shl i32 -1, %numlowbits
@@ -54,11 +54,11 @@ define i32 @mask_d(i32 %val, i32 %lowbits) nounwind {
; CHECK-LABEL: 'mask_d'
; CHECK-NEXT: Classifying expressions for: @mask_d
; CHECK-NEXT: %numlowbits = sub i32 32, %lowbits
-; CHECK-NEXT: --> (32 + (-1 * %lowbits)) U: full-set S: full-set
+; CHECK-NEXT: --> (32 + (-1 * %lowbits)) U: full-set S: full-set
; CHECK-NEXT: %lowbitscleared = lshr i32 %val, %numlowbits
-; CHECK-NEXT: --> %lowbitscleared U: full-set S: full-set
+; CHECK-NEXT: --> %lowbitscleared U: full-set S: full-set
; CHECK-NEXT: %masked = shl i32 %lowbitscleared, %numlowbits
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_d
;
%numlowbits = sub i32 32, %lowbits
diff --git a/llvm/test/Analysis/ScalarEvolution/extract-lowbits-variablemask.ll b/llvm/test/Analysis/ScalarEvolution/extract-lowbits-variablemask.ll
index 181f7188de0b1..986bd2e3165be 100644
--- a/llvm/test/Analysis/ScalarEvolution/extract-lowbits-variablemask.ll
+++ b/llvm/test/Analysis/ScalarEvolution/extract-lowbits-variablemask.ll
@@ -8,9 +8,9 @@ define i32 @mul(i32 %val, i32 %num) nounwind {
; CHECK-LABEL: 'mul'
; CHECK-NEXT: Classifying expressions for: @mul
; CHECK-NEXT: %tmp1 = mul i32 %val, %num
-; CHECK-NEXT: --> (%val * %num) U: full-set S: full-set
+; CHECK-NEXT: --> (%val * %num) U: full-set S: full-set
; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, %num
-; CHECK-NEXT: --> ((%val * %num) /u %num) U: full-set S: full-set
+; CHECK-NEXT: --> ((%val * %num) /u %num) U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mul
;
%tmp1 = mul i32 %val, %num
@@ -28,11 +28,11 @@ define i32 @mask_a(i32 %val, i32 %numlowbits) nounwind {
; CHECK-LABEL: 'mask_a'
; CHECK-NEXT: Classifying expressions for: @mask_a
; CHECK-NEXT: %onebit = shl i32 1, %numlowbits
-; CHECK-NEXT: --> %onebit U: full-set S: full-set
+; CHECK-NEXT: --> %onebit U: full-set S: full-set
; CHECK-NEXT: %mask = add nsw i32 %onebit, -1
-; CHECK-NEXT: --> (-1 + %onebit) U: full-set S: full-set
+; CHECK-NEXT: --> (-1 + %onebit) U: full-set S: full-set
; CHECK-NEXT: %masked = and i32 %mask, %val
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_a
;
%onebit = shl i32 1, %numlowbits
@@ -45,11 +45,11 @@ define i32 @mask_b(i32 %val, i32 %numlowbits) nounwind {
; CHECK-LABEL: 'mask_b'
; CHECK-NEXT: Classifying expressions for: @mask_b
; CHECK-NEXT: %notmask = shl i32 -1, %numlowbits
-; CHECK-NEXT: --> %notmask U: full-set S: full-set
+; CHECK-NEXT: --> %notmask U: full-set S: full-set
; CHECK-NEXT: %mask = xor i32 %notmask, -1
-; CHECK-NEXT: --> (-1 + (-1 * %notmask)) U: full-set S: full-set
+; CHECK-NEXT: --> (-1 + (-1 * %notmask)) U: full-set S: full-set
; CHECK-NEXT: %masked = and i32 %mask, %val
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_b
;
%notmask = shl i32 -1, %numlowbits
@@ -62,11 +62,11 @@ define i32 @mask_c(i32 %val, i32 %numlowbits) nounwind {
; CHECK-LABEL: 'mask_c'
; CHECK-NEXT: Classifying expressions for: @mask_c
; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits
-; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
+; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
; CHECK-NEXT: %mask = lshr i32 -1, %numhighbits
-; CHECK-NEXT: --> %mask U: full-set S: full-set
+; CHECK-NEXT: --> %mask U: full-set S: full-set
; CHECK-NEXT: %masked = and i32 %mask, %val
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_c
;
%numhighbits = sub i32 32, %numlowbits
@@ -79,11 +79,11 @@ define i32 @mask_d(i32 %val, i32 %numlowbits) nounwind {
; CHECK-LABEL: 'mask_d'
; CHECK-NEXT: Classifying expressions for: @mask_d
; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits
-; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
+; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set
; CHECK-NEXT: %highbitscleared = shl i32 %val, %numhighbits
-; CHECK-NEXT: --> %highbitscleared U: full-set S: full-set
+; CHECK-NEXT: --> %highbitscleared U: full-set S: full-set
; CHECK-NEXT: %masked = lshr i32 %highbitscleared, %numhighbits
-; CHECK-NEXT: --> %masked U: full-set S: full-set
+; CHECK-NEXT: --> %masked U: full-set S: full-set
; CHECK-NEXT: Determining loop execution counts for: @mask_d
;
%numhighbits = sub i32 32, %numlowbits
More information about the llvm-commits
mailing list