p6est_ghost.h

Go to the documentation of this file.

/*
  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 P6EST_GHOST_H
#define P6EST_GHOST_H
 
#include <p6est.h>
#include <p4est_ghost.h>
 
SC_EXTERN_C_BEGIN;
 
typedef struct p6est_ghost
{
  int                 mpisize;
  p4est_topidx_t      num_trees;
  p4est_connect_type_t btype; 
  p4est_ghost_t      *column_ghost; 
  sc_array_t         *column_layer_offsets; 
  sc_array_t          ghosts; 
  p4est_locidx_t     *tree_offsets;     
  p4est_locidx_t     *proc_offsets;     
  sc_array_t          mirrors; 
  p4est_locidx_t     *mirror_tree_offsets;      
  p4est_locidx_t     *mirror_proc_mirrors;      
  p4est_locidx_t     *mirror_proc_offsets;      
  p4est_locidx_t     *mirror_proc_fronts;       
  p4est_locidx_t     *mirror_proc_front_offsets;        
}
p6est_ghost_t;
 
size_t              p6est_ghost_memory_used (p6est_ghost_t * ghost);
 
p6est_ghost_t      *p6est_ghost_new (p6est_t * p4est,
                                     p4est_connect_type_t btype);
 
void                p6est_ghost_expand (p6est_t * p6est,
                                        p6est_ghost_t * ghost);
 
void                p6est_ghost_destroy (p6est_ghost_t * ghost);
 
ssize_t             p6est_ghost_bsearch (p6est_ghost_t * ghost,
                                         int which_proc,
                                         p4est_topidx_t which_tree,
                                         const p4est_quadrant_t * column,
                                         const p2est_quadrant_t * layer);
 
ssize_t             p6est_ghost_contains (p6est_ghost_t * ghost,
                                          int which_proc,
                                          p4est_topidx_t which_tree,
                                          const p4est_quadrant_t * column,
                                          const p2est_quadrant_t * layer);
 
int                 p6est_layer_exists (p6est_t * p6est,
                                        p6est_ghost_t * ghost,
                                        p4est_topidx_t treeid,
                                        const p4est_quadrant_t * column,
                                        const p2est_quadrant_t * layer,
                                        sc_array_t * exists_arr,
                                        sc_array_t * rproc_arr,
                                        sc_array_t * rquad_arr);
 
int                 p6est_is_balanced (p6est_t * p6est,
                                       p8est_connect_type_t btype);
 
unsigned            p6est_ghost_checksum (p6est_t * p6est,
                                          p6est_ghost_t * ghost);
 
SC_EXTERN_C_END;
 
#endif /* P6EST_GHOST_H */