/usr/lib/python2.7/dist-packages/pyopencl/bitonic_sort.py is in python-pyopencl 2017.2.2-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 | from __future__ import division, with_statement, absolute_import, print_function
__copyright__ = """
Copyright (c) 2011, Eric Bainville
Copyright (c) 2015, Ilya Efimoff
All rights reserved.
"""
# based on code at http://www.bealto.com/gpu-sorting_intro.html
__license__ = """
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 copyright holder 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 HOLDER 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.
"""
import pyopencl as cl
from pyopencl.tools import dtype_to_ctype
from operator import mul
from functools import reduce
from pytools import memoize_method
from mako.template import Template
import pyopencl.bitonic_sort_templates as _tmpl
def _is_power_of_2(n):
from pyopencl.tools import bitlog2
return n == 0 or 2**bitlog2(n) == n
class BitonicSort(object):
"""Sort an array (or one axis of one) using a sorting network.
Will only work if the axis of the array to be sorted has a length
that is a power of 2.
.. versionadded:: 2015.2
.. seealso:: :class:`pyopencl.algorithm.RadixSort`
.. automethod:: __call__
"""
kernels_srcs = {
'B2': _tmpl.ParallelBitonic_B2,
'B4': _tmpl.ParallelBitonic_B4,
'B8': _tmpl.ParallelBitonic_B8,
'B16': _tmpl.ParallelBitonic_B16,
'C4': _tmpl.ParallelBitonic_C4,
'BL': _tmpl.ParallelBitonic_Local,
'BLO': _tmpl.ParallelBitonic_Local_Optim,
'PML': _tmpl.ParallelMerge_Local
}
def __init__(self, context):
self.context = context
def __call__(self, arr, idx=None, queue=None, wait_for=None, axis=0):
"""
:arg arr: the array to be sorted. Will be overwritten with the sorted array.
:arg idx: an array of indices to be tracked along with the sorting of *arr*
:arg queue: a :class:`pyopencl.CommandQueue`, defaults to the array's queue
if None
:arg wait_for: a list of :class:`pyopencl.Event` instances or None
:arg axis: the axis of the array by which to sort
:returns: a tuple (sorted_array, event)
"""
if queue is None:
queue = arr.queue
if wait_for is None:
wait_for = []
wait_for = wait_for + arr.events
last_evt = cl.enqueue_marker(queue, wait_for=wait_for)
if arr.shape[axis] == 0:
return arr, last_evt
if not _is_power_of_2(arr.shape[axis]):
raise ValueError("sorted array axis length must be a power of 2")
if idx is None:
argsort = 0
else:
argsort = 1
run_queue = self.sort_b_prepare_wl(
argsort,
arr.dtype,
idx.dtype if idx is not None else None, arr.shape,
axis)
knl, nt, wg, aux = run_queue[0]
if idx is not None:
if aux:
last_evt = knl(
queue, (nt,), wg, arr.data, idx.data,
cl.LocalMemory(
_tmpl.LOCAL_MEM_FACTOR*wg[0]*arr.dtype.itemsize),
cl.LocalMemory(
_tmpl.LOCAL_MEM_FACTOR*wg[0]*idx.dtype.itemsize),
wait_for=[last_evt])
for knl, nt, wg, _ in run_queue[1:]:
last_evt = knl(
queue, (nt,), wg, arr.data, idx.data,
wait_for=[last_evt])
else:
if aux:
last_evt = knl(
queue, (nt,), wg, arr.data,
cl.LocalMemory(
_tmpl.LOCAL_MEM_FACTOR*wg[0]*4*arr.dtype.itemsize),
wait_for=[last_evt])
for knl, nt, wg, _ in run_queue[1:]:
last_evt = knl(queue, (nt,), wg, arr.data, wait_for=[last_evt])
return arr, last_evt
@memoize_method
def get_program(self, letter, argsort, params):
defstpl = Template(_tmpl.defines)
defs = defstpl.render(
NS="\\", argsort=argsort, inc=params[0], dir=params[1],
dtype=params[2], idxtype=params[3],
dsize=params[4], nsize=params[5])
kid = Template(self.kernels_srcs[letter]).render(argsort=argsort)
prg = cl.Program(self.context, defs + kid).build()
return prg
@memoize_method
def sort_b_prepare_wl(self, argsort, key_dtype, idx_dtype, shape, axis):
key_ctype = dtype_to_ctype(key_dtype)
if idx_dtype is None:
idx_ctype = 'uint' # Dummy
else:
idx_ctype = dtype_to_ctype(idx_dtype)
run_queue = []
ds = int(shape[axis])
size = reduce(mul, shape)
ndim = len(shape)
ns = reduce(mul, shape[(axis+1):]) if axis < ndim-1 else 1
ds = int(shape[axis])
allowb4 = True
allowb8 = True
allowb16 = True
dev = self.context.devices[0]
# {{{ find workgroup size
wg = min(ds, dev.max_work_group_size)
available_lmem = dev.local_mem_size
while True:
lmem_size = _tmpl.LOCAL_MEM_FACTOR*wg*key_dtype.itemsize
if argsort:
lmem_size += _tmpl.LOCAL_MEM_FACTOR*wg*idx_dtype.itemsize
if lmem_size + 512 > available_lmem:
wg //= 2
if not wg:
raise RuntimeError(
"too little local memory available on '%s'"
% dev)
else:
break
# }}}
length = wg >> 1
prg = self.get_program(
'BLO', argsort, (1, 1, key_ctype, idx_ctype, ds, ns))
run_queue.append((prg.run, size, (wg,), True))
while length < ds:
inc = length
while inc > 0:
ninc = 0
direction = length << 1
if allowb16 and inc >= 8 and ninc == 0:
letter = 'B16'
ninc = 4
elif allowb8 and inc >= 4 and ninc == 0:
letter = 'B8'
ninc = 3
elif allowb4 and inc >= 2 and ninc == 0:
letter = 'B4'
ninc = 2
elif inc >= 0:
letter = 'B2'
ninc = 1
nthreads = size >> ninc
prg = self.get_program(letter, argsort,
(inc, direction, key_ctype, idx_ctype, ds, ns))
run_queue.append((prg.run, nthreads, None, False,))
inc >>= ninc
length <<= 1
return run_queue
|