* Copyright (c) 1985 The Regents of the University of California.
* This code is derived from software contributed to Berkeley by
* %sccs.include.redist.c%
* @(#)Kdivf.s 7.1 (Berkeley) %G%
#include "../tahoe/SYS.h"
#define HIDDEN 23 # here we count from 0 not from 1 as in fp.h
ENTRY(Kdivf, R9|R8|R7|R6|R5|R4|R3|R2)
clrl r3 # r3 - sign: 0 for positive,1 for negative.
bbc $0,r3,1f # seconed operand is negative.
clrl r3 # if first was negative, make result positive.
1: movl $1,r3 # if first was positive, make result negative.
2: andl2 $EXPMASK,r0 # compute first 'pure'exponent.
andl2 $EXPMASK,r2 # compute seconed 'pure'exponent.
subl3 r2,r0,r2 # subtruct the exponents.
# normalization can make the exp. smaller.
# We have the sign in r3,the exponent in r2,now is the time to
# perform the division...
andl3 $(0!(EXPMASK | SIGNBIT)),4(fp),r0
andl3 $(0!(EXPMASK | SIGNBIT)),12(fp),r6
shll $2,r6,r6 # make the divisor bigger so we will not
# get overflow at the divission.
ediv r6,r0,r0,r7 # quo to r0, rem to r7
subl2 $6,r2 # to compensate for: normalization (-24),
# ediv (+32), shifting r6 (-2).
callf $8,_Kfnorm # we can use fnorm because we have data
# at r1 as well.(sfnorm takes care only
retz2: bbc $31,12(fp),z_div