-
Notifications
You must be signed in to change notification settings - Fork 49
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #1714 from CEED/jeremy/at-points-basis-flops
Fix FLOPs estimates AtPoints
- Loading branch information
Showing
5 changed files
with
246 additions
and
33 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,125 @@ | ||
| /// @file | ||
| /// Test FLOP estimation for mass matrix operator at points | ||
| /// \test Test FLOP estimation for mass matrix operator at points | ||
| #include "t595-operator.h" | ||
|
|
||
| #include <ceed.h> | ||
| #include <math.h> | ||
| #include <stdio.h> | ||
| #include <stdlib.h> | ||
|
|
||
| int main(int argc, char **argv) { | ||
| Ceed ceed; | ||
| CeedInt num_elem_1d = 3, num_elem = num_elem_1d * num_elem_1d, dim = 2, p = 3, q = 5; | ||
| CeedInt num_nodes = (num_elem_1d * (p - 1) + 1) * (num_elem_1d * (p - 1) + 1), num_points_per_elem = 4, num_points = num_elem * num_points_per_elem; | ||
| CeedSize flop_estimate = 0; | ||
| CeedVector x_points, q_data; | ||
| CeedElemRestriction elem_restriction_x_points, elem_restriction_q_data, elem_restriction_u; | ||
| CeedBasis basis_x, basis_u; | ||
| CeedQFunction qf_mass; | ||
| CeedOperator op_mass; | ||
| bool is_at_points; | ||
|
|
||
| CeedInit(argv[1], &ceed); | ||
|
|
||
| // Point reference coordinates | ||
| CeedVectorCreate(ceed, dim * num_points, &x_points); | ||
| { | ||
| CeedScalar x_array[dim * num_points]; | ||
|
|
||
| for (CeedInt e = 0; e < num_elem; e++) { | ||
| for (CeedInt d = 0; d < dim; d++) { | ||
| x_array[num_points_per_elem * (e * dim + d) + 0] = 0.25; | ||
| x_array[num_points_per_elem * (e * dim + d) + 1] = d == 0 ? -0.25 : 0.25; | ||
| x_array[num_points_per_elem * (e * dim + d) + 2] = d == 0 ? 0.25 : -0.25; | ||
| x_array[num_points_per_elem * (e * dim + d) + 3] = 0.25; | ||
| } | ||
| } | ||
| CeedVectorSetArray(x_points, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); | ||
| } | ||
| { | ||
| CeedInt ind_x[num_elem + 1 + num_points]; | ||
|
|
||
| for (CeedInt i = 0; i <= num_elem; i++) ind_x[i] = num_elem + 1 + i * num_points_per_elem; | ||
| for (CeedInt i = 0; i < num_points; i++) ind_x[num_elem + 1 + i] = i; | ||
| CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, dim, num_points * dim, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, | ||
| &elem_restriction_x_points); | ||
| CeedElemRestrictionCreateAtPoints(ceed, num_elem, num_points, 1, num_points, CEED_MEM_HOST, CEED_COPY_VALUES, ind_x, &elem_restriction_q_data); | ||
| } | ||
|
|
||
| // Q data | ||
| CeedVectorCreate(ceed, num_points, &q_data); | ||
|
|
||
| CeedBasisCreateTensorH1Lagrange(ceed, dim, dim, 2, q, CEED_GAUSS, &basis_x); | ||
|
|
||
| // Cell solution | ||
| { | ||
| CeedInt ind_u[num_elem * p * p]; | ||
|
|
||
| for (CeedInt e = 0; e < num_elem; e++) { | ||
| CeedInt elem_xy[2] = {1, 1}, n_d[2] = {0, 0}; | ||
|
|
||
| for (CeedInt d = 0; d < dim; d++) n_d[d] = num_elem_1d * (p - 1) + 1; | ||
| { | ||
| CeedInt r_e = e; | ||
|
|
||
| for (CeedInt d = 0; d < dim; d++) { | ||
| elem_xy[d] = r_e % num_elem_1d; | ||
| r_e /= num_elem_1d; | ||
| } | ||
| } | ||
| CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; | ||
|
|
||
| for (CeedInt n = 0; n < num_nodes_in_elem; n++) { | ||
| CeedInt g_node = 0, g_node_stride = 1, r_node = n; | ||
|
|
||
| for (CeedInt d = 0; d < dim; d++) { | ||
| g_node += (elem_xy[d] * (p - 1) + r_node % p) * g_node_stride; | ||
| g_node_stride *= n_d[d]; | ||
| r_node /= p; | ||
| } | ||
| elem_nodes[n] = g_node; | ||
| } | ||
| } | ||
| CeedElemRestrictionCreate(ceed, num_elem, p * p, 1, 1, num_nodes, CEED_MEM_HOST, CEED_COPY_VALUES, ind_u, &elem_restriction_u); | ||
| } | ||
| CeedBasisCreateTensorH1Lagrange(ceed, dim, 1, p, q, CEED_GAUSS, &basis_u); | ||
|
|
||
| // Mass operator | ||
| CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_mass); | ||
| CeedQFunctionAddInput(qf_mass, "u", 1, CEED_EVAL_INTERP); | ||
| CeedQFunctionAddInput(qf_mass, "rho", 1, CEED_EVAL_NONE); | ||
| CeedQFunctionAddOutput(qf_mass, "v", 1, CEED_EVAL_INTERP); | ||
|
|
||
| CeedOperatorCreateAtPoints(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass); | ||
| CeedOperatorSetField(op_mass, "u", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); | ||
| CeedOperatorSetField(op_mass, "rho", elem_restriction_q_data, CEED_BASIS_NONE, q_data); | ||
| CeedOperatorSetField(op_mass, "v", elem_restriction_u, basis_u, CEED_VECTOR_ACTIVE); | ||
| CeedOperatorAtPointsSetPoints(op_mass, elem_restriction_x_points, x_points); | ||
|
|
||
| CeedOperatorIsAtPoints(op_mass, &is_at_points); | ||
| if (!is_at_points) printf("Error: Operator should be at points\n"); | ||
|
|
||
| // Estimate FLOPs | ||
| CeedQFunctionSetUserFlopsEstimate(qf_mass, 1); | ||
| CeedOperatorGetFlopsEstimate(op_mass, &flop_estimate); | ||
|
|
||
| // Check output | ||
| if (flop_estimate != 16317) { | ||
| // LCOV_EXCL_START | ||
| printf("Incorrect FLOP estimate computed, %ld != 16317\n", flop_estimate); | ||
| // LCOV_EXCL_STOP | ||
| } | ||
|
|
||
| CeedVectorDestroy(&x_points); | ||
| CeedVectorDestroy(&q_data); | ||
| CeedElemRestrictionDestroy(&elem_restriction_x_points); | ||
| CeedElemRestrictionDestroy(&elem_restriction_q_data); | ||
| CeedElemRestrictionDestroy(&elem_restriction_u); | ||
| CeedBasisDestroy(&basis_x); | ||
| CeedBasisDestroy(&basis_u); | ||
| CeedQFunctionDestroy(&qf_mass); | ||
| CeedOperatorDestroy(&op_mass); | ||
| CeedDestroy(&ceed); | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,17 @@ | ||
| // Copyright (c) 2017-2024, Lawrence Livermore National Security, LLC and other CEED contributors. | ||
| // All Rights Reserved. See the top-level LICENSE and NOTICE files for details. | ||
| // | ||
| // SPDX-License-Identifier: BSD-2-Clause | ||
| // | ||
| // This file is part of CEED: http://github.com/ceed | ||
|
|
||
| #include <ceed/types.h> | ||
|
|
||
| CEED_QFUNCTION(mass)(void *ctx, const CeedInt Q, const CeedScalar *const *in, CeedScalar *const *out) { | ||
| const CeedScalar *u = in[0], *rho = in[1]; | ||
| CeedScalar *v = out[0]; | ||
|
|
||
| // Quadrature point loop | ||
| CeedPragmaSIMD for (CeedInt i = 0; i < Q; i++) { v[i] = rho[i] * u[i]; } | ||
| return 0; | ||
| } |