blob: eb4698ac517cdc493792ea457a61716f1fb53785 [file] [log] [blame]
Edward O'Callaghan37a6a452009-08-07 20:30:09 +00001/* ====-- ashldi3.c - Implement __ashldi3 -----------------------------------===
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'Callaghan37a6a452009-08-07 20:30:09 +00007 *
8 * ===----------------------------------------------------------------------===
9 *
10 * This file implements __ashldi3 for the compiler_rt library.
11 *
12 * ===----------------------------------------------------------------------===
13 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000014
15#include "int_lib.h"
16
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000017/* Returns: a << b */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000018
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000019/* Precondition: 0 <= b < bits_in_dword */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000020
Chandler Carruth0193b742012-06-22 21:09:15 +000021ARM_EABI_FNALIAS(llsl, ashldi3)
Anton Korobeynikov37b97d12011-04-19 17:51:24 +000022
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000023COMPILER_RT_ABI di_int
Daniel Dunbarb3a69012009-06-26 16:47:03 +000024__ashldi3(di_int a, si_int b)
25{
26 const int bits_in_word = (int)(sizeof(si_int) * CHAR_BIT);
27 dwords input;
28 dwords result;
29 input.all = a;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000030 if (b & bits_in_word) /* bits_in_word <= b < bits_in_dword */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000031 {
Edward O'Callaghan8bf1e092009-08-09 18:41:02 +000032 result.s.low = 0;
33 result.s.high = input.s.low << (b - bits_in_word);
Daniel Dunbarb3a69012009-06-26 16:47:03 +000034 }
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000035 else /* 0 <= b < bits_in_word */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000036 {
37 if (b == 0)
38 return a;
Edward O'Callaghan8bf1e092009-08-09 18:41:02 +000039 result.s.low = input.s.low << b;
40 result.s.high = (input.s.high << b) | (input.s.low >> (bits_in_word - b));
Daniel Dunbarb3a69012009-06-26 16:47:03 +000041 }
42 return result.all;
43}