blob: 911edb19142276446bd156f4e8675c30f12513f4 [file] [log] [blame]
Edward O'Callaghan2bf62722009-08-05 04:02:56 +00001/* ===-- lshrdi3.c - Implement __lshrdi3 -----------------------------------===
2 *
3 * The LLVM Compiler Infrastructure
4 *
Howard Hinnant9ad441f2010-11-16 22:13:33 +00005 * This file is dual licensed under the MIT and the University of Illinois Open
6 * Source Licenses. See LICENSE.TXT for details.
Edward O'Callaghan2bf62722009-08-05 04:02:56 +00007 *
8 * ===----------------------------------------------------------------------===
9 *
10 * This file implements __lshrdi3 for the compiler_rt library.
11 *
12 * ===----------------------------------------------------------------------===
13 */
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000014#include "abi.h"
Daniel Dunbarb3a69012009-06-26 16:47:03 +000015
16#include "int_lib.h"
17
Edward O'Callaghan2bf62722009-08-05 04:02:56 +000018/* Returns: logical a >> b */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000019
Edward O'Callaghan2bf62722009-08-05 04:02:56 +000020/* Precondition: 0 <= b < bits_in_dword */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000021
Anton Korobeynikov37b97d12011-04-19 17:51:24 +000022ARM_EABI_FNALIAS(llsr, lshrdi3);
23
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000024COMPILER_RT_ABI di_int
Daniel Dunbarb3a69012009-06-26 16:47:03 +000025__lshrdi3(di_int a, si_int b)
26{
27 const int bits_in_word = (int)(sizeof(si_int) * CHAR_BIT);
28 udwords input;
29 udwords result;
30 input.all = a;
Edward O'Callaghan2bf62722009-08-05 04:02:56 +000031 if (b & bits_in_word) /* bits_in_word <= b < bits_in_dword */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000032 {
Edward O'Callaghan8bf1e092009-08-09 18:41:02 +000033 result.s.high = 0;
34 result.s.low = input.s.high >> (b - bits_in_word);
Daniel Dunbarb3a69012009-06-26 16:47:03 +000035 }
Edward O'Callaghan2bf62722009-08-05 04:02:56 +000036 else /* 0 <= b < bits_in_word */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000037 {
38 if (b == 0)
39 return a;
Edward O'Callaghan8bf1e092009-08-09 18:41:02 +000040 result.s.high = input.s.high >> b;
41 result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b);
Daniel Dunbarb3a69012009-06-26 16:47:03 +000042 }
43 return result.all;
44}