Home
last modified time | relevance | path

Searched defs:elem_nodes (Results 1 – 11 of 11) sorted by relevance

/libCEED/tests/
H A Dt598-operator.c70 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
116 CeedInt num_nodes_in_elem = p_coarse * p_coarse, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
148 CeedInt num_nodes_in_elem = p_fine * p_fine, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
H A Dt591-operator.c69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
H A Dt592-operator.c69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
H A Dt595-operator.c71 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
H A Dt590-operator.c62 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
H A Dt599-operator.c64 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
/libCEED/examples/rust/mesh/src/
H A Dlib.rs69 let mut elem_nodes = vec![0; num_elem * num_nodes]; localVariable
/libCEED/examples/ceed/
H A Dex3-volume.c323 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local
H A Dex1-volume.c334 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local
H A Dex1-volume-f.f90100 integer, dimension (:), allocatable :: elem_nodes local
/libCEED/examples/rust-qfunctions/
H A Dex1-volume.c344 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local