/* Kmulf.s 1.4 90/12/04 */
#include "../tahoe/SYS.h"
#define HIDDEN 23 /* here we count from 0 not from 1 as in fp.h */
* _Kmulf(acc_most,acc_least,op_most,op_least,hfs)
ENTRY(Kmulf, 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. */
addl2 r0,r2 /* add the exponents. */
cmpl r2,$258 /* normalization can make the exp. smaller. */
* We have the sign in r3,the exponent in r2,now is the time to
* perform the multiplication...
/* fetch first fraction: (r0) */
andl3 $(0!(EXPMASK | SIGNBIT)),4(fp),r0
shll $7,r0,r0 /* leave the sign bit cleared. */
/* fetch seconed fraction: (r4) */
andl3 $(0!(EXPMASK | SIGNBIT)),12(fp),r4
shll $7,r4,r4 /* leave the sign bit cleared. */
movl r0,r4 /* to see how much we realy need to shift. */
movl $6,r5 /* r5 - shift counter. */
shrl $7,r4,r4 /* dummy shift. */
1: bbs $HIDDEN,r4,realshift
decl r2 /* update exponent. */
decl r5 /* update shift counter. */