the10thwiz/cc65
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fixed the result of the % operator for ints

Browse Source 
git-svn-id: svn://svn.cc65.org/cc65/trunk@1408 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
cuz
2002-09-28 19:41:00 +00:00
parent 293bb88188
commit 3aab67401e
3 changed files with 44 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
libsrc/runtime/mod.s
View File

@@ -8,16 +8,31 @@
; values if $8000, in which case the negate will fail.
.export tosmoda0, tosmodax
.import popsargs, udiv16, adjsres
.importzp ptr1
.import popsargs, udiv16, negax
.importzp ptr1, tmp1
tosmoda0:
ldx #0
tosmodax:
jsr popsargs ; Get arguments from stack, adjust sign
jsr udiv16 ; Do the division
lda ptr1 ; Result is in sreg, remainder in ptr1
ldx ptr1+1
jmp adjsres ; Adjust the sign of the result if needed
ldx ptr1+1 ; Load high byte of result
; Adjust the sign of the result. tmp1 contains the high byte of the left
; operand, tmp2 contains the high byte of the right operand. The sign of
; the result of the modulo operation is the same as that of the left
; operand
lda tmp1
bpl Pos ; Jump if sign of result positive
; Result is negative
lda ptr1 ; Load low byte of result
jmp negax ; Adjust the sign
; Result is positive
Pos: lda ptr1
rts