mirror of
https://gitlab.kitware.com/vtk/vtk-m
synced 2024-10-05 18:08:59 +00:00
0c5a087e41
ef611239 Don't allow DeviceTaskTypes to construct tasks from rvalues. Acked-by: Kitware Robot <kwrobot@kitware.com> Merge-request: !1062
1047 lines
41 KiB
C++
1047 lines
41 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.
|
|
//============================================================================
|
|
|
|
#ifndef vtk_m_cont_internal_DeviceAdapterAlgorithmGeneral_h
|
|
#define vtk_m_cont_internal_DeviceAdapterAlgorithmGeneral_h
|
|
|
|
#include <vtkm/cont/ArrayHandle.h>
|
|
#include <vtkm/cont/ArrayHandleDiscard.h>
|
|
#include <vtkm/cont/ArrayHandleImplicit.h>
|
|
#include <vtkm/cont/ArrayHandleIndex.h>
|
|
#include <vtkm/cont/ArrayHandleStreaming.h>
|
|
#include <vtkm/cont/ArrayHandleZip.h>
|
|
#include <vtkm/cont/internal/FunctorsGeneral.h>
|
|
|
|
#include <vtkm/exec/internal/ErrorMessageBuffer.h>
|
|
#include <vtkm/exec/internal/TaskSingular.h>
|
|
|
|
#include <vtkm/BinaryPredicates.h>
|
|
#include <vtkm/TypeTraits.h>
|
|
|
|
#include <vtkm/internal/Windows.h>
|
|
|
|
#include <type_traits>
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace cont
|
|
{
|
|
namespace internal
|
|
{
|
|
|
|
/// \brief
|
|
///
|
|
/// This struct provides algorithms that implement "general" device adapter
|
|
/// algorithms. If a device adapter provides implementations for Schedule,
|
|
/// and Synchronize, the rest of the algorithms can be implemented by calling
|
|
/// these functions.
|
|
///
|
|
/// It should be noted that we recommend that you also implement Sort,
|
|
/// ScanInclusive, and ScanExclusive for improved performance.
|
|
///
|
|
/// An easy way to implement the DeviceAdapterAlgorithm specialization is to
|
|
/// subclass this and override the implementation of methods as necessary.
|
|
/// As an example, the code would look something like this.
|
|
///
|
|
/// \code{.cpp}
|
|
/// template<>
|
|
/// struct DeviceAdapterAlgorithm<DeviceAdapterTagFoo>
|
|
/// : DeviceAdapterAlgorithmGeneral<DeviceAdapterAlgorithm<DeviceAdapterTagFoo>,
|
|
/// DeviceAdapterTagFoo>
|
|
/// {
|
|
/// template<class Functor>
|
|
/// VTKM_CONT static void Schedule(Functor functor,
|
|
/// vtkm::Id numInstances)
|
|
/// {
|
|
/// ...
|
|
/// }
|
|
///
|
|
/// template<class Functor>
|
|
/// VTKM_CONT static void Schedule(Functor functor,
|
|
/// vtkm::Id3 maxRange)
|
|
/// {
|
|
/// ...
|
|
/// }
|
|
///
|
|
/// VTKM_CONT static void Synchronize()
|
|
/// {
|
|
/// ...
|
|
/// }
|
|
/// };
|
|
/// \endcode
|
|
///
|
|
/// You might note that DeviceAdapterAlgorithmGeneral has two template
|
|
/// parameters that are redundant. Although the first parameter, the class for
|
|
/// the actual DeviceAdapterAlgorithm class containing Schedule, and
|
|
/// Synchronize is the same as DeviceAdapterAlgorithm<DeviceAdapterTag>, it is
|
|
/// made a separate template parameter to avoid a recursive dependence between
|
|
/// DeviceAdapterAlgorithmGeneral.h and DeviceAdapterAlgorithm.h
|
|
///
|
|
template <class DerivedAlgorithm, class DeviceAdapterTag>
|
|
struct DeviceAdapterAlgorithmGeneral
|
|
{
|
|
//--------------------------------------------------------------------------
|
|
// Get Execution Value
|
|
// This method is used internally to get a single element from the execution
|
|
// array. Might want to expose this and/or allow actual device adapter
|
|
// implementations to provide one.
|
|
private:
|
|
template <typename T, class CIn>
|
|
VTKM_CONT static T GetExecutionValue(const vtkm::cont::ArrayHandle<T, CIn>& input, vtkm::Id index)
|
|
{
|
|
using OutputArrayType = vtkm::cont::ArrayHandle<T, vtkm::cont::StorageTagBasic>;
|
|
|
|
OutputArrayType output;
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(1, DeviceAdapterTag());
|
|
|
|
CopyKernel<decltype(inputPortal), decltype(outputPortal)> kernel(
|
|
inputPortal, outputPortal, index);
|
|
|
|
DerivedAlgorithm::Schedule(kernel, 1);
|
|
|
|
return output.GetPortalConstControl().Get(0);
|
|
}
|
|
|
|
public:
|
|
//--------------------------------------------------------------------------
|
|
// Copy
|
|
template <typename T, typename U, class CIn, class COut>
|
|
VTKM_CONT static void Copy(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<U, COut>& output)
|
|
{
|
|
const vtkm::Id inSize = input.GetNumberOfValues();
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(inSize, DeviceAdapterTag());
|
|
|
|
CopyKernel<decltype(inputPortal), decltype(outputPortal)> kernel(inputPortal, outputPortal);
|
|
DerivedAlgorithm::Schedule(kernel, inSize);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// CopyIf
|
|
template <typename T, typename U, class CIn, class CStencil, class COut, class UnaryPredicate>
|
|
VTKM_CONT static void CopyIf(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<U, CStencil>& stencil,
|
|
vtkm::cont::ArrayHandle<T, COut>& output,
|
|
UnaryPredicate unary_predicate)
|
|
{
|
|
VTKM_ASSERT(input.GetNumberOfValues() == stencil.GetNumberOfValues());
|
|
vtkm::Id arrayLength = stencil.GetNumberOfValues();
|
|
|
|
using IndexArrayType = vtkm::cont::ArrayHandle<vtkm::Id, vtkm::cont::StorageTagBasic>;
|
|
IndexArrayType indices;
|
|
|
|
auto stencilPortal = stencil.PrepareForInput(DeviceAdapterTag());
|
|
auto indexPortal = indices.PrepareForOutput(arrayLength, DeviceAdapterTag());
|
|
|
|
StencilToIndexFlagKernel<decltype(stencilPortal), decltype(indexPortal), UnaryPredicate>
|
|
indexKernel(stencilPortal, indexPortal, unary_predicate);
|
|
|
|
DerivedAlgorithm::Schedule(indexKernel, arrayLength);
|
|
|
|
vtkm::Id outArrayLength = DerivedAlgorithm::ScanExclusive(indices, indices);
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(outArrayLength, DeviceAdapterTag());
|
|
|
|
CopyIfKernel<decltype(inputPortal),
|
|
decltype(stencilPortal),
|
|
decltype(indexPortal),
|
|
decltype(outputPortal),
|
|
UnaryPredicate>
|
|
copyKernel(inputPortal, stencilPortal, indexPortal, outputPortal, unary_predicate);
|
|
DerivedAlgorithm::Schedule(copyKernel, arrayLength);
|
|
}
|
|
|
|
template <typename T, typename U, class CIn, class CStencil, class COut>
|
|
VTKM_CONT static void CopyIf(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<U, CStencil>& stencil,
|
|
vtkm::cont::ArrayHandle<T, COut>& output)
|
|
{
|
|
::vtkm::NotZeroInitialized unary_predicate;
|
|
DerivedAlgorithm::CopyIf(input, stencil, output, unary_predicate);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// CopySubRange
|
|
template <typename T, typename U, class CIn, class COut>
|
|
VTKM_CONT static bool CopySubRange(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::Id inputStartIndex,
|
|
vtkm::Id numberOfElementsToCopy,
|
|
vtkm::cont::ArrayHandle<U, COut>& output,
|
|
vtkm::Id outputIndex = 0)
|
|
{
|
|
const vtkm::Id inSize = input.GetNumberOfValues();
|
|
|
|
// Check if the ranges overlap and fail if they do.
|
|
if (input == output && ((outputIndex >= inputStartIndex &&
|
|
outputIndex < inputStartIndex + numberOfElementsToCopy) ||
|
|
(inputStartIndex >= outputIndex &&
|
|
inputStartIndex < outputIndex + numberOfElementsToCopy)))
|
|
{
|
|
return false;
|
|
}
|
|
|
|
if (inputStartIndex < 0 || numberOfElementsToCopy < 0 || outputIndex < 0 ||
|
|
inputStartIndex >= inSize)
|
|
{ //invalid parameters
|
|
return false;
|
|
}
|
|
|
|
//determine if the numberOfElementsToCopy needs to be reduced
|
|
if (inSize < (inputStartIndex + numberOfElementsToCopy))
|
|
{ //adjust the size
|
|
numberOfElementsToCopy = (inSize - inputStartIndex);
|
|
}
|
|
|
|
const vtkm::Id outSize = output.GetNumberOfValues();
|
|
const vtkm::Id copyOutEnd = outputIndex + numberOfElementsToCopy;
|
|
if (outSize < copyOutEnd)
|
|
{ //output is not large enough
|
|
if (outSize == 0)
|
|
{ //since output has nothing, just need to allocate to correct length
|
|
output.Allocate(copyOutEnd);
|
|
}
|
|
else
|
|
{ //we currently have data in this array, so preserve it in the new
|
|
//resized array
|
|
vtkm::cont::ArrayHandle<U, COut> temp;
|
|
temp.Allocate(copyOutEnd);
|
|
DerivedAlgorithm::CopySubRange(output, 0, outSize, temp);
|
|
output = temp;
|
|
}
|
|
}
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForInPlace(DeviceAdapterTag());
|
|
|
|
CopyKernel<decltype(inputPortal), decltype(outputPortal)> kernel(
|
|
inputPortal, outputPortal, inputStartIndex, outputIndex);
|
|
DerivedAlgorithm::Schedule(kernel, numberOfElementsToCopy);
|
|
return true;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Lower Bounds
|
|
template <typename T, class CIn, class CVal, class COut>
|
|
VTKM_CONT static void LowerBounds(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<T, CVal>& values,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& output)
|
|
{
|
|
vtkm::Id arraySize = values.GetNumberOfValues();
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto valuesPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(arraySize, DeviceAdapterTag());
|
|
|
|
LowerBoundsKernel<decltype(inputPortal), decltype(valuesPortal), decltype(outputPortal)> kernel(
|
|
inputPortal, valuesPortal, outputPortal);
|
|
|
|
DerivedAlgorithm::Schedule(kernel, arraySize);
|
|
}
|
|
|
|
template <typename T, class CIn, class CVal, class COut, class BinaryCompare>
|
|
VTKM_CONT static void LowerBounds(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<T, CVal>& values,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& output,
|
|
BinaryCompare binary_compare)
|
|
{
|
|
vtkm::Id arraySize = values.GetNumberOfValues();
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto valuesPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(arraySize, DeviceAdapterTag());
|
|
|
|
LowerBoundsComparisonKernel<decltype(inputPortal),
|
|
decltype(valuesPortal),
|
|
decltype(outputPortal),
|
|
BinaryCompare>
|
|
kernel(inputPortal, valuesPortal, outputPortal, binary_compare);
|
|
|
|
DerivedAlgorithm::Schedule(kernel, arraySize);
|
|
}
|
|
|
|
template <class CIn, class COut>
|
|
VTKM_CONT static void LowerBounds(const vtkm::cont::ArrayHandle<vtkm::Id, CIn>& input,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& values_output)
|
|
{
|
|
DeviceAdapterAlgorithmGeneral<DerivedAlgorithm, DeviceAdapterTag>::LowerBounds(
|
|
input, values_output, values_output);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Reduce
|
|
template <typename T, typename U, class CIn>
|
|
VTKM_CONT static U Reduce(const vtkm::cont::ArrayHandle<T, CIn>& input, U initialValue)
|
|
{
|
|
return DerivedAlgorithm::Reduce(input, initialValue, vtkm::Add());
|
|
}
|
|
|
|
template <typename T, typename U, class CIn, class BinaryFunctor>
|
|
VTKM_CONT static U Reduce(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
U initialValue,
|
|
BinaryFunctor binary_functor)
|
|
{
|
|
//Crazy Idea:
|
|
//We create a implicit array handle that wraps the input
|
|
//array handle. The implicit functor is passed the input array handle, and
|
|
//the number of elements it needs to sum. This way the implicit handle
|
|
//acts as the first level reduction. Say for example reducing 16 values
|
|
//at a time.
|
|
//
|
|
//Now that we have an implicit array that is 1/16 the length of full array
|
|
//we can use scan inclusive to compute the final sum
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
ReduceKernel<decltype(inputPortal), U, BinaryFunctor> kernel(
|
|
inputPortal, initialValue, binary_functor);
|
|
|
|
vtkm::Id length = (input.GetNumberOfValues() / 16);
|
|
length += (input.GetNumberOfValues() % 16 == 0) ? 0 : 1;
|
|
auto reduced = vtkm::cont::make_ArrayHandleImplicit(kernel, length);
|
|
|
|
vtkm::cont::ArrayHandle<U, vtkm::cont::StorageTagBasic> inclusiveScanStorage;
|
|
const U scanResult =
|
|
DerivedAlgorithm::ScanInclusive(reduced, inclusiveScanStorage, binary_functor);
|
|
return scanResult;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Streaming Reduce
|
|
template <typename T, typename U, class CIn>
|
|
VTKM_CONT static U StreamingReduce(const vtkm::Id numBlocks,
|
|
const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
U initialValue)
|
|
{
|
|
return DerivedAlgorithm::StreamingReduce(numBlocks, input, initialValue, vtkm::Add());
|
|
}
|
|
|
|
template <typename T, typename U, class CIn, class BinaryFunctor>
|
|
VTKM_CONT static U StreamingReduce(const vtkm::Id numBlocks,
|
|
const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
U initialValue,
|
|
BinaryFunctor binary_functor)
|
|
{
|
|
vtkm::Id fullSize = input.GetNumberOfValues();
|
|
vtkm::Id blockSize = fullSize / numBlocks;
|
|
if (fullSize % numBlocks != 0)
|
|
blockSize += 1;
|
|
|
|
U lastResult = vtkm::TypeTraits<U>::ZeroInitialization();
|
|
for (vtkm::Id block = 0; block < numBlocks; block++)
|
|
{
|
|
vtkm::Id numberOfInstances = blockSize;
|
|
if (block == numBlocks - 1)
|
|
numberOfInstances = fullSize - blockSize * block;
|
|
|
|
vtkm::cont::ArrayHandleStreaming<vtkm::cont::ArrayHandle<T, CIn>> streamIn(
|
|
input, block, blockSize, numberOfInstances);
|
|
|
|
if (block == 0)
|
|
lastResult = DerivedAlgorithm::Reduce(streamIn, initialValue, binary_functor);
|
|
else
|
|
lastResult = DerivedAlgorithm::Reduce(streamIn, lastResult, binary_functor);
|
|
}
|
|
return lastResult;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Reduce By Key
|
|
template <typename T,
|
|
typename U,
|
|
class KIn,
|
|
class VIn,
|
|
class KOut,
|
|
class VOut,
|
|
class BinaryFunctor>
|
|
VTKM_CONT static void ReduceByKey(const vtkm::cont::ArrayHandle<T, KIn>& keys,
|
|
const vtkm::cont::ArrayHandle<U, VIn>& values,
|
|
vtkm::cont::ArrayHandle<T, KOut>& keys_output,
|
|
vtkm::cont::ArrayHandle<U, VOut>& values_output,
|
|
BinaryFunctor binary_functor)
|
|
{
|
|
using KeysOutputType = vtkm::cont::ArrayHandle<U, KOut>;
|
|
|
|
VTKM_ASSERT(keys.GetNumberOfValues() == values.GetNumberOfValues());
|
|
const vtkm::Id numberOfKeys = keys.GetNumberOfValues();
|
|
|
|
if (numberOfKeys <= 1)
|
|
{ //we only have a single key/value so that is our output
|
|
DerivedAlgorithm::Copy(keys, keys_output);
|
|
DerivedAlgorithm::Copy(values, values_output);
|
|
return;
|
|
}
|
|
|
|
//we need to determine based on the keys what is the keystate for
|
|
//each key. The states are start, middle, end of a series and the special
|
|
//state start and end of a series
|
|
vtkm::cont::ArrayHandle<ReduceKeySeriesStates> keystate;
|
|
|
|
{
|
|
auto inputPortal = keys.PrepareForInput(DeviceAdapterTag());
|
|
auto keyStatePortal = keystate.PrepareForOutput(numberOfKeys, DeviceAdapterTag());
|
|
ReduceStencilGeneration<decltype(inputPortal), decltype(keyStatePortal)> kernel(
|
|
inputPortal, keyStatePortal);
|
|
DerivedAlgorithm::Schedule(kernel, numberOfKeys);
|
|
}
|
|
|
|
//next step is we need to reduce the values for each key. This is done
|
|
//by running an inclusive scan over the values array using the stencil.
|
|
//
|
|
// this inclusive scan will write out two values, the first being
|
|
// the value summed currently, the second being 0 or 1, with 1 being used
|
|
// when this is a value of a key we need to write ( END or START_AND_END)
|
|
{
|
|
vtkm::cont::ArrayHandle<ReduceKeySeriesStates> stencil;
|
|
vtkm::cont::ArrayHandle<U, VOut> reducedValues;
|
|
|
|
auto scanInput = vtkm::cont::make_ArrayHandleZip(values, keystate);
|
|
auto scanOutput = vtkm::cont::make_ArrayHandleZip(reducedValues, stencil);
|
|
|
|
DerivedAlgorithm::ScanInclusive(
|
|
scanInput, scanOutput, ReduceByKeyAdd<BinaryFunctor>(binary_functor));
|
|
|
|
//at this point we are done with keystate, so free the memory
|
|
keystate.ReleaseResources();
|
|
|
|
// all we need know is an efficient way of doing the write back to the
|
|
// reduced global memory. this is done by using CopyIf with the
|
|
// stencil and values we just created with the inclusive scan
|
|
DerivedAlgorithm::CopyIf(reducedValues, stencil, values_output, ReduceByKeyUnaryStencilOp());
|
|
|
|
} //release all temporary memory
|
|
|
|
// Don't bother with the keys_output if it's an ArrayHandleDiscard -- there
|
|
// will be a runtime exception in Unique() otherwise:
|
|
if (!vtkm::cont::IsArrayHandleDiscard<KeysOutputType>::Value)
|
|
{
|
|
//find all the unique keys
|
|
DerivedAlgorithm::Copy(keys, keys_output);
|
|
DerivedAlgorithm::Unique(keys_output);
|
|
}
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Scan Exclusive
|
|
template <typename T, class CIn, class COut, class BinaryFunctor>
|
|
VTKM_CONT static T ScanExclusive(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output,
|
|
BinaryFunctor binaryFunctor,
|
|
const T& initialValue)
|
|
{
|
|
vtkm::Id numValues = input.GetNumberOfValues();
|
|
if (numValues <= 0)
|
|
{
|
|
return initialValue;
|
|
}
|
|
|
|
vtkm::cont::ArrayHandle<T, vtkm::cont::StorageTagBasic> inclusiveScan;
|
|
T result = DerivedAlgorithm::ScanInclusive(input, inclusiveScan, binaryFunctor);
|
|
|
|
auto inputPortal = inclusiveScan.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(numValues, DeviceAdapterTag());
|
|
|
|
InclusiveToExclusiveKernel<decltype(inputPortal), decltype(outputPortal), BinaryFunctor>
|
|
inclusiveToExclusive(inputPortal, outputPortal, binaryFunctor, initialValue);
|
|
|
|
DerivedAlgorithm::Schedule(inclusiveToExclusive, numValues);
|
|
|
|
return binaryFunctor(initialValue, result);
|
|
}
|
|
|
|
template <typename T, class CIn, class COut>
|
|
VTKM_CONT static T ScanExclusive(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output)
|
|
{
|
|
return DerivedAlgorithm::ScanExclusive(
|
|
input, output, vtkm::Sum(), vtkm::TypeTraits<T>::ZeroInitialization());
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Scan Exclusive By Key
|
|
template <typename KeyT,
|
|
typename ValueT,
|
|
typename KIn,
|
|
typename VIn,
|
|
typename VOut,
|
|
class BinaryFunctor>
|
|
VTKM_CONT static void ScanExclusiveByKey(const vtkm::cont::ArrayHandle<KeyT, KIn>& keys,
|
|
const vtkm::cont::ArrayHandle<ValueT, VIn>& values,
|
|
vtkm::cont::ArrayHandle<ValueT, VOut>& output,
|
|
const ValueT& initialValue,
|
|
BinaryFunctor binaryFunctor)
|
|
{
|
|
VTKM_ASSERT(keys.GetNumberOfValues() == values.GetNumberOfValues());
|
|
|
|
// 0. Special case for 0 and 1 element input
|
|
vtkm::Id numberOfKeys = keys.GetNumberOfValues();
|
|
|
|
if (numberOfKeys == 0)
|
|
{
|
|
return;
|
|
}
|
|
else if (numberOfKeys == 1)
|
|
{
|
|
output.PrepareForOutput(1, DeviceAdapterTag());
|
|
output.GetPortalControl().Set(0, initialValue);
|
|
return;
|
|
}
|
|
|
|
// 1. Create head flags
|
|
//we need to determine based on the keys what is the keystate for
|
|
//each key. The states are start, middle, end of a series and the special
|
|
//state start and end of a series
|
|
vtkm::cont::ArrayHandle<ReduceKeySeriesStates> keystate;
|
|
|
|
{
|
|
auto inputPortal = keys.PrepareForInput(DeviceAdapterTag());
|
|
auto keyStatePortal = keystate.PrepareForOutput(numberOfKeys, DeviceAdapterTag());
|
|
ReduceStencilGeneration<decltype(inputPortal), decltype(keyStatePortal)> kernel(
|
|
inputPortal, keyStatePortal);
|
|
DerivedAlgorithm::Schedule(kernel, numberOfKeys);
|
|
}
|
|
|
|
// 2. Shift input and initialize elements at head flags position to initValue
|
|
vtkm::cont::ArrayHandle<ValueT, vtkm::cont::StorageTagBasic> temp;
|
|
{
|
|
auto inputPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto keyStatePortal = keystate.PrepareForInput(DeviceAdapterTag());
|
|
auto tempPortal = temp.PrepareForOutput(numberOfKeys, DeviceAdapterTag());
|
|
|
|
ShiftCopyAndInit<ValueT,
|
|
decltype(inputPortal),
|
|
decltype(keyStatePortal),
|
|
decltype(tempPortal)>
|
|
kernel(inputPortal, keyStatePortal, tempPortal, initialValue);
|
|
DerivedAlgorithm::Schedule(kernel, numberOfKeys);
|
|
}
|
|
// 3. Perform a ScanInclusiveByKey
|
|
DerivedAlgorithm::ScanInclusiveByKey(keys, temp, output, binaryFunctor);
|
|
}
|
|
|
|
template <typename KeyT, typename ValueT, class KIn, typename VIn, typename VOut>
|
|
VTKM_CONT static void ScanExclusiveByKey(const vtkm::cont::ArrayHandle<KeyT, KIn>& keys,
|
|
const vtkm::cont::ArrayHandle<ValueT, VIn>& values,
|
|
vtkm::cont::ArrayHandle<ValueT, VOut>& output)
|
|
{
|
|
DerivedAlgorithm::ScanExclusiveByKey(
|
|
keys, values, output, vtkm::TypeTraits<ValueT>::ZeroInitialization(), vtkm::Sum());
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Streaming exclusive scan
|
|
template <typename T, class CIn, class COut>
|
|
VTKM_CONT static T StreamingScanExclusive(const vtkm::Id numBlocks,
|
|
const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output)
|
|
{
|
|
return DerivedAlgorithm::StreamingScanExclusive(
|
|
numBlocks, input, output, vtkm::Sum(), vtkm::TypeTraits<T>::ZeroInitialization());
|
|
}
|
|
|
|
template <typename T, class CIn, class COut, class BinaryFunctor>
|
|
VTKM_CONT static T StreamingScanExclusive(const vtkm::Id numBlocks,
|
|
const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output,
|
|
BinaryFunctor binary_functor,
|
|
const T& initialValue)
|
|
{
|
|
vtkm::Id fullSize = input.GetNumberOfValues();
|
|
vtkm::Id blockSize = fullSize / numBlocks;
|
|
if (fullSize % numBlocks != 0)
|
|
blockSize += 1;
|
|
|
|
T lastResult = vtkm::TypeTraits<T>::ZeroInitialization();
|
|
for (vtkm::Id block = 0; block < numBlocks; block++)
|
|
{
|
|
vtkm::Id numberOfInstances = blockSize;
|
|
if (block == numBlocks - 1)
|
|
numberOfInstances = fullSize - blockSize * block;
|
|
|
|
vtkm::cont::ArrayHandleStreaming<vtkm::cont::ArrayHandle<T, CIn>> streamIn(
|
|
input, block, blockSize, numberOfInstances);
|
|
|
|
vtkm::cont::ArrayHandleStreaming<vtkm::cont::ArrayHandle<T, COut>> streamOut(
|
|
output, block, blockSize, numberOfInstances);
|
|
|
|
if (block == 0)
|
|
{
|
|
streamOut.AllocateFullArray(fullSize);
|
|
lastResult =
|
|
DerivedAlgorithm::ScanExclusive(streamIn, streamOut, binary_functor, initialValue);
|
|
}
|
|
else
|
|
{
|
|
lastResult =
|
|
DerivedAlgorithm::ScanExclusive(streamIn, streamOut, binary_functor, lastResult);
|
|
}
|
|
|
|
streamOut.SyncControlArray();
|
|
}
|
|
return lastResult;
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Scan Inclusive
|
|
template <typename T, class CIn, class COut>
|
|
VTKM_CONT static T ScanInclusive(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output)
|
|
{
|
|
return DerivedAlgorithm::ScanInclusive(input, output, vtkm::Add());
|
|
}
|
|
|
|
template <typename T, class CIn, class COut, class BinaryFunctor>
|
|
VTKM_CONT static T ScanInclusive(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
vtkm::cont::ArrayHandle<T, COut>& output,
|
|
BinaryFunctor binary_functor)
|
|
{
|
|
DerivedAlgorithm::Copy(input, output);
|
|
|
|
vtkm::Id numValues = output.GetNumberOfValues();
|
|
if (numValues < 1)
|
|
{
|
|
return vtkm::TypeTraits<T>::ZeroInitialization();
|
|
}
|
|
|
|
auto portal = output.PrepareForInPlace(DeviceAdapterTag());
|
|
using ScanKernelType = ScanKernel<decltype(portal), BinaryFunctor>;
|
|
|
|
|
|
vtkm::Id stride;
|
|
for (stride = 2; stride - 1 < numValues; stride *= 2)
|
|
{
|
|
ScanKernelType kernel(portal, binary_functor, stride, stride / 2 - 1);
|
|
DerivedAlgorithm::Schedule(kernel, numValues / stride);
|
|
}
|
|
|
|
// Do reverse operation on odd indices. Start at stride we were just at.
|
|
for (stride /= 2; stride > 1; stride /= 2)
|
|
{
|
|
ScanKernelType kernel(portal, binary_functor, stride, stride - 1);
|
|
DerivedAlgorithm::Schedule(kernel, numValues / stride);
|
|
}
|
|
|
|
return GetExecutionValue(output, numValues - 1);
|
|
}
|
|
|
|
template <typename KeyT, typename ValueT, class KIn, class VIn, class VOut>
|
|
VTKM_CONT static void ScanInclusiveByKey(const vtkm::cont::ArrayHandle<KeyT, KIn>& keys,
|
|
const vtkm::cont::ArrayHandle<ValueT, VIn>& values,
|
|
vtkm::cont::ArrayHandle<ValueT, VOut>& values_output)
|
|
{
|
|
return DerivedAlgorithm::ScanInclusiveByKey(keys, values, values_output, vtkm::Add());
|
|
}
|
|
|
|
template <typename KeyT, typename ValueT, class KIn, class VIn, class VOut, class BinaryFunctor>
|
|
VTKM_CONT static void ScanInclusiveByKey(const vtkm::cont::ArrayHandle<KeyT, KIn>& keys,
|
|
const vtkm::cont::ArrayHandle<ValueT, VIn>& values,
|
|
vtkm::cont::ArrayHandle<ValueT, VOut>& values_output,
|
|
BinaryFunctor binary_functor)
|
|
{
|
|
VTKM_ASSERT(keys.GetNumberOfValues() == values.GetNumberOfValues());
|
|
const vtkm::Id numberOfKeys = keys.GetNumberOfValues();
|
|
|
|
if (numberOfKeys <= 1)
|
|
{ //we only have a single key/value so that is our output
|
|
DerivedAlgorithm::Copy(values, values_output);
|
|
return;
|
|
}
|
|
|
|
//we need to determine based on the keys what is the keystate for
|
|
//each key. The states are start, middle, end of a series and the special
|
|
//state start and end of a series
|
|
vtkm::cont::ArrayHandle<ReduceKeySeriesStates> keystate;
|
|
|
|
{
|
|
auto inputPortal = keys.PrepareForInput(DeviceAdapterTag());
|
|
auto keyStatePortal = keystate.PrepareForOutput(numberOfKeys, DeviceAdapterTag());
|
|
ReduceStencilGeneration<decltype(inputPortal), decltype(keyStatePortal)> kernel(
|
|
inputPortal, keyStatePortal);
|
|
DerivedAlgorithm::Schedule(kernel, numberOfKeys);
|
|
}
|
|
|
|
//next step is we need to reduce the values for each key. This is done
|
|
//by running an inclusive scan over the values array using the stencil.
|
|
//
|
|
// this inclusive scan will write out two values, the first being
|
|
// the value summed currently, the second being 0 or 1, with 1 being used
|
|
// when this is a value of a key we need to write ( END or START_AND_END)
|
|
{
|
|
vtkm::cont::ArrayHandle<ValueT, VOut> reducedValues;
|
|
vtkm::cont::ArrayHandle<ReduceKeySeriesStates> stencil;
|
|
auto scanInput = vtkm::cont::make_ArrayHandleZip(values, keystate);
|
|
auto scanOutput = vtkm::cont::make_ArrayHandleZip(reducedValues, stencil);
|
|
|
|
DerivedAlgorithm::ScanInclusive(
|
|
scanInput, scanOutput, ReduceByKeyAdd<BinaryFunctor>(binary_functor));
|
|
//at this point we are done with keystate, so free the memory
|
|
keystate.ReleaseResources();
|
|
DerivedAlgorithm::Copy(reducedValues, values_output);
|
|
}
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Sort
|
|
template <typename T, class Storage, class BinaryCompare>
|
|
VTKM_CONT static void Sort(vtkm::cont::ArrayHandle<T, Storage>& values,
|
|
BinaryCompare binary_compare)
|
|
{
|
|
vtkm::Id numValues = values.GetNumberOfValues();
|
|
if (numValues < 2)
|
|
{
|
|
return;
|
|
}
|
|
vtkm::Id numThreads = 1;
|
|
while (numThreads < numValues)
|
|
{
|
|
numThreads *= 2;
|
|
}
|
|
numThreads /= 2;
|
|
|
|
auto portal = values.PrepareForInPlace(DeviceAdapterTag());
|
|
using MergeKernel = BitonicSortMergeKernel<decltype(portal), BinaryCompare>;
|
|
using CrossoverKernel = BitonicSortCrossoverKernel<decltype(portal), BinaryCompare>;
|
|
|
|
for (vtkm::Id crossoverSize = 1; crossoverSize < numValues; crossoverSize *= 2)
|
|
{
|
|
DerivedAlgorithm::Schedule(CrossoverKernel(portal, binary_compare, crossoverSize),
|
|
numThreads);
|
|
for (vtkm::Id mergeSize = crossoverSize / 2; mergeSize > 0; mergeSize /= 2)
|
|
{
|
|
DerivedAlgorithm::Schedule(MergeKernel(portal, binary_compare, mergeSize), numThreads);
|
|
}
|
|
}
|
|
}
|
|
|
|
template <typename T, class Storage>
|
|
VTKM_CONT static void Sort(vtkm::cont::ArrayHandle<T, Storage>& values)
|
|
{
|
|
DerivedAlgorithm::Sort(values, DefaultCompareFunctor());
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Sort by Key
|
|
public:
|
|
template <typename T, typename U, class StorageT, class StorageU>
|
|
VTKM_CONT static void SortByKey(vtkm::cont::ArrayHandle<T, StorageT>& keys,
|
|
vtkm::cont::ArrayHandle<U, StorageU>& values)
|
|
{
|
|
//combine the keys and values into a ZipArrayHandle
|
|
//we than need to specify a custom compare function wrapper
|
|
//that only checks for key side of the pair, using a custom compare functor.
|
|
auto zipHandle = vtkm::cont::make_ArrayHandleZip(keys, values);
|
|
DerivedAlgorithm::Sort(zipHandle, internal::KeyCompare<T, U>());
|
|
}
|
|
|
|
template <typename T, typename U, class StorageT, class StorageU, class BinaryCompare>
|
|
VTKM_CONT static void SortByKey(vtkm::cont::ArrayHandle<T, StorageT>& keys,
|
|
vtkm::cont::ArrayHandle<U, StorageU>& values,
|
|
BinaryCompare binary_compare)
|
|
{
|
|
//combine the keys and values into a ZipArrayHandle
|
|
//we than need to specify a custom compare function wrapper
|
|
//that only checks for key side of the pair, using the custom compare
|
|
//functor that the user passed in
|
|
auto zipHandle = vtkm::cont::make_ArrayHandleZip(keys, values);
|
|
DerivedAlgorithm::Sort(zipHandle, internal::KeyCompare<T, U, BinaryCompare>(binary_compare));
|
|
}
|
|
|
|
template <typename T,
|
|
typename U,
|
|
typename V,
|
|
typename StorageT,
|
|
typename StorageU,
|
|
typename StorageV,
|
|
typename BinaryFunctor>
|
|
VTKM_CONT static void Transform(const vtkm::cont::ArrayHandle<T, StorageT>& input1,
|
|
const vtkm::cont::ArrayHandle<U, StorageU>& input2,
|
|
vtkm::cont::ArrayHandle<V, StorageV>& output,
|
|
BinaryFunctor binaryFunctor)
|
|
{
|
|
vtkm::Id numValues = vtkm::Min(input1.GetNumberOfValues(), input2.GetNumberOfValues());
|
|
if (numValues <= 0)
|
|
{
|
|
return;
|
|
}
|
|
|
|
auto input1Portal = input1.PrepareForInput(DeviceAdapterTag());
|
|
auto input2Portal = input2.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(numValues, DeviceAdapterTag());
|
|
|
|
BinaryTransformKernel<decltype(input1Portal),
|
|
decltype(input2Portal),
|
|
decltype(outputPortal),
|
|
BinaryFunctor>
|
|
binaryKernel(input1Portal, input2Portal, outputPortal, binaryFunctor);
|
|
DerivedAlgorithm::Schedule(binaryKernel, numValues);
|
|
}
|
|
|
|
//};
|
|
//--------------------------------------------------------------------------
|
|
// Unique
|
|
template <typename T, class Storage>
|
|
VTKM_CONT static void Unique(vtkm::cont::ArrayHandle<T, Storage>& values)
|
|
{
|
|
DerivedAlgorithm::Unique(values, vtkm::Equal());
|
|
}
|
|
|
|
template <typename T, class Storage, class BinaryCompare>
|
|
VTKM_CONT static void Unique(vtkm::cont::ArrayHandle<T, Storage>& values,
|
|
BinaryCompare binary_compare)
|
|
{
|
|
vtkm::cont::ArrayHandle<vtkm::Id, vtkm::cont::StorageTagBasic> stencilArray;
|
|
vtkm::Id inputSize = values.GetNumberOfValues();
|
|
|
|
using WrappedBOpType = internal::WrappedBinaryOperator<bool, BinaryCompare>;
|
|
WrappedBOpType wrappedCompare(binary_compare);
|
|
|
|
auto valuesPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto stencilPortal = stencilArray.PrepareForOutput(inputSize, DeviceAdapterTag());
|
|
ClassifyUniqueComparisonKernel<decltype(valuesPortal), decltype(stencilPortal), WrappedBOpType>
|
|
classifyKernel(valuesPortal, stencilPortal, wrappedCompare);
|
|
|
|
DerivedAlgorithm::Schedule(classifyKernel, inputSize);
|
|
|
|
vtkm::cont::ArrayHandle<T, vtkm::cont::StorageTagBasic> outputArray;
|
|
|
|
DerivedAlgorithm::CopyIf(values, stencilArray, outputArray);
|
|
|
|
values.Allocate(outputArray.GetNumberOfValues());
|
|
DerivedAlgorithm::Copy(outputArray, values);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------
|
|
// Upper bounds
|
|
template <typename T, class CIn, class CVal, class COut>
|
|
VTKM_CONT static void UpperBounds(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<T, CVal>& values,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& output)
|
|
{
|
|
vtkm::Id arraySize = values.GetNumberOfValues();
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto valuesPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(arraySize, DeviceAdapterTag());
|
|
|
|
UpperBoundsKernel<decltype(inputPortal), decltype(valuesPortal), decltype(outputPortal)> kernel(
|
|
inputPortal, valuesPortal, outputPortal);
|
|
DerivedAlgorithm::Schedule(kernel, arraySize);
|
|
}
|
|
|
|
template <typename T, class CIn, class CVal, class COut, class BinaryCompare>
|
|
VTKM_CONT static void UpperBounds(const vtkm::cont::ArrayHandle<T, CIn>& input,
|
|
const vtkm::cont::ArrayHandle<T, CVal>& values,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& output,
|
|
BinaryCompare binary_compare)
|
|
{
|
|
vtkm::Id arraySize = values.GetNumberOfValues();
|
|
|
|
auto inputPortal = input.PrepareForInput(DeviceAdapterTag());
|
|
auto valuesPortal = values.PrepareForInput(DeviceAdapterTag());
|
|
auto outputPortal = output.PrepareForOutput(arraySize, DeviceAdapterTag());
|
|
|
|
UpperBoundsKernelComparisonKernel<decltype(inputPortal),
|
|
decltype(valuesPortal),
|
|
decltype(outputPortal),
|
|
BinaryCompare>
|
|
kernel(inputPortal, valuesPortal, outputPortal, binary_compare);
|
|
|
|
DerivedAlgorithm::Schedule(kernel, arraySize);
|
|
}
|
|
|
|
template <class CIn, class COut>
|
|
VTKM_CONT static void UpperBounds(const vtkm::cont::ArrayHandle<vtkm::Id, CIn>& input,
|
|
vtkm::cont::ArrayHandle<vtkm::Id, COut>& values_output)
|
|
{
|
|
DeviceAdapterAlgorithmGeneral<DerivedAlgorithm, DeviceAdapterTag>::UpperBounds(
|
|
input, values_output, values_output);
|
|
}
|
|
};
|
|
}
|
|
}
|
|
} // namespace vtkm::cont::internal
|
|
|
|
namespace vtkm
|
|
{
|
|
namespace cont
|
|
{
|
|
/// \brief Class providing a device-specific atomic interface.
|
|
///
|
|
/// The class provide the actual implementation used by vtkm::exec::AtomicArray.
|
|
/// A serial default implementation is provided. But each device will have a different
|
|
/// implementation.
|
|
///
|
|
/// Serial requires no form of atomicity
|
|
///
|
|
template <typename T, typename DeviceTag>
|
|
class DeviceAdapterAtomicArrayImplementation
|
|
{
|
|
public:
|
|
VTKM_CONT
|
|
DeviceAdapterAtomicArrayImplementation(
|
|
vtkm::cont::ArrayHandle<T, vtkm::cont::StorageTagBasic> handle)
|
|
: Iterators(IteratorsType(handle.PrepareForInPlace(DeviceTag())))
|
|
{
|
|
}
|
|
|
|
VTKM_EXEC
|
|
T Add(vtkm::Id index, const T& value) const
|
|
{
|
|
T* lockedValue;
|
|
#if defined(_ITERATOR_DEBUG_LEVEL) && _ITERATOR_DEBUG_LEVEL > 0
|
|
using IteratorType = typename vtkm::cont::ArrayPortalToIterators<PortalType>::IteratorType;
|
|
typename IteratorType::pointer temp =
|
|
&(*(Iterators.GetBegin() + static_cast<std::ptrdiff_t>(index)));
|
|
lockedValue = temp;
|
|
return vtkmAtomicAdd(lockedValue, value);
|
|
#else
|
|
lockedValue = (Iterators.GetBegin() + index);
|
|
return vtkmAtomicAdd(lockedValue, value);
|
|
#endif
|
|
}
|
|
|
|
VTKM_EXEC
|
|
T CompareAndSwap(vtkm::Id index, const T& newValue, const T& oldValue) const
|
|
{
|
|
T* lockedValue;
|
|
#if defined(_ITERATOR_DEBUG_LEVEL) && _ITERATOR_DEBUG_LEVEL > 0
|
|
using IteratorType = typename vtkm::cont::ArrayPortalToIterators<PortalType>::IteratorType;
|
|
typename IteratorType::pointer temp =
|
|
&(*(Iterators.GetBegin() + static_cast<std::ptrdiff_t>(index)));
|
|
lockedValue = temp;
|
|
return vtkmCompareAndSwap(lockedValue, newValue, oldValue);
|
|
#else
|
|
lockedValue = (Iterators.GetBegin() + index);
|
|
return vtkmCompareAndSwap(lockedValue, newValue, oldValue);
|
|
#endif
|
|
}
|
|
|
|
private:
|
|
using PortalType =
|
|
typename vtkm::cont::ArrayHandle<T, vtkm::cont::StorageTagBasic>::template ExecutionTypes<
|
|
DeviceTag>::Portal;
|
|
using IteratorsType = vtkm::cont::ArrayPortalToIterators<PortalType>;
|
|
IteratorsType Iterators;
|
|
|
|
#if defined(VTKM_MSVC) //MSVC atomics
|
|
VTKM_EXEC
|
|
vtkm::Int32 vtkmAtomicAdd(vtkm::Int32* address, const vtkm::Int32& value) const
|
|
{
|
|
return InterlockedExchangeAdd(reinterpret_cast<volatile long*>(address), value);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int64 vtkmAtomicAdd(vtkm::Int64* address, const vtkm::Int64& value) const
|
|
{
|
|
return InterlockedExchangeAdd64(reinterpret_cast<volatile long long*>(address), value);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int32 vtkmCompareAndSwap(vtkm::Int32* address,
|
|
const vtkm::Int32& newValue,
|
|
const vtkm::Int32& oldValue) const
|
|
{
|
|
return InterlockedCompareExchange(
|
|
reinterpret_cast<volatile long*>(address), newValue, oldValue);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int64 vtkmCompareAndSwap(vtkm::Int64* address,
|
|
const vtkm::Int64& newValue,
|
|
const vtkm::Int64& oldValue) const
|
|
{
|
|
return InterlockedCompareExchange64(
|
|
reinterpret_cast<volatile long long*>(address), newValue, oldValue);
|
|
}
|
|
|
|
#else //gcc built-in atomics
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int32 vtkmAtomicAdd(vtkm::Int32* address, const vtkm::Int32& value) const
|
|
{
|
|
return __sync_fetch_and_add(address, value);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int64 vtkmAtomicAdd(vtkm::Int64* address, const vtkm::Int64& value) const
|
|
{
|
|
return __sync_fetch_and_add(address, value);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int32 vtkmCompareAndSwap(vtkm::Int32* address,
|
|
const vtkm::Int32& newValue,
|
|
const vtkm::Int32& oldValue) const
|
|
{
|
|
return __sync_val_compare_and_swap(address, oldValue, newValue);
|
|
}
|
|
|
|
VTKM_EXEC
|
|
vtkm::Int64 vtkmCompareAndSwap(vtkm::Int64* address,
|
|
const vtkm::Int64& newValue,
|
|
const vtkm::Int64& oldValue) const
|
|
{
|
|
return __sync_val_compare_and_swap(address, oldValue, newValue);
|
|
}
|
|
|
|
#endif
|
|
};
|
|
|
|
/// \brief Class providing a device-specific support for selecting the optimal
|
|
/// Task type for a given worklet.
|
|
///
|
|
/// When worklets are launched inside the execution environment we need to
|
|
/// ask the device adapter what is the preferred execution style, be it
|
|
/// a tiled iteration pattern, or strided. This class
|
|
///
|
|
/// By default if not specialized for a device adapter the default
|
|
/// is to use vtkm::exec::internal::TaskSingular
|
|
///
|
|
template <typename DeviceTag>
|
|
class DeviceTaskTypes
|
|
{
|
|
public:
|
|
template <typename WorkletType, typename InvocationType>
|
|
static vtkm::exec::internal::TaskSingular<WorkletType, InvocationType> MakeTask(
|
|
WorkletType& worklet,
|
|
InvocationType& invocation,
|
|
vtkm::Id,
|
|
vtkm::Id globalIndexOffset = 0)
|
|
{
|
|
using Task = vtkm::exec::internal::TaskSingular<WorkletType, InvocationType>;
|
|
return Task(worklet, invocation, globalIndexOffset);
|
|
}
|
|
|
|
template <typename WorkletType, typename InvocationType>
|
|
static vtkm::exec::internal::TaskSingular<WorkletType, InvocationType> MakeTask(
|
|
WorkletType& worklet,
|
|
InvocationType& invocation,
|
|
vtkm::Id3,
|
|
vtkm::Id globalIndexOffset = 0)
|
|
{
|
|
using Task = vtkm::exec::internal::TaskSingular<WorkletType, InvocationType>;
|
|
return Task(worklet, invocation, globalIndexOffset);
|
|
}
|
|
};
|
|
}
|
|
} // namespace vtkm::cont
|
|
|
|
#endif //vtk_m_cont_internal_DeviceAdapterAlgorithmGeneral_h
|