164 sc_array_t *corner_offset;
165 sc_array_t *corner_quad;
166 sc_array_t *corner_corner;
278 sc_array_t * neighboring_quads,
279 sc_array_t * neighboring_encs,
280 sc_array_t * neighboring_qids);
345 int *nface,
int *nrank);
355 * mfn,
void *ghost_data);
int32_t p4est_topidx_t
Typedef for counting topological entities (trees, tree vertices).
Definition: p4est_base.h:93
int32_t p4est_locidx_t
Typedef for processor-local indexing of quadrants and nodes.
Definition: p4est_base.h:106
p8est_connect_type_t
Characterize a type of adjacency.
Definition: p8est_connectivity.h:90
passing quadrants and data to neighboring processes
void p8est_mesh_destroy(p8est_mesh_t *mesh)
Destroy a p8est_mesh structure.
void p8est_mesh_face_neighbor_init(p8est_mesh_face_neighbor_t *mfn, p8est_t *p8est, p8est_ghost_t *ghost, p8est_mesh_t *mesh, p4est_topidx_t which_tree, p8est_quadrant_t *quadrant)
Initialize a mesh neighbor iterator by quadrant pointer.
p8est_mesh_t * p8est_mesh_new(p8est_t *p8est, p8est_ghost_t *ghost, p8est_connect_type_t btype)
Create a p8est_mesh structure.
p8est_quadrant_t * p8est_mesh_face_neighbor_next(p8est_mesh_face_neighbor_t *mfn, p4est_topidx_t *ntree, p4est_locidx_t *nquad, int *nface, int *nrank)
Move the iterator forward to loop around neighbors of the quadrant.
size_t p8est_mesh_memory_used(p8est_mesh_t *mesh)
Calculate the memory usage of the mesh structure.
p8est_quadrant_t * p8est_mesh_get_quadrant(p8est_t *p4est, p8est_mesh_t *mesh, p4est_locidx_t qid)
Access a process-local quadrant inside a forest.
void p8est_mesh_face_neighbor_init2(p8est_mesh_face_neighbor_t *mfn, p8est_t *p8est, p8est_ghost_t *ghost, p8est_mesh_t *mesh, p4est_topidx_t which_tree, p4est_locidx_t quadrant_id)
Initialize a mesh neighbor iterator by quadrant index.
void * p8est_mesh_face_neighbor_data(p8est_mesh_face_neighbor_t *mfn, void *ghost_data)
Get the user data for the current face neighbor.
p4est_locidx_t p8est_mesh_get_neighbors(p8est_t *p4est, p8est_ghost_t *ghost, p8est_mesh_t *mesh, p4est_locidx_t curr_quad_id, p4est_locidx_t direction, sc_array_t *neighboring_quads, sc_array_t *neighboring_encs, sc_array_t *neighboring_qids)
Lookup neighboring quads of quadrant in a specific direction.
p8est_quadrant_t * p8est_mesh_quadrant_cumulative(p8est_t *p8est, p8est_mesh_t *mesh, p4est_locidx_t cumulative_id, p4est_topidx_t *which_tree, p4est_locidx_t *quadrant_id)
Find a quadrant based on its cumulative number in the local forest.
The p4est forest datatype.
Definition: p4est.h:136
quadrants that neighbor the local domain
Definition: p8est_ghost.h:41
This structure can be used as the status of a face neighbor iterator.
Definition: p8est_mesh.h:174
This structure contains complete mesh information on a 2:1 balanced forest.
Definition: p8est_mesh.h:135
sc_array_t * quad_to_half
stores half-size neighbors
Definition: p8est_mesh.h:146
int8_t * quad_to_face
encodes orientation/2:1 status
Definition: p8est_mesh.h:145
sc_array_t * edge_offset
local_num_edges + 1 entries
Definition: p8est_mesh.h:157
p4est_locidx_t local_num_edges
unsame-size and tree-boundary edges
Definition: p8est_mesh.h:155
int * ghost_to_proc
processor for each ghost quad
Definition: p8est_mesh.h:142
p4est_locidx_t * quad_to_quad
one index for each of the 6 faces
Definition: p8est_mesh.h:144
sc_array_t * quad_level
Stores lists of per-level quads.
Definition: p8est_mesh.h:147
p4est_locidx_t * quad_to_edge
12 indices for each local quad
Definition: p8est_mesh.h:156
sc_array_t * edge_edge
and this one too (type int8_t)
Definition: p8est_mesh.h:159
sc_array_t * edge_quad
edge_offset indexes into this
Definition: p8est_mesh.h:158
p4est_topidx_t * quad_to_tree
tree index for each local quad.
Definition: p8est_mesh.h:139
The 3D quadrant (i.e., octant) datatype.
Definition: p8est.h:68
The p8est forest datatype.
Definition: p8est.h:132