-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathay8910.hpp
229 lines (216 loc) · 8.64 KB
/
ay8910.hpp
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
/**
* SUZUKI PLAN - AY-3-8910 Emulator
* -----------------------------------------------------------------------------
* The MIT License (MIT)
*
* Copyright (c) 2020 Yoji Suzuki.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
* -----------------------------------------------------------------------------
*/
#ifndef INCLUDE_AY8910_HPP
#define INCLUDE_AY8910_HPP
#include <string.h>
class AY8910
{
private:
unsigned int clock;
unsigned char regMask[16];
unsigned int levels[32];
int volumeShift;
public:
struct Context {
int bobo;
unsigned char latch;
unsigned char reg[16];
unsigned int tPeriod[3];
int tCounter[3];
unsigned int tUp[3];
unsigned int nPeriod;
int nCounter;
unsigned int nUp;
unsigned int ePeriod;
int eCounter;
unsigned int eState;
int eFace;
unsigned int eHolding;
unsigned int random;
int mix[3];
} ctx;
void reset(int gain)
{
memset(&this->ctx, 0, sizeof(this->ctx));
this->ctx.ePeriod = 1;
this->ctx.eFace = 1;
this->ctx.random = 0xFFFF;
this->ctx.reg[7] = 0x80;
this->ctx.reg[14] = 0x7F;
unsigned char regMask[16] = {0xFF, 0x0F, 0xFF, 0x0F, 0xFF, 0x0F, 0x1F, 0xFF, 0x1F, 0x1F, 0x1F, 0xFF, 0xFF, 0x0F, 0xFF, 0xFF};
memcpy(this->regMask, regMask, sizeof(this->regMask));
unsigned int levels[32] = {0, 1, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 10, 12, 15, 18, 22, 26, 31, 37, 44, 53, 63, 75, 90, 107, 127, 151, 180, 214, 255, 255};
memcpy(this->levels, levels, sizeof(this->levels));
for (int i = 0; i < 32; i++) this->levels[i] *= gain;
this->setVolume(2);
}
void setVolume(int volume)
{
switch (volume) {
case 0: this->volumeShift = 16; break;
case 1: this->volumeShift = 10; break; // low
case 2: this->volumeShift = 7; break; // mid
case 3: this->volumeShift = 4; break; // high
case 4: this->volumeShift = 0; break; // not shift (original)
}
}
inline void latch(unsigned char value) { this->ctx.latch = value & 0x0F; }
inline unsigned char read() { return this->ctx.reg[this->ctx.latch]; }
inline unsigned char getPad1() { return this->ctx.reg[0x0E]; }
inline unsigned char getPad2() { return this->ctx.reg[0x0F]; }
inline void setPads(unsigned char pad1, unsigned char pad2)
{
this->ctx.reg[0x0E] = (~pad1) & 0xFF;
this->ctx.reg[0x0F] = (~pad2) & 0xFF;
}
inline void write(unsigned char value)
{
this->ctx.reg[this->ctx.latch] = value & this->regMask[this->ctx.latch];
switch (this->ctx.latch) {
case 0: this->ctx.tPeriod[0] = (this->ctx.tPeriod[0] & 0xF000) | (value << 4); break;
case 1: this->ctx.tPeriod[0] = (this->ctx.tPeriod[0] & 0x0FF0) | (value << 12); break;
case 2: this->ctx.tPeriod[1] = (this->ctx.tPeriod[1] & 0xF000) | (value << 4); break;
case 3: this->ctx.tPeriod[1] = (this->ctx.tPeriod[1] & 0x0FF0) | (value << 12); break;
case 4: this->ctx.tPeriod[2] = (this->ctx.tPeriod[2] & 0xF000) | (value << 4); break;
case 5: this->ctx.tPeriod[2] = (this->ctx.tPeriod[2] & 0x0FF0) | (value << 12); break;
case 6: this->ctx.nPeriod = value << 4; break;
case 11:
this->ctx.ePeriod = this->ctx.ePeriod & 0xFF000;
this->ctx.ePeriod |= value << 4;
this->ctx.ePeriod = this->ctx.ePeriod ? this->ctx.ePeriod : 1;
break;
case 12:
this->ctx.ePeriod = this->ctx.ePeriod & 0x00FF0;
this->ctx.ePeriod |= value << 12;
this->ctx.ePeriod = this->ctx.ePeriod ? this->ctx.ePeriod : 1;
break;
case 13:
if (value & 0b0100) {
this->ctx.eFace = 1;
this->ctx.eState = 0;
} else {
this->ctx.eFace = -1;
this->ctx.eState = 0x1F;
}
this->ctx.eHolding = 1;
break;
}
}
inline signed char tick8(unsigned int cycles)
{
return (signed char)(this->tick16(cycles) / 256);
}
inline short tick16(unsigned int cycles)
{
if (this->ctx.eHolding) {
this->ctx.eCounter += cycles;
while (0 < this->ctx.eCounter) {
this->ctx.eCounter -= this->ctx.ePeriod;
this->ctx.eState += this->ctx.eFace;
if (this->ctx.eState & 0b00100000) {
switch (this->ctx.reg[13]) {
case 8:
case 12:
this->ctx.eState = this->ctx.eFace == 1 ? 0 : 0x1F;
break;
case 10:
case 14:
this->ctx.eFace = -this->ctx.eFace;
this->ctx.eState = this->ctx.eFace == 1 ? 0 : 0x1F;
break;
case 11:
case 15:
this->ctx.eState = this->ctx.eFace == 1 ? 0 : 0x1F;
this->ctx.eHolding = 1;
this->ctx.eCounter = 0;
break;
case 9:
case 13:
this->ctx.eFace = -this->ctx.eFace;
this->ctx.eState = this->ctx.eFace == 1 ? 0 : 0x1F;
this->ctx.eHolding = 1;
this->ctx.eCounter = 0;
break;
default:
this->ctx.eState = 0;
this->ctx.eHolding = 1;
this->ctx.eCounter = 0;
}
}
}
}
if (this->ctx.nPeriod) {
this->ctx.nCounter += cycles;
while (0 <= this->ctx.nCounter) {
this->ctx.nCounter -= this->ctx.nPeriod;
this->ctx.nUp = this->getRandom();
}
} else {
this->ctx.nUp = this->getRandom();
}
int mix = this->getOutputMix(0, this->ctx.reg[7], cycles);
mix += this->getOutputMix(1, this->ctx.reg[7] >> 1, cycles);
mix += this->getOutputMix(2, this->ctx.reg[7] >> 2, cycles);
if (32767 < mix)
mix = 32767;
else if (mix < -32768)
mix = -32768;
return mix;
}
inline int getRandom()
{
if (this->ctx.random & 1) {
this->ctx.random ^= 0x24000;
this->ctx.random >>= 1;
return 1;
} else {
this->ctx.random >>= 1;
return 0;
}
}
inline int getOutputMix(int ch, unsigned int mask, unsigned int cycles)
{
unsigned int volume;
int mix = this->ctx.mix[ch];
if (this->ctx.tPeriod[ch]) {
this->ctx.tCounter[ch] += cycles;
while (0 <= this->ctx.tCounter[ch]) {
this->ctx.tCounter[ch] -= this->ctx.tPeriod[ch];
this->ctx.tUp[ch] ^= 1;
}
} else
this->ctx.tUp[ch] = 1;
if (((mask & 0x01) || this->ctx.tUp[ch]) && ((mask & 0x08) || this->ctx.nUp)) {
volume = this->ctx.reg[8 + ch] << 1;
this->ctx.mix[ch] = volume & 0x20 ? this->levels[this->ctx.eState] : this->levels[volume & 0x1F];
} else {
this->ctx.mix[ch] >>= 1;
}
return (mix + this->ctx.mix[ch]) >> this->volumeShift;
}
};
#endif // INCLUDE_AY8910_HPP