Return to kfrexpf.s CVS log

Up to [Net/2] / Net2 / arch / tahoe / math

Annotation of Net2/arch/tahoe/math/kfrexpf.s, revision 1.1

1.1     ! root        1: /*-
        !             2:  * Copyright (c) 1985 The Regents of the University of California.
        !             3:  * All rights reserved.
        !             4:  *
        !             5:  * This code is derived from software contributed to Berkeley by
        !             6:  * Computer Consoles Inc.
        !             7:  *
        !             8:  * Redistribution and use in source and binary forms, with or without
        !             9:  * modification, are permitted provided that the following conditions
        !            10:  * are met:
        !            11:  * 1. Redistributions of source code must retain the above copyright
        !            12:  *    notice, this list of conditions and the following disclaimer.
        !            13:  * 2. Redistributions in binary form must reproduce the above copyright
        !            14:  *    notice, this list of conditions and the following disclaimer in the
        !            15:  *    documentation and/or other materials provided with the distribution.
        !            16:  * 3. All advertising materials mentioning features or use of this software
        !            17:  *    must display the following acknowledgement:
        !            18:  *     This product includes software developed by the University of
        !            19:  *     California, Berkeley and its contributors.
        !            20:  * 4. Neither the name of the University nor the names of its contributors
        !            21:  *    may be used to endorse or promote products derived from this software
        !            22:  *    without specific prior written permission.
        !            23:  *
        !            24:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
        !            25:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
        !            26:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
        !            27:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
        !            28:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
        !            29:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
        !            30:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
        !            31:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
        !            32:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
        !            33:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
        !            34:  * SUCH DAMAGE.
        !            35:  *
        !            36:  *     @(#)Kfrexpf.s   7.1 (Berkeley) 12/6/90
        !            37:  */
        !            38: 
        !            39: #include "../tahoe/SYS.h"
        !            40: 
        !            41:        .text
        !            42: ENTRY(Kfrexpf, 0)
        !            43:        subl3   $60,fp,sp
        !            44:        clrl    -60(fp)         # j=0;
        !            45:        clrl    -56(fp)         # neg=0;
        !            46:        tstl    4(fp)           # if(x<0){
        !            47:        jgeq    1f
        !            48:        lnd     4(fp)
        !            49:        std     4(fp)           # x = -x;
        !            50:        movl    $1,-56(fp)      # neg=1;}
        !            51: 1:
        !            52:        cmpd2   4(fp),one       # if (x>1){
        !            53:        jleq    1f
        !            54: 2:
        !            55:        cmpd2   4(fp),one       # while(x>1){
        !            56:        jleq    3f
        !            57:        addl2   $1,-60(fp)      # j=j+1;
        !            58:        pushl   16(fp)          # hfs   
        !            59:        ldd     two
        !            60:        pushd
        !            61:        ldd     4(fp)
        !            62:        pushd
        !            63:        callf   $24,_Kdivd
        !            64:        ldd     r0
        !            65:        std     4(fp)           # x= x/2;
        !            66:        jbr     2b
        !            67: 1:
        !            68:        cmpd2   4(fp),half      # if(x<0.5){
        !            69:        jlss    2f
        !            70:        jbr     3f
        !            71: 0:
        !            72:        subl2   $1,-60(fp)      # j = j-1;
        !            73:        pushl   16(fp)          # hfs
        !            74:        ldd     4(fp)
        !            75:        pushd
        !            76:        ldd     two
        !            77:        pushd
        !            78:        callf   $24,_Kmuld
        !            79:        ldd     r0
        !            80:        std     4(fp)           # x = 2*x;
        !            81: 2:
        !            82:        cmpd2   4(fp),half      # while (x<0.5){
        !            83:        jlss    0b
        !            84: 3:
        !            85:        movl    -60(fp),*12(fp) # *i=j;
        !            86:        tstl    -56(fp)         # if (neg)
        !            87:        jeql    1f
        !            88:        lnd     4(fp)
        !            89:        std     4(fp)
        !            90: 1:
        !            91:        ldd     4(fp)
        !            92:        cvdf
        !            93:        stf     r0
        !            94:        ret
        !            95: 
        !            96:        .data
        !            97:        .align  2
        !            98: one:   .long   0x40800000, 0x00000000 # .double 1
        !            99: two:   .long   0x41000000, 0x00000000 # .double 2
        !           100: half:  .long   0x40000000, 0x00000000 # .double .5

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.