mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-09-20 02:55:47 +00:00
ea0bbfeefc
Sometimes the CUDA runtime would not allocate sufficient stack space for the particle advection code to run. This issue was exposed by !1737 -- for some reason, once those changes to unrelated filters/worklets are added to VTK, CUDA allocates less stack and the following tests would fail: UnitTestLagrangianFilterCUDA UnitTestLagrangianStructuresFilterCUDA UnitTestStreamlineFilterCUDA UnitTestStreamSurfaceFilterCUDA These were fixed by increasing the stack size in the particle advection worklet Run(...) methods. An RAII helper has been added that will restore the previous stack size in case an exception is thrown, and the KDTree code has been updated to use this helper when it adjusts the CUDA stack allocation.
222 lines
8.3 KiB
C++
222 lines
8.3 KiB
C++
//============================================================================
|
|
// 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.
|
|
//============================================================================
|
|
|
|
#ifndef vtk_m_worklet_KdTree3DNNSearch_h
|
|
#define vtk_m_worklet_KdTree3DNNSearch_h
|
|
|
|
#include <vtkm/cont/DeviceAdapterAlgorithm.h>
|
|
|
|
#include <vtkm/Math.h>
|
|
#include <vtkm/cont/Algorithm.h>
|
|
#include <vtkm/cont/ArrayHandle.h>
|
|
#include <vtkm/cont/ArrayHandleCounting.h>
|
|
#include <vtkm/cont/ArrayHandleReverse.h>
|
|
|
|
#include <vtkm/worklet/DispatcherMapField.h>
|
|
#include <vtkm/worklet/WorkletMapField.h>
|
|
#include <vtkm/worklet/internal/DispatcherBase.h>
|
|
#include <vtkm/worklet/internal/WorkletBase.h>
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace worklet
|
|
{
|
|
namespace spatialstructure
|
|
{
|
|
|
|
class KdTree3DNNSearch
|
|
{
|
|
public:
|
|
class NearestNeighborSearch3DWorklet : public vtkm::worklet::WorkletMapField
|
|
{
|
|
public:
|
|
using ControlSignature = void(FieldIn qcIn,
|
|
WholeArrayIn treeIdIn,
|
|
WholeArrayIn treeSplitIdIn,
|
|
WholeArrayIn treeCoordiIn,
|
|
FieldOut nnIdOut,
|
|
FieldInOut nnDisOut);
|
|
using ExecutionSignature = void(_1, _2, _3, _4, _5, _6);
|
|
|
|
VTKM_CONT
|
|
NearestNeighborSearch3DWorklet() {}
|
|
|
|
template <typename CooriVecT, typename CooriT, typename IdPortalT, typename CoordiPortalT>
|
|
VTKM_EXEC_CONT void NearestNeighborSearch3D(const CooriVecT& qc,
|
|
CooriT& dis,
|
|
vtkm::Id& nnpIdx,
|
|
vtkm::Int32 level,
|
|
vtkm::Id sIdx,
|
|
vtkm::Id tIdx,
|
|
const IdPortalT& treePortal,
|
|
const IdPortalT& splitIdPortal,
|
|
const CoordiPortalT& coordiPortal) const
|
|
{
|
|
CooriT qx = qc[0];
|
|
CooriT qy = qc[1];
|
|
CooriT qz = qc[2];
|
|
|
|
if (tIdx - sIdx == 1)
|
|
{ ///// leaf node
|
|
vtkm::Id leafNodeIdx = treePortal.Get(sIdx);
|
|
CooriT leafX = coordiPortal.Get(leafNodeIdx)[0];
|
|
CooriT leafY = coordiPortal.Get(leafNodeIdx)[1];
|
|
CooriT leafZ = coordiPortal.Get(leafNodeIdx)[2];
|
|
CooriT _dis = vtkm::Sqrt((leafX - qx) * (leafX - qx) + (leafY - qy) * (leafY - qy) +
|
|
(leafZ - qz) * (leafZ - qz));
|
|
if (_dis < dis)
|
|
{
|
|
dis = _dis;
|
|
nnpIdx = leafNodeIdx;
|
|
}
|
|
}
|
|
else
|
|
{ //normal Node
|
|
vtkm::Id splitNodeLoc = static_cast<vtkm::Id>(vtkm::Ceil(double((sIdx + tIdx)) / 2.0));
|
|
CooriT splitX = coordiPortal.Get(splitIdPortal.Get(splitNodeLoc))[0];
|
|
CooriT splitY = coordiPortal.Get(splitIdPortal.Get(splitNodeLoc))[1];
|
|
CooriT splitZ = coordiPortal.Get(splitIdPortal.Get(splitNodeLoc))[2];
|
|
|
|
CooriT splitAxis;
|
|
CooriT queryCoordi;
|
|
|
|
if (level % 3 == 0)
|
|
{ //x axis level
|
|
splitAxis = splitX;
|
|
queryCoordi = qx;
|
|
}
|
|
else if (level % 3 == 1)
|
|
{
|
|
splitAxis = splitY;
|
|
queryCoordi = qy;
|
|
}
|
|
else
|
|
{
|
|
splitAxis = splitZ;
|
|
queryCoordi = qz;
|
|
}
|
|
|
|
if (queryCoordi <= splitAxis)
|
|
{ //left tree first
|
|
if (queryCoordi - dis <= splitAxis)
|
|
NearestNeighborSearch3D(qc,
|
|
dis,
|
|
nnpIdx,
|
|
level + 1,
|
|
sIdx,
|
|
splitNodeLoc,
|
|
treePortal,
|
|
splitIdPortal,
|
|
coordiPortal);
|
|
if (queryCoordi + dis > splitAxis)
|
|
NearestNeighborSearch3D(qc,
|
|
dis,
|
|
nnpIdx,
|
|
level + 1,
|
|
splitNodeLoc,
|
|
tIdx,
|
|
treePortal,
|
|
splitIdPortal,
|
|
coordiPortal);
|
|
}
|
|
else
|
|
{ //right tree first
|
|
if (queryCoordi + dis > splitAxis)
|
|
NearestNeighborSearch3D(qc,
|
|
dis,
|
|
nnpIdx,
|
|
level + 1,
|
|
splitNodeLoc,
|
|
tIdx,
|
|
treePortal,
|
|
splitIdPortal,
|
|
coordiPortal);
|
|
if (queryCoordi - dis <= splitAxis)
|
|
NearestNeighborSearch3D(qc,
|
|
dis,
|
|
nnpIdx,
|
|
level + 1,
|
|
sIdx,
|
|
splitNodeLoc,
|
|
treePortal,
|
|
splitIdPortal,
|
|
coordiPortal);
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename CoordiVecType,
|
|
typename IdPortalType,
|
|
typename CoordiPortalType,
|
|
typename IdType,
|
|
typename CoordiType>
|
|
VTKM_EXEC void operator()(const CoordiVecType& qc,
|
|
const IdPortalType& treeIdPortal,
|
|
const IdPortalType& treeSplitIdPortal,
|
|
const CoordiPortalType& treeCoordiPortal,
|
|
IdType& nnId,
|
|
CoordiType& nnDis) const
|
|
{
|
|
NearestNeighborSearch3D(qc,
|
|
nnDis,
|
|
nnId,
|
|
0,
|
|
0,
|
|
treeIdPortal.GetNumberOfValues(),
|
|
treeIdPortal,
|
|
treeSplitIdPortal,
|
|
treeCoordiPortal);
|
|
}
|
|
};
|
|
|
|
/// \brief Execute the Neaseat Neighbor Search given kdtree and search points
|
|
///
|
|
/// Given x, y, z coordinate of of training data points in \c coordi_Handle, indices to KD-tree
|
|
/// leaf nodes in \c pointId_Handle and indices to internal nodes in \c splitId_Handle, search
|
|
/// for nearest neighbors in the training data points for each of testing points in \c qc_Handle.
|
|
/// Returns indices to nearest neighbor in \c nnId_Handle and distance to nearest neighbor in
|
|
/// \c nnDis_Handle.
|
|
|
|
template <typename CoordType,
|
|
typename CoordStorageTag1,
|
|
typename CoordStorageTag2,
|
|
typename DeviceAdapter>
|
|
void Run(const vtkm::cont::ArrayHandle<vtkm::Vec<CoordType, 3>, CoordStorageTag1>& coordi_Handle,
|
|
const vtkm::cont::ArrayHandle<vtkm::Id>& pointId_Handle,
|
|
const vtkm::cont::ArrayHandle<vtkm::Id>& splitId_Handle,
|
|
const vtkm::cont::ArrayHandle<vtkm::Vec<CoordType, 3>, CoordStorageTag2>& qc_Handle,
|
|
vtkm::cont::ArrayHandle<vtkm::Id>& nnId_Handle,
|
|
vtkm::cont::ArrayHandle<CoordType>& nnDis_Handle,
|
|
DeviceAdapter)
|
|
{
|
|
//fill the nnDis_Handle handle array with max values before running
|
|
auto intialValue = std::numeric_limits<CoordType>::max();
|
|
vtkm::cont::Algorithm::Copy(
|
|
vtkm::cont::make_ArrayHandleConstant(intialValue, qc_Handle.GetNumberOfValues()),
|
|
nnDis_Handle);
|
|
|
|
//set up stack size for cuda environment
|
|
#ifdef VTKM_CUDA
|
|
vtkm::cont::cuda::ScopedCudaStackSize stack(16 * 1024);
|
|
(void)stack;
|
|
#endif
|
|
|
|
NearestNeighborSearch3DWorklet nns3dWorklet;
|
|
vtkm::worklet::DispatcherMapField<NearestNeighborSearch3DWorklet> nns3DDispatcher(nns3dWorklet);
|
|
nns3DDispatcher.Invoke(
|
|
qc_Handle, pointId_Handle, splitId_Handle, coordi_Handle, nnId_Handle, nnDis_Handle);
|
|
}
|
|
};
|
|
}
|
|
}
|
|
} // namespace vtkm::worklet
|
|
|
|
#endif // vtk_m_worklet_KdTree3DNNSearch_h
|