#include "base/cs_defs.h"#include <ctime>#include "base/cs_all_to_all.h"#include "base/cs_order.h"#include "base/cs_renumber_update.h"#include "base/cs_field.h"#include "base/cs_boundary_conditions.h"#include "base/cs_sort.h"#include "mesh/cs_mesh.h"#include "mesh/cs_mesh_quantities.h"#include "alge/cs_cell_to_vertex.h"#include "alge/cs_gradient.h"#include "mesh/cs_redistribute.h"
Include dependency graph for cs_redistribute.cpp:Functions | |
| void | cs_distributor_destroy (cs_distributor_t **db) |
| Destroy a distributor structure. More... | |
| void | cs_redistribute (const int cell_dest_rank[], cs_distributor_t **cell_db, cs_distributor_t **i_face_db, cs_distributor_t **b_face_db, cs_distributor_t **vertex_db) |
| Redistribute mesh and field data based on a cell destination rank map. More... | |
| void cs_distributor_destroy | ( | cs_distributor_t ** | db | ) |
Destroy a distributor structure.
| [in,out] | db | pointer of pointer to a cs_distributor_structure |
| void cs_redistribute | ( | const int | cell_dest_rank[], |
| cs_distributor_t ** | cell_db, | ||
| cs_distributor_t ** | i_face_db, | ||
| cs_distributor_t ** | b_face_db, | ||
| cs_distributor_t ** | vertex_db | ||
| ) |
Redistribute mesh and field data based on a cell destination rank map.
If no cell map is given, a random one is created internally.
The different distributors are returned if any of the pointers are not null. In this case, it is up to the caller to free them whenever they are no longer needed.
| [in] | cell_dest_rank | destination rank for each cell |
| [out] | cell_db | pointer of pointer to cell redistributor |
| [out] | i_face_db | pointer of pointer to interior face redistributor |
| [out] | b_face_db | pointer of pointer to boundary face redistributor |
| [out] | vertex_db | pointer of pointer to vertex redistributor |