2019-04-29 06:47:49 +08:00
|
|
|
//===-- ashrdi3.c - Implement __ashrdi3 -----------------------------------===//
|
|
|
|
//
|
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements __ashrdi3 for the compiler_rt library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2009-06-27 00:47:03 +08:00
|
|
|
|
|
|
|
#include "int_lib.h"
|
|
|
|
|
2019-04-29 06:47:49 +08:00
|
|
|
// Returns: arithmetic a >> b
|
2009-06-27 00:47:03 +08:00
|
|
|
|
2019-04-29 06:47:49 +08:00
|
|
|
// Precondition: 0 <= b < bits_in_dword
|
2009-06-27 00:47:03 +08:00
|
|
|
|
2019-04-29 05:53:32 +08:00
|
|
|
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;
|
2019-04-29 06:47:49 +08:00
|
|
|
if (b & bits_in_word) /* bits_in_word <= b < bits_in_dword */ {
|
|
|
|
// result.s.high = input.s.high < 0 ? -1 : 0
|
2019-04-29 05:53:32 +08:00
|
|
|
result.s.high = input.s.high >> (bits_in_word - 1);
|
|
|
|
result.s.low = input.s.high >> (b - bits_in_word);
|
2019-04-29 06:47:49 +08:00
|
|
|
} else /* 0 <= b < bits_in_word */ {
|
2019-04-29 05:53:32 +08:00
|
|
|
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;
|
2009-06-27 00:47:03 +08:00
|
|
|
}
|
2017-05-17 00:41:37 +08:00
|
|
|
|
|
|
|
#if defined(__ARM_EABI__)
|
2019-04-29 08:46:23 +08:00
|
|
|
COMPILER_RT_ALIAS(__ashrdi3, __aeabi_lasr)
|
2017-05-17 00:41:37 +08:00
|
|
|
#endif
|