aboutsummaryrefslogtreecommitdiff
path: root/win32/include/math.h
diff options
context:
space:
mode:
authorseyko <seyko2@gmail.com>2015-05-14 01:27:46 +0300
committerseyko <seyko2@gmail.com>2015-05-14 01:27:46 +0300
commit101cc8747f767344d38566bd229f1761ad96f744 (patch)
treeef800583f7994bb56c6c32bf4256f44727c5d48d /win32/include/math.h
parent80322adaa0544eedc7198ed4c529a41856f66f43 (diff)
downloadtinycc-101cc8747f767344d38566bd229f1761ad96f744.tar.gz
tinycc-101cc8747f767344d38566bd229f1761ad96f744.tar.bz2
win32/include/winapi changes from https://github.com/run4flat/tinycc.git
just for testing. Is it needed? I'm not a MSYS citizen. run4flat is a tcc fork by David Mertens that knows how to work with multiple symbol tables. Excelent work. A good descriptions of the tcc internals inside a code comments.
Diffstat (limited to 'win32/include/math.h')
-rw-r--r--win32/include/math.h34
1 files changed, 0 insertions, 34 deletions
diff --git a/win32/include/math.h b/win32/include/math.h
index 5048ef9..251d3f7 100644
--- a/win32/include/math.h
+++ b/win32/include/math.h
@@ -777,39 +777,5 @@ extern "C++" {
* which always returns true: yes, (NaN != NaN) is true).
*/
-#if __GNUC__ >= 3
-
-#define isgreater(x, y) __builtin_isgreater(x, y)
-#define isgreaterequal(x, y) __builtin_isgreaterequal(x, y)
-#define isless(x, y) __builtin_isless(x, y)
-#define islessequal(x, y) __builtin_islessequal(x, y)
-#define islessgreater(x, y) __builtin_islessgreater(x, y)
-#define isunordered(x, y) __builtin_isunordered(x, y)
-
-#else
-/* helper */
-__CRT_INLINE int __cdecl
-__fp_unordered_compare (long double x, long double y){
- unsigned short retval;
- __asm__ ("fucom %%st(1);"
- "fnstsw;": "=a" (retval) : "t" (x), "u" (y));
- return retval;
-}
-
-#define isgreater(x, y) ((__fp_unordered_compare(x, y) \
- & 0x4500) == 0)
-#define isless(x, y) ((__fp_unordered_compare (y, x) \
- & 0x4500) == 0)
-#define isgreaterequal(x, y) ((__fp_unordered_compare (x, y) \
- & FP_INFINITE) == 0)
-#define islessequal(x, y) ((__fp_unordered_compare(y, x) \
- & FP_INFINITE) == 0)
-#define islessgreater(x, y) ((__fp_unordered_compare(x, y) \
- & FP_SUBNORMAL) == 0)
-#define isunordered(x, y) ((__fp_unordered_compare(x, y) \
- & 0x4500) == 0x4500)
-
-#endif
-
#endif /* End _MATH_H_ */