2019-04-29 06:47:49 +08:00
|
|
|
//===-- ashrti3.c - Implement __ashrti3 -----------------------------------===//
|
|
|
|
//
|
|
|
|
// 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 __ashrti3 for the compiler_rt library.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2009-06-27 00:47:03 +08:00
|
|
|
|
|
|
|
#include "int_lib.h"
|
|
|
|
|
2014-02-22 07:53:03 +08:00
|
|
|
#ifdef CRT_HAS_128BIT
|
2012-06-23 05:09:22 +08:00
|
|
|
|
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_tword
|
2009-06-27 00:47:03 +08:00
|
|
|
|
2019-04-29 05:53:32 +08:00
|
|
|
COMPILER_RT_ABI ti_int __ashrti3(ti_int a, si_int b) {
|
|
|
|
const int bits_in_dword = (int)(sizeof(di_int) * CHAR_BIT);
|
|
|
|
twords input;
|
|
|
|
twords result;
|
|
|
|
input.all = a;
|
2019-04-29 06:47:49 +08:00
|
|
|
if (b & bits_in_dword) /* bits_in_dword <= b < bits_in_tword */ {
|
|
|
|
// 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_dword - 1);
|
|
|
|
result.s.low = input.s.high >> (b - bits_in_dword);
|
2019-04-29 06:47:49 +08:00
|
|
|
} else /* 0 <= b < bits_in_dword */ {
|
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_dword - b)) | (input.s.low >> b);
|
|
|
|
}
|
|
|
|
return result.all;
|
2009-06-27 00:47:03 +08:00
|
|
|
}
|
|
|
|
|
2019-04-29 06:47:49 +08:00
|
|
|
#endif // CRT_HAS_128BIT
|