mirror of
https://github.com/acidanthera/audk.git
synced 2025-07-30 17:14:07 +02:00
StdLib: GCC 6 build fixes
Resolve mainly 'misleading indentation', but also one 'defined but not used' warning when building with GCC 6 (using GCC5 profile). Contributed-under: TianoCore Contribution Agreement 1.0 Signed-off-by: Leif Lindholm <leif.lindholm@linaro.org> Reviewed-by: Jaben Carsey <jaben.carsey@intel.com>
This commit is contained in:
parent
fcdb928a82
commit
65ed9d7ff5
@ -174,7 +174,8 @@ __kernel_rem_pio2(double *x, double *y, int e0, int nx, int prec, const int32_t
|
|||||||
|
|
||||||
/* compute q[0],q[1],...q[jk] */
|
/* compute q[0],q[1],...q[jk] */
|
||||||
for (i=0;i<=jk;i++) {
|
for (i=0;i<=jk;i++) {
|
||||||
for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j]; q[i] = fw;
|
for(j=0,fw=0.0;j<=jx;j++) fw += x[j]*f[jx+i-j];
|
||||||
|
q[i] = fw;
|
||||||
}
|
}
|
||||||
|
|
||||||
jz = jk;
|
jz = jk;
|
||||||
|
@ -22,9 +22,11 @@ __RCSID("$NetBSD: w_exp.c,v 1.9 2002/05/26 22:02:00 wiz Exp $");
|
|||||||
#include "math.h"
|
#include "math.h"
|
||||||
#include "math_private.h"
|
#include "math_private.h"
|
||||||
|
|
||||||
|
#ifndef _IEEE_LIBM
|
||||||
static const double
|
static const double
|
||||||
o_threshold= 7.09782712893383973096e+02, /* 0x40862E42, 0xFEFA39EF */
|
o_threshold= 7.09782712893383973096e+02, /* 0x40862E42, 0xFEFA39EF */
|
||||||
u_threshold= -7.45133219101941108420e+02; /* 0xc0874910, 0xD52D3051 */
|
u_threshold= -7.45133219101941108420e+02; /* 0xc0874910, 0xD52D3051 */
|
||||||
|
#endif
|
||||||
|
|
||||||
double
|
double
|
||||||
exp(double x) /* wrapper exp */
|
exp(double x) /* wrapper exp */
|
||||||
|
@ -464,11 +464,11 @@ time1(
|
|||||||
for (i = 0; i < sp->typecnt; ++i)
|
for (i = 0; i < sp->typecnt; ++i)
|
||||||
seen[i] = FALSE;
|
seen[i] = FALSE;
|
||||||
nseen = 0;
|
nseen = 0;
|
||||||
for (i = sp->timecnt - 1; i >= 0; --i)
|
for (i = sp->timecnt - 1; i >= 0; --i)
|
||||||
if (!seen[sp->types[i]]) {
|
if (!seen[sp->types[i]]) {
|
||||||
seen[sp->types[i]] = TRUE;
|
seen[sp->types[i]] = TRUE;
|
||||||
types[nseen++] = sp->types[i];
|
types[nseen++] = sp->types[i];
|
||||||
}
|
}
|
||||||
for (sameind = 0; sameind < nseen; ++sameind) {
|
for (sameind = 0; sameind < nseen; ++sameind) {
|
||||||
samei = types[sameind];
|
samei = types[sameind];
|
||||||
if (sp->ttis[samei].tt_isdst != tmp->tm_isdst)
|
if (sp->ttis[samei].tt_isdst != tmp->tm_isdst)
|
||||||
|
@ -526,15 +526,15 @@ dtoa
|
|||||||
Bfree(b);
|
Bfree(b);
|
||||||
b = b1;
|
b = b1;
|
||||||
}
|
}
|
||||||
if (( j = b5 - m5 )!=0)
|
if (( j = b5 - m5 )!=0)
|
||||||
b = pow5mult(b, j);
|
b = pow5mult(b, j);
|
||||||
if (b == NULL)
|
if (b == NULL)
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
b = pow5mult(b, b5);
|
b = pow5mult(b, b5);
|
||||||
if (b == NULL)
|
if (b == NULL)
|
||||||
return NULL;
|
return NULL;
|
||||||
}
|
}
|
||||||
S = i2b(1);
|
S = i2b(1);
|
||||||
if (S == NULL)
|
if (S == NULL)
|
||||||
|
Loading…
x
Reference in New Issue
Block a user