deal.II version 9.8.0
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
p4est_wrappers.cc
Go to the documentation of this file.
1// -----------------------------------------------------------------------------
2//
3// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception OR LGPL-2.1-or-later
4// Copyright (C) 2016 - 2025 by the deal.II authors
5//
6// This file is part of the deal.II library.
7//
8// Detailed license information governing the source code and contributions
9// can be found in LICENSE.md and CONTRIBUTING.md at the top level directory.
10//
11// -----------------------------------------------------------------------------
12
13
14#include <deal.II/distributed/p4est_wrappers.h>
15#include <deal.II/distributed/tria.h>
16
17#ifdef DEAL_II_WITH_P4EST
18# include <p4est.h>
19# include <p8est.h>
20# include <sc_containers.h>
21
22// Below, we will use the P4EST_QUADRANT_INIT and P8EST_QUADRANT_INIT
23// function-like macros. If we are building the library based on
24// header files, we get these from the <p4est.h> and <p8est.h> header
25// inclusions. But if we build a C++20 module, we only import
26// declarations, not preprocessor macros. As a consequence, let us
27// duplicate these macros here, hoping that at some point, the p4est
28// library folks add regular functions that can do the job.
29# ifndef P4EST_QUADRANT_INIT
30# define P4EST_QUADRANT_INIT(q) \
31 ((void)std::memset((q), -1, sizeof(p4est_quadrant_t)))
32# endif
33
34# ifndef P8EST_QUADRANT_INIT
35# define P8EST_QUADRANT_INIT(q) \
36 ((void)std::memset((q), -1, sizeof(p8est_quadrant_t)))
37# endif
38
39#endif
40
41
42DEAL_II_NAMESPACE_OPEN
43
44#ifdef DEAL_II_WITH_P4EST
45
46namespace internal
47{
48 namespace p4est
49 {
50 namespace
51 {
52 template <int dim, int spacedim>
53 typename ::Triangulation<dim, spacedim>::cell_iterator
54 cell_from_quad(
55 const ::parallel::distributed::Triangulation<dim, spacedim>
56 *triangulation,
57 const typename ::internal::p4est::types<dim>::topidx treeidx,
58 const typename ::internal::p4est::types<dim>::quadrant &quad)
59 {
60 int i, l = quad.level;
61 ::types::global_dof_index dealii_index =
62 triangulation->get_p4est_tree_to_coarse_cell_permutation()[treeidx];
63
64 for (i = 0; i < l; ++i)
65 {
66 typename ::Triangulation<dim, spacedim>::cell_iterator cell(
67 triangulation, i, dealii_index);
68 const int child_id =
69 ::internal::p4est::functions<dim>::quadrant_ancestor_id(
70 &quad, i + 1);
71 Assert(cell->has_children(),
72 ExcMessage("p4est quadrant does not correspond to a cell!"));
73 dealii_index = cell->child_index(child_id);
74 }
75
76 typename ::Triangulation<dim, spacedim>::cell_iterator out_cell(
77 triangulation, l, dealii_index);
78
79 return out_cell;
80 }
81
86 template <int dim, int spacedim>
87 struct FindGhosts
88 {
89 const typename ::parallel::distributed::Triangulation<dim,
90 spacedim>
91 *triangulation;
92 sc_array_t *subids;
93 std::map<unsigned int, std::set<::types::subdomain_id>>
94 *vertices_with_ghost_neighbors;
95 };
96
97
103 template <int dim, int spacedim>
104 void
105 find_ghosts_corner(
106 typename ::internal::p4est::iter<dim>::corner_info *info,
107 void *user_data)
108 {
109 int i, j;
110 int nsides = info->sides.elem_count;
111 auto *sides = reinterpret_cast<
112 typename ::internal::p4est::iter<dim>::corner_side *>(
113 info->sides.array);
114 FindGhosts<dim, spacedim> *fg =
115 static_cast<FindGhosts<dim, spacedim> *>(user_data);
116 sc_array_t *subids = fg->subids;
117 const ::parallel::distributed::Triangulation<dim, spacedim>
118 *triangulation = fg->triangulation;
119 int nsubs;
120 ::types::subdomain_id *subdomain_ids;
121 std::map<unsigned int, std::set<::types::subdomain_id>>
122 *vertices_with_ghost_neighbors = fg->vertices_with_ghost_neighbors;
123
124 subids->elem_count = 0;
125 for (i = 0; i < nsides; ++i)
126 {
127 if (sides[i].is_ghost)
128 {
129 typename ::parallel::distributed::
130 Triangulation<dim, spacedim>::cell_iterator cell =
131 cell_from_quad(triangulation,
132 sides[i].treeid,
133 *(sides[i].quad));
134 Assert(cell->is_ghost(),
135 ExcMessage("ghost quad did not find ghost cell"));
136 ::types::subdomain_id *subid =
137 static_cast<::types::subdomain_id *>(
138 sc_array_push(subids));
139 *subid = cell->subdomain_id();
140 }
141 }
142
143 if (!subids->elem_count)
144 {
145 return;
146 }
147
148 nsubs = static_cast<int>(subids->elem_count);
149 subdomain_ids =
150 reinterpret_cast<::types::subdomain_id *>(subids->array);
151
152 for (i = 0; i < nsides; ++i)
153 {
154 if (!sides[i].is_ghost)
155 {
156 typename ::parallel::distributed::
157 Triangulation<dim, spacedim>::cell_iterator cell =
158 cell_from_quad(triangulation,
159 sides[i].treeid,
160 *(sides[i].quad));
161
162 Assert(!cell->is_ghost(),
163 ExcMessage("local quad found ghost cell"));
164
165 for (j = 0; j < nsubs; ++j)
166 {
167 (*vertices_with_ghost_neighbors)[cell->vertex_index(
168 sides[i].corner)]
169 .insert(subdomain_ids[j]);
170 }
171 }
172 }
173
174 subids->elem_count = 0;
175 }
176
180 template <int dim, int spacedim>
181 void
182 find_ghosts_edge(
183 typename ::internal::p4est::iter<dim>::edge_info *info,
184 void *user_data)
185 {
186 int i, j, k;
187 int nsides = info->sides.elem_count;
188 auto *sides = reinterpret_cast<
189 typename ::internal::p4est::iter<dim>::edge_side *>(
190 info->sides.array);
191 auto *fg = static_cast<FindGhosts<dim, spacedim> *>(user_data);
192 sc_array_t *subids = fg->subids;
193 const ::parallel::distributed::Triangulation<dim, spacedim>
194 *triangulation = fg->triangulation;
195 int nsubs;
196 ::types::subdomain_id *subdomain_ids;
197 std::map<unsigned int, std::set<::types::subdomain_id>>
198 *vertices_with_ghost_neighbors = fg->vertices_with_ghost_neighbors;
199
200 subids->elem_count = 0;
201 for (i = 0; i < nsides; ++i)
202 {
203 if (sides[i].is_hanging)
204 {
205 for (j = 0; j < 2; ++j)
206 {
207 if (sides[i].is.hanging.is_ghost[j])
208 {
209 typename ::parallel::distributed::
210 Triangulation<dim, spacedim>::cell_iterator cell =
211 cell_from_quad(triangulation,
212 sides[i].treeid,
213 *(sides[i].is.hanging.quad[j]));
214 ::types::subdomain_id *subid =
215 static_cast<::types::subdomain_id *>(
216 sc_array_push(subids));
217 *subid = cell->subdomain_id();
218 }
219 }
220 }
221 }
222
223 if (!subids->elem_count)
224 {
225 return;
226 }
227
228 nsubs = static_cast<int>(subids->elem_count);
229 subdomain_ids =
230 reinterpret_cast<::types::subdomain_id *>(subids->array);
231
232 for (i = 0; i < nsides; ++i)
233 {
234 if (sides[i].is_hanging)
235 {
236 for (j = 0; j < 2; ++j)
237 {
238 if (!sides[i].is.hanging.is_ghost[j])
239 {
240 typename ::parallel::distributed::
241 Triangulation<dim, spacedim>::cell_iterator cell =
242 cell_from_quad(triangulation,
243 sides[i].treeid,
244 *(sides[i].is.hanging.quad[j]));
245
246 for (k = 0; k < nsubs; ++k)
247 {
248 (*vertices_with_ghost_neighbors)
249 [cell->vertex_index(
250 p8est_edge_corners[sides[i].edge][1 ^ j])]
251 .insert(subdomain_ids[k]);
252 }
253 }
254 }
255 }
256 }
257
258 subids->elem_count = 0;
259 }
260
264 template <int dim, int spacedim>
265 void
266 find_ghosts_face(
267 typename ::internal::p4est::iter<dim>::face_info *info,
268 void *user_data)
269 {
270 int i, j, k;
271 int nsides = info->sides.elem_count;
272 auto *sides = reinterpret_cast<
273 typename ::internal::p4est::iter<dim>::face_side *>(
274 info->sides.array);
275 FindGhosts<dim, spacedim> *fg =
276 static_cast<FindGhosts<dim, spacedim> *>(user_data);
277 sc_array_t *subids = fg->subids;
278 const ::parallel::distributed::Triangulation<dim, spacedim>
279 *triangulation = fg->triangulation;
280 int nsubs;
281 ::types::subdomain_id *subdomain_ids;
282 std::map<unsigned int, std::set<::types::subdomain_id>>
283 *vertices_with_ghost_neighbors = fg->vertices_with_ghost_neighbors;
284 int limit = (dim == 2) ? 2 : 4;
285
286 subids->elem_count = 0;
287 for (i = 0; i < nsides; ++i)
288 {
289 if (sides[i].is_hanging)
290 {
291 for (j = 0; j < limit; ++j)
292 {
293 if (sides[i].is.hanging.is_ghost[j])
294 {
295 typename ::parallel::distributed::
296 Triangulation<dim, spacedim>::cell_iterator cell =
297 cell_from_quad(triangulation,
298 sides[i].treeid,
299 *(sides[i].is.hanging.quad[j]));
300 ::types::subdomain_id *subid =
301 static_cast<::types::subdomain_id *>(
302 sc_array_push(subids));
303 *subid = cell->subdomain_id();
304 }
305 }
306 }
307 }
308
309 if (!subids->elem_count)
310 {
311 return;
312 }
313
314 nsubs = static_cast<int>(subids->elem_count);
315 subdomain_ids =
316 reinterpret_cast<::types::subdomain_id *>(subids->array);
317
318 for (i = 0; i < nsides; ++i)
319 {
320 if (sides[i].is_hanging)
321 {
322 for (j = 0; j < limit; ++j)
323 {
324 if (!sides[i].is.hanging.is_ghost[j])
325 {
326 typename ::parallel::distributed::
327 Triangulation<dim, spacedim>::cell_iterator cell =
328 cell_from_quad(triangulation,
329 sides[i].treeid,
330 *(sides[i].is.hanging.quad[j]));
331
332 for (k = 0; k < nsubs; ++k)
333 {
334 if (dim == 2)
335 {
336 (*vertices_with_ghost_neighbors)
337 [cell->vertex_index(
338 p4est_face_corners[sides[i].face]
339 [(limit - 1) ^ j])]
340 .insert(subdomain_ids[k]);
341 }
342 else
343 {
344 (*vertices_with_ghost_neighbors)
345 [cell->vertex_index(
346 p8est_face_corners[sides[i].face]
347 [(limit - 1) ^ j])]
348 .insert(subdomain_ids[k]);
349 }
350 }
351 }
352 }
353 }
354 }
355
356 subids->elem_count = 0;
357 }
358 } // namespace
359
360
361 int (&functions<2>::quadrant_compare)(const void *v1, const void *v2) =
362 p4est_quadrant_compare;
363
364 void (&functions<2>::quadrant_childrenv)(const types<2>::quadrant *q,
365 types<2>::quadrant c[]) =
366 p4est_quadrant_childrenv;
367
368 int (&functions<2>::quadrant_overlaps_tree)(types<2>::tree *tree,
369 const types<2>::quadrant *q) =
370 p4est_quadrant_overlaps_tree;
371
372 void (&functions<2>::quadrant_set_morton)(types<2>::quadrant *quadrant,
373 int level,
374 std::uint64_t id) =
375 p4est_quadrant_set_morton;
376
377 void
382
383 int (&functions<2>::quadrant_is_equal)(const types<2>::quadrant *q1,
384 const types<2>::quadrant *q2) =
385 p4est_quadrant_is_equal;
386
387 int (&functions<2>::quadrant_is_sibling)(const types<2>::quadrant *q1,
388 const types<2>::quadrant *q2) =
389 p4est_quadrant_is_sibling;
390
391 int (&functions<2>::quadrant_is_ancestor)(const types<2>::quadrant *q1,
392 const types<2>::quadrant *q2) =
393 p4est_quadrant_is_ancestor;
394
395 int (&functions<2>::quadrant_ancestor_id)(const types<2>::quadrant *q,
396 int level) =
397 p4est_quadrant_ancestor_id;
398
399 int (&functions<2>::comm_find_owner)(types<2>::forest *p4est,
400 const types<2>::locidx which_tree,
401 const types<2>::quadrant *q,
402 const int guess) =
403 p4est_comm_find_owner;
404
405 types<2>::connectivity *(&functions<2>::connectivity_new)(
406 types<2>::topidx num_vertices,
407 types<2>::topidx num_trees,
408 types<2>::topidx num_corners,
409 types<2>::topidx num_vtt) = p4est_connectivity_new;
410
411 types<2>::connectivity *(&functions<2>::connectivity_new_copy)(
412 types<2>::topidx num_vertices,
413 types<2>::topidx num_trees,
414 types<2>::topidx num_corners,
415 const double *vertices,
416 const types<2>::topidx *ttv,
417 const types<2>::topidx *ttt,
418 const int8_t *ttf,
419 const types<2>::topidx *ttc,
420 const types<2>::topidx *coff,
421 const types<2>::topidx *ctt,
422 const int8_t *ctc) = p4est_connectivity_new_copy;
423
424 void (&functions<2>::connectivity_join_faces)(types<2>::connectivity *conn,
425 types<2>::topidx tree_left,
426 types<2>::topidx tree_right,
427 int face_left,
428 int face_right,
429 int orientation) =
430 p4est_connectivity_join_faces;
431
432 void (&functions<2>::connectivity_destroy)(
433 p4est_connectivity_t *connectivity) = p4est_connectivity_destroy;
434
435 types<2>::forest *(&functions<2>::new_forest)(
436 MPI_Comm mpicomm,
437 types<2>::connectivity *connectivity,
438 types<2>::locidx min_quadrants,
439 int min_level,
440 int fill_uniform,
441 std::size_t data_size,
442 p4est_init_t init_fn,
443 void *user_pointer) = p4est_new_ext;
444
445 types<2>::forest *(&functions<2>::copy_forest)(types<2>::forest *input,
446 int copy_data) = p4est_copy;
447
448 void (&functions<2>::destroy)(types<2>::forest *p4est) = p4est_destroy;
449
450 void (&functions<2>::refine)(types<2>::forest *p4est,
451 int refine_recursive,
452 p4est_refine_t refine_fn,
453 p4est_init_t init_fn) = p4est_refine;
454
455 void (&functions<2>::coarsen)(types<2>::forest *p4est,
456 int coarsen_recursive,
457 p4est_coarsen_t coarsen_fn,
458 p4est_init_t init_fn) = p4est_coarsen;
459
460 void (&functions<2>::balance)(types<2>::forest *p4est,
461 types<2>::balance_type btype,
462 p4est_init_t init_fn) = p4est_balance;
463
464 types<2>::gloidx (&functions<2>::partition)(types<2>::forest *p4est,
465 int partition_for_coarsening,
466 p4est_weight_t weight_fn) =
467 p4est_partition_ext;
468
469 void (&functions<2>::save)(const char *filename,
470 types<2>::forest *p4est,
471 int save_data) = p4est_save;
472
473 types<2>::forest *(&functions<2>::load_ext)(
474 const char *filename,
475 MPI_Comm mpicomm,
476 std::size_t data_size,
477 int load_data,
478 int autopartition,
479 int broadcasthead,
480 void *user_pointer,
481 types<2>::connectivity **p4est) = p4est_load_ext;
482
483 int (&functions<2>::connectivity_save)(
484 const char *filename,
485 types<2>::connectivity *connectivity) = p4est_connectivity_save;
486
487 int (&functions<2>::connectivity_is_valid)(
488 types<2>::connectivity *connectivity) = p4est_connectivity_is_valid;
489
490 types<2>::connectivity *(&functions<2>::connectivity_load)(
491 const char *filename,
492 std::size_t *length) = p4est_connectivity_load;
493
494 unsigned int (&functions<2>::checksum)(types<2>::forest *p4est) =
495 p4est_checksum;
496
497 void (&functions<2>::vtk_write_file)(types<2>::forest *p4est,
498 p4est_geometry_t *,
499 const char *baseName) =
500 p4est_vtk_write_file;
501
502 types<2>::ghost *(&functions<2>::ghost_new)(types<2>::forest *p4est,
503 types<2>::balance_type btype) =
504 p4est_ghost_new;
505
506 void (&functions<2>::ghost_destroy)(types<2>::ghost *ghost) =
507 p4est_ghost_destroy;
508
509 void (&functions<2>::reset_data)(types<2>::forest *p4est,
510 std::size_t data_size,
511 p4est_init_t init_fn,
512 void *user_pointer) = p4est_reset_data;
513
514 std::size_t (&functions<2>::forest_memory_used)(types<2>::forest *p4est) =
515 p4est_memory_used;
516
517 std::size_t (&functions<2>::connectivity_memory_used)(
518 types<2>::connectivity *p4est) = p4est_connectivity_memory_used;
519
520 constexpr unsigned int functions<2>::max_level;
521
522 void (&functions<2>::transfer_fixed)(const types<2>::gloidx *dest_gfq,
523 const types<2>::gloidx *src_gfq,
524 MPI_Comm mpicomm,
525 int tag,
526 void *dest_data,
527 const void *src_data,
528 std::size_t data_size) =
529 p4est_transfer_fixed;
530
531 types<2>::transfer_context *(&functions<2>::transfer_fixed_begin)(
532 const types<2>::gloidx *dest_gfq,
533 const types<2>::gloidx *src_gfq,
534 MPI_Comm mpicomm,
535 int tag,
536 void *dest_data,
537 const void *src_data,
538 std::size_t data_size) = p4est_transfer_fixed_begin;
539
540 void (&functions<2>::transfer_fixed_end)(types<2>::transfer_context *tc) =
541 p4est_transfer_fixed_end;
542
543 void (&functions<2>::transfer_custom)(const types<2>::gloidx *dest_gfq,
544 const types<2>::gloidx *src_gfq,
545 MPI_Comm mpicomm,
546 int tag,
547 void *dest_data,
548 const int *dest_sizes,
549 const void *src_data,
550 const int *src_sizes) =
551 p4est_transfer_custom;
552
553 types<2>::transfer_context *(&functions<2>::transfer_custom_begin)(
554 const types<2>::gloidx *dest_gfq,
555 const types<2>::gloidx *src_gfq,
556 MPI_Comm mpicomm,
557 int tag,
558 void *dest_data,
559 const int *dest_sizes,
560 const void *src_data,
561 const int *src_sizes) = p4est_transfer_custom_begin;
562
563 void (&functions<2>::transfer_custom_end)(types<2>::transfer_context *tc) =
564 p4est_transfer_custom_end;
565
566 void (&functions<2>::search_partition)(
567 types<2>::forest *p4est,
568 int call_post,
569 types<2>::search_partition_callback quadrant_fn,
570 types<2>::search_partition_callback point_fn,
571 sc_array_t *points) = p4est_search_partition;
572
573 void (&functions<2>::quadrant_coord_to_vertex)(
574 types<2>::connectivity *connectivity,
575 types<2>::topidx treeid,
576 types<2>::quadrant_coord x,
577 types<2>::quadrant_coord y,
578 double vxyz[3]) = p4est_qcoord_to_vertex;
579
580 int (&functions<3>::quadrant_compare)(const void *v1, const void *v2) =
581 p8est_quadrant_compare;
582
583 void (&functions<3>::quadrant_childrenv)(const types<3>::quadrant *q,
584 types<3>::quadrant c[]) =
585 p8est_quadrant_childrenv;
586
587 int (&functions<3>::quadrant_overlaps_tree)(types<3>::tree *tree,
588 const types<3>::quadrant *q) =
589 p8est_quadrant_overlaps_tree;
590
591 void (&functions<3>::quadrant_set_morton)(types<3>::quadrant *quadrant,
592 int level,
593 std::uint64_t id) =
594 p8est_quadrant_set_morton;
595
596 void
601
602 int (&functions<3>::quadrant_is_equal)(const types<3>::quadrant *q1,
603 const types<3>::quadrant *q2) =
604 p8est_quadrant_is_equal;
605
606 int (&functions<3>::quadrant_is_sibling)(const types<3>::quadrant *q1,
607 const types<3>::quadrant *q2) =
608 p8est_quadrant_is_sibling;
609
610 int (&functions<3>::quadrant_is_ancestor)(const types<3>::quadrant *q1,
611 const types<3>::quadrant *q2) =
612 p8est_quadrant_is_ancestor;
613
614 int (&functions<3>::quadrant_ancestor_id)(const types<3>::quadrant *q,
615 int level) =
616 p8est_quadrant_ancestor_id;
617
618 int (&functions<3>::comm_find_owner)(types<3>::forest *p4est,
619 const types<3>::locidx which_tree,
620 const types<3>::quadrant *q,
621 const int guess) =
622 p8est_comm_find_owner;
623
624 types<3>::connectivity *(&functions<3>::connectivity_new)(
625 types<3>::topidx num_vertices,
626 types<3>::topidx num_trees,
627 types<3>::topidx num_edges,
628 types<3>::topidx num_ett,
629 types<3>::topidx num_corners,
630 types<3>::topidx num_ctt) = p8est_connectivity_new;
631
632 types<3>::connectivity *(&functions<3>::connectivity_new_copy)(
633 types<3>::topidx num_vertices,
634 types<3>::topidx num_trees,
635 types<3>::topidx num_edges,
636 types<3>::topidx num_corners,
637 const double *vertices,
638 const types<3>::topidx *ttv,
639 const types<3>::topidx *ttt,
640 const int8_t *ttf,
641 const types<3>::topidx *tte,
642 const types<3>::topidx *eoff,
643 const types<3>::topidx *ett,
644 const int8_t *ete,
645 const types<3>::topidx *ttc,
646 const types<3>::topidx *coff,
647 const types<3>::topidx *ctt,
648 const int8_t *ctc) = p8est_connectivity_new_copy;
649
650 void (&functions<3>::connectivity_destroy)(
651 p8est_connectivity_t *connectivity) = p8est_connectivity_destroy;
652
653 void (&functions<3>::connectivity_join_faces)(types<3>::connectivity *conn,
654 types<3>::topidx tree_left,
655 types<3>::topidx tree_right,
656 int face_left,
657 int face_right,
658 int orientation) =
659 p8est_connectivity_join_faces;
660
661 types<3>::forest *(&functions<3>::new_forest)(
662 MPI_Comm mpicomm,
663 types<3>::connectivity *connectivity,
664 types<3>::locidx min_quadrants,
665 int min_level,
666 int fill_uniform,
667 std::size_t data_size,
668 p8est_init_t init_fn,
669 void *user_pointer) = p8est_new_ext;
670
671 types<3>::forest *(&functions<3>::copy_forest)(types<3>::forest *input,
672 int copy_data) = p8est_copy;
673
674 void (&functions<3>::destroy)(types<3>::forest *p8est) = p8est_destroy;
675
676 void (&functions<3>::refine)(types<3>::forest *p8est,
677 int refine_recursive,
678 p8est_refine_t refine_fn,
679 p8est_init_t init_fn) = p8est_refine;
680
681 void (&functions<3>::coarsen)(types<3>::forest *p8est,
682 int coarsen_recursive,
683 p8est_coarsen_t coarsen_fn,
684 p8est_init_t init_fn) = p8est_coarsen;
685
686 void (&functions<3>::balance)(types<3>::forest *p8est,
687 types<3>::balance_type btype,
688 p8est_init_t init_fn) = p8est_balance;
689
690 types<3>::gloidx (&functions<3>::partition)(types<3>::forest *p8est,
691 int partition_for_coarsening,
692 p8est_weight_t weight_fn) =
693 p8est_partition_ext;
694
695 void (&functions<3>::save)(const char *filename,
696 types<3>::forest *p4est,
697 int save_data) = p8est_save;
698
699 types<3>::forest *(&functions<3>::load_ext)(
700 const char *filename,
701 MPI_Comm mpicomm,
702 std::size_t data_size,
703 int load_data,
704 int autopartition,
705 int broadcasthead,
706 void *user_pointer,
707 types<3>::connectivity **p4est) = p8est_load_ext;
708
709 int (&functions<3>::connectivity_save)(
710 const char *filename,
711 types<3>::connectivity *connectivity) = p8est_connectivity_save;
712
713 int (&functions<3>::connectivity_is_valid)(
714 types<3>::connectivity *connectivity) = p8est_connectivity_is_valid;
715
716 types<3>::connectivity *(&functions<3>::connectivity_load)(
717 const char *filename,
718 std::size_t *length) = p8est_connectivity_load;
719
720 unsigned int (&functions<3>::checksum)(types<3>::forest *p8est) =
721 p8est_checksum;
722
723 void (&functions<3>::vtk_write_file)(types<3>::forest *p8est,
724 p8est_geometry_t *,
725 const char *baseName) =
726 p8est_vtk_write_file;
727
728 types<3>::ghost *(&functions<3>::ghost_new)(types<3>::forest *p4est,
729 types<3>::balance_type btype) =
730 p8est_ghost_new;
731
732 void (&functions<3>::ghost_destroy)(types<3>::ghost *ghost) =
733 p8est_ghost_destroy;
734
735 void (&functions<3>::reset_data)(types<3>::forest *p4est,
736 std::size_t data_size,
737 p8est_init_t init_fn,
738 void *user_pointer) = p8est_reset_data;
739
740 std::size_t (&functions<3>::forest_memory_used)(types<3>::forest *p4est) =
741 p8est_memory_used;
742
743 std::size_t (&functions<3>::connectivity_memory_used)(
744 types<3>::connectivity *p4est) = p8est_connectivity_memory_used;
745
746 constexpr unsigned int functions<3>::max_level;
747
748 void (&functions<3>::transfer_fixed)(const types<3>::gloidx *dest_gfq,
749 const types<3>::gloidx *src_gfq,
750 MPI_Comm mpicomm,
751 int tag,
752 void *dest_data,
753 const void *src_data,
754 std::size_t data_size) =
755 p8est_transfer_fixed;
756
757 types<3>::transfer_context *(&functions<3>::transfer_fixed_begin)(
758 const types<3>::gloidx *dest_gfq,
759 const types<3>::gloidx *src_gfq,
760 MPI_Comm mpicomm,
761 int tag,
762 void *dest_data,
763 const void *src_data,
764 std::size_t data_size) = p8est_transfer_fixed_begin;
765
766 void (&functions<3>::transfer_fixed_end)(types<3>::transfer_context *tc) =
767 p8est_transfer_fixed_end;
768
769 void (&functions<3>::transfer_custom)(const types<3>::gloidx *dest_gfq,
770 const types<3>::gloidx *src_gfq,
771 MPI_Comm mpicomm,
772 int tag,
773 void *dest_data,
774 const int *dest_sizes,
775 const void *src_data,
776 const int *src_sizes) =
777 p8est_transfer_custom;
778
779 types<3>::transfer_context *(&functions<3>::transfer_custom_begin)(
780 const types<3>::gloidx *dest_gfq,
781 const types<3>::gloidx *src_gfq,
782 MPI_Comm mpicomm,
783 int tag,
784 void *dest_data,
785 const int *dest_sizes,
786 const void *src_data,
787 const int *src_sizes) = p8est_transfer_custom_begin;
788
789 void (&functions<3>::transfer_custom_end)(types<3>::transfer_context *tc) =
790 p8est_transfer_custom_end;
791
792 void (&functions<3>::search_partition)(
793 types<3>::forest *p4est,
794 int call_post,
795 types<3>::search_partition_callback quadrant_fn,
796 types<3>::search_partition_callback point_fn,
797 sc_array_t *points) = p8est_search_partition;
798
799 void (&functions<3>::quadrant_coord_to_vertex)(
800 types<3>::connectivity *connectivity,
801 types<3>::topidx treeid,
802 types<3>::quadrant_coord x,
803 types<3>::quadrant_coord y,
804 types<3>::quadrant_coord z,
805 double vxyz[3]) = p8est_qcoord_to_vertex;
806
807 template <int dim>
808 void
809 init_quadrant_children(
810 const typename types<dim>::quadrant &p4est_cell,
811 typename types<dim>::quadrant (
812 &p4est_children)[::GeometryInfo<dim>::max_children_per_cell])
813 {
814 for (unsigned int c = 0;
815 c < ::GeometryInfo<dim>::max_children_per_cell;
816 ++c)
817 functions<dim>::quadrant_init(p4est_children[c]);
818
819 functions<dim>::quadrant_childrenv(&p4est_cell, p4est_children);
820 }
821
822 template <int dim>
823 void
824 init_coarse_quadrant(typename types<dim>::quadrant &quad)
825 {
826 functions<dim>::quadrant_init(quad);
827 functions<dim>::quadrant_set_morton(&quad,
828 /*level=*/0,
829 /*index=*/0);
830 }
831
832 template <int dim>
833 bool
834 quadrant_is_equal(const typename types<dim>::quadrant &q1,
835 const typename types<dim>::quadrant &q2)
836 {
837 return functions<dim>::quadrant_is_equal(&q1, &q2);
838 }
839
840
841
842 template <int dim>
843 bool
844 quadrant_is_ancestor(const typename types<dim>::quadrant &q1,
845 const typename types<dim>::quadrant &q2)
846 {
847 return functions<dim>::quadrant_is_ancestor(&q1, &q2);
848 }
849
850 template <int dim>
851 bool
852 tree_exists_locally(const typename types<dim>::forest *parallel_forest,
853 const typename types<dim>::topidx coarse_grid_cell)
854 {
855 Assert(coarse_grid_cell < parallel_forest->connectivity->num_trees,
856 ExcInternalError());
857 return ((coarse_grid_cell >= parallel_forest->first_local_tree) &&
858 (coarse_grid_cell <= parallel_forest->last_local_tree));
859 }
860
861
862
863 // template specializations
864
865 template <>
866 typename types<2>::connectivity *
867 copy_connectivity<2>(const typename types<2>::connectivity *connectivity)
868 {
869 return functions<2>::connectivity_new_copy(
870 connectivity->num_vertices,
871 connectivity->num_trees,
872 connectivity->num_corners,
873 connectivity->vertices,
874 connectivity->tree_to_vertex,
875 connectivity->tree_to_tree,
876 connectivity->tree_to_face,
877 connectivity->tree_to_corner,
878 connectivity->ctt_offset,
879 connectivity->corner_to_tree,
880 connectivity->corner_to_corner);
881 }
882
883 template <>
884 typename types<3>::connectivity *
885 copy_connectivity<3>(const typename types<3>::connectivity *connectivity)
886 {
887 return functions<3>::connectivity_new_copy(
888 connectivity->num_vertices,
889 connectivity->num_trees,
890 connectivity->num_edges,
891 connectivity->num_corners,
892 connectivity->vertices,
893 connectivity->tree_to_vertex,
894 connectivity->tree_to_tree,
895 connectivity->tree_to_face,
896 connectivity->tree_to_edge,
897 connectivity->ett_offset,
898 connectivity->edge_to_tree,
899 connectivity->edge_to_edge,
900 connectivity->tree_to_corner,
901 connectivity->ctt_offset,
902 connectivity->corner_to_tree,
903 connectivity->corner_to_corner);
904 }
905
906
907
908 template <>
909 bool
910 quadrant_is_equal<1>(const typename types<1>::quadrant &q1,
911 const typename types<1>::quadrant &q2)
912 {
913 return q1 == q2;
914 }
915
916
917
918 template <>
919 bool
920 quadrant_is_ancestor<1>(const types<1>::quadrant &q1,
921 const types<1>::quadrant &q2)
922 {
923 // determine level of quadrants
924 const int level_1 = (q1 << types<1>::max_n_child_indices_bits) >>
925 types<1>::max_n_child_indices_bits;
926 const int level_2 = (q2 << types<1>::max_n_child_indices_bits) >>
927 types<1>::max_n_child_indices_bits;
928
929 // q1 can be an ancestor of q2 if q1's level is smaller
930 if (level_1 >= level_2)
931 return false;
932
933 // extract path of quadrants up to level of possible ancestor q1
934 const int truncated_id_1 = (q1 >> (types<1>::n_bits - 1 - level_1))
935 << (types<1>::n_bits - 1 - level_1);
936 const int truncated_id_2 = (q2 >> (types<1>::n_bits - 1 - level_1))
937 << (types<1>::n_bits - 1 - level_1);
938
939 // compare paths
940 return truncated_id_1 == truncated_id_2;
941 }
942
943
944
945 template <>
946 void
947 init_quadrant_children<1>(
948 const typename types<1>::quadrant &q,
949 typename types<1>::quadrant (
950 &p4est_children)[::GeometryInfo<1>::max_children_per_cell])
951 {
952 // determine the current level of quadrant
953 const int level_parent = (q << types<1>::max_n_child_indices_bits) >>
954 types<1>::max_n_child_indices_bits;
955 const int level_child = level_parent + 1;
956
957 // left child: only n_child_indices has to be incremented
958 p4est_children[0] = (q + 1);
959
960 // right child: increment and set a bit to 1 indicating that it is a right
961 // child
962 p4est_children[1] = (q + 1) | (1 << (types<1>::n_bits - 1 - level_child));
963 }
964
965
966
967 template <>
968 void
969 init_coarse_quadrant<1>(typename types<1>::quadrant &quad)
970 {
971 quad = 0;
972 }
973
974 } // namespace p4est
975} // namespace internal
976
977#endif // DEAL_II_WITH_P4EST
978
979/*-------------- Explicit Instantiations -------------------------------*/
980#include "distributed/p4est_wrappers.inst"
981
982
983DEAL_II_NAMESPACE_CLOSE
MPI_Comm
DEAL_II_NAMESPACE_OPEN
#define DEAL_II_NAMESPACE_OPEN
Definition config.h:38
DEAL_II_NAMESPACE_CLOSE
#define DEAL_II_NAMESPACE_CLOSE
Definition config.h:39
Assert
#define Assert(cond, exc)
Definition exception_macros.h:543
StandardExceptions::ExcInternalError
static ::ExceptionBase & ExcInternalError()
StandardExceptions::ExcMessage
static ::ExceptionBase & ExcMessage(std::string arg1)
internal::p4est::init_quadrant_children< 1 >
void init_quadrant_children< 1 >(const typename types< 1 >::quadrant &q, typename types< 1 >::quadrant(&p4est_children)[::GeometryInfo< 1 >::max_children_per_cell])
Definition p4est_wrappers.cc:947
internal::p4est::init_coarse_quadrant
void init_coarse_quadrant(typename types< dim >::quadrant &quad)
Definition p4est_wrappers.cc:824
internal::p4est::quadrant_is_equal< 1 >
bool quadrant_is_equal< 1 >(const typename types< 1 >::quadrant &q1, const typename types< 1 >::quadrant &q2)
Definition p4est_wrappers.cc:910
internal::p4est::copy_connectivity< 2 >
types< 2 >::connectivity * copy_connectivity< 2 >(const typename types< 2 >::connectivity *connectivity)
Definition p4est_wrappers.cc:867
internal::p4est::quadrant_is_ancestor< 1 >
bool quadrant_is_ancestor< 1 >(const types< 1 >::quadrant &q1, const types< 1 >::quadrant &q2)
Definition p4est_wrappers.cc:920
internal::p4est::copy_connectivity< 3 >
types< 3 >::connectivity * copy_connectivity< 3 >(const typename types< 3 >::connectivity *connectivity)
Definition p4est_wrappers.cc:885
internal::p4est::quadrant_is_equal
bool quadrant_is_equal(const typename types< dim >::quadrant &q1, const typename types< dim >::quadrant &q2)
Definition p4est_wrappers.cc:834
internal::p4est::init_quadrant_children
void init_quadrant_children(const typename types< dim >::quadrant &p4est_cell, typename types< dim >::quadrant(&p4est_children)[::GeometryInfo< dim >::max_children_per_cell])
Definition p4est_wrappers.cc:809
internal::p4est::quadrant_is_ancestor
bool quadrant_is_ancestor(const typename types< dim >::quadrant &q1, const typename types< dim >::quadrant &q2)
Definition p4est_wrappers.cc:844
internal::p4est::init_coarse_quadrant< 1 >
void init_coarse_quadrant< 1 >(typename types< 1 >::quadrant &quad)
Definition p4est_wrappers.cc:969
internal::p4est::tree_exists_locally
bool tree_exists_locally(const typename types< dim >::forest *parallel_forest, const typename types< dim >::topidx coarse_grid_cell)
Definition p4est_wrappers.cc:852
types::subdomain_id
unsigned int subdomain_id
Definition types.h:50
types::global_dof_index
unsigned int global_dof_index
Definition types.h:92
P8EST_QUADRANT_INIT
#define P8EST_QUADRANT_INIT(q)
Definition p4est_wrappers.cc:35
P4EST_QUADRANT_INIT
#define P4EST_QUADRANT_INIT(q)
Definition p4est_wrappers.cc:30
p4est_wrappers.h
GeometryInfo::max_children_per_cell
static constexpr unsigned int max_children_per_cell
Definition geometry_info.h:1979
Generated by doxygen 1.16.1