/* libgcc routines for MeP. Copyright (C) 2001-2014 Free Software Foundation, Inc. This file is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. This file is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. Under Section 7 of GPL version 3, you are granted additional permissions described in the GCC Runtime Library Exception, version 3.1, as published by the Free Software Foundation. You should have received a copy of the GNU General Public License and a copy of the GCC Runtime Library Exception along with this program; see the files COPYING3 and COPYING.RUNTIME respectively. If not, see . */ typedef int SItype __attribute__ ((mode (SI))); typedef unsigned int USItype __attribute__ ((mode (SI))); typedef int word_type __attribute__ ((mode (__word__))); USItype __mulsi3 (USItype a, USItype b) { USItype c = 0; while (a != 0) { if (a & 1) c += b; a >>= 1; b <<= 1; } return c; } USItype udivmodsi4(USItype num, USItype den, word_type modwanted) { USItype bit = 1; USItype res = 0; while (den < num && bit && !(den & (1L<<31))) { den <<=1; bit <<=1; } while (bit) { if (num >= den) { num -= den; res |= bit; } bit >>=1; den >>=1; } if (modwanted) return num; return res; } SItype __divsi3 (SItype a, SItype b) { word_type neg = 0; SItype res; if (a < 0) { a = -a; neg = !neg; } if (b < 0) { b = -b; neg = !neg; } res = udivmodsi4 (a, b, 0); if (neg) res = -res; return res; } SItype __modsi3 (SItype a, SItype b) { word_type neg = 0; SItype res; if (a < 0) { a = -a; neg = 1; } if (b < 0) b = -b; res = udivmodsi4 (a, b, 1); if (neg) res = -res; return res; } SItype __udivsi3 (SItype a, SItype b) { return udivmodsi4 (a, b, 0); } SItype __umodsi3 (SItype a, SItype b) { return udivmodsi4 (a, b, 1); }