diff options
author | dim <dim@FreeBSD.org> | 2015-01-08 19:47:10 +0000 |
---|---|---|
committer | dim <dim@FreeBSD.org> | 2015-01-08 19:47:10 +0000 |
commit | ab328f15cea04a45750ef56019d2b3d971e033f3 (patch) | |
tree | f47eabbd2a48be6d6fec3ddeeefae5b4aeb87dbc /contrib/compiler-rt/lib/builtins/ashrdi3.c | |
parent | 8189659be8e499f37c87fdd05ef5ec9f88619d56 (diff) | |
parent | 2f1c5cc1039d86db0037cb086bd58f4b90dc6f66 (diff) | |
download | FreeBSD-src-ab328f15cea04a45750ef56019d2b3d971e033f3.zip FreeBSD-src-ab328f15cea04a45750ef56019d2b3d971e033f3.tar.gz |
Update compiler-rt to trunk r224034. This brings a number of new
builtins, and also the various sanitizers. Support for these will be
added in a later commit.
Diffstat (limited to 'contrib/compiler-rt/lib/builtins/ashrdi3.c')
-rw-r--r-- | contrib/compiler-rt/lib/builtins/ashrdi3.c | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/contrib/compiler-rt/lib/builtins/ashrdi3.c b/contrib/compiler-rt/lib/builtins/ashrdi3.c new file mode 100644 index 0000000..14c878b --- /dev/null +++ b/contrib/compiler-rt/lib/builtins/ashrdi3.c @@ -0,0 +1,44 @@ +/*===-- ashrdi3.c - Implement __ashrdi3 -----------------------------------=== + * + * 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 __ashrdi3 for the compiler_rt library. + * + * ===----------------------------------------------------------------------=== + */ + +#include "int_lib.h" + +/* Returns: arithmetic a >> b */ + +/* Precondition: 0 <= b < bits_in_dword */ + +ARM_EABI_FNALIAS(lasr, ashrdi3) + +COMPILER_RT_ABI di_int +__ashrdi3(di_int a, si_int b) +{ + const int bits_in_word = (int)(sizeof(si_int) * CHAR_BIT); + dwords input; + dwords result; + input.all = a; + if (b & bits_in_word) /* bits_in_word <= b < bits_in_dword */ + { + /* result.s.high = input.s.high < 0 ? -1 : 0 */ + result.s.high = input.s.high >> (bits_in_word - 1); + result.s.low = input.s.high >> (b - bits_in_word); + } + else /* 0 <= b < bits_in_word */ + { + if (b == 0) + return a; + result.s.high = input.s.high >> b; + result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b); + } + return result.all; +} |