80template <
class ParticleCell,
class Functor,
bool combineSoA = false>
96 explicit LCC01Traversal(
const std::array<unsigned long, 3> &dims,
Functor &functor,
const double interactionLength,
97 const std::array<double, 3> &cellLength, DataLayoutOption dataLayout,
bool useNewton3)
99 dataLayout, useNewton3),
100 _cellFunctor(functor, interactionLength ,
101 dataLayout, useNewton3),
121 return (combineSoA) ? TraversalOption::lc_c01_combined_SoA : TraversalOption::lc_c01;
128 _cellFunctor.setAoSSortingThresholds(aosSortingThreshold);
135 _cellFunctor.setSoASortingThresholds(soaSortingThreshold);
140 using CellOffsetsType = std::conditional_t<decltype(utils::isPairwiseFunctor<Functor>())::value,
141 std::vector<std::vector<std::pair<
long, std::array<double, 3>>>>,
142 std::vector<std::tuple<
long,
long, std::array<double, 3>>>>;
145 using CellFunctorType = std::conditional_t<decltype(utils::isPairwiseFunctor<Functor>())::value,
157 inline void processBaseCell(std::vector<ParticleCell> &cells,
unsigned long x,
unsigned long y,
unsigned long z);
163 inline void processBaseCellPairwise(std::vector<ParticleCell> &cells,
unsigned long x,
unsigned long y,
170 inline void processBaseCellTriwise(std::vector<ParticleCell> &cells,
unsigned long x,
unsigned long y,
177 void computePairwiseOffsets();
183 void computeTriwiseOffsets();
191 template <std::size_t... I>
194 appendCell._particleSoABuffer);
201 void resizeBuffers();
207 CellOffsetsType _cellOffsets;
212 CellFunctorType _cellFunctor;
222 std::vector<std::vector<ParticleCell>> _combinationSlices;
227 std::vector<unsigned int> _currentSlices;
232 const unsigned int _cacheOffset;
235template <
class ParticleCell,
class Functor,
bool combineSoA>
238 computePairwiseOffsets();
240 computeTriwiseOffsets();
246template <
class ParticleCell,
class Functor,
bool combineSoA>
248 _cellOffsets.resize(2 * this->_overlap[0] + 1);
250 const auto interactionLengthSquare{this->_interactionLength * this->_interactionLength};
252 for (
long x = -this->_overlap[0]; x <= 0l; ++x) {
253 for (
long y = -this->_overlap[1]; y <= static_cast<long>(this->_overlap[1]); ++y) {
254 for (
long z = -this->_overlap[2]; z <= static_cast<long>(this->_overlap[2]); ++z) {
255 const std::array<double, 3> pos = {
256 std::max(0l, (std::abs(x) - 1l)) * this->_cellLength[0],
257 std::max(0l, (std::abs(y) - 1l)) * this->_cellLength[1],
258 std::max(0l, (std::abs(z) - 1l)) * this->_cellLength[2],
261 if (distSquare <= interactionLengthSquare) {
263 x, y, z, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
264 const bool containCurrentOffset =
265 std::any_of(_cellOffsets[x + this->_overlap[0]].cbegin(), _cellOffsets[x + this->_overlap[0]].cend(),
266 [currentOffset](
const auto &e) {
return e.first == currentOffset; });
267 if (containCurrentOffset) {
270 for (
long ix = x; ix <= std::abs(x); ++ix) {
272 ix, y, z, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
273 const size_t index = ix + this->_overlap[0];
277 std::array<double, 3> sortingDir = {
static_cast<double>(ix) * this->_cellLength[0],
278 static_cast<double>(y) * this->_cellLength[1],
279 static_cast<double>(z) * this->_cellLength[2]};
282 if (ix == 0 and y == 0 and z == 0) {
283 sortingDir = {1., 1., 1.};
287 if (y == 0l and z == 0l) {
289 _cellOffsets[index].insert(_cellOffsets[index].cbegin(), std::make_pair(offset, sortingDir));
291 _cellOffsets[index].emplace_back(offset, sortingDir);
300template <
class ParticleCell,
class Functor,
bool combineSoA>
301inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::computeTriwiseOffsets() {
302 using namespace utils::ArrayMath::literals;
304 const int cubeSize = this->_overlap[0] * this->_overlap[1] * this->_overlap[2];
305 _cellOffsets.reserve(cubeSize * cubeSize / 4);
308 auto cellDistance = [&](
long x1,
long y1,
long z1,
long x2,
long y2,
long z2) {
309 return std::array<double, 3>{std::max(0l, (std::abs(x1 - x2) - 1l)) * this->_cellLength[0],
310 std::max(0l, (std::abs(y1 - y2) - 1l)) * this->_cellLength[1],
311 std::max(0l, (std::abs(z1 - z2) - 1l)) * this->_cellLength[2]};
314 const auto interactionLengthSquare{this->_interactionLength * this->_interactionLength};
315 _cellOffsets.emplace_back(0, 0, std::array<double, 3>{1., 1., 1.});
318 for (
long x1 = -this->_overlap[0]; x1 <= static_cast<long>(this->_overlap[0]); ++x1) {
319 for (
long y1 = -this->_overlap[1]; y1 <= static_cast<long>(this->_overlap[1]); ++y1) {
320 for (
long z1 = -this->_overlap[2]; z1 <= static_cast<long>(this->_overlap[2]); ++z1) {
322 const auto dist01 = cellDistance(0l, 0l, 0l, x1, y1, z1);
325 if (distSquare > interactionLengthSquare)
continue;
328 for (
long x2 = -this->_overlap[0]; x2 <= static_cast<long>(this->_overlap[0]); ++x2) {
329 for (
long y2 = -this->_overlap[1]; y2 <= static_cast<long>(this->_overlap[1]); ++y2) {
330 for (
long z2 = -this->_overlap[2]; z2 <= static_cast<long>(this->_overlap[2]); ++z2) {
332 const auto dist12 = cellDistance(x1, y1, z1, x2, y2, z2);
335 if (dist12Squared > interactionLengthSquare)
continue;
338 const auto dist02 = cellDistance(0l, 0l, 0l, x2, y2, z2);
341 if (dist02Squared > interactionLengthSquare)
continue;
344 x1, y1, z1, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
347 x2, y2, z2, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
350 if (offset2 <= offset1)
continue;
353 std::array<double, 3> sortDirection{};
355 sortDirection = {x2 * this->_cellLength[0], y2 * this->_cellLength[1], z2 * this->_cellLength[2]};
357 sortDirection = {x1 * this->_cellLength[0], y1 * this->_cellLength[1], z1 * this->_cellLength[2]};
368template <
class ParticleCell,
class Functor,
bool combineSoA>
369inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCell(std::vector<ParticleCell> &cells,
370 unsigned long x,
unsigned long y,
372 if constexpr (utils::isPairwiseFunctor<Functor>()) {
373 processBaseCellPairwise(cells, x, y, z);
374 }
else if constexpr (utils::isTriwiseFunctor<Functor>()) {
375 processBaseCellTriwise(cells, x, y, z);
378 "LCC01Traversal::processBaseCell(): Functor {} is not of type PairwiseFunctor or TriwiseFunctor.",
383template <
class ParticleCell,
class Functor,
bool combineSoA>
384inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCellPairwise(std::vector<ParticleCell> &cells,
385 unsigned long x,
unsigned long y,
388 ParticleCell &baseCell = cells[baseIndex];
389 const size_t cOffSize = _cellOffsets.size();
391 if constexpr (combineSoA) {
395 auto ¤tSlice = _currentSlices[threadID * _cacheOffset];
396 auto &combinationSlice = _combinationSlices[threadID];
399 if (x == this->_overlap[0]) {
401 for (
unsigned int offsetSlice = 0; offsetSlice < cOffSize; offsetSlice++) {
402 combinationSlice[offsetSlice]._particleSoABuffer.clear();
403 for (
const auto &offset : _cellOffsets[offsetSlice]) {
404 const unsigned long otherIndex = baseIndex + offset.first;
405 ParticleCell &otherCell = cells[otherIndex];
406 appendNeeded(combinationSlice[offsetSlice], otherCell,
413 const size_t midSlice = (currentSlice + this->_overlap[0] + 1) % cOffSize;
414 for (
size_t slice = (currentSlice + 1) % cOffSize; slice != midSlice; ++slice %= cOffSize, ++i) {
416 for (
const auto &offset : _cellOffsets[i]) {
417 const unsigned long otherIndex = baseIndex + offset.first;
418 ParticleCell &otherCell = cells[otherIndex];
419 newSize += otherCell.size();
421 combinationSlice[slice]._particleSoABuffer.resizeArrays(newSize);
424 for (
size_t slice = midSlice; slice != currentSlice; ++slice %= cOffSize, ++i) {
425 for (
auto offsetIndex = _cellOffsets[(i + 1) % cOffSize].size(); offsetIndex < _cellOffsets[i].size();
427 const unsigned long otherIndex = baseIndex + _cellOffsets[i][offsetIndex].first;
428 ParticleCell &otherCell = cells[otherIndex];
429 appendNeeded(combinationSlice[slice], otherCell,
434 combinationSlice[currentSlice]._particleSoABuffer.clear();
436 for (
const auto &offset : _cellOffsets.back()) {
437 const unsigned long otherIndex = baseIndex + offset.first;
438 ParticleCell &otherCell = cells[otherIndex];
439 appendNeeded(combinationSlice[currentSlice], otherCell,
443 ++currentSlice %= cOffSize;
447 for (
unsigned int slice = 0; slice < cOffSize; slice++) {
448 if (slice == (currentSlice + this->_overlap[0]) % cOffSize) {
451 auto startIndex = baseCell.size();
452 auto endIndex = combinationSlice[slice]._particleSoABuffer.size();
453 _functor.SoAFunctorPair(baseCell._particleSoABuffer,
454 {&(combinationSlice[slice]._particleSoABuffer), startIndex, endIndex},
false);
456 this->_cellFunctor.processCell(baseCell);
458 this->_cellFunctor.processCellPair(baseCell, combinationSlice[slice]);
462 for (
const auto &slice : _cellOffsets) {
463 for (
auto const &[offset, r] : slice) {
464 const unsigned long otherIndex = baseIndex + offset;
465 ParticleCell &otherCell = cells[otherIndex];
467 if (baseIndex == otherIndex) {
468 this->_cellFunctor.processCell(baseCell);
470 this->_cellFunctor.processCellPair(baseCell, otherCell, r);
477template <
class ParticleCell,
class Functor,
bool combineSoA>
478inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCellTriwise(std::vector<ParticleCell> &cells,
479 unsigned long x,
unsigned long y,
482 ParticleCell &baseCell = cells[baseIndex];
484 for (
auto const &[offset1, offset2, r] : _cellOffsets) {
485 const unsigned long otherIndex1 = baseIndex + offset1;
486 const unsigned long otherIndex2 = baseIndex + offset2;
487 ParticleCell &otherCell1 = cells[otherIndex1];
488 ParticleCell &otherCell2 = cells[otherIndex2];
490 if (baseIndex == otherIndex1 and baseIndex == otherIndex2) {
491 this->_cellFunctor.processCell(baseCell);
492 }
else if (baseIndex == otherIndex1 and baseIndex != otherIndex2) {
493 this->_cellFunctor.processCellPair(baseCell, otherCell2);
494 }
else if (baseIndex != otherIndex1 and baseIndex == otherIndex2) {
495 this->_cellFunctor.processCellPair(baseCell, otherCell1);
496 }
else if (baseIndex != otherIndex1 and otherIndex1 == otherIndex2) {
497 this->_cellFunctor.processCellPair(baseCell, otherCell1);
499 this->_cellFunctor.processCellTriple(baseCell, otherCell1, otherCell2, r);
504template <
class ParticleCell,
class PairwiseFunctor,
bool combineSoA>
505inline void LCC01Traversal<ParticleCell, PairwiseFunctor, combineSoA>::resizeBuffers() {
507 if (_combinationSlices.size() != numThreads) {
508 _combinationSlices.resize(numThreads);
509 const auto cellOffsetsSize = _cellOffsets.size();
510 std::for_each(_combinationSlices.begin(), _combinationSlices.end(),
511 [cellOffsetsSize](
auto &e) { e.resize(cellOffsetsSize); });
512 _currentSlices.resize(numThreads * _cacheOffset);
516template <
class ParticleCell,
class Functor,
bool combineSoA>
518 auto &cells = *(this->_cells);
519 if (not this->isApplicableToDomain()) {
520 if constexpr (combineSoA) {
522 "The C01 traversal with combined SoA buffers cannot work with data layout AoS and enabled newton3 (unless "
523 "only one thread is used)!");
526 "The C01 traversal cannot work with enabled newton3 (unless only one thread is used)!");
529 if constexpr (combineSoA) {
532 this->c01Traversal([&](
unsigned long x,
unsigned long y,
unsigned long z) { this->processBaseCell(cells, x, y, z); });
This class provides the base for traversals using the c01 base step.
Definition: C01BasedTraversal.h:25
Functor base class.
Definition: Functor.h:41
static constexpr std::array< typename Particle_T::AttributeNames, 0 > getNeededAttr()
Get attributes needed for computation.
Definition: Functor.h:78
This class provides the c01 traversal and the c01 traversal with combined SoA buffers.
Definition: LCC01Traversal.h:82
void setAoSSortingThresholds(const SortingThresholdInfoInterface &aosSortingThreshold) override
Set the aos-sorting-threshold for traversals that use the CellFunctor.
Definition: LCC01Traversal.h:127
void traverseParticles() override
Traverse the particles by pairs, triplets etc.
Definition: LCC01Traversal.h:517
void setSoASortingThresholds(const SortingThresholdInfoInterface &soaSortingThreshold) override
Set the SoA sorting-threshold for traversals that use the CellFunctor.
Definition: LCC01Traversal.h:134
TraversalOption getTraversalType() const override
Return a enum representing the name of the traversal class.
Definition: LCC01Traversal.h:120
void computeOffsets()
Computes all combinations of cells used in processBaseCell()
Definition: LCC01Traversal.h:236
bool isApplicableToDomain() const override
LC C01 is always applicable to the domain.
Definition: LCC01Traversal.h:118
LCC01Traversal(const std::array< unsigned long, 3 > &dims, Functor &functor, const double interactionLength, const std::array< double, 3 > &cellLength, DataLayoutOption dataLayout, bool useNewton3)
Constructor of the c01 traversal.
Definition: LCC01Traversal.h:96
Interface for traversals used by the LinkedCell class.
Definition: LCTraversalInterface.h:18
Class for Cells of Particles.
Definition: ParticleCell.h:49
A cell functor.
Definition: CellFunctor3B.h:25
A cell functor.
Definition: CellFunctor.h:32
static void exception(const Exception e)
Handle an exception derived by std::exception.
Definition: ExceptionHandler.h:64
constexpr T dot(const std::array< T, SIZE > &a, const std::array< T, SIZE > &b)
Generates the dot product of two arrays.
Definition: ArrayMath.h:233
constexpr std::array< T, SIZE > normalize(const std::array< T, SIZE > &a)
Generates a normalized array (|a| = 1).
Definition: ArrayMath.h:304
constexpr T threeToOneD(T x, T y, T z, const std::array< T, 3 > &dims)
Convert a 3d index to a 1d index.
Definition: ThreeDimensionalMapping.h:29
decltype(isTriwiseFunctorImpl(std::declval< FunctorT >())) isTriwiseFunctor
Check whether a Functor Type is inheriting from TriwiseFunctor.
Definition: checkFunctorType.h:56
decltype(isPairwiseFunctorImpl(std::declval< FunctorT >())) isPairwiseFunctor
Check whether a Functor Type is inheriting from PairwiseFunctor.
Definition: checkFunctorType.h:49
This is the main namespace of AutoPas.
Definition: AutoPasDecl.h:34
int autopas_get_max_threads()
Dummy for omp_get_max_threads() when no OpenMP is available.
Definition: WrapOpenMP.h:144
int autopas_get_thread_num()
Dummy for omp_set_lock() when no OpenMP is available.
Definition: WrapOpenMP.h:132
constexpr unsigned int DEFAULT_CACHE_LINE_SIZE
Default size for a cache line.
Definition: AlignedAllocator.h:21
Polymorphic base for sorting-threshold storage.
Definition: SortingThresholdInfoInterface.h:18