mirror of
https://gitlab.com/libeigen/eigen.git
synced 2025-04-22 01:29:35 +08:00
4fa40367e9
- added a MapBase base xpr on top of which Map and the specialization
of Block are implemented
- MapBase forces both aligned loads (and aligned stores, see below) in expressions
such as "x.block(...) += other_expr"
* Significant vectorization improvement:
- added a AlignedBit flag meaning the first coeff/packet is aligned,
this allows to not generate extra code to deal with the first unaligned part
- removed all unaligned stores when no unrolling
- removed unaligned loads in Sum when the input as the DirectAccessBit flag
* Some code simplification in CacheFriendly product
* Some minor documentation improvements
320 lines
12 KiB
C++
320 lines
12 KiB
C++
// This file is part of Eigen, a lightweight C++ template library
|
|
// for linear algebra. Eigen itself is part of the KDE project.
|
|
//
|
|
// Copyright (C) 2006-2008 Benoit Jacob <jacob@math.jussieu.fr>
|
|
//
|
|
// Eigen is free software; you can redistribute it and/or
|
|
// modify it under the terms of the GNU Lesser General Public
|
|
// License as published by the Free Software Foundation; either
|
|
// version 3 of the License, or (at your option) any later version.
|
|
//
|
|
// Alternatively, you can redistribute it and/or
|
|
// modify it under the terms of the GNU General Public License as
|
|
// published by the Free Software Foundation; either version 2 of
|
|
// the License, or (at your option) any later version.
|
|
//
|
|
// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
|
|
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License and a copy of the GNU General Public License along with
|
|
// Eigen. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
#ifndef EIGEN_COEFFS_H
|
|
#define EIGEN_COEFFS_H
|
|
|
|
/** Short version: don't use this function, use
|
|
* \link operator()(int,int) const \endlink instead.
|
|
*
|
|
* Long version: this function is similar to
|
|
* \link operator()(int,int) const \endlink, but without the assertion.
|
|
* Use this for limiting the performance cost of debugging code when doing
|
|
* repeated coefficient access. Only use this when it is guaranteed that the
|
|
* parameters \a row and \a col are in range.
|
|
*
|
|
* If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this
|
|
* function equivalent to \link operator()(int,int) const \endlink.
|
|
*
|
|
* \sa operator()(int,int) const, coeffRef(int,int), coeff(int) const
|
|
*/
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::coeff(int row, int col) const
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
return derived().coeff(row, col);
|
|
}
|
|
|
|
/** \returns the coefficient at given the given row and column.
|
|
*
|
|
* \sa operator()(int,int), operator[](int) const
|
|
*/
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::operator()(int row, int col) const
|
|
{
|
|
ei_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
return derived().coeff(row, col);
|
|
}
|
|
|
|
/** Short version: don't use this function, use
|
|
* \link operator()(int,int) \endlink instead.
|
|
*
|
|
* Long version: this function is similar to
|
|
* \link operator()(int,int) \endlink, but without the assertion.
|
|
* Use this for limiting the performance cost of debugging code when doing
|
|
* repeated coefficient access. Only use this when it is guaranteed that the
|
|
* parameters \a row and \a col are in range.
|
|
*
|
|
* If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this
|
|
* function equivalent to \link operator()(int,int) \endlink.
|
|
*
|
|
* \sa operator()(int,int), coeff(int, int) const, coeffRef(int)
|
|
*/
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::coeffRef(int row, int col)
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
return derived().coeffRef(row, col);
|
|
}
|
|
|
|
/** \returns a reference to the coefficient at given the given row and column.
|
|
*
|
|
* \sa operator()(int,int) const, operator[](int)
|
|
*/
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::operator()(int row, int col)
|
|
{
|
|
ei_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
return derived().coeffRef(row, col);
|
|
}
|
|
|
|
/** Short version: don't use this function, use
|
|
* \link operator[](int) const \endlink instead.
|
|
*
|
|
* Long version: this function is similar to
|
|
* \link operator[](int) const \endlink, but without the assertion.
|
|
* Use this for limiting the performance cost of debugging code when doing
|
|
* repeated coefficient access. Only use this when it is guaranteed that the
|
|
* parameter \a index is in range.
|
|
*
|
|
* If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this
|
|
* function equivalent to \link operator[](int) const \endlink.
|
|
*
|
|
* \sa operator[](int) const, coeffRef(int), coeff(int,int) const
|
|
*/
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::coeff(int index) const
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
return derived().coeff(index);
|
|
}
|
|
|
|
/** \returns the coefficient at given index.
|
|
*
|
|
* This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit.
|
|
*
|
|
* \sa operator[](int), operator()(int,int) const, x() const, y() const,
|
|
* z() const, w() const
|
|
*/
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::operator[](int index) const
|
|
{
|
|
ei_assert(index >= 0 && index < size());
|
|
return derived().coeff(index);
|
|
}
|
|
|
|
/** Short version: don't use this function, use
|
|
* \link operator[](int) \endlink instead.
|
|
*
|
|
* Long version: this function is similar to
|
|
* \link operator[](int) \endlink, but without the assertion.
|
|
* Use this for limiting the performance cost of debugging code when doing
|
|
* repeated coefficient access. Only use this when it is guaranteed that the
|
|
* parameters \a row and \a col are in range.
|
|
*
|
|
* If EIGEN_INTERNAL_DEBUGGING is defined, an assertion will be made, making this
|
|
* function equivalent to \link operator[](int) \endlink.
|
|
*
|
|
* \sa operator[](int), coeff(int) const, coeffRef(int,int)
|
|
*/
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::coeffRef(int index)
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
return derived().coeffRef(index);
|
|
}
|
|
|
|
/** \returns a reference to the coefficient at given index.
|
|
*
|
|
* This method is allowed only for vector expressions, and for matrix expressions having the LinearAccessBit.
|
|
*
|
|
* \sa operator[](int) const, operator()(int,int), x(), y(), z(), w()
|
|
*/
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::operator[](int index)
|
|
{
|
|
ei_assert(index >= 0 && index < size());
|
|
return derived().coeffRef(index);
|
|
}
|
|
|
|
/** equivalent to operator[](0). */
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::x() const { return (*this)[0]; }
|
|
|
|
/** equivalent to operator[](1). */
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::y() const { return (*this)[1]; }
|
|
|
|
/** equivalent to operator[](2). */
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::z() const { return (*this)[2]; }
|
|
|
|
/** equivalent to operator[](3). */
|
|
template<typename Derived>
|
|
inline const typename ei_traits<Derived>::Scalar MatrixBase<Derived>
|
|
::w() const { return (*this)[3]; }
|
|
|
|
/** equivalent to operator[](0). */
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::x() { return (*this)[0]; }
|
|
|
|
/** equivalent to operator[](1). */
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::y() { return (*this)[1]; }
|
|
|
|
/** equivalent to operator[](2). */
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::z() { return (*this)[2]; }
|
|
|
|
/** equivalent to operator[](3). */
|
|
template<typename Derived>
|
|
inline typename ei_traits<Derived>::Scalar& MatrixBase<Derived>
|
|
::w() { return (*this)[3]; }
|
|
|
|
/** \returns the packet of coefficients starting at the given row and column. It is your responsibility
|
|
* to ensure that a packet really starts there. This method is only available on expressions having the
|
|
* PacketAccessBit.
|
|
*
|
|
* The \a LoadMode parameter may have the value \a Aligned or \a Unaligned. Its effect is to select
|
|
* the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets
|
|
* starting at an address which is a multiple of the packet size.
|
|
*/
|
|
template<typename Derived>
|
|
template<int LoadMode>
|
|
inline typename ei_packet_traits<typename ei_traits<Derived>::Scalar>::type
|
|
MatrixBase<Derived>::packet(int row, int col) const
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
return derived().template packet<LoadMode>(row,col);
|
|
}
|
|
|
|
/** Stores the given packet of coefficients, at the given row and column of this expression. It is your responsibility
|
|
* to ensure that a packet really starts there. This method is only available on expressions having the
|
|
* PacketAccessBit.
|
|
*
|
|
* The \a LoadMode parameter may have the value \a Aligned or \a Unaligned. Its effect is to select
|
|
* the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets
|
|
* starting at an address which is a multiple of the packet size.
|
|
*/
|
|
template<typename Derived>
|
|
template<int StoreMode>
|
|
inline void MatrixBase<Derived>::writePacket
|
|
(int row, int col, const typename ei_packet_traits<typename ei_traits<Derived>::Scalar>::type& x)
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
derived().template writePacket<StoreMode>(row,col,x);
|
|
}
|
|
|
|
/** \returns the packet of coefficients starting at the given index. It is your responsibility
|
|
* to ensure that a packet really starts there. This method is only available on expressions having the
|
|
* PacketAccessBit and the LinearAccessBit.
|
|
*
|
|
* The \a LoadMode parameter may have the value \a Aligned or \a Unaligned. Its effect is to select
|
|
* the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets
|
|
* starting at an address which is a multiple of the packet size.
|
|
*/
|
|
template<typename Derived>
|
|
template<int LoadMode>
|
|
inline typename ei_packet_traits<typename ei_traits<Derived>::Scalar>::type
|
|
MatrixBase<Derived>::packet(int index) const
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
return derived().template packet<LoadMode>(index);
|
|
}
|
|
|
|
/** Stores the given packet of coefficients, at the given index in this expression. It is your responsibility
|
|
* to ensure that a packet really starts there. This method is only available on expressions having the
|
|
* PacketAccessBit and the LinearAccessBit.
|
|
*
|
|
* The \a LoadMode parameter may have the value \a Aligned or \a Unaligned. Its effect is to select
|
|
* the appropriate vectorization instruction. Aligned access is faster, but is only possible for packets
|
|
* starting at an address which is a multiple of the packet size.
|
|
*/
|
|
template<typename Derived>
|
|
template<int StoreMode>
|
|
inline void MatrixBase<Derived>::writePacket
|
|
(int index, const typename ei_packet_traits<typename ei_traits<Derived>::Scalar>::type& x)
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
derived().template writePacket<StoreMode>(index,x);
|
|
}
|
|
|
|
template<typename Derived>
|
|
template<typename OtherDerived>
|
|
inline void MatrixBase<Derived>::copyCoeff(int row, int col, const MatrixBase<OtherDerived>& other)
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
derived().coeffRef(row, col) = other.derived().coeff(row, col);
|
|
}
|
|
|
|
template<typename Derived>
|
|
template<typename OtherDerived>
|
|
inline void MatrixBase<Derived>::copyCoeff(int index, const MatrixBase<OtherDerived>& other)
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
derived().coeffRef(index) = other.derived().coeff(index);
|
|
}
|
|
|
|
template<typename Derived>
|
|
template<typename OtherDerived, int StoreMode, int LoadMode>
|
|
inline void MatrixBase<Derived>::copyPacket(int row, int col, const MatrixBase<OtherDerived>& other)
|
|
{
|
|
ei_internal_assert(row >= 0 && row < rows()
|
|
&& col >= 0 && col < cols());
|
|
derived().template writePacket<StoreMode>(row, col,
|
|
other.derived().template packet<LoadMode>(row, col));
|
|
}
|
|
|
|
template<typename Derived>
|
|
template<typename OtherDerived, int StoreMode, int LoadMode>
|
|
inline void MatrixBase<Derived>::copyPacket(int index, const MatrixBase<OtherDerived>& other)
|
|
{
|
|
ei_internal_assert(index >= 0 && index < size());
|
|
derived().template writePacket<StoreMode>(index,
|
|
other.derived().template packet<LoadMode>(index));
|
|
}
|
|
|
|
#endif // EIGEN_COEFFS_H
|