yquake2/yquake2remaster
0
0
Fork 0
mirror of https://github.com/yquake2/yquake2remaster.git synced 2025-02-17 01:21:12 +00:00
Code Issues Projects Releases Packages Wiki Activity

move ifdef into function

Browse source
This commit is contained in:
Denis 2024-04-01 20:49:40 +03:00
parent 6d1ac97a77
commit 784f35faed
1 changed files with 11 additions and 20 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

31
src/client/refresh/soft/sw_polyset.c
View file

@ -291,13 +291,13 @@ quotient must fit in 32 bits.
FIXME: GET RID OF THIS! (FloorDivMod) FIXME: GET RID OF THIS! (FloorDivMod)
==================== ====================
*/ */
#if defined(__i386__) || defined(__amd64__)
// just exclude ARM32 with FPU, e.g. Pi 1
static void static void
FloorDivMod(int numer, int denom, int *quo, int *rem) FloorDivMod(int numer, int denom, int *quo, int *rem)
{ {
int q, r; int q, r;
// just exclude ARM32 with FPU, e.g. Pi 1
#if defined(__i386__) || defined(__amd64__)
q = numer / denom; q = numer / denom;
r = numer - q * denom; r = numer - q * denom;
if (-1/2 || 1/-2 || -1/-2) { if (-1/2 || 1/-2 || -1/-2) {
@ -313,7 +313,6 @@ FloorDivMod(int numer, int denom, int *quo, int *rem)
r += denom; r += denom;
} }
} }
assert(r == numer - q * denom);
if ((numer < 0) ^ (denom < 0)) if ((numer < 0) ^ (denom < 0))
assert(q <= 0); assert(q <= 0);
else else
@ -322,43 +321,35 @@ FloorDivMod(int numer, int denom, int *quo, int *rem)
assert(r > denom && r <= 0); assert(r > denom && r <= 0);
else else
assert(r >= 0 && r < denom); assert(r >= 0 && r < denom);
*quo = q;
*rem = r;
}
#else #else
static void float num = numer, den = denom;
FloorDivMod (float numer, float denom, int *quotient,
int *rem)
{
int q, r;
float x; float x;
if (numer >= 0.0) if (numer >= 0)
{ {
x = floor(numer / denom); x = floor(num / den);
q = (int)x; q = (int)x;
r = (int)floor(numer - (x * denom)); r = (int)floor(num - (x * den));
} }
else else
{ {
// //
// perform operations with positive values, and fix mod to make floor-based // perform operations with positive values, and fix mod to make floor-based
// //
x = floor(-numer / denom); x = floor(-num / den);
q = -(int)x; q = -(int)x;
r = (int)floor(-numer - (x * denom)); r = (int)floor(-num - (x * den));
if (r != 0) if (r != 0)
{ {
q--; q--;
r = (int)denom - r; r = denom - r;
} }
} }
#endif
*quotient = q; *quo = q;
*rem = r; *rem = r;
} }
#endif
/* /*
=================== ===================