mirror of https://github.com/postgres/postgres
Use fabsf() instead of Abs() or fabs() where appropriate
This function is new in C99. Reviewed-by: Zhang Mingli <zmlpostgres@gmail.com> Reviewed-by: Tom Lane <tgl@sss.pgh.pa.us> Discussion: https://www.postgresql.org/message-id/flat/4beb42b5-216b-bce8-d452-d924d5794c63%40enterprisedb.com
This commit is contained in:
parent
2473cb9ff3
commit
e4c61bedcb
|
@ -102,7 +102,7 @@ float4_dist(PG_FUNCTION_ARGS)
|
|||
if (unlikely(isinf(r)) && !isinf(a) && !isinf(b))
|
||||
float_overflow_error();
|
||||
|
||||
PG_RETURN_FLOAT4(Abs(r));
|
||||
PG_RETURN_FLOAT4(fabsf(r));
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -540,7 +540,7 @@ g_int_picksplit(PG_FUNCTION_ARGS)
|
|||
union_d = inner_int_union(datum_r, datum_alpha);
|
||||
rt__int_size(union_d, &size_beta);
|
||||
pfree(union_d);
|
||||
costvector[i - 1].cost = fabs((size_alpha - size_l) - (size_beta - size_r));
|
||||
costvector[i - 1].cost = fabsf((size_alpha - size_l) - (size_beta - size_r));
|
||||
}
|
||||
qsort((void *) costvector, maxoff, sizeof(SPLITCOST), comparecost);
|
||||
|
||||
|
|
|
@ -10,6 +10,7 @@
|
|||
#include "postgres.h"
|
||||
|
||||
#include <float.h>
|
||||
#include <math.h>
|
||||
|
||||
#include "access/gist.h"
|
||||
#include "access/stratnum.h"
|
||||
|
@ -706,7 +707,7 @@ rt_seg_size(SEG *a, float *size)
|
|||
if (a == (SEG *) NULL || a->upper <= a->lower)
|
||||
*size = 0.0;
|
||||
else
|
||||
*size = (float) Abs(a->upper - a->lower);
|
||||
*size = fabsf(a->upper - a->lower);
|
||||
}
|
||||
|
||||
Datum
|
||||
|
@ -714,7 +715,7 @@ seg_size(PG_FUNCTION_ARGS)
|
|||
{
|
||||
SEG *seg = PG_GETARG_SEG_P(0);
|
||||
|
||||
PG_RETURN_FLOAT4((float) Abs(seg->upper - seg->lower));
|
||||
PG_RETURN_FLOAT4(fabsf(seg->upper - seg->lower));
|
||||
}
|
||||
|
||||
|
||||
|
|
|
@ -593,7 +593,7 @@ float4abs(PG_FUNCTION_ARGS)
|
|||
{
|
||||
float4 arg1 = PG_GETARG_FLOAT4(0);
|
||||
|
||||
PG_RETURN_FLOAT4((float4) fabs(arg1));
|
||||
PG_RETURN_FLOAT4(fabsf(arg1));
|
||||
}
|
||||
|
||||
/*
|
||||
|
|
Loading…
Reference in New Issue