brintos

brintos / llvm-project-archived public Read only

0
0
Text · 9.1 KiB · 1c108bd Raw
131 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py2; RUN: opt -passes='print<scalar-evolution>' -disable-output %s 2>&1 | FileCheck %s3 4define i32 @pr58402_large_number_of_zext(ptr %dst) {5; CHECK-LABEL: 'pr58402_large_number_of_zext'6; CHECK-NEXT:  Classifying expressions for: @pr58402_large_number_of_zext7; CHECK-NEXT:    %d.0 = phi i32 [ 0, %entry ], [ %add7.15, %header ]8; CHECK-NEXT:    --> %d.0 U: [0,65) S: [0,65) Exits: <<Unknown>> LoopDispositions: { %header: Variant }9; CHECK-NEXT:    %b.0 = phi i32 [ 59, %entry ], [ %b.0, %header ]10; CHECK-NEXT:    --> 59 U: [59,60) S: [59,60) Exits: 59 LoopDispositions: { %header: Invariant }11; CHECK-NEXT:    %conv.neg = sext i1 %cmp to i3212; CHECK-NEXT:    --> (sext i1 %cmp to i32) U: [-1,1) S: [-1,1) Exits: <<Unknown>> LoopDispositions: { %header: Variant }13; CHECK-NEXT:    %conv = zext i1 %cmp to i3214; CHECK-NEXT:    --> (zext i1 %cmp to i32) U: [0,2) S: [0,2) Exits: <<Unknown>> LoopDispositions: { %header: Variant }15; CHECK-NEXT:    %i = and i32 %conv, -216; CHECK-NEXT:    --> (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw> U: [0,1) S: [0,1) Exits: <<Unknown>> LoopDispositions: { %header: Variant }17; CHECK-NEXT:    %add7 = add i32 %i, 418; CHECK-NEXT:    --> (4 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [4,5) S: [4,5) Exits: <<Unknown>> LoopDispositions: { %header: Variant }19; CHECK-NEXT:    %i1 = and i32 %add7, -220; CHECK-NEXT:    --> (4 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [4,5) S: [4,5) Exits: <<Unknown>> LoopDispositions: { %header: Variant }21; CHECK-NEXT:    %add7.1 = add i32 %i1, 422; CHECK-NEXT:    --> (8 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [8,9) S: [8,9) Exits: <<Unknown>> LoopDispositions: { %header: Variant }23; CHECK-NEXT:    %i2 = and i32 %add7.1, -224; CHECK-NEXT:    --> (8 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [8,9) S: [8,9) Exits: <<Unknown>> LoopDispositions: { %header: Variant }25; CHECK-NEXT:    %add7.2 = add i32 %i2, 426; CHECK-NEXT:    --> (12 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [12,13) S: [12,13) Exits: <<Unknown>> LoopDispositions: { %header: Variant }27; CHECK-NEXT:    %i3 = and i32 %add7.2, -228; CHECK-NEXT:    --> (12 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [12,13) S: [12,13) Exits: <<Unknown>> LoopDispositions: { %header: Variant }29; CHECK-NEXT:    %add7.3 = add i32 %i3, 430; CHECK-NEXT:    --> (16 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [16,17) S: [16,17) Exits: <<Unknown>> LoopDispositions: { %header: Variant }31; CHECK-NEXT:    %i4 = and i32 %add7.3, -232; CHECK-NEXT:    --> (16 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [16,17) S: [16,17) Exits: <<Unknown>> LoopDispositions: { %header: Variant }33; CHECK-NEXT:    %add7.4 = add i32 %i4, 434; CHECK-NEXT:    --> (20 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [20,21) S: [20,21) Exits: <<Unknown>> LoopDispositions: { %header: Variant }35; CHECK-NEXT:    %i5 = and i32 %add7.4, -236; CHECK-NEXT:    --> (20 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [20,21) S: [20,21) Exits: <<Unknown>> LoopDispositions: { %header: Variant }37; CHECK-NEXT:    %add7.5 = add i32 %i5, 438; CHECK-NEXT:    --> (24 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [24,25) S: [24,25) Exits: <<Unknown>> LoopDispositions: { %header: Variant }39; CHECK-NEXT:    %i6 = and i32 %add7.5, -240; CHECK-NEXT:    --> (24 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [24,25) S: [24,25) Exits: <<Unknown>> LoopDispositions: { %header: Variant }41; CHECK-NEXT:    %add7.6 = add i32 %i6, 442; CHECK-NEXT:    --> (28 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [28,29) S: [28,29) Exits: <<Unknown>> LoopDispositions: { %header: Variant }43; CHECK-NEXT:    %i7 = and i32 %add7.6, -244; CHECK-NEXT:    --> (28 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [28,29) S: [28,29) Exits: <<Unknown>> LoopDispositions: { %header: Variant }45; CHECK-NEXT:    %add7.7 = add i32 %i7, 446; CHECK-NEXT:    --> (32 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [32,33) S: [32,33) Exits: <<Unknown>> LoopDispositions: { %header: Variant }47; CHECK-NEXT:    %i8 = and i32 %add7.7, -248; CHECK-NEXT:    --> (32 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [32,33) S: [32,33) Exits: <<Unknown>> LoopDispositions: { %header: Variant }49; CHECK-NEXT:    %add7.8 = add i32 %i8, 450; CHECK-NEXT:    --> (36 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [36,37) S: [36,37) Exits: <<Unknown>> LoopDispositions: { %header: Variant }51; CHECK-NEXT:    %i9 = and i32 %add7.8, -252; CHECK-NEXT:    --> (36 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [36,37) S: [36,37) Exits: <<Unknown>> LoopDispositions: { %header: Variant }53; CHECK-NEXT:    %add7.9 = add i32 %i9, 454; CHECK-NEXT:    --> (40 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [40,41) S: [40,41) Exits: <<Unknown>> LoopDispositions: { %header: Variant }55; CHECK-NEXT:    %i10 = and i32 %add7.9, -256; CHECK-NEXT:    --> (40 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [40,41) S: [40,41) Exits: <<Unknown>> LoopDispositions: { %header: Variant }57; CHECK-NEXT:    %add7.10 = add i32 %i10, 458; CHECK-NEXT:    --> (44 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [44,45) S: [44,45) Exits: <<Unknown>> LoopDispositions: { %header: Variant }59; CHECK-NEXT:    %i11 = and i32 %add7.10, -260; CHECK-NEXT:    --> (44 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [44,45) S: [44,45) Exits: <<Unknown>> LoopDispositions: { %header: Variant }61; CHECK-NEXT:    %add7.11 = add i32 %i11, 462; CHECK-NEXT:    --> (48 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [48,49) S: [48,49) Exits: <<Unknown>> LoopDispositions: { %header: Variant }63; CHECK-NEXT:    %i12 = and i32 %add7.11, -264; CHECK-NEXT:    --> (48 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [48,49) S: [48,49) Exits: <<Unknown>> LoopDispositions: { %header: Variant }65; CHECK-NEXT:    %add7.12 = add i32 %i12, 466; CHECK-NEXT:    --> (52 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [52,53) S: [52,53) Exits: <<Unknown>> LoopDispositions: { %header: Variant }67; CHECK-NEXT:    %i13 = and i32 %add7.12, -268; CHECK-NEXT:    --> (52 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [52,53) S: [52,53) Exits: <<Unknown>> LoopDispositions: { %header: Variant }69; CHECK-NEXT:    %add7.13 = add i32 %i13, 470; CHECK-NEXT:    --> (56 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [56,57) S: [56,57) Exits: <<Unknown>> LoopDispositions: { %header: Variant }71; CHECK-NEXT:    %i14 = and i32 %add7.13, -272; CHECK-NEXT:    --> (56 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [56,57) S: [56,57) Exits: <<Unknown>> LoopDispositions: { %header: Variant }73; CHECK-NEXT:    %add7.14 = add i32 %i14, 474; CHECK-NEXT:    --> (60 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [60,61) S: [60,61) Exits: <<Unknown>> LoopDispositions: { %header: Variant }75; CHECK-NEXT:    %i15 = and i32 %add7.14, -276; CHECK-NEXT:    --> (60 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [60,61) S: [60,61) Exits: <<Unknown>> LoopDispositions: { %header: Variant }77; CHECK-NEXT:    %add7.15 = add i32 %i15, 478; CHECK-NEXT:    --> (64 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [64,65) S: [64,65) Exits: <<Unknown>> LoopDispositions: { %header: Variant }79; CHECK-NEXT:    %i16 = and i32 %add7.15, -280; CHECK-NEXT:    --> (64 + (2 * ((zext i1 %cmp to i32) /u 2))<nuw><nsw>)<nuw><nsw> U: [64,65) S: [64,65) Exits: <<Unknown>> LoopDispositions: { %header: Variant }81; CHECK-NEXT:  Determining loop execution counts for: @pr58402_large_number_of_zext82; CHECK-NEXT:  Loop %header: <multiple exits> Unpredictable backedge-taken count.83; CHECK-NEXT:  Loop %header: Unpredictable constant max backedge-taken count.84; CHECK-NEXT:  Loop %header: Unpredictable symbolic max backedge-taken count.85;86entry:87  br label %header88 89header:90  %d.0 = phi i32 [ 0, %entry ], [ %add7.15, %header ]91  %b.0 = phi i32 [ 59, %entry ], [ %b.0, %header ]92  %cmp = icmp slt i32 %b.0, 193  %conv.neg = sext i1 %cmp to i3294  %conv = zext i1 %cmp to i3295  %i = and i32 %conv, -296  %add7 = add i32 %i, 497  %i1 = and i32 %add7, -298  %add7.1 = add i32 %i1, 499  %i2 = and i32 %add7.1, -2100  %add7.2 = add i32 %i2, 4101  %i3 = and i32 %add7.2, -2102  %add7.3 = add i32 %i3, 4103  %i4 = and i32 %add7.3, -2104  %add7.4 = add i32 %i4, 4105  %i5 = and i32 %add7.4, -2106  %add7.5 = add i32 %i5, 4107  %i6 = and i32 %add7.5, -2108  %add7.6 = add i32 %i6, 4109  %i7 = and i32 %add7.6, -2110  %add7.7 = add i32 %i7, 4111  %i8 = and i32 %add7.7, -2112  %add7.8 = add i32 %i8, 4113  %i9 = and i32 %add7.8, -2114  %add7.9 = add i32 %i9, 4115  %i10 = and i32 %add7.9, -2116  %add7.10 = add i32 %i10, 4117  %i11 = and i32 %add7.10, -2118  %add7.11 = add i32 %i11, 4119  %i12 = and i32 %add7.11, -2120  %add7.12 = add i32 %i12, 4121  %i13 = and i32 %add7.12, -2122  %add7.13 = add i32 %i13, 4123  %i14 = and i32 %add7.13, -2124  %add7.14 = add i32 %i14, 4125  %i15 = and i32 %add7.14, -2126  %add7.15 = add i32 %i15, 4127  %i16 = and i32 %add7.15, -2128  store i32 %add7.15, ptr %dst, align 4129  br label %header130}131