summaryrefslogtreecommitdiffstats
path: root/contrib/compiler-rt/lib/muloti4.c
diff options
context:
space:
mode:
authored <ed@FreeBSD.org>2011-12-31 19:01:48 +0000
committered <ed@FreeBSD.org>2011-12-31 19:01:48 +0000
commit0ece074de9d070fa87b7f58f9e96bce63db862d8 (patch)
tree21b838383a703c249dd4f0180c8566c40f70e0e3 /contrib/compiler-rt/lib/muloti4.c
parent55bd70ed9a164b6b2d84037c8362ff3725ff294b (diff)
parent6a5f9bc9ae3205be8bb5570b86a509fcd01a9db6 (diff)
downloadFreeBSD-src-0ece074de9d070fa87b7f58f9e96bce63db862d8.zip
FreeBSD-src-0ece074de9d070fa87b7f58f9e96bce63db862d8.tar.gz
Upgrade libcompiler_rt to upstream revision 147390.
This version of libcompiler_rt adds support for __mulo[sdt]i4(), which computes a multiply and its overflow flag. There are also a lot of cleanup fixes to headers that don't really affect us. Updating to this revision should make it a bit easier to contribute changes back to the LLVM developers.
Diffstat (limited to 'contrib/compiler-rt/lib/muloti4.c')
-rw-r--r--contrib/compiler-rt/lib/muloti4.c62
1 files changed, 62 insertions, 0 deletions
diff --git a/contrib/compiler-rt/lib/muloti4.c b/contrib/compiler-rt/lib/muloti4.c
new file mode 100644
index 0000000..1fcd0ba
--- /dev/null
+++ b/contrib/compiler-rt/lib/muloti4.c
@@ -0,0 +1,62 @@
+/*===-- muloti4.c - Implement __muloti4 -----------------------------------===
+ *
+ * The LLVM Compiler Infrastructure
+ *
+ * This file is dual licensed under the MIT and the University of Illinois Open
+ * Source Licenses. See LICENSE.TXT for details.
+ *
+ * ===----------------------------------------------------------------------===
+ *
+ * This file implements __muloti4 for the compiler_rt library.
+ *
+ * ===----------------------------------------------------------------------===
+ */
+
+#if __x86_64
+
+#include "int_lib.h"
+
+/* Returns: a * b */
+
+/* Effects: sets *overflow to 1 if a * b overflows */
+
+ti_int
+__muloti4(ti_int a, ti_int b, int* overflow)
+{
+ const int N = (int)(sizeof(ti_int) * CHAR_BIT);
+ const ti_int MIN = (ti_int)1 << (N-1);
+ const ti_int MAX = ~MIN;
+ *overflow = 0;
+ ti_int result = a * b;
+ if (a == MIN)
+ {
+ if (b != 0 && b != 1)
+ *overflow = 1;
+ return result;
+ }
+ if (b == MIN)
+ {
+ if (a != 0 && a != 1)
+ *overflow = 1;
+ return result;
+ }
+ ti_int sa = a >> (N - 1);
+ ti_int abs_a = (a ^ sa) - sa;
+ ti_int sb = b >> (N - 1);
+ ti_int abs_b = (b ^ sb) - sb;
+ if (abs_a < 2 || abs_b < 2)
+ return result;
+ if (sa == sb)
+ {
+ if (abs_a > MAX / abs_b)
+ *overflow = 1;
+ }
+ else
+ {
+ if (abs_a > MIN / -abs_b)
+ *overflow = 1;
+ }
+ return result;
+}
+
+#endif
OpenPOWER on IntegriCloud