mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-07-11 07:31:48 +08:00
fix few warnings reported by clang
This commit is contained in:
parent
a99ea69b32
commit
3cb088c39f
@ -284,6 +284,7 @@ class BandMatrixWrapper : public BandMatrixBase<BandMatrixWrapper<_CoefficientsT
|
|||||||
: m_coeffs(coeffs),
|
: m_coeffs(coeffs),
|
||||||
m_rows(rows), m_supers(supers), m_subs(subs)
|
m_rows(rows), m_supers(supers), m_subs(subs)
|
||||||
{
|
{
|
||||||
|
EIGEN_UNUSED_VARIABLE(cols);
|
||||||
//internal::assert(coeffs.cols()==cols() && (supers()+subs()+1)==coeffs.rows());
|
//internal::assert(coeffs.cols()==cols() && (supers()+subs()+1)==coeffs.rows());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -111,6 +111,7 @@ template<typename Derived> class TriangularBase : public EigenBase<Derived>
|
|||||||
EIGEN_ONLY_USED_FOR_DEBUG(col);
|
EIGEN_ONLY_USED_FOR_DEBUG(col);
|
||||||
eigen_assert(col>=0 && col<cols() && row>=0 && row<rows());
|
eigen_assert(col>=0 && col<cols() && row>=0 && row<rows());
|
||||||
const int mode = int(Mode) & ~SelfAdjoint;
|
const int mode = int(Mode) & ~SelfAdjoint;
|
||||||
|
EIGEN_ONLY_USED_FOR_DEBUG(mode);
|
||||||
eigen_assert((mode==Upper && col>=row)
|
eigen_assert((mode==Upper && col>=row)
|
||||||
|| (mode==Lower && col<=row)
|
|| (mode==Lower && col<=row)
|
||||||
|| ((mode==StrictlyUpper || mode==UnitUpper) && col>row)
|
|| ((mode==StrictlyUpper || mode==UnitUpper) && col>row)
|
||||||
|
@ -81,6 +81,7 @@ inline void manage_caching_sizes(Action action, std::ptrdiff_t* l1=0, std::ptrdi
|
|||||||
template<typename LhsScalar, typename RhsScalar, int KcFactor>
|
template<typename LhsScalar, typename RhsScalar, int KcFactor>
|
||||||
void computeProductBlockingSizes(std::ptrdiff_t& k, std::ptrdiff_t& m, std::ptrdiff_t& n)
|
void computeProductBlockingSizes(std::ptrdiff_t& k, std::ptrdiff_t& m, std::ptrdiff_t& n)
|
||||||
{
|
{
|
||||||
|
EIGEN_UNUSED_VARIABLE(n);
|
||||||
// Explanations:
|
// Explanations:
|
||||||
// Let's recall the product algorithms form kc x nc horizontal panels B' on the rhs and
|
// Let's recall the product algorithms form kc x nc horizontal panels B' on the rhs and
|
||||||
// mc x kc blocks A' on the lhs. A' has to fit into L2 cache. Moreover, B' is processed
|
// mc x kc blocks A' on the lhs. A' has to fit into L2 cache. Moreover, B' is processed
|
||||||
@ -102,7 +103,6 @@ void computeProductBlockingSizes(std::ptrdiff_t& k, std::ptrdiff_t& m, std::ptrd
|
|||||||
k = std::min<std::ptrdiff_t>(k, l1/kdiv);
|
k = std::min<std::ptrdiff_t>(k, l1/kdiv);
|
||||||
std::ptrdiff_t _m = k>0 ? l2/(4 * sizeof(LhsScalar) * k) : 0;
|
std::ptrdiff_t _m = k>0 ? l2/(4 * sizeof(LhsScalar) * k) : 0;
|
||||||
if(_m<m) m = _m & mr_mask;
|
if(_m<m) m = _m & mr_mask;
|
||||||
n = n;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
template<typename LhsScalar, typename RhsScalar>
|
template<typename LhsScalar, typename RhsScalar>
|
||||||
|
@ -294,11 +294,19 @@ struct kissfft_impl
|
|||||||
inline
|
inline
|
||||||
void fwd2( Complex * dst,const Complex *src,int n0,int n1)
|
void fwd2( Complex * dst,const Complex *src,int n0,int n1)
|
||||||
{
|
{
|
||||||
|
EIGEN_UNUSED_VARIABLE(dst);
|
||||||
|
EIGEN_UNUSED_VARIABLE(src);
|
||||||
|
EIGEN_UNUSED_VARIABLE(n0);
|
||||||
|
EIGEN_UNUSED_VARIABLE(n1);
|
||||||
}
|
}
|
||||||
|
|
||||||
inline
|
inline
|
||||||
void inv2( Complex * dst,const Complex *src,int n0,int n1)
|
void inv2( Complex * dst,const Complex *src,int n0,int n1)
|
||||||
{
|
{
|
||||||
|
EIGEN_UNUSED_VARIABLE(dst);
|
||||||
|
EIGEN_UNUSED_VARIABLE(src);
|
||||||
|
EIGEN_UNUSED_VARIABLE(n0);
|
||||||
|
EIGEN_UNUSED_VARIABLE(n1);
|
||||||
}
|
}
|
||||||
|
|
||||||
// real-to-complex forward FFT
|
// real-to-complex forward FFT
|
||||||
|
Loading…
x
Reference in New Issue
Block a user