1 | /* Total order operation. ldbl-96 version. |
2 | Copyright (C) 2016-2023 Free Software Foundation, Inc. |
3 | This file is part of the GNU C Library. |
4 | |
5 | The GNU C Library is free software; you can redistribute it and/or |
6 | modify it under the terms of the GNU Lesser General Public |
7 | License as published by the Free Software Foundation; either |
8 | version 2.1 of the License, or (at your option) any later version. |
9 | |
10 | The GNU C Library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | Lesser General Public License for more details. |
14 | |
15 | You should have received a copy of the GNU Lesser General Public |
16 | License along with the GNU C Library; if not, see |
17 | <https://www.gnu.org/licenses/>. */ |
18 | |
19 | #include <float.h> |
20 | #include <math.h> |
21 | #include <math_private.h> |
22 | #include <libm-alias-ldouble.h> |
23 | #include <nan-high-order-bit.h> |
24 | #include <stdint.h> |
25 | #include <shlib-compat.h> |
26 | #include <first-versions.h> |
27 | |
28 | int |
29 | __totalorderl (const long double *x, const long double *y) |
30 | { |
31 | int16_t expx, expy; |
32 | uint32_t hx, hy; |
33 | uint32_t lx, ly; |
34 | GET_LDOUBLE_WORDS (expx, hx, lx, *x); |
35 | GET_LDOUBLE_WORDS (expy, hy, ly, *y); |
36 | if (LDBL_MIN_EXP == -16382) |
37 | { |
38 | /* M68K variant: for the greatest exponent, the high mantissa |
39 | bit is not significant and both values of it are valid, so |
40 | set it before comparing. For the Intel variant, only one |
41 | value of the high mantissa bit is valid for each exponent, so |
42 | this is not necessary. */ |
43 | if ((expx & 0x7fff) == 0x7fff) |
44 | hx |= 0x80000000; |
45 | if ((expy & 0x7fff) == 0x7fff) |
46 | hy |= 0x80000000; |
47 | } |
48 | #if HIGH_ORDER_BIT_IS_SET_FOR_SNAN |
49 | # error not implemented |
50 | #endif |
51 | uint32_t x_sign = expx >> 15; |
52 | uint32_t y_sign = expy >> 15; |
53 | expx ^= x_sign >> 17; |
54 | hx ^= x_sign; |
55 | lx ^= x_sign; |
56 | expy ^= y_sign >> 17; |
57 | hy ^= y_sign; |
58 | ly ^= y_sign; |
59 | return expx < expy || (expx == expy && (hx < hy || (hx == hy && lx <= ly))); |
60 | } |
61 | #ifdef SHARED |
62 | # define CONCATX(x, y) x ## y |
63 | # define CONCAT(x, y) CONCATX (x, y) |
64 | # define UNIQUE_ALIAS(name) CONCAT (name, __COUNTER__) |
65 | # define do_symbol(orig_name, name, aliasname) \ |
66 | strong_alias (orig_name, name) \ |
67 | versioned_symbol (libm, name, aliasname, GLIBC_2_31) |
68 | # undef weak_alias |
69 | # define weak_alias(name, aliasname) \ |
70 | do_symbol (name, UNIQUE_ALIAS (name), aliasname); |
71 | #endif |
72 | libm_alias_ldouble (__totalorder, totalorder) |
73 | #if SHLIB_COMPAT (libm, GLIBC_2_25, GLIBC_2_31) |
74 | int |
75 | attribute_compat_text_section |
76 | __totalorder_compatl (long double x, long double y) |
77 | { |
78 | return __totalorderl (&x, &y); |
79 | } |
80 | #undef do_symbol |
81 | #define do_symbol(orig_name, name, aliasname) \ |
82 | strong_alias (orig_name, name) \ |
83 | compat_symbol (libm, name, aliasname, \ |
84 | CONCAT (FIRST_VERSION_libm_, aliasname)) |
85 | libm_alias_ldouble (__totalorder_compat, totalorder) |
86 | #endif |
87 | |