32 and 64-bit millicode, original author Hewlett-Packard adapted for gcc by Paul Bame email@example.com@firstname.lastname@example.org and Alan Modra email@example.com@firstname.lastname@example.org.
Copyright 2001, 2002, 2003 Free Software Foundation, Inc.
This file is part of GCC and is released under the terms of of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. See the file COPYING in the top-level GCC source directory for a copy of the license.
|remI.S||32 and 64-bit millicode, original author Hewlett-Packard adapted for gcc by Paul Bame email@example.com@firstname.lastname@example.org and Alan Modra email@example.com@firstname.lastname@example.org.|
. $$remI returns the remainder of the division of two signed 32-bit . integers. The sign of the remainder is the same as the sign of . the dividend.
. arg0 == dividend . arg1 == divisor . mrp == return pc . sr0 == return space when called externally
. arg0 = destroyed . arg1 = destroyed . ret1 = remainder
. r1 = undefined
. Causes a trap under the following conditions: DIVIDE BY ZERO . Changes memory at the following places: NONE
. Unwindable . Does not create a stack frame . Is usable for internal or external microcode
. Calls other millicode routines via mrp: NONE . Calls other millicode routines: NONE