Actual source code: 2dimpl.h
2: /* $Id: 2dimpl.h,v 1.3 1999/11/17 16:23:07 knepley Exp $ */
3: /*
4: This private file should not be included in users' code.
5: */
7: #ifndef __2DIMPL_H
9: #include "src/mesh/impls/triangular/triimpl.h"
11: typedef struct {
12: /* Partitioning order */
13: PetscTruth isNodePartitioned; /* The flag indicating that the nodes have been partitioned */
14: PetscTruth isEdgePartitioned; /* The flag indicating that the nodes have been partitioned */
15: /* Node partition structures */
16: AO nodeOrdering; /* The renumbering of the nodes */
17: int numLocNodes; /* N: The number of local nodes */
18: int numNodes; /* The global number of nodes */
19: int numOverlapNodes; /* N+G: The number of local nodes + ghost nodes */
20: int *firstNode; /* [P]: The first node in each domain */
21: int *ghostNodes; /* [G]: The global node number of each ghost node */
22: int *ghostNodeProcs; /* [G]: The domain of each ghost node */
23: /* Edge partition structures */
24: AO edgeOrdering; /* The renumbering of the edges */
25: int numLocEdges; /* The number of local edges */
26: int numEdges; /* The global number of edges */
27: int *firstEdge; /* [P]: The first edge in each domain */
28: /* Boundary node partition structures */
29: int numLocBdNodes; /* The number of local boundary nodes */
30: int numBdNodes; /* The global number of boundary nodes */
31: int numOverlapBdNodes; /* The number of local + ghost boundary nodes */
32: int *firstBdNode; /* The first boundary node in each domain */
33: int *ghostBdNodes; /* The index into ghostNodes of each ghost boundary node */
34: } Partition_Triangular_2D;
36: #endif /* __2DIMPL_H */