mirror of
https://github.com/matrix-construct/construct
synced 2024-11-09 11:31:11 +01:00
33 lines
1,003 B
C
33 lines
1,003 B
C
|
// Matrix Construct
|
||
|
|
//
|
||
|
|
// Copyright (C) Matrix Construct Developers, Authors & Contributors
|
||
|
|
// Copyright (C) 2016-2021 Jason Volk <jason@zemos.net>
|
||
|
|
//
|
||
|
|
// Permission to use, copy, modify, and/or distribute this software for any
|
||
|
|
// purpose with or without fee is hereby granted, provided that the above
|
||
|
|
// copyright notice and this permission notice is present in all copies. The
|
||
|
|
// full license for this software is available in the LICENSE file.
|
||
|
|
|
||
|
|
/// Sort indices in `idx` which point to values contained in `val`.
|
||
|
|
inline void
|
||
|
|
ircd_simt_sort_idx16_flldr(__local ushort *const idx,
|
||
|
|
__global const float *const val,
|
||
|
|
const uint ln,
|
||
|
|
const uint li)
|
||
|
|
{
|
||
|
|
for(uint stride = ln >> 1; stride > 0; stride >>= 1)
|
||
|
|
{
|
||
|
|
barrier(CLK_LOCAL_MEM_FENCE);
|
||
|
|
|
||
|
|
if(li < stride && val[idx[li]] < val[idx[li + stride]])
|
||
|
|
{
|
||
|
|
const ushort
|
||
|
|
ours = idx[li],
|
||
|
|
theirs = idx[li + stride];
|
||
|
|
|
||
|
|
idx[li] = theirs;
|
||
|
|
idx[li + stride] = ours;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|