mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-10-05 01:49:02 +00:00
Merge topic 'add_hdf5_reader'
44c276174 Remove bad import and fix warning in ContourTreeAppDataIO.h 113e6be32 Remove bad import in ContourTreeApp distributed 27d3d403f Remove bade import in streamline_mpi example 0e5aeb10f Update contour_tree_distributed/CMakeLists.txt 565772854 Merge branch 'master' into add_hdf5_reader fbc313186 Fix error in ContourTreeAppDataIO 63ec3f3bc Updated contour tree distributed IO to use CellSetStructured b0952365f Merge remote-tracking branch 'origin/master' into add_hdf5_reader ... Acked-by: Kitware Robot <kwrobot@kitware.com> Merge-request: !2802
This commit is contained in:
commit
146b051436
@ -59,7 +59,7 @@ find_package(VTKm REQUIRED QUIET)
|
|||||||
# MPI
|
# MPI
|
||||||
####################################
|
####################################
|
||||||
if (VTKm_ENABLE_MPI AND TARGET vtkm::filter_scalar_topology AND TARGET vtkm::io)
|
if (VTKm_ENABLE_MPI AND TARGET vtkm::filter_scalar_topology AND TARGET vtkm::io)
|
||||||
add_executable(ContourTree_Distributed ContourTreeApp.cxx)
|
add_executable(ContourTree_Distributed ContourTreeApp.cxx ContourTreeAppDataIO.h)
|
||||||
target_link_libraries(ContourTree_Distributed vtkm::filter_scalar_topology vtkm::io MPI::MPI_CXX)
|
target_link_libraries(ContourTree_Distributed vtkm::filter_scalar_topology vtkm::io MPI::MPI_CXX)
|
||||||
vtkm_add_target_information(ContourTree_Distributed
|
vtkm_add_target_information(ContourTree_Distributed
|
||||||
MODIFY_CUDA_FLAGS
|
MODIFY_CUDA_FLAGS
|
||||||
@ -76,13 +76,18 @@ if (VTKm_ENABLE_MPI AND TARGET vtkm::filter_scalar_topology AND TARGET vtkm::io)
|
|||||||
if (TARGET vtkm::tbb)
|
if (TARGET vtkm::tbb)
|
||||||
target_compile_definitions(ContourTree_Distributed PRIVATE "ENABLE_SET_NUM_THREADS")
|
target_compile_definitions(ContourTree_Distributed PRIVATE "ENABLE_SET_NUM_THREADS")
|
||||||
endif()
|
endif()
|
||||||
|
if (VTKm_ENABLE_HDF5_IO)
|
||||||
|
target_compile_definitions(ContourTree_Distributed PRIVATE "ENABLE_HDFIO")
|
||||||
|
target_include_directories(ContourTree_Distributed PRIVATE ${HDF5_INCLUDE_DIR})
|
||||||
|
target_link_libraries(ContourTree_Distributed ${HDF5_LIBRARIES})
|
||||||
|
endif ()
|
||||||
|
|
||||||
add_executable(TreeCompiler TreeCompilerApp.cxx)
|
add_executable(TreeCompiler TreeCompilerApp.cxx)
|
||||||
target_link_libraries(TreeCompiler vtkm::filter_core)
|
target_link_libraries(TreeCompiler vtkm::filter_core)
|
||||||
vtkm_add_target_information(TreeCompiler DROP_UNUSED_SYMBOLS)
|
vtkm_add_target_information(TreeCompiler DROP_UNUSED_SYMBOLS)
|
||||||
|
|
||||||
add_executable(BranchCompiler BranchCompilerApp.cxx)
|
add_executable(BranchCompiler BranchCompilerApp.cxx)
|
||||||
target_link_libraries(BranchCompiler vtkm::filter)
|
target_link_libraries(BranchCompiler vtkm::filter_scalar_topology)
|
||||||
vtkm_add_target_information(BranchCompiler DROP_UNUSED_SYMBOLS)
|
vtkm_add_target_information(BranchCompiler DROP_UNUSED_SYMBOLS)
|
||||||
|
|
||||||
configure_file(split_data_2d.py split_data_2d.py COPYONLY)
|
configure_file(split_data_2d.py split_data_2d.py COPYONLY)
|
||||||
|
@ -64,13 +64,14 @@
|
|||||||
#include <vtkm/cont/ArrayHandle.h>
|
#include <vtkm/cont/ArrayHandle.h>
|
||||||
#include <vtkm/cont/DataSet.h>
|
#include <vtkm/cont/DataSet.h>
|
||||||
#include <vtkm/cont/DataSetBuilderUniform.h>
|
#include <vtkm/cont/DataSetBuilderUniform.h>
|
||||||
#include <vtkm/cont/DataSetFieldAdd.h>
|
|
||||||
#include <vtkm/cont/DeviceAdapterTag.h>
|
#include <vtkm/cont/DeviceAdapterTag.h>
|
||||||
#include <vtkm/cont/Initialize.h>
|
#include <vtkm/cont/Initialize.h>
|
||||||
#include <vtkm/cont/RuntimeDeviceTracker.h>
|
#include <vtkm/cont/RuntimeDeviceTracker.h>
|
||||||
#include <vtkm/cont/Timer.h>
|
#include <vtkm/cont/Timer.h>
|
||||||
#include <vtkm/io/BOVDataSetReader.h>
|
#include <vtkm/io/BOVDataSetReader.h>
|
||||||
|
|
||||||
|
#include "ContourTreeAppDataIO.h"
|
||||||
|
|
||||||
#include <vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h>
|
#include <vtkm/filter/scalar_topology/ContourTreeUniformDistributed.h>
|
||||||
#include <vtkm/filter/scalar_topology/DistributedBranchDecompositionFilter.h>
|
#include <vtkm/filter/scalar_topology/DistributedBranchDecompositionFilter.h>
|
||||||
#include <vtkm/filter/scalar_topology/worklet/branch_decomposition/HierarchicalVolumetricBranchDecomposer.h>
|
#include <vtkm/filter/scalar_topology/worklet/branch_decomposition/HierarchicalVolumetricBranchDecomposer.h>
|
||||||
@ -98,7 +99,7 @@ VTKM_THIRDPARTY_POST_INCLUDE
|
|||||||
#include <utility>
|
#include <utility>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
using ValueType = vtkm::Float64;
|
using ValueType = vtkm::Float32;
|
||||||
|
|
||||||
#define SINGLE_FILE_STDOUT_STDERR
|
#define SINGLE_FILE_STDOUT_STDERR
|
||||||
|
|
||||||
@ -272,6 +273,48 @@ int main(int argc, char* argv[])
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#ifdef ENABLE_HDFIO
|
||||||
|
std::string dataset_name = "data";
|
||||||
|
if (parser.hasOption("--dataset"))
|
||||||
|
{
|
||||||
|
dataset_name = parser.getOption("--dataset");
|
||||||
|
}
|
||||||
|
|
||||||
|
vtkm::Id3 blocksPerDimIn(1, 1, size);
|
||||||
|
if (parser.hasOption("--blocksPerDim"))
|
||||||
|
{
|
||||||
|
std::string temp = parser.getOption("--blocksPerDim");
|
||||||
|
if (std::count(temp.begin(), temp.end(), ',') != 2)
|
||||||
|
{
|
||||||
|
std::cerr << "Invalid --blocksPerDim option. Expected string of the form 'x,y,z' got" << temp
|
||||||
|
<< std::endl;
|
||||||
|
MPI_Finalize();
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
char* tempC = (char*)temp.c_str();
|
||||||
|
blocksPerDimIn[0] = std::stoi(std::strtok(tempC, ","));
|
||||||
|
blocksPerDimIn[1] = std::stoi(std::strtok(nullptr, ","));
|
||||||
|
blocksPerDimIn[2] = std::stoi(std::strtok(nullptr, ","));
|
||||||
|
}
|
||||||
|
|
||||||
|
vtkm::Id3 selectSize(-1, -1, -1);
|
||||||
|
if (parser.hasOption("--selectSize"))
|
||||||
|
{
|
||||||
|
std::string temp = parser.getOption("--selectSize");
|
||||||
|
if (std::count(temp.begin(), temp.end(), ',') != 2)
|
||||||
|
{
|
||||||
|
std::cerr << "Invalid --selectSize option. Expected string of the form 'x,y,z' got" << temp
|
||||||
|
<< std::endl;
|
||||||
|
MPI_Finalize();
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
char* tempC = (char*)temp.c_str();
|
||||||
|
selectSize[0] = std::stoi(std::strtok(tempC, ","));
|
||||||
|
selectSize[1] = std::stoi(std::strtok(nullptr, ","));
|
||||||
|
selectSize[2] = std::stoi(std::strtok(nullptr, ","));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
if (argc < 2 || parser.hasOption("--help") || parser.hasOption("-h"))
|
if (argc < 2 || parser.hasOption("--help") || parser.hasOption("-h"))
|
||||||
{
|
{
|
||||||
if (rank == 0)
|
if (rank == 0)
|
||||||
@ -307,11 +350,24 @@ int main(int argc, char* argv[])
|
|||||||
<< " computation (Default=False). " << std::endl;
|
<< " computation (Default=False). " << std::endl;
|
||||||
std::cout << "--saveOutputData Save data files with hierarchical tree or volume data"
|
std::cout << "--saveOutputData Save data files with hierarchical tree or volume data"
|
||||||
<< std::endl;
|
<< std::endl;
|
||||||
std::cout << "--numBlocks Number of blocks to use during computation "
|
std::cout << "--numBlocks Number of blocks to use during computation. (Sngle block "
|
||||||
|
"ASCII/BOV file reader only)"
|
||||||
<< "(Default=number of MPI ranks.)" << std::endl;
|
<< "(Default=number of MPI ranks.)" << std::endl;
|
||||||
std::cout << "--forwardSummary Forward the summary timings also to the per-rank " << std::endl
|
std::cout << "--forwardSummary Forward the summary timings also to the per-rank " << std::endl
|
||||||
<< " log files. Default is to round-robin print the " << std::endl
|
<< " log files. Default is to round-robin print the " << std::endl
|
||||||
<< " summary instead" << std::endl;
|
<< " summary instead" << std::endl;
|
||||||
|
#ifdef ENABLE_HDFIO
|
||||||
|
std::cout << "--dataset Name of the dataset to load (HDF5 reader only)(Default=data)"
|
||||||
|
<< std::endl;
|
||||||
|
std::cout << "--blocksPerDim Number of blocks to split the data into. This is a string of "
|
||||||
|
"the form 'x,y,z'."
|
||||||
|
"(HDF5 reader only)(Default='1,1,#ranks')"
|
||||||
|
<< std::endl;
|
||||||
|
std::cout
|
||||||
|
<< "--selectSize Size of the subblock to read. This is a string of the form 'x,y,z'."
|
||||||
|
"(HDF5 reader only)(Default='-1,-1,-1')"
|
||||||
|
<< std::endl;
|
||||||
|
#endif
|
||||||
std::cout << std::endl;
|
std::cout << std::endl;
|
||||||
}
|
}
|
||||||
MPI_Finalize();
|
MPI_Finalize();
|
||||||
@ -334,7 +390,15 @@ int main(int argc, char* argv[])
|
|||||||
<< computeHierarchicalVolumetricBranchDecomposition << std::endl
|
<< computeHierarchicalVolumetricBranchDecomposition << std::endl
|
||||||
<< " saveOutputData=" << saveOutputData << std::endl
|
<< " saveOutputData=" << saveOutputData << std::endl
|
||||||
<< " forwardSummary=" << forwardSummary << std::endl
|
<< " forwardSummary=" << forwardSummary << std::endl
|
||||||
<< " nblocks=" << numBlocks << std::endl);
|
<< " nblocks=" << numBlocks << std::endl
|
||||||
|
#ifdef ENABLE_HDFIO
|
||||||
|
<< " dataset=" << dataset_name << " (HDF5 only)" << std::endl
|
||||||
|
<< " blocksPerDim=" << blocksPerDimIn[0] << "," << blocksPerDimIn[1] << ","
|
||||||
|
<< blocksPerDimIn[2] << " (HDF5 only)" << std::endl
|
||||||
|
<< " selectSize=" << selectSize[0] << "," << selectSize[1] << ","
|
||||||
|
<< selectSize[2] << " (HDF5 only)" << std::endl
|
||||||
|
#endif
|
||||||
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Redirect stdout to file if we are using MPI with Debugging
|
// Redirect stdout to file if we are using MPI with Debugging
|
||||||
@ -376,6 +440,30 @@ int main(int argc, char* argv[])
|
|||||||
return 255;
|
return 255;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
VTKM_LOG_S(exampleLogLevel,
|
||||||
|
std::endl
|
||||||
|
<< " ------------ Settings -----------" << std::endl
|
||||||
|
<< " filename=" << filename << std::endl
|
||||||
|
<< " preSplitFiles=" << preSplitFiles << std::endl
|
||||||
|
<< " device=" << device.GetName() << std::endl
|
||||||
|
<< " mc=" << useMarchingCubes << std::endl
|
||||||
|
<< " useFullBoundary=" << !useBoundaryExtremaOnly << std::endl
|
||||||
|
<< " saveDot=" << saveDotFiles << std::endl
|
||||||
|
<< " saveOutputData=" << saveOutputData << std::endl
|
||||||
|
<< " forwardSummary=" << forwardSummary << std::endl
|
||||||
|
<< " numBlocks=" << numBlocks << std::endl
|
||||||
|
<< " augmentHierarchicalTree=" << augmentHierarchicalTree << std::endl
|
||||||
|
<< " numRanks=" << size << std::endl
|
||||||
|
<< " rank=" << rank << std::endl
|
||||||
|
#ifdef ENABLE_HDFIO
|
||||||
|
<< " dataset=" << dataset_name << " (HDF5 only)" << std::endl
|
||||||
|
<< " blocksPerDim=" << blocksPerDimIn[0] << "," << blocksPerDimIn[1] << ","
|
||||||
|
<< blocksPerDimIn[2] << " (HDF5 only)" << std::endl
|
||||||
|
<< " selectSize=" << selectSize[0] << "," << selectSize[1] << "," << selectSize[2]
|
||||||
|
<< " (HDF5 only)" << std::endl
|
||||||
|
#endif
|
||||||
|
);
|
||||||
|
|
||||||
// Measure our time for startup
|
// Measure our time for startup
|
||||||
currTime = totalTime.GetElapsedTime();
|
currTime = totalTime.GetElapsedTime();
|
||||||
vtkm::Float64 startUpTime = currTime - prevTime;
|
vtkm::Float64 startUpTime = currTime - prevTime;
|
||||||
@ -405,429 +493,88 @@ int main(int argc, char* argv[])
|
|||||||
auto localBlockIndicesPortal = localBlockIndices.WritePortal();
|
auto localBlockIndicesPortal = localBlockIndices.WritePortal();
|
||||||
|
|
||||||
// Read the pre-split data files
|
// Read the pre-split data files
|
||||||
|
bool readOk = true;
|
||||||
if (preSplitFiles)
|
if (preSplitFiles)
|
||||||
{
|
{
|
||||||
for (int blockNo = 0; blockNo < blocksPerRank; ++blockNo)
|
readOk = readPreSplitFiles<ValueType>(
|
||||||
{
|
// inputs
|
||||||
// Translate pattern into filename for this block
|
rank,
|
||||||
char block_filename[256];
|
filename,
|
||||||
snprintf(block_filename,
|
blocksPerRank,
|
||||||
sizeof(block_filename),
|
// outputs
|
||||||
filename.c_str(),
|
nDims,
|
||||||
static_cast<int>(rank * blocksPerRank + blockNo));
|
useDataSet,
|
||||||
std::cout << "Reading file " << block_filename << std::endl;
|
globalSize,
|
||||||
|
blocksPerDim,
|
||||||
// Open file
|
localBlockIndices,
|
||||||
std::ifstream inFile(block_filename);
|
// output timers
|
||||||
if (!inFile.is_open() || inFile.bad())
|
dataReadTime,
|
||||||
{
|
buildDatasetTime);
|
||||||
std::cerr << "Error: Couldn't open file " << block_filename << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Read header with dimensions
|
|
||||||
std::string line;
|
|
||||||
std::string tag;
|
|
||||||
vtkm::Id dimVertices;
|
|
||||||
|
|
||||||
getline(inFile, line);
|
|
||||||
std::istringstream global_extents_stream(line);
|
|
||||||
global_extents_stream >> tag;
|
|
||||||
if (tag != "#GLOBAL_EXTENTS")
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Expected #GLOBAL_EXTENTS, got " << tag << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::vector<vtkm::Id> global_extents;
|
|
||||||
while (global_extents_stream >> dimVertices)
|
|
||||||
global_extents.push_back(dimVertices);
|
|
||||||
|
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
|
||||||
std::swap(global_extents[0], global_extents[1]);
|
|
||||||
|
|
||||||
if (blockNo == 0)
|
|
||||||
{ // First block: Set globalSize
|
|
||||||
globalSize =
|
|
||||||
vtkm::Id3{ static_cast<vtkm::Id>(global_extents[0]),
|
|
||||||
static_cast<vtkm::Id>(global_extents[1]),
|
|
||||||
static_cast<vtkm::Id>(global_extents.size() > 2 ? global_extents[2] : 1) };
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{ // All other blocks: Consistency check of globalSize
|
|
||||||
if (globalSize !=
|
|
||||||
vtkm::Id3{ static_cast<vtkm::Id>(global_extents[0]),
|
|
||||||
static_cast<vtkm::Id>(global_extents[1]),
|
|
||||||
static_cast<vtkm::Id>(global_extents.size() > 2 ? global_extents[2] : 1) })
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Global extents mismatch between blocks!" << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
getline(inFile, line);
|
|
||||||
std::istringstream offset_stream(line);
|
|
||||||
offset_stream >> tag;
|
|
||||||
if (tag != "#OFFSET")
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Expected #OFFSET, got " << tag << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
std::vector<vtkm::Id> offset;
|
|
||||||
while (offset_stream >> dimVertices)
|
|
||||||
offset.push_back(dimVertices);
|
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
|
||||||
std::swap(offset[0], offset[1]);
|
|
||||||
|
|
||||||
getline(inFile, line);
|
|
||||||
std::istringstream bpd_stream(line);
|
|
||||||
bpd_stream >> tag;
|
|
||||||
if (tag != "#BLOCKS_PER_DIM")
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Expected #BLOCKS_PER_DIM, got " << tag << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
std::vector<vtkm::Id> bpd;
|
|
||||||
while (bpd_stream >> dimVertices)
|
|
||||||
bpd.push_back(dimVertices);
|
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
|
||||||
std::swap(bpd[0], bpd[1]);
|
|
||||||
|
|
||||||
getline(inFile, line);
|
|
||||||
std::istringstream blockIndex_stream(line);
|
|
||||||
blockIndex_stream >> tag;
|
|
||||||
if (tag != "#BLOCK_INDEX")
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Expected #BLOCK_INDEX, got " << tag << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
std::vector<vtkm::Id> blockIndex;
|
|
||||||
while (blockIndex_stream >> dimVertices)
|
|
||||||
blockIndex.push_back(dimVertices);
|
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
|
||||||
std::swap(blockIndex[0], blockIndex[1]);
|
|
||||||
|
|
||||||
getline(inFile, line);
|
|
||||||
std::istringstream linestream(line);
|
|
||||||
std::vector<vtkm::Id> dims;
|
|
||||||
while (linestream >> dimVertices)
|
|
||||||
{
|
|
||||||
dims.push_back(dimVertices);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (dims.size() != global_extents.size() || dims.size() != offset.size())
|
|
||||||
{
|
|
||||||
std::cerr << "Error: Dimension mismatch" << std::endl;
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
|
||||||
std::swap(dims[0], dims[1]);
|
|
||||||
|
|
||||||
// Compute the number of vertices, i.e., xdim * ydim * zdim
|
|
||||||
nDims = static_cast<unsigned short>(dims.size());
|
|
||||||
std::size_t numVertices = static_cast<std::size_t>(
|
|
||||||
std::accumulate(dims.begin(), dims.end(), std::size_t(1), std::multiplies<std::size_t>()));
|
|
||||||
|
|
||||||
// Check for fatal input errors
|
|
||||||
// Check that the number of dimensiosn is either 2D or 3D
|
|
||||||
bool invalidNumDimensions = (nDims < 2 || nDims > 3);
|
|
||||||
// Log any errors if found on rank 0
|
|
||||||
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
|
||||||
invalidNumDimensions && (rank == 0),
|
|
||||||
"The input mesh is " << nDims
|
|
||||||
<< "D. "
|
|
||||||
"The input data must be either 2D or 3D.");
|
|
||||||
|
|
||||||
// If we found any errors in the setttings than finalize MPI and exit the execution
|
|
||||||
if (invalidNumDimensions)
|
|
||||||
{
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Read data
|
|
||||||
std::vector<ValueType> values(numVertices);
|
|
||||||
if (filename.compare(filename.length() - 5, 5, ".bdem") == 0)
|
|
||||||
{
|
|
||||||
inFile.read(reinterpret_cast<char*>(values.data()),
|
|
||||||
static_cast<std::streamsize>(numVertices * sizeof(ValueType)));
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
for (std::size_t vertex = 0; vertex < numVertices; ++vertex)
|
|
||||||
{
|
|
||||||
inFile >> values[vertex];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
currTime = totalTime.GetElapsedTime();
|
|
||||||
dataReadTime = currTime - prevTime;
|
|
||||||
prevTime = currTime;
|
|
||||||
|
|
||||||
// Create vtk-m data set
|
|
||||||
vtkm::cont::DataSetBuilderUniform dsb;
|
|
||||||
vtkm::cont::DataSet ds;
|
|
||||||
if (nDims == 2)
|
|
||||||
{
|
|
||||||
const vtkm::Id2 v_dims{
|
|
||||||
static_cast<vtkm::Id>(dims[0]),
|
|
||||||
static_cast<vtkm::Id>(dims[1]),
|
|
||||||
};
|
|
||||||
const vtkm::Vec<ValueType, 2> v_origin{ static_cast<ValueType>(offset[0]),
|
|
||||||
static_cast<ValueType>(offset[1]) };
|
|
||||||
const vtkm::Vec<ValueType, 2> v_spacing{ 1, 1 };
|
|
||||||
ds = dsb.Create(v_dims, v_origin, v_spacing);
|
|
||||||
vtkm::cont::CellSetStructured<2> cs;
|
|
||||||
cs.SetPointDimensions(v_dims);
|
|
||||||
cs.SetGlobalPointDimensions(vtkm::Id2{ globalSize[0], globalSize[1] });
|
|
||||||
cs.SetGlobalPointIndexStart(vtkm::Id2{ offset[0], offset[1] });
|
|
||||||
ds.SetCellSet(cs);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
VTKM_ASSERT(nDims == 3);
|
|
||||||
const vtkm::Id3 v_dims{ static_cast<vtkm::Id>(dims[0]),
|
|
||||||
static_cast<vtkm::Id>(dims[1]),
|
|
||||||
static_cast<vtkm::Id>(dims[2]) };
|
|
||||||
const vtkm::Vec<ValueType, 3> v_origin{ static_cast<ValueType>(offset[0]),
|
|
||||||
static_cast<ValueType>(offset[1]),
|
|
||||||
static_cast<ValueType>(offset[2]) };
|
|
||||||
vtkm::Vec<ValueType, 3> v_spacing(1, 1, 1);
|
|
||||||
ds = dsb.Create(v_dims, v_origin, v_spacing);
|
|
||||||
vtkm::cont::CellSetStructured<3> cs;
|
|
||||||
cs.SetPointDimensions(v_dims);
|
|
||||||
cs.SetGlobalPointDimensions(globalSize);
|
|
||||||
cs.SetGlobalPointIndexStart(vtkm::Id3{ offset[0], offset[1], offset[2] });
|
|
||||||
ds.SetCellSet(cs);
|
|
||||||
}
|
|
||||||
ds.AddPointField("values", values);
|
|
||||||
// and add to partition
|
|
||||||
useDataSet.AppendPartition(ds);
|
|
||||||
|
|
||||||
localBlockIndicesPortal.Set(
|
|
||||||
blockNo,
|
|
||||||
vtkm::Id3{ static_cast<vtkm::Id>(blockIndex[0]),
|
|
||||||
static_cast<vtkm::Id>(blockIndex[1]),
|
|
||||||
static_cast<vtkm::Id>(nDims == 3 ? blockIndex[2] : 0) });
|
|
||||||
|
|
||||||
if (blockNo == 0)
|
|
||||||
{
|
|
||||||
blocksPerDim = vtkm::Id3{ static_cast<vtkm::Id>(bpd[0]),
|
|
||||||
static_cast<vtkm::Id>(bpd[1]),
|
|
||||||
static_cast<vtkm::Id>(nDims == 3 ? bpd[2] : 1) };
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Print the mesh metadata
|
|
||||||
if (rank == 0)
|
|
||||||
{
|
|
||||||
VTKM_LOG_S(exampleLogLevel,
|
|
||||||
std::endl
|
|
||||||
<< " ---------------- Input Mesh Properties --------------" << std::endl
|
|
||||||
<< " Number of dimensions: " << nDims << std::endl);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
// Read single-block data and split it for the ranks
|
// Read single-block data and split it for the ranks
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
vtkm::cont::DataSet inDataSet;
|
bool isHDF5 = (0 == filename.compare(filename.length() - 3, 3, ".h5"));
|
||||||
// Currently FloatDefualt would be fine, but it could cause problems if we ever
|
if (isHDF5)
|
||||||
// read binary files here.
|
|
||||||
std::vector<ValueType> values;
|
|
||||||
std::vector<vtkm::Id> dims;
|
|
||||||
|
|
||||||
// Read BOV data file
|
|
||||||
if (filename.compare(filename.length() - 3, 3, "bov") == 0)
|
|
||||||
{
|
{
|
||||||
std::cout << "Reading BOV file" << std::endl;
|
#ifdef ENABLE_HDFIO
|
||||||
vtkm::io::BOVDataSetReader reader(filename);
|
blocksPerDim = blocksPerDimIn;
|
||||||
inDataSet = reader.ReadDataSet();
|
readOk = read3DHDF5File<ValueType>(
|
||||||
nDims = 3;
|
// inputs (blocksPerDim is being modified to swap dimension to fit we re-ordering of dimension)
|
||||||
currTime = totalTime.GetElapsedTime();
|
rank,
|
||||||
dataReadTime = currTime - prevTime;
|
filename,
|
||||||
prevTime = currTime;
|
dataset_name,
|
||||||
// Copy the data into the values array so we can construct a multiblock dataset
|
blocksPerRank,
|
||||||
// TODO All we should need to do to implement BOV support is to copy the values
|
blocksPerDim,
|
||||||
// in the values vector and copy the dimensions in the dims vector
|
selectSize,
|
||||||
vtkm::Id3 pointDimensions;
|
// outputs
|
||||||
auto cellSet = inDataSet.GetCellSet();
|
nDims,
|
||||||
vtkm::cont::CastAndCall(
|
useDataSet,
|
||||||
cellSet, vtkm::worklet::contourtree_augmented::GetPointDimensions(), pointDimensions);
|
globalSize,
|
||||||
std::cout << "Point dimensions are " << pointDimensions << std::endl;
|
localBlockIndices,
|
||||||
dims.resize(3);
|
// output timers
|
||||||
dims[0] = pointDimensions[0];
|
dataReadTime,
|
||||||
dims[1] = pointDimensions[1];
|
buildDatasetTime);
|
||||||
dims[2] = pointDimensions[2];
|
#else
|
||||||
auto tempFieldData = inDataSet.GetField(0).GetData();
|
VTKM_LOG_S(vtkm::cont::LogLevel::Error,
|
||||||
values.resize(static_cast<std::size_t>(tempFieldData.GetNumberOfValues()));
|
"Can't read HDF5 file. HDF5 reader disabled for this build.");
|
||||||
auto valuesHandle = vtkm::cont::make_ArrayHandle(values, vtkm::CopyFlag::Off);
|
readOk = false;
|
||||||
vtkm::cont::ArrayCopy(tempFieldData, valuesHandle);
|
#endif
|
||||||
valuesHandle.SyncControlArray(); //Forces values to get updated if copy happened on GPU
|
|
||||||
}
|
}
|
||||||
// Read ASCII data input
|
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
std::cout << "Reading ASCII file" << std::endl;
|
readOk = readSingleBlockFile<ValueType>(
|
||||||
std::ifstream inFile(filename);
|
// inputs
|
||||||
if (inFile.bad())
|
rank,
|
||||||
return 0;
|
size,
|
||||||
|
filename,
|
||||||
// Read the dimensions of the mesh, i.e,. number of elementes in x, y, and z
|
numBlocks,
|
||||||
std::string line;
|
blocksPerRank,
|
||||||
getline(inFile, line);
|
// outputs
|
||||||
std::istringstream linestream(line);
|
nDims,
|
||||||
vtkm::Id dimVertices;
|
useDataSet,
|
||||||
while (linestream >> dimVertices)
|
globalSize,
|
||||||
{
|
blocksPerDim,
|
||||||
dims.push_back(dimVertices);
|
localBlockIndices,
|
||||||
}
|
// output timers
|
||||||
// Swap dimensions so that they are from fastest to slowest growing
|
dataReadTime,
|
||||||
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
buildDatasetTime);
|
||||||
std::swap(dims[0], dims[1]);
|
|
||||||
|
|
||||||
// Compute the number of vertices, i.e., xdim * ydim * zdim
|
|
||||||
nDims = static_cast<unsigned short>(dims.size());
|
|
||||||
std::size_t numVertices = static_cast<std::size_t>(
|
|
||||||
std::accumulate(dims.begin(), dims.end(), std::size_t(1), std::multiplies<std::size_t>()));
|
|
||||||
|
|
||||||
// Check the the number of dimensiosn is either 2D or 3D
|
|
||||||
bool invalidNumDimensions = (nDims < 2 || nDims > 3);
|
|
||||||
// Log any errors if found on rank 0
|
|
||||||
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
|
||||||
invalidNumDimensions && (rank == 0),
|
|
||||||
"The input mesh is " << nDims << "D. The input data must be either 2D or 3D.");
|
|
||||||
// If we found any errors in the setttings than finalize MPI and exit the execution
|
|
||||||
if (invalidNumDimensions)
|
|
||||||
{
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Read data
|
|
||||||
values.resize(numVertices);
|
|
||||||
for (std::size_t vertex = 0; vertex < numVertices; ++vertex)
|
|
||||||
{
|
|
||||||
inFile >> values[vertex];
|
|
||||||
}
|
|
||||||
|
|
||||||
// finish reading the data
|
|
||||||
inFile.close();
|
|
||||||
|
|
||||||
currTime = totalTime.GetElapsedTime();
|
|
||||||
dataReadTime = currTime - prevTime;
|
|
||||||
prevTime = currTime;
|
|
||||||
|
|
||||||
} // END ASCII Read
|
|
||||||
|
|
||||||
// Print the mesh metadata
|
|
||||||
if (rank == 0)
|
|
||||||
{
|
|
||||||
VTKM_LOG_S(exampleLogLevel,
|
|
||||||
std::endl
|
|
||||||
<< " ---------------- Input Mesh Properties --------------" << std::endl
|
|
||||||
<< " Number of dimensions: " << nDims);
|
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
if (!readOk)
|
||||||
|
{
|
||||||
|
VTKM_LOG_S(vtkm::cont::LogLevel::Error, "Data read failed.");
|
||||||
|
MPI_Finalize();
|
||||||
|
return EXIT_FAILURE;
|
||||||
|
}
|
||||||
|
|
||||||
// Create a multi-block dataset for multi-block DIY-paralle processing
|
// Print the mesh metadata
|
||||||
blocksPerDim = nDims == 3 ? vtkm::Id3(1, 1, numBlocks)
|
if (rank == 0)
|
||||||
: vtkm::Id3(1, numBlocks, 1); // Decompose the data into
|
{
|
||||||
globalSize = nDims == 3 ? vtkm::Id3(static_cast<vtkm::Id>(dims[0]),
|
VTKM_LOG_S(exampleLogLevel,
|
||||||
static_cast<vtkm::Id>(dims[1]),
|
std::endl
|
||||||
static_cast<vtkm::Id>(dims[2]))
|
<< " ---------------- Input Mesh Properties --------------" << std::endl
|
||||||
: vtkm::Id3(static_cast<vtkm::Id>(dims[0]),
|
<< " Number of dimensions: " << nDims);
|
||||||
static_cast<vtkm::Id>(dims[1]),
|
|
||||||
static_cast<vtkm::Id>(1));
|
|
||||||
{
|
|
||||||
vtkm::Id lastDimSize =
|
|
||||||
(nDims == 2) ? static_cast<vtkm::Id>(dims[1]) : static_cast<vtkm::Id>(dims[2]);
|
|
||||||
if (size > (lastDimSize / 2.))
|
|
||||||
{
|
|
||||||
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
|
||||||
rank == 0,
|
|
||||||
"Number of ranks too large for data. Use " << lastDimSize / 2
|
|
||||||
<< "or fewer ranks");
|
|
||||||
MPI_Finalize();
|
|
||||||
return EXIT_FAILURE;
|
|
||||||
}
|
|
||||||
vtkm::Id standardBlockSize = (vtkm::Id)(lastDimSize / numBlocks);
|
|
||||||
vtkm::Id blockSize = standardBlockSize;
|
|
||||||
vtkm::Id blockSliceSize =
|
|
||||||
nDims == 2 ? static_cast<vtkm::Id>(dims[0]) : static_cast<vtkm::Id>((dims[0] * dims[1]));
|
|
||||||
vtkm::Id blockNumValues = blockSize * blockSliceSize;
|
|
||||||
|
|
||||||
vtkm::Id startBlock = blocksPerRank * rank;
|
|
||||||
vtkm::Id endBlock = startBlock + blocksPerRank;
|
|
||||||
for (vtkm::Id blockIndex = startBlock; blockIndex < endBlock; ++blockIndex)
|
|
||||||
{
|
|
||||||
vtkm::Id localBlockIndex = blockIndex - startBlock;
|
|
||||||
vtkm::Id blockStart = blockIndex * blockNumValues;
|
|
||||||
vtkm::Id blockEnd = blockStart + blockNumValues;
|
|
||||||
if (blockIndex < (numBlocks - 1)) // add overlap between regions
|
|
||||||
{
|
|
||||||
blockEnd += blockSliceSize;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
blockEnd = lastDimSize * blockSliceSize;
|
|
||||||
}
|
|
||||||
vtkm::Id currBlockSize = (vtkm::Id)((blockEnd - blockStart) / blockSliceSize);
|
|
||||||
|
|
||||||
vtkm::cont::DataSetBuilderUniform dsb;
|
|
||||||
vtkm::cont::DataSet ds;
|
|
||||||
|
|
||||||
// 2D data
|
|
||||||
if (nDims == 2)
|
|
||||||
{
|
|
||||||
vtkm::Id2 vdims;
|
|
||||||
vdims[0] = static_cast<vtkm::Id>(dims[0]);
|
|
||||||
vdims[1] = static_cast<vtkm::Id>(currBlockSize);
|
|
||||||
vtkm::Vec<ValueType, 2> origin(0, blockIndex * blockSize);
|
|
||||||
vtkm::Vec<ValueType, 2> spacing(1, 1);
|
|
||||||
ds = dsb.Create(vdims, origin, spacing);
|
|
||||||
vtkm::cont::CellSetStructured<2> cs;
|
|
||||||
cs.SetPointDimensions(vdims);
|
|
||||||
cs.SetGlobalPointDimensions(vtkm::Id2{ globalSize[0], globalSize[1] });
|
|
||||||
cs.SetGlobalPointIndexStart(vtkm::Id2{ 0, (blockStart / blockSliceSize) });
|
|
||||||
ds.SetCellSet(cs);
|
|
||||||
localBlockIndicesPortal.Set(localBlockIndex, vtkm::Id3(0, blockIndex, 0));
|
|
||||||
}
|
|
||||||
// 3D data
|
|
||||||
else
|
|
||||||
{
|
|
||||||
vtkm::Id3 vdims;
|
|
||||||
vdims[0] = static_cast<vtkm::Id>(dims[0]);
|
|
||||||
vdims[1] = static_cast<vtkm::Id>(dims[1]);
|
|
||||||
vdims[2] = static_cast<vtkm::Id>(currBlockSize);
|
|
||||||
vtkm::Vec<ValueType, 3> origin(0, 0, (blockIndex * blockSize));
|
|
||||||
vtkm::Vec<ValueType, 3> spacing(1, 1, 1);
|
|
||||||
ds = dsb.Create(vdims, origin, spacing);
|
|
||||||
vtkm::cont::CellSetStructured<3> cs;
|
|
||||||
cs.SetPointDimensions(vdims);
|
|
||||||
cs.SetGlobalPointDimensions(globalSize);
|
|
||||||
cs.SetGlobalPointIndexStart(vtkm::Id3(0, 0, blockStart / blockSliceSize));
|
|
||||||
ds.SetCellSet(cs);
|
|
||||||
localBlockIndicesPortal.Set(localBlockIndex, vtkm::Id3(0, 0, blockIndex));
|
|
||||||
}
|
|
||||||
|
|
||||||
std::vector<vtkm::Float32> subValues((values.begin() + blockStart),
|
|
||||||
(values.begin() + blockEnd));
|
|
||||||
|
|
||||||
ds.AddPointField("values", subValues);
|
|
||||||
useDataSet.AppendPartition(ds);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Check if marching cubes is enabled for non 3D data
|
// Check if marching cubes is enabled for non 3D data
|
||||||
@ -838,16 +585,15 @@ int main(int argc, char* argv[])
|
|||||||
<< nDims << "D. "
|
<< nDims << "D. "
|
||||||
<< "Contour tree using marching cubes is only supported for 3D data.");
|
<< "Contour tree using marching cubes is only supported for 3D data.");
|
||||||
|
|
||||||
// If we found any errors in the setttings than finalize MPI and exit the execution
|
// If we found any errors in the settings than finalize MPI and exit the execution
|
||||||
if (invalidMCOption)
|
if (invalidMCOption)
|
||||||
{
|
{
|
||||||
MPI_Finalize();
|
MPI_Finalize();
|
||||||
return EXIT_FAILURE;
|
return EXIT_FAILURE;
|
||||||
}
|
}
|
||||||
|
|
||||||
currTime = totalTime.GetElapsedTime();
|
// reset timer after read. the dataReadTime and buildDatasetTime are measured by the read functions
|
||||||
buildDatasetTime = currTime - prevTime;
|
prevTime = totalTime.GetElapsedTime();
|
||||||
prevTime = currTime;
|
|
||||||
|
|
||||||
// Make sure that all ranks have started up before we start the data read
|
// Make sure that all ranks have started up before we start the data read
|
||||||
MPI_Barrier(comm);
|
MPI_Barrier(comm);
|
||||||
@ -855,6 +601,20 @@ int main(int argc, char* argv[])
|
|||||||
vtkm::Float64 dataReadSyncTime = currTime - prevTime;
|
vtkm::Float64 dataReadSyncTime = currTime - prevTime;
|
||||||
prevTime = currTime;
|
prevTime = currTime;
|
||||||
|
|
||||||
|
// Log information of the (first) local data block
|
||||||
|
// TODO: Get localBlockSize and localBlockOrigins from the cell set to log results
|
||||||
|
VTKM_LOG_S(vtkm::cont::LogLevel::Info,
|
||||||
|
"" //<< std::setw(42) << std::left << "blockSize"
|
||||||
|
//<< ":" << localBlockSizesPortal.Get(0) << std::endl
|
||||||
|
//<< std::setw(42) << std::left << "blockOrigin=" << localBlockOriginsPortal.Get(0)
|
||||||
|
//<< std::endl
|
||||||
|
<< std::setw(42) << std::left << "blockIndices=" << localBlockIndicesPortal.Get(0)
|
||||||
|
<< std::endl
|
||||||
|
<< std::setw(42) << std::left << "blocksPerDim=" << blocksPerDim << std::endl
|
||||||
|
<< std::setw(42) << std::left << "globalSize=" << globalSize << std::endl
|
||||||
|
|
||||||
|
);
|
||||||
|
|
||||||
// Convert the mesh of values into contour tree, pairs of vertex ids
|
// Convert the mesh of values into contour tree, pairs of vertex ids
|
||||||
vtkm::filter::scalar_topology::ContourTreeUniformDistributed filter(timingsLogLevel,
|
vtkm::filter::scalar_topology::ContourTreeUniformDistributed filter(timingsLogLevel,
|
||||||
treeLogLevel);
|
treeLogLevel);
|
||||||
@ -872,21 +632,30 @@ int main(int argc, char* argv[])
|
|||||||
vtkm::Float64 computeContourTreeTime = currTime - prevTime;
|
vtkm::Float64 computeContourTreeTime = currTime - prevTime;
|
||||||
prevTime = currTime;
|
prevTime = currTime;
|
||||||
|
|
||||||
// Make sure that all ranks have started up before we start the data read
|
// Record the time to synchronize after the filter has finished
|
||||||
MPI_Barrier(comm);
|
MPI_Barrier(comm);
|
||||||
currTime = totalTime.GetElapsedTime();
|
currTime = totalTime.GetElapsedTime();
|
||||||
vtkm::Float64 postFilterSyncTime = currTime - prevTime;
|
vtkm::Float64 postFilterSyncTime = currTime - prevTime;
|
||||||
prevTime = currTime;
|
prevTime = currTime;
|
||||||
|
|
||||||
|
// Compute branch decomposition if requested
|
||||||
|
vtkm::cont::PartitionedDataSet bd_result;
|
||||||
|
if (computeHierarchicalVolumetricBranchDecomposition)
|
||||||
|
{
|
||||||
|
vtkm::filter::scalar_topology::DistributedBranchDecompositionFilter bd_filter;
|
||||||
|
bd_result = bd_filter.Execute(result);
|
||||||
|
}
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
vtkm::Float64 branchDecompTime = currTime - prevTime;
|
||||||
|
prevTime = currTime;
|
||||||
|
|
||||||
|
// Save output
|
||||||
if (saveOutputData)
|
if (saveOutputData)
|
||||||
{
|
{
|
||||||
if (augmentHierarchicalTree)
|
if (augmentHierarchicalTree)
|
||||||
{
|
{
|
||||||
if (computeHierarchicalVolumetricBranchDecomposition)
|
if (computeHierarchicalVolumetricBranchDecomposition)
|
||||||
{
|
{
|
||||||
vtkm::filter::scalar_topology::DistributedBranchDecompositionFilter bd_filter;
|
|
||||||
auto bd_result = bd_filter.Execute(result);
|
|
||||||
|
|
||||||
for (vtkm::Id ds_no = 0; ds_no < result.GetNumberOfPartitions(); ++ds_no)
|
for (vtkm::Id ds_no = 0; ds_no < result.GetNumberOfPartitions(); ++ds_no)
|
||||||
{
|
{
|
||||||
auto ds = bd_result.GetPartition(ds_no);
|
auto ds = bd_result.GetPartition(ds_no);
|
||||||
@ -1003,6 +772,8 @@ int main(int argc, char* argv[])
|
|||||||
<< ": " << computeContourTreeTime << " seconds" << std::endl
|
<< ": " << computeContourTreeTime << " seconds" << std::endl
|
||||||
<< std::setw(42) << std::left << " Post filter Sync"
|
<< std::setw(42) << std::left << " Post filter Sync"
|
||||||
<< ": " << postFilterSyncTime << " seconds" << std::endl
|
<< ": " << postFilterSyncTime << " seconds" << std::endl
|
||||||
|
<< std::setw(42) << std::left << " Branch Decomposition"
|
||||||
|
<< ": " << branchDecompTime << " seconds" << std::endl
|
||||||
<< std::setw(42) << std::left << " Save Tree Compiler Data"
|
<< std::setw(42) << std::left << " Save Tree Compiler Data"
|
||||||
<< ": " << saveOutputDataTime << " seconds" << std::endl
|
<< ": " << saveOutputDataTime << " seconds" << std::endl
|
||||||
<< std::setw(42) << std::left << " Total Time"
|
<< std::setw(42) << std::left << " Total Time"
|
||||||
|
853
examples/contour_tree_distributed/ContourTreeAppDataIO.h
Normal file
853
examples/contour_tree_distributed/ContourTreeAppDataIO.h
Normal file
@ -0,0 +1,853 @@
|
|||||||
|
//============================================================================
|
||||||
|
// Copyright (c) Kitware, Inc.
|
||||||
|
// All rights reserved.
|
||||||
|
// See LICENSE.txt 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.
|
||||||
|
//
|
||||||
|
// Copyright 2014 National Technology & Engineering Solutions of Sandia, LLC (NTESS).
|
||||||
|
// Copyright 2014 UT-Battelle, LLC.
|
||||||
|
// Copyright 2014 Los Alamos National Security.
|
||||||
|
//
|
||||||
|
// Under the terms of Contract DE-NA0003525 with NTESS,
|
||||||
|
// the U.S. Government retains certain rights in this software.
|
||||||
|
//
|
||||||
|
// Under the terms of Contract DE-AC52-06NA25396 with Los Alamos National
|
||||||
|
// Laboratory (LANL), the U.S. Government retains certain rights in
|
||||||
|
// this software.
|
||||||
|
//============================================================================
|
||||||
|
// Copyright (c) 2018, The Regents of the University of California, through
|
||||||
|
// Lawrence Berkeley National Laboratory (subject to receipt of any required approvals
|
||||||
|
// from the U.S. Dept. of Energy). All rights reserved.
|
||||||
|
//
|
||||||
|
// Redistribution and use in source and binary forms, with or without modification,
|
||||||
|
// are permitted provided that the following conditions are met:
|
||||||
|
//
|
||||||
|
// (1) Redistributions of source code must retain the above copyright notice, this
|
||||||
|
// list of conditions and the following disclaimer.
|
||||||
|
//
|
||||||
|
// (2) Redistributions in binary form must reproduce the above copyright notice,
|
||||||
|
// this list of conditions and the following disclaimer in the documentation
|
||||||
|
// and/or other materials provided with the distribution.
|
||||||
|
//
|
||||||
|
// (3) Neither the name of the University of California, Lawrence Berkeley National
|
||||||
|
// Laboratory, U.S. Dept. of Energy nor the names of its contributors may be
|
||||||
|
// used to endorse or promote products derived from this software without
|
||||||
|
// specific prior written permission.
|
||||||
|
//
|
||||||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
||||||
|
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
||||||
|
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||||||
|
// IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
||||||
|
// INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
||||||
|
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||||
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
||||||
|
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
||||||
|
// OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
||||||
|
// OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
|
//
|
||||||
|
//=============================================================================
|
||||||
|
//
|
||||||
|
// I/O functions used by the ContourTreeApp for data read.
|
||||||
|
//==============================================================================
|
||||||
|
|
||||||
|
#ifndef vtk_m_examples_ContourTreeAppDataIO_hxx
|
||||||
|
#define vtk_m_examples_ContourTreeAppDataIO_hxx
|
||||||
|
|
||||||
|
#include <vtkm/Types.h>
|
||||||
|
#include <vtkm/cont/ArrayCopy.h>
|
||||||
|
#include <vtkm/cont/ArrayHandle.h>
|
||||||
|
#include <vtkm/cont/CellSetStructured.h>
|
||||||
|
#include <vtkm/cont/DataSet.h>
|
||||||
|
#include <vtkm/cont/DataSetBuilderUniform.h>
|
||||||
|
#include <vtkm/cont/PartitionedDataSet.h>
|
||||||
|
#include <vtkm/cont/Timer.h>
|
||||||
|
#include <vtkm/io/BOVDataSetReader.h>
|
||||||
|
|
||||||
|
#include <vtkm/filter/scalar_topology/worklet/contourtree_augmented/Types.h>
|
||||||
|
|
||||||
|
#include <cstdio>
|
||||||
|
#include <fstream>
|
||||||
|
#include <iomanip>
|
||||||
|
#include <iostream>
|
||||||
|
#include <numeric>
|
||||||
|
#include <sstream>
|
||||||
|
#include <string>
|
||||||
|
#include <utility>
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
|
||||||
|
#ifdef ENABLE_HDFIO
|
||||||
|
// #include "H5Cpp.h"
|
||||||
|
#include "hdf5.h"
|
||||||
|
//using namespace H5;
|
||||||
|
|
||||||
|
#include <mpi.h>
|
||||||
|
|
||||||
|
|
||||||
|
/// Convert a 3D index of a cube to rank index
|
||||||
|
vtkm::Id to1DIndex(vtkm::Id3 idx, vtkm::Id3 dims)
|
||||||
|
{
|
||||||
|
// return (idx[2] * dims[0] * dims[1]) + (idx[1] * dims[0]) + idx[0];
|
||||||
|
// Swap first and second dimension
|
||||||
|
return (idx[2] * dims[0] * dims[1]) + (idx[0] * dims[1]) + idx[1];
|
||||||
|
}
|
||||||
|
|
||||||
|
/// Convert the rank index to the index of the cube
|
||||||
|
vtkm::Id3 to3DIndex(vtkm::Id idx, vtkm::Id3 dims)
|
||||||
|
{
|
||||||
|
vtkm::Id3 res;
|
||||||
|
res[2] = idx / (dims[0] * dims[1]);
|
||||||
|
idx -= (res[2] * dims[0] * dims[1]);
|
||||||
|
// Swap index 0 and 1
|
||||||
|
// res[0] = idx / dims[0];
|
||||||
|
// res[1] = idx % dims[0];
|
||||||
|
// Don't swap index here, because this function is used with the original
|
||||||
|
// HDF5 layout and the 3D index is swapped later on
|
||||||
|
res[1] = idx / dims[0];
|
||||||
|
res[0] = idx % dims[0];
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// Read data from pre-split ASCII files
|
||||||
|
/// @param[in] rank The current MPI rank the function is called from
|
||||||
|
/// @param[in] filename Name of the file with %d as placeholder for the integer index of the block
|
||||||
|
/// @param[in] dataset_name Name of the dataset in the HDF5 file to read
|
||||||
|
/// @param[in] blocksPerRank Number of data blocks to process on each rank
|
||||||
|
/// @param[in] blocksPerDim Number of data blocks to use per dimension
|
||||||
|
/// @param[in] selectSize Select subset of this size from the dataset. Set to (-1,-1,-1) to select the full size
|
||||||
|
/// @param[out] nDims Number of data dimensions (i.e, 2 or 3)
|
||||||
|
/// @param[out] useDataSet VTKm partioned dataset to be used with the distributed contour tree filter
|
||||||
|
/// @param[out] globalSize Global extends of the input mesh (i.e., number of mesh points in each dimension)
|
||||||
|
/// @param[out] localBlockIndices Array with the (x,y,z) index of each local data block with
|
||||||
|
/// with respect to blocksPerDim
|
||||||
|
/// @param[out] dataReadTime Time to read the data
|
||||||
|
/// @param[out] buildDatasetTime Time to construct the VTKm datasets
|
||||||
|
/// @returns bool indicating whether the read was successful or not
|
||||||
|
template <typename ValueType>
|
||||||
|
bool read3DHDF5File(const int& mpi_rank,
|
||||||
|
const std::string& filename,
|
||||||
|
const std::string& dataset_name,
|
||||||
|
const int& blocksPerRank,
|
||||||
|
vtkm::Id3& blocksPerDim,
|
||||||
|
const vtkm::Id3& selectSize,
|
||||||
|
std::vector<vtkm::Float32>::size_type& nDims,
|
||||||
|
vtkm::cont::PartitionedDataSet& useDataSet,
|
||||||
|
vtkm::Id3& globalSize,
|
||||||
|
vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||||
|
vtkm::Float64& dataReadTime,
|
||||||
|
vtkm::Float64& buildDatasetTime)
|
||||||
|
{
|
||||||
|
vtkm::cont::Timer totalTime;
|
||||||
|
totalTime.Start();
|
||||||
|
vtkm::Float64 prevTime = 0;
|
||||||
|
vtkm::Float64 currTime = 0;
|
||||||
|
|
||||||
|
// TODO not supported yet
|
||||||
|
if (blocksPerRank > 1)
|
||||||
|
{
|
||||||
|
VTKM_LOG_S(
|
||||||
|
vtkm::cont::LogLevel::Error,
|
||||||
|
"HDF5 reader for ContourTreeDistributed does not support multiple blocks per rank yet");
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
vtkm::Id blockNo = 0; // TODO: Update this if we have multiple blocks per rank
|
||||||
|
|
||||||
|
localBlockIndices.Allocate(blocksPerRank);
|
||||||
|
auto localBlockIndicesPortal = localBlockIndices.WritePortal();
|
||||||
|
|
||||||
|
herr_t status;
|
||||||
|
//Set up file access property list with parallel I/O access
|
||||||
|
hid_t plist_id = H5Pcreate(H5P_FILE_ACCESS);
|
||||||
|
MPI_Comm comm = MPI_COMM_WORLD;
|
||||||
|
MPI_Info info = MPI_INFO_NULL;
|
||||||
|
H5Pset_fapl_mpio(plist_id, comm, info);
|
||||||
|
|
||||||
|
// Open the file and the dataset
|
||||||
|
//hid_t file = H5Fopen(filename.c_str(), H5F_ACC_RDONLY, H5P_DEFAULT); // plist_id);//
|
||||||
|
hid_t file = H5Fopen(filename.c_str(), H5F_ACC_RDONLY, plist_id); //
|
||||||
|
hid_t dataset = H5Dopen(file, dataset_name.c_str(), H5P_DEFAULT);
|
||||||
|
// Get filespace for rank and dimension
|
||||||
|
hid_t filespace = H5Dget_space(dataset);
|
||||||
|
// Get number of dimensions in the file dataspace
|
||||||
|
nDims = H5Sget_simple_extent_ndims(filespace);
|
||||||
|
if (nDims != 3)
|
||||||
|
{
|
||||||
|
VTKM_LOG_S(vtkm::cont::LogLevel::Error,
|
||||||
|
"HDF5 reader for ContourTreeDistributed requires 3D dataset");
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
hsize_t dims[nDims]; // dataset dimensions
|
||||||
|
status = H5Sget_simple_extent_dims(filespace, dims, NULL);
|
||||||
|
globalSize[0] = selectSize[0] < 0 ? dims[0] : selectSize[0];
|
||||||
|
globalSize[1] = selectSize[1] < 0 ? dims[1] : selectSize[1];
|
||||||
|
globalSize[2] = selectSize[2] < 0 ? dims[2] : selectSize[2];
|
||||||
|
// Define the memory space to read dataset.
|
||||||
|
hid_t dataspace = H5Dget_space(dataset);
|
||||||
|
// Read a hyperslap
|
||||||
|
// define the hyperslap
|
||||||
|
hsize_t count[3]; // size of the hyperslab in the file
|
||||||
|
hsize_t offset[3]; // hyperslab offset in the file
|
||||||
|
|
||||||
|
// Compute the origin and count
|
||||||
|
vtkm::Id3 blockSize(std::floor(vtkm::Id(globalSize[0] / blocksPerDim[0])),
|
||||||
|
std::floor(vtkm::Id(globalSize[1] / blocksPerDim[1])),
|
||||||
|
std::floor(vtkm::Id(globalSize[2] / blocksPerDim[2])));
|
||||||
|
vtkm::Id3 blockIndex = to3DIndex(mpi_rank, blocksPerDim);
|
||||||
|
|
||||||
|
// compute the offset and count for the block for this rank
|
||||||
|
offset[0] = blockSize[0] * blockIndex[0];
|
||||||
|
offset[1] = blockSize[1] * blockIndex[1];
|
||||||
|
offset[2] = blockSize[2] * blockIndex[2];
|
||||||
|
count[0] = blockSize[0];
|
||||||
|
count[1] = blockSize[1];
|
||||||
|
count[2] = blockSize[2];
|
||||||
|
// add ghost zone on the left
|
||||||
|
if (blockIndex[0] > 0)
|
||||||
|
{
|
||||||
|
offset[0] = offset[0] - 1;
|
||||||
|
count[0] = count[0] + 1;
|
||||||
|
}
|
||||||
|
if (blockIndex[1] > 0)
|
||||||
|
{
|
||||||
|
offset[1] = offset[1] - 1;
|
||||||
|
count[1] = count[1] + 1;
|
||||||
|
}
|
||||||
|
if (blockIndex[2] > 0)
|
||||||
|
{
|
||||||
|
offset[2] = offset[2] - 1;
|
||||||
|
count[2] = count[2] + 1;
|
||||||
|
}
|
||||||
|
// Check that we are not running over the end of the dataset
|
||||||
|
if (vtkm::Id(offset[0] + count[0]) > globalSize[0])
|
||||||
|
{
|
||||||
|
count[0] = globalSize[0] - offset[0];
|
||||||
|
}
|
||||||
|
if (vtkm::Id(offset[1] + count[1]) > globalSize[1])
|
||||||
|
{
|
||||||
|
count[1] = globalSize[1] - offset[1];
|
||||||
|
}
|
||||||
|
if (vtkm::Id(offset[2] + count[2]) > globalSize[2])
|
||||||
|
{
|
||||||
|
count[2] = globalSize[2] - offset[2];
|
||||||
|
}
|
||||||
|
blockSize = vtkm::Id3{ static_cast<vtkm::Id>(count[0]),
|
||||||
|
static_cast<vtkm::Id>(count[1]),
|
||||||
|
static_cast<vtkm::Id>(count[2]) };
|
||||||
|
/*vtkm::Id3 blockOrigin = vtkm::Id3{ static_cast<vtkm::Id>(offset[0]),
|
||||||
|
static_cast<vtkm::Id>(offset[1]),
|
||||||
|
static_cast<vtkm::Id>(offset[2]) };*/
|
||||||
|
|
||||||
|
// Define the hyperslap to read the data into memory
|
||||||
|
status = H5Sselect_hyperslab(dataspace, H5S_SELECT_SET, offset, NULL, count, NULL);
|
||||||
|
// Define the memory space for reading
|
||||||
|
hid_t memspace = H5Screate_simple(nDims, count, NULL);
|
||||||
|
// Read data from hyperslab in the file into the hyperslab in
|
||||||
|
std::size_t numVertices = count[0] * count[1] * count[2];
|
||||||
|
std::vector<ValueType> values(numVertices);
|
||||||
|
{
|
||||||
|
if (H5Tequal(H5Dget_type(dataset), H5T_NATIVE_DOUBLE))
|
||||||
|
{
|
||||||
|
double data_out[count[0]][count[1]][count[2]]; // output buffer
|
||||||
|
status = H5Dread(dataset, H5T_NATIVE_DOUBLE, memspace, dataspace, H5P_DEFAULT, data_out);
|
||||||
|
// Copy data to 1D array of the expected ValueType
|
||||||
|
for (hsize_t k = 0; k < count[0]; k++)
|
||||||
|
{
|
||||||
|
for (hsize_t j = 0; j < count[1]; j++)
|
||||||
|
{
|
||||||
|
for (hsize_t i = 0; i < count[2]; i++)
|
||||||
|
{
|
||||||
|
values[to1DIndex(vtkm::Id3(k, j, i), blockSize)] = ValueType(data_out[k][j][i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (H5Tequal(H5Dget_type(dataset), H5T_NATIVE_FLOAT))
|
||||||
|
{
|
||||||
|
float data_out[count[0]][count[1]][count[2]]; // output buffer
|
||||||
|
status = H5Dread(dataset, H5T_NATIVE_FLOAT, memspace, dataspace, H5P_DEFAULT, data_out);
|
||||||
|
// Copy data to 1D array of the expected ValueType
|
||||||
|
for (hsize_t k = 0; k < count[0]; k++)
|
||||||
|
{
|
||||||
|
for (hsize_t j = 0; j < count[1]; j++)
|
||||||
|
{
|
||||||
|
for (hsize_t i = 0; i < count[2]; i++)
|
||||||
|
{
|
||||||
|
values[to1DIndex(vtkm::Id3(k, j, i), blockSize)] = ValueType(data_out[k][j][i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (H5Tequal(H5Dget_type(dataset), H5T_NATIVE_INT))
|
||||||
|
{
|
||||||
|
int data_out[count[0]][count[1]][count[2]]; // output buffer
|
||||||
|
status = H5Dread(dataset, H5T_NATIVE_INT, memspace, dataspace, H5P_DEFAULT, data_out);
|
||||||
|
// Copy data to 1D array of the expected ValueType
|
||||||
|
for (hsize_t k = 0; k < count[0]; k++)
|
||||||
|
{
|
||||||
|
for (hsize_t j = 0; j < count[1]; j++)
|
||||||
|
{
|
||||||
|
for (hsize_t i = 0; i < count[2]; i++)
|
||||||
|
{
|
||||||
|
values[to1DIndex(vtkm::Id3(k, j, i), blockSize)] = ValueType(data_out[k][j][i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else if (H5Tequal(H5Dget_type(dataset), H5T_NATIVE_UCHAR))
|
||||||
|
{
|
||||||
|
unsigned char data_out[count[0]][count[1]][count[2]]; // output buffer
|
||||||
|
status = H5Dread(dataset, H5T_NATIVE_UCHAR, memspace, dataspace, H5P_DEFAULT, data_out);
|
||||||
|
// Copy data to 1D array of the expected ValueType
|
||||||
|
for (hsize_t k = 0; k < count[0]; k++)
|
||||||
|
{
|
||||||
|
for (hsize_t j = 0; j < count[1]; j++)
|
||||||
|
{
|
||||||
|
for (hsize_t i = 0; i < count[2]; i++)
|
||||||
|
{
|
||||||
|
values[to1DIndex(vtkm::Id3(k, j, i), blockSize)] = ValueType(data_out[k][j][i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
VTKM_LOG_S(vtkm::cont::LogLevel::Error, "Data type not supported by the example HDF5 reader");
|
||||||
|
throw "Data type not supported by the example HDF5 reader";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
// Release HDF5 resources
|
||||||
|
H5Sclose(dataspace);
|
||||||
|
H5Dclose(dataset);
|
||||||
|
H5Fclose(file);
|
||||||
|
|
||||||
|
// Create vtk-m data set
|
||||||
|
vtkm::cont::DataSetBuilderUniform dsb;
|
||||||
|
vtkm::cont::DataSet ds;
|
||||||
|
VTKM_ASSERT(nDims == 3);
|
||||||
|
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
// Swap the dimensions to match the pre-split file reader
|
||||||
|
globalSize = vtkm::Id3(globalSize[1], globalSize[0], globalSize[2]);
|
||||||
|
// Swap also the blocks per dimension accordingly
|
||||||
|
blocksPerDim = vtkm::Id3(blocksPerDim[1], blocksPerDim[0], blocksPerDim[2]);
|
||||||
|
|
||||||
|
// Swap first and second dimenion here as well for consistency
|
||||||
|
const vtkm::Vec<ValueType, 3> v_origin{ static_cast<ValueType>(offset[1]),
|
||||||
|
static_cast<ValueType>(offset[0]),
|
||||||
|
static_cast<ValueType>(offset[2]) };
|
||||||
|
const vtkm::Id3 v_dims{ static_cast<vtkm::Id>(blockSize[1]),
|
||||||
|
static_cast<vtkm::Id>(blockSize[0]),
|
||||||
|
static_cast<vtkm::Id>(blockSize[2]) };
|
||||||
|
vtkm::Vec<ValueType, 3> v_spacing(1, 1, 1);
|
||||||
|
ds = dsb.Create(v_dims, v_origin, v_spacing);
|
||||||
|
vtkm::cont::CellSetStructured<3> cs;
|
||||||
|
cs.SetPointDimensions(v_dims);
|
||||||
|
cs.SetGlobalPointDimensions(globalSize);
|
||||||
|
cs.SetGlobalPointIndexStart(vtkm::Id3{ v_origin[0], v_origin[1], v_origin[2] });
|
||||||
|
ds.SetCellSet(cs);
|
||||||
|
|
||||||
|
ds.AddPointField("values", values);
|
||||||
|
// and add to partition
|
||||||
|
useDataSet.AppendPartition(ds);
|
||||||
|
|
||||||
|
// Swap order to match pre-splot
|
||||||
|
localBlockIndicesPortal.Set(blockNo, vtkm::Id3(blockIndex[1], blockIndex[0], blockIndex[2]));
|
||||||
|
|
||||||
|
// Log information of the (first) local data block
|
||||||
|
VTKM_LOG_S(vtkm::cont::LogLevel::Info,
|
||||||
|
"" << std::setw(42) << std::left << "blockSize"
|
||||||
|
<< ":" << v_dims << std::endl
|
||||||
|
<< std::setw(42) << std::left << "blockOrigin=" << v_origin << std::endl
|
||||||
|
<< std::setw(42) << std::left << "blockIndices=" << localBlockIndicesPortal.Get(0)
|
||||||
|
<< std::endl
|
||||||
|
<< std::setw(42) << std::left << "globalSize=" << globalSize << std::endl);
|
||||||
|
|
||||||
|
// Finished data read
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
dataReadTime = currTime - prevTime;
|
||||||
|
prevTime = currTime;
|
||||||
|
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
buildDatasetTime = currTime - prevTime;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
/// Read data from pre-split ASCII files
|
||||||
|
/// @param[in] rank The current MPI rank the function is called from
|
||||||
|
/// @param[in] filename Name of the file with %d as placeholder for the integer index of the block
|
||||||
|
/// @param[in] blocksPerRank Number of data blocks to process on each rank
|
||||||
|
/// @param[out] nDims Number of data dimensions (i.e, 2 or 3)
|
||||||
|
/// @param[out] useDataSet VTKm partioned dataset to be used with the distributed contour tree filter
|
||||||
|
/// @param[out] globalSize Global extends of the input mesh (i.e., number of mesh points in each dimension)
|
||||||
|
/// @param[in] blocksPerDim Number of data blocks used in each data dimension
|
||||||
|
/// @param[in] localBlockIndices Array with the (x,y,z) index of each local data block with
|
||||||
|
/// with respect to blocksPerDim
|
||||||
|
/// @param[in] dataReadTime Time to read the data
|
||||||
|
/// @param[in] buildDatasetTime Time to construct the VTKm datasets
|
||||||
|
/// @returns bool indicating whether the read was successful or not
|
||||||
|
template <typename ValueType>
|
||||||
|
bool readPreSplitFiles(const int& rank,
|
||||||
|
const std::string& filename,
|
||||||
|
const int& blocksPerRank,
|
||||||
|
std::vector<vtkm::Float32>::size_type& nDims,
|
||||||
|
vtkm::cont::PartitionedDataSet& useDataSet,
|
||||||
|
vtkm::Id3& globalSize,
|
||||||
|
vtkm::Id3& blocksPerDim,
|
||||||
|
vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||||
|
vtkm::Float64& dataReadTime,
|
||||||
|
vtkm::Float64& buildDatasetTime)
|
||||||
|
{
|
||||||
|
vtkm::cont::Timer totalTime;
|
||||||
|
totalTime.Start();
|
||||||
|
vtkm::Float64 prevTime = 0;
|
||||||
|
vtkm::Float64 currTime = 0;
|
||||||
|
|
||||||
|
localBlockIndices.Allocate(blocksPerRank);
|
||||||
|
auto localBlockIndicesPortal = localBlockIndices.WritePortal();
|
||||||
|
for (int blockNo = 0; blockNo < blocksPerRank; ++blockNo)
|
||||||
|
{
|
||||||
|
// Translate pattern into filename for this block
|
||||||
|
char block_filename[256];
|
||||||
|
snprintf(block_filename,
|
||||||
|
sizeof(block_filename),
|
||||||
|
filename.c_str(),
|
||||||
|
static_cast<int>(rank * blocksPerRank + blockNo));
|
||||||
|
std::cout << "Reading file " << block_filename << std::endl;
|
||||||
|
|
||||||
|
// Open file
|
||||||
|
std::ifstream inFile(block_filename);
|
||||||
|
if (!inFile.is_open() || inFile.bad())
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Couldn't open file " << block_filename << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Read header with dimensions
|
||||||
|
std::string line;
|
||||||
|
std::string tag;
|
||||||
|
vtkm::Id dimVertices;
|
||||||
|
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream global_extents_stream(line);
|
||||||
|
global_extents_stream >> tag;
|
||||||
|
if (tag != "#GLOBAL_EXTENTS")
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Expected #GLOBAL_EXTENTS, got " << tag << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::vector<vtkm::Id> global_extents;
|
||||||
|
while (global_extents_stream >> dimVertices)
|
||||||
|
global_extents.push_back(dimVertices);
|
||||||
|
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(global_extents[0], global_extents[1]);
|
||||||
|
|
||||||
|
if (blockNo == 0)
|
||||||
|
{ // First block: Set globalSize
|
||||||
|
globalSize =
|
||||||
|
vtkm::Id3{ static_cast<vtkm::Id>(global_extents[0]),
|
||||||
|
static_cast<vtkm::Id>(global_extents[1]),
|
||||||
|
static_cast<vtkm::Id>(global_extents.size() > 2 ? global_extents[2] : 1) };
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{ // All other blocks: Consistency check of globalSize
|
||||||
|
if (globalSize !=
|
||||||
|
vtkm::Id3{ static_cast<vtkm::Id>(global_extents[0]),
|
||||||
|
static_cast<vtkm::Id>(global_extents[1]),
|
||||||
|
static_cast<vtkm::Id>(global_extents.size() > 2 ? global_extents[2] : 1) })
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Global extents mismatch between blocks!" << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream offset_stream(line);
|
||||||
|
offset_stream >> tag;
|
||||||
|
if (tag != "#OFFSET")
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Expected #OFFSET, got " << tag << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
std::vector<vtkm::Id> offset;
|
||||||
|
while (offset_stream >> dimVertices)
|
||||||
|
offset.push_back(dimVertices);
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(offset[0], offset[1]);
|
||||||
|
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream bpd_stream(line);
|
||||||
|
bpd_stream >> tag;
|
||||||
|
if (tag != "#BLOCKS_PER_DIM")
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Expected #BLOCKS_PER_DIM, got " << tag << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
std::vector<vtkm::Id> bpd;
|
||||||
|
while (bpd_stream >> dimVertices)
|
||||||
|
bpd.push_back(dimVertices);
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(bpd[0], bpd[1]);
|
||||||
|
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream blockIndex_stream(line);
|
||||||
|
blockIndex_stream >> tag;
|
||||||
|
if (tag != "#BLOCK_INDEX")
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Expected #BLOCK_INDEX, got " << tag << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
std::vector<vtkm::Id> blockIndex;
|
||||||
|
while (blockIndex_stream >> dimVertices)
|
||||||
|
blockIndex.push_back(dimVertices);
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(blockIndex[0], blockIndex[1]);
|
||||||
|
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream linestream(line);
|
||||||
|
std::vector<vtkm::Id> dims;
|
||||||
|
while (linestream >> dimVertices)
|
||||||
|
{
|
||||||
|
dims.push_back(dimVertices);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (dims.size() != global_extents.size() || dims.size() != offset.size())
|
||||||
|
{
|
||||||
|
std::cerr << "Error: Dimension mismatch" << std::endl;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(dims[0], dims[1]);
|
||||||
|
|
||||||
|
// Compute the number of vertices, i.e., xdim * ydim * zdim
|
||||||
|
nDims = static_cast<unsigned short>(dims.size());
|
||||||
|
std::size_t numVertices = static_cast<std::size_t>(
|
||||||
|
std::accumulate(dims.begin(), dims.end(), std::size_t(1), std::multiplies<std::size_t>()));
|
||||||
|
|
||||||
|
// Check for fatal input errors
|
||||||
|
// Check that the number of dimensiosn is either 2D or 3D
|
||||||
|
bool invalidNumDimensions = (nDims < 2 || nDims > 3);
|
||||||
|
// Log any errors if found on rank 0
|
||||||
|
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
||||||
|
invalidNumDimensions && (rank == 0),
|
||||||
|
"The input mesh is " << nDims
|
||||||
|
<< "D. "
|
||||||
|
"The input data must be either 2D or 3D.");
|
||||||
|
|
||||||
|
// If we found any errors in the setttings than finalize MPI and exit the execution
|
||||||
|
if (invalidNumDimensions)
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Read data
|
||||||
|
std::vector<ValueType> values(numVertices);
|
||||||
|
if (filename.compare(filename.length() - 5, 5, ".bdem") == 0)
|
||||||
|
{
|
||||||
|
inFile.read(reinterpret_cast<char*>(values.data()),
|
||||||
|
static_cast<std::streamsize>(numVertices * sizeof(ValueType)));
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
for (std::size_t vertex = 0; vertex < numVertices; ++vertex)
|
||||||
|
{
|
||||||
|
inFile >> values[vertex];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
dataReadTime = currTime - prevTime;
|
||||||
|
prevTime = currTime;
|
||||||
|
|
||||||
|
// Create vtk-m data set
|
||||||
|
vtkm::cont::DataSetBuilderUniform dsb;
|
||||||
|
vtkm::cont::DataSet ds;
|
||||||
|
if (nDims == 2)
|
||||||
|
{
|
||||||
|
const vtkm::Id2 v_dims{
|
||||||
|
static_cast<vtkm::Id>(dims[0]),
|
||||||
|
static_cast<vtkm::Id>(dims[1]),
|
||||||
|
};
|
||||||
|
const vtkm::Vec<ValueType, 2> v_origin{ static_cast<ValueType>(offset[0]),
|
||||||
|
static_cast<ValueType>(offset[1]) };
|
||||||
|
const vtkm::Vec<ValueType, 2> v_spacing{ 1, 1 };
|
||||||
|
ds = dsb.Create(v_dims, v_origin, v_spacing);
|
||||||
|
vtkm::cont::CellSetStructured<2> cs;
|
||||||
|
cs.SetPointDimensions(v_dims);
|
||||||
|
cs.SetGlobalPointDimensions(vtkm::Id2{ globalSize[0], globalSize[1] });
|
||||||
|
cs.SetGlobalPointIndexStart(vtkm::Id2{ offset[0], offset[1] });
|
||||||
|
ds.SetCellSet(cs);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
VTKM_ASSERT(nDims == 3);
|
||||||
|
const vtkm::Id3 v_dims{ static_cast<vtkm::Id>(dims[0]),
|
||||||
|
static_cast<vtkm::Id>(dims[1]),
|
||||||
|
static_cast<vtkm::Id>(dims[2]) };
|
||||||
|
const vtkm::Vec<ValueType, 3> v_origin{ static_cast<ValueType>(offset[0]),
|
||||||
|
static_cast<ValueType>(offset[1]),
|
||||||
|
static_cast<ValueType>(offset[2]) };
|
||||||
|
vtkm::Vec<ValueType, 3> v_spacing(1, 1, 1);
|
||||||
|
ds = dsb.Create(v_dims, v_origin, v_spacing);
|
||||||
|
vtkm::cont::CellSetStructured<3> cs;
|
||||||
|
cs.SetPointDimensions(v_dims);
|
||||||
|
cs.SetGlobalPointDimensions(globalSize);
|
||||||
|
cs.SetGlobalPointIndexStart(vtkm::Id3{ offset[0], offset[1], offset[2] });
|
||||||
|
ds.SetCellSet(cs);
|
||||||
|
}
|
||||||
|
|
||||||
|
ds.AddPointField("values", values);
|
||||||
|
// and add to partition
|
||||||
|
useDataSet.AppendPartition(ds);
|
||||||
|
|
||||||
|
localBlockIndicesPortal.Set(blockNo,
|
||||||
|
vtkm::Id3{ static_cast<vtkm::Id>(blockIndex[0]),
|
||||||
|
static_cast<vtkm::Id>(blockIndex[1]),
|
||||||
|
static_cast<vtkm::Id>(nDims == 3 ? blockIndex[2] : 0) });
|
||||||
|
|
||||||
|
if (blockNo == 0)
|
||||||
|
{
|
||||||
|
blocksPerDim = vtkm::Id3{ static_cast<vtkm::Id>(bpd[0]),
|
||||||
|
static_cast<vtkm::Id>(bpd[1]),
|
||||||
|
static_cast<vtkm::Id>(nDims == 3 ? bpd[2] : 1) };
|
||||||
|
}
|
||||||
|
}
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
buildDatasetTime = currTime - prevTime;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/// Read data from a single file and split the data into blocks across ranks
|
||||||
|
/// This is a simple implementation that will read the full data on all ranks
|
||||||
|
/// and then extract only the relevant subblock for that rank.
|
||||||
|
/// The function support reading from BOV as well from ASCII files
|
||||||
|
///
|
||||||
|
/// @param[in] rank The current MPI rank the function is called from
|
||||||
|
/// @param[in] size The number of MPI ranks
|
||||||
|
/// @param[in] filename Name of the file with %d as placeholder for the integer index of the block
|
||||||
|
/// @param[in] numBlocks Number of blocks to use during computation
|
||||||
|
/// @param[in] blocksPerRank Number of data blocks to process on each rank
|
||||||
|
/// @param[out] nDims Number of data dimensions (i.e, 2 or 3)
|
||||||
|
/// @param[out] useDataSet VTKm partioned dataset to be used with the distributed contour tree filter
|
||||||
|
/// @param[out] globalSize Global extends of the input mesh (i.e., number of mesh points in each dimension)
|
||||||
|
/// @param[in] blocksPerDim Number of data blocks used in each data dimension
|
||||||
|
/// @param[in] localBlockIndices Array with the (x,y,z) index of each local data block with
|
||||||
|
/// with respect to blocksPerDim
|
||||||
|
/// @param[in] dataReadTime Time to read the data
|
||||||
|
/// @param[in] buildDatasetTime Time to construct the VTKm datasets
|
||||||
|
/// @returns bool indicating whether the read was successful or not
|
||||||
|
template <typename ValueType>
|
||||||
|
bool readSingleBlockFile(const int& rank,
|
||||||
|
const int& size,
|
||||||
|
const std::string& filename,
|
||||||
|
const int& numBlocks,
|
||||||
|
const int& blocksPerRank,
|
||||||
|
std::vector<vtkm::Float32>::size_type& nDims,
|
||||||
|
vtkm::cont::PartitionedDataSet& useDataSet,
|
||||||
|
vtkm::Id3& globalSize,
|
||||||
|
vtkm::Id3& blocksPerDim,
|
||||||
|
vtkm::cont::ArrayHandle<vtkm::Id3>& localBlockIndices,
|
||||||
|
vtkm::Float64& dataReadTime,
|
||||||
|
vtkm::Float64& buildDatasetTime)
|
||||||
|
{
|
||||||
|
vtkm::cont::Timer totalTime;
|
||||||
|
totalTime.Start();
|
||||||
|
vtkm::Float64 prevTime = 0;
|
||||||
|
vtkm::Float64 currTime = 0;
|
||||||
|
|
||||||
|
localBlockIndices.Allocate(blocksPerRank);
|
||||||
|
auto localBlockIndicesPortal = localBlockIndices.WritePortal();
|
||||||
|
|
||||||
|
vtkm::cont::DataSet inDataSet;
|
||||||
|
// TODO: Currently FloatDefault would be fine, but it could cause problems if we ever read binary files here.
|
||||||
|
std::vector<ValueType> values;
|
||||||
|
std::vector<vtkm::Id> dims;
|
||||||
|
|
||||||
|
// Read BOV data file
|
||||||
|
if (filename.compare(filename.length() - 3, 3, "bov") == 0)
|
||||||
|
{
|
||||||
|
std::cout << "Reading BOV file" << std::endl;
|
||||||
|
vtkm::io::BOVDataSetReader reader(filename);
|
||||||
|
inDataSet = reader.ReadDataSet();
|
||||||
|
nDims = 3;
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
dataReadTime = currTime - prevTime;
|
||||||
|
prevTime = currTime;
|
||||||
|
// Copy the data into the values array so we can construct a multiblock dataset
|
||||||
|
vtkm::Id3 pointDimensions;
|
||||||
|
auto cellSet = inDataSet.GetCellSet();
|
||||||
|
vtkm::cont::CastAndCall(
|
||||||
|
cellSet, vtkm::worklet::contourtree_augmented::GetPointDimensions(), pointDimensions);
|
||||||
|
std::cout << "Point dimensions are " << pointDimensions << std::endl;
|
||||||
|
dims.resize(3);
|
||||||
|
dims[0] = pointDimensions[0];
|
||||||
|
dims[1] = pointDimensions[1];
|
||||||
|
dims[2] = pointDimensions[2];
|
||||||
|
auto tempFieldData = inDataSet.GetField(0).GetData();
|
||||||
|
values.resize(static_cast<std::size_t>(tempFieldData.GetNumberOfValues()));
|
||||||
|
auto valuesHandle = vtkm::cont::make_ArrayHandle(values, vtkm::CopyFlag::Off);
|
||||||
|
vtkm::cont::ArrayCopy(tempFieldData, valuesHandle);
|
||||||
|
valuesHandle.SyncControlArray(); //Forces values to get updated if copy happened on GPU
|
||||||
|
}
|
||||||
|
// Read ASCII data input
|
||||||
|
else
|
||||||
|
{
|
||||||
|
std::cout << "Reading ASCII file" << std::endl;
|
||||||
|
std::ifstream inFile(filename);
|
||||||
|
if (inFile.bad())
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
// Read the dimensions of the mesh, i.e,. number of elementes in x, y, and z
|
||||||
|
std::string line;
|
||||||
|
getline(inFile, line);
|
||||||
|
std::istringstream linestream(line);
|
||||||
|
vtkm::Id dimVertices;
|
||||||
|
while (linestream >> dimVertices)
|
||||||
|
{
|
||||||
|
dims.push_back(dimVertices);
|
||||||
|
}
|
||||||
|
// Swap dimensions so that they are from fastest to slowest growing
|
||||||
|
// dims[0] -> col; dims[1] -> row, dims[2] ->slice
|
||||||
|
std::swap(dims[0], dims[1]);
|
||||||
|
|
||||||
|
// Compute the number of vertices, i.e., xdim * ydim * zdim
|
||||||
|
nDims = static_cast<unsigned short>(dims.size());
|
||||||
|
std::size_t numVertices = static_cast<std::size_t>(
|
||||||
|
std::accumulate(dims.begin(), dims.end(), std::size_t(1), std::multiplies<std::size_t>()));
|
||||||
|
|
||||||
|
// Check the the number of dimensiosn is either 2D or 3D
|
||||||
|
bool invalidNumDimensions = (nDims < 2 || nDims > 3);
|
||||||
|
// Log any errors if found on rank 0
|
||||||
|
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
||||||
|
invalidNumDimensions && (rank == 0),
|
||||||
|
"The input mesh is " << nDims << "D. The input data must be either 2D or 3D.");
|
||||||
|
// If we found any errors in the setttings than finalize MPI and exit the execution
|
||||||
|
if (invalidNumDimensions)
|
||||||
|
{
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Read data
|
||||||
|
values.resize(numVertices);
|
||||||
|
for (std::size_t vertex = 0; vertex < numVertices; ++vertex)
|
||||||
|
{
|
||||||
|
inFile >> values[vertex];
|
||||||
|
}
|
||||||
|
|
||||||
|
// finish reading the data
|
||||||
|
inFile.close();
|
||||||
|
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
dataReadTime = currTime - prevTime;
|
||||||
|
prevTime = currTime;
|
||||||
|
|
||||||
|
} // END ASCII Read
|
||||||
|
|
||||||
|
// Create a multi-block dataset for multi-block DIY-paralle processing
|
||||||
|
blocksPerDim =
|
||||||
|
nDims == 3 ? vtkm::Id3(1, 1, numBlocks) : vtkm::Id3(1, numBlocks, 1); // Decompose the data into
|
||||||
|
globalSize = nDims == 3 ? vtkm::Id3(static_cast<vtkm::Id>(dims[0]),
|
||||||
|
static_cast<vtkm::Id>(dims[1]),
|
||||||
|
static_cast<vtkm::Id>(dims[2]))
|
||||||
|
: vtkm::Id3(static_cast<vtkm::Id>(dims[0]),
|
||||||
|
static_cast<vtkm::Id>(dims[1]),
|
||||||
|
static_cast<vtkm::Id>(1));
|
||||||
|
std::cout << blocksPerDim << " " << globalSize << std::endl;
|
||||||
|
{
|
||||||
|
vtkm::Id lastDimSize =
|
||||||
|
(nDims == 2) ? static_cast<vtkm::Id>(dims[1]) : static_cast<vtkm::Id>(dims[2]);
|
||||||
|
if (size > (lastDimSize / 2.))
|
||||||
|
{
|
||||||
|
VTKM_LOG_IF_S(vtkm::cont::LogLevel::Error,
|
||||||
|
rank == 0,
|
||||||
|
"Number of ranks too large for data. Use " << lastDimSize / 2
|
||||||
|
<< "or fewer ranks");
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
vtkm::Id standardBlockSize = (vtkm::Id)(lastDimSize / numBlocks);
|
||||||
|
vtkm::Id blockSize = standardBlockSize;
|
||||||
|
vtkm::Id blockSliceSize =
|
||||||
|
nDims == 2 ? static_cast<vtkm::Id>(dims[0]) : static_cast<vtkm::Id>((dims[0] * dims[1]));
|
||||||
|
vtkm::Id blockNumValues = blockSize * blockSliceSize;
|
||||||
|
|
||||||
|
vtkm::Id startBlock = blocksPerRank * rank;
|
||||||
|
vtkm::Id endBlock = startBlock + blocksPerRank;
|
||||||
|
for (vtkm::Id blockIndex = startBlock; blockIndex < endBlock; ++blockIndex)
|
||||||
|
{
|
||||||
|
vtkm::Id localBlockIndex = blockIndex - startBlock;
|
||||||
|
vtkm::Id blockStart = blockIndex * blockNumValues;
|
||||||
|
vtkm::Id blockEnd = blockStart + blockNumValues;
|
||||||
|
if (blockIndex < (numBlocks - 1)) // add overlap between regions
|
||||||
|
{
|
||||||
|
blockEnd += blockSliceSize;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
blockEnd = lastDimSize * blockSliceSize;
|
||||||
|
}
|
||||||
|
vtkm::Id currBlockSize = (vtkm::Id)((blockEnd - blockStart) / blockSliceSize);
|
||||||
|
|
||||||
|
vtkm::cont::DataSetBuilderUniform dsb;
|
||||||
|
vtkm::cont::DataSet ds;
|
||||||
|
|
||||||
|
// 2D data
|
||||||
|
if (nDims == 2)
|
||||||
|
{
|
||||||
|
vtkm::Id2 vdims;
|
||||||
|
vdims[0] = static_cast<vtkm::Id>(dims[0]);
|
||||||
|
vdims[1] = static_cast<vtkm::Id>(currBlockSize);
|
||||||
|
vtkm::Vec<ValueType, 2> origin(0, blockIndex * blockSize);
|
||||||
|
vtkm::Vec<ValueType, 2> spacing(1, 1);
|
||||||
|
ds = dsb.Create(vdims, origin, spacing);
|
||||||
|
vtkm::cont::CellSetStructured<2> cs;
|
||||||
|
cs.SetPointDimensions(vdims);
|
||||||
|
cs.SetGlobalPointDimensions(vtkm::Id2{ globalSize[0], globalSize[1] });
|
||||||
|
cs.SetGlobalPointIndexStart(vtkm::Id2{ 0, (blockStart / blockSliceSize) });
|
||||||
|
ds.SetCellSet(cs);
|
||||||
|
localBlockIndicesPortal.Set(localBlockIndex, vtkm::Id3(0, blockIndex, 0));
|
||||||
|
}
|
||||||
|
// 3D data
|
||||||
|
else
|
||||||
|
{
|
||||||
|
vtkm::Id3 vdims;
|
||||||
|
vdims[0] = static_cast<vtkm::Id>(dims[0]);
|
||||||
|
vdims[1] = static_cast<vtkm::Id>(dims[1]);
|
||||||
|
vdims[2] = static_cast<vtkm::Id>(currBlockSize);
|
||||||
|
vtkm::Vec<ValueType, 3> origin(0, 0, (blockIndex * blockSize));
|
||||||
|
vtkm::Vec<ValueType, 3> spacing(1, 1, 1);
|
||||||
|
ds = dsb.Create(vdims, origin, spacing);
|
||||||
|
vtkm::cont::CellSetStructured<3> cs;
|
||||||
|
cs.SetPointDimensions(vdims);
|
||||||
|
cs.SetGlobalPointDimensions(globalSize);
|
||||||
|
cs.SetGlobalPointIndexStart(vtkm::Id3(0, 0, blockStart / blockSliceSize));
|
||||||
|
ds.SetCellSet(cs);
|
||||||
|
localBlockIndicesPortal.Set(localBlockIndex, vtkm::Id3(0, 0, blockIndex));
|
||||||
|
}
|
||||||
|
|
||||||
|
std::vector<vtkm::Float32> subValues((values.begin() + blockStart),
|
||||||
|
(values.begin() + blockEnd));
|
||||||
|
|
||||||
|
ds.AddPointField("values", subValues);
|
||||||
|
useDataSet.AppendPartition(ds);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
currTime = totalTime.GetElapsedTime();
|
||||||
|
buildDatasetTime = currTime - prevTime;
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
#endif
|
@ -6,16 +6,24 @@ import sys
|
|||||||
# For readBOV
|
# For readBOV
|
||||||
from functools import reduce
|
from functools import reduce
|
||||||
import operator
|
import operator
|
||||||
|
try:
|
||||||
|
import h5py
|
||||||
|
USE_HDF = True
|
||||||
|
except:
|
||||||
|
USE_HDF = False
|
||||||
|
|
||||||
# Read a 3D text file from disk into a NumPy array
|
|
||||||
# ... Plain text
|
|
||||||
def read_file(fn):
|
def read_file(fn):
|
||||||
|
"""
|
||||||
|
Read a 3D plain text file from disk into a NumPy array
|
||||||
|
"""
|
||||||
data = np.fromfile(fn, dtype=float, sep=" ")
|
data = np.fromfile(fn, dtype=float, sep=" ")
|
||||||
data = data[3:].reshape((int(data[2]),int(data[0]),int(data[1])))
|
data = data[3:].reshape((int(data[2]),int(data[0]),int(data[1])))
|
||||||
return data
|
return data
|
||||||
|
|
||||||
# ... VisItBOV
|
|
||||||
def readBOV(filename):
|
def readBOV(filename):
|
||||||
|
"""
|
||||||
|
Read data from a VisIt BOV file
|
||||||
|
"""
|
||||||
with open(filename, 'r') as f:
|
with open(filename, 'r') as f:
|
||||||
header = dict([(lambda x: (x[0].strip().lower(), x[1].strip()))(l.strip().split(':')) for l in f.readlines()])
|
header = dict([(lambda x: (x[0].strip().lower(), x[1].strip()))(l.strip().split(':')) for l in f.readlines()])
|
||||||
if 'data_endian' in header:
|
if 'data_endian' in header:
|
||||||
@ -32,11 +40,22 @@ def readBOV(filename):
|
|||||||
return (header['variable'], header['centering'].lower(), np.fromfile(dataname, dtype, count).reshape(tuple(reversed(shape))))
|
return (header['variable'], header['centering'].lower(), np.fromfile(dataname, dtype, count).reshape(tuple(reversed(shape))))
|
||||||
return None
|
return None
|
||||||
|
|
||||||
# Save a block from a 3D NumPy array to disk
|
|
||||||
# Python order is slice, row, col
|
|
||||||
# TXT file order is row, col, slice
|
|
||||||
# offset and size are in file order
|
|
||||||
def save_piece(fn, array, offset, n_blocks, block_index, size):
|
def save_piece(fn, array, offset, n_blocks, block_index, size):
|
||||||
|
"""
|
||||||
|
Save a block from a 3D NumPy array to disk.
|
||||||
|
|
||||||
|
Python order is slice, row, col
|
||||||
|
TXT file order is row, col, slice
|
||||||
|
offset and size are in file order
|
||||||
|
|
||||||
|
Args:
|
||||||
|
fn (str): filename
|
||||||
|
array (np.array) : Array with the full data
|
||||||
|
offset (tuple) : Tuple of int offsets
|
||||||
|
n_blocks (tuple) : Tuple of ints with the number of blocks per dimension
|
||||||
|
block_index (tuple) : Tuple of ints with index of the block
|
||||||
|
size (tuple) : Tuple of ints with the size of the block in each dimension
|
||||||
|
"""
|
||||||
with open(fn, 'w') as f:
|
with open(fn, 'w') as f:
|
||||||
perm = [1, 2, 0]
|
perm = [1, 2, 0]
|
||||||
f.write('#GLOBAL_EXTENTS ' + ' '.join(map(str, [array.shape[i] for i in perm])) + '\n')
|
f.write('#GLOBAL_EXTENTS ' + ' '.join(map(str, [array.shape[i] for i in perm])) + '\n')
|
||||||
@ -51,51 +70,79 @@ def save_piece(fn, array, offset, n_blocks, block_index, size):
|
|||||||
np.savetxt(f, array[s, offset[0]:offset[0]+size[0],offset[1]:offset[1]+size[1]], fmt='%.16g')
|
np.savetxt(f, array[s, offset[0]:offset[0]+size[0],offset[1]:offset[1]+size[1]], fmt='%.16g')
|
||||||
f.write('\n')
|
f.write('\n')
|
||||||
|
|
||||||
# Compute split points for splitting into n blocks
|
|
||||||
def split_points(shape, nblocks):
|
def split_points(shape, nblocks):
|
||||||
|
"""
|
||||||
|
Compute split points for splitting into n blocks:
|
||||||
|
|
||||||
|
Args:
|
||||||
|
shape (int): Length of the axis
|
||||||
|
nblocks (int): Number of blocks to split the axis into
|
||||||
|
|
||||||
|
Return:
|
||||||
|
List of split points along the axis
|
||||||
|
"""
|
||||||
dx = float(shape-1) / nblocks
|
dx = float(shape-1) / nblocks
|
||||||
return [ math.floor(i*dx) for i in range(nblocks)] + [ shape - 1 ]
|
return [ math.floor(i*dx) for i in range(nblocks)] + [ shape - 1 ]
|
||||||
|
|
||||||
if len(sys.argv) < 2:
|
def save_hdf(filename, data, **kwargs):
|
||||||
print("Error: Usage split_data_3d.py <filename> <outfilepattern> [<n_blocks_per_axis>|<n_blocks_x> <n_blocks_y> <n_blocks_z>]", file=sys.stderr)
|
"""
|
||||||
sys.exit(1)
|
Save the data to HDF5.
|
||||||
|
The axes of the data will be transposed and reorded to match the order of save_piece function.
|
||||||
|
|
||||||
# Parse parameters
|
Args:
|
||||||
in_filename = sys.argv[1]
|
filename (str) : Name fo the HDF5 file
|
||||||
|
data (np.array): 3D array with the data
|
||||||
|
kwargs (dict) : Dict with keyword arguments for the h5py create_dataset function
|
||||||
|
"""
|
||||||
|
f = h5py.File(filename, 'w')
|
||||||
|
f.create_dataset(name='data', data=np.swapaxes(np.transpose(data), 0, 1), **kwargs)
|
||||||
|
|
||||||
name, ext = os.path.splitext(in_filename)
|
if __name__ == '__main__':
|
||||||
#out_filename_pattern = name + '_split_%d.txt'
|
|
||||||
out_filename_pattern = sys.argv[2]
|
|
||||||
|
|
||||||
n_blocks = (2, 2, 2)
|
if len(sys.argv) < 2:
|
||||||
if len(sys.argv) > 3:
|
print("Error: Usage split_data_3d.py <filename> <outfilepattern> [<n_blocks_per_axis>|<n_blocks_x> <n_blocks_y> <n_blocks_z>]", file=sys.stderr)
|
||||||
if len(sys.argv) >= 6:
|
sys.exit(1)
|
||||||
n_blocks = (int(sys.argv[3]), int(sys.argv[4]), int(sys.argv[5]))
|
|
||||||
|
# Parse parameters
|
||||||
|
in_filename = sys.argv[1]
|
||||||
|
|
||||||
|
name, ext = os.path.splitext(in_filename)
|
||||||
|
#out_filename_pattern = name + '_split_%d.txt'
|
||||||
|
out_filename_pattern = sys.argv[2]
|
||||||
|
|
||||||
|
n_blocks = (2, 2, 2)
|
||||||
|
if len(sys.argv) > 3:
|
||||||
|
if len(sys.argv) >= 6:
|
||||||
|
n_blocks = (int(sys.argv[3]), int(sys.argv[4]), int(sys.argv[5]))
|
||||||
|
else:
|
||||||
|
n_blocks = (int(sys.argv[3]), int(sys.argv[3]), int(sys.argv[3]))
|
||||||
|
|
||||||
|
# Read data
|
||||||
|
if ext == '.bov':
|
||||||
|
data = readBOV(in_filename)[2]
|
||||||
else:
|
else:
|
||||||
n_blocks = (int(sys.argv[3]), int(sys.argv[3]), int(sys.argv[3]))
|
data = read_file(in_filename)
|
||||||
|
|
||||||
# Read data
|
# export to hdf5 as well
|
||||||
if ext == '.bov':
|
if USE_HDF:
|
||||||
data = readBOV(in_filename)[2]
|
save_hdf((out_filename_pattern % 0).replace('.txt', '.h5'), data)
|
||||||
else:
|
|
||||||
data = read_file(in_filename)
|
|
||||||
|
|
||||||
# Python order is slice, row, col
|
# Python order is slice, row, col
|
||||||
# Compute split points
|
# Compute split points
|
||||||
split_points_s = split_points(data.shape[0], n_blocks[2])
|
split_points_s = split_points(data.shape[0], n_blocks[2])
|
||||||
split_points_r = split_points(data.shape[1], n_blocks[0])
|
split_points_r = split_points(data.shape[1], n_blocks[0])
|
||||||
split_points_c = split_points(data.shape[2], n_blocks[1])
|
split_points_c = split_points(data.shape[2], n_blocks[1])
|
||||||
|
|
||||||
# Create the file that records the slice values
|
# Create the file that records the slice values
|
||||||
slice_filename = name + '_slices.txt'
|
slice_filename = name + '_slices.txt'
|
||||||
|
|
||||||
# Save blocks
|
# Save blocks
|
||||||
block_no = 0
|
block_no = 0
|
||||||
for block_index_s, (s_start, s_stop) in enumerate(zip(split_points_s, split_points_s[1:])):
|
for block_index_s, (s_start, s_stop) in enumerate(zip(split_points_s, split_points_s[1:])):
|
||||||
for block_index_r, (r_start, r_stop) in enumerate(zip(split_points_r, split_points_r[1:])):
|
for block_index_r, (r_start, r_stop) in enumerate(zip(split_points_r, split_points_r[1:])):
|
||||||
for block_index_c, (c_start, c_stop) in enumerate(zip(split_points_c, split_points_c[1:])):
|
for block_index_c, (c_start, c_stop) in enumerate(zip(split_points_c, split_points_c[1:])):
|
||||||
n_s = s_stop - s_start + 1
|
n_s = s_stop - s_start + 1
|
||||||
n_r = r_stop - r_start + 1
|
n_r = r_stop - r_start + 1
|
||||||
n_c = c_stop - c_start + 1
|
n_c = c_stop - c_start + 1
|
||||||
save_piece(out_filename_pattern % block_no, data, (r_start, c_start, s_start), n_blocks, (block_index_r, block_index_c, block_index_s), (n_r, n_c, n_s))
|
save_piece(out_filename_pattern % block_no, data, (r_start, c_start, s_start), n_blocks, (block_index_r, block_index_c, block_index_s), (n_r, n_c, n_s))
|
||||||
block_no += 1
|
block_no += 1
|
||||||
|
@ -18,7 +18,6 @@
|
|||||||
#include <vtkm/filter/flow/ParticleAdvection.h>
|
#include <vtkm/filter/flow/ParticleAdvection.h>
|
||||||
#include <vtkm/io/VTKDataSetReader.h>
|
#include <vtkm/io/VTKDataSetReader.h>
|
||||||
#include <vtkm/io/VTKDataSetWriter.h>
|
#include <vtkm/io/VTKDataSetWriter.h>
|
||||||
#include <vtkm/io/reader/VTKDataSetReader.h>
|
|
||||||
|
|
||||||
#include <mpi.h>
|
#include <mpi.h>
|
||||||
#include <vtkm/thirdparty/diy/diy.h>
|
#include <vtkm/thirdparty/diy/diy.h>
|
||||||
|
@ -85,7 +85,7 @@ vtkm_library(
|
|||||||
|
|
||||||
if (VTKm_ENABLE_HDF5_IO)
|
if (VTKm_ENABLE_HDF5_IO)
|
||||||
target_include_directories(vtkm_io PRIVATE $<BUILD_INTERFACE:${HDF5_INCLUDE_DIR}>)
|
target_include_directories(vtkm_io PRIVATE $<BUILD_INTERFACE:${HDF5_INCLUDE_DIR}>)
|
||||||
target_link_libraries(vtkm_io PRIVATE ${HDF5_HL_LIBRARIES})
|
target_link_libraries(vtkm_io PRIVATE ${HDF5_HL_LIBRARIES} ${HDF5_LIBRARIES})
|
||||||
endif()
|
endif()
|
||||||
|
|
||||||
add_subdirectory(internal)
|
add_subdirectory(internal)
|
||||||
|
Loading…
Reference in New Issue
Block a user