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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
/*
This file is part of p4est.
p4est is a C library to manage a collection (a forest) of multiple
connected adaptive quadtrees or octrees in parallel.
Copyright (C) 2010 The University of Texas System
Additional copyright (C) 2011 individual authors
Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
p4est 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 2 of the License, or
(at your option) any later version.
p4est 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 p4est; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifdef P4_TO_P8
#include <p8est_algorithms.h>
#include <p8est_bits.h>
#include <p8est_extended.h>
#include <p8est_vtk.h>
#else
#include <p4est_algorithms.h>
#include <p4est_bits.h>
#include <p4est_extended.h>
#include <p4est_vtk.h>
#endif
/* typedefs */
typedef struct
{
p4est_topidx_t a;
}
user_data_t;
/* global variables */
static int coarsen_all = 1;
/* functions */
static void
init_fn (p4est_t * p4est, p4est_topidx_t which_tree,
p4est_quadrant_t * quadrant)
{
user_data_t *data = (user_data_t *) quadrant->p.user_data;
data->a = which_tree;
}
static int
refine_fn (p4est_t * p4est, p4est_topidx_t which_tree,
p4est_quadrant_t * quadrant)
{
if (quadrant->level >= 6) {
return 0;
}
#ifdef P4_TO_P8
if (quadrant->level >= 5 && quadrant->z <= P4EST_QUADRANT_LEN (3)) {
return 0;
}
#endif
if (quadrant->x == P4EST_LAST_OFFSET (2) &&
quadrant->y == P4EST_LAST_OFFSET (2)) {
return 1;
}
if (quadrant->x >= P4EST_QUADRANT_LEN (2)) {
return 0;
}
return 1;
}
static int
coarsen_fn (p4est_t * p4est, p4est_topidx_t which_tree,
p4est_quadrant_t * q[])
{
SC_CHECK_ABORT (p4est_quadrant_is_familypv (q), "Coarsen invocation");
return coarsen_all || q[0]->y >= P4EST_ROOT_LEN / 2;
}
/* main */
int
main (int argc, char **argv)
{
int rank, num_procs, mpiret, i;
sc_MPI_Comm mpicomm = sc_MPI_COMM_WORLD;
p4est_t *p4est_1tree, *p4est_ntrees;
p4est_connectivity_t *connectivity_1tree, *connectivity_ntrees;
/* initialize MPI and p4est internals */
mpiret = sc_MPI_Init (&argc, &argv);
SC_CHECK_MPI (mpiret);
mpiret = sc_MPI_Comm_size (mpicomm, &num_procs);
SC_CHECK_MPI (mpiret);
mpiret = sc_MPI_Comm_rank (mpicomm, &rank);
SC_CHECK_MPI (mpiret);
sc_init (mpicomm, 1, 1, NULL, SC_LP_DEFAULT);
p4est_init (NULL, SC_LP_DEFAULT);
/* create connectivity */
#ifdef P4_TO_P8
connectivity_1tree = p8est_connectivity_new_unitcube ();
connectivity_ntrees = p8est_connectivity_new_twocubes ();
#else
connectivity_1tree = p4est_connectivity_new_unitsquare ();
connectivity_ntrees = p4est_connectivity_new_corner ();
#endif
/* create p4est structure */
p4est_1tree = p4est_new_ext (mpicomm, connectivity_1tree, 15, 0, 0,
sizeof (user_data_t), init_fn, NULL);
p4est_ntrees = p4est_new_ext (mpicomm, connectivity_ntrees, 15, 0, 0,
sizeof (user_data_t), init_fn, NULL);
/* write output: new */
p4est_vtk_write_file (p4est_1tree, NULL,
P4EST_STRING "_partition_corr_1tree_new");
p4est_vtk_write_file (p4est_ntrees, NULL,
P4EST_STRING "_partition_corr_ntrees_new");
/* refine */
p4est_refine (p4est_1tree, 1, refine_fn, init_fn);
p4est_refine (p4est_ntrees, 1, refine_fn, init_fn);
/* write output: refined */
p4est_vtk_write_file (p4est_1tree, NULL,
P4EST_STRING "_partition_corr_1tree_refined");
p4est_vtk_write_file (p4est_ntrees, NULL,
P4EST_STRING "_partition_corr_ntrees_refined");
/* run partition and coarsen till one quadrant per tree remains */
i = 0;
while (p4est_1tree->global_num_quadrants > 1 && i <= P4EST_MAXLEVEL) {
(void) p4est_partition_ext (p4est_1tree, 1, NULL);
p4est_coarsen (p4est_1tree, 0, coarsen_fn, init_fn);
i++;
}
SC_CHECK_ABORT (p4est_1tree->global_num_quadrants == 1,
"coarsest forest with one tree was not achieved");
i = 0;
while (p4est_ntrees->global_num_quadrants > connectivity_ntrees->num_trees
&& i <= P4EST_MAXLEVEL) {
(void) p4est_partition_ext (p4est_ntrees, 1, NULL);
p4est_coarsen (p4est_ntrees, 0, coarsen_fn, init_fn);
i++;
}
SC_CHECK_ABORT (p4est_ntrees->global_num_quadrants
== connectivity_ntrees->num_trees,
"coarsest forest with multiple trees was not achieved");
/* run partition on coarse forest (one quadrant per tree) once again */
(void) p4est_partition_ext (p4est_1tree, 1, NULL);
(void) p4est_partition_ext (p4est_ntrees, 1, NULL);
/* write output: coarsened */
p4est_vtk_write_file (p4est_1tree, NULL,
P4EST_STRING "_partition_corr_1tree_coarsened");
p4est_vtk_write_file (p4est_ntrees, NULL,
P4EST_STRING "_partition_corr_ntrees_coarsened");
/* destroy the p4est and its connectivity structure */
p4est_destroy (p4est_1tree);
p4est_destroy (p4est_ntrees);
p4est_connectivity_destroy (connectivity_1tree);
p4est_connectivity_destroy (connectivity_ntrees);
/* clean up and exit */
sc_finalize ();
mpiret = sc_MPI_Finalize ();
SC_CHECK_MPI (mpiret);
return 0;
}
|
