Skip to content

Commit

Permalink
Merge branch 'main' into test-pyra-face-descendant
Browse files Browse the repository at this point in the history
  • Loading branch information
@jmark
jmark authored Mar 20, 2023
2 parents b89d0c1 + e5af0f1 commit 2c86479
Show file tree
Hide file tree
Showing 6 changed files with 704 additions and 782 deletions.
14 changes: 5 additions & 9 deletions test/Makefile.am
View file
Original file line number Diff line number Diff line change
Expand Up @@ -8,22 +8,15 @@ t8code_test_programs = \
test/t8_forest/t8_test_ghost_and_owner \
test/t8_forest/t8_test_forest_commit \
test/t8_forest/t8_test_transform \
test/t8_forest/t8_test_search \
test/t8_forest/t8_test_user_data \
test/t8_geometry/t8_test_geometry \
test/t8_geometry/t8_test_point_inside
test/t8_forest/t8_test_user_data

test_t8_forest_t8_test_find_owner_SOURCES = test/t8_forest/t8_test_find_owner.cxx
test_t8_forest_t8_test_ghost_exchange_SOURCES = test/t8_forest/t8_test_ghost_exchange.cxx
test_t8_forest_t8_test_ghost_and_owner_SOURCES = test/t8_forest/t8_test_ghost_and_owner.cxx
test_t8_forest_t8_test_forest_commit_SOURCES = test/t8_forest/t8_test_forest_commit.cxx
test_t8_forest_t8_test_transform_SOURCES = test/t8_forest/t8_test_transform.cxx
test_t8_forest_t8_test_search_SOURCES = test/t8_forest/t8_test_search.cxx
test_t8_forest_t8_test_user_data_SOURCES = test/t8_forest/t8_test_user_data.cxx

test_t8_geometry_t8_test_point_inside_SOURCES = test/t8_geometry/t8_test_point_inside.cxx
test_t8_geometry_t8_test_geometry_SOURCES = test/t8_geometry/t8_test_geometry.cxx

t8code_googletest_programs = \
test/t8_gtest_main

Expand All @@ -44,18 +37,21 @@ test_t8_gtest_main_SOURCES = test/t8_gtest_main.cxx \
test/t8_cmesh/t8_gtest_hypercube.cxx \
test/t8_cmesh/t8_gtest_cmesh_copy.cxx \
test/t8_schemes/t8_gtest_element_count_leafs.cxx \
test/t8_geometry/t8_gtest_geometry.cxx \
test/t8_schemes/t8_gtest_descendant.cxx \
test/t8_schemes/t8_gtest_find_parent.cxx \
test/t8_cmesh/t8_gtest_cmesh_face_is_boundary.cxx \
test/t8_cmesh/t8_gtest_cmesh_partition.cxx \
test/t8_forest/t8_gtest_element_volume.cxx \
test/t8_cmesh/t8_gtest_multiple_attributes.cxx \
test/t8_schemes/t8_gtest_successor.cxx \
test/t8_forest/t8_gtest_search.cxx \
test/t8_gtest_netcdf_linkage.cxx \
test/t8_forest/t8_gtest_element_general_function.cxx \
test/t8_gtest_vtk_linkage.cxx \
test/t8_data/t8_gtest_shmem.cxx \
test/t8_schemes/t8_gtest_pyra_face_descendant.cxx
test/t8_schemes/t8_gtest_pyra_face_descendant.cxx \
test/t8_geometry/t8_gtest_point_inside.cxx

test_t8_gtest_main_LDADD = $(LDADD) test/libgtest.la
test_t8_gtest_main_LDFLAGS = $(AM_LDFLAGS) -pthread
Expand Down
132 changes: 59 additions & 73 deletions test/t8_forest/t8_test_search.cxx → test/t8_forest/t8_gtest_search.cxx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -20,13 +20,40 @@
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/

#include <gtest/gtest.h>
#include <t8_eclass.h>
#include <t8_cmesh.h>
#include <t8_cmesh/t8_cmesh_examples.h>
#include <t8_forest.h>
#include <t8_forest/t8_forest_iterate.h>
#include <t8_schemes/t8_default/t8_default_cxx.hxx>

/* *INDENT-OFF* */
class forest_search:public testing::TestWithParam <std::tuple<t8_eclass,int>> {
protected:
void SetUp () override {
eclass = std::get<0>(GetParam());
level = std::get<1>(GetParam());

default_scheme = t8_scheme_new_default_cxx();
/* Construct a cube coarse mesh */
cmesh = t8_cmesh_new_hypercube (eclass, sc_MPI_COMM_WORLD, 0, 0, 0);
/* Build a uniform forest */
forest = t8_forest_new_uniform (cmesh, default_scheme, level, 0, sc_MPI_COMM_WORLD);

}
void TearDown () override {

}
t8_eclass_t eclass;
int level;
t8_cmesh_t cmesh;
t8_forest_t forest;
t8_scheme_cxx_t *default_scheme;

};
/* *INDENT-ON* */

/* A search function that matches all elements.
* This function assumes that the forest user pointer is an sc_array
* with one int for each local leaf.
Expand All @@ -41,8 +68,9 @@ t8_test_search_all_fn (t8_forest_t forest,
t8_locidx_t tree_leaf_index, void *query,
size_t query_index)
{
SC_CHECK_ABORT (query == NULL,
"Search callback must not be called with query argument.");
EXPECT_TRUE (query ==
NULL) <<
"Search callback must not be called with query argument.";

sc_array_t *matched_leafs =
(sc_array_t *) t8_forest_get_user_data (forest);
Expand All @@ -63,9 +91,10 @@ t8_test_search_all_fn (t8_forest_t forest,
test_element =
t8_forest_get_element (forest, tree_offset + tree_leaf_index,
&test_ltreeid);
SC_CHECK_ABORT (ts->t8_element_compare (element, test_element) == 0,
"Element and index passed to search callback do not match.");
SC_CHECK_ABORT (ltreeid == test_ltreeid, "Tree missmatch in search.");
EXPECT_FALSE (ts->t8_element_compare (element,
test_element)) <<
"Element and index passed to search callback do not match.";
EXPECT_EQ (ltreeid, test_ltreeid) << "Tree missmatch in search.";
}
return 1;
}
Expand All @@ -80,120 +109,77 @@ t8_test_search_query_all_fn (t8_forest_t forest,
size_t query_index)
{
/* The query callback is allways called with a query */
SC_CHECK_ABORT (query != NULL,
"query callback must be called with query argument.");
EXPECT_TRUE (query !=
NULL) << "query callback must be called with query argument.";
/* The query is an int with value 42 (see below) */
SC_CHECK_ABORT (*(int *) query == 42,
"Wrong query argument passed to query callback.");
EXPECT_EQ (*(int *) query,
42) << "Wrong query argument passed to query callback.";
/* The query index gives the position of the query in the queries array
* of the calling search forest_search. Since there is only one query in the
* array in this test, the index must always be 0. */
SC_CHECK_ABORT (query_index == 0,
"Wrong query index passed to query callback.");
EXPECT_EQ ((int) query_index,
0) << "Wrong query index passed to query callback.";
if (is_leaf) {
/* Test whether tree_leaf_index is actually the index of the element */
t8_locidx_t tree_offset;
t8_locidx_t test_ltreeid;
t8_element_t *test_element;
t8_eclass_t tree_class =
t8_forest_get_tree_class (forest, ltreeid);
t8_eclass_scheme_c *ts;
ts = t8_forest_get_eclass_scheme (forest, tree_class);

tree_offset = t8_forest_get_tree_element_offset (forest, ltreeid);
test_element =
t8_locidx_t tree_offset =
t8_forest_get_tree_element_offset (forest, ltreeid);
t8_element_t *test_element =
t8_forest_get_element (forest, tree_offset + tree_leaf_index,
&test_ltreeid);
SC_CHECK_ABORT (ts->t8_element_compare (element, test_element) == 0,
"Element and index passed to search callback do not match.");
SC_CHECK_ABORT (ltreeid == test_ltreeid, "Tree missmatch in search.");
EXPECT_FALSE (ts->t8_element_compare (element,
test_element)) <<
"Element and index passed to search callback do not match.";
EXPECT_EQ (ltreeid, test_ltreeid) << "Tree missmatch in search.";
}

return 1;
}

static void
t8_test_search_one_query_matches_all (sc_MPI_Comm comm, t8_eclass_t eclass,
int level)
TEST_P (forest_search, test_search_one_query_matches_all)
{
t8_cmesh_t cmesh;
t8_forest_t forest;
t8_scheme_cxx_t *default_scheme;
const int query = 42;
t8_locidx_t ielement;
t8_locidx_t num_elements;
sc_array_t queries;
sc_array_t matched_leafs;

default_scheme = t8_scheme_new_default_cxx ();
/* Construct a cube coarse mesh */
cmesh = t8_cmesh_new_hypercube (eclass, comm, 0, 0, 0);
/* Build a uniform forest */
forest = t8_forest_new_uniform (cmesh, default_scheme, level, 0, comm);

/* set up a single query containing our query */
sc_array_init_size (&queries, sizeof (int), 1);
*(int *) sc_array_index (&queries, 0) = query;

num_elements = t8_forest_get_local_num_elements (forest);
t8_locidx_t num_elements =
t8_forest_get_local_num_elements (forest);
/* set up an array in which we flag whether an element was matched in the
* search */
sc_array_init_size (&matched_leafs, sizeof (int), num_elements);
/* write 0 in every entry */
for (ielement = 0; ielement < num_elements; ++ielement) {
for (t8_locidx_t ielement = 0; ielement < num_elements; ++ielement) {
*(int *) t8_sc_array_index_locidx (&matched_leafs, ielement) = 0;
}

/* Set the array as user data so that we can access it in the search callback */
t8_forest_set_user_data (forest, &matched_leafs);
/* Call search. This search matches all elements. After this call we expect
* all entries in the matched_leafs array to be set to 1. */

t8_forest_search (forest, t8_test_search_all_fn,
t8_test_search_query_all_fn, &queries);

/* Check whether matched_leafs entries are all 1 */
for (ielement = 0; ielement < num_elements; ++ielement) {
SC_CHECK_ABORTF (*(int *)
t8_sc_array_index_locidx (&matched_leafs, ielement) == 1,
"Search did not match all leafs. First missmatch at leaf %i.",
ielement);
for (t8_locidx_t ielement = 0; ielement < num_elements; ++ielement) {
ASSERT_TRUE (*(int *) t8_sc_array_index_locidx (&matched_leafs, ielement))
<< "Search did not match all leafs. First missmatch at leaf " <<
ielement;
}

t8_forest_unref (&forest);
sc_array_reset (&matched_leafs);
sc_array_reset (&queries);
}

int
main (int argc, char **argv)
{
int mpiret;
sc_MPI_Comm mpic;
int ieclass;
int ilevel;
const int maxlevel = 6; /* the maximum refinement level to which we test */

mpiret = sc_MPI_Init (&argc, &argv);
SC_CHECK_MPI (mpiret);

mpic = sc_MPI_COMM_WORLD;
sc_init (mpic, 1, 1, NULL, SC_LP_PRODUCTION);
t8_init (SC_LP_DEFAULT);

for (ieclass = T8_ECLASS_VERTEX; ieclass < T8_ECLASS_COUNT; ieclass++) {
for (ilevel = 0; ilevel <= maxlevel; ++ilevel) {
t8_global_productionf
("Testing search that matches all with eclass %s, level %i\n",
t8_eclass_to_string[ieclass], ilevel);
t8_test_search_one_query_matches_all (mpic, (t8_eclass_t) ieclass,
ilevel);
}
}

sc_finalize ();

mpiret = sc_MPI_Finalize ();
SC_CHECK_MPI (mpiret);

return 0;
}
/* *INDENT-OFF* */
INSTANTIATE_TEST_SUITE_P (t8_gtest_search, forest_search,testing::Combine(testing::Range(T8_ECLASS_VERTEX, T8_ECLASS_COUNT), testing::Range(0,6)));
/* *INDENT-ON* */
Loading

0 comments on commit 2c86479

Please sign in to comment.