| /libCEED/examples/rust/mesh/src/ |
| H A D | lib.rs | 69 let mut elem_nodes = vec![0; num_elem * num_nodes]; localVariable
87 elem_nodes[loc_offset + loc_nodes] = global_nodes as i32;
99 &elem_nodes,
|
| /libCEED/tests/ |
| H A D | t598-operator.c | 70 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
80 elem_nodes[n] = p * g_node; in main()
116 CeedInt num_nodes_in_elem = p_coarse * p_coarse, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
126 elem_nodes[n] = g_node; in main()
148 CeedInt num_nodes_in_elem = p_fine * p_fine, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
158 elem_nodes[n] = g_node; in main()
|
| H A D | t591-operator.c | 69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
79 elem_nodes[n] = p * g_node; in main()
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
125 elem_nodes[n] = g_node; in main()
|
| H A D | t592-operator.c | 69 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_x + e * num_nodes_in_elem; in main() local
79 elem_nodes[n] = p * g_node; in main()
115 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
125 elem_nodes[n] = g_node; in main()
|
| H A D | t595-operator.c | 71 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
81 elem_nodes[n] = g_node; in main()
|
| H A D | t590-operator.c | 62 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
72 elem_nodes[n] = g_node; in main()
|
| H A D | t599-operator.c | 64 CeedInt num_nodes_in_elem = p * p, *elem_nodes = ind_u + e * num_nodes_in_elem; in main() local
74 elem_nodes[n] = g_node; in main()
|
| /libCEED/examples/ceed/ |
| H A D | ex1-volume-f.f90 | 100 integer, dimension (:), allocatable :: elem_nodes local
120 allocate (elem_nodes(elem_nodes_size))
143 elem_nodes((i - 1) * num_nodes + j) = g_nodes
148 &ceed_copy_values, elem_nodes, restriction, err)
153 deallocate (elem_nodes)
|
| H A D | ex3-volume.c | 323 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local
332 CeedInt *local_elem_nodes = elem_nodes + e * num_nodes; in BuildCartesianRestriction()
346 …_nodes, num_comp, scalar_size, num_comp * scalar_size, CEED_MEM_HOST, CEED_COPY_VALUES, elem_nodes, in BuildCartesianRestriction()
352 free(elem_nodes); in BuildCartesianRestriction()
|
| H A D | ex1-volume.c | 334 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local
343 CeedInt *local_elem_nodes = elem_nodes + e * num_nodes; in BuildCartesianRestriction()
356 …_nodes, num_comp, scalar_size, num_comp * scalar_size, CEED_MEM_HOST, CEED_COPY_VALUES, elem_nodes, in BuildCartesianRestriction()
361 free(elem_nodes); in BuildCartesianRestriction()
|
| /libCEED/examples/python/ |
| H A D | ex_common.py | 123 elem_nodes = np.zeros(num_elem * num_nodes, dtype=np.int32)
141 elem_nodes[e * num_nodes + n] = g_node
145 num_elem, num_nodes, num_comp, scalar_size, size, elem_nodes)
|
| /libCEED/examples/rust-qfunctions/ |
| H A D | ex1-volume.c | 344 CeedInt *elem_nodes = malloc(sizeof(CeedInt) * num_elem * num_nodes); in BuildCartesianRestriction() local
353 CeedInt *local_elem_nodes = elem_nodes + e * num_nodes; in BuildCartesianRestriction()
366 …_nodes, num_comp, scalar_size, num_comp * scalar_size, CEED_MEM_HOST, CEED_COPY_VALUES, elem_nodes, in BuildCartesianRestriction()
371 free(elem_nodes); in BuildCartesianRestriction()
|