Index: lib700/aldiv.s =================================================================== --- lib700/aldiv.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/aldiv.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,16 +1,16 @@ -* -* aldiv.s -- indirect long divide -* Version 1 -- 1989-01-24 -- D.N. Lynx Crowe -* + +| aldiv.s -- indirect long divide +| Version 1 -- 1989-01-24 -- D.N. Lynx Crowe + .text -* + .xdef aldiv .xdef _aldiv -* + .xref _ldiv -* + aldiv: _aldiv: -* + link a6,#-2 move.l 12(a6),-(a7) @@ -23,4 +23,4 @@ unlk a6 rts -* + .end Index: lib700/almul.s =================================================================== --- lib700/almul.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/almul.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,12 +1,12 @@ -* -* almul.s -- indirect long multiply -* Version 1 -- 1989-01-24 -- D.N. Lynx Crowe -* + +| almul.s -- indirect long multiply +| Version 1 -- 1989-01-24 -- D.N. Lynx Crowe + .text -* + .xdef almul -* + .xref lmul -* + almul: move.l a5,-(a7) movea.l 8(a7),a5 @@ -18,4 +18,4 @@ movea.l (a7)+,a5 rts -* + .end Index: lib700/alrem.s =================================================================== --- lib700/alrem.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/alrem.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,17 +1,17 @@ -* -* alrem.s -- indirect long modulus -* Version 1 -- 1989-01-24 -- D.N. Lynx Crowe -* + +| alrem.s -- indirect long modulus +| Version 1 -- 1989-01-24 -- D.N. Lynx Crowe + .text -* + .xdef alrem .xdef _alrem -* + .xref _ldiv .xref _ldivr -* + alrem: _alrem: -* + link a6,#-2 move.l 12(a6),-(a7) @@ -25,4 +25,4 @@ unlk a6 rts -* + .end Index: lib700/blkfill.s =================================================================== --- lib700/blkfill.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/blkfill.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,18 +1,18 @@ -* ------------------------------------------------------------------------------ -* blkfill.s -- block fill function -* Version 1 -- 1987-08-28 -- D.N. Lynx Crowe -* -* void -* blkfill(where, what, count) -* char *where; -* char what; -* short count; -* -* Fills 'count' bytes at 'where' with 'what'. -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| blkfill.s -- block fill function +| Version 1 -- 1987-08-28 -- D.N. Lynx Crowe + +| void +| blkfill(where, what, count) +| char |where; +| char what; +| short count; + +| Fills 'count' bytes at 'where' with 'what'. +| ------------------------------------------------------------------------------ .text -* + .xdef _blkfill -* + _blkfill: link a6,#0 movem.l d5-d7/a5-a5,-(a7) @@ -21,16 +21,16 @@ move.w 14(a6),d6 bra blkf2 -* + blkf1: move.b d7,(a5)+ -* + blkf2: move.w d6,d0 subq.w #1,d6 tst.w d0 bgt blkf1 -* + tst (a7)+ movem.l (a7)+,d6-d7/a5-a5 unlk a6 rts -* + .end Index: lib700/blkmove.s =================================================================== --- lib700/blkmove.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/blkmove.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,25 +1,25 @@ -* ------------------------------------------------------------------------------ -* blkmove.s -- block move function -* Version 1 -- 1987-08-28 -- D.N. Lynx Crowe -* -* void -* blkmove(to, from, n) -* char *to, *from; -* short n; -* -* Copies 'n' bytes from address 'from' to address 'to'. -* Treats overlaps of from and to areas intelligently. -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| blkmove.s -- block move function +| Version 1 -- 1987-08-28 -- D.N. Lynx Crowe + +| void +| blkmove(to, from, n) +| char |to, |from; +| short n; + +| Copies 'n' bytes from address 'from' to address 'to'. +| Treats overlaps of from and to areas intelligently. +| ------------------------------------------------------------------------------ .text -* + .xdef _blkmove -* -_blkmove: link a6,#$FFFC + +_blkmove: link a6,#-4 move.l 8(a6),d0 cmp.l 12(a6),d0 bcc blkm3 -* + bra blkm2 -* + blkm1: movea.l 8(a6),a0 movea.l 12(a6),a1 @@ -27,12 +27,12 @@ addq.l #1,8(a6) addq.l #1,12(a6) -* + blkm2: move.w 16(a6),d0 subq.w #1,16(a6) tst.w d0 bne blkm1 -* + bra blkm6 -* + blkm3: move.w 16(a6),d0 ext.l d0 @@ -40,5 +40,5 @@ add.l d0,12(a6) bra blkm5 -* + blkm4: subq.l #1,8(a6) subq.l #1,12(a6) @@ -46,12 +46,12 @@ movea.l 12(a6),a1 move.b (a1),(a0) -* + blkm5: move.w 16(a6),d0 subq.w #1,16(a6) tst.w d0 bne blkm4 -* + blkm6: unlk a6 rts -* + .end Index: lib700/finalone.s =================================================================== --- lib700/finalone.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/finalone.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,30 +1,30 @@ -* ------------------------------------------------------------------------------ -* finalone.s -- the last stuff to get loaded -* Version 4 -- 1987-06-30 -- D.N. Lynx Crowe -* -* This is so we can figure out where things got loaded. -* ------------------------------------------------------------------------------ -* +| ------------------------------------------------------------------------------ +| finalone.s -- the last stuff to get loaded +| Version 4 -- 1987-06-30 -- D.N. Lynx Crowe + +| This is so we can figure out where things got loaded. +| ------------------------------------------------------------------------------ + .text -* + .xdef FinalOne .xdef The_Fini .xdef Text_End -* -* -* This is the last piece of code in the 'text' segment. -* -FinalOne: rts * we just need the address here -* -Text_End: rts * we just need the address here -* -* ------------------------------------------------------------------------------ -* + + +| This is the last piece of code in the 'text' segment. + +FinalOne: rts | we just need the address here + +Text_End: rts | we just need the address here + +| ------------------------------------------------------------------------------ + .data .even -* -The_Fini: dc.w $FFFF * last thing in the 'data' segment -* -* ------------------------------------------------------------------------------ -* + +The_Fini: dc.w 0xFFFF | last thing in the 'data' segment + +| ------------------------------------------------------------------------------ + .end Index: lib700/jumpto.s =================================================================== --- lib700/jumpto.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/jumpto.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,63 +1,63 @@ -* ------------------------------------------------------------------------------ -* jumpto.s -- miscellaneous ROMP support functions -* Version 4 -- 1987-10-14 -- D.N. Lynx Crowe -* -* WARNING: -* -------- -* These functions, in general, assume supervisor mode and -* 'sane' arguments, so no error checking is done. -* -* halt() -* -* Brings the processor to a grinding halt. Requires external -* reset to restart things. Use only for catastrophic hard halts. -* -* jumpto(addr) -* long addr; -* -* Jumps to 'addr'. No error check is done on 'addr'. -* -* rjumpto(addr) -* long addr; -* -* Performs the 68000 'RESET' command, then jumps to 'addr'. -* No error check is made on 'addr'. -* -* sjumpto(addr, stack) -* long addr, stack; -* -* Sets a7 to 'stack', then jumps to 'addr'. -* No error check is done on 'addr'. -* -* xreset() -* -* Performs the 68000 'RESET' command. This is very dangerous, -* and should be used with extreme care regarding such -* things as interrupts, device initialization, vectors, -* and sundry other reset-related things. -* -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| jumpto.s -- miscellaneous ROMP support functions +| Version 4 -- 1987-10-14 -- D.N. Lynx Crowe + +| WARNING: +| -------- +| These functions, in general, assume supervisor mode and +| 'sane' arguments, so no error checking is done. + +| halt() + +| Brings the processor to a grinding halt. Requires external +| reset to restart things. Use only for catastrophic hard halts. + +| jumpto(addr) +| long addr; + +| Jumps to 'addr'. No error check is done on 'addr'. + +| rjumpto(addr) +| long addr; + +| Performs the 68000 'RESET' command, then jumps to 'addr'. +| No error check is made on 'addr'. + +| sjumpto(addr, stack) +| long addr, stack; + +| Sets a7 to 'stack', then jumps to 'addr'. +| No error check is done on 'addr'. + +| xreset() + +| Performs the 68000 'RESET' command. This is very dangerous, +| and should be used with extreme care regarding such +| things as interrupts, device initialization, vectors, +| and sundry other reset-related things. + +| ------------------------------------------------------------------------------ .text -* + .xdef _halt,_jumpto,_rjumpto,_sjumpto,_xreset -* + .page -* -_halt: stop #$2700 * stop dead, interrupts disabled - jmp _halt * stay stopped if stepped thru -* -_jumpto: movea.l 4(a7),a0 * get jump address - jmp (a0) * go to the jump address -* -_rjumpto: reset * reset external devices - movea.l 4(a7),a0 * get jump address - jmp (a0) * go to the jump address -* -_sjumpto: movea.l 4(a7),a0 * get jump address - movea.l 8(a7),a7 * set stack pointer - jmp (a0) * go to the jump address -* -_xreset: reset * reset external devices - rts * return to caller -* + +_halt: stop #0x2700 | stop dead, interrupts disabled + jmp _halt | stay stopped if stepped thru + +_jumpto: movea.l 4(a7),a0 | get jump address + jmp (a0) | go to the jump address + +_rjumpto: reset | reset external devices + movea.l 4(a7),a0 | get jump address + jmp (a0) | go to the jump address + +_sjumpto: movea.l 4(a7),a0 | get jump address + movea.l 8(a7),a7 | set stack pointer + jmp (a0) | go to the jump address + +_xreset: reset | reset external devices + rts | return to caller + .end Index: lib700/ldiv.s =================================================================== --- lib700/ldiv.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/ldiv.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,16 +1,16 @@ -* ------------------------------------------------------------------------------ -* ldiv.s -- long division -* Version 1 -- 1988-01-22 -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| ldiv.s -- long division +| Version 1 -- 1988-01-22 +| ------------------------------------------------------------------------------ .text -* + .xdef _ldiv .xdef ldiv -* + .xdef _ldivr -* -ARG1 .equ 8 -ARG2 .equ 12 -* + +ARG1 = 8 +ARG2 = 12 + _ldiv: ldiv: link a6,#-2 @@ -21,33 +21,33 @@ move.l ARG2(a6),d6 bne ldiv1 -* - move.l #$80000000,_ldivr - move.l #$80000000,d0 + + move.l #0x80000000,_ldivr + move.l #0x80000000,d0 divs #0,d0 bra ldiv11 -* + ldiv1: bge ldiv2 -* + neg.l d6 addq.w #1,d3 -* + ldiv2: tst.l d7 bge ldiv3 -* + neg.l d7 addq.w #1,d3 -* + ldiv3: cmp.l d7,d6 bgt ldiv9 -* + bne ldiv4 -* + moveq.l #1,d5 clr.l d7 bra ldiv9 -* -ldiv4: cmp.l #$10000,d7 + +ldiv4: cmp.l #0x10000,d7 bge ldiv5 -* + divu d6,d7 move.w d7,d5 @@ -55,30 +55,30 @@ ext.l d7 bra ldiv9 -* + ldiv5: moveq.l #1,d4 -* + ldiv6: cmp.l d6,d7 bcs ldiv7 -* + asl.l #1,d6 asl.l #1,d7 bra ldiv6 -* + ldiv7: tst.l d4 beq ldiv9 -* + cmp.l d6,d7 bcs ldiv8 -* + or.l d4,d5 sub.l d6,d7 -* + ldiv8: lsr.l #1,d4 lsr.l #1,d6 bra ldiv7 -* + ldiv9: cmp.w #1,d3 bne ldiv10 -* + neg.l d7 move.l d7,_ldivr @@ -86,16 +86,16 @@ neg.l d0 bra ldiv11 -* + ldiv10: move.l d7,_ldivr move.l d5,d0 -* + ldiv11: tst.l (a7)+ movem.l (a7)+,d3-d7 unlk a6 rts -* + .bss -* + _ldivr: .ds.l 1 -* + .end Index: lib700/lmul.s =================================================================== --- lib700/lmul.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/lmul.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,29 +1,29 @@ -* ------------------------------------------------------------------------------ -* lmul.s -- long multiply -* Version 2 -- 1989-07-18 -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| lmul.s -- long multiply +| Version 2 -- 1989-07-18 +| ------------------------------------------------------------------------------ .text -* + .xdef lmul -* -ARG1 .equ 8 -ARG2 .equ 12 -* -TEMP .equ -4 -* + +ARG1 = 8 +ARG2 = 12 + +TEMP = -4 + lmul: link a6,#-4 clr.w d2 tst.l ARG1(a6) bge lmul1 -* + neg.l ARG1(a6) addq.w #1,d2 -* + lmul1: tst.l ARG2(a6) bge lmul2 -* + neg.l ARG2(a6) addq.w #1,d2 -* + lmul2: move.w ARG1+2(a6),d0 mulu ARG2+2(a6),d0 @@ -39,9 +39,9 @@ btst #0,d2 beq lmul3 -* + neg.l d0 -* + lmul3: unlk a6 rts -* + .end Index: lib700/lrem.s =================================================================== --- lib700/lrem.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/lrem.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,17 +1,17 @@ -* ------------------------------------------------------------------------------ -* lrem.s -- long modulo -* Version 1 -- 1988-01-22 -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| lrem.s -- long modulo +| Version 1 -- 1988-01-22 +| ------------------------------------------------------------------------------ .text -* + .xdef _lrem .xdef lrem -* + .xref ldiv .xref _ldivr -* -ARG1 .equ 8 -ARG2 .equ 12 -* + +ARG1 = 8 +ARG2 = 12 + _lrem: lrem: link a6,#-2 @@ -23,4 +23,4 @@ unlk a6 rts -* + .end Index: lib700/rand24.s =================================================================== --- lib700/rand24.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/rand24.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,118 +1,118 @@ -* ------------------------------------------------------------------------------ -* rand24.s -- generate a 24 bit random number -* Version 3 -- 1988-04-29 -- D.N. Lynx Crowe -* ------------------------------------------------------------------------------ -* Synopsis: -* long -* rand24() -* -* Based on: -* Knuth, Donald E. -* The Art of Computer Programming, -* Volume 2: Semi-Numerical Algorithms -* -* Computes: -* S = [S * C] + K -* -* Where: -* K = 1 -* C = 3141592621 -* S = the seed (if zero, it gets set from the 200 Hz clock) -* -* Returns: -* S >> 8 (a 24 bit pseudo-random number) -* -* Note: this function has an LSB with an exactly 50% distribution, so using -* individual bits is probably not a good idea. Using more bits makes things -* appear more random. -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| rand24.s -- generate a 24 bit random number +| Version 3 -- 1988-04-29 -- D.N. Lynx Crowe +| ------------------------------------------------------------------------------ +| Synopsis: +| long +| rand24() + +| Based on: +| Knuth, Donald E. +| The Art of Computer Programming, +| Volume 2: Semi-Numerical Algorithms + +| Computes: +| S = [S | C] + K + +| Where: +| K = 1 +| C = 3141592621 +| S = the seed (if zero, it gets set from the 200 Hz clock) + +| Returns: +| S >> 8 (a 24 bit pseudo-random number) + +| Note: this function has an LSB with an exactly 50% distribution, so using +| individual bits is probably not a good idea. Using more bits makes things +| appear more random. +| ------------------------------------------------------------------------------ .text -* + .xdef _rand24 -* + .xdef _rseed -* -* equates for things in the BIOS -* -RCLOCK .equ $49E * LONG - 200 Hz clock -* -* equates for stack offsets -* -ARG1 .equ 8 * LONG / WORD - arg1 / MS bits -ARG1L .equ 10 * WORD - arg1 LS bits -ARG2 .equ 12 * LONG / WORD - arg2 / MS bits -ARG2L .equ 14 * WORD - arg2 LS bits -* -PART .equ -4 * LONG - partial product -* -PI .equ $BB40E62D * LONG - PI as a hex value -* + +| equates for things in the BIOS + +RCLOCK = 0x49E | LONG - 200 Hz clock + +| equates for stack offsets + +ARG1 = 8 | LONG / WORD - arg1 / MS bits +ARG1L = 10 | WORD - arg1 LS bits +ARG2 = 12 | LONG / WORD - arg2 / MS bits +ARG2L = 14 | WORD - arg2 LS bits + +PART = -4 | LONG - partial product + +PI = 0xBB40E62D | LONG - PI as a hex value + .page -* -* mult32 -- 32 bit signed multiply -* ------ ---------------------- -mult32: link a6,#-4 * link stack frames - clr.w d2 * clear sign flags - tst.l ARG1(a6) * check sign of 1st argument - bge mult32a * ... -* - neg.l ARG1(a6) * make 1st argument positive - addq.w #1,d2 * log its sign as negative -* -mult32a: tst.l ARG2(a6) * check sign of 2nd argument - bge mult32b * ... -* - neg.l ARG2(a6) * make 2nd argument positive - addq.w #1,d2 * log its sign as negative -* -mult32b: move.w ARG1L(a6),d0 * generate 1st partial product - mulu ARG2L(a6),d0 * ... - move.l d0,PART(a6) * ... - move.w ARG1(a6),d0 * generate 2nd partial product - mulu ARG2L(a6),d0 * ... - move.w ARG2(a6),d1 * generate 3rd partial product - mulu ARG1L(a6),d1 * ... - add.w d1,d0 * add partial products - add.w PART(a6),d0 * ... - move.w d0,PART(a6) * ... - move.l PART(a6),d0 * ... - btst #0,d2 * adjust sign of result - beq mult32c * ... -* - neg.l d0 * ... -* -mult32c: unlk a6 * unlink stack frames - rts * return -* + +| mult32 -- 32 bit signed multiply +| ------ ---------------------- +mult32: link a6,#-4 | link stack frames + clr.w d2 | clear sign flags + tst.l ARG1(a6) | check sign of 1st argument + bge mult32a | ... + + neg.l ARG1(a6) | make 1st argument positive + addq.w #1,d2 | log its sign as negative + +mult32a: tst.l ARG2(a6) | check sign of 2nd argument + bge mult32b | ... + + neg.l ARG2(a6) | make 2nd argument positive + addq.w #1,d2 | log its sign as negative + +mult32b: move.w ARG1L(a6),d0 | generate 1st partial product + mulu ARG2L(a6),d0 | ... + move.l d0,PART(a6) | ... + move.w ARG1(a6),d0 | generate 2nd partial product + mulu ARG2L(a6),d0 | ... + move.w ARG2(a6),d1 | generate 3rd partial product + mulu ARG1L(a6),d1 | ... + add.w d1,d0 | add partial products + add.w PART(a6),d0 | ... + move.w d0,PART(a6) | ... + move.l PART(a6),d0 | ... + btst #0,d2 | adjust sign of result + beq mult32c | ... + + neg.l d0 | ... + +mult32c: unlk a6 | unlink stack frames + rts | return + .page -* -* _rand24 -- Generate a random number -* ------- ------------------------ -_rand24: link a6,#0 * Link stack frames - tst.l _rseed * See if the seed is zero - bne rand01 * Jump if not -* - move.l RCLOCK,d0 * Pick up the 200 Hz clock - moveq.l #16,d1 * Shift it left - asl.l d1,d0 * ... - or.l RCLOCK,d0 * OR in current 200 Hz clock - move.l d0,_rseed * Use that as the seed -* -rand01: move.l #PI,-(a7) * Put PI on the stack - move.l _rseed,-(a7) * ... and _rseed, too - bsr mult32 * Multiply them - addq.l #8,a7 * Cleanup stack - addq.l #1,d0 * Add 1 to the result - move.l d0,_rseed * Save as new seed - asr.l #8,d0 * Make it a 24 bit number - and.l #$00FFFFFF,d0 * ... - unlk a6 * Unlink stack frames - rts * Return to caller -* -* ------------------------------------------------------------------------------ + +| _rand24 -- Generate a random number +| ------- ------------------------ +_rand24: link a6,#0 | Link stack frames + tst.l _rseed | See if the seed is zero + bne rand01 | Jump if not + + move.l RCLOCK,d0 | Pick up the 200 Hz clock + moveq.l #16,d1 | Shift it left + asl.l d1,d0 | ... + or.l RCLOCK,d0 | OR in current 200 Hz clock + move.l d0,_rseed | Use that as the seed + +rand01: move.l #PI,-(a7) | Put PI on the stack + move.l _rseed,-(a7) | ... and _rseed, too + bsr mult32 | Multiply them + addq.l #8,a7 | Cleanup stack + addq.l #1,d0 | Add 1 to the result + move.l d0,_rseed | Save as new seed + asr.l #8,d0 | Make it a 24 bit number + and.l #0x00FFFFFF,d0 | ... + unlk a6 | Unlink stack frames + rts | Return to caller + +| ------------------------------------------------------------------------------ .bss -* ------------------------------------------------------------------------------ -* -_rseed: .ds.l 1 * random number seed -* +| ------------------------------------------------------------------------------ + +_rseed: .ds.l 1 | random number seed + .end Index: lib700/setjmp.s =================================================================== --- lib700/setjmp.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/setjmp.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,26 +1,26 @@ -* ------------------------------------------------------------------------------ -* setjmp.s -- Unix(tm) compatible setjmp(env) and longjmp(env,ret) -* Version 3 -- 1987-06-16 -- D.N. Lynx Crowe -* ------------------------------------------------------------------------------ -* +| ------------------------------------------------------------------------------ +| setjmp.s -- Unix(tm) compatible setjmp(env) and longjmp(env,ret) +| Version 3 -- 1987-06-16 -- D.N. Lynx Crowe +| ------------------------------------------------------------------------------ + .text -* + .xdef _setjmp,_longjmp -* -_setjmp: movea.l 4(a7),a0 * Get env pointer - move.l (a7),(a0) * Put return address in env - movem.l d1-d7/a1-a7,4(a0) * Save registers in env - moveq.l #0,d0 * Set return value to 0 - rts * Return to caller -* -_longjmp: move.w 8(a7),d0 * Get ret value - bne lj1 * Jump if non-zero -* - moveq.l #1,d0 * Force return value to 1 -* -lj1: movea.l 4(a7),a0 * Get env pointer - movem.l 4(a0),d1-d7/a1-a7 * Restore registers from env - move.l (a0),(a7) * Get return address from env - rts * Return to caller -* + +_setjmp: movea.l 4(a7),a0 | Get env pointer + move.l (a7),(a0) | Put return address in env + movem.l d1-d7/a1-a7,4(a0) | Save registers in env + moveq.l #0,d0 | Set return value to 0 + rts | Return to caller + +_longjmp: move.w 8(a7),d0 | Get ret value + bne lj1 | Jump if non-zero + + moveq.l #1,d0 | Force return value to 1 + +lj1: movea.l 4(a7),a0 | Get env pointer + movem.l 4(a0),d1-d7/a1-a7 | Restore registers from env + move.l (a0),(a7) | Get return address from env + rts | Return to caller + .end Index: lib700/uldiv.s =================================================================== --- lib700/uldiv.s (revision f40a3096572fd1b0696a7f7c717464e68652e655) +++ lib700/uldiv.s (revision 06ccda27cf5f75746fcc4136947567c493a00bec) @@ -1,96 +1,96 @@ -* ------------------------------------------------------------------------------ -* uldiv.s -- unsigned long division, with remainder -* Version 2 -- 1987-06-08 -- D.N. Lynx Crowe -* Lifted from the Alcyon C library by disassembly so I could fix a bug - -* _uldivr must be in the bss segment so the code will work in PROM. -* -* long -* uldiv(dividnd, divisor) -* long dividnd, divisor; -* -* extern long uldivr; -* -* Divides 'dividnd' by 'divisor', treating both as unsigned -* long integers. Returns the quotient and leaves the -* remainder in 'uldivr'. Produces a divide check on division -* by zero, with $80000000 returned for both quotient and -* remainder. -* ------------------------------------------------------------------------------ +| ------------------------------------------------------------------------------ +| uldiv.s -- unsigned long division, with remainder +| Version 2 -- 1987-06-08 -- D.N. Lynx Crowe +| Lifted from the Alcyon C library by disassembly so I could fix a bug - +| _uldivr must be in the bss segment so the code will work in PROM. + +| long +| uldiv(dividnd, divisor) +| long dividnd, divisor; + +| extern long uldivr; + +| Divides 'dividnd' by 'divisor', treating both as unsigned +| long integers. Returns the quotient and leaves the +| remainder in 'uldivr'. Produces a divide check on division +| by zero, with 0x80000000 returned for both quotient and +| remainder. +| ------------------------------------------------------------------------------ .text -* + .xdef _uldiv,_uldivr -* -DIVIDEND .equ 8 -DIVISOR .equ 12 -* -_uldiv: link a6,#0 * Link stack frames - movem.l d3-d7,-(a7) * Save registers - move.l DIVIDEND(a6),d7 * d7 = DIVIDEND - move.l DIVISOR(a6),d6 * d6 = DIVISOR - tst.l d6 * Divide by zero ? - bne notdzero * Jump if not -* - move.l #$80000000,_uldivr * Force error result - move.l #$80000000,d0 * ... by dividing - divu #0,d0 * ... by zero - bra ulexit * ... then exit -* -notdzero: cmp.l d7,d6 * Divide underflow ? - bls notunflo * Jump if not -* - move.l d7,_uldivr * Remainder = dividend - clr.l d0 * Quotient = 0 - bra ulexit * Exit -* -notunflo: cmp.l d6,d7 * Is dividend = divisor ? - bne startdiv * Go start dividing if not -* - moveq.l #1,d5 * Quotient = 1 - clr.l d7 * Remainder = 0 - bra setreslt * Go set result -* + +DIVIDEND = 8 +DIVISOR = 12 + +_uldiv: link a6,#0 | Link stack frames + movem.l d3-d7,-(a7) | Save registers + move.l DIVIDEND(a6),d7 | d7 = DIVIDEND + move.l DIVISOR(a6),d6 | d6 = DIVISOR + tst.l d6 | Divide by zero ? + bne notdzero | Jump if not + + move.l #0x80000000,_uldivr | Force error result + move.l #0x80000000,d0 | ... by dividing + divu #0,d0 | ... by zero + bra ulexit | ... then exit + +notdzero: cmp.l d7,d6 | Divide underflow ? + bls notunflo | Jump if not + + move.l d7,_uldivr | Remainder = dividend + clr.l d0 | Quotient = 0 + bra ulexit | Exit + +notunflo: cmp.l d6,d7 | Is dividend = divisor ? + bne startdiv | Go start dividing if not + + moveq.l #1,d5 | Quotient = 1 + clr.l d7 | Remainder = 0 + bra setreslt | Go set result + .page -* -startdiv: moveq.l #1,d4 * Set result bit in d4 -* -divloop1: cmp.l d6,d7 * Divisor aligned OK ? - bcs divloop2 * Jump if so -* - move.l d6,d0 * Can we align things better ? - asl.l #1,d0 * ... - cmp.l d0,d6 * ... - bhi divloop2 * Jump if not -* - asl.l #1,d6 * Shift the divisor - asl.l #1,d4 * Shift the result bit - bra divloop1 * Loop for next bit -* -divloop2: clr.l d5 * Clear quotient -* -divloop3: tst.l d4 * More bits to do ? - beq setreslt * Go set result if not -* - cmp.l d6,d7 * Can we subtract ? - bcs divloop4 * Jump if not -* - or.l d4,d5 * Set a bit in the quotient - sub.l d6,d7 * Subtract divisor from dividend -* -divloop4: lsr.l #1,d4 * Shift the result bit - lsr.l #1,d6 * Shift the divisor - bra divloop3 * Loop for next bit -* -setreslt: move.l d7,_uldivr * Store remainder - move.l d5,d0 * Put quotient in d0 -* -ulexit: tst.l (a7)+ * Discard top of stack - movem.l (a7)+,d4-d7 * Restore registers - unlk a6 * Unlink stack frames - rts * Return to caller -* + +startdiv: moveq.l #1,d4 | Set result bit in d4 + +divloop1: cmp.l d6,d7 | Divisor aligned OK ? + bcs divloop2 | Jump if so + + move.l d6,d0 | Can we align things better ? + asl.l #1,d0 | ... + cmp.l d0,d6 | ... + bhi divloop2 | Jump if not + + asl.l #1,d6 | Shift the divisor + asl.l #1,d4 | Shift the result bit + bra divloop1 | Loop for next bit + +divloop2: clr.l d5 | Clear quotient + +divloop3: tst.l d4 | More bits to do ? + beq setreslt | Go set result if not + + cmp.l d6,d7 | Can we subtract ? + bcs divloop4 | Jump if not + + or.l d4,d5 | Set a bit in the quotient + sub.l d6,d7 | Subtract divisor from dividend + +divloop4: lsr.l #1,d4 | Shift the result bit + lsr.l #1,d6 | Shift the divisor + bra divloop3 | Loop for next bit + +setreslt: move.l d7,_uldivr | Store remainder + move.l d5,d0 | Put quotient in d0 + +ulexit: tst.l (a7)+ | Discard top of stack + movem.l (a7)+,d4-d7 | Restore registers + unlk a6 | Unlink stack frames + rts | Return to caller + .bss .even -* + _uldivr: ds.l 1 -* + .end