1 /* 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2004 David Schultz <das@FreeBSD.ORG> 5 * Copyright (c) 2026 Jesús Blázquez <jesuscblazquez@gmail.com> 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30 #include <math.h> 31 32 #include "fpmath.h" 33 34 #ifdef USE_BUILTIN_FMAXIMUMF 35 float 36 fmaximumf(float x, float y) 37 { 38 return (__builtin_fmaximumf(x, y)); 39 } 40 #else 41 float 42 fmaximumf(float x, float y) 43 { 44 union IEEEf2bits u[2]; 45 46 u[0].f = x; 47 u[1].f = y; 48 49 /* Handle NaN according to ISO/IEC 60559. NaN argument -> NaN return */ 50 if ((u[0].bits.exp == 255 && u[0].bits.man != 0) || 51 (u[1].bits.exp == 255 && u[1].bits.man != 0)) 52 return (NAN); 53 54 /* Handle comparisons of signed zeroes. */ 55 if (u[0].bits.sign != u[1].bits.sign) 56 return (u[u[0].bits.sign].f); 57 58 return (x > y ? x : y); 59 } 60 #endif 61