#include "main.h"
#include <typeinfo>
Go to the source code of this file.
|
| struct | Eigen::internal::bit_andnot |
| |
| struct | Eigen::test::packet_helper< Cond, Packet > |
| |
| struct | Eigen::test::packet_helper< false, Packet > |
| |
| struct | Eigen::test::runner< Scalar, PacketType, true, true > |
| |
| struct | Eigen::test::runner< Scalar, PacketType, true, false > |
| |
| struct | Eigen::test::runner< Scalar, PacketType, false, false > |
| |
|
| #define | EIGEN_TEST_MAKE_BITWISE2(OP, FUNC, T) |
| |
| #define | EIGEN_TEST_MAKE_BITWISE(OP, FUNC) |
| |
| #define | CHECK_CWISE1(REFOP, POP) |
| |
| #define | CHECK_CWISE1_N(REFOP, POP, N) |
| |
| #define | CHECK_CWISE1_IF(COND, REFOP, POP) |
| |
| #define | CHECK_CWISE1_EXACT_IF(COND, REFOP, POP) |
| |
| #define | CHECK_CWISE2_IF(COND, REFOP, POP) |
| |
| #define | CHECK_CWISE1_BYREF1_IF(COND, REFOP, POP) |
| |
| #define | CHECK_CWISE3_IF(COND, REFOP, POP) |
| |
|
| template<typename T > |
| T | Eigen::internal::negate (const T &x) |
| |
| template<typename T > |
| Map< const Array< unsigned char, sizeof(T), 1 > > | Eigen::internal::bits (const T &x) |
| |
| template<typename T , typename Bits , typename Func > |
| T | Eigen::internal::apply_bit_op (Bits a, Bits b, Func f) |
| |
| template<typename T > |
| bool | Eigen::internal::biteq (T a, T b) |
| |
| template<typename Scalar > |
| EIGEN_DONT_INLINE bool | Eigen::test::isApproxAbs (const Scalar &a, const Scalar &b, const typename NumTraits< Scalar >::Real &refvalue) |
| |
| template<typename Scalar > |
| void | Eigen::test::print_mismatch (const Scalar *ref, const Scalar *vec, int size) |
| |
| template<typename Scalar > |
| bool | Eigen::test::areApproxAbs (const Scalar *a, const Scalar *b, int size, const typename NumTraits< Scalar >::Real &refvalue) |
| |
| template<typename Scalar > |
| bool | Eigen::test::areApprox (const Scalar *a, const Scalar *b, int size) |
| |
| template<typename Scalar > |
| bool | Eigen::test::areEqual (const Scalar *a, const Scalar *b, int size) |
| |
◆ CHECK_CWISE1
| #define CHECK_CWISE1 |
( |
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: { \
for (
int i=0;
i<PacketSize; ++
i) \
ref[
i] = REFOP(data1[
i]); \
internal::pstore(data2, POP(internal::pload<Packet>(data1))); \
}
int i
Definition BiCGSTAB_step_by_step.cpp:9
bool areApprox(const Scalar *a, const Scalar *b, int size)
Definition packetmath_test_shared.h:99
◆ CHECK_CWISE1_BYREF1_IF
| #define CHECK_CWISE1_BYREF1_IF |
( |
|
COND, |
|
|
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: if(COND) { \
for (
int i=0;
i<PacketSize; ++
i) \
ref[
i] =
Scalar(REFOP(data1[
i], ref[
i+PacketSize])); \
}
SCALAR Scalar
Definition bench_gemm.cpp:46
Definition packetmath_test_shared.h:146
Packet load(const T *from) const
Definition packetmath_test_shared.h:148
void store(T *to, const Packet &x) const
Definition packetmath_test_shared.h:157
Packet & forward_reference(Packet &packet, T &) const
Definition packetmath_test_shared.h:163
◆ CHECK_CWISE1_EXACT_IF
| #define CHECK_CWISE1_EXACT_IF |
( |
|
COND, |
|
|
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: if(COND) { \
for (
int i=0;
i<PacketSize; ++
i) \
}
bool areEqual(const Scalar *a, const Scalar *b, int size)
Definition packetmath_test_shared.h:113
◆ CHECK_CWISE1_IF
| #define CHECK_CWISE1_IF |
( |
|
COND, |
|
|
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: if(COND) { \
for (
int i=0;
i<PacketSize; ++
i) \
}
◆ CHECK_CWISE1_N
| #define CHECK_CWISE1_N |
( |
|
REFOP, |
|
|
|
POP, |
|
|
|
N |
|
) |
| |
Value: { \
for (
int i=0;
i<
N; ++
i) \
ref[
i] = REFOP(data1[
i]); \
for (
int j=0;
j<
N;
j+=PacketSize) \
internal::pstore(data2 +
j, POP(internal::pload<Packet>(data1 +
j))); \
}
@ N
Definition constructor.cpp:23
std::ptrdiff_t j
Definition tut_arithmetic_redux_minmax.cpp:2
◆ CHECK_CWISE2_IF
| #define CHECK_CWISE2_IF |
( |
|
COND, |
|
|
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: if(COND) { \
for (
int i=0;
i<PacketSize; ++
i) \
ref[
i] =
Scalar(REFOP(data1[
i], data1[
i+PacketSize])); \
}
◆ CHECK_CWISE3_IF
| #define CHECK_CWISE3_IF |
( |
|
COND, |
|
|
|
REFOP, |
|
|
|
POP |
|
) |
| |
Value: if (COND) { \
for (
int i = 0;
i < PacketSize; ++
i) \
ref[
i] =
Scalar(REFOP(data1[
i], data1[
i + PacketSize], \
data1[
i + 2 * PacketSize])); \
h.
load(data1 + 2 * PacketSize))); \
}
◆ EIGEN_TEST_MAKE_BITWISE
| #define EIGEN_TEST_MAKE_BITWISE |
( |
|
OP, |
|
|
|
FUNC |
|
) |
| |
Value:
EIGEN_TEST_MAKE_BITWISE2(
OP,FUNC,
double) \
EIGEN_TEST_MAKE_BITWISE2(
OP,FUNC,
half) \
EIGEN_TEST_MAKE_BITWISE2(
OP,FUNC,std::complex<float>) \
EIGEN_TEST_MAKE_BITWISE2(
OP,FUNC,std::complex<double>)
#define OP(X)
Definition common.h:47
#define EIGEN_TEST_MAKE_BITWISE2(OP, FUNC, T)
Definition packetmath_test_shared.h:44
◆ EIGEN_TEST_MAKE_BITWISE2
| #define EIGEN_TEST_MAKE_BITWISE2 |
( |
|
OP, |
|
|
|
FUNC, |
|
|
|
T |
|
) |
| |
Value:
return apply_bit_op<T>(bits(
a),bits(
b),FUNC); \
}
ArrayXXi a
Definition Array_initializer_list_23_cxx11.cpp:1
#define EIGEN_CAT(a, b)
Definition Macros.h:902
float * p
Definition Tutorial_Map_using.cpp:9
Scalar * b
Definition benchVecAdd.cpp:17
◆ g_first_pass