1 /* SPDX-License-Identifier: GPL-2.0 */ !! 1 /* libgcc1 routines for 68000 w/o floating-point hardware.
2 #include <linux/linkage.h> !! 2 Copyright (C) 1994, 1996, 1997, 1998 Free Software Foundation, Inc.
3 3
4 /* !! 4 This file is part of GNU CC.
5 * Unsigned modulo operation for 32 bit intege !! 5
6 * Input : op1 in Reg r5 !! 6 GNU CC is free software; you can redistribute it and/or modify it
7 * op2 in Reg r6 !! 7 under the terms of the GNU General Public License as published by the
8 * Output: op1 mod op2 in Reg r3 !! 8 Free Software Foundation; either version 2, or (at your option) any
9 */ !! 9 later version.
>> 10
>> 11 In addition to the permissions in the GNU General Public License, the
>> 12 Free Software Foundation gives you unlimited permission to link the
>> 13 compiled version of this file with other programs, and to distribute
>> 14 those programs without any restriction coming from the use of this
>> 15 file. (The General Public License restrictions do apply in other
>> 16 respects; for example, they cover modification of the file, and
>> 17 distribution when not linked into another program.)
>> 18
>> 19 This file is distributed in the hope that it will be useful, but
>> 20 WITHOUT ANY WARRANTY; without even the implied warranty of
>> 21 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
>> 22 General Public License for more details. */
>> 23
>> 24 /* As a special exception, if you link this library with files
>> 25 compiled with GCC to produce an executable, this does not cause
>> 26 the resulting executable to be covered by the GNU General Public License.
>> 27 This exception does not however invalidate any other reasons why
>> 28 the executable file might be covered by the GNU General Public License. */
>> 29
>> 30 /* Use this one for any 680x0; assumes no floating point hardware.
>> 31 The trailing " '" appearing on some lines is for ANSI preprocessors. Yuk.
>> 32 Some of this code comes from MINIX, via the folks at ericsson.
>> 33 D. V. Henkel-Wallace (gumby@cygnus.com) Fete Bastille, 1992
>> 34 */
>> 35
>> 36 /* These are predefined by new versions of GNU cpp. */
>> 37
>> 38 #ifndef __USER_LABEL_PREFIX__
>> 39 #define __USER_LABEL_PREFIX__ _
>> 40 #endif
>> 41
>> 42 #ifndef __REGISTER_PREFIX__
>> 43 #define __REGISTER_PREFIX__
>> 44 #endif
>> 45
>> 46 #ifndef __IMMEDIATE_PREFIX__
>> 47 #define __IMMEDIATE_PREFIX__ #
>> 48 #endif
>> 49
>> 50 /* ANSI concatenation macros. */
>> 51
>> 52 #define CONCAT1(a, b) CONCAT2(a, b)
>> 53 #define CONCAT2(a, b) a ## b
>> 54
>> 55 /* Use the right prefix for global labels. */
>> 56
>> 57 #define SYM(x) CONCAT1 (__USER_LABEL_PREFIX__, x)
>> 58
>> 59 /* Use the right prefix for registers. */
>> 60
>> 61 #define REG(x) CONCAT1 (__REGISTER_PREFIX__, x)
>> 62
>> 63 /* Use the right prefix for immediate values. */
>> 64
>> 65 #define IMM(x) CONCAT1 (__IMMEDIATE_PREFIX__, x)
>> 66
>> 67 #define d0 REG (d0)
>> 68 #define d1 REG (d1)
>> 69 #define d2 REG (d2)
>> 70 #define d3 REG (d3)
>> 71 #define d4 REG (d4)
>> 72 #define d5 REG (d5)
>> 73 #define d6 REG (d6)
>> 74 #define d7 REG (d7)
>> 75 #define a0 REG (a0)
>> 76 #define a1 REG (a1)
>> 77 #define a2 REG (a2)
>> 78 #define a3 REG (a3)
>> 79 #define a4 REG (a4)
>> 80 #define a5 REG (a5)
>> 81 #define a6 REG (a6)
>> 82 #define fp REG (fp)
>> 83 #define sp REG (sp)
10 84
11 .text 85 .text
12 .globl __umodsi3 !! 86 .proc
13 .type __umodsi3, @function !! 87 .globl SYM (__umodsi3)
14 .ent __umodsi3 !! 88 SYM (__umodsi3):
15 !! 89 movel sp@(8), d1 /* d1 = divisor */
16 __umodsi3: !! 90 movel sp@(4), d0 /* d0 = dividend */
17 .frame r1, 0, r15 !! 91 movel d1, sp@-
18 !! 92 movel d0, sp@-
19 addik r1, r1, -12 !! 93 jbsr SYM (__udivsi3)
20 swi r29, r1, 0 !! 94 addql IMM (8), sp
21 swi r30, r1, 4 !! 95 movel sp@(8), d1 /* d1 = divisor */
22 swi r31, r1, 8 !! 96 #if !(defined(__mcf5200__) || defined(__mcoldfire__))
23 !! 97 movel d1, sp@-
24 beqi r6, div_by_zero /* div_by_zero !! 98 movel d0, sp@-
25 beqid r5, result_is_zero /* result i !! 99 jbsr SYM (__mulsi3) /* d0 = (a/b)*b */
26 addik r3, r0, 0 /* clear div */ !! 100 addql IMM (8), sp
27 addik r30, r0, 0 /* clear mod */ !! 101 #else
28 addik r29, r0, 32 /* initialize the !! 102 mulsl d1,d0
29 !! 103 #endif
30 /* check if r6 and r5 are equal /* if yes, ret !! 104 movel sp@(4), d1 /* d1 = dividend */
31 rsub r18, r5, r6 !! 105 subl d0, d1 /* d1 = a - (a/b)*b */
32 beqi r18, return_here !! 106 movel d1, d0
33 !! 107 rts
34 /* check if (uns)r6 is greater than (uns)r5. i <<
35 xor r18, r5, r6 <<
36 bgeid r18, 16 <<
37 addik r3, r5, 0 <<
38 blti r6, return_here <<
39 bri $lcheckr6 <<
40 rsub r18, r5, r6 /* microblazecmp * <<
41 bgti r18, return_here <<
42 <<
43 /* if r6 [bit 31] is set, then return result a <<
44 $lcheckr6: <<
45 bgtid r6, div0 <<
46 addik r3, r0, 0 <<
47 addik r18, r0, 0x7fffffff <<
48 and r5, r5, r18 <<
49 and r6, r6, r18 <<
50 brid return_here <<
51 rsub r3, r6, r5 <<
52 /* first part: try to find the first '1' in th <<
53 div0: <<
54 blti r5, div2 <<
55 div1: <<
56 add r5, r5, r5 /* left shift logic <<
57 bgeid r5, div1 <<
58 addik r29, r29, -1 <<
59 div2: <<
60 /* left shift logical r5 get the '1' i <<
61 add r5, r5, r5 <<
62 addc r3, r3, r3 /* move that bit in <<
63 rsub r31, r6, r3 /* try to subtract <<
64 blti r31, mod_too_small <<
65 /* move the r31 to mod since the resul <<
66 or r3, r0, r31 <<
67 addik r30, r30, 1 <<
68 mod_too_small: <<
69 addik r29, r29, -1 <<
70 beqi r29, loop_end <<
71 add r30, r30, r30 /* shift in the <<
72 bri div2 /* div2 */ <<
73 loop_end: <<
74 bri return_here <<
75 div_by_zero: <<
76 result_is_zero: <<
77 or r3, r0, r0 /* set result to 0 <<
78 return_here: <<
79 /* restore values of csrs and that of r3 and t <<
80 lwi r29, r1, 0 <<
81 lwi r30, r1, 4 <<
82 lwi r31, r1, 8 <<
83 rtsd r15, 8 <<
84 addik r1, r1, 12 <<
85 108
86 .size __umodsi3, . - __umodsi3 <<
87 .end __umodsi3 <<
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.