FflasFfpack
Data Structures | Namespaces | Macros | Functions
fflas_helpers.inl File Reference
#include "fflas-ffpack/field/field-traits.h"
#include "fflas-ffpack/paladin/parallel.h"
#include "fflas-ffpack/utils/flimits.h"
#include <algorithm>

Data Structures

struct  Auto
 
struct  Classic
 
struct  DivideAndConquer
 
struct  Winograd
 
struct  WinogradPar
 
struct  Bini
 
struct  AlgoChooser< ModeT, ParSeq >
 
struct  AlgoChooser< ModeCategories::ConvertTo< ElementCategories::RNSElementTag >, ParSeq >
 
struct  MMHelper< Field, AlgoTrait, ModeCategories::DefaultTag, ParSeqTrait >
 FGEMM Helper for Default and ConvertTo modes of operation. More...
 
struct  MMHelper< Field, AlgoTrait, ModeCategories::ConvertTo< Dest >, ParSeqTrait >
 
struct  MMHelper< Field, AlgoTrait, ModeTrait, ParSeqTrait >
 
struct  Recursive
 
struct  Iterative
 
struct  Hybrid
 
struct  TRSMHelper< RecIterTrait, ParSeqTrait >
 TRSM Helper. More...
 

Namespaces

namespace  FFLAS
 
namespace  FFLAS::Protected
 
namespace  FFLAS::MMHelperAlgo
 
namespace  FFLAS::StructureHelper
 StructureHelper for ftrsm.
 

Macros

#define __FFLASFFPACK_fflas_fflas_mmhelper_INL
 

Functions

template<class Field >
int WinogradSteps (const Field &F, const size_t &m)
 Computes the number of recursive levels to perform. More...
 
template<class DFE >
size_t min_types (const DFE &k)
 
template<>
size_t min_types (const RecInt::rint< 6 > &k)
 
template<>
size_t min_types (const RecInt::rint< 7 > &k)
 
template<>
size_t min_types (const RecInt::rint< 8 > &k)
 
template<>
size_t min_types (const RecInt::rint< 9 > &k)
 
template<>
size_t min_types (const RecInt::rint< 10 > &k)
 
template<>
size_t min_types (const Givaro::Integer &k)
 
template<class T >
bool unfit (T x)
 
template<>
bool unfit (int64_t x)
 
template<size_t K>
bool unfit (RecInt::rint< K > x)
 
template<>
bool unfit (RecInt::rint< 6 > x)
 

Macro Definition Documentation

◆ __FFLASFFPACK_fflas_fflas_mmhelper_INL

#define __FFLASFFPACK_fflas_fflas_mmhelper_INL