Fixed outdated comments.

This commit is contained in:
Greg King
2020-12-27 18:22:12 -05:00
parent 9800555bbb
commit d90cd11212

View File

@@ -10,8 +10,8 @@
_memcmp: _memcmp:
; Calculate (-count-1) and store it into ptr3. This is some overhead here but ; Calculate a special count, and store it into ptr3. That is some overhead here,
; saves time in the compare loop ; but saves time in the compare loop
inx inx
stx ptr3+1 stx ptr3+1
@@ -29,12 +29,12 @@ _memcmp:
; Loop initialization ; Loop initialization
;ldy #$00 ; Initialize pointer (Y=0 guaranteed by popptr1) ;ldy #$00 ; Initialize pointer (Y=0 guaranteed by popptr1)
ldx ptr3 ; Load low counter byte into X ldx ptr3 ; Load inner counter byte into .X
; Head of compare loop: Test for the end condition ; Head of compare loop: Test for the end condition
Loop: dex ; Bump low byte of (-count-1) Loop: dex
beq BumpHiCnt ; Jump on overflow beq BumpHiCnt ; Jump on end of inner count
; Do the compare ; Do the compare
@@ -50,10 +50,10 @@ Comp: lda (ptr1),y
inc ptr2+1 inc ptr2+1
bne Loop ; Branch always (pointer wrap is illegal) bne Loop ; Branch always (pointer wrap is illegal)
; Entry on low counter byte overflow ; Entry on inner loop end
BumpHiCnt: BumpHiCnt:
dec ptr3+1 ; Bump high byte of (-count-1) dec ptr3+1
bne Comp ; Jump if not done bne Comp ; Jump if not done
jmp return0 ; Count is zero, areas are identical jmp return0 ; Count is zero, areas are identical