RadixSort.h

Go to the documentation of this file.

/*
 *  This file is part of AQUAgpusph, a free CFD program based on SPH.
 *  Copyright (C) 2012  Jose Luis Cercos Pita <jl.cercos@upm.es>
 *
 *  AQUAgpusph is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  AQUAgpusph is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with AQUAgpusph.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef RADIXSORT_H_INCLUDED
#define RADIXSORT_H_INCLUDED
 
#include <sphPrerequisites.h>
#include <CalcServer.h>
#include <CalcServer/Tool.h>
 
#ifndef _ITEMS
#define _ITEMS 128
#endif
#ifndef _GROUPS
#define _GROUPS 32
#endif
#ifndef __UINTBITS__
#define __UINTBITS__ 32
#endif
#ifndef _STEPBITS
#define _STEPBITS 4
#endif
#define _RADIX (1 << _STEPBITS)
#ifndef _HISTOSPLIT
#define _HISTOSPLIT 512
#endif
 
/* Modify data in order to impose that local size don't be lower than
 * minimum allowed value.
 */
#if _ITEMS < __CL_MIN_LOCALSIZE__
#undef _ITEMS
#define _ITEMS __CL_MIN_LOCALSIZE__
#endif
#if _HISTOSPLIT / 2 < __CL_MIN_LOCALSIZE__
#undef _HISTOSPLIT
#define _HISTOSPLIT 2 * __CL_MIN_LOCALSIZE__
#endif
#if _RADIX * _GROUPS * _ITEMS / 2 / _HISTOSPLIT < __CL_MIN_LOCALSIZE__
#undef _GROUPS
#define _GROUPS 2 * __CL_MIN_LOCALSIZE__* _HISTOSPLIT / (_RADIX * _ITEMS)
#endif
 
namespace Aqua {
namespace CalcServer {
 
class RadixSort : public Aqua::CalcServer::Tool
{
  public:
        RadixSort(const std::string tool_name,
                  const std::string variable = "icell",
                  const std::string permutations = "id_unsorted",
                  const std::string inv_permutations = "id_sorted",
                  bool once = false);
 
        ~RadixSort();
 
        void setup();
 
  protected:
        cl_event _execute(const std::vector<cl_event> events);
 
  private:
        cl_event init();
 
        cl_event histograms(cl_event keys_event, cl_event histograms_event);
 
        cl_event scan(cl_event event);
 
        cl_event reorder(cl_event perms_event, cl_event histograms_event);
 
        cl_event inversePermutations();
 
        void variables();
 
        void setupOpenCL();
 
        void setupDims();
 
        void setupMems();
 
        void setupArgs();
 
        std::string _var_name;
 
        std::string _perms_name;
 
        std::string _inv_perms_name;
 
        InputOutput::ArrayVariable* _var;
 
        InputOutput::ArrayVariable* _perms;
 
        InputOutput::ArrayVariable* _inv_perms;
 
        unsigned int _n;
 
        cl_kernel _init_kernel;
        cl_kernel _histograms_kernel;
        cl_kernel _scan_kernel;
        cl_kernel _paste_kernel;
        cl_kernel _sort_kernel;
        cl_kernel _inv_perms_kernel;
 
        cl_mem _in_keys;
        cl_mem _out_keys;
        cl_mem _in_permut;
        cl_mem _out_permut;
        cl_mem _histograms;
        cl_mem _global_sums;
        cl_mem _temp_mem;
 
        unsigned int _items;
        unsigned int _groups;
        unsigned int _bits;
        unsigned int _radix;
        unsigned int _histo_split;
 
        unsigned int _key_bits;
        unsigned int _n_pass;
        unsigned int _pass;
 
        size_t _local_work_size;
        size_t _global_work_size;
};
 
}
} // namespace
 
#endif // RADIXSORT_H_INCLUDED