172 lines
7.0 KiB
C
172 lines
7.0 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.
|
||
|
//
|
||
|
// 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.
|
||
|
//
|
||
|
//=============================================================================
|
||
|
//
|
||
|
// This code is an extension of the algorithm presented in the paper:
|
||
|
// Parallel Peak Pruning for Scalable SMP Contour Tree Computation.
|
||
|
// Hamish Carr, Gunther Weber, Christopher Sewell, and James Ahrens.
|
||
|
// Proceedings of the IEEE Symposium on Large Data Analysis and Visualization
|
||
|
// (LDAV), October 2016, Baltimore, Maryland.
|
||
|
//
|
||
|
// The PPP2 algorithm and software were jointly developed by
|
||
|
// Hamish Carr (University of Leeds), Gunther H. Weber (LBNL), and
|
||
|
// Oliver Ruebel (LBNL)
|
||
|
//==============================================================================
|
||
|
|
||
|
// include guard
|
||
|
#ifndef vtkm_worklet_contourtree_ppp2_array_transforms_h
|
||
|
#define vtkm_worklet_contourtree_ppp2_array_transforms_h
|
||
|
|
||
|
// global libraries
|
||
|
#include <vtkm/cont/ArrayHandle.h>
|
||
|
#include <vtkm/cont/ArrayHandlePermutation.h>
|
||
|
#include <vtkm/cont/ArrayHandleTransform.h>
|
||
|
#include <vtkm/cont/DeviceAdapterAlgorithm.h>
|
||
|
|
||
|
// local includes
|
||
|
#include "Types.h"
|
||
|
|
||
|
|
||
|
namespace vtkm
|
||
|
{
|
||
|
namespace worklet
|
||
|
{
|
||
|
namespace contourtree_ppp2
|
||
|
{
|
||
|
|
||
|
|
||
|
// permute routines
|
||
|
template <typename ValueType, typename ArrayType, typename DeviceAdapter>
|
||
|
void permuteArray(const ArrayType& input, IdArrayType& permute, ArrayType& output)
|
||
|
{ // permuteValues()
|
||
|
typedef vtkm::cont::DeviceAdapterAlgorithm<DeviceAdapter> DeviceAlgorithm;
|
||
|
typedef vtkm::cont::ArrayHandleTransform<IdArrayType, MaskedIndexFunctor<ValueType>>
|
||
|
transform_type;
|
||
|
typedef vtkm::cont::ArrayHandlePermutation<transform_type, ArrayType> permute_type;
|
||
|
|
||
|
// resize the output, i.e., output.resize(permute.size());
|
||
|
vtkm::Id permNumValues = permute.GetNumberOfValues();
|
||
|
vtkm::Id outNumValues = output.GetNumberOfValues();
|
||
|
if (permNumValues > outNumValues)
|
||
|
{
|
||
|
output.Allocate(permNumValues);
|
||
|
}
|
||
|
else if (permNumValues < outNumValues)
|
||
|
{
|
||
|
output.Shrink(permNumValues);
|
||
|
} // else the output has already the correct size
|
||
|
|
||
|
// The following is equivilant to doing the following in serial
|
||
|
//
|
||
|
// for (vtkm::Id entry = 0; entry < permute.size(); entry++)
|
||
|
// output[entry] = input[maskedIndex(permute[entry])];
|
||
|
//
|
||
|
// Apply the maskedIndex functor to the permute array. ArrayHandleTransform is a fancy vtkm array, i.e.,
|
||
|
// the function is applied on-the-fly without creating a copy of the array.
|
||
|
transform_type maskedPermuteIndex =
|
||
|
vtkm::cont::make_ArrayHandleTransform(permute, MaskedIndexFunctor<ValueType>());
|
||
|
// Permute the input array based on the maskedPermuteIndex array. Again, ArrayHandlePermutation is a
|
||
|
// fancy vtkm array so that we do not actually copy any data here
|
||
|
permute_type permutedInput(maskedPermuteIndex, input);
|
||
|
// Finally, copy the permuted values to the output array
|
||
|
DeviceAlgorithm::Copy(permutedInput, output);
|
||
|
} // permuteValues()
|
||
|
|
||
|
// permuteValues from the orignial PPP2 code is equivilant to permuteArray<T, vtkm::cont:ArrayHandle<T, StorageType>, DeviceAdaptor> and has therefore been removed
|
||
|
/*template <typename T, typename StorageType, typename DeviceAdapter>
|
||
|
void permuteValues(const vtkm::cont::ArrayHandle<T,StorageType> &input, IdArrayType &permute, vtkm::cont::ArrayHandle<T,StorageType> &output)
|
||
|
{}
|
||
|
*/
|
||
|
|
||
|
// permuteIndicies from the original PPP2 code is equivilant to permuteArray<vtkm::Id, IdArrayType, DeviceAdaptor> and has therefore been removed
|
||
|
/* template <typename DeviceAdapter>
|
||
|
void permuteIndices(IdArrayType &input, IdArrayType &permute, IdArrayType &output)
|
||
|
{}
|
||
|
*/
|
||
|
|
||
|
|
||
|
// transform functor needed for ScanExclusive calculation. Return 1 if vertex is critical else 0.
|
||
|
struct onefIfCritical
|
||
|
{
|
||
|
VTKM_EXEC_CONT
|
||
|
onefIfCritical() {}
|
||
|
|
||
|
VTKM_EXEC_CONT
|
||
|
vtkm::Id operator()(vtkm::Id x) const { return x != 1 ? 1 : 0; }
|
||
|
};
|
||
|
|
||
|
// transform functor needed for ScanExclusive calculation in FindSuperAndHyperNodes. Return 1 if vertex is a supernode, else 0.
|
||
|
struct onefIfSupernode
|
||
|
{
|
||
|
VTKM_EXEC_CONT
|
||
|
onefIfSupernode() {}
|
||
|
|
||
|
VTKM_EXEC_CONT
|
||
|
vtkm::Id operator()(vtkm::Id x) const { return isSupernode(x) ? 1 : 0; }
|
||
|
};
|
||
|
|
||
|
// transform functor needed for ScanExclusive calculation in FindSuperAndHyperNodes. Return 1 if vertex is a hypernode, else 0.
|
||
|
struct onefIfHypernode
|
||
|
{
|
||
|
VTKM_EXEC_CONT
|
||
|
onefIfHypernode() {}
|
||
|
|
||
|
VTKM_EXEC_CONT
|
||
|
vtkm::Id operator()(vtkm::Id x) const { return isHypernode(x) ? 1 : 0; }
|
||
|
};
|
||
|
|
||
|
|
||
|
} // namespace contourtree_ppp2
|
||
|
} // worklet
|
||
|
} // vtkm
|
||
|
|
||
|
// tail of include guard
|
||
|
#endif
|