1*7c3d14c8STreehugger Robot /* ===-- mulvsi3.c - Implement __mulvsi3 -----------------------------------=== 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 __mulvsi3 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: a * b */ 18*7c3d14c8STreehugger Robot 19*7c3d14c8STreehugger Robot /* Effects: aborts if a * b overflows */ 20*7c3d14c8STreehugger Robot 21*7c3d14c8STreehugger Robot COMPILER_RT_ABI si_int __mulvsi3(si_int a,si_int b)22*7c3d14c8STreehugger Robot__mulvsi3(si_int a, si_int b) 23*7c3d14c8STreehugger Robot { 24*7c3d14c8STreehugger Robot const int N = (int)(sizeof(si_int) * CHAR_BIT); 25*7c3d14c8STreehugger Robot const si_int MIN = (si_int)1 << (N-1); 26*7c3d14c8STreehugger Robot const si_int MAX = ~MIN; 27*7c3d14c8STreehugger Robot if (a == MIN) 28*7c3d14c8STreehugger Robot { 29*7c3d14c8STreehugger Robot if (b == 0 || b == 1) 30*7c3d14c8STreehugger Robot return a * b; 31*7c3d14c8STreehugger Robot compilerrt_abort(); 32*7c3d14c8STreehugger Robot } 33*7c3d14c8STreehugger Robot if (b == MIN) 34*7c3d14c8STreehugger Robot { 35*7c3d14c8STreehugger Robot if (a == 0 || a == 1) 36*7c3d14c8STreehugger Robot return a * b; 37*7c3d14c8STreehugger Robot compilerrt_abort(); 38*7c3d14c8STreehugger Robot } 39*7c3d14c8STreehugger Robot si_int sa = a >> (N - 1); 40*7c3d14c8STreehugger Robot si_int abs_a = (a ^ sa) - sa; 41*7c3d14c8STreehugger Robot si_int sb = b >> (N - 1); 42*7c3d14c8STreehugger Robot si_int abs_b = (b ^ sb) - sb; 43*7c3d14c8STreehugger Robot if (abs_a < 2 || abs_b < 2) 44*7c3d14c8STreehugger Robot return a * b; 45*7c3d14c8STreehugger Robot if (sa == sb) 46*7c3d14c8STreehugger Robot { 47*7c3d14c8STreehugger Robot if (abs_a > MAX / abs_b) 48*7c3d14c8STreehugger Robot compilerrt_abort(); 49*7c3d14c8STreehugger Robot } 50*7c3d14c8STreehugger Robot else 51*7c3d14c8STreehugger Robot { 52*7c3d14c8STreehugger Robot if (abs_a > MIN / -abs_b) 53*7c3d14c8STreehugger Robot compilerrt_abort(); 54*7c3d14c8STreehugger Robot } 55*7c3d14c8STreehugger Robot return a * b; 56*7c3d14c8STreehugger Robot } 57