Branch data     Line data    Source code

       1                 :             : /*-
       2                 :             :  * Copyright (c) 2004 David Schultz <das@FreeBSD.ORG>
       3                 :             :  * All rights reserved.
       4                 :             :  *
       5                 :             :  * Redistribution and use in source and binary forms, with or without
       6                 :             :  * modification, are permitted provided that the following conditions
       7                 :             :  * are met:
       8                 :             :  * 1. Redistributions of source code must retain the above copyright
       9                 :             :  *    notice, this list of conditions and the following disclaimer.
      10                 :             :  * 2. Redistributions in binary form must reproduce the above copyright
      11                 :             :  *    notice, this list of conditions and the following disclaimer in the
      12                 :             :  *    documentation and/or other materials provided with the distribution.
      13                 :             :  *
      14                 :             :  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
      15                 :             :  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
      16                 :             :  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
      17                 :             :  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
      18                 :             :  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
      19                 :             :  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
      20                 :             :  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
      21                 :             :  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
      22                 :             :  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
      23                 :             :  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
      24                 :             :  * SUCH DAMAGE.
      25                 :             :  */
      26                 :             : 
      27                 :             : #include "cdefs-compat.h"
      28                 :             : //__FBSDID("$FreeBSD: src/lib/msun/src/s_fmaxf.c,v 1.1 2004/06/30 07:04:01 das Exp $");
      29                 :             : 
      30                 :             : #include <openlibm_math.h>
      31                 :             : 
      32                 :             : #include "fpmath.h"
      33                 :             : #include "math_private.h"
      34                 :             : 
      35                 :             : OLM_DLLEXPORT float
      36                 :          25 : fmaxf(float x, float y)
      37                 :             : {
      38                 :             :         union IEEEf2bits u[2];
      39                 :             : 
      40                 :          25 :         u[0].f = x;
      41                 :          25 :         u[1].f = y;
      42                 :             : 
      43                 :             :         /* Check for NaNs to avoid raising spurious exceptions. */
      44   [ +  +  +  + ]:          25 :         if (u[0].bits.exp == 255 && u[0].bits.man != 0)
      45                 :           6 :                 return (y);
      46   [ +  +  +  + ]:          19 :         if (u[1].bits.exp == 255 && u[1].bits.man != 0)
      47                 :           5 :                 return (x);
      48                 :             : 
      49                 :             :         /* Handle comparisons of signed zeroes. */
      50         [ +  + ]:          14 :         if (u[0].bits.sign != u[1].bits.sign)
      51                 :           6 :                 return (u[u[0].bits.sign].f);
      52                 :             : 
      53         [ +  + ]:           8 :         return (x > y ? x : y);
      54                 :             : }