94 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py2; RUN: opt -S -disable-output "-passes=print<scalar-evolution>" < %s 2>&1 | FileCheck %s3 4; These testcases aren't *identical* but they have the same/similar meaning.5 6; The obvious case.7define i32 @mul(i32 %val, i32 %num) nounwind {8; CHECK-LABEL: 'mul'9; CHECK-NEXT: Classifying expressions for: @mul10; CHECK-NEXT: %tmp1 = mul i32 %val, %num11; CHECK-NEXT: --> (%val * %num) U: full-set S: full-set12; CHECK-NEXT: %tmp2 = udiv i32 %tmp1, %num13; CHECK-NEXT: --> ((%val * %num) /u %num) U: full-set S: full-set14; CHECK-NEXT: Determining loop execution counts for: @mul15;16 %tmp1 = mul i32 %val, %num17 %tmp2 = udiv i32 %tmp1, %num18 ret i32 %tmp219}20 21; Or, it could be any number of equivalent patterns with mask:22; a) x & (1 << nbits) - 123; b) x & ~(-1 << nbits)24; c) x & (-1 >> (32 - y))25; d) x << (32 - y) >> (32 - y)26 27define i32 @mask_a(i32 %val, i32 %numlowbits) nounwind {28; CHECK-LABEL: 'mask_a'29; CHECK-NEXT: Classifying expressions for: @mask_a30; CHECK-NEXT: %onebit = shl i32 1, %numlowbits31; CHECK-NEXT: --> %onebit U: full-set S: full-set32; CHECK-NEXT: %mask = add nsw i32 %onebit, -133; CHECK-NEXT: --> (-1 + %onebit) U: full-set S: full-set34; CHECK-NEXT: %masked = and i32 %mask, %val35; CHECK-NEXT: --> %masked U: full-set S: full-set36; CHECK-NEXT: Determining loop execution counts for: @mask_a37;38 %onebit = shl i32 1, %numlowbits39 %mask = add nsw i32 %onebit, -140 %masked = and i32 %mask, %val41 ret i32 %masked42}43 44define i32 @mask_b(i32 %val, i32 %numlowbits) nounwind {45; CHECK-LABEL: 'mask_b'46; CHECK-NEXT: Classifying expressions for: @mask_b47; CHECK-NEXT: %notmask = shl i32 -1, %numlowbits48; CHECK-NEXT: --> %notmask U: [-2147483648,0) S: [-2147483648,0)49; CHECK-NEXT: %mask = xor i32 %notmask, -150; CHECK-NEXT: --> (-1 + (-1 * %notmask)) U: [0,-2147483648) S: [0,-2147483648)51; CHECK-NEXT: %masked = and i32 %mask, %val52; CHECK-NEXT: --> %masked U: [0,-2147483648) S: [0,-2147483648)53; CHECK-NEXT: Determining loop execution counts for: @mask_b54;55 %notmask = shl i32 -1, %numlowbits56 %mask = xor i32 %notmask, -157 %masked = and i32 %mask, %val58 ret i32 %masked59}60 61define i32 @mask_c(i32 %val, i32 %numlowbits) nounwind {62; CHECK-LABEL: 'mask_c'63; CHECK-NEXT: Classifying expressions for: @mask_c64; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits65; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set66; CHECK-NEXT: %mask = lshr i32 -1, %numhighbits67; CHECK-NEXT: --> %mask U: [1,0) S: [1,0)68; CHECK-NEXT: %masked = and i32 %mask, %val69; CHECK-NEXT: --> %masked U: full-set S: full-set70; CHECK-NEXT: Determining loop execution counts for: @mask_c71;72 %numhighbits = sub i32 32, %numlowbits73 %mask = lshr i32 -1, %numhighbits74 %masked = and i32 %mask, %val75 ret i32 %masked76}77 78define i32 @mask_d(i32 %val, i32 %numlowbits) nounwind {79; CHECK-LABEL: 'mask_d'80; CHECK-NEXT: Classifying expressions for: @mask_d81; CHECK-NEXT: %numhighbits = sub i32 32, %numlowbits82; CHECK-NEXT: --> (32 + (-1 * %numlowbits)) U: full-set S: full-set83; CHECK-NEXT: %highbitscleared = shl i32 %val, %numhighbits84; CHECK-NEXT: --> %highbitscleared U: full-set S: full-set85; CHECK-NEXT: %masked = lshr i32 %highbitscleared, %numhighbits86; CHECK-NEXT: --> %masked U: full-set S: full-set87; CHECK-NEXT: Determining loop execution counts for: @mask_d88;89 %numhighbits = sub i32 32, %numlowbits90 %highbitscleared = shl i32 %val, %numhighbits91 %masked = lshr i32 %highbitscleared, %numhighbits92 ret i32 %masked93}94