-
Notifications
You must be signed in to change notification settings - Fork 114
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #248 from SAutum/develop
example: two crashed examples
- Loading branch information
Showing
6 changed files
with
282 additions
and
25 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,142 @@ | ||
| /* | ||
| 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. | ||
| */ | ||
|
|
||
| #ifndef P4_TO_P8 | ||
| #include <p4est_bits.h> | ||
| #include <p4est_extended.h> | ||
| #include <p4est_vtk.h> | ||
| #else | ||
| #include <p8est_bits.h> | ||
| #include <p8est_extended.h> | ||
| #include <p8est_vtk.h> | ||
| #endif | ||
|
|
||
| typedef struct | ||
| { | ||
| sc_MPI_Comm mpicomm; | ||
| int mpisize; | ||
| int mpirank; | ||
| } | ||
| mpi_context_t; | ||
|
|
||
| /* refinement level initialization */ | ||
| static int refine_level = 0; | ||
|
|
||
| /* refinement function */ | ||
| static int | ||
| refine_fn (p4est_t * p4est, p4est_topidx_t which_tree, | ||
| p4est_quadrant_t * quadrant) | ||
| { | ||
| if ((int) quadrant->level >= (refine_level - (int) (which_tree % 3))) { | ||
| return 0; | ||
| } | ||
| if (quadrant->level == 1 && p4est_quadrant_child_id (quadrant) == 3) { | ||
| return 1; | ||
| } | ||
| 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; | ||
| } | ||
|
|
||
| int | ||
| main (int argc, char **argv) | ||
| { | ||
| int mpiret; | ||
| int wrongusage; | ||
| const char *usage; | ||
| p4est_connectivity_t *connectivity; | ||
| mpi_context_t mpi_context, *mpi = &mpi_context; | ||
| p4est_geometry_t *geom; | ||
| p4est_t *p4est; | ||
|
|
||
| /* initialize MPI and p4est internals */ | ||
| mpiret = sc_MPI_Init (&argc, &argv); | ||
| SC_CHECK_MPI (mpiret); | ||
| mpi->mpicomm = sc_MPI_COMM_WORLD; | ||
| mpiret = sc_MPI_Comm_size (mpi->mpicomm, &mpi->mpisize); | ||
| SC_CHECK_MPI (mpiret); | ||
| mpiret = sc_MPI_Comm_rank (mpi->mpicomm, &mpi->mpirank); | ||
| SC_CHECK_MPI (mpiret); | ||
|
|
||
| sc_init (mpi->mpicomm, 1, 1, NULL, SC_LP_DEFAULT); | ||
| p4est_init (NULL, SC_LP_DEFAULT); | ||
|
|
||
| /* usage error if the input is not in the correct format */ | ||
| usage = | ||
| "Arguments: <level>\n" | ||
| " Level: controls the maximum depth of refinement\n"; | ||
| wrongusage = 0; | ||
| if (!wrongusage && argc != 2) { | ||
| wrongusage = 1; | ||
| } | ||
| if (wrongusage) { | ||
| P4EST_GLOBAL_LERROR (usage); | ||
| sc_abort_collective ("Usage error"); | ||
| } | ||
|
|
||
| /* assign variables based on configuration */ | ||
| refine_level = atoi (argv[1]); | ||
|
|
||
| /* create connectivity and forest structures */ | ||
| geom = NULL; | ||
| #ifndef P4_TO_P8 | ||
| /* this 2D connectivity is challenging for the balance algorithm */ | ||
| connectivity = p4est_connectivity_new_bowtie (); | ||
| #else | ||
| /* this 3D connectivity is challenging for the balance algorithm */ | ||
| connectivity = p8est_connectivity_new_drop (); | ||
| #endif | ||
| p4est = p4est_new_ext (mpi->mpicomm, connectivity, 0, 0, 1, 0, NULL, geom); | ||
| p4est_vtk_write_file (p4est, geom, P4EST_STRING "_corner_new"); | ||
|
|
||
| /* refinement */ | ||
| p4est_refine (p4est, 1, refine_fn, NULL); | ||
| p4est_vtk_write_file (p4est, geom, P4EST_STRING "_corner_refine"); | ||
|
|
||
| /* balance */ | ||
| p4est_balance (p4est, P4EST_CONNECT_FULL, NULL); | ||
| p4est_vtk_write_file (p4est, geom, P4EST_STRING "_corner_balance"); | ||
|
|
||
| /* partition */ | ||
| p4est_partition (p4est, 0, NULL); | ||
| p4est_vtk_write_file (p4est, geom, P4EST_STRING "_corner_partition"); | ||
|
|
||
| /* destroy p4est and its connectivity */ | ||
| p4est_destroy (p4est); | ||
| p4est_connectivity_destroy (connectivity); | ||
|
|
||
| /* clean up and exit */ | ||
| sc_finalize (); | ||
|
|
||
| mpiret = sc_MPI_Finalize (); | ||
| SC_CHECK_MPI (mpiret); | ||
|
|
||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,26 @@ | ||
| /* | ||
| 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. | ||
| */ | ||
|
|
||
| #include <p4est_to_p8est.h> | ||
| #include "balance_corner2.c" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.