mirror of
https://github.com/matrix-construct/construct
synced 2024-09-06 08:45:20 +02:00
43 lines
1.3 KiB
C
43 lines
1.3 KiB
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.
|
||
|
|
|
||
|
|
/// Sum all elements in the buffer. All threads in the group participate;
|
||
|
|
/// result is placed in index [0], the rest of the buffer is trashed.
|
||
|
|
inline void
|
||
|
|
ircd_simt_reduce_add_f4lldr(__local float4 *const buf,
|
||
|
|
const uint ln,
|
||
|
|
const uint li)
|
||
|
|
{
|
||
|
|
for(uint stride = ln >> 1; stride > 0; stride >>= 1)
|
||
|
|
{
|
||
|
|
barrier(CLK_LOCAL_MEM_FENCE);
|
||
|
|
|
||
|
|
if(li < stride)
|
||
|
|
buf[li] += buf[li + stride];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/// Find the greatest value in the buffer. All threads in the group participate;
|
||
|
|
/// the greatest value is placed in index [0], the rest of the buffer is
|
||
|
|
/// trashed.
|
||
|
|
inline void
|
||
|
|
ircd_simt_reduce_max_f4lldr(__local float *const buf,
|
||
|
|
const uint ln,
|
||
|
|
const uint li)
|
||
|
|
{
|
||
|
|
for(uint stride = ln >> 1; stride > 0; stride >>= 1)
|
||
|
|
{
|
||
|
|
barrier(CLK_LOCAL_MEM_FENCE);
|
||
|
|
|
||
|
|
if(li < stride)
|
||
|
|
buf[li] = max(buf[li], buf[li + stride]);
|
||
|
|
}
|
||
|
|
}
|