/usr/include/vtk-7.1/vtkStructuredImplicitConnectivity.h is in libvtk7-dev 7.1.1+dfsg1-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 | /*=========================================================================
Program: Visualization Toolkit
Module: vtkStructuredImplicitConnectivity.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/**
* @class vtkStructuredImplicitConnectivity
* a distributed structured dataset that is implicitly connected among
* partitions without abutting. This creates a gap between partitions and
* introduces a cell that spans multiple zones. This typically arises with
* finite difference grids, which are partitioned with respect to the
* nodes of the grid, or, when a filter samples the grid, e.g., to get a
* lower resolution representation.
*
*
* This class is intended as a lower-level helper for higher level VTK filters
* that provides functionality for resolving the implicit connectivity (gap)
* between two or more partitions of a distributed structured dataset.
*
* @warning
* The present implementation requires:
* <ul>
* <li> one block/grid per rank. </li>
* <li> 2-D (XY,YZ or XZ planes) or 3-D datasets. </li>
* <li> node-center fields must match across processes. </li>
* </ul>
*
*/
#ifndef vtkStructuredImplicitConnectivity_h
#define vtkStructuredImplicitConnectivity_h
#include "vtkFiltersParallelMPIModule.h" // For export macro
#include "vtkObject.h"
// Forward declarations
class vtkDataArray;
class vtkImageData;
class vtkMPIController;
class vtkMultiProcessStream;
class vtkPointData;
class vtkPoints;
class vtkRectilinearGrid;
class vtkStructuredGrid;
namespace vtk
{
namespace detail
{
class CommunicationManager;
struct DomainMetaData;
struct StructuredGrid;
} // END namespace detail
} // END namespace vtk
class VTKFILTERSPARALLELMPI_EXPORT vtkStructuredImplicitConnectivity :
public vtkObject
{
public:
static vtkStructuredImplicitConnectivity* New();
void PrintSelf(ostream& os, vtkIndent indent);
vtkTypeMacro(vtkStructuredImplicitConnectivity,vtkObject);
/**
* \brief Sets the whole extent for the distributed structured domain.
* \param wholeExt the extent of the entire domain (in).
* \note All ranks must call this method with the same whole extent.
* \post this->DomainInfo != NULL
*/
void SetWholeExtent(int wholeExt[6]);
// \brief Registers the structured grid dataset belonging to this process.
// \param gridID the ID of the grid in this rank.
// \param extent the [imin,imax,jmin,jmax,kmin,kmax] of the grid.
// \param gridPnts pointer to the points of the grid (NULL for uniform grid).
// \param pointData pointer to the node-centered fields of the grid.
// \pre gridID >= 0. The code uses values of gridID < -1 as flag internally.
// \pre vtkStructuredExtent::Smaller(extent,wholeExtent) == true.
// \note A rank with no or an empty grid, should not call this method.
void RegisterGrid(
const int gridID,
int extent[6],
vtkPoints* gridPnts,
vtkPointData* pointData
);
// \brief Registers the rectilinear grid dataset belonging to this process.
// \param gridID the ID of the in this rank.
// \param extent the [imin,imax,jmin,jmax,kmin,kmax] of the grid.
// \param xcoords the x-coordinates array of the rectilinear grid.
// \param ycoords the y-coordinates array of the rectilinear grid.
// \param zcoords the z-coordinates array of the rectilinear grid.
// \param pointData pointer to the node-centered fields of the grid.
// \pre gridID >= 0. The code uses values of gridID < -1 as flag internally.
// \pre vtkStructuredExtent::Smaller(extent,wholeExtent) == true.
// \note A rank with no or an empty grid, should not call this method.
void RegisterRectilinearGrid(
const int gridID,
int extent[6],
vtkDataArray* xcoords,
vtkDataArray* ycoords,
vtkDataArray* zcoords,
vtkPointData* pointData
);
/**
* \brief Finds implicit connectivity for a distributed structured dataset.
* \note This is a collective operation, all ranks must call this method.
* \pre this->Controller != NULL
* \pre this->DomainInfo != NULL
*/
void EstablishConnectivity();
/**
* \brief Checks if there is implicit connectivity.
* \return status true if implicit connectivity in one or more dimensions.
*/
bool HasImplicitConnectivity();
/**
* \brief Exchanges one layer (row or column) of data between neighboring
* grids to fix the implicit connectivity.
* \note This is a collective operation, all ranks must call this method.
* \pre this->Controller != NULL
* \pre this->DomainInfo != NULL
*/
void ExchangeData();
/**
* \brief Gets the output structured grid instance on this process.
* \param gridID the ID of the grid
* \param grid pointer to data-structure where to store the output.
*/
void GetOutputStructuredGrid(const int gridID, vtkStructuredGrid* grid);
/**
* \brief Gets the output uniform grid instance on this process.
* \param gridID the ID of the grid.
* \param grid pointer to data-structure where to store the output.
*/
void GetOutputImageData(const int gridID, vtkImageData* grid);
/**
* \brief Gets the output rectilinear grid instance on this process.
* \param gridID the ID of the grid.
* \param grid pointer to data-structure where to store the output.
*/
void GetOutputRectilinearGrid(const int gridID, vtkRectilinearGrid* grid);
protected:
vtkStructuredImplicitConnectivity();
virtual ~vtkStructuredImplicitConnectivity();
vtkMPIController* Controller;
vtk::detail::DomainMetaData* DomainInfo;
vtk::detail::StructuredGrid* InputGrid;
vtk::detail::StructuredGrid* OutputGrid;
vtk::detail::CommunicationManager* CommManager;
/**
* \brief Checks if the data description matches globally.
*/
bool GlobalDataDescriptionMatch();
/**
* \brief Packs the data to send into a bytestream
*/
void PackData(int ext[6], vtkMultiProcessStream& bytestream);
/**
* \brief Unpacks the data to the output grid
*/
void UnPackData(unsigned char* buffer, unsigned int size);
/**
* \brief Allocates send/rcv buffers needed to carry out the communication.
*/
void AllocateBuffers(const int dim);
/**
* \brief Computes the neighbors with implicit connectivity.
*/
void ComputeNeighbors();
/**
* \brief Constructs the output data-structures.
*/
void ConstructOutput();
/**
* \brief Grows grid along a given dimension.
* \param dim the dimension in query.
*/
void GrowGrid(const int dim);
/**
* \brief Updates the list of neighbors after growing the grid along the
* given dimension dim.
* \param dim the dimension in query.
*/
void UpdateNeighborList(const int dim);
/**
* \brief Gets whether there is implicit connectivity across all processes.
*/
void GetGlobalImplicitConnectivityState();
/**
* \brief Exchanges extents among processes.
* \pre this->Controller != NULL.
* \note This method is collective operation. All ranks must call it.
*/
void ExchangeExtents();
private:
vtkStructuredImplicitConnectivity(const vtkStructuredImplicitConnectivity&) VTK_DELETE_FUNCTION;
void operator=(const vtkStructuredImplicitConnectivity&) VTK_DELETE_FUNCTION;
};
#endif
|