1 1.11 uwe /* $NetBSD: udivsi3.S,v 1.11 2011/08/05 01:59:39 uwe Exp $ */ 2 1.1 itojun 3 1.1 itojun /*- 4 1.1 itojun * Copyright (c) 1990 The Regents of the University of California. 5 1.1 itojun * All rights reserved. 6 1.1 itojun * 7 1.1 itojun * This code is derived from software contributed to Berkeley by 8 1.1 itojun * William Jolitz. 9 1.1 itojun * 10 1.1 itojun * Redistribution and use in source and binary forms, with or without 11 1.1 itojun * modification, are permitted provided that the following conditions 12 1.1 itojun * are met: 13 1.1 itojun * 1. Redistributions of source code must retain the above copyright 14 1.1 itojun * notice, this list of conditions and the following disclaimer. 15 1.1 itojun * 2. Redistributions in binary form must reproduce the above copyright 16 1.1 itojun * notice, this list of conditions and the following disclaimer in the 17 1.1 itojun * documentation and/or other materials provided with the distribution. 18 1.3 agc * 3. Neither the name of the University nor the names of its contributors 19 1.1 itojun * may be used to endorse or promote products derived from this software 20 1.1 itojun * without specific prior written permission. 21 1.1 itojun * 22 1.1 itojun * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 1.1 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 1.1 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 1.1 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 1.1 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 1.1 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 1.1 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 1.1 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 1.1 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 1.1 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 1.1 itojun * SUCH DAMAGE. 33 1.1 itojun * 34 1.1 itojun * from: @(#)udivsi3.s 5.1 (Berkeley) 5/15/90 35 1.1 itojun */ 36 1.1 itojun 37 1.1 itojun #include <machine/asm.h> 38 1.1 itojun #if defined(LIBC_SCCS) 39 1.11 uwe RCSID("$NetBSD: udivsi3.S,v 1.11 2011/08/05 01:59:39 uwe Exp $") 40 1.6 uwe #endif 41 1.6 uwe 42 1.6 uwe /* 43 1.6 uwe * IMPOTANT: This function is special. 44 1.6 uwe * 45 1.11 uwe * This function is an auxiliary "millicode" function that is 46 1.11 uwe * referenced by the code generated by gcc for unsigned integer 47 1.11 uwe * division. But gcc does NOT treat a call to this function as an 48 1.11 uwe * ordinary function call - it can clobber only R4. 49 1.6 uwe * 50 1.11 uwe * See the definition of "udivsi3_i1" in gcc/config/sh/sh.md 51 1.11 uwe * 52 1.11 uwe * As the consequence this function cannot be called via any 53 1.11 uwe * indirection that assumes normal calling convention: 54 1.11 uwe * 55 1.11 uwe * . cannot have _PROF_PROLOGUE 56 1.11 uwe * . cannot be called via PLT (not relevant for kernel) 57 1.6 uwe */ 58 1.6 uwe 59 1.1 itojun 60 1.8 uwe #ifdef __ELF__ 61 1.8 uwe .hidden __udivsi3 62 1.8 uwe #endif 63 1.8 uwe 64 1.8 uwe 65 1.1 itojun /* r0 <= r4 / r5 */ 66 1.6 uwe NENTRY(__udivsi3) 67 1.1 itojun tst r5, r5 68 1.11 uwe bt .L_div_by_zero 69 1.1 itojun 70 1.1 itojun mov #0, r0 71 1.1 itojun div0u 72 1.1 itojun #define DIVSTEP rotcl r4; div1 r5, r0 73 1.1 itojun /* repeat 32 times */ 74 1.1 itojun DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; 75 1.1 itojun DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; 76 1.1 itojun DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; 77 1.1 itojun DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; DIVSTEP; 78 1.1 itojun #undef DIVSTEP 79 1.1 itojun rotcl r4 80 1.1 itojun 81 1.1 itojun rts 82 1.6 uwe mov r4, r0 83 1.1 itojun 84 1.11 uwe .L_div_by_zero: 85 1.1 itojun rts 86 1.6 uwe mov #0, r0 87
Indexes created Tue Sep 30 11:09:46 GMT 2025