1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
/*
* Boundary conditions internal API.
* Copyright 2019 Anton Khirnov <anton@khirnov.net>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <errno.h>
#include <stddef.h>
#include <stdlib.h>
#include "common.h"
#include "mg2d_boundary.h"
#include "mg2d_boundary_internal.h"
struct MG2DBoundaryInternal {
double *val_base;
};
MG2DBoundary *mg2di_bc_alloc(size_t domain_size)
{
MG2DBoundary *bnd;
size_t boundary_len_max;
if (domain_size > SIZE_MAX - 2 * (FD_STENCIL_MAX - 1))
return NULL;
boundary_len_max = domain_size + 2 * (FD_STENCIL_MAX - 1);
if (boundary_len_max > SIZE_MAX / (FD_STENCIL_MAX * sizeof(bnd->val)))
return NULL;
bnd = calloc(1, sizeof(*bnd));
if (!bnd)
return NULL;
bnd->priv = calloc(1, sizeof(*bnd->priv));
if (!bnd->priv) {
free(bnd);
return NULL;
}
bnd->priv->val_base = malloc(boundary_len_max * FD_STENCIL_MAX * sizeof(*bnd->val));
if (!bnd->priv->val_base)
goto fail;
bnd->val = bnd->priv->val_base + FD_STENCIL_MAX - 1;
bnd->val_stride = boundary_len_max;
return bnd;
fail:
mg2di_bc_free(&bnd);
return NULL;
}
void mg2di_bc_free(MG2DBoundary **pbnd)
{
MG2DBoundary *bnd = *pbnd;
if (!bnd)
return;
free(bnd->priv->val_base);
free(bnd->priv);
free(bnd);
*pbnd = NULL;
}
static const struct {
unsigned int coord_idx;
unsigned int is_upper;
} boundary_def[] = {
[MG2D_BOUNDARY_0L] = {
.coord_idx = 0,
.is_upper = 0,
},
[MG2D_BOUNDARY_0U] = {
.coord_idx = 0,
.is_upper = 1,
},
[MG2D_BOUNDARY_1L] = {
.coord_idx = 1,
.is_upper = 0
},
[MG2D_BOUNDARY_1U] = {
.coord_idx = 1,
.is_upper = 1,
},
};
int mg2d_bnd_coord_idx(enum MG2DBoundaryLoc loc)
{
if (loc < 0 || loc >= ARRAY_ELEMS(boundary_def))
return -EINVAL;
return boundary_def[loc].coord_idx;
}
int mg2d_bnd_is_upper(enum MG2DBoundaryLoc loc)
{
if (loc < 0 || loc >= ARRAY_ELEMS(boundary_def))
return -EINVAL;
return boundary_def[loc].is_upper;
}
int mg2d_bnd_out_dir(enum MG2DBoundaryLoc loc)
{
int ret = mg2d_bnd_is_upper(loc);
if (ret < 0)
return 0;
return ret ? 1 : -1;
}
enum MG2DBoundaryLoc mg2d_bnd_id(int coord_idx, int is_upper)
{
for (int i = 0; i < ARRAY_ELEMS(boundary_def); i++) {
if (boundary_def[i].coord_idx == coord_idx &&
boundary_def[i].is_upper == is_upper)
return i;
}
return MG2D_BOUNDARY_NONE;
}
|
