llvm-project
2847 строк · 110.6 Кб
1//===- ConstantRangeTest.cpp - ConstantRange tests ------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8}38}53}61}71}80}87}94}100}107}114}126// Check whether constant range CR is an optimal approximation of the set128// Elems under the given PreferenceFn. The preference function should return129// true if the first range argument is strictly preferred to the second one.130static void TestRange(const ConstantRange &CR, const SmallBitVector &Elems,131PreferFn PreferenceFn, ArrayRef<ConstantRange> Inputs,132bool CheckOptimality = true) {133unsigned BitWidth = CR.getBitWidth();134}185}200}211}215}220}225}230}236// CheckFn determines whether optimality is checked for a given range pair.238// Correctness is always checked.239static void TestBinaryOpExhaustive(BinaryRangeFn RangeFn, BinaryIntFn IntFn,240PreferFn PreferenceFn = PreferSmallest,241BinaryCheckFn CheckFn = CheckAll) {242EnumerateTwoInterestingConstantRanges(243[&](const ConstantRange &CR1, const ConstantRange &CR2) {244SmallBitVector Elems(1 << CR1.getBitWidth());245ForeachNumInConstantRange(CR1, [&](const APInt &N1) {246ForeachNumInConstantRange(CR2, [&](const APInt &N2) {247if (std::optional<APInt> ResultN = IntFn(N1, N2))248Elems.set(ResultN->getZExtValue());249});250});251TestRange(RangeFn(CR1, CR2), Elems, PreferenceFn, {CR1, CR2},252CheckFn(CR1, CR2));253});254}255}311}329}352}378}394}417}447}466}489}547}576}590}604}624}641}653TEST_F(ConstantRangeTest, losslessUnsignedTruncationZeroext) {654EnumerateInterestingConstantRanges([&](const ConstantRange &CR) {655unsigned Bits = CR.getBitWidth();656unsigned MinBitWidth = CR.getActiveBits();657if (MinBitWidth == 0) {658EXPECT_TRUE(CR.isEmptySet() ||659(CR.isSingleElement() && CR.getSingleElement()->isZero()));660return;661}662if (MinBitWidth == Bits)663return;664EXPECT_EQ(CR, CR.truncate(MinBitWidth).zeroExtend(Bits));665});666}667}679TEST_F(ConstantRangeTest, losslessSignedTruncationSignext) {680EnumerateInterestingConstantRanges([&](const ConstantRange &CR) {681unsigned Bits = CR.getBitWidth();682unsigned MinBitWidth = CR.getMinSignedBits();683if (MinBitWidth == 0) {684EXPECT_TRUE(CR.isEmptySet());685return;686}687if (MinBitWidth == Bits)688return;689EXPECT_EQ(CR, CR.truncate(MinBitWidth).signExtend(Bits));690});691}692}703}731}888}918}960}1025}1114}1123}1150}1180}1206}1235}1265}1325}1363}1438}1486}1507}1534}1541}1593}1606}1611}1834}1866// Show that makeGuaranteedNoWrapRegion() is maximal, and for single-element1868// ranges also exact.1869TEST(ConstantRange, NoWrapRegionExhaustive) {1870TestNoWrapRegionExhaustive(1871Instruction::Add, OverflowingBinaryOperator::NoUnsignedWrap,1872[](const APInt &N1, const APInt &N2) {1873bool Overflow;1874(void) N1.uadd_ov(N2, Overflow);1875return Overflow;1876});1877TestNoWrapRegionExhaustive(1878Instruction::Add, OverflowingBinaryOperator::NoSignedWrap,1879[](const APInt &N1, const APInt &N2) {1880bool Overflow;1881(void) N1.sadd_ov(N2, Overflow);1882return Overflow;1883});1884TestNoWrapRegionExhaustive(1885Instruction::Sub, OverflowingBinaryOperator::NoUnsignedWrap,1886[](const APInt &N1, const APInt &N2) {1887bool Overflow;1888(void) N1.usub_ov(N2, Overflow);1889return Overflow;1890});1891TestNoWrapRegionExhaustive(1892Instruction::Sub, OverflowingBinaryOperator::NoSignedWrap,1893[](const APInt &N1, const APInt &N2) {1894bool Overflow;1895(void) N1.ssub_ov(N2, Overflow);1896return Overflow;1897});1898TestNoWrapRegionExhaustive(1899Instruction::Mul, OverflowingBinaryOperator::NoUnsignedWrap,1900[](const APInt &N1, const APInt &N2) {1901bool Overflow;1902(void) N1.umul_ov(N2, Overflow);1903return Overflow;1904});1905TestNoWrapRegionExhaustive(1906Instruction::Mul, OverflowingBinaryOperator::NoSignedWrap,1907[](const APInt &N1, const APInt &N2) {1908bool Overflow;1909(void) N1.smul_ov(N2, Overflow);1910return Overflow;1911});1912TestNoWrapRegionExhaustive(Instruction::Shl,1913OverflowingBinaryOperator::NoUnsignedWrap,1914[](const APInt &N1, const APInt &N2) {1915bool Overflow;1916(void)N1.ushl_ov(N2, Overflow);1917return Overflow;1918});1919TestNoWrapRegionExhaustive(Instruction::Shl,1920OverflowingBinaryOperator::NoSignedWrap,1921[](const APInt &N1, const APInt &N2) {1922bool Overflow;1923(void)N1.sshl_ov(N2, Overflow);1924return Overflow;1925});1926}1927}2027}2070}2105}2157}2199}2255}2268}2281}2294}2307}2320}2350}2377}2394}2428}2439}2450}2459}2468}2479}2490}2499}2508}2522}2536}2550}2556}2597}2629}2667}2698}2715}2739}2755}2773}2787}2798}2823}2846