1*7c3d14c8STreehugger Robot /*===-- ashrdi3.c - Implement __ashrdi3 -----------------------------------=== 2*7c3d14c8STreehugger Robot * 3*7c3d14c8STreehugger Robot * The LLVM Compiler Infrastructure 4*7c3d14c8STreehugger Robot * 5*7c3d14c8STreehugger Robot * This file is dual licensed under the MIT and the University of Illinois Open 6*7c3d14c8STreehugger Robot * Source Licenses. See LICENSE.TXT for details. 7*7c3d14c8STreehugger Robot * 8*7c3d14c8STreehugger Robot * ===----------------------------------------------------------------------=== 9*7c3d14c8STreehugger Robot * 10*7c3d14c8STreehugger Robot * This file implements __ashrdi3 for the compiler_rt library. 11*7c3d14c8STreehugger Robot * 12*7c3d14c8STreehugger Robot * ===----------------------------------------------------------------------=== 13*7c3d14c8STreehugger Robot */ 14*7c3d14c8STreehugger Robot 15*7c3d14c8STreehugger Robot #include "int_lib.h" 16*7c3d14c8STreehugger Robot 17*7c3d14c8STreehugger Robot /* Returns: arithmetic a >> b */ 18*7c3d14c8STreehugger Robot 19*7c3d14c8STreehugger Robot /* Precondition: 0 <= b < bits_in_dword */ 20*7c3d14c8STreehugger Robot ARM_EABI_FNALIAS(lasr,ashrdi3)21*7c3d14c8STreehugger RobotARM_EABI_FNALIAS(lasr, ashrdi3) 22*7c3d14c8STreehugger Robot 23*7c3d14c8STreehugger Robot COMPILER_RT_ABI di_int 24*7c3d14c8STreehugger Robot __ashrdi3(di_int a, si_int b) 25*7c3d14c8STreehugger Robot { 26*7c3d14c8STreehugger Robot const int bits_in_word = (int)(sizeof(si_int) * CHAR_BIT); 27*7c3d14c8STreehugger Robot dwords input; 28*7c3d14c8STreehugger Robot dwords result; 29*7c3d14c8STreehugger Robot input.all = a; 30*7c3d14c8STreehugger Robot if (b & bits_in_word) /* bits_in_word <= b < bits_in_dword */ 31*7c3d14c8STreehugger Robot { 32*7c3d14c8STreehugger Robot /* result.s.high = input.s.high < 0 ? -1 : 0 */ 33*7c3d14c8STreehugger Robot result.s.high = input.s.high >> (bits_in_word - 1); 34*7c3d14c8STreehugger Robot result.s.low = input.s.high >> (b - bits_in_word); 35*7c3d14c8STreehugger Robot } 36*7c3d14c8STreehugger Robot else /* 0 <= b < bits_in_word */ 37*7c3d14c8STreehugger Robot { 38*7c3d14c8STreehugger Robot if (b == 0) 39*7c3d14c8STreehugger Robot return a; 40*7c3d14c8STreehugger Robot result.s.high = input.s.high >> b; 41*7c3d14c8STreehugger Robot result.s.low = (input.s.high << (bits_in_word - b)) | (input.s.low >> b); 42*7c3d14c8STreehugger Robot } 43*7c3d14c8STreehugger Robot return result.all; 44*7c3d14c8STreehugger Robot } 45