-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathutil.inc
175 lines (150 loc) · 4.54 KB
/
util.inc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
;BSD 2-Clause License
;
;Copyright (c) 2021-2022, Stefan Jakobsson
;All rights reserved.
;Redistribution and use in source and binary forms, with or without
;modification, are permitted provided that the following conditions are met:
;
;1. Redistributions of source code must retain the above copyright notice, this
; list of conditions and the following disclaimer.
;
;2. Redistributions in binary form must reproduce the above copyright notice,
; this list of conditions and the following disclaimer in the documentation
; and/or other materials provided with the distribution.
;
;THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
;AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
;IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
;DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
;FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
;DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
;SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
;CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
;OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
;OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
.ZEROPAGE
util_ptr: .res 2
.CODE
;******************************************************************************
;Function name.......: util_bin_to_bcd
;Purpose.............: Converts a binary value to a BCD value
;Input...............: 24 bit binary value, X=low, Y=mid, A=high
;Returns.............: Pointer to 32 bit BCD value, X=addressL, Y=addressH
;Errors..............: None
;Credits.............: This routine is based on Andrew Jacobs code published
; here: http://www.6502.org/source/integers/hex2dec-more.htm
; The function basically switches to decimal mode and then
; adds the bits together
.proc util_bin_to_bcd
;Store 24 bit input
stx input
sty input+1
sta input+2
;Clear 32 bit output
stz output
stz output+1
stz output+2
stz output+3
;Number of input bits
ldx #24
;Set decimal mode
sed
loop:
;Rotate input, leftmost bit -> C
asl input
rol input+1
rol input+2
;32 bit addition. Value of C from previous operation is the actual input. Therefore C is not cleared.
lda output
adc output
sta output
lda output+1
adc output+1
sta output+1
lda output+2
adc output+2
sta output+2
lda output+3
adc output+3
sta output+3
;Decrease bit counter, continue if >0
dex
bne loop
;Go back to binary mode
cld
;Set pointer to output, and we're done
ldx #<output
ldy #>output
rts
.segment "VARS"
input: .res 3
output: .res 4
.CODE
.endproc
;******************************************************************************
;Function name.......: util_bcd_to_str
;Purpose.............: Converts a BCD value to a null terminated string
;Input...............: Pointer to 32 bit BCD value, X=AddressL, Y=AddressH
;Returns.............: Pointer to string, X=AddressL, Y=AddressH
;Errors..............: None
.proc util_bcd_to_str
;Copy input to local memory
stx util_ptr
sty util_ptr+1
ldy #0
: lda (util_ptr),y
sta input,y
iny
cpy #5
bne :-
;Clear output
ldx #9
: stz output,x
dex
bne :-
ldx #4 ;Byte index, start with rightmost byte (MSB)
ldy #0 ;Char index, start from left
build_str:
;Get value from high nibble
lda input-1,x ;"input-1" is needed because X starts from 4 (i.e. last index+1); this makes the exit test simpler - maybe I'm optimizing too much?
lsr
lsr
lsr
lsr
clc
adc #48
sta output,y
iny
;Get value from low nibble
lda input-1,x
and #15
clc
adc #48
sta output,y
iny
;Decrease input byte index, if = 0 we're done
dex
bne build_str
strip_leading_zeros:
;Look for first non "0" value, and set the start of the output string to that position
ldx #0
: lda output,x
cmp #48
bne exit
inx
cpx #7 ;We must break this search at position 7. Otherwise 0 would be an empty string.
bcc :-
exit:
txa ;Start of string from search for non 0 value above; added to the output pointer
clc
adc #<output
tax
lda #0
adc #>output
tay
rts
.segment "VARS"
input: .res 4
output: .res 9
.CODE
.endproc