mirror of
https://github.com/corda/corda.git
synced 2025-01-01 02:36:44 +00:00
f978eab8d1
git-subtree-dir: sgx-jvm/linux-sgx git-subtree-mainline:d52accb52cgit-subtree-split:2df43c54f3
45 lines
1.3 KiB
C
45 lines
1.3 KiB
C
/*===-- 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;
|
|
}
|