25 #ifndef P4EST_LNODES_H
26 #define P4EST_LNODES_H
33 typedef int8_t p4est_lnodes_code_t;
144 p4est_lnodes_code_t *face_code;
184 p4est_lnodes_decode (p4est_lnodes_code_t face_code,
int hanging_face[4])
186 P4EST_ASSERT (face_code >= 0);
190 int8_t c = face_code & 0x03;
192 int8_t work = face_code >> 2;
194 memset (hanging_face, -1, 4 *
sizeof (
int));
196 for (i = 0; i < 2; ++i) {
251 int partition_for_coarsening);
258 int nodes_per_volume,
260 int nodes_per_corner,
262 partition_for_coarsening);
313 void p4est_lnodes_share_owned (
sc_array_t * node_data,
355 p4est_lnodes_rank_array_index_int (
sc_array_t * array,
int it)
358 P4EST_ASSERT (it >= 0 && (
size_t) it < array->elem_count);
368 p4est_lnodes_rank_array_index (
sc_array_t * array,
size_t it)
371 P4EST_ASSERT (it < array->elem_count);
383 P4EST_ASSERT (lidx >= 0 && lidx < lnodes->num_local_nodes);
385 return (lidx < owned) ? lnodes->global_offset + lidx :
386 lnodes->nonlocal_nodes[lidx - owned];
The top-level 2D p4est interface.
int32_t p4est_locidx_t
Typedef for processor-local indexing of quadrants and nodes.
Definition: p4est_base.h:106
int64_t p4est_gloidx_t
Typedef for globally unique indexing of quadrants.
Definition: p4est_base.h:118
const int p4est_corner_faces[4][2]
Store the face numbers 0..3 for each tree corner.
const int p4est_corner_face_corners[4][4]
Store the face corner numbers for the faces touching a tree corner.
passing quadrants and data to neighboring processes
sc3_MPI_Comm_t sc_MPI_Comm
quadrants that neighbor the local domain
Definition: p4est_ghost.h:41
p4est_lnodes_buffer_t handles the communication of data associated with nodes.
Definition: p4est_lnodes.h:279
The structure stored in the sharers array.
Definition: p4est_lnodes.h:161
Store a parallel numbering of Lobatto points of a given degree > 0.
Definition: p4est_lnodes.h:133
The p4est forest datatype.
Definition: p4est.h:136