divdi3.S revision 1.2.20.2 1 1.2.20.2 rpaulo .file "__divdi3.s"
2 1.2.20.2 rpaulo
3 1.2.20.2 rpaulo // $NetBSD: divdi3.S,v 1.2.20.2 2006/09/09 02:57:52 rpaulo Exp $
4 1.2.20.2 rpaulo
5 1.2.20.2 rpaulo //-
6 1.2.20.2 rpaulo // Copyright (c) 2000, Intel Corporation
7 1.2.20.2 rpaulo // All rights reserved.
8 1.2.20.2 rpaulo //
9 1.2.20.2 rpaulo // Contributed 2/15/2000 by Marius Cornea, John Harrison, Cristina Iordache,
10 1.2.20.2 rpaulo // Ted Kubaska, Bob Norin, and Shane Story of the Computational Software Lab,
11 1.2.20.2 rpaulo // Intel Corporation.
12 1.2.20.2 rpaulo //
13 1.2.20.2 rpaulo // WARRANTY DISCLAIMER
14 1.2.20.2 rpaulo //
15 1.2.20.2 rpaulo // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
16 1.2.20.2 rpaulo // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
17 1.2.20.2 rpaulo // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
18 1.2.20.2 rpaulo // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL INTEL OR ITS
19 1.2.20.2 rpaulo // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20 1.2.20.2 rpaulo // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21 1.2.20.2 rpaulo // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22 1.2.20.2 rpaulo // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
23 1.2.20.2 rpaulo // OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY OR TORT (INCLUDING
24 1.2.20.2 rpaulo // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 1.2.20.2 rpaulo // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 1.2.20.2 rpaulo //
27 1.2.20.2 rpaulo // Intel Corporation is the author of this code, and requests that all
28 1.2.20.2 rpaulo // problem reports or change requests be submitted to it directly at
29 1.2.20.2 rpaulo // http://developer.intel.com/opensource.
30 1.2.20.2 rpaulo //
31 1.2.20.2 rpaulo
32 1.2.20.2 rpaulo .section .text
33 1.2.20.2 rpaulo .proc __divdi3#
34 1.2.20.2 rpaulo .align 32
35 1.2.20.2 rpaulo .global __divdi3#
36 1.2.20.2 rpaulo .align 32
37 1.2.20.2 rpaulo
38 1.2.20.2 rpaulo // 64-bit signed integer divide
39 1.2.20.2 rpaulo
40 1.2.20.2 rpaulo __divdi3:
41 1.2.20.2 rpaulo
42 1.2.20.2 rpaulo { .mii
43 1.2.20.2 rpaulo alloc r31=ar.pfs,2,0,0,0
44 1.2.20.2 rpaulo nop.i 0
45 1.2.20.2 rpaulo nop.i 0;;
46 1.2.20.2 rpaulo } { .mmi
47 1.2.20.2 rpaulo
48 1.2.20.2 rpaulo // 64-BIT SIGNED INTEGER DIVIDE BEGINS HERE
49 1.2.20.2 rpaulo
50 1.2.20.2 rpaulo setf.sig f8=r32
51 1.2.20.2 rpaulo setf.sig f9=r33
52 1.2.20.2 rpaulo nop.i 0;;
53 1.2.20.2 rpaulo } { .mfb
54 1.2.20.2 rpaulo nop.m 0
55 1.2.20.2 rpaulo fcvt.xf f6=f8
56 1.2.20.2 rpaulo nop.b 0
57 1.2.20.2 rpaulo } { .mfb
58 1.2.20.2 rpaulo nop.m 0
59 1.2.20.2 rpaulo fcvt.xf f7=f9
60 1.2.20.2 rpaulo nop.b 0;;
61 1.2.20.2 rpaulo } { .mfi
62 1.2.20.2 rpaulo nop.m 0
63 1.2.20.2 rpaulo // Step (1)
64 1.2.20.2 rpaulo // y0 = 1 / b in f8
65 1.2.20.2 rpaulo frcpa.s1 f8,p6=f6,f7
66 1.2.20.2 rpaulo nop.i 0;;
67 1.2.20.2 rpaulo } { .mfi
68 1.2.20.2 rpaulo nop.m 0
69 1.2.20.2 rpaulo // Step (2)
70 1.2.20.2 rpaulo // e0 = 1 - b * y0 in f9
71 1.2.20.2 rpaulo (p6) fnma.s1 f9=f7,f8,f1
72 1.2.20.2 rpaulo nop.i 0
73 1.2.20.2 rpaulo } { .mfi
74 1.2.20.2 rpaulo nop.m 0
75 1.2.20.2 rpaulo // Step (3)
76 1.2.20.2 rpaulo // q0 = a * y0 in f10
77 1.2.20.2 rpaulo (p6) fma.s1 f10=f6,f8,f0
78 1.2.20.2 rpaulo nop.i 0;;
79 1.2.20.2 rpaulo } { .mfi
80 1.2.20.2 rpaulo nop.m 0
81 1.2.20.2 rpaulo // Step (4)
82 1.2.20.2 rpaulo // e1 = e0 * e0 in f11
83 1.2.20.2 rpaulo (p6) fma.s1 f11=f9,f9,f0
84 1.2.20.2 rpaulo nop.i 0
85 1.2.20.2 rpaulo } { .mfi
86 1.2.20.2 rpaulo nop.m 0
87 1.2.20.2 rpaulo // Step (5)
88 1.2.20.2 rpaulo // q1 = q0 + e0 * q0 in f10
89 1.2.20.2 rpaulo (p6) fma.s1 f10=f9,f10,f10
90 1.2.20.2 rpaulo nop.i 0;;
91 1.2.20.2 rpaulo } { .mfi
92 1.2.20.2 rpaulo nop.m 0
93 1.2.20.2 rpaulo // Step (6)
94 1.2.20.2 rpaulo // y1 = y0 + e0 * y0 in f8
95 1.2.20.2 rpaulo (p6) fma.s1 f8=f9,f8,f8
96 1.2.20.2 rpaulo nop.i 0;;
97 1.2.20.2 rpaulo } { .mfi
98 1.2.20.2 rpaulo nop.m 0
99 1.2.20.2 rpaulo // Step (7)
100 1.2.20.2 rpaulo // q2 = q1 + e1 * q1 in f9
101 1.2.20.2 rpaulo (p6) fma.s1 f9=f11,f10,f10
102 1.2.20.2 rpaulo nop.i 0;;
103 1.2.20.2 rpaulo } { .mfi
104 1.2.20.2 rpaulo nop.m 0
105 1.2.20.2 rpaulo // Step (8)
106 1.2.20.2 rpaulo // y2 = y1 + e1 * y1 in f8
107 1.2.20.2 rpaulo (p6) fma.s1 f8=f11,f8,f8
108 1.2.20.2 rpaulo nop.i 0;;
109 1.2.20.2 rpaulo } { .mfi
110 1.2.20.2 rpaulo nop.m 0
111 1.2.20.2 rpaulo // Step (9)
112 1.2.20.2 rpaulo // r2 = a - b * q2 in f10
113 1.2.20.2 rpaulo (p6) fnma.s1 f10=f7,f9,f6
114 1.2.20.2 rpaulo nop.i 0;;
115 1.2.20.2 rpaulo } { .mfi
116 1.2.20.2 rpaulo nop.m 0
117 1.2.20.2 rpaulo // Step (10)
118 1.2.20.2 rpaulo // q3 = q2 + r2 * y2 in f8
119 1.2.20.2 rpaulo (p6) fma.s1 f8=f10,f8,f9
120 1.2.20.2 rpaulo nop.i 0;;
121 1.2.20.2 rpaulo } { .mfb
122 1.2.20.2 rpaulo nop.m 0
123 1.2.20.2 rpaulo // Step (11)
124 1.2.20.2 rpaulo // q = trunc (q3)
125 1.2.20.2 rpaulo fcvt.fx.trunc.s1 f8=f8
126 1.2.20.2 rpaulo nop.b 0;;
127 1.2.20.2 rpaulo } { .mmi
128 1.2.20.2 rpaulo // quotient will be in r8 (if b != 0)
129 1.2.20.2 rpaulo getf.sig r8=f8
130 1.2.20.2 rpaulo nop.m 0
131 1.2.20.2 rpaulo nop.i 0;;
132 1.2.20.2 rpaulo }
133 1.2.20.2 rpaulo
134 1.2.20.2 rpaulo // 64-BIT SIGNED INTEGER DIVIDE ENDS HERE
135 1.2.20.2 rpaulo
136 1.2.20.2 rpaulo { .mmb
137 1.2.20.2 rpaulo nop.m 0
138 1.2.20.2 rpaulo nop.m 0
139 1.2.20.2 rpaulo br.ret.sptk b0;;
140 1.2.20.2 rpaulo }
141 1.2.20.2 rpaulo
142 1.2.20.2 rpaulo .endp __divdi3
143