1 /* $NetBSD: divsi3.S,v 1.4 2003/04/05 23:27:15 bjh21 Exp $ */
4 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
5 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
6 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
7 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
8 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
9 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
10 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
11 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
12 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
13 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
17 #include <machine/asm.h>
18 __FBSDID("$FreeBSD$");
21 * stack is aligned as there's a possibility of branching to L_overflow
22 * which makes a C call
27 sub sp, sp, #4 /* align stack */
29 add sp, sp, #4 /* unalign stack */
36 sub sp, sp, #4 /* align stack */
38 add sp, sp, #4 /* unalign stack */
43 #if !defined(_KERNEL) && !defined(_STANDALONE)
44 mov r0, #8 /* SIGFPE */
45 bl PIC_SYM(_C_LABEL(raise), PLT) /* raise it */
48 /* XXX should cause a fatal error */
56 EENTRY_NP(__aeabi_uidiv)
57 EENTRY_NP(__aeabi_uidivmod)
59 .L_udivide: /* r0 = r0 / r1; r1 = r0 % r1 */
63 /* r0 = r1 / r0; r1 = r1 % r0 */
70 orr ip, ip, #0x20000000 /* ip bit 0x20000000 = -ve r1 */
72 orrcs ip, ip, #0x10000000 /* ip bit 0x10000000 = bit 0 of r1 */
75 .L_divide_l0: /* r0 == 1 */
81 EEND(__aeabi_uidivmod)
87 EENTRY_NP(__aeabi_idiv)
88 EENTRY_NP(__aeabi_idivmod)
90 .L_divide: /* r0 = r0 / r1; r1 = r0 % r1 */
94 /* r0 = r1 / r0; r1 = r1 % r0 */
98 ands ip, r0, #0x80000000
100 ands r2, r1, #0x80000000
103 orr ip, r2, ip, lsr #1 /* ip bit 0x40000000 = -ve division */
104 /* ip bit 0x80000000 = -ve remainder */
111 * If the highest bit of the dividend is set, we have to be
112 * careful when shifting the divisor. Test this.
118 * At this point, the highest bit of r1 is known to be set.
119 * We abuse this below in the tst instructions.
121 tst r1, r0 /*, lsl #0 */
185 * tst r1, r0, lsl #31
255 subhs r1, r1,r0, lsl #31
256 addhs r3, r3,r2, lsl #31
259 subhs r1, r1,r0, lsl #30
260 addhs r3, r3,r2, lsl #30
263 subhs r1, r1,r0, lsl #29
264 addhs r3, r3,r2, lsl #29
267 subhs r1, r1,r0, lsl #28
268 addhs r3, r3,r2, lsl #28
271 subhs r1, r1,r0, lsl #27
272 addhs r3, r3,r2, lsl #27
275 subhs r1, r1,r0, lsl #26
276 addhs r3, r3,r2, lsl #26
279 subhs r1, r1,r0, lsl #25
280 addhs r3, r3,r2, lsl #25
283 subhs r1, r1,r0, lsl #24
284 addhs r3, r3,r2, lsl #24
287 subhs r1, r1,r0, lsl #23
288 addhs r3, r3,r2, lsl #23
291 subhs r1, r1,r0, lsl #22
292 addhs r3, r3,r2, lsl #22
295 subhs r1, r1,r0, lsl #21
296 addhs r3, r3,r2, lsl #21
299 subhs r1, r1,r0, lsl #20
300 addhs r3, r3,r2, lsl #20
303 subhs r1, r1,r0, lsl #19
304 addhs r3, r3,r2, lsl #19
307 subhs r1, r1,r0, lsl #18
308 addhs r3, r3,r2, lsl #18
311 subhs r1, r1,r0, lsl #17
312 addhs r3, r3,r2, lsl #17
315 subhs r1, r1,r0, lsl #16
316 addhs r3, r3,r2, lsl #16
319 subhs r1, r1,r0, lsl #15
320 addhs r3, r3,r2, lsl #15
323 subhs r1, r1,r0, lsl #14
324 addhs r3, r3,r2, lsl #14
327 subhs r1, r1,r0, lsl #13
328 addhs r3, r3,r2, lsl #13
331 subhs r1, r1,r0, lsl #12
332 addhs r3, r3,r2, lsl #12
335 subhs r1, r1,r0, lsl #11
336 addhs r3, r3,r2, lsl #11
339 subhs r1, r1,r0, lsl #10
340 addhs r3, r3,r2, lsl #10
343 subhs r1, r1,r0, lsl #9
344 addhs r3, r3,r2, lsl #9
347 subhs r1, r1,r0, lsl #8
348 addhs r3, r3,r2, lsl #8
351 subhs r1, r1,r0, lsl #7
352 addhs r3, r3,r2, lsl #7
355 subhs r1, r1,r0, lsl #6
356 addhs r3, r3,r2, lsl #6
359 subhs r1, r1,r0, lsl #5
360 addhs r3, r3,r2, lsl #5
363 subhs r1, r1,r0, lsl #4
364 addhs r3, r3,r2, lsl #4
367 subhs r1, r1,r0, lsl #3
368 addhs r3, r3,r2, lsl #3
371 subhs r1, r1,r0, lsl #2
372 addhs r3, r3,r2, lsl #2
375 subhs r1, r1,r0, lsl #1
376 addhs r3, r3,r2, lsl #1
389 bicmi r0, r0, #0x80000000 /* Fix incase we divided 0x80000000 */
405 EEND(__aeabi_idivmod)