Lines Matching refs:CeedInt

47 int        GetCartesianMeshSize(CeedInt dim, CeedInt degree, CeedInt prob_size, CeedInt num_xyz[dim…
48 …artesianRestriction(Ceed ceed, CeedInt dim, CeedInt num_xyz[dim], CeedInt degree, CeedInt num_comp…
50 int SetCartesianMeshCoords(CeedInt dim, CeedInt num_xyz[dim], CeedInt mesh_degree, CeedVecto…
51 CeedScalar TransformMeshCoords(CeedInt dim, CeedInt mesh_size, CeedVector mesh_coords);
56 CeedInt dim = 3; // dimension of the mesh in main()
57 CeedInt num_comp_x = 3; // number of x components in main()
58 CeedInt mesh_degree = 4; // polynomial degree for the mesh in main()
59 CeedInt sol_degree = 4; // polynomial degree for the solution in main()
60 CeedInt num_qpts = sol_degree + 2; // number of 1D quadrature points in main()
61 CeedInt prob_size = -1; // approximate problem size in main()
62 CeedInt help = 0, test = 0, benchmark = 0; in main()
127 CeedInt num_xyz[dim]; in main()
140 CeedInt mesh_size, sol_size; in main()
189 CeedInt elem_qpts = CeedIntPow(num_qpts, dim); in main()
190 CeedInt num_elem = 1; in main()
192 for (CeedInt d = 0; d < dim; d++) num_elem *= num_xyz[d]; in main()
235 for (CeedInt i = 0; i < benchmark; i++) { in main()
248 for (CeedInt i = 0; i < sol_size; i++) volume += v_array[i]; in main()
283 int GetCartesianMeshSize(CeedInt dim, CeedInt degree, CeedInt prob_size, CeedInt num_xyz[dim]) { in GetCartesianMeshSize()
286 CeedInt num_elem = prob_size / CeedIntPow(degree, dim); in GetCartesianMeshSize()
287 CeedInt s = 0; // find s: num_elem/2 < 2^s <= num_elem in GetCartesianMeshSize()
293 CeedInt r = s % dim; in GetCartesianMeshSize()
295 for (CeedInt d = 0; d < dim; d++) { in GetCartesianMeshSize()
296 CeedInt sd = s / dim; in GetCartesianMeshSize()
307 …artesianRestriction(Ceed ceed, CeedInt dim, CeedInt num_xyz[dim], CeedInt degree, CeedInt num_comp… in BuildCartesianRestriction()
309 CeedInt p = degree + 1; in BuildCartesianRestriction()
310 CeedInt num_nodes = CeedIntPow(p, dim); // number of scalar nodes per element in BuildCartesianRestriction()
311 CeedInt elem_qpts = CeedIntPow(num_qpts, dim); // number of qpts per element in BuildCartesianRestriction()
312 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction()
314 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
323 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction()
325 for (CeedInt e = 0; e < num_elem; e++) { in BuildCartesianRestriction()
326 CeedInt e_xyz[3] = {1, 1, 1}, re = e; in BuildCartesianRestriction()
328 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
332 CeedInt *local_elem_nodes = elem_nodes + e * num_nodes; in BuildCartesianRestriction()
334 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction()
335 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
337 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
356 int SetCartesianMeshCoords(CeedInt dim, CeedInt num_xyz[dim], CeedInt mesh_degree, CeedVector mesh_… in SetCartesianMeshCoords()
357 CeedInt p = mesh_degree + 1; in SetCartesianMeshCoords()
358 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords()
360 for (CeedInt d = 0; d < dim; d++) { in SetCartesianMeshCoords()
371 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
372 for (CeedInt gs_nodes = 0; gs_nodes < scalar_size; gs_nodes++) { in SetCartesianMeshCoords()
373 CeedInt r_nodes = gs_nodes; in SetCartesianMeshCoords()
375 for (CeedInt d = 0; d < dim; d++) { in SetCartesianMeshCoords()
376 CeedInt d_1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
391 CeedScalar TransformMeshCoords(CeedInt dim, CeedInt mesh_size, CeedVector mesh_coords) { in TransformMeshCoords()
397 for (CeedInt i = 0; i < mesh_size; i++) { in TransformMeshCoords()
403 CeedInt num_nodes = mesh_size / dim; in TransformMeshCoords()
404 for (CeedInt i = 0; i < num_nodes; i++) { in TransformMeshCoords()