deal.II version GIT relicensing-2167-g9622207b8f 2024-11-21 12:40:00+00:00
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
Public Member Functions | Private Member Functions | Private Attributes | Static Private Attributes | List of all members
internal::AlignedVectorCopyConstruct< RandomAccessIterator, T > Class Template Reference
Inheritance diagram for internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >:
Inheritance graph
[legend]

Public Member Functions

 AlignedVectorCopyConstruct (RandomAccessIterator source_begin, RandomAccessIterator source_end, T *const destination)
 
virtual void apply_to_subrange (const std::size_t begin, const std::size_t end) const override
 

Private Member Functions

void apply_parallel (const std::size_t begin, const std::size_t end, const std::size_t minimum_parallel_grain_size) const
 

Private Attributes

RandomAccessIterator source_
 
T *const destination_
 

Static Private Attributes

static const std::size_t minimum_parallel_grain_size
 

Detailed Description

template<typename RandomAccessIterator, typename T>
class internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >

A class that given a range of memory locations calls the placement-new operator on these memory locations and copy-constructs objects of type T there.

This class is based on the specialized for loop base class ParallelForLoop in parallel.h whose purpose is the following: When calling a parallel for loop on AlignedVector with apply_to_subranges, it generates different code for every different argument we might choose (as it is templated). This gives a lot of code (e.g. it triples the memory required for compiling the file matrix_free.cc and the final object size is several times larger) which is completely useless. Therefore, this class channels all copy commands through one call to apply_to_subrange for all possible types, which makes the copy operation much cleaner (thanks to a virtual function, whose cost is negligible in this context).

Definition at line 780 of file aligned_vector.h.

Constructor & Destructor Documentation

◆ AlignedVectorCopyConstruct()

template<typename RandomAccessIterator , typename T >
internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >::AlignedVectorCopyConstruct ( RandomAccessIterator  source_begin,
RandomAccessIterator  source_end,
T *const  destination 
)
inline

Constructor. Issues a parallel call if there are sufficiently many elements, otherwise works in serial. Copies the data from the half-open interval between source_begin and source_end to array starting at destination (by calling the copy constructor with placement new).

The elements from the source array are simply copied via the placement new copy constructor.

Definition at line 796 of file aligned_vector.h.

Member Function Documentation

◆ apply_to_subrange()

template<typename RandomAccessIterator , typename T >
virtual void internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >::apply_to_subrange ( const std::size_t  begin,
const std::size_t  end 
) const
inlineoverridevirtual

This method moves elements from the source to the destination given in the constructor on a subrange given by two integers.

Implements parallel::ParallelForInteger.

Definition at line 817 of file aligned_vector.h.

◆ apply_parallel()

void parallel::ParallelForInteger::apply_parallel ( const std::size_t  begin,
const std::size_t  end,
const std::size_t  minimum_parallel_grain_size 
) const
inlineinherited

This function runs the for loop over the given range [lower,upper), possibly in parallel when end-begin is larger than the minimum parallel grain size. This function is marked const because it any operation that changes the data of a derived class will inherently not be thread-safe when several threads work with the same data simultaneously.

Definition at line 743 of file parallel.h.

Member Data Documentation

◆ minimum_parallel_grain_size

template<typename RandomAccessIterator , typename T >
const std::size_t internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >::minimum_parallel_grain_size
staticprivate
Initial value:
=
160000 / sizeof(T) + 1

Definition at line 783 of file aligned_vector.h.

◆ source_

template<typename RandomAccessIterator , typename T >
RandomAccessIterator internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >::source_
private

Definition at line 836 of file aligned_vector.h.

◆ destination_

template<typename RandomAccessIterator , typename T >
T* const internal::AlignedVectorCopyConstruct< RandomAccessIterator, T >::destination_
private

Definition at line 837 of file aligned_vector.h.


The documentation for this class was generated from the following file: