mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 10:42:39 +01:00
8366289c89
The current demand propagator for addition will mark all input bits at and right of the alive output bit as alive. But carry won't propagate beyond a bit for which both operands are zero (or one/zero in the case of subtraction) so a more accurate answer is possible given known bits. I derived a propagator by working through truth tables and using a bit-reversed addition to make demand ripple to the right, but I'm not sure how to make a convincing argument for its correctness in the comments yet. Nevertheless, here's a minimal implementation and test to get feedback. This would help in a situation where, for example, four bytes (<128) packed into an int are added with four others SIMD-style but only one of the four results is actually read. Known A: 0_______0_______0_______0_______ Known B: 0_______0_______0_______0_______ AOut: 00000000001000000000000000000000 AB, current: 00000000001111111111111111111111 AB, patch: 00000000001111111000000000000000 Committed on behalf of: @rrika (Erika) Differential Revision: https://reviews.llvm.org/D72423
53 lines
1.4 KiB
C++
53 lines
1.4 KiB
C++
//===- llvm/unittest/Support/KnownBitsTest.h - KnownBits tests ------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements helpers for KnownBits and DemandedBits unit tests.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_UNITTESTS_SUPPORT_KNOWNBITSTEST_H
|
|
#define LLVM_UNITTESTS_SUPPORT_KNOWNBITSTEST_H
|
|
|
|
#include "llvm/Support/KnownBits.h"
|
|
|
|
namespace {
|
|
|
|
using namespace llvm;
|
|
|
|
template <typename FnTy> void ForeachKnownBits(unsigned Bits, FnTy Fn) {
|
|
unsigned Max = 1 << Bits;
|
|
KnownBits Known(Bits);
|
|
for (unsigned Zero = 0; Zero < Max; ++Zero) {
|
|
for (unsigned One = 0; One < Max; ++One) {
|
|
Known.Zero = Zero;
|
|
Known.One = One;
|
|
if (Known.hasConflict())
|
|
continue;
|
|
|
|
Fn(Known);
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename FnTy>
|
|
void ForeachNumInKnownBits(const KnownBits &Known, FnTy Fn) {
|
|
unsigned Bits = Known.getBitWidth();
|
|
unsigned Max = 1 << Bits;
|
|
for (unsigned N = 0; N < Max; ++N) {
|
|
APInt Num(Bits, N);
|
|
if ((Num & Known.Zero) != 0 || (~Num & Known.One) != 0)
|
|
continue;
|
|
|
|
Fn(Num);
|
|
}
|
|
}
|
|
|
|
} // end anonymous namespace
|
|
|
|
#endif
|