|
| 1 | +/*! |
| 2 | + * @file ModelMetadata_test.cpp |
| 3 | + * |
| 4 | + * @date 18 Nov 2024 |
| 5 | + * @author Tom Meltzer <tdm39@cam.ac.uk> |
| 6 | + */ |
| 7 | + |
| 8 | +#include <doctest/extensions/doctest_mpi.h> |
| 9 | +#include <iostream> |
| 10 | + |
| 11 | +#include "ModelMetadata.hpp" |
| 12 | + |
| 13 | +const std::string testFilesDir = TEST_FILES_DIR; |
| 14 | +const std::string filename = testFilesDir + "/paraGrid_test.nc"; |
| 15 | +const std::string diagFile = "paraGrid_diag.nc"; |
| 16 | +const std::string dateString = "2000-01-01T00:00:00Z"; |
| 17 | +const std::string partitionFilenameCB = testFilesDir + "/partition_metadata_3_cb.nc"; |
| 18 | +const std::string partitionFilenamePB = testFilesDir + "/partition_metadata_3_pb.nc"; |
| 19 | + |
| 20 | +namespace Nextsim { |
| 21 | + |
| 22 | +TEST_SUITE_BEGIN("ModelMetadata"); |
| 23 | +MPI_TEST_CASE("Test getPartitionMetadata closed boundary", 3) |
| 24 | +{ |
| 25 | + ModelMetadata metadata(partitionFilenameCB, test_comm); |
| 26 | + REQUIRE(metadata.mpiComm == test_comm); |
| 27 | + // this metadata is specific to the non-periodic boundary conditions |
| 28 | + if (test_rank == 0) { |
| 29 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT].size() == 0); |
| 30 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT] == std::vector<int> { 2 }); |
| 31 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::RIGHT] == std::vector<int> { 4 }); |
| 32 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::RIGHT] == std::vector<int> { 0 }); |
| 33 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM].size() == 0); |
| 34 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP] == std::vector<int> { 1 }); |
| 35 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::TOP] == std::vector<int> { 7 }); |
| 36 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::TOP] == std::vector<int> { 0 }); |
| 37 | + } else if (test_rank == 1) { |
| 38 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT].size() == 0); |
| 39 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT] == std::vector<int> { 2 }); |
| 40 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::RIGHT] == std::vector<int> { 5 }); |
| 41 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::RIGHT] == std::vector<int> { 12 }); |
| 42 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM] == std::vector<int> { 0 }); |
| 43 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::BOTTOM] == std::vector<int> { 7 }); |
| 44 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::BOTTOM] == std::vector<int> { 21 }); |
| 45 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP].size() == 0); |
| 46 | + } else if (test_rank == 2) { |
| 47 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT] == std::vector<int> { 0, 1 }); |
| 48 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::LEFT] == std::vector<int> { 4, 5 }); |
| 49 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::LEFT] == std::vector<int> { 6, 6 }); |
| 50 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT].size() == 0); |
| 51 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM].size() == 0); |
| 52 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP].size() == 0); |
| 53 | + } else { |
| 54 | + std::cerr << "only valid for 3 ranks" << std::endl; |
| 55 | + exit(1); |
| 56 | + } |
| 57 | + |
| 58 | + // This metadata is specific to the periodic boundary conditions. |
| 59 | + // They are all zero because the input metadata file `partitionFilenameCB` does not use periodic |
| 60 | + // boundary conditions. |
| 61 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::LEFT].size() == 0); |
| 62 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::RIGHT].size() == 0); |
| 63 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::BOTTOM].size() == 0); |
| 64 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::TOP].size() == 0); |
| 65 | +} |
| 66 | + |
| 67 | +MPI_TEST_CASE("Test getPartitionMetadata periodic boundary", 3) |
| 68 | +{ |
| 69 | + ModelMetadata metadata(partitionFilenamePB, test_comm); |
| 70 | + REQUIRE(metadata.mpiComm == test_comm); |
| 71 | + // this metadata should be identical to the Closed Boundary version so we check it again |
| 72 | + if (test_rank == 0) { |
| 73 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT].size() == 0); |
| 74 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT] == std::vector<int> { 2 }); |
| 75 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::RIGHT] == std::vector<int> { 4 }); |
| 76 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::RIGHT] == std::vector<int> { 0 }); |
| 77 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM].size() == 0); |
| 78 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP] == std::vector<int> { 1 }); |
| 79 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::TOP] == std::vector<int> { 7 }); |
| 80 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::TOP] == std::vector<int> { 0 }); |
| 81 | + } else if (test_rank == 1) { |
| 82 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT].size() == 0); |
| 83 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT] == std::vector<int> { 2 }); |
| 84 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::RIGHT] == std::vector<int> { 5 }); |
| 85 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::RIGHT] == std::vector<int> { 12 }); |
| 86 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM] == std::vector<int> { 0 }); |
| 87 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::BOTTOM] == std::vector<int> { 7 }); |
| 88 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::BOTTOM] == std::vector<int> { 21 }); |
| 89 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP].size() == 0); |
| 90 | + } else if (test_rank == 2) { |
| 91 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::LEFT] == std::vector<int> { 0, 1 }); |
| 92 | + REQUIRE(metadata.neighbourExtents[ModelMetadata::LEFT] == std::vector<int> { 4, 5 }); |
| 93 | + REQUIRE(metadata.neighbourHaloStarts[ModelMetadata::LEFT] == std::vector<int> { 6, 6 }); |
| 94 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::RIGHT].size() == 0); |
| 95 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::BOTTOM].size() == 0); |
| 96 | + REQUIRE(metadata.neighbourRanks[ModelMetadata::TOP].size() == 0); |
| 97 | + } else { |
| 98 | + std::cerr << "only valid for 3 ranks" << std::endl; |
| 99 | + exit(1); |
| 100 | + } |
| 101 | + |
| 102 | + // this metadata is specific to the periodic boundary conditions |
| 103 | + if (test_rank == 0) { |
| 104 | + // clang-format off |
| 105 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::LEFT] == std::vector<int> { 2 }); |
| 106 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::LEFT] == std::vector<int> { 4 }); |
| 107 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::LEFT] == std::vector<int> { 2 }); |
| 108 | + |
| 109 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::RIGHT].size() == 0); |
| 110 | + |
| 111 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 1 }); |
| 112 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 7 }); |
| 113 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 28 }); |
| 114 | + |
| 115 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::TOP].size() == 0); |
| 116 | + } else if (test_rank == 1) { |
| 117 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::LEFT] == std::vector<int> { 2 }); |
| 118 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::LEFT] == std::vector<int> { 5 }); |
| 119 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::LEFT] == std::vector<int> { 14 }); |
| 120 | + |
| 121 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::RIGHT].size() == 0); |
| 122 | + |
| 123 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::BOTTOM].size() == 0); |
| 124 | + |
| 125 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::TOP] == std::vector<int> { 0 }); |
| 126 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::TOP] == std::vector<int> { 7 }); |
| 127 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::TOP] == std::vector<int> { 0 }); |
| 128 | + } else if (test_rank == 2) { |
| 129 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::LEFT].size() == 0); |
| 130 | + |
| 131 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::RIGHT] == std::vector<int> { 0, 1 }); |
| 132 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::RIGHT] == std::vector<int> { 4, 5 }); |
| 133 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::RIGHT] == std::vector<int> { 0, 0 }); |
| 134 | + |
| 135 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 2 }); |
| 136 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 3 }); |
| 137 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::BOTTOM] == std::vector<int> { 24 }); |
| 138 | + |
| 139 | + REQUIRE(metadata.neighbourRanksPeriodic[ModelMetadata::TOP] == std::vector<int> { 2 }); |
| 140 | + REQUIRE(metadata.neighbourExtentsPeriodic[ModelMetadata::TOP] == std::vector<int> { 3 }); |
| 141 | + REQUIRE(metadata.neighbourHaloStartsPeriodic[ModelMetadata::TOP] == std::vector<int> { 0 }); |
| 142 | + // clang-format on |
| 143 | + } else { |
| 144 | + std::cerr << "only valid for 3 ranks" << std::endl; |
| 145 | + exit(1); |
| 146 | + } |
| 147 | +} |
| 148 | + |
| 149 | +} |
0 commit comments