1 /// @file 2 /// Test creation reuse of the same QFunction for multiple operators 3 /// \test Test creation reuse of the same QFunction for multiple operators 4 #include <ceed.h> 5 #include <math.h> 6 #include <stdio.h> 7 #include <stdlib.h> 8 9 #include "t502-operator.h" 10 11 int main(int argc, char **argv) { 12 Ceed ceed; 13 CeedElemRestriction elem_restriction_x, elem_restriction_u, elem_restriction_q_data_small, elem_restriction_q_data_large; 14 CeedBasis basis_x_small, basis_x_large, basis_u_small, basis_u_large; 15 CeedQFunction qf_setup, qf_mass; 16 CeedOperator op_setup_small, op_mass_small, op_setup_large, op_mass_large; 17 CeedVector q_data_small, q_data_large, x, u, v; 18 CeedInt num_elem = 15, p = 5, q = 8, scale = 3, num_comp = 2; 19 CeedInt num_nodes_x = num_elem + 1, num_nodes_u = num_elem * (p - 1) + 1; 20 CeedInt ind_x[num_elem * 2], ind_u[num_elem * p]; 21 22 CeedInit(argv[1], &ceed); 23 24 CeedVectorCreate(ceed, num_nodes_x, &x); 25 { 26 CeedScalar x_array[num_nodes_x]; 27 28 for (CeedInt i = 0; i < num_nodes_x; i++) x_array[i] = (CeedScalar)i / (num_nodes_x - 1); 29 CeedVectorSetArray(x, CEED_MEM_HOST, CEED_COPY_VALUES, x_array); 30 } 31 CeedVectorCreate(ceed, num_comp * num_nodes_u, &u); 32 CeedVectorCreate(ceed, num_comp * num_nodes_u, &v); 33 CeedVectorCreate(ceed, num_elem * q, &q_data_small); 34 CeedVectorCreate(ceed, num_elem * q * scale, &q_data_large); 35 36 // Restrictions 37 for (CeedInt i = 0; i < num_elem; i++) { 38 ind_x[2 * i + 0] = i; 39 ind_x[2 * i + 1] = i + 1; 40 } 41 CeedElemRestrictionCreate(ceed, num_elem, num_comp, 1, 1, num_nodes_x, CEED_MEM_HOST, CEED_USE_POINTER, ind_x, &elem_restriction_x); 42 43 for (CeedInt i = 0; i < num_elem; i++) { 44 for (CeedInt j = 0; j < p; j++) { 45 ind_u[p * i + j] = num_comp * (i * (p - 1) + j); 46 } 47 } 48 CeedElemRestrictionCreate(ceed, num_elem, p, num_comp, 1, num_comp * num_nodes_u, CEED_MEM_HOST, CEED_USE_POINTER, ind_u, &elem_restriction_u); 49 50 CeedInt strides_q_data_small[3] = {1, q, q}; 51 CeedElemRestrictionCreateStrided(ceed, num_elem, q, 1, q * num_elem, strides_q_data_small, &elem_restriction_q_data_small); 52 53 CeedInt strides_q_data_large[3] = {1, q * scale, q * scale}; 54 CeedElemRestrictionCreateStrided(ceed, num_elem, q * scale, 1, q * num_elem * scale, strides_q_data_large, &elem_restriction_q_data_large); 55 56 // Bases 57 CeedBasisCreateTensorH1Lagrange(ceed, 1, 1, 2, q, CEED_GAUSS, &basis_x_small); 58 CeedBasisCreateTensorH1Lagrange(ceed, 1, num_comp, p, q, CEED_GAUSS, &basis_u_small); 59 CeedBasisCreateTensorH1Lagrange(ceed, 1, 1, 2, q * scale, CEED_GAUSS, &basis_x_large); 60 CeedBasisCreateTensorH1Lagrange(ceed, 1, num_comp, p, q * scale, CEED_GAUSS, &basis_u_large); 61 62 // QFunctions 63 CeedQFunctionCreateInterior(ceed, 1, setup, setup_loc, &qf_setup); 64 CeedQFunctionAddInput(qf_setup, "weight", 1, CEED_EVAL_WEIGHT); 65 CeedQFunctionAddInput(qf_setup, "x", 1, CEED_EVAL_GRAD); 66 CeedQFunctionAddOutput(qf_setup, "rho", 1, CEED_EVAL_NONE); 67 68 CeedQFunctionCreateInterior(ceed, 1, mass, mass_loc, &qf_mass); 69 CeedQFunctionAddInput(qf_mass, "rho", 1, CEED_EVAL_NONE); 70 CeedQFunctionAddInput(qf_mass, "u", num_comp, CEED_EVAL_INTERP); 71 CeedQFunctionAddOutput(qf_mass, "v", num_comp, CEED_EVAL_INTERP); 72 73 // 'Small' Operators 74 CeedOperatorCreate(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup_small); 75 CeedOperatorSetField(op_setup_small, "weight", CEED_ELEMRESTRICTION_NONE, basis_x_small, CEED_VECTOR_NONE); 76 CeedOperatorSetField(op_setup_small, "x", elem_restriction_x, basis_x_small, CEED_VECTOR_ACTIVE); 77 CeedOperatorSetField(op_setup_small, "rho", elem_restriction_q_data_small, CEED_BASIS_NONE, CEED_VECTOR_ACTIVE); 78 79 CeedOperatorCreate(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass_small); 80 CeedOperatorSetField(op_mass_small, "rho", elem_restriction_q_data_small, CEED_BASIS_NONE, q_data_small); 81 CeedOperatorSetField(op_mass_small, "u", elem_restriction_u, basis_u_small, CEED_VECTOR_ACTIVE); 82 CeedOperatorSetField(op_mass_small, "v", elem_restriction_u, basis_u_small, CEED_VECTOR_ACTIVE); 83 84 // 'Large' operators 85 CeedOperatorCreate(ceed, qf_setup, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_setup_large); 86 CeedOperatorSetField(op_setup_large, "weight", CEED_ELEMRESTRICTION_NONE, basis_x_large, CEED_VECTOR_NONE); 87 CeedOperatorSetField(op_setup_large, "x", elem_restriction_x, basis_x_large, CEED_VECTOR_ACTIVE); 88 CeedOperatorSetField(op_setup_large, "rho", elem_restriction_q_data_large, CEED_BASIS_NONE, CEED_VECTOR_ACTIVE); 89 90 CeedOperatorCreate(ceed, qf_mass, CEED_QFUNCTION_NONE, CEED_QFUNCTION_NONE, &op_mass_large); 91 CeedOperatorSetField(op_mass_large, "rho", elem_restriction_q_data_large, CEED_BASIS_NONE, q_data_large); 92 CeedOperatorSetField(op_mass_large, "u", elem_restriction_u, basis_u_large, CEED_VECTOR_ACTIVE); 93 CeedOperatorSetField(op_mass_large, "v", elem_restriction_u, basis_u_large, CEED_VECTOR_ACTIVE); 94 95 // Setup 96 CeedOperatorApply(op_setup_small, x, q_data_small, CEED_REQUEST_IMMEDIATE); 97 CeedOperatorApply(op_setup_large, x, q_data_large, CEED_REQUEST_IMMEDIATE); 98 99 { 100 CeedScalar *u_array; 101 102 CeedVectorGetArrayWrite(u, CEED_MEM_HOST, &u_array); 103 for (int i = 0; i < num_nodes_u; i++) { 104 u_array[num_comp * i] = 1.0; 105 u_array[num_comp * i + 1] = 2.0; 106 } 107 CeedVectorRestoreArray(u, &u_array); 108 } 109 110 // 'Small' operator 111 CeedOperatorApply(op_mass_small, u, v, CEED_REQUEST_IMMEDIATE); 112 113 // Check output 114 { 115 const CeedScalar *v_array; 116 CeedScalar sum_1 = 0., sum_2 = 0.; 117 118 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 119 for (CeedInt i = 0; i < num_nodes_u; i++) { 120 sum_1 += v_array[num_comp * i]; 121 sum_2 += v_array[num_comp * i + 1]; 122 } 123 CeedVectorRestoreArrayRead(v, &v_array); 124 if (fabs(sum_1 - 1.) > 1000. * CEED_EPSILON) printf("Small Problem, Component 1: Computed Area %f != True Area 1.0\n", sum_1); 125 if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Small Problem, Component 2: Computed Area %f != True Area 2.0\n", sum_2); 126 } 127 128 // 'Large' operator 129 CeedOperatorApply(op_mass_large, u, v, CEED_REQUEST_IMMEDIATE); 130 131 // Check output 132 { 133 const CeedScalar *v_array; 134 CeedScalar sum_1 = 0., sum_2 = 0.; 135 136 CeedVectorGetArrayRead(v, CEED_MEM_HOST, &v_array); 137 for (CeedInt i = 0; i < num_nodes_u; i++) { 138 sum_1 += v_array[num_comp * i]; 139 sum_2 += v_array[num_comp * i + 1]; 140 } 141 CeedVectorRestoreArrayRead(v, &v_array); 142 143 if (fabs(sum_1 - 1.) > 1000. * CEED_EPSILON) printf("Large Problem, Component 1: Computed Area %f != True Area 1.0\n", sum_1); 144 if (fabs(sum_2 - 2.) > 1000. * CEED_EPSILON) printf("Large Problem, Component 2: Computed Area %f != True Area 2.0\n", sum_2); 145 } 146 147 CeedVectorDestroy(&x); 148 CeedVectorDestroy(&u); 149 CeedVectorDestroy(&v); 150 CeedVectorDestroy(&q_data_small); 151 CeedVectorDestroy(&q_data_large); 152 CeedElemRestrictionDestroy(&elem_restriction_u); 153 CeedElemRestrictionDestroy(&elem_restriction_x); 154 CeedElemRestrictionDestroy(&elem_restriction_q_data_small); 155 CeedElemRestrictionDestroy(&elem_restriction_q_data_large); 156 CeedBasisDestroy(&basis_u_small); 157 CeedBasisDestroy(&basis_x_small); 158 CeedBasisDestroy(&basis_u_large); 159 CeedBasisDestroy(&basis_x_large); 160 CeedQFunctionDestroy(&qf_setup); 161 CeedQFunctionDestroy(&qf_mass); 162 CeedOperatorDestroy(&op_setup_small); 163 CeedOperatorDestroy(&op_mass_small); 164 CeedOperatorDestroy(&op_setup_large); 165 CeedOperatorDestroy(&op_mass_large); 166 CeedDestroy(&ceed); 167 return 0; 168 } 169