TorqueGameEngines/Torque3D
1
0
Fork 0
mirror of https://github.com/TorqueGameEngines/Torque3D.git synced 2026-04-22 04:45:31 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

update openal-soft to 1.24.3

Browse source 
keeping the alt 87514151c4 (diff-73a8dc1ce58605f6c5ea53548454c3bae516ec5132a29c9d7ff7edf9730c75be)
This commit is contained in:
AzaezelX 2025-09-03 11:09:27 -05:00
parent 12db0500e8
commit ba32094b7b
276 changed files with 49304 additions and 8712 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Engine/lib/openal-soft/common/alcomplex.cpp
View file

@ -20,7 +20,7 @@
namespace {
using ushort = unsigned short;
using ushort2 = std::pair<ushort,ushort>;
using ushort2 = std::array<ushort,2>;
using complex_d = std::complex<double>;
constexpr std::size_t BitReverseCounter(std::size_t log2_size) noexcept
@ -56,8 +56,8 @@ struct BitReverser {
if(idx < revidx)
{
mData[ret_i].first = static_cast<ushort>(idx);
mData[ret_i].second = static_cast<ushort>(revidx);
mData[ret_i][0] = static_cast<ushort>(idx);
mData[ret_i][1] = static_cast<ushort>(revidx);
++ret_i;
}
}
@ -122,7 +122,7 @@ void complex_fft(const al::span<std::complex<double>> buffer, const double sign)
if(log2_size < gBitReverses.size()) LIKELY
{
for(auto &rev : gBitReverses[log2_size])
std::swap(buffer[rev.first], buffer[rev.second]);
std::swap(buffer[rev[0]], buffer[rev[1]]);
/* Iterative form of Danielson-Lanczos lemma */
for(std::size_t i{0};i < log2_size;++i)