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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
* $URL$
* $Id$
*
*/
#include "kyra/sound.h"
#include "sound/audiostream.h"
namespace Kyra {
// Thanks to Torbjorn Andersson (eriktorbjorn) for his aud player on which
// this code is based on
// TODO: cleanup of whole AUDStream
class AUDStream : public Audio::AudioStream {
public:
AUDStream(Common::SeekableReadStream *stream, bool loop = false);
~AUDStream();
int readBuffer(int16 *buffer, const int numSamples);
bool isStereo() const { return false; }
bool endOfData() const { return _endOfData; }
int getRate() const { return _rate; }
void beginFadeIn();
void beginFadeOut();
private:
Common::SeekableReadStream *_stream;
bool _loop;
uint32 _loopStart;
bool _endOfData;
int _rate;
uint _processedSize;
uint _totalSize;
int _bytesLeft;
byte *_outBuffer;
int _outBufferOffset;
uint _outBufferSize;
byte *_inBuffer;
uint _inBufferSize;
int32 _fadeSamples;
int32 _fadeCount;
int _fading;
int readChunk(int16 *buffer, const int maxSamples);
static const int8 WSTable2Bit[];
static const int8 WSTable4Bit[];
};
const int8 AUDStream::WSTable2Bit[] = { -2, -1, 0, 1 };
const int8 AUDStream::WSTable4Bit[] = {
-9, -8, -6, -5, -4, -3, -2, -1,
0, 1, 2, 3, 4, 5, 6, 8
};
AUDStream::AUDStream(Common::SeekableReadStream *stream, bool loop) : _stream(stream), _endOfData(true), _rate(0),
_processedSize(0), _totalSize(0), _bytesLeft(0), _outBuffer(0),
_outBufferOffset(0), _outBufferSize(0), _inBuffer(0), _inBufferSize(0) {
_rate = _stream->readUint16LE();
_totalSize = _stream->readUint32LE();
_loop = loop;
// TODO: Find the correct number of samples for a fade-in/out. Should
// probably take the same amount of time as a palette fade.
_fadeSamples = 2 * getRate();
_fading = 0;
// TODO?: add checks
int flags = _stream->readByte(); // flags
int type = _stream->readByte(); // type
_loopStart = stream->pos();
if (type == 1 && !flags) {
_endOfData = false;
} else
warning("No AUD file (rate: %d, size: %d, flags: 0x%X, type: %d)", _rate, _totalSize, flags, type);
}
AUDStream::~AUDStream() {
delete [] _outBuffer;
delete [] _inBuffer;
delete _stream;
}
void AUDStream::beginFadeIn() {
if (_fading == 0)
_fadeCount = 0;
_fading = 1;
}
void AUDStream::beginFadeOut() {
if (_fading == 0)
_fadeCount = _fadeSamples;
_fading = -1;
}
int AUDStream::readBuffer(int16 *buffer, const int numSamples) {
int samplesRead = 0, samplesLeft = numSamples;
while (samplesLeft > 0 && !_endOfData) {
int samples = readChunk(buffer, samplesLeft);
samplesRead += samples;
samplesLeft -= samples;
buffer += samples;
}
return samplesRead;
}
inline int16 clip8BitSample(int16 sample) {
if (sample > 255)
return 255;
if (sample < 0)
return 0;
return sample;
}
int AUDStream::readChunk(int16 *buffer, const int maxSamples) {
int samplesProcessed = 0;
// if no bytes of the old chunk are left, read the next one
if (_bytesLeft <= 0) {
if (_processedSize >= _totalSize) {
if (_loop) {
_stream->seek(_loopStart);
_processedSize = 0;
} else {
_endOfData = true;
return 0;
}
}
uint16 size = _stream->readUint16LE();
uint16 outSize = _stream->readUint16LE();
uint32 id = _stream->readUint32LE();
assert(id == 0x0000DEAF);
_processedSize += 8 + size;
_outBufferOffset = 0;
if (size == outSize) {
if (outSize > _outBufferSize) {
_outBufferSize = outSize;
delete [] _outBuffer;
_outBuffer = new uint8[_outBufferSize];
assert(_outBuffer);
}
_bytesLeft = size;
_stream->read(_outBuffer, _bytesLeft);
} else {
_bytesLeft = outSize;
if (outSize > _outBufferSize) {
_outBufferSize = outSize;
delete [] _outBuffer;
_outBuffer = new uint8[_outBufferSize];
assert(_outBuffer);
}
if (size > _inBufferSize) {
_inBufferSize = size;
delete [] _inBuffer;
_inBuffer = new uint8[_inBufferSize];
assert(_inBuffer);
}
if (_stream->read(_inBuffer, size) != size) {
_endOfData = true;
return 0;
}
int16 curSample = 0x80;
byte code = 0;
int8 count = 0;
uint16 input = 0;
int j = 0;
int i = 0;
while (outSize > 0) {
input = _inBuffer[i++] << 2;
code = (input >> 8) & 0xff;
count = (input & 0xff) >> 2;
switch (code) {
case 2:
if (count & 0x20) {
/* NOTE: count is signed! */
count <<= 3;
curSample += (count >> 3);
_outBuffer[j++] = curSample & 0xFF;
outSize--;
} else {
for (; count >= 0; count--) {
_outBuffer[j++] = _inBuffer[i++];
outSize--;
}
curSample = _inBuffer[i - 1];
}
break;
case 1:
for (; count >= 0; count--) {
code = _inBuffer[i++];
curSample += WSTable4Bit[code & 0x0f];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample;
curSample += WSTable4Bit[code >> 4];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample;
outSize -= 2;
}
break;
case 0:
for (; count >= 0; count--) {
code = (uint8)_inBuffer[i++];
curSample += WSTable2Bit[code & 0x03];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample & 0xFF;
curSample += WSTable2Bit[(code >> 2) & 0x03];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample & 0xFF;
curSample += WSTable2Bit[(code >> 4) & 0x03];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample & 0xFF;
curSample += WSTable2Bit[(code >> 6) & 0x03];
curSample = clip8BitSample(curSample);
_outBuffer[j++] = curSample & 0xFF;
outSize -= 4;
}
break;
default:
for (; count >= 0; count--) {
_outBuffer[j++] = curSample & 0xFF;
outSize--;
}
}
}
}
}
// copies the chunk data to the output buffer
if (_bytesLeft > 0) {
int samples = MIN(_bytesLeft, maxSamples);
samplesProcessed += samples;
_bytesLeft -= samples;
// To help avoid overflows for long fade times, we divide both
// _fadeSamples and _fadeCount when calculating the new sample.
int32 div = _fadeSamples / 256;
while (samples--) {
int16 sample = (_outBuffer[_outBufferOffset++] << 8) ^ 0x8000;
if (_fading) {
sample = (sample * (_fadeCount / 256)) / div;
_fadeCount += _fading;
if (_fadeCount < 0) {
_fadeCount = 0;
_endOfData = true;
} else if (_fadeCount > _fadeSamples) {
_fadeCount = _fadeSamples;
_fading = 0;
}
}
*buffer++ = sample;
}
}
if (_fading < 0 && _fadeCount == 0)
_fading = false;
return samplesProcessed;
}
#pragma mark -
SoundDigital::SoundDigital(KyraEngine *vm, Audio::Mixer *mixer) : _vm(vm), _mixer(mixer), _sounds() {
memset(_sounds, 0, sizeof(_sounds));
}
SoundDigital::~SoundDigital() {
for (int i = 0; i < SOUND_STREAMS; ++i)
stopSound(i);
}
int SoundDigital::playSound(Common::SeekableReadStream *stream, bool loop, bool fadeIn, int channel) {
Sound *use = 0;
if (channel != -1 && channel < SOUND_STREAMS) {
stopSound(channel);
use = &_sounds[channel];
} else {
for (channel = 0; channel < SOUND_STREAMS; ++channel) {
if (!_sounds[channel].stream) {
use = &_sounds[channel];
break;
}
}
if (!use) {
warning("no free sound channel");
delete stream;
return -1;
}
}
use->stream = new AUDStream(stream, loop);
if (use->stream->endOfData()) {
delete use->stream;
use->stream = 0;
return -1;
}
if (fadeIn)
use->stream->beginFadeIn();
// TODO: set correct sound type from channel id
_mixer->playInputStream(Audio::Mixer::kPlainSoundType, &use->handle, use->stream);
return use - _sounds;
}
bool SoundDigital::isPlaying(int channel) {
if (channel == -1)
return false;
assert(channel >= 0 && channel < SOUND_STREAMS);
return _mixer->isSoundHandleActive(_sounds[channel].handle);
}
void SoundDigital::stopSound(int channel) {
assert(channel >= 0 && channel < SOUND_STREAMS);
_mixer->stopHandle(_sounds[channel].handle);
_sounds[channel].stream = 0;
}
void SoundDigital::beginFadeOut(int channel) {
if (isPlaying(channel))
_sounds[channel].stream->beginFadeOut();
}
} // end of namespace Kyra
|