Mirrors/overte
3
0
Fork 0
mirror of https://github.com/overte-org/overte.git synced 2025-04-08 08:14:48 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Merge pull request #14674 from kencooke/audio-asan-warnings3

Browse source 
Fix ASAN warning due to mixed signed/unsigned arithmetic
This commit is contained in:
Brad Hefta-Gaub 2019-01-14 09:32:22 -08:00 committed by GitHub
commit a115af6353
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
2 changed files with 10 additions and 10 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
libraries/audio/src/AudioFOA.cpp
View file

@ -695,7 +695,7 @@ static void ifft_radix8_first(complex_t* x, complex_t* y, int n, int p) {
// n >= 4
static void rfft_post(complex_t* x, const complex_t* w, int n) {
size_t t = n/4;
int t = n/4;
assert(t >= 1);
// NOTE: x[n/2].re is packed into x[0].im
@ -707,7 +707,7 @@ static void rfft_post(complex_t* x, const complex_t* w, int n) {
complex_t* xp0 = &x[1];
complex_t* xp1 = &x[n/2 - 1];
for (size_t i = 0; i < t; i++) {
for (int i = 0; i < t; i++) {
float ar = xp0[i].re;
float ai = xp0[i].im;
@ -743,7 +743,7 @@ static void rfft_post(complex_t* x, const complex_t* w, int n) {
// n >= 4
static void rifft_pre(complex_t* x, const complex_t* w, int n) {
size_t t = n/4;
int t = n/4;
assert(t >= 1);
// NOTE: x[n/2].re is packed into x[0].im
@ -755,7 +755,7 @@ static void rifft_pre(complex_t* x, const complex_t* w, int n) {
complex_t* xp0 = &x[1];
complex_t* xp1 = &x[n/2 - 1];
for (size_t i = 0; i < t; i++) {
for (int i = 0; i < t; i++) {
float ar = xp0[i].re;
float ai = xp0[i].im;

12
libraries/audio/src/avx2/AudioFOA_avx2.cpp
View file

@ -973,8 +973,8 @@ FORCEINLINE static void ifft_radix8_first(complex_t* x, complex_t* y, int n, int
// n >= 32
static void rfft_post(complex_t* x, const complex_t* w, int n) {
size_t t = n/4;
assert(n/4 >= 8); // SIMD8
int t = n/4;
assert(t >= 8); // SIMD8
// NOTE: x[n/2].re is packed into x[0].im
float tr = x[0].re;
@ -985,7 +985,7 @@ static void rfft_post(complex_t* x, const complex_t* w, int n) {
complex_t* xp0 = &x[1];
complex_t* xp1 = &x[n/2 - 8];
for (size_t i = 0; i < t; i += 8) {
for (int i = 0; i < t; i += 8) {
__m256 z0 = _mm256_loadu_ps(&xp0[i+0].re);
__m256 z1 = _mm256_loadu_ps(&xp0[i+4].re);
@ -1033,8 +1033,8 @@ static void rfft_post(complex_t* x, const complex_t* w, int n) {
// n >= 32
static void rifft_pre(complex_t* x, const complex_t* w, int n) {
size_t t = n/4;
assert(n/4 >= 8); // SIMD8
int t = n/4;
assert(t >= 8); // SIMD8
// NOTE: x[n/2].re is packed into x[0].im
float tr = x[0].re;
@ -1045,7 +1045,7 @@ static void rifft_pre(complex_t* x, const complex_t* w, int n) {
complex_t* xp0 = &x[1];
complex_t* xp1 = &x[n/2 - 8];
for (size_t i = 0; i < t; i += 8) {
for (int i = 0; i < t; i += 8) {
__m256 z0 = _mm256_loadu_ps(&xp0[i+0].re);
__m256 z1 = _mm256_loadu_ps(&xp0[i+4].re);