Home
last modified time | relevance | path

Searched refs:l_nodes (Results 1 – 5 of 5) sorted by relevance

/libCEED/examples/ceed/
H A Dex2-surface.c365 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction() local
366 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
373 local_elem_nodes[l_nodes] = g_nodes; in BuildCartesianRestriction()
H A Dex3-volume.c334 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction() local
335 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
342 local_elem_nodes[l_nodes] = g_nodes; in BuildCartesianRestriction()
H A Dex1-volume.c345 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction() local
346 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
353 local_elem_nodes[l_nodes] = g_nodes; in BuildCartesianRestriction()
/libCEED/examples/rust-qfunctions/
H A Dex1-volume.c355 for (CeedInt l_nodes = 0; l_nodes < num_nodes; l_nodes++) { in BuildCartesianRestriction() local
356 CeedInt g_nodes = 0, g_nodes_stride = 1, r_nodes = l_nodes; in BuildCartesianRestriction()
363 local_elem_nodes[l_nodes] = g_nodes; in BuildCartesianRestriction()
/libCEED/examples/petsc/
H A Dbpsraw.c342 …tra, local_nodes, local_elem, mesh_elem[3], m_nodes[3], p[3], i_rank[3], l_nodes[3], l_size, num_c… in main() local
474 l_nodes[d] = mesh_elem[d] * degree + 1; in main()
475 l_size *= l_nodes[d]; in main()
502 …for (PetscInt i = 0, ir, ii; ir = i >= m_nodes[0], ii = i - ir * m_nodes[0], i < l_nodes[0]; i++) { in main()
503 …for (PetscInt j = 0, jr, jj; jr = j >= m_nodes[1], jj = j - jr * m_nodes[1], j < l_nodes[1]; j++) { in main()
504 …for (PetscInt k = 0, kr, kk; kr = k >= m_nodes[2], kk = k - kr * m_nodes[2], k < l_nodes[2]; k++) { in main()
505 PetscInt here = (i * l_nodes[1] + j) * l_nodes[2] + k; in main()
508 …(i_rank[0] + 1 == p[0] && i + 1 == l_nodes[0]) || (i_rank[1] + 1 == p[1] && j + 1 == l_nodes[1]) || in main()
509 (i_rank[2] + 1 == p[2] && k + 1 == l_nodes[2])) { in main()