// // Copyright (c) 2002--2010 // Toon Knapen, Karl Meerbergen, Kresimir Fresl, // Thomas Klimpel and Rutger ter Borg // // Distributed under the Boost Software License, Version 1.0. // (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // THIS FILE IS AUTOMATICALLY GENERATED // PLEASE DO NOT EDIT! // #ifndef BOOST_NUMERIC_BINDINGS_LAPACK_DRIVER_ITER_POSV_HPP #define BOOST_NUMERIC_BINDINGS_LAPACK_DRIVER_ITER_POSV_HPP #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // // The LAPACK-backend for iter_posv is the netlib-compatible backend. // #include #include namespace boost { namespace numeric { namespace bindings { namespace lapack { // // The detail namespace contains value-type-overloaded functions that // dispatch to the appropriate back-end LAPACK-routine. // namespace detail { // // Overloaded function for dispatching to // * netlib-compatible LAPACK backend (the default), and // * double value-type. // template< typename UpLo > inline std::ptrdiff_t iter_posv( const UpLo, const fortran_int_t n, const fortran_int_t nrhs, double* a, const fortran_int_t lda, const double* b, const fortran_int_t ldb, double* x, const fortran_int_t ldx, double* work, float* swork, fortran_int_t& iter ) { fortran_int_t info(0); LAPACK_DSPOSV( &lapack_option< UpLo >::value, &n, &nrhs, a, &lda, b, &ldb, x, &ldx, work, swork, &iter, &info ); return info; } // // Overloaded function for dispatching to // * netlib-compatible LAPACK backend (the default), and // * complex value-type. // template< typename UpLo > inline std::ptrdiff_t iter_posv( const UpLo, const fortran_int_t n, const fortran_int_t nrhs, std::complex* a, const fortran_int_t lda, const std::complex* b, const fortran_int_t ldb, std::complex* x, const fortran_int_t ldx, std::complex* work, std::complex* swork, double* rwork, fortran_int_t& iter ) { fortran_int_t info(0); LAPACK_ZCPOSV( &lapack_option< UpLo >::value, &n, &nrhs, a, &lda, b, &ldb, x, &ldx, work, swork, rwork, &iter, &info ); return info; } } // namespace detail // // Value-type based template class. Use this class if you need a type // for dispatching to iter_posv. // template< typename Value, typename Enable = void > struct iter_posv_impl {}; // // This implementation is enabled if Value is a real type. // template< typename Value > struct iter_posv_impl< Value, typename boost::enable_if< is_real< Value > >::type > { typedef Value value_type; typedef typename remove_imaginary< Value >::type real_type; // // Static member function for user-defined workspaces, that // * Deduces the required arguments for dispatching to LAPACK, and // * Asserts that most arguments make sense. // template< typename MatrixA, typename MatrixB, typename MatrixX, typename WORK, typename SWORK > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, detail::workspace2< WORK, SWORK > work ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixA >::value) ); BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixB >::value) ); BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixX >::value) ); BOOST_STATIC_ASSERT( (boost::is_same< typename remove_const< typename bindings::value_type< MatrixA >::type >::type, typename remove_const< typename bindings::value_type< MatrixB >::type >::type >::value) ); BOOST_STATIC_ASSERT( (boost::is_same< typename remove_const< typename bindings::value_type< MatrixA >::type >::type, typename remove_const< typename bindings::value_type< MatrixX >::type >::type >::value) ); BOOST_STATIC_ASSERT( (bindings::is_mutable< MatrixA >::value) ); BOOST_STATIC_ASSERT( (bindings::is_mutable< MatrixX >::value) ); BOOST_ASSERT( bindings::size(work.select(real_type())) >= min_size_swork( bindings::size_column(a), bindings::size_column(b) )); BOOST_ASSERT( bindings::size(work.select(real_type())) >= min_size_work( bindings::size_column(a), bindings::size_column(b) )); BOOST_ASSERT( bindings::size_column(a) >= 0 ); BOOST_ASSERT( bindings::size_column(b) >= 0 ); BOOST_ASSERT( bindings::size_minor(a) == 1 || bindings::stride_minor(a) == 1 ); BOOST_ASSERT( bindings::size_minor(b) == 1 || bindings::stride_minor(b) == 1 ); BOOST_ASSERT( bindings::size_minor(x) == 1 || bindings::stride_minor(x) == 1 ); BOOST_ASSERT( bindings::stride_major(a) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); BOOST_ASSERT( bindings::stride_major(b) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); BOOST_ASSERT( bindings::stride_major(x) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); return detail::iter_posv( uplo(), bindings::size_column(a), bindings::size_column(b), bindings::begin_value(a), bindings::stride_major(a), bindings::begin_value(b), bindings::stride_major(b), bindings::begin_value(x), bindings::stride_major(x), bindings::begin_value(work.select(real_type())), bindings::begin_value(work.select(real_type())), iter ); } // // Static member function that // * Figures out the minimal workspace requirements, and passes // the results to the user-defined workspace overload of the // invoke static member function // * Enables the unblocked algorithm (BLAS level 2) // template< typename MatrixA, typename MatrixB, typename MatrixX > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, minimal_workspace ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; bindings::detail::array< real_type > tmp_work( min_size_work( bindings::size_column(a), bindings::size_column(b) ) ); bindings::detail::array< real_type > tmp_swork( min_size_swork( bindings::size_column(a), bindings::size_column(b) ) ); return invoke( a, b, x, iter, workspace( tmp_work, tmp_swork ) ); } // // Static member function that // * Figures out the optimal workspace requirements, and passes // the results to the user-defined workspace overload of the // invoke static member // * Enables the blocked algorithm (BLAS level 3) // template< typename MatrixA, typename MatrixB, typename MatrixX > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, optimal_workspace ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; return invoke( a, b, x, iter, minimal_workspace() ); } // // Static member function that returns the minimum size of // workspace-array work. // static std::ptrdiff_t min_size_work( const std::ptrdiff_t n, const std::ptrdiff_t nrhs ) { return n*nrhs; } // // Static member function that returns the minimum size of // workspace-array swork. // static std::ptrdiff_t min_size_swork( const std::ptrdiff_t n, const std::ptrdiff_t nrhs ) { return n*(n+nrhs); } }; // // This implementation is enabled if Value is a complex type. // template< typename Value > struct iter_posv_impl< Value, typename boost::enable_if< is_complex< Value > >::type > { typedef Value value_type; typedef typename remove_imaginary< Value >::type real_type; // // Static member function for user-defined workspaces, that // * Deduces the required arguments for dispatching to LAPACK, and // * Asserts that most arguments make sense. // template< typename MatrixA, typename MatrixB, typename MatrixX, typename WORK, typename SWORK, typename RWORK > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, detail::workspace3< WORK, SWORK, RWORK > work ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixA >::value) ); BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixB >::value) ); BOOST_STATIC_ASSERT( (bindings::is_column_major< MatrixX >::value) ); BOOST_STATIC_ASSERT( (boost::is_same< typename remove_const< typename bindings::value_type< MatrixA >::type >::type, typename remove_const< typename bindings::value_type< MatrixB >::type >::type >::value) ); BOOST_STATIC_ASSERT( (boost::is_same< typename remove_const< typename bindings::value_type< MatrixA >::type >::type, typename remove_const< typename bindings::value_type< MatrixX >::type >::type >::value) ); BOOST_STATIC_ASSERT( (bindings::is_mutable< MatrixA >::value) ); BOOST_STATIC_ASSERT( (bindings::is_mutable< MatrixX >::value) ); BOOST_ASSERT( bindings::size(work.select(real_type())) >= min_size_rwork( bindings::size_column(a) )); BOOST_ASSERT( bindings::size(work.select(value_type())) >= min_size_swork( bindings::size_column(a), bindings::size_column(b) )); BOOST_ASSERT( bindings::size(work.select(value_type())) >= min_size_work( bindings::size_column(a), bindings::size_column(b) )); BOOST_ASSERT( bindings::size_column(a) >= 0 ); BOOST_ASSERT( bindings::size_column(b) >= 0 ); BOOST_ASSERT( bindings::size_minor(a) == 1 || bindings::stride_minor(a) == 1 ); BOOST_ASSERT( bindings::size_minor(b) == 1 || bindings::stride_minor(b) == 1 ); BOOST_ASSERT( bindings::size_minor(x) == 1 || bindings::stride_minor(x) == 1 ); BOOST_ASSERT( bindings::stride_major(a) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); BOOST_ASSERT( bindings::stride_major(b) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); BOOST_ASSERT( bindings::stride_major(x) >= std::max< std::ptrdiff_t >(1, bindings::size_column(a)) ); return detail::iter_posv( uplo(), bindings::size_column(a), bindings::size_column(b), bindings::begin_value(a), bindings::stride_major(a), bindings::begin_value(b), bindings::stride_major(b), bindings::begin_value(x), bindings::stride_major(x), bindings::begin_value(work.select(value_type())), bindings::begin_value(work.select(value_type())), bindings::begin_value(work.select(real_type())), iter ); } // // Static member function that // * Figures out the minimal workspace requirements, and passes // the results to the user-defined workspace overload of the // invoke static member function // * Enables the unblocked algorithm (BLAS level 2) // template< typename MatrixA, typename MatrixB, typename MatrixX > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, minimal_workspace ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; bindings::detail::array< value_type > tmp_work( min_size_work( bindings::size_column(a), bindings::size_column(b) ) ); bindings::detail::array< value_type > tmp_swork( min_size_swork( bindings::size_column(a), bindings::size_column(b) ) ); bindings::detail::array< real_type > tmp_rwork( min_size_rwork( bindings::size_column(a) ) ); return invoke( a, b, x, iter, workspace( tmp_work, tmp_swork, tmp_rwork ) ); } // // Static member function that // * Figures out the optimal workspace requirements, and passes // the results to the user-defined workspace overload of the // invoke static member // * Enables the blocked algorithm (BLAS level 3) // template< typename MatrixA, typename MatrixB, typename MatrixX > static std::ptrdiff_t invoke( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, optimal_workspace ) { namespace bindings = ::boost::numeric::bindings; typedef typename result_of::uplo_tag< MatrixA >::type uplo; return invoke( a, b, x, iter, minimal_workspace() ); } // // Static member function that returns the minimum size of // workspace-array work. // static std::ptrdiff_t min_size_work( const std::ptrdiff_t n, const std::ptrdiff_t nrhs ) { return n*nrhs; } // // Static member function that returns the minimum size of // workspace-array swork. // static std::ptrdiff_t min_size_swork( const std::ptrdiff_t n, const std::ptrdiff_t nrhs ) { return n*(n+nrhs); } // // Static member function that returns the minimum size of // workspace-array rwork. // static std::ptrdiff_t min_size_rwork( const std::ptrdiff_t n ) { return n; } }; // // Functions for direct use. These functions are overloaded for temporaries, // so that wrapped types can still be passed and used for write-access. In // addition, if applicable, they are overloaded for user-defined workspaces. // Calls to these functions are passed to the iter_posv_impl classes. In the // documentation, most overloads are collapsed to avoid a large number of // prototypes which are very similar. // // // Overloaded function for iter_posv. Its overload differs for // * User-defined workspace // template< typename MatrixA, typename MatrixB, typename MatrixX, typename Workspace > inline typename boost::enable_if< detail::is_workspace< Workspace >, std::ptrdiff_t >::type iter_posv( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter, Workspace work ) { return iter_posv_impl< typename bindings::value_type< MatrixA >::type >::invoke( a, b, x, iter, work ); } // // Overloaded function for iter_posv. Its overload differs for // * Default workspace-type (optimal) // template< typename MatrixA, typename MatrixB, typename MatrixX > inline typename boost::disable_if< detail::is_workspace< MatrixX >, std::ptrdiff_t >::type iter_posv( MatrixA& a, const MatrixB& b, MatrixX& x, fortran_int_t& iter ) { return iter_posv_impl< typename bindings::value_type< MatrixA >::type >::invoke( a, b, x, iter, optimal_workspace() ); } } // namespace lapack } // namespace bindings } // namespace numeric } // namespace boost #endif