Home | History | Annotate | Line # | Download | only in gen
ldexp.S revision 1.6.52.1
      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.6     agc  * 3. Neither the name of the University nor the names of its contributors
     14       1.1   ragge  *    may be used to endorse or promote products derived from this software
     15       1.1   ragge  *    without specific prior written permission.
     16       1.1   ragge  *
     17       1.1   ragge  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     18       1.1   ragge  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     19       1.1   ragge  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     20       1.1   ragge  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     21       1.1   ragge  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     22       1.1   ragge  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     23       1.1   ragge  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     24       1.1   ragge  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     25       1.1   ragge  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     26       1.1   ragge  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     27       1.1   ragge  * SUCH DAMAGE.
     28       1.1   ragge  */
     29       1.1   ragge 
     30       1.1   ragge /*
     31       1.1   ragge  * double ldexp (value, exp)
     32       1.1   ragge  * double value;
     33       1.1   ragge  * int exp;
     34       1.1   ragge  *
     35       1.1   ragge  * Ldexp returns value*2**exp, if that result is in range.
     36       1.1   ragge  * If underflow occurs, it returns zero.  If overflow occurs,
     37       1.1   ragge  * it returns a value of appropriate sign and largest
     38       1.1   ragge  * possible magnitude.  In case of either overflow or underflow,
     39       1.1   ragge  * errno is set to ERANGE.  Note that errno is not modified if
     40       1.1   ragge  * no error occurs.
     41       1.1   ragge  */
     42       1.1   ragge 
     43       1.1   ragge #include "DEFS.h"
     44  1.6.52.1  bouyer #include "assym.h"
     45       1.1   ragge 
     46  1.6.52.1  bouyer #if defined(LIBC_SCCS) && !defined(lint)
     47  1.6.52.1  bouyer 	/*.asciz "@(#)ldexp.s	8.1 (Berkeley) 6/4/93" */
     48  1.6.52.1  bouyer RCSID("$NetBSD: ldexp.S,v 1.6.52.1 2011/02/08 16:18:57 bouyer Exp $")
     49  1.6.52.1  bouyer #endif /* LIBC_SCCS and not lint */
     50       1.1   ragge 
     51  1.6.52.1  bouyer #ifndef _REENTRANT
     52       1.4    matt 	.globl	_C_LABEL(errno)
     53  1.6.52.1  bouyer #endif
     54       1.1   ragge 
     55       1.1   ragge ENTRY(ldexp, 0)
     56       1.5    matt 	movd	4(%ap),%r0	/* fetch "value" */
     57       1.5    matt 	extzv	$7,$8,%r0,%r2	/* %r2 := biased exponent */
     58       1.1   ragge 	jeql	1f		/* if zero, done */
     59       1.1   ragge 
     60       1.5    matt 	addl2	12(%ap),%r2	/* %r2 := new biased exponent */
     61       1.1   ragge 	jleq	2f		/* if <= 0, underflow */
     62       1.5    matt 	cmpl	%r2,$256		/* otherwise check if too big */
     63       1.1   ragge 	jgeq	3f		/* jump if overflow */
     64       1.5    matt 	insv	%r2,$7,$8,%r0	/* put exponent back in result */
     65       1.1   ragge 1:
     66       1.1   ragge 	ret
     67       1.1   ragge 2:
     68       1.5    matt 	clrd	%r0
     69       1.1   ragge 	jbr	1f
     70       1.1   ragge 3:
     71  1.6.52.1  bouyer 	/*
     72  1.6.52.1  bouyer 	 * The largest number that can be represented in a long floating
     73  1.6.52.1  bouyer 	 * number.  This is given in hex in order to avoid floating
     74  1.6.52.1  bouyer 	 * conversions
     75  1.6.52.1  bouyer 	 */
     76  1.6.52.1  bouyer 	movq	$0x7fffffffffffffff,%r0	 /* largest possible floating magnitude */
     77       1.5    matt 	jbc	$15,4(%ap),1f	/* jump if argument was positive */
     78       1.5    matt 	mnegd	%r0,%r0		/* if arg < 0, make result negative */
     79       1.1   ragge 1:
     80       1.3  kleink #ifdef _REENTRANT
     81       1.5    matt 	pushl	%r0
     82       1.4    matt 	calls	$0,_C_LABEL(__errno)
     83       1.5    matt 	movl	$ ERANGE,(%r0)
     84       1.5    matt 	movl	(%sp)+,%r0
     85       1.3  kleink #else
     86       1.4    matt 	movl	$ ERANGE,_C_LABEL(errno)
     87       1.3  kleink #endif
     88       1.1   ragge 	ret
     89  1.6.52.1  bouyer END(ldexp)
     90