Home
last modified time | relevance | path

Searched refs:num_nodes_in_elem (Results 1 – 6 of 6) 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
72 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
116 CeedInt num_nodes_in_elem = p_coarse * p_coarse, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
118 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
148 CeedInt num_nodes_in_elem = p_fine * p_fine, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
150 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
H A Dt591-operator.c69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
71 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
117 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
H A Dt592-operator.c69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
71 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
117 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
H A Dt595-operator.c71 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
73 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
H A Dt590-operator.c62 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
64 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()
H A Dt599-operator.c64 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
66 for (CeedInt n = 0; n < num_nodes_in_elem; n++) { in main()