Tpetra_Details_radixSort.hpp

/*
// @HEADER
// ***********************************************************************
//
//          Tpetra: Templated Linear Algebra Services Package
//                 Copyright (2008) Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// 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 Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "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 SANDIA CORPORATION OR THE
// 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.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
// @HEADER
*/
 
#ifndef TPETRA_DETAILS_RADIXSORT_HPP
#define TPETRA_DETAILS_RADIXSORT_HPP
 
#include "TpetraCore_config.h"
#include "Kokkos_Macros.hpp"
 
namespace Tpetra
{
namespace Details
{

template<typename KeyType, typename ValueType, typename IndexType>
KOKKOS_INLINE_FUNCTION void
radixSortKeysAndValues(KeyType* keys, KeyType* keysAux, ValueType* values, ValueType* valuesAux, IndexType n, IndexType upperBound)
{
  if(n <= 1)
    return;
  KeyType mask = 0xF;
  bool inAux = false;
  //maskPos counts the low bit index of mask (0, 4, 8, ...)
  IndexType maskPos = 0;
  //Count number of bits required to sort (8 * sizeof(KeyType) - lzcnt(maxKey - minKey))
  IndexType sortBits = 0;
  while(upperBound)
  {
    upperBound >>= 1;
    sortBits++;
  }
  for(IndexType s = 0; s < (sortBits + 3) / 4; s++)
  {
    //Count the number of elements in each bucket
    IndexType count[16] = {0};
    IndexType offset[17] = {0};
    if(!inAux)
    {
      for(IndexType i = 0; i < n; i++)
      {
        count[(keys[i] & mask) >> maskPos]++;
      }
    }
    else
    {
      for(IndexType i = 0; i < n; i++)
      {
        count[(keysAux[i] & mask) >> maskPos]++;
      }
    }
    //get offset as the prefix sum for count
    for(IndexType i = 0; i < 16; i++)
    {
      offset[i + 1] = offset[i] + count[i];
    }
    //now for each element in [lo, hi), move it to its offset in the other buffer
    //this branch should be ok because whichBuf is the same on all threads
    if(!inAux)
    {
      //copy from *Over to *Aux
      for(IndexType i = 0; i < n; i++)
      {
        IndexType bucket = (keys[i] & mask) >> maskPos;
        keysAux[offset[bucket + 1] - count[bucket]] = keys[i];
        valuesAux[offset[bucket + 1] - count[bucket]] = values[i];
        count[bucket]--;
      }
    }
    else
    {
      //copy from *Aux to *Over
      for(IndexType i = 0; i < n; i++)
      {
        IndexType bucket = (keysAux[i] & mask) >> maskPos;
        keys[offset[bucket + 1] - count[bucket]] = keysAux[i];
        values[offset[bucket + 1] - count[bucket]] = valuesAux[i];
        count[bucket]--;
      }
    }
    inAux = !inAux;
    mask = mask << 4;
    maskPos += 4;
  }
  if(inAux)
  {
    //need to deep copy from aux arrays to main
    for(IndexType i = 0; i < n; i++)
    {
      keys[i] = keysAux[i];
      values[i] = valuesAux[i];
    }
  }
}
 
} //namespace Details
} //namespace Tpetra
 
#endif  //include guard