Lines Matching refs:CeedInt
49 int GetCartesianMeshSize(CeedInt dim, CeedInt degree, CeedInt prob_size, CeedInt num_xyz[dim…
50 …artesianRestriction(Ceed ceed, CeedInt dim, CeedInt num_xyz[dim], CeedInt degree, CeedInt num_comp…
52 int SetCartesianMeshCoords(CeedInt dim, CeedInt num_xyz[dim], CeedInt mesh_degree, CeedVecto…
53 CeedScalar TransformMeshCoords(CeedInt dim, CeedInt mesh_size, CeedVector mesh_coords);
58 CeedInt dim = 3; // dimension of the mesh in main()
59 CeedInt num_comp_x = 3; // number of x components in main()
60 CeedInt mesh_degree = 4; // polynomial degree for the mesh in main()
61 CeedInt sol_degree = 4; // polynomial degree for the solution in main()
62 CeedInt num_qpts = sol_degree + 2; // number of 1D quadrature points in main()
63 CeedInt prob_size = -1; // approximate problem size in main()
64 CeedInt help = 0, test = 0, gallery = 0, benchmark = 0; in main()
140 CeedInt num_xyz[dim]; in main()
153 CeedInt mesh_size, sol_size; in main()
209 CeedInt elem_qpts = CeedIntPow(num_qpts, dim); in main()
210 CeedInt num_elem = 1; in main()
212 for (CeedInt d = 0; d < dim; d++) num_elem *= num_xyz[d]; in main()
256 for (CeedInt i = 0; i < benchmark; i++) { in main()
269 for (CeedInt i = 0; i < sol_size; i++) volume += v_array[i]; in main()
304 int GetCartesianMeshSize(CeedInt dim, CeedInt degree, CeedInt prob_size, CeedInt num_xyz[dim]) { in GetCartesianMeshSize()
307 CeedInt num_elem = prob_size / CeedIntPow(degree, dim); in GetCartesianMeshSize()
308 CeedInt s = 0; // find s: num_elem/2 < 2^s <= num_elem in GetCartesianMeshSize()
314 CeedInt r = s % dim; in GetCartesianMeshSize()
316 for (CeedInt d = 0; d < dim; d++) { in GetCartesianMeshSize()
317 CeedInt sd = s / dim; in GetCartesianMeshSize()
328 …artesianRestriction(Ceed ceed, CeedInt dim, CeedInt num_xyz[dim], CeedInt degree, CeedInt num_comp… in BuildCartesianRestriction()
330 CeedInt p = degree + 1; in BuildCartesianRestriction()
331 CeedInt num_nodes = CeedIntPow(p, dim); // number of scalar nodes per element in BuildCartesianRestriction()
332 CeedInt elem_qpts = CeedIntPow(num_qpts, dim); // number of qpts per element in BuildCartesianRestriction()
333 CeedInt nd[3], num_elem = 1, scalar_size = 1; in BuildCartesianRestriction()
335 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
344 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction()
346 for (CeedInt e = 0; e < num_elem; e++) { in BuildCartesianRestriction()
347 CeedInt e_xyz[3] = {1, 1, 1}, re = e; in BuildCartesianRestriction()
349 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
353 CeedInt *local_elem_nodes = elem_nodes + e * num_nodes; in BuildCartesianRestriction()
355 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction()
356 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
358 for (CeedInt d = 0; d < dim; d++) { in BuildCartesianRestriction()
375 int SetCartesianMeshCoords(CeedInt dim, CeedInt num_xyz[dim], CeedInt mesh_degree, CeedVector mesh_… in SetCartesianMeshCoords()
376 CeedInt p = mesh_degree + 1; in SetCartesianMeshCoords()
377 CeedInt nd[3], scalar_size = 1; in SetCartesianMeshCoords()
379 for (CeedInt d = 0; d < dim; d++) { in SetCartesianMeshCoords()
390 for (CeedInt i = 0; i < p; i++) nodes[i] = 0.5 + 0.5 * nodes[i]; in SetCartesianMeshCoords()
391 for (CeedInt gs_nodes = 0; gs_nodes < scalar_size; gs_nodes++) { in SetCartesianMeshCoords()
392 CeedInt r_nodes = gs_nodes; in SetCartesianMeshCoords()
394 for (CeedInt d = 0; d < dim; d++) { in SetCartesianMeshCoords()
395 CeedInt d_1d = r_nodes % nd[d]; in SetCartesianMeshCoords()
411 CeedScalar TransformMeshCoords(CeedInt dim, CeedInt mesh_size, CeedVector mesh_coords) { in TransformMeshCoords()
417 for (CeedInt i = 0; i < mesh_size; i++) { in TransformMeshCoords()
423 CeedInt num_nodes = mesh_size / dim; in TransformMeshCoords()
425 for (CeedInt i = 0; i < num_nodes; i++) { in TransformMeshCoords()