; 68020 version of qfltb.c ; Uses 32*32=64 bit multiply and divide instructions. ; Copyright 1989 by Stephen L. Moshier ; Set NQ = size of number in words. ; Also adjust rndbit[] array to have a 1 bit in the rounding ; position (see at end of the file). equ 24 0 8 (A6),A54 ,A52 ,D70 ,CCR0 8 (A6),A52 ,A52 ,D7 ; do NQ-1 words 0 ,CCR0 8 (A6),A51 ,A51 ,A44 ,D7 ; (NQ-1) * 2 - 1 - 1 0 ,-(A4)0 8 (A6),A54 ,A51 ,A44 ,D7 ; (NQ-1) * 2 - 1 - 1 0 ,(A5)0 8 (A6),A52 ,A43 ,D7 ; do NQ-2 words 0 ,-(A4)0 8 (A6),A54 ,A52 ,A43 ,D7 ; do NQ-2 words 0 ,(A5)0 8 (A6),A42 ,A4 ; 2 * (2 + (NQ-1)) 12 (A6),A52 ,A52 ,D70 ,CCR0 8 (A6),A42 ,A4 ; 2 * (2 + (NQ-1)) 12 (A6),A52 ,A52 ,D70 ,CCR; Variable precision multiply of significands. ; c must not be in the same location as either a or b. ; ; static int mulv( a, b, c, prec ) ; unsigned short a[], b[], c[]; ; int prec; 0 8 (A6),A412 (A6),A516 (A6),A320 (A6),D6 ; precision, in words ; clear the output array of prec+3 words 2 ,D7; MOVE.L A3,A0 ; ADDQ #4,A0 LEA 4 (A3),A0; for( k=prec+1; k>=3; k -= 2 ) ; prec 1 ,D76 ,A3 ; r = &c[prec+3]; 2 ,D7 ; D7 = 2*k, k = prec+1 ; { ; q = &b[3]; 6 ,A1; p = &a[k]; ; for( i=k; i>=3; i-- ) ; { ; 2*k ; if( (*p == 0) || (*q == 0) ) ; { ; --p; ; ++q; ; continue; ; } 4 ,A0; *p-- DATA .W $4 C11, $0403 ;MULU.L (A1),D3:D0 4 ,A1ADD .L D0,D64 ,D56 ,D54 ,A34 ,D76 ,D7; Variable precision square. ; b must be in a different location from a. ; ; static squarev( a, b, prec ) ; unsigned short a[], b[]; ; int prec; ; { 0 8 (A6),A4 ; a 12 (A6),A3 ; b 16 (A6),D6 ; precision, in words ; clear the output array of prec+3 words ; prec 2 ,D7; b 4 ,A0; r = &b[prec+3]; ; for( k=prec+1; k>=3; k-- ) ; { ; prec 1 ,D76 ,A3 ; r = &b[prec+3]; 2 ,D7 ; k = prec + 1 ; q = &a[3]; 6 ,A1; p = &a[k]; ;while( p >= q ) ; { ; if( (*p == 0) || (*q == 0) ) ; { ; --p; ; ++q; ; continue; ; } DATA .W $4 C11, $0403 ;MULU.L (A1),D3:D0 1 ,D0 ; 2ab term of square 1 ,D31 ,D1ADD .W D1,-6 (A3)4 ,A04 ,A1; SUBQ #4,A3 ; accumulate in *r ADD .L D0,(A3)4 ,A3; } ; --r; ; } 4 ,A34 ,D76 ,D7; shup1(b); 12 (A6),-(A7)4 ,A7; mulm( b, ac3 ) ; unsigned short b[], ac3[]; ; { 0 8 (A6),A4 ; b 12 (A6),A2 ; ac3 6 ,A7; act ; qclear( act ); 2 ,D0;act[0] = ac3[0]; ;act[1] = ac3[1]; ; ac3 ; act ;r = &act[NQ+1]; 2 ,A3;for( k=NQ-1; k>=3; k -= 2 ) ;{ 1 ,D7 ; k CMP .B #3 ,D7;if( k == NQ-1 ) ; { ;; CMP.B #NQ-1,D7 ;; BNE.S mm3al ; m = NQ-3; ; o = 5; ;; MOVE.L #NQ-3,D6 ; m ;; MOVE.L #5,D5 ; o ;; BRA.S mm3bl ; } ;else ; { ; m = k; ; o = 3; ; m 3 ,D5; } ; p = &b[m]; 1 ,D6 ; m ; p ; q = &ac3[o]; 1 ,D5 ; o ; q SUB .W D5,D62 ,D6; for( i=m; i>=o; i-- ) ; { 4 ,A0DATA .W $4 C11, $0403 ;MULU.L (A1),D3:D0 ADD .L D0,D54 ,A1; } ;--r; 4 ,A32 ,D7;} ;mdnorm( act ); 4 ,A7;qmov( act, ac3 ); ; act ; ac3 1 ,D0;} 6 ,A7;mulin( b, ac3 ) ;unsigned short b[], ac3[]; ;{ 0 8 (A6),A4 ; b 12 (A6),A2 ; ac3 4 ,A7; act ; qclear( act ); 1 ,D0;act[0] = ac3[0]; ;act[1] = ac3[1]; ; ac3 ; act ;r = &act[NQ]; ;y = b[3]; 6 (A4),D6;p = &ac3[NQ-1]; 2 ,A1;for( i=NQ-1; i>=3; i-- ) ; { 1 ,D7CMP .B #2 ,D7; if( *p == 0 ) ; { ; --p; ; --r; ; continue; ; } 2 ,A12 ,A3ADD .L D0,(A3); ADDQ #2,A3 ; } 1 ,D7;mdnorm( act ); 4 ,SP;qmov( act, ac3 ); ; act ; ac3 1 ,D0;} 4 ,A7;divsh( a, prod ) 0 8 (A6),A4 ; a 12 (A6),A5 ; prod ;prod[NQ] = 0; ;prod[NQ+1] = 0; 2 (A5);prod[NQ+2] = 0; 4 (A5);shdn1( prod ); 4 ,A7;shdn1( prod ); 4 ,A7;d = a[3]; 65536 ,D5 ; 0xffff0000 6 (A4),D6AND .L D5,D6;u = ((unsigned long )prod[3] << 16) | prod[4]; 6 ,A0 ; &prod[3] ;for( i=3; i<NQ; i++ ) ; { 3 ,D7CMP .B #NQ,D7; qu = u / d; DATA .W $4 C46, $1400 ; DIVU.L D6,D0:D1 ; prod[i] = qu; ; u = ((u - (unsigned long )d * qu) << 16) | prod[i+2]; ; } 2 ,D7; prod[NQ] = u / d; ; DIVU.W D6,D0 ; MOVE.W D0,(A1)+ ; move a to b ; ; short a[NQ], b[NQ]; ; qmov( a, b ); 0 8 (A6),A012 (A6),A12 -1 ,D0 ; 2*(11+1) = NQ words ;qmovz( a, b ) ; Same as qmov but clears 1 low guard word at 25th array position 0 8 (A6),A012 (A6),A12 -1 ,D0 ; 2*(11+1) = NQ words 0 0 ,D18 (A6),A02 -1 ,D0 ; 2*(11+1) = NQ words equ -NQ-NQ-6 ; -54 equ -4 *NQ-12 ; -108 equ -6 *NQ-18 ; -162 ; divm( a, b ) ; unsigned short a[], b[]; 188 8 (A6),A312 (A6),A5LEA prod(A6),A4LEA 8 (A3),A2 ; &a[4] 5 ,D5; prod ; b 8 ,A7; prod ; a 8 ,A7LEA quot(A6),A02 ,D04 ,A74 ,A70 ,D06 (A3),D0 ; a[3] 1073741824 ,D16 (A6) ; quot[3] 2 ,D7 ; prec 1 ,D6 ; k 2 ,D0CMP .L D7,D01 ,D02 ,D0CMP .L D6,D02 ,D7 ; prec = NQ - 2 12 ,A716 ,A78 ,A74 ,A72 ,-(A7)16 ,A72 (A5),2 (A4)8 ,A70 8 (A6),A4; LEA rndset,A3 ; MOVE.W (A3),D0 ; EXT.L D0 ; BNE.S mdn38l ; PEA rndbit ; MOVE.L (A7),A2 ; JSR qclear ; ADDQ.W #4,A7 ; MOVEQ #1,D0 ; MOVE.W D0,NQ+NQ-2(A2) ; CLR.W NQ+NQ(A2) ; MOVE.W D0,(A3) ;rndset ;mdn38l LEA 2 (A4),A50 ,D04 (A4),D04 ,A71 ,(A5); MOVE.W (A5),D0 ; EXT.L D0 ; BGE.S mdn60l ; MOVE.W #32767,(A5) 1 ,D73 ,D0CMP .L D7,D00 ,D06 (A4),D0AND .L #32768 ,D04 ,A71 ,(A5)1 ,D73 ,D0CMP .L D7,D00 ,D0AND .L #32768 ,D08 ,A74 (A4)4 ,A71 ,(A5); MOVE.W (A5),D0 ; EXT.L D0 ; BGE.S mdnd2l ; MOVE.W #32767,(A5) 0 ; for 24 word format DATA .W 0 ,0 ,0 ,0 ,0 ,0 ,0 ,0 DATA .W 0 ,0 ,0 ,0 ,0 ,0 ,0 ,0 DATA .W 0 ,0 ,0 ,0 ,0 ,0 ,0 ,1 ,0 ; for 12 word format ;rndbit DATA.W 0,0,0,0,0,0,0,0 ; DATA.W 0,0,0,1,0 ;rndset DATA.W 0 END
Messung V0.5 in Prozent C=71 H=100 G=86
¤ Dauer der Verarbeitung: 0.11 Sekunden
(vorverarbeitet am 2026-06-27)
¤ *© Formatika GbR, Deutschland
