AutoPas  3.0.0
Loading...
Searching...
No Matches
LCC01Traversal.h
Go to the documentation of this file.
1
7#pragma once
8
18
19namespace autopas {
20
80template <class ParticleCell, class Functor, bool combineSoA = false>
81class LCC01Traversal : public C01BasedTraversal<ParticleCell, Functor, (combineSoA ? 2 : 3)>,
83 public:
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)
98 : C01BasedTraversal<ParticleCell, Functor, (combineSoA ? 2 : 3)>(dims, functor, interactionLength, cellLength,
99 dataLayout, useNewton3),
100 _cellFunctor(functor, interactionLength /*should use cutoff here, if not used to build verlet-lists*/,
101 dataLayout, useNewton3),
102 _functor(functor),
103 _cacheOffset(DEFAULT_CACHE_LINE_SIZE / sizeof(unsigned int)) {
105 }
106
110 void computeOffsets();
111
112 void traverseParticles() override;
113
118 [[nodiscard]] bool isApplicableToDomain() const override { return true; }
119
120 [[nodiscard]] TraversalOption getTraversalType() const override {
121 return (combineSoA) ? TraversalOption::lc_c01_combined_SoA : TraversalOption::lc_c01;
122 }
123
127 void setAoSSortingThreshold(size_t aosSortingThreshold) override {
128 _cellFunctor.setAoSSortingThreshold(aosSortingThreshold);
129 }
133 void setSoASortingThreshold(size_t soaSortingThreshold) override {
134 _cellFunctor.setSoASortingThreshold(soaSortingThreshold);
135 }
136
137 private:
138 // CellOffsets needs to store interaction pairs or triplets depending on the Functor type.
139 using CellOffsetsType = std::conditional_t<decltype(utils::isPairwiseFunctor<Functor>())::value,
140 std::vector<std::vector<std::pair<long, std::array<double, 3>>>>,
141 std::vector<std::tuple<long, long, std::array<double, 3>>>>;
142
143 // CellFunctor type for either Pairwise or Triwise Functors.
144 using CellFunctorType = std::conditional_t<decltype(utils::isPairwiseFunctor<Functor>())::value,
147
156 inline void processBaseCell(std::vector<ParticleCell> &cells, unsigned long x, unsigned long y, unsigned long z);
157
162 inline void processBaseCellPairwise(std::vector<ParticleCell> &cells, unsigned long x, unsigned long y,
163 unsigned long z);
164
169 inline void processBaseCellTriwise(std::vector<ParticleCell> &cells, unsigned long x, unsigned long y,
170 unsigned long z);
171
176 void computePairwiseOffsets();
177
182 void computeTriwiseOffsets();
183
190 template <std::size_t... I>
191 constexpr void appendNeeded(ParticleCell &cell, ParticleCell &appendCell, std::index_sequence<I...>) {
192 cell._particleSoABuffer.template append<std::get<I>(Functor::getNeededAttr(std::false_type()))...>(
193 appendCell._particleSoABuffer);
194 }
195
200 void resizeBuffers();
201
206 CellOffsetsType _cellOffsets;
207
211 CellFunctorType _cellFunctor;
212
216 Functor &_functor;
217
221 std::vector<std::vector<ParticleCell>> _combinationSlices;
222
226 std::vector<unsigned int> _currentSlices;
227
231 const unsigned int _cacheOffset;
232};
233
234template <class ParticleCell, class Functor, bool combineSoA>
236 if constexpr (utils::isPairwiseFunctor<Functor>()) {
237 computePairwiseOffsets();
239 computeTriwiseOffsets();
240 } else {
241 utils::ExceptionHandler::exception("LCC01Traversal::computeOffsets(): Functor is not valid.");
242 }
243}
244
245template <class ParticleCell, class Functor, bool combineSoA>
247 _cellOffsets.resize(2 * this->_overlap[0] + 1);
248
249 const auto interactionLengthSquare{this->_interactionLength * this->_interactionLength};
250
251 for (long x = -this->_overlap[0]; x <= 0l; ++x) {
252 for (long y = -this->_overlap[1]; y <= static_cast<long>(this->_overlap[1]); ++y) {
253 for (long z = -this->_overlap[2]; z <= static_cast<long>(this->_overlap[2]); ++z) {
254 const std::array<double, 3> pos = {
255 std::max(0l, (std::abs(x) - 1l)) * this->_cellLength[0],
256 std::max(0l, (std::abs(y) - 1l)) * this->_cellLength[1],
257 std::max(0l, (std::abs(z) - 1l)) * this->_cellLength[2],
258 };
259 const double distSquare = utils::ArrayMath::dot(pos, pos);
260 if (distSquare <= interactionLengthSquare) {
261 const long currentOffset = utils::ThreeDimensionalMapping::threeToOneD(
262 x, y, z, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
263 const bool containCurrentOffset =
264 std::any_of(_cellOffsets[x + this->_overlap[0]].cbegin(), _cellOffsets[x + this->_overlap[0]].cend(),
265 [currentOffset](const auto &e) { return e.first == currentOffset; });
266 if (containCurrentOffset) {
267 continue;
268 }
269 for (long ix = x; ix <= std::abs(x); ++ix) {
271 ix, y, z, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
272 const size_t index = ix + this->_overlap[0];
273
274 // Calculate the sorting direction from the base cell (x, y, z) and the other cell by use of the offset (ix,
275 // y, z).
276 std::array<double, 3> sortingDir = {static_cast<double>(ix) * this->_cellLength[0],
277 static_cast<double>(y) * this->_cellLength[1],
278 static_cast<double>(z) * this->_cellLength[2]};
279
280 // the offset to the current cell itself is zero.
281 if (ix == 0 and y == 0 and z == 0) {
282 sortingDir = {1., 1., 1.};
283 }
284 sortingDir = utils::ArrayMath::normalize(sortingDir);
285
286 if (y == 0l and z == 0l) {
287 // make sure center of slice is always at the beginning
288 _cellOffsets[index].insert(_cellOffsets[index].cbegin(), std::make_pair(offset, sortingDir));
289 } else {
290 _cellOffsets[index].emplace_back(offset, sortingDir);
291 }
292 }
293 }
294 }
295 }
296 }
297}
298
299template <class ParticleCell, class Functor, bool combineSoA>
300inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::computeTriwiseOffsets() {
301 using namespace utils::ArrayMath::literals;
302 // Reserve approximately. Overestimates more for larger overlap.
303 const int cubeSize = this->_overlap[0] * this->_overlap[1] * this->_overlap[2];
304 _cellOffsets.reserve(cubeSize * cubeSize / 4);
305
306 // Helper function to get minimal distance between two cells
307 auto cellDistance = [&](long x1, long y1, long z1, long x2, long y2, long z2) {
308 return std::array<double, 3>{std::max(0l, (std::abs(x1 - x2) - 1l)) * this->_cellLength[0],
309 std::max(0l, (std::abs(y1 - y2) - 1l)) * this->_cellLength[1],
310 std::max(0l, (std::abs(z1 - z2) - 1l)) * this->_cellLength[2]};
311 };
312
313 const auto interactionLengthSquare{this->_interactionLength * this->_interactionLength};
314 _cellOffsets.emplace_back(0, 0, std::array<double, 3>{1., 1., 1.});
315
316 // offsets for the first cell
317 for (long x1 = -this->_overlap[0]; x1 <= static_cast<long>(this->_overlap[0]); ++x1) {
318 for (long y1 = -this->_overlap[1]; y1 <= static_cast<long>(this->_overlap[1]); ++y1) {
319 for (long z1 = -this->_overlap[2]; z1 <= static_cast<long>(this->_overlap[2]); ++z1) {
320 // check distance between base cell and cell 1
321 const auto dist01 = cellDistance(0l, 0l, 0l, x1, y1, z1);
322
323 const double distSquare = utils::ArrayMath::dot(dist01, dist01);
324 if (distSquare > interactionLengthSquare) continue;
325
326 // offsets for cell 2
327 for (long x2 = -this->_overlap[0]; x2 <= static_cast<long>(this->_overlap[0]); ++x2) {
328 for (long y2 = -this->_overlap[1]; y2 <= static_cast<long>(this->_overlap[1]); ++y2) {
329 for (long z2 = -this->_overlap[2]; z2 <= static_cast<long>(this->_overlap[2]); ++z2) {
330 // check distance between cell 1 and cell 2
331 const auto dist12 = cellDistance(x1, y1, z1, x2, y2, z2);
332
333 const double dist12Squared = utils::ArrayMath::dot(dist12, dist12);
334 if (dist12Squared > interactionLengthSquare) continue;
335
336 // check distance between base cell and cell 2
337 const auto dist02 = cellDistance(0l, 0l, 0l, x2, y2, z2);
338
339 const double dist02Squared = utils::ArrayMath::dot(dist02, dist02);
340 if (dist02Squared > interactionLengthSquare) continue;
341
343 x1, y1, z1, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
344
346 x2, y2, z2, utils::ArrayUtils::static_cast_copy_array<long>(this->_cellsPerDimension));
347
348 // Only add unique combinations. E.g.: (5, 8) == (8, 5)
349 if (offset2 <= offset1) continue;
350
351 // sorting direction from base cell to the first different cell
352 std::array<double, 3> sortDirection{};
353 if (offset1 == 0) {
354 sortDirection = {x2 * this->_cellLength[0], y2 * this->_cellLength[1], z2 * this->_cellLength[2]};
355 } else {
356 sortDirection = {x1 * this->_cellLength[0], y1 * this->_cellLength[1], z1 * this->_cellLength[2]};
357 }
358 _cellOffsets.emplace_back(offset1, offset2, utils::ArrayMath::normalize(sortDirection));
359 }
360 }
361 }
362 }
363 }
364 }
365}
366
367template <class ParticleCell, class Functor, bool combineSoA>
368inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCell(std::vector<ParticleCell> &cells,
369 unsigned long x, unsigned long y,
370 unsigned long z) {
371 if constexpr (utils::isPairwiseFunctor<Functor>()) {
372 processBaseCellPairwise(cells, x, y, z);
373 } else if constexpr (utils::isTriwiseFunctor<Functor>()) {
374 processBaseCellTriwise(cells, x, y, z);
375 } else {
377 "LCC01Traversal::processBaseCell(): Functor {} is not of type PairwiseFunctor or TriwiseFunctor.",
378 _functor.getName());
379 }
380}
381
382template <class ParticleCell, class Functor, bool combineSoA>
383inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCellPairwise(std::vector<ParticleCell> &cells,
384 unsigned long x, unsigned long y,
385 unsigned long z) {
386 unsigned long baseIndex = utils::ThreeDimensionalMapping::threeToOneD(x, y, z, this->_cellsPerDimension);
387 ParticleCell &baseCell = cells[baseIndex];
388 const size_t cOffSize = _cellOffsets.size();
389
390 if constexpr (combineSoA) {
391 // Iteration along x
392
393 const auto threadID = static_cast<size_t>(autopas_get_thread_num());
394 auto &currentSlice = _currentSlices[threadID * _cacheOffset];
395 auto &combinationSlice = _combinationSlices[threadID];
396
397 // First cell needs to initialize whole buffer
398 if (x == this->_overlap[0]) {
399 currentSlice = 0;
400 for (unsigned int offsetSlice = 0; offsetSlice < cOffSize; offsetSlice++) {
401 combinationSlice[offsetSlice]._particleSoABuffer.clear();
402 for (const auto &offset : _cellOffsets[offsetSlice]) {
403 const unsigned long otherIndex = baseIndex + offset.first;
404 ParticleCell &otherCell = cells[otherIndex];
405 appendNeeded(combinationSlice[offsetSlice], otherCell,
406 std::make_index_sequence<Functor::getNeededAttr(std::false_type()).size()>{});
407 }
408 }
409 } else {
410 // reduce size
411 size_t i = 0;
412 const size_t midSlice = (currentSlice + this->_overlap[0] + 1) % cOffSize;
413 for (size_t slice = (currentSlice + 1) % cOffSize; slice != midSlice; ++slice %= cOffSize, ++i) {
414 size_t newSize = 0;
415 for (const auto &offset : _cellOffsets[i]) {
416 const unsigned long otherIndex = baseIndex + offset.first;
417 ParticleCell &otherCell = cells[otherIndex];
418 newSize += otherCell.size();
419 }
420 combinationSlice[slice]._particleSoABuffer.resizeArrays(newSize);
421 }
422 // append buffers
423 for (size_t slice = midSlice; slice != currentSlice; ++slice %= cOffSize, ++i) {
424 for (auto offsetIndex = _cellOffsets[(i + 1) % cOffSize].size(); offsetIndex < _cellOffsets[i].size();
425 ++offsetIndex) {
426 const unsigned long otherIndex = baseIndex + _cellOffsets[i][offsetIndex].first;
427 ParticleCell &otherCell = cells[otherIndex];
428 appendNeeded(combinationSlice[slice], otherCell,
429 std::make_index_sequence<Functor::getNeededAttr(std::false_type()).size()>{});
430 }
431 }
432
433 combinationSlice[currentSlice]._particleSoABuffer.clear();
434
435 for (const auto &offset : _cellOffsets.back()) {
436 const unsigned long otherIndex = baseIndex + offset.first;
437 ParticleCell &otherCell = cells[otherIndex];
438 appendNeeded(combinationSlice[currentSlice], otherCell,
439 std::make_index_sequence<Functor::getNeededAttr(std::false_type()).size()>{});
440 }
441
442 ++currentSlice %= cOffSize;
443 }
444
445 // calculate all interactions
446 for (unsigned int slice = 0; slice < cOffSize; slice++) {
447 if (slice == (currentSlice + this->_overlap[0]) % cOffSize) {
448 // slice contains base cell -> skip particles of base cell. This is not supported by CellFunctor, so call
449 // pairwise functor directly.
450 auto startIndex = baseCell.size();
451 auto endIndex = combinationSlice[slice]._particleSoABuffer.size();
452 _functor.SoAFunctorPair(baseCell._particleSoABuffer,
453 {&(combinationSlice[slice]._particleSoABuffer), startIndex, endIndex}, false);
454 // compute base cell
455 this->_cellFunctor.processCell(baseCell);
456 } else {
457 this->_cellFunctor.processCellPair(baseCell, combinationSlice[slice]);
458 }
459 }
460 } else {
461 for (const auto &slice : _cellOffsets) {
462 for (auto const &[offset, r] : slice) {
463 const unsigned long otherIndex = baseIndex + offset;
464 ParticleCell &otherCell = cells[otherIndex];
465
466 if (baseIndex == otherIndex) {
467 this->_cellFunctor.processCell(baseCell);
468 } else {
469 this->_cellFunctor.processCellPair(baseCell, otherCell, r);
470 }
471 }
472 }
473 }
474}
475
476template <class ParticleCell, class Functor, bool combineSoA>
477inline void LCC01Traversal<ParticleCell, Functor, combineSoA>::processBaseCellTriwise(std::vector<ParticleCell> &cells,
478 unsigned long x, unsigned long y,
479 unsigned long z) {
480 unsigned long baseIndex = utils::ThreeDimensionalMapping::threeToOneD(x, y, z, this->_cellsPerDimension);
481 ParticleCell &baseCell = cells[baseIndex];
482
483 for (auto const &[offset1, offset2, r] : _cellOffsets) {
484 const unsigned long otherIndex1 = baseIndex + offset1;
485 const unsigned long otherIndex2 = baseIndex + offset2;
486 ParticleCell &otherCell1 = cells[otherIndex1];
487 ParticleCell &otherCell2 = cells[otherIndex2];
488
489 if (baseIndex == otherIndex1 and baseIndex == otherIndex2) {
490 this->_cellFunctor.processCell(baseCell);
491 } else if (baseIndex == otherIndex1 and baseIndex != otherIndex2) {
492 this->_cellFunctor.processCellPair(baseCell, otherCell2);
493 } else if (baseIndex != otherIndex1 and baseIndex == otherIndex2) {
494 this->_cellFunctor.processCellPair(baseCell, otherCell1);
495 } else if (baseIndex != otherIndex1 and otherIndex1 == otherIndex2) {
496 this->_cellFunctor.processCellPair(baseCell, otherCell1);
497 } else {
498 this->_cellFunctor.processCellTriple(baseCell, otherCell1, otherCell2, r);
499 }
500 }
501}
502
503template <class ParticleCell, class PairwiseFunctor, bool combineSoA>
504inline void LCC01Traversal<ParticleCell, PairwiseFunctor, combineSoA>::resizeBuffers() {
505 const auto numThreads = static_cast<size_t>(autopas_get_max_threads());
506 if (_combinationSlices.size() != numThreads) {
507 _combinationSlices.resize(numThreads);
508 const auto cellOffsetsSize = _cellOffsets.size();
509 std::for_each(_combinationSlices.begin(), _combinationSlices.end(),
510 [cellOffsetsSize](auto &e) { e.resize(cellOffsetsSize); });
511 _currentSlices.resize(numThreads * _cacheOffset);
512 }
513}
514
515template <class ParticleCell, class Functor, bool combineSoA>
517 auto &cells = *(this->_cells);
518 if (not this->isApplicableToDomain()) {
519 if constexpr (combineSoA) {
521 "The C01 traversal with combined SoA buffers cannot work with data layout AoS and enabled newton3 (unless "
522 "only one thread is used)!");
523 } else {
525 "The C01 traversal cannot work with enabled newton3 (unless only one thread is used)!");
526 }
527 }
528 if constexpr (combineSoA) {
529 resizeBuffers();
530 }
531 this->c01Traversal([&](unsigned long x, unsigned long y, unsigned long z) { this->processBaseCell(cells, x, y, z); });
532}
533
534} // namespace autopas
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 traverseParticles() override
Traverse the particles by pairs, triplets etc.
Definition: LCC01Traversal.h:516
void setAoSSortingThreshold(size_t aosSortingThreshold) override
Set the aos-sorting-threshold for traversals that use the CellFunctor If the sum of the number of par...
Definition: LCC01Traversal.h:127
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:235
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
void setSoASortingThreshold(size_t soaSortingThreshold) override
Set the SoA sorting-threshold for traversals that use the CellFunctor.
Definition: LCC01Traversal.h:133
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:24
A cell functor.
Definition: CellFunctor.h:29
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