summaryrefslogtreecommitdiff
path: root/mg2d.h
diff options
context:
space:
mode:
authorAnton Khirnov <anton@khirnov.net>2019-01-25 16:16:17 +0100
committerAnton Khirnov <anton@khirnov.net>2019-01-25 17:01:20 +0100
commitd76687285a032e25cbd258035321cb8d6d8e0330 (patch)
tree658d4a98c471129dd193efec43a4e61dd65e841b /mg2d.h
parentc570c02ea4a427ed6dbf74652ba4f7936cb371e8 (diff)
mg2d: factor out the boundary condition-related API
Diffstat (limited to 'mg2d.h')
-rw-r--r--mg2d.h28
1 files changed, 1 insertions, 27 deletions
diff --git a/mg2d.h b/mg2d.h
index 6b2def6..234d8cf 100644
--- a/mg2d.h
+++ b/mg2d.h
@@ -22,37 +22,11 @@
#include <stddef.h>
#include <stdint.h>
+#include "mg2d_boundary.h"
#include "mg2d_constants.h"
typedef struct MG2DInternal MG2DInternal;
-/**
- * Boundary condition definition.
- */
-typedef struct MG2DBoundary {
- /**
- * Type of the boundary condition.
- */
- enum MG2DBCType type;
- /**
- * For type = MG2D_BC_TYPE_FIXVAL:
- * Values of the unknown function on the boundary.
- * The number of boundary layers is equal to fd_stencil.
- * The first boundary layer has the number of points equal to the
- * corresponding domain_size. Each subsequent boundary layer has one
- * more boundary point at each end of the domain.
- *
- * Ignored otherwise.
- */
- double *val;
- /**
- * Number of elements between rows in val. I.e. if val[0] is the first
- * boundary point, then val[val_stride - 1] is the first boundary point in
- * the second row and so on.
- */
- size_t val_stride;
-} MG2DBoundary;
-
typedef struct MG2DContext {
/**
* Solver private data, not to be accessed in any way by the caller.