Home | History | Annotate | Line # | Download | only in gen
ldexp.S revision 1.3
      1  1.1   ragge /*
      2  1.1   ragge  * Copyright (c) 1983, 1993
      3  1.1   ragge  *	The Regents of the University of California.  All rights reserved.
      4  1.1   ragge  *
      5  1.1   ragge  * Redistribution and use in source and binary forms, with or without
      6  1.1   ragge  * modification, are permitted provided that the following conditions
      7  1.1   ragge  * are met:
      8  1.1   ragge  * 1. Redistributions of source code must retain the above copyright
      9  1.1   ragge  *    notice, this list of conditions and the following disclaimer.
     10  1.1   ragge  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1   ragge  *    notice, this list of conditions and the following disclaimer in the
     12  1.1   ragge  *    documentation and/or other materials provided with the distribution.
     13  1.1   ragge  * 3. All advertising materials mentioning features or use of this software
     14  1.1   ragge  *    must display the following acknowledgement:
     15  1.1   ragge  *	This product includes software developed by the University of
     16  1.1   ragge  *	California, Berkeley and its contributors.
     17  1.1   ragge  * 4. Neither the name of the University nor the names of its contributors
     18  1.1   ragge  *    may be used to endorse or promote products derived from this software
     19  1.1   ragge  *    without specific prior written permission.
     20  1.1   ragge  *
     21  1.1   ragge  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1   ragge  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1   ragge  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1   ragge  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1   ragge  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1   ragge  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1   ragge  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1   ragge  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1   ragge  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1   ragge  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1   ragge  * SUCH DAMAGE.
     32  1.1   ragge  */
     33  1.1   ragge 
     34  1.1   ragge #if defined(LIBC_SCCS) && !defined(lint)
     35  1.1   ragge 	/*.asciz "@(#)ldexp.s	8.1 (Berkeley) 6/4/93" */
     36  1.3  kleink 	.asciz "$NetBSD: ldexp.S,v 1.3 2000/02/05 19:53:54 kleink Exp $"
     37  1.1   ragge #endif /* LIBC_SCCS and not lint */
     38  1.1   ragge 
     39  1.1   ragge /*
     40  1.1   ragge  * double ldexp (value, exp)
     41  1.1   ragge  * double value;
     42  1.1   ragge  * int exp;
     43  1.1   ragge  *
     44  1.1   ragge  * Ldexp returns value*2**exp, if that result is in range.
     45  1.1   ragge  * If underflow occurs, it returns zero.  If overflow occurs,
     46  1.1   ragge  * it returns a value of appropriate sign and largest
     47  1.1   ragge  * possible magnitude.  In case of either overflow or underflow,
     48  1.1   ragge  * errno is set to ERANGE.  Note that errno is not modified if
     49  1.1   ragge  * no error occurs.
     50  1.1   ragge  */
     51  1.1   ragge 
     52  1.1   ragge #include "DEFS.h"
     53  1.1   ragge 
     54  1.1   ragge /*
     55  1.1   ragge  * don't include errno.h, ANSI C says it defines errno.
     56  1.1   ragge  *
     57  1.1   ragge  * #include <errno.h>
     58  1.1   ragge  */
     59  1.1   ragge #define	ERANGE	34
     60  1.1   ragge 
     61  1.1   ragge 	.globl	_errno
     62  1.1   ragge 
     63  1.1   ragge ENTRY(ldexp, 0)
     64  1.1   ragge 	movd	4(ap),r0	/* fetch "value" */
     65  1.1   ragge 	extzv	$7,$8,r0,r2	/* r2 := biased exponent */
     66  1.1   ragge 	jeql	1f		/* if zero, done */
     67  1.1   ragge 
     68  1.1   ragge 	addl2	12(ap),r2	/* r2 := new biased exponent */
     69  1.1   ragge 	jleq	2f		/* if <= 0, underflow */
     70  1.1   ragge 	cmpl	r2,$256		/* otherwise check if too big */
     71  1.1   ragge 	jgeq	3f		/* jump if overflow */
     72  1.1   ragge 	insv	r2,$7,$8,r0	/* put exponent back in result */
     73  1.1   ragge 1:
     74  1.1   ragge 	ret
     75  1.1   ragge 2:
     76  1.1   ragge 	clrd	r0
     77  1.1   ragge 	jbr	1f
     78  1.1   ragge 3:
     79  1.1   ragge 	movd	huge,r0		/* largest possible floating magnitude */
     80  1.1   ragge 	jbc	$15,4(ap),1f	/* jump if argument was positive */
     81  1.1   ragge 	mnegd	r0,r0		/* if arg < 0, make result negative */
     82  1.1   ragge 1:
     83  1.3  kleink #ifdef _REENTRANT
     84  1.3  kleink 	pushl	r0
     85  1.3  kleink 	calls	$0,___errno
     86  1.3  kleink 	movl	$ ERANGE,(r0)
     87  1.3  kleink 	movl	(sp)+,r0
     88  1.3  kleink #else
     89  1.2   ragge 	movl	$ ERANGE,_errno
     90  1.3  kleink #endif
     91  1.1   ragge 	ret
     92  1.1   ragge 
     93  1.1   ragge 	.data
     94  1.1   ragge huge:	.word	0x7fff		/* the largest number that can */
     95  1.1   ragge 	.word	0xffff		/*   be represented in a long floating */
     96  1.1   ragge 	.word	0xffff		/*   number.  This is given in hex in order */
     97  1.1   ragge 	.word	0xffff		/*   to avoid floating conversions */
     98