/[svn]/libgig/trunk/src/gig.cpp
ViewVC logotype

Contents of /libgig/trunk/src/gig.cpp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1384 - (show annotations) (download)
Fri Oct 5 11:26:53 2007 UTC (16 years, 5 months ago) by schoenebeck
File size: 171161 byte(s)
- another minor API doc update

1 /***************************************************************************
2 * *
3 * libgig - C++ cross-platform Gigasampler format file access library *
4 * *
5 * Copyright (C) 2003-2007 by Christian Schoenebeck *
6 * <cuse@users.sourceforge.net> *
7 * *
8 * This library is free software; you can redistribute it and/or modify *
9 * it under the terms of the GNU General Public License as published by *
10 * the Free Software Foundation; either version 2 of the License, or *
11 * (at your option) any later version. *
12 * *
13 * This library is distributed in the hope that it will be useful, *
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
16 * GNU General Public License for more details. *
17 * *
18 * You should have received a copy of the GNU General Public License *
19 * along with this library; if not, write to the Free Software *
20 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, *
21 * MA 02111-1307 USA *
22 ***************************************************************************/
23
24 #include "gig.h"
25
26 #include "helper.h"
27
28 #include <math.h>
29 #include <iostream>
30
31 /// Initial size of the sample buffer which is used for decompression of
32 /// compressed sample wave streams - this value should always be bigger than
33 /// the biggest sample piece expected to be read by the sampler engine,
34 /// otherwise the buffer size will be raised at runtime and thus the buffer
35 /// reallocated which is time consuming and unefficient.
36 #define INITIAL_SAMPLE_BUFFER_SIZE 512000 // 512 kB
37
38 /** (so far) every exponential paramater in the gig format has a basis of 1.000000008813822 */
39 #define GIG_EXP_DECODE(x) (pow(1.000000008813822, x))
40 #define GIG_EXP_ENCODE(x) (log(x) / log(1.000000008813822))
41 #define GIG_PITCH_TRACK_EXTRACT(x) (!(x & 0x01))
42 #define GIG_PITCH_TRACK_ENCODE(x) ((x) ? 0x00 : 0x01)
43 #define GIG_VCF_RESONANCE_CTRL_EXTRACT(x) ((x >> 4) & 0x03)
44 #define GIG_VCF_RESONANCE_CTRL_ENCODE(x) ((x & 0x03) << 4)
45 #define GIG_EG_CTR_ATTACK_INFLUENCE_EXTRACT(x) ((x >> 1) & 0x03)
46 #define GIG_EG_CTR_DECAY_INFLUENCE_EXTRACT(x) ((x >> 3) & 0x03)
47 #define GIG_EG_CTR_RELEASE_INFLUENCE_EXTRACT(x) ((x >> 5) & 0x03)
48 #define GIG_EG_CTR_ATTACK_INFLUENCE_ENCODE(x) ((x & 0x03) << 1)
49 #define GIG_EG_CTR_DECAY_INFLUENCE_ENCODE(x) ((x & 0x03) << 3)
50 #define GIG_EG_CTR_RELEASE_INFLUENCE_ENCODE(x) ((x & 0x03) << 5)
51
52 namespace gig {
53
54 // *************** progress_t ***************
55 // *
56
57 progress_t::progress_t() {
58 callback = NULL;
59 custom = NULL;
60 __range_min = 0.0f;
61 __range_max = 1.0f;
62 }
63
64 // private helper function to convert progress of a subprocess into the global progress
65 static void __notify_progress(progress_t* pProgress, float subprogress) {
66 if (pProgress && pProgress->callback) {
67 const float totalrange = pProgress->__range_max - pProgress->__range_min;
68 const float totalprogress = pProgress->__range_min + subprogress * totalrange;
69 pProgress->factor = totalprogress;
70 pProgress->callback(pProgress); // now actually notify about the progress
71 }
72 }
73
74 // private helper function to divide a progress into subprogresses
75 static void __divide_progress(progress_t* pParentProgress, progress_t* pSubProgress, float totalTasks, float currentTask) {
76 if (pParentProgress && pParentProgress->callback) {
77 const float totalrange = pParentProgress->__range_max - pParentProgress->__range_min;
78 pSubProgress->callback = pParentProgress->callback;
79 pSubProgress->custom = pParentProgress->custom;
80 pSubProgress->__range_min = pParentProgress->__range_min + totalrange * currentTask / totalTasks;
81 pSubProgress->__range_max = pSubProgress->__range_min + totalrange / totalTasks;
82 }
83 }
84
85
86 // *************** Internal functions for sample decompression ***************
87 // *
88
89 namespace {
90
91 inline int get12lo(const unsigned char* pSrc)
92 {
93 const int x = pSrc[0] | (pSrc[1] & 0x0f) << 8;
94 return x & 0x800 ? x - 0x1000 : x;
95 }
96
97 inline int get12hi(const unsigned char* pSrc)
98 {
99 const int x = pSrc[1] >> 4 | pSrc[2] << 4;
100 return x & 0x800 ? x - 0x1000 : x;
101 }
102
103 inline int16_t get16(const unsigned char* pSrc)
104 {
105 return int16_t(pSrc[0] | pSrc[1] << 8);
106 }
107
108 inline int get24(const unsigned char* pSrc)
109 {
110 const int x = pSrc[0] | pSrc[1] << 8 | pSrc[2] << 16;
111 return x & 0x800000 ? x - 0x1000000 : x;
112 }
113
114 inline void store24(unsigned char* pDst, int x)
115 {
116 pDst[0] = x;
117 pDst[1] = x >> 8;
118 pDst[2] = x >> 16;
119 }
120
121 void Decompress16(int compressionmode, const unsigned char* params,
122 int srcStep, int dstStep,
123 const unsigned char* pSrc, int16_t* pDst,
124 unsigned long currentframeoffset,
125 unsigned long copysamples)
126 {
127 switch (compressionmode) {
128 case 0: // 16 bit uncompressed
129 pSrc += currentframeoffset * srcStep;
130 while (copysamples) {
131 *pDst = get16(pSrc);
132 pDst += dstStep;
133 pSrc += srcStep;
134 copysamples--;
135 }
136 break;
137
138 case 1: // 16 bit compressed to 8 bit
139 int y = get16(params);
140 int dy = get16(params + 2);
141 while (currentframeoffset) {
142 dy -= int8_t(*pSrc);
143 y -= dy;
144 pSrc += srcStep;
145 currentframeoffset--;
146 }
147 while (copysamples) {
148 dy -= int8_t(*pSrc);
149 y -= dy;
150 *pDst = y;
151 pDst += dstStep;
152 pSrc += srcStep;
153 copysamples--;
154 }
155 break;
156 }
157 }
158
159 void Decompress24(int compressionmode, const unsigned char* params,
160 int dstStep, const unsigned char* pSrc, uint8_t* pDst,
161 unsigned long currentframeoffset,
162 unsigned long copysamples, int truncatedBits)
163 {
164 int y, dy, ddy, dddy;
165
166 #define GET_PARAMS(params) \
167 y = get24(params); \
168 dy = y - get24((params) + 3); \
169 ddy = get24((params) + 6); \
170 dddy = get24((params) + 9)
171
172 #define SKIP_ONE(x) \
173 dddy -= (x); \
174 ddy -= dddy; \
175 dy = -dy - ddy; \
176 y += dy
177
178 #define COPY_ONE(x) \
179 SKIP_ONE(x); \
180 store24(pDst, y << truncatedBits); \
181 pDst += dstStep
182
183 switch (compressionmode) {
184 case 2: // 24 bit uncompressed
185 pSrc += currentframeoffset * 3;
186 while (copysamples) {
187 store24(pDst, get24(pSrc) << truncatedBits);
188 pDst += dstStep;
189 pSrc += 3;
190 copysamples--;
191 }
192 break;
193
194 case 3: // 24 bit compressed to 16 bit
195 GET_PARAMS(params);
196 while (currentframeoffset) {
197 SKIP_ONE(get16(pSrc));
198 pSrc += 2;
199 currentframeoffset--;
200 }
201 while (copysamples) {
202 COPY_ONE(get16(pSrc));
203 pSrc += 2;
204 copysamples--;
205 }
206 break;
207
208 case 4: // 24 bit compressed to 12 bit
209 GET_PARAMS(params);
210 while (currentframeoffset > 1) {
211 SKIP_ONE(get12lo(pSrc));
212 SKIP_ONE(get12hi(pSrc));
213 pSrc += 3;
214 currentframeoffset -= 2;
215 }
216 if (currentframeoffset) {
217 SKIP_ONE(get12lo(pSrc));
218 currentframeoffset--;
219 if (copysamples) {
220 COPY_ONE(get12hi(pSrc));
221 pSrc += 3;
222 copysamples--;
223 }
224 }
225 while (copysamples > 1) {
226 COPY_ONE(get12lo(pSrc));
227 COPY_ONE(get12hi(pSrc));
228 pSrc += 3;
229 copysamples -= 2;
230 }
231 if (copysamples) {
232 COPY_ONE(get12lo(pSrc));
233 }
234 break;
235
236 case 5: // 24 bit compressed to 8 bit
237 GET_PARAMS(params);
238 while (currentframeoffset) {
239 SKIP_ONE(int8_t(*pSrc++));
240 currentframeoffset--;
241 }
242 while (copysamples) {
243 COPY_ONE(int8_t(*pSrc++));
244 copysamples--;
245 }
246 break;
247 }
248 }
249
250 const int bytesPerFrame[] = { 4096, 2052, 768, 524, 396, 268 };
251 const int bytesPerFrameNoHdr[] = { 4096, 2048, 768, 512, 384, 256 };
252 const int headerSize[] = { 0, 4, 0, 12, 12, 12 };
253 const int bitsPerSample[] = { 16, 8, 24, 16, 12, 8 };
254 }
255
256
257
258 // *************** Internal CRC-32 (Cyclic Redundancy Check) functions ***************
259 // *
260
261 static uint32_t* __initCRCTable() {
262 static uint32_t res[256];
263
264 for (int i = 0 ; i < 256 ; i++) {
265 uint32_t c = i;
266 for (int j = 0 ; j < 8 ; j++) {
267 c = (c & 1) ? 0xedb88320 ^ (c >> 1) : c >> 1;
268 }
269 res[i] = c;
270 }
271 return res;
272 }
273
274 static const uint32_t* __CRCTable = __initCRCTable();
275
276 /**
277 * Initialize a CRC variable.
278 *
279 * @param crc - variable to be initialized
280 */
281 inline static void __resetCRC(uint32_t& crc) {
282 crc = 0xffffffff;
283 }
284
285 /**
286 * Used to calculate checksums of the sample data in a gig file. The
287 * checksums are stored in the 3crc chunk of the gig file and
288 * automatically updated when a sample is written with Sample::Write().
289 *
290 * One should call __resetCRC() to initialize the CRC variable to be
291 * used before calling this function the first time.
292 *
293 * After initializing the CRC variable one can call this function
294 * arbitrary times, i.e. to split the overall CRC calculation into
295 * steps.
296 *
297 * Once the whole data was processed by __calculateCRC(), one should
298 * call __encodeCRC() to get the final CRC result.
299 *
300 * @param buf - pointer to data the CRC shall be calculated of
301 * @param bufSize - size of the data to be processed
302 * @param crc - variable the CRC sum shall be stored to
303 */
304 static void __calculateCRC(unsigned char* buf, int bufSize, uint32_t& crc) {
305 for (int i = 0 ; i < bufSize ; i++) {
306 crc = __CRCTable[(crc ^ buf[i]) & 0xff] ^ (crc >> 8);
307 }
308 }
309
310 /**
311 * Returns the final CRC result.
312 *
313 * @param crc - variable previously passed to __calculateCRC()
314 */
315 inline static uint32_t __encodeCRC(const uint32_t& crc) {
316 return crc ^ 0xffffffff;
317 }
318
319
320
321 // *************** Other Internal functions ***************
322 // *
323
324 static split_type_t __resolveSplitType(dimension_t dimension) {
325 return (
326 dimension == dimension_layer ||
327 dimension == dimension_samplechannel ||
328 dimension == dimension_releasetrigger ||
329 dimension == dimension_keyboard ||
330 dimension == dimension_roundrobin ||
331 dimension == dimension_random ||
332 dimension == dimension_smartmidi ||
333 dimension == dimension_roundrobinkeyboard
334 ) ? split_type_bit : split_type_normal;
335 }
336
337 static int __resolveZoneSize(dimension_def_t& dimension_definition) {
338 return (dimension_definition.split_type == split_type_normal)
339 ? int(128.0 / dimension_definition.zones) : 0;
340 }
341
342
343
344 // *************** Sample ***************
345 // *
346
347 unsigned int Sample::Instances = 0;
348 buffer_t Sample::InternalDecompressionBuffer;
349
350 /** @brief Constructor.
351 *
352 * Load an existing sample or create a new one. A 'wave' list chunk must
353 * be given to this constructor. In case the given 'wave' list chunk
354 * contains a 'fmt', 'data' (and optionally a '3gix', 'smpl') chunk, the
355 * format and sample data will be loaded from there, otherwise default
356 * values will be used and those chunks will be created when
357 * File::Save() will be called later on.
358 *
359 * @param pFile - pointer to gig::File where this sample is
360 * located (or will be located)
361 * @param waveList - pointer to 'wave' list chunk which is (or
362 * will be) associated with this sample
363 * @param WavePoolOffset - offset of this sample data from wave pool
364 * ('wvpl') list chunk
365 * @param fileNo - number of an extension file where this sample
366 * is located, 0 otherwise
367 */
368 Sample::Sample(File* pFile, RIFF::List* waveList, unsigned long WavePoolOffset, unsigned long fileNo) : DLS::Sample((DLS::File*) pFile, waveList, WavePoolOffset) {
369 static const DLS::Info::FixedStringLength fixedStringLengths[] = {
370 { CHUNK_ID_INAM, 64 },
371 { 0, 0 }
372 };
373 pInfo->FixedStringLengths = fixedStringLengths;
374 Instances++;
375 FileNo = fileNo;
376
377 __resetCRC(crc);
378
379 pCk3gix = waveList->GetSubChunk(CHUNK_ID_3GIX);
380 if (pCk3gix) {
381 uint16_t iSampleGroup = pCk3gix->ReadInt16();
382 pGroup = pFile->GetGroup(iSampleGroup);
383 } else { // '3gix' chunk missing
384 // by default assigned to that mandatory "Default Group"
385 pGroup = pFile->GetGroup(0);
386 }
387
388 pCkSmpl = waveList->GetSubChunk(CHUNK_ID_SMPL);
389 if (pCkSmpl) {
390 Manufacturer = pCkSmpl->ReadInt32();
391 Product = pCkSmpl->ReadInt32();
392 SamplePeriod = pCkSmpl->ReadInt32();
393 MIDIUnityNote = pCkSmpl->ReadInt32();
394 FineTune = pCkSmpl->ReadInt32();
395 pCkSmpl->Read(&SMPTEFormat, 1, 4);
396 SMPTEOffset = pCkSmpl->ReadInt32();
397 Loops = pCkSmpl->ReadInt32();
398 pCkSmpl->ReadInt32(); // manufByt
399 LoopID = pCkSmpl->ReadInt32();
400 pCkSmpl->Read(&LoopType, 1, 4);
401 LoopStart = pCkSmpl->ReadInt32();
402 LoopEnd = pCkSmpl->ReadInt32();
403 LoopFraction = pCkSmpl->ReadInt32();
404 LoopPlayCount = pCkSmpl->ReadInt32();
405 } else { // 'smpl' chunk missing
406 // use default values
407 Manufacturer = 0;
408 Product = 0;
409 SamplePeriod = uint32_t(1000000000.0 / SamplesPerSecond + 0.5);
410 MIDIUnityNote = 60;
411 FineTune = 0;
412 SMPTEFormat = smpte_format_no_offset;
413 SMPTEOffset = 0;
414 Loops = 0;
415 LoopID = 0;
416 LoopType = loop_type_normal;
417 LoopStart = 0;
418 LoopEnd = 0;
419 LoopFraction = 0;
420 LoopPlayCount = 0;
421 }
422
423 FrameTable = NULL;
424 SamplePos = 0;
425 RAMCache.Size = 0;
426 RAMCache.pStart = NULL;
427 RAMCache.NullExtensionSize = 0;
428
429 if (BitDepth > 24) throw gig::Exception("Only samples up to 24 bit supported");
430
431 RIFF::Chunk* ewav = waveList->GetSubChunk(CHUNK_ID_EWAV);
432 Compressed = ewav;
433 Dithered = false;
434 TruncatedBits = 0;
435 if (Compressed) {
436 uint32_t version = ewav->ReadInt32();
437 if (version == 3 && BitDepth == 24) {
438 Dithered = ewav->ReadInt32();
439 ewav->SetPos(Channels == 2 ? 84 : 64);
440 TruncatedBits = ewav->ReadInt32();
441 }
442 ScanCompressedSample();
443 }
444
445 // we use a buffer for decompression and for truncating 24 bit samples to 16 bit
446 if ((Compressed || BitDepth == 24) && !InternalDecompressionBuffer.Size) {
447 InternalDecompressionBuffer.pStart = new unsigned char[INITIAL_SAMPLE_BUFFER_SIZE];
448 InternalDecompressionBuffer.Size = INITIAL_SAMPLE_BUFFER_SIZE;
449 }
450 FrameOffset = 0; // just for streaming compressed samples
451
452 LoopSize = LoopEnd - LoopStart + 1;
453 }
454
455 /**
456 * Apply sample and its settings to the respective RIFF chunks. You have
457 * to call File::Save() to make changes persistent.
458 *
459 * Usually there is absolutely no need to call this method explicitly.
460 * It will be called automatically when File::Save() was called.
461 *
462 * @throws DLS::Exception if FormatTag != DLS_WAVE_FORMAT_PCM or no sample data
463 * was provided yet
464 * @throws gig::Exception if there is any invalid sample setting
465 */
466 void Sample::UpdateChunks() {
467 // first update base class's chunks
468 DLS::Sample::UpdateChunks();
469
470 // make sure 'smpl' chunk exists
471 pCkSmpl = pWaveList->GetSubChunk(CHUNK_ID_SMPL);
472 if (!pCkSmpl) {
473 pCkSmpl = pWaveList->AddSubChunk(CHUNK_ID_SMPL, 60);
474 memset(pCkSmpl->LoadChunkData(), 0, 60);
475 }
476 // update 'smpl' chunk
477 uint8_t* pData = (uint8_t*) pCkSmpl->LoadChunkData();
478 SamplePeriod = uint32_t(1000000000.0 / SamplesPerSecond + 0.5);
479 store32(&pData[0], Manufacturer);
480 store32(&pData[4], Product);
481 store32(&pData[8], SamplePeriod);
482 store32(&pData[12], MIDIUnityNote);
483 store32(&pData[16], FineTune);
484 store32(&pData[20], SMPTEFormat);
485 store32(&pData[24], SMPTEOffset);
486 store32(&pData[28], Loops);
487
488 // we skip 'manufByt' for now (4 bytes)
489
490 store32(&pData[36], LoopID);
491 store32(&pData[40], LoopType);
492 store32(&pData[44], LoopStart);
493 store32(&pData[48], LoopEnd);
494 store32(&pData[52], LoopFraction);
495 store32(&pData[56], LoopPlayCount);
496
497 // make sure '3gix' chunk exists
498 pCk3gix = pWaveList->GetSubChunk(CHUNK_ID_3GIX);
499 if (!pCk3gix) pCk3gix = pWaveList->AddSubChunk(CHUNK_ID_3GIX, 4);
500 // determine appropriate sample group index (to be stored in chunk)
501 uint16_t iSampleGroup = 0; // 0 refers to default sample group
502 File* pFile = static_cast<File*>(pParent);
503 if (pFile->pGroups) {
504 std::list<Group*>::iterator iter = pFile->pGroups->begin();
505 std::list<Group*>::iterator end = pFile->pGroups->end();
506 for (int i = 0; iter != end; i++, iter++) {
507 if (*iter == pGroup) {
508 iSampleGroup = i;
509 break; // found
510 }
511 }
512 }
513 // update '3gix' chunk
514 pData = (uint8_t*) pCk3gix->LoadChunkData();
515 store16(&pData[0], iSampleGroup);
516 }
517
518 /// Scans compressed samples for mandatory informations (e.g. actual number of total sample points).
519 void Sample::ScanCompressedSample() {
520 //TODO: we have to add some more scans here (e.g. determine compression rate)
521 this->SamplesTotal = 0;
522 std::list<unsigned long> frameOffsets;
523
524 SamplesPerFrame = BitDepth == 24 ? 256 : 2048;
525 WorstCaseFrameSize = SamplesPerFrame * FrameSize + Channels; // +Channels for compression flag
526
527 // Scanning
528 pCkData->SetPos(0);
529 if (Channels == 2) { // Stereo
530 for (int i = 0 ; ; i++) {
531 // for 24 bit samples every 8:th frame offset is
532 // stored, to save some memory
533 if (BitDepth != 24 || (i & 7) == 0) frameOffsets.push_back(pCkData->GetPos());
534
535 const int mode_l = pCkData->ReadUint8();
536 const int mode_r = pCkData->ReadUint8();
537 if (mode_l > 5 || mode_r > 5) throw gig::Exception("Unknown compression mode");
538 const unsigned long frameSize = bytesPerFrame[mode_l] + bytesPerFrame[mode_r];
539
540 if (pCkData->RemainingBytes() <= frameSize) {
541 SamplesInLastFrame =
542 ((pCkData->RemainingBytes() - headerSize[mode_l] - headerSize[mode_r]) << 3) /
543 (bitsPerSample[mode_l] + bitsPerSample[mode_r]);
544 SamplesTotal += SamplesInLastFrame;
545 break;
546 }
547 SamplesTotal += SamplesPerFrame;
548 pCkData->SetPos(frameSize, RIFF::stream_curpos);
549 }
550 }
551 else { // Mono
552 for (int i = 0 ; ; i++) {
553 if (BitDepth != 24 || (i & 7) == 0) frameOffsets.push_back(pCkData->GetPos());
554
555 const int mode = pCkData->ReadUint8();
556 if (mode > 5) throw gig::Exception("Unknown compression mode");
557 const unsigned long frameSize = bytesPerFrame[mode];
558
559 if (pCkData->RemainingBytes() <= frameSize) {
560 SamplesInLastFrame =
561 ((pCkData->RemainingBytes() - headerSize[mode]) << 3) / bitsPerSample[mode];
562 SamplesTotal += SamplesInLastFrame;
563 break;
564 }
565 SamplesTotal += SamplesPerFrame;
566 pCkData->SetPos(frameSize, RIFF::stream_curpos);
567 }
568 }
569 pCkData->SetPos(0);
570
571 // Build the frames table (which is used for fast resolving of a frame's chunk offset)
572 if (FrameTable) delete[] FrameTable;
573 FrameTable = new unsigned long[frameOffsets.size()];
574 std::list<unsigned long>::iterator end = frameOffsets.end();
575 std::list<unsigned long>::iterator iter = frameOffsets.begin();
576 for (int i = 0; iter != end; i++, iter++) {
577 FrameTable[i] = *iter;
578 }
579 }
580
581 /**
582 * Loads (and uncompresses if needed) the whole sample wave into RAM. Use
583 * ReleaseSampleData() to free the memory if you don't need the cached
584 * sample data anymore.
585 *
586 * @returns buffer_t structure with start address and size of the buffer
587 * in bytes
588 * @see ReleaseSampleData(), Read(), SetPos()
589 */
590 buffer_t Sample::LoadSampleData() {
591 return LoadSampleDataWithNullSamplesExtension(this->SamplesTotal, 0); // 0 amount of NullSamples
592 }
593
594 /**
595 * Reads (uncompresses if needed) and caches the first \a SampleCount
596 * numbers of SamplePoints in RAM. Use ReleaseSampleData() to free the
597 * memory space if you don't need the cached samples anymore. There is no
598 * guarantee that exactly \a SampleCount samples will be cached; this is
599 * not an error. The size will be eventually truncated e.g. to the
600 * beginning of a frame of a compressed sample. This is done for
601 * efficiency reasons while streaming the wave by your sampler engine
602 * later. Read the <i>Size</i> member of the <i>buffer_t</i> structure
603 * that will be returned to determine the actual cached samples, but note
604 * that the size is given in bytes! You get the number of actually cached
605 * samples by dividing it by the frame size of the sample:
606 * @code
607 * buffer_t buf = pSample->LoadSampleData(acquired_samples);
608 * long cachedsamples = buf.Size / pSample->FrameSize;
609 * @endcode
610 *
611 * @param SampleCount - number of sample points to load into RAM
612 * @returns buffer_t structure with start address and size of
613 * the cached sample data in bytes
614 * @see ReleaseSampleData(), Read(), SetPos()
615 */
616 buffer_t Sample::LoadSampleData(unsigned long SampleCount) {
617 return LoadSampleDataWithNullSamplesExtension(SampleCount, 0); // 0 amount of NullSamples
618 }
619
620 /**
621 * Loads (and uncompresses if needed) the whole sample wave into RAM. Use
622 * ReleaseSampleData() to free the memory if you don't need the cached
623 * sample data anymore.
624 * The method will add \a NullSamplesCount silence samples past the
625 * official buffer end (this won't affect the 'Size' member of the
626 * buffer_t structure, that means 'Size' always reflects the size of the
627 * actual sample data, the buffer might be bigger though). Silence
628 * samples past the official buffer are needed for differential
629 * algorithms that always have to take subsequent samples into account
630 * (resampling/interpolation would be an important example) and avoids
631 * memory access faults in such cases.
632 *
633 * @param NullSamplesCount - number of silence samples the buffer should
634 * be extended past it's data end
635 * @returns buffer_t structure with start address and
636 * size of the buffer in bytes
637 * @see ReleaseSampleData(), Read(), SetPos()
638 */
639 buffer_t Sample::LoadSampleDataWithNullSamplesExtension(uint NullSamplesCount) {
640 return LoadSampleDataWithNullSamplesExtension(this->SamplesTotal, NullSamplesCount);
641 }
642
643 /**
644 * Reads (uncompresses if needed) and caches the first \a SampleCount
645 * numbers of SamplePoints in RAM. Use ReleaseSampleData() to free the
646 * memory space if you don't need the cached samples anymore. There is no
647 * guarantee that exactly \a SampleCount samples will be cached; this is
648 * not an error. The size will be eventually truncated e.g. to the
649 * beginning of a frame of a compressed sample. This is done for
650 * efficiency reasons while streaming the wave by your sampler engine
651 * later. Read the <i>Size</i> member of the <i>buffer_t</i> structure
652 * that will be returned to determine the actual cached samples, but note
653 * that the size is given in bytes! You get the number of actually cached
654 * samples by dividing it by the frame size of the sample:
655 * @code
656 * buffer_t buf = pSample->LoadSampleDataWithNullSamplesExtension(acquired_samples, null_samples);
657 * long cachedsamples = buf.Size / pSample->FrameSize;
658 * @endcode
659 * The method will add \a NullSamplesCount silence samples past the
660 * official buffer end (this won't affect the 'Size' member of the
661 * buffer_t structure, that means 'Size' always reflects the size of the
662 * actual sample data, the buffer might be bigger though). Silence
663 * samples past the official buffer are needed for differential
664 * algorithms that always have to take subsequent samples into account
665 * (resampling/interpolation would be an important example) and avoids
666 * memory access faults in such cases.
667 *
668 * @param SampleCount - number of sample points to load into RAM
669 * @param NullSamplesCount - number of silence samples the buffer should
670 * be extended past it's data end
671 * @returns buffer_t structure with start address and
672 * size of the cached sample data in bytes
673 * @see ReleaseSampleData(), Read(), SetPos()
674 */
675 buffer_t Sample::LoadSampleDataWithNullSamplesExtension(unsigned long SampleCount, uint NullSamplesCount) {
676 if (SampleCount > this->SamplesTotal) SampleCount = this->SamplesTotal;
677 if (RAMCache.pStart) delete[] (int8_t*) RAMCache.pStart;
678 unsigned long allocationsize = (SampleCount + NullSamplesCount) * this->FrameSize;
679 RAMCache.pStart = new int8_t[allocationsize];
680 RAMCache.Size = Read(RAMCache.pStart, SampleCount) * this->FrameSize;
681 RAMCache.NullExtensionSize = allocationsize - RAMCache.Size;
682 // fill the remaining buffer space with silence samples
683 memset((int8_t*)RAMCache.pStart + RAMCache.Size, 0, RAMCache.NullExtensionSize);
684 return GetCache();
685 }
686
687 /**
688 * Returns current cached sample points. A buffer_t structure will be
689 * returned which contains address pointer to the begin of the cache and
690 * the size of the cached sample data in bytes. Use
691 * <i>LoadSampleData()</i> to cache a specific amount of sample points in
692 * RAM.
693 *
694 * @returns buffer_t structure with current cached sample points
695 * @see LoadSampleData();
696 */
697 buffer_t Sample::GetCache() {
698 // return a copy of the buffer_t structure
699 buffer_t result;
700 result.Size = this->RAMCache.Size;
701 result.pStart = this->RAMCache.pStart;
702 result.NullExtensionSize = this->RAMCache.NullExtensionSize;
703 return result;
704 }
705
706 /**
707 * Frees the cached sample from RAM if loaded with
708 * <i>LoadSampleData()</i> previously.
709 *
710 * @see LoadSampleData();
711 */
712 void Sample::ReleaseSampleData() {
713 if (RAMCache.pStart) delete[] (int8_t*) RAMCache.pStart;
714 RAMCache.pStart = NULL;
715 RAMCache.Size = 0;
716 }
717
718 /** @brief Resize sample.
719 *
720 * Resizes the sample's wave form data, that is the actual size of
721 * sample wave data possible to be written for this sample. This call
722 * will return immediately and just schedule the resize operation. You
723 * should call File::Save() to actually perform the resize operation(s)
724 * "physically" to the file. As this can take a while on large files, it
725 * is recommended to call Resize() first on all samples which have to be
726 * resized and finally to call File::Save() to perform all those resize
727 * operations in one rush.
728 *
729 * The actual size (in bytes) is dependant to the current FrameSize
730 * value. You may want to set FrameSize before calling Resize().
731 *
732 * <b>Caution:</b> You cannot directly write (i.e. with Write()) to
733 * enlarged samples before calling File::Save() as this might exceed the
734 * current sample's boundary!
735 *
736 * Also note: only DLS_WAVE_FORMAT_PCM is currently supported, that is
737 * FormatTag must be DLS_WAVE_FORMAT_PCM. Trying to resize samples with
738 * other formats will fail!
739 *
740 * @param iNewSize - new sample wave data size in sample points (must be
741 * greater than zero)
742 * @throws DLS::Excecption if FormatTag != DLS_WAVE_FORMAT_PCM
743 * or if \a iNewSize is less than 1
744 * @throws gig::Exception if existing sample is compressed
745 * @see DLS::Sample::GetSize(), DLS::Sample::FrameSize,
746 * DLS::Sample::FormatTag, File::Save()
747 */
748 void Sample::Resize(int iNewSize) {
749 if (Compressed) throw gig::Exception("There is no support for modifying compressed samples (yet)");
750 DLS::Sample::Resize(iNewSize);
751 }
752
753 /**
754 * Sets the position within the sample (in sample points, not in
755 * bytes). Use this method and <i>Read()</i> if you don't want to load
756 * the sample into RAM, thus for disk streaming.
757 *
758 * Although the original Gigasampler engine doesn't allow positioning
759 * within compressed samples, I decided to implement it. Even though
760 * the Gigasampler format doesn't allow to define loops for compressed
761 * samples at the moment, positioning within compressed samples might be
762 * interesting for some sampler engines though. The only drawback about
763 * my decision is that it takes longer to load compressed gig Files on
764 * startup, because it's neccessary to scan the samples for some
765 * mandatory informations. But I think as it doesn't affect the runtime
766 * efficiency, nobody will have a problem with that.
767 *
768 * @param SampleCount number of sample points to jump
769 * @param Whence optional: to which relation \a SampleCount refers
770 * to, if omited <i>RIFF::stream_start</i> is assumed
771 * @returns the new sample position
772 * @see Read()
773 */
774 unsigned long Sample::SetPos(unsigned long SampleCount, RIFF::stream_whence_t Whence) {
775 if (Compressed) {
776 switch (Whence) {
777 case RIFF::stream_curpos:
778 this->SamplePos += SampleCount;
779 break;
780 case RIFF::stream_end:
781 this->SamplePos = this->SamplesTotal - 1 - SampleCount;
782 break;
783 case RIFF::stream_backward:
784 this->SamplePos -= SampleCount;
785 break;
786 case RIFF::stream_start: default:
787 this->SamplePos = SampleCount;
788 break;
789 }
790 if (this->SamplePos > this->SamplesTotal) this->SamplePos = this->SamplesTotal;
791
792 unsigned long frame = this->SamplePos / 2048; // to which frame to jump
793 this->FrameOffset = this->SamplePos % 2048; // offset (in sample points) within that frame
794 pCkData->SetPos(FrameTable[frame]); // set chunk pointer to the start of sought frame
795 return this->SamplePos;
796 }
797 else { // not compressed
798 unsigned long orderedBytes = SampleCount * this->FrameSize;
799 unsigned long result = pCkData->SetPos(orderedBytes, Whence);
800 return (result == orderedBytes) ? SampleCount
801 : result / this->FrameSize;
802 }
803 }
804
805 /**
806 * Returns the current position in the sample (in sample points).
807 */
808 unsigned long Sample::GetPos() {
809 if (Compressed) return SamplePos;
810 else return pCkData->GetPos() / FrameSize;
811 }
812
813 /**
814 * Reads \a SampleCount number of sample points from the position stored
815 * in \a pPlaybackState into the buffer pointed by \a pBuffer and moves
816 * the position within the sample respectively, this method honors the
817 * looping informations of the sample (if any). The sample wave stream
818 * will be decompressed on the fly if using a compressed sample. Use this
819 * method if you don't want to load the sample into RAM, thus for disk
820 * streaming. All this methods needs to know to proceed with streaming
821 * for the next time you call this method is stored in \a pPlaybackState.
822 * You have to allocate and initialize the playback_state_t structure by
823 * yourself before you use it to stream a sample:
824 * @code
825 * gig::playback_state_t playbackstate;
826 * playbackstate.position = 0;
827 * playbackstate.reverse = false;
828 * playbackstate.loop_cycles_left = pSample->LoopPlayCount;
829 * @endcode
830 * You don't have to take care of things like if there is actually a loop
831 * defined or if the current read position is located within a loop area.
832 * The method already handles such cases by itself.
833 *
834 * <b>Caution:</b> If you are using more than one streaming thread, you
835 * have to use an external decompression buffer for <b>EACH</b>
836 * streaming thread to avoid race conditions and crashes!
837 *
838 * @param pBuffer destination buffer
839 * @param SampleCount number of sample points to read
840 * @param pPlaybackState will be used to store and reload the playback
841 * state for the next ReadAndLoop() call
842 * @param pDimRgn dimension region with looping information
843 * @param pExternalDecompressionBuffer (optional) external buffer to use for decompression
844 * @returns number of successfully read sample points
845 * @see CreateDecompressionBuffer()
846 */
847 unsigned long Sample::ReadAndLoop(void* pBuffer, unsigned long SampleCount, playback_state_t* pPlaybackState,
848 DimensionRegion* pDimRgn, buffer_t* pExternalDecompressionBuffer) {
849 unsigned long samplestoread = SampleCount, totalreadsamples = 0, readsamples, samplestoloopend;
850 uint8_t* pDst = (uint8_t*) pBuffer;
851
852 SetPos(pPlaybackState->position); // recover position from the last time
853
854 if (pDimRgn->SampleLoops) { // honor looping if there are loop points defined
855
856 const DLS::sample_loop_t& loop = pDimRgn->pSampleLoops[0];
857 const uint32_t loopEnd = loop.LoopStart + loop.LoopLength;
858
859 if (GetPos() <= loopEnd) {
860 switch (loop.LoopType) {
861
862 case loop_type_bidirectional: { //TODO: not tested yet!
863 do {
864 // if not endless loop check if max. number of loop cycles have been passed
865 if (this->LoopPlayCount && !pPlaybackState->loop_cycles_left) break;
866
867 if (!pPlaybackState->reverse) { // forward playback
868 do {
869 samplestoloopend = loopEnd - GetPos();
870 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], Min(samplestoread, samplestoloopend), pExternalDecompressionBuffer);
871 samplestoread -= readsamples;
872 totalreadsamples += readsamples;
873 if (readsamples == samplestoloopend) {
874 pPlaybackState->reverse = true;
875 break;
876 }
877 } while (samplestoread && readsamples);
878 }
879 else { // backward playback
880
881 // as we can only read forward from disk, we have to
882 // determine the end position within the loop first,
883 // read forward from that 'end' and finally after
884 // reading, swap all sample frames so it reflects
885 // backward playback
886
887 unsigned long swapareastart = totalreadsamples;
888 unsigned long loopoffset = GetPos() - loop.LoopStart;
889 unsigned long samplestoreadinloop = Min(samplestoread, loopoffset);
890 unsigned long reverseplaybackend = GetPos() - samplestoreadinloop;
891
892 SetPos(reverseplaybackend);
893
894 // read samples for backward playback
895 do {
896 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], samplestoreadinloop, pExternalDecompressionBuffer);
897 samplestoreadinloop -= readsamples;
898 samplestoread -= readsamples;
899 totalreadsamples += readsamples;
900 } while (samplestoreadinloop && readsamples);
901
902 SetPos(reverseplaybackend); // pretend we really read backwards
903
904 if (reverseplaybackend == loop.LoopStart) {
905 pPlaybackState->loop_cycles_left--;
906 pPlaybackState->reverse = false;
907 }
908
909 // reverse the sample frames for backward playback
910 SwapMemoryArea(&pDst[swapareastart * this->FrameSize], (totalreadsamples - swapareastart) * this->FrameSize, this->FrameSize);
911 }
912 } while (samplestoread && readsamples);
913 break;
914 }
915
916 case loop_type_backward: { // TODO: not tested yet!
917 // forward playback (not entered the loop yet)
918 if (!pPlaybackState->reverse) do {
919 samplestoloopend = loopEnd - GetPos();
920 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], Min(samplestoread, samplestoloopend), pExternalDecompressionBuffer);
921 samplestoread -= readsamples;
922 totalreadsamples += readsamples;
923 if (readsamples == samplestoloopend) {
924 pPlaybackState->reverse = true;
925 break;
926 }
927 } while (samplestoread && readsamples);
928
929 if (!samplestoread) break;
930
931 // as we can only read forward from disk, we have to
932 // determine the end position within the loop first,
933 // read forward from that 'end' and finally after
934 // reading, swap all sample frames so it reflects
935 // backward playback
936
937 unsigned long swapareastart = totalreadsamples;
938 unsigned long loopoffset = GetPos() - loop.LoopStart;
939 unsigned long samplestoreadinloop = (this->LoopPlayCount) ? Min(samplestoread, pPlaybackState->loop_cycles_left * loop.LoopLength - loopoffset)
940 : samplestoread;
941 unsigned long reverseplaybackend = loop.LoopStart + Abs((loopoffset - samplestoreadinloop) % loop.LoopLength);
942
943 SetPos(reverseplaybackend);
944
945 // read samples for backward playback
946 do {
947 // if not endless loop check if max. number of loop cycles have been passed
948 if (this->LoopPlayCount && !pPlaybackState->loop_cycles_left) break;
949 samplestoloopend = loopEnd - GetPos();
950 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], Min(samplestoreadinloop, samplestoloopend), pExternalDecompressionBuffer);
951 samplestoreadinloop -= readsamples;
952 samplestoread -= readsamples;
953 totalreadsamples += readsamples;
954 if (readsamples == samplestoloopend) {
955 pPlaybackState->loop_cycles_left--;
956 SetPos(loop.LoopStart);
957 }
958 } while (samplestoreadinloop && readsamples);
959
960 SetPos(reverseplaybackend); // pretend we really read backwards
961
962 // reverse the sample frames for backward playback
963 SwapMemoryArea(&pDst[swapareastart * this->FrameSize], (totalreadsamples - swapareastart) * this->FrameSize, this->FrameSize);
964 break;
965 }
966
967 default: case loop_type_normal: {
968 do {
969 // if not endless loop check if max. number of loop cycles have been passed
970 if (this->LoopPlayCount && !pPlaybackState->loop_cycles_left) break;
971 samplestoloopend = loopEnd - GetPos();
972 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], Min(samplestoread, samplestoloopend), pExternalDecompressionBuffer);
973 samplestoread -= readsamples;
974 totalreadsamples += readsamples;
975 if (readsamples == samplestoloopend) {
976 pPlaybackState->loop_cycles_left--;
977 SetPos(loop.LoopStart);
978 }
979 } while (samplestoread && readsamples);
980 break;
981 }
982 }
983 }
984 }
985
986 // read on without looping
987 if (samplestoread) do {
988 readsamples = Read(&pDst[totalreadsamples * this->FrameSize], samplestoread, pExternalDecompressionBuffer);
989 samplestoread -= readsamples;
990 totalreadsamples += readsamples;
991 } while (readsamples && samplestoread);
992
993 // store current position
994 pPlaybackState->position = GetPos();
995
996 return totalreadsamples;
997 }
998
999 /**
1000 * Reads \a SampleCount number of sample points from the current
1001 * position into the buffer pointed by \a pBuffer and increments the
1002 * position within the sample. The sample wave stream will be
1003 * decompressed on the fly if using a compressed sample. Use this method
1004 * and <i>SetPos()</i> if you don't want to load the sample into RAM,
1005 * thus for disk streaming.
1006 *
1007 * <b>Caution:</b> If you are using more than one streaming thread, you
1008 * have to use an external decompression buffer for <b>EACH</b>
1009 * streaming thread to avoid race conditions and crashes!
1010 *
1011 * For 16 bit samples, the data in the buffer will be int16_t
1012 * (using native endianness). For 24 bit, the buffer will
1013 * contain three bytes per sample, little-endian.
1014 *
1015 * @param pBuffer destination buffer
1016 * @param SampleCount number of sample points to read
1017 * @param pExternalDecompressionBuffer (optional) external buffer to use for decompression
1018 * @returns number of successfully read sample points
1019 * @see SetPos(), CreateDecompressionBuffer()
1020 */
1021 unsigned long Sample::Read(void* pBuffer, unsigned long SampleCount, buffer_t* pExternalDecompressionBuffer) {
1022 if (SampleCount == 0) return 0;
1023 if (!Compressed) {
1024 if (BitDepth == 24) {
1025 return pCkData->Read(pBuffer, SampleCount * FrameSize, 1) / FrameSize;
1026 }
1027 else { // 16 bit
1028 // (pCkData->Read does endian correction)
1029 return Channels == 2 ? pCkData->Read(pBuffer, SampleCount << 1, 2) >> 1
1030 : pCkData->Read(pBuffer, SampleCount, 2);
1031 }
1032 }
1033 else {
1034 if (this->SamplePos >= this->SamplesTotal) return 0;
1035 //TODO: efficiency: maybe we should test for an average compression rate
1036 unsigned long assumedsize = GuessSize(SampleCount),
1037 remainingbytes = 0, // remaining bytes in the local buffer
1038 remainingsamples = SampleCount,
1039 copysamples, skipsamples,
1040 currentframeoffset = this->FrameOffset; // offset in current sample frame since last Read()
1041 this->FrameOffset = 0;
1042
1043 buffer_t* pDecompressionBuffer = (pExternalDecompressionBuffer) ? pExternalDecompressionBuffer : &InternalDecompressionBuffer;
1044
1045 // if decompression buffer too small, then reduce amount of samples to read
1046 if (pDecompressionBuffer->Size < assumedsize) {
1047 std::cerr << "gig::Read(): WARNING - decompression buffer size too small!" << std::endl;
1048 SampleCount = WorstCaseMaxSamples(pDecompressionBuffer);
1049 remainingsamples = SampleCount;
1050 assumedsize = GuessSize(SampleCount);
1051 }
1052
1053 unsigned char* pSrc = (unsigned char*) pDecompressionBuffer->pStart;
1054 int16_t* pDst = static_cast<int16_t*>(pBuffer);
1055 uint8_t* pDst24 = static_cast<uint8_t*>(pBuffer);
1056 remainingbytes = pCkData->Read(pSrc, assumedsize, 1);
1057
1058 while (remainingsamples && remainingbytes) {
1059 unsigned long framesamples = SamplesPerFrame;
1060 unsigned long framebytes, rightChannelOffset = 0, nextFrameOffset;
1061
1062 int mode_l = *pSrc++, mode_r = 0;
1063
1064 if (Channels == 2) {
1065 mode_r = *pSrc++;
1066 framebytes = bytesPerFrame[mode_l] + bytesPerFrame[mode_r] + 2;
1067 rightChannelOffset = bytesPerFrameNoHdr[mode_l];
1068 nextFrameOffset = rightChannelOffset + bytesPerFrameNoHdr[mode_r];
1069 if (remainingbytes < framebytes) { // last frame in sample
1070 framesamples = SamplesInLastFrame;
1071 if (mode_l == 4 && (framesamples & 1)) {
1072 rightChannelOffset = ((framesamples + 1) * bitsPerSample[mode_l]) >> 3;
1073 }
1074 else {
1075 rightChannelOffset = (framesamples * bitsPerSample[mode_l]) >> 3;
1076 }
1077 }
1078 }
1079 else {
1080 framebytes = bytesPerFrame[mode_l] + 1;
1081 nextFrameOffset = bytesPerFrameNoHdr[mode_l];
1082 if (remainingbytes < framebytes) {
1083 framesamples = SamplesInLastFrame;
1084 }
1085 }
1086
1087 // determine how many samples in this frame to skip and read
1088 if (currentframeoffset + remainingsamples >= framesamples) {
1089 if (currentframeoffset <= framesamples) {
1090 copysamples = framesamples - currentframeoffset;
1091 skipsamples = currentframeoffset;
1092 }
1093 else {
1094 copysamples = 0;
1095 skipsamples = framesamples;
1096 }
1097 }
1098 else {
1099 // This frame has enough data for pBuffer, but not
1100 // all of the frame is needed. Set file position
1101 // to start of this frame for next call to Read.
1102 copysamples = remainingsamples;
1103 skipsamples = currentframeoffset;
1104 pCkData->SetPos(remainingbytes, RIFF::stream_backward);
1105 this->FrameOffset = currentframeoffset + copysamples;
1106 }
1107 remainingsamples -= copysamples;
1108
1109 if (remainingbytes > framebytes) {
1110 remainingbytes -= framebytes;
1111 if (remainingsamples == 0 &&
1112 currentframeoffset + copysamples == framesamples) {
1113 // This frame has enough data for pBuffer, and
1114 // all of the frame is needed. Set file
1115 // position to start of next frame for next
1116 // call to Read. FrameOffset is 0.
1117 pCkData->SetPos(remainingbytes, RIFF::stream_backward);
1118 }
1119 }
1120 else remainingbytes = 0;
1121
1122 currentframeoffset -= skipsamples;
1123
1124 if (copysamples == 0) {
1125 // skip this frame
1126 pSrc += framebytes - Channels;
1127 }
1128 else {
1129 const unsigned char* const param_l = pSrc;
1130 if (BitDepth == 24) {
1131 if (mode_l != 2) pSrc += 12;
1132
1133 if (Channels == 2) { // Stereo
1134 const unsigned char* const param_r = pSrc;
1135 if (mode_r != 2) pSrc += 12;
1136
1137 Decompress24(mode_l, param_l, 6, pSrc, pDst24,
1138 skipsamples, copysamples, TruncatedBits);
1139 Decompress24(mode_r, param_r, 6, pSrc + rightChannelOffset, pDst24 + 3,
1140 skipsamples, copysamples, TruncatedBits);
1141 pDst24 += copysamples * 6;
1142 }
1143 else { // Mono
1144 Decompress24(mode_l, param_l, 3, pSrc, pDst24,
1145 skipsamples, copysamples, TruncatedBits);
1146 pDst24 += copysamples * 3;
1147 }
1148 }
1149 else { // 16 bit
1150 if (mode_l) pSrc += 4;
1151
1152 int step;
1153 if (Channels == 2) { // Stereo
1154 const unsigned char* const param_r = pSrc;
1155 if (mode_r) pSrc += 4;
1156
1157 step = (2 - mode_l) + (2 - mode_r);
1158 Decompress16(mode_l, param_l, step, 2, pSrc, pDst, skipsamples, copysamples);
1159 Decompress16(mode_r, param_r, step, 2, pSrc + (2 - mode_l), pDst + 1,
1160 skipsamples, copysamples);
1161 pDst += copysamples << 1;
1162 }
1163 else { // Mono
1164 step = 2 - mode_l;
1165 Decompress16(mode_l, param_l, step, 1, pSrc, pDst, skipsamples, copysamples);
1166 pDst += copysamples;
1167 }
1168 }
1169 pSrc += nextFrameOffset;
1170 }
1171
1172 // reload from disk to local buffer if needed
1173 if (remainingsamples && remainingbytes < WorstCaseFrameSize && pCkData->GetState() == RIFF::stream_ready) {
1174 assumedsize = GuessSize(remainingsamples);
1175 pCkData->SetPos(remainingbytes, RIFF::stream_backward);
1176 if (pCkData->RemainingBytes() < assumedsize) assumedsize = pCkData->RemainingBytes();
1177 remainingbytes = pCkData->Read(pDecompressionBuffer->pStart, assumedsize, 1);
1178 pSrc = (unsigned char*) pDecompressionBuffer->pStart;
1179 }
1180 } // while
1181
1182 this->SamplePos += (SampleCount - remainingsamples);
1183 if (this->SamplePos > this->SamplesTotal) this->SamplePos = this->SamplesTotal;
1184 return (SampleCount - remainingsamples);
1185 }
1186 }
1187
1188 /** @brief Write sample wave data.
1189 *
1190 * Writes \a SampleCount number of sample points from the buffer pointed
1191 * by \a pBuffer and increments the position within the sample. Use this
1192 * method to directly write the sample data to disk, i.e. if you don't
1193 * want or cannot load the whole sample data into RAM.
1194 *
1195 * You have to Resize() the sample to the desired size and call
1196 * File::Save() <b>before</b> using Write().
1197 *
1198 * Note: there is currently no support for writing compressed samples.
1199 *
1200 * For 16 bit samples, the data in the source buffer should be
1201 * int16_t (using native endianness). For 24 bit, the buffer
1202 * should contain three bytes per sample, little-endian.
1203 *
1204 * @param pBuffer - source buffer
1205 * @param SampleCount - number of sample points to write
1206 * @throws DLS::Exception if current sample size is too small
1207 * @throws gig::Exception if sample is compressed
1208 * @see DLS::LoadSampleData()
1209 */
1210 unsigned long Sample::Write(void* pBuffer, unsigned long SampleCount) {
1211 if (Compressed) throw gig::Exception("There is no support for writing compressed gig samples (yet)");
1212
1213 // if this is the first write in this sample, reset the
1214 // checksum calculator
1215 if (pCkData->GetPos() == 0) {
1216 __resetCRC(crc);
1217 }
1218 if (GetSize() < SampleCount) throw Exception("Could not write sample data, current sample size to small");
1219 unsigned long res;
1220 if (BitDepth == 24) {
1221 res = pCkData->Write(pBuffer, SampleCount * FrameSize, 1) / FrameSize;
1222 } else { // 16 bit
1223 res = Channels == 2 ? pCkData->Write(pBuffer, SampleCount << 1, 2) >> 1
1224 : pCkData->Write(pBuffer, SampleCount, 2);
1225 }
1226 __calculateCRC((unsigned char *)pBuffer, SampleCount * FrameSize, crc);
1227
1228 // if this is the last write, update the checksum chunk in the
1229 // file
1230 if (pCkData->GetPos() == pCkData->GetSize()) {
1231 File* pFile = static_cast<File*>(GetParent());
1232 pFile->SetSampleChecksum(this, __encodeCRC(crc));
1233 }
1234 return res;
1235 }
1236
1237 /**
1238 * Allocates a decompression buffer for streaming (compressed) samples
1239 * with Sample::Read(). If you are using more than one streaming thread
1240 * in your application you <b>HAVE</b> to create a decompression buffer
1241 * for <b>EACH</b> of your streaming threads and provide it with the
1242 * Sample::Read() call in order to avoid race conditions and crashes.
1243 *
1244 * You should free the memory occupied by the allocated buffer(s) once
1245 * you don't need one of your streaming threads anymore by calling
1246 * DestroyDecompressionBuffer().
1247 *
1248 * @param MaxReadSize - the maximum size (in sample points) you ever
1249 * expect to read with one Read() call
1250 * @returns allocated decompression buffer
1251 * @see DestroyDecompressionBuffer()
1252 */
1253 buffer_t Sample::CreateDecompressionBuffer(unsigned long MaxReadSize) {
1254 buffer_t result;
1255 const double worstCaseHeaderOverhead =
1256 (256.0 /*frame size*/ + 12.0 /*header*/ + 2.0 /*compression type flag (stereo)*/) / 256.0;
1257 result.Size = (unsigned long) (double(MaxReadSize) * 3.0 /*(24 Bit)*/ * 2.0 /*stereo*/ * worstCaseHeaderOverhead);
1258 result.pStart = new int8_t[result.Size];
1259 result.NullExtensionSize = 0;
1260 return result;
1261 }
1262
1263 /**
1264 * Free decompression buffer, previously created with
1265 * CreateDecompressionBuffer().
1266 *
1267 * @param DecompressionBuffer - previously allocated decompression
1268 * buffer to free
1269 */
1270 void Sample::DestroyDecompressionBuffer(buffer_t& DecompressionBuffer) {
1271 if (DecompressionBuffer.Size && DecompressionBuffer.pStart) {
1272 delete[] (int8_t*) DecompressionBuffer.pStart;
1273 DecompressionBuffer.pStart = NULL;
1274 DecompressionBuffer.Size = 0;
1275 DecompressionBuffer.NullExtensionSize = 0;
1276 }
1277 }
1278
1279 /**
1280 * Returns pointer to the Group this Sample belongs to. In the .gig
1281 * format a sample always belongs to one group. If it wasn't explicitly
1282 * assigned to a certain group, it will be automatically assigned to a
1283 * default group.
1284 *
1285 * @returns Sample's Group (never NULL)
1286 */
1287 Group* Sample::GetGroup() const {
1288 return pGroup;
1289 }
1290
1291 Sample::~Sample() {
1292 Instances--;
1293 if (!Instances && InternalDecompressionBuffer.Size) {
1294 delete[] (unsigned char*) InternalDecompressionBuffer.pStart;
1295 InternalDecompressionBuffer.pStart = NULL;
1296 InternalDecompressionBuffer.Size = 0;
1297 }
1298 if (FrameTable) delete[] FrameTable;
1299 if (RAMCache.pStart) delete[] (int8_t*) RAMCache.pStart;
1300 }
1301
1302
1303
1304 // *************** DimensionRegion ***************
1305 // *
1306
1307 uint DimensionRegion::Instances = 0;
1308 DimensionRegion::VelocityTableMap* DimensionRegion::pVelocityTables = NULL;
1309
1310 DimensionRegion::DimensionRegion(Region* pParent, RIFF::List* _3ewl) : DLS::Sampler(_3ewl) {
1311 Instances++;
1312
1313 pSample = NULL;
1314 pRegion = pParent;
1315
1316 if (_3ewl->GetSubChunk(CHUNK_ID_WSMP)) memcpy(&Crossfade, &SamplerOptions, 4);
1317 else memset(&Crossfade, 0, 4);
1318
1319 if (!pVelocityTables) pVelocityTables = new VelocityTableMap;
1320
1321 RIFF::Chunk* _3ewa = _3ewl->GetSubChunk(CHUNK_ID_3EWA);
1322 if (_3ewa) { // if '3ewa' chunk exists
1323 _3ewa->ReadInt32(); // unknown, always == chunk size ?
1324 LFO3Frequency = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1325 EG3Attack = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1326 _3ewa->ReadInt16(); // unknown
1327 LFO1InternalDepth = _3ewa->ReadUint16();
1328 _3ewa->ReadInt16(); // unknown
1329 LFO3InternalDepth = _3ewa->ReadInt16();
1330 _3ewa->ReadInt16(); // unknown
1331 LFO1ControlDepth = _3ewa->ReadUint16();
1332 _3ewa->ReadInt16(); // unknown
1333 LFO3ControlDepth = _3ewa->ReadInt16();
1334 EG1Attack = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1335 EG1Decay1 = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1336 _3ewa->ReadInt16(); // unknown
1337 EG1Sustain = _3ewa->ReadUint16();
1338 EG1Release = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1339 EG1Controller = DecodeLeverageController(static_cast<_lev_ctrl_t>(_3ewa->ReadUint8()));
1340 uint8_t eg1ctrloptions = _3ewa->ReadUint8();
1341 EG1ControllerInvert = eg1ctrloptions & 0x01;
1342 EG1ControllerAttackInfluence = GIG_EG_CTR_ATTACK_INFLUENCE_EXTRACT(eg1ctrloptions);
1343 EG1ControllerDecayInfluence = GIG_EG_CTR_DECAY_INFLUENCE_EXTRACT(eg1ctrloptions);
1344 EG1ControllerReleaseInfluence = GIG_EG_CTR_RELEASE_INFLUENCE_EXTRACT(eg1ctrloptions);
1345 EG2Controller = DecodeLeverageController(static_cast<_lev_ctrl_t>(_3ewa->ReadUint8()));
1346 uint8_t eg2ctrloptions = _3ewa->ReadUint8();
1347 EG2ControllerInvert = eg2ctrloptions & 0x01;
1348 EG2ControllerAttackInfluence = GIG_EG_CTR_ATTACK_INFLUENCE_EXTRACT(eg2ctrloptions);
1349 EG2ControllerDecayInfluence = GIG_EG_CTR_DECAY_INFLUENCE_EXTRACT(eg2ctrloptions);
1350 EG2ControllerReleaseInfluence = GIG_EG_CTR_RELEASE_INFLUENCE_EXTRACT(eg2ctrloptions);
1351 LFO1Frequency = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1352 EG2Attack = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1353 EG2Decay1 = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1354 _3ewa->ReadInt16(); // unknown
1355 EG2Sustain = _3ewa->ReadUint16();
1356 EG2Release = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1357 _3ewa->ReadInt16(); // unknown
1358 LFO2ControlDepth = _3ewa->ReadUint16();
1359 LFO2Frequency = (double) GIG_EXP_DECODE(_3ewa->ReadInt32());
1360 _3ewa->ReadInt16(); // unknown
1361 LFO2InternalDepth = _3ewa->ReadUint16();
1362 int32_t eg1decay2 = _3ewa->ReadInt32();
1363 EG1Decay2 = (double) GIG_EXP_DECODE(eg1decay2);
1364 EG1InfiniteSustain = (eg1decay2 == 0x7fffffff);
1365 _3ewa->ReadInt16(); // unknown
1366 EG1PreAttack = _3ewa->ReadUint16();
1367 int32_t eg2decay2 = _3ewa->ReadInt32();
1368 EG2Decay2 = (double) GIG_EXP_DECODE(eg2decay2);
1369 EG2InfiniteSustain = (eg2decay2 == 0x7fffffff);
1370 _3ewa->ReadInt16(); // unknown
1371 EG2PreAttack = _3ewa->ReadUint16();
1372 uint8_t velocityresponse = _3ewa->ReadUint8();
1373 if (velocityresponse < 5) {
1374 VelocityResponseCurve = curve_type_nonlinear;
1375 VelocityResponseDepth = velocityresponse;
1376 } else if (velocityresponse < 10) {
1377 VelocityResponseCurve = curve_type_linear;
1378 VelocityResponseDepth = velocityresponse - 5;
1379 } else if (velocityresponse < 15) {
1380 VelocityResponseCurve = curve_type_special;
1381 VelocityResponseDepth = velocityresponse - 10;
1382 } else {
1383 VelocityResponseCurve = curve_type_unknown;
1384 VelocityResponseDepth = 0;
1385 }
1386 uint8_t releasevelocityresponse = _3ewa->ReadUint8();
1387 if (releasevelocityresponse < 5) {
1388 ReleaseVelocityResponseCurve = curve_type_nonlinear;
1389 ReleaseVelocityResponseDepth = releasevelocityresponse;
1390 } else if (releasevelocityresponse < 10) {
1391 ReleaseVelocityResponseCurve = curve_type_linear;
1392 ReleaseVelocityResponseDepth = releasevelocityresponse - 5;
1393 } else if (releasevelocityresponse < 15) {
1394 ReleaseVelocityResponseCurve = curve_type_special;
1395 ReleaseVelocityResponseDepth = releasevelocityresponse - 10;
1396 } else {
1397 ReleaseVelocityResponseCurve = curve_type_unknown;
1398 ReleaseVelocityResponseDepth = 0;
1399 }
1400 VelocityResponseCurveScaling = _3ewa->ReadUint8();
1401 AttenuationControllerThreshold = _3ewa->ReadInt8();
1402 _3ewa->ReadInt32(); // unknown
1403 SampleStartOffset = (uint16_t) _3ewa->ReadInt16();
1404 _3ewa->ReadInt16(); // unknown
1405 uint8_t pitchTrackDimensionBypass = _3ewa->ReadInt8();
1406 PitchTrack = GIG_PITCH_TRACK_EXTRACT(pitchTrackDimensionBypass);
1407 if (pitchTrackDimensionBypass & 0x10) DimensionBypass = dim_bypass_ctrl_94;
1408 else if (pitchTrackDimensionBypass & 0x20) DimensionBypass = dim_bypass_ctrl_95;
1409 else DimensionBypass = dim_bypass_ctrl_none;
1410 uint8_t pan = _3ewa->ReadUint8();
1411 Pan = (pan < 64) ? pan : -((int)pan - 63); // signed 7 bit -> signed 8 bit
1412 SelfMask = _3ewa->ReadInt8() & 0x01;
1413 _3ewa->ReadInt8(); // unknown
1414 uint8_t lfo3ctrl = _3ewa->ReadUint8();
1415 LFO3Controller = static_cast<lfo3_ctrl_t>(lfo3ctrl & 0x07); // lower 3 bits
1416 LFO3Sync = lfo3ctrl & 0x20; // bit 5
1417 InvertAttenuationController = lfo3ctrl & 0x80; // bit 7
1418 AttenuationController = DecodeLeverageController(static_cast<_lev_ctrl_t>(_3ewa->ReadUint8()));
1419 uint8_t lfo2ctrl = _3ewa->ReadUint8();
1420 LFO2Controller = static_cast<lfo2_ctrl_t>(lfo2ctrl & 0x07); // lower 3 bits
1421 LFO2FlipPhase = lfo2ctrl & 0x80; // bit 7
1422 LFO2Sync = lfo2ctrl & 0x20; // bit 5
1423 bool extResonanceCtrl = lfo2ctrl & 0x40; // bit 6
1424 uint8_t lfo1ctrl = _3ewa->ReadUint8();
1425 LFO1Controller = static_cast<lfo1_ctrl_t>(lfo1ctrl & 0x07); // lower 3 bits
1426 LFO1FlipPhase = lfo1ctrl & 0x80; // bit 7
1427 LFO1Sync = lfo1ctrl & 0x40; // bit 6
1428 VCFResonanceController = (extResonanceCtrl) ? static_cast<vcf_res_ctrl_t>(GIG_VCF_RESONANCE_CTRL_EXTRACT(lfo1ctrl))
1429 : vcf_res_ctrl_none;
1430 uint16_t eg3depth = _3ewa->ReadUint16();
1431 EG3Depth = (eg3depth <= 1200) ? eg3depth /* positives */
1432 : (-1) * (int16_t) ((eg3depth ^ 0xffff) + 1); /* binary complementary for negatives */
1433 _3ewa->ReadInt16(); // unknown
1434 ChannelOffset = _3ewa->ReadUint8() / 4;
1435 uint8_t regoptions = _3ewa->ReadUint8();
1436 MSDecode = regoptions & 0x01; // bit 0
1437 SustainDefeat = regoptions & 0x02; // bit 1
1438 _3ewa->ReadInt16(); // unknown
1439 VelocityUpperLimit = _3ewa->ReadInt8();
1440 _3ewa->ReadInt8(); // unknown
1441 _3ewa->ReadInt16(); // unknown
1442 ReleaseTriggerDecay = _3ewa->ReadUint8(); // release trigger decay
1443 _3ewa->ReadInt8(); // unknown
1444 _3ewa->ReadInt8(); // unknown
1445 EG1Hold = _3ewa->ReadUint8() & 0x80; // bit 7
1446 uint8_t vcfcutoff = _3ewa->ReadUint8();
1447 VCFEnabled = vcfcutoff & 0x80; // bit 7
1448 VCFCutoff = vcfcutoff & 0x7f; // lower 7 bits
1449 VCFCutoffController = static_cast<vcf_cutoff_ctrl_t>(_3ewa->ReadUint8());
1450 uint8_t vcfvelscale = _3ewa->ReadUint8();
1451 VCFCutoffControllerInvert = vcfvelscale & 0x80; // bit 7
1452 VCFVelocityScale = vcfvelscale & 0x7f; // lower 7 bits
1453 _3ewa->ReadInt8(); // unknown
1454 uint8_t vcfresonance = _3ewa->ReadUint8();
1455 VCFResonance = vcfresonance & 0x7f; // lower 7 bits
1456 VCFResonanceDynamic = !(vcfresonance & 0x80); // bit 7
1457 uint8_t vcfbreakpoint = _3ewa->ReadUint8();
1458 VCFKeyboardTracking = vcfbreakpoint & 0x80; // bit 7
1459 VCFKeyboardTrackingBreakpoint = vcfbreakpoint & 0x7f; // lower 7 bits
1460 uint8_t vcfvelocity = _3ewa->ReadUint8();
1461 VCFVelocityDynamicRange = vcfvelocity % 5;
1462 VCFVelocityCurve = static_cast<curve_type_t>(vcfvelocity / 5);
1463 VCFType = static_cast<vcf_type_t>(_3ewa->ReadUint8());
1464 if (VCFType == vcf_type_lowpass) {
1465 if (lfo3ctrl & 0x40) // bit 6
1466 VCFType = vcf_type_lowpassturbo;
1467 }
1468 if (_3ewa->RemainingBytes() >= 8) {
1469 _3ewa->Read(DimensionUpperLimits, 1, 8);
1470 } else {
1471 memset(DimensionUpperLimits, 0, 8);
1472 }
1473 } else { // '3ewa' chunk does not exist yet
1474 // use default values
1475 LFO3Frequency = 1.0;
1476 EG3Attack = 0.0;
1477 LFO1InternalDepth = 0;
1478 LFO3InternalDepth = 0;
1479 LFO1ControlDepth = 0;
1480 LFO3ControlDepth = 0;
1481 EG1Attack = 0.0;
1482 EG1Decay1 = 0.005;
1483 EG1Sustain = 1000;
1484 EG1Release = 0.3;
1485 EG1Controller.type = eg1_ctrl_t::type_none;
1486 EG1Controller.controller_number = 0;
1487 EG1ControllerInvert = false;
1488 EG1ControllerAttackInfluence = 0;
1489 EG1ControllerDecayInfluence = 0;
1490 EG1ControllerReleaseInfluence = 0;
1491 EG2Controller.type = eg2_ctrl_t::type_none;
1492 EG2Controller.controller_number = 0;
1493 EG2ControllerInvert = false;
1494 EG2ControllerAttackInfluence = 0;
1495 EG2ControllerDecayInfluence = 0;
1496 EG2ControllerReleaseInfluence = 0;
1497 LFO1Frequency = 1.0;
1498 EG2Attack = 0.0;
1499 EG2Decay1 = 0.005;
1500 EG2Sustain = 1000;
1501 EG2Release = 0.3;
1502 LFO2ControlDepth = 0;
1503 LFO2Frequency = 1.0;
1504 LFO2InternalDepth = 0;
1505 EG1Decay2 = 0.0;
1506 EG1InfiniteSustain = true;
1507 EG1PreAttack = 0;
1508 EG2Decay2 = 0.0;
1509 EG2InfiniteSustain = true;
1510 EG2PreAttack = 0;
1511 VelocityResponseCurve = curve_type_nonlinear;
1512 VelocityResponseDepth = 3;
1513 ReleaseVelocityResponseCurve = curve_type_nonlinear;
1514 ReleaseVelocityResponseDepth = 3;
1515 VelocityResponseCurveScaling = 32;
1516 AttenuationControllerThreshold = 0;
1517 SampleStartOffset = 0;
1518 PitchTrack = true;
1519 DimensionBypass = dim_bypass_ctrl_none;
1520 Pan = 0;
1521 SelfMask = true;
1522 LFO3Controller = lfo3_ctrl_modwheel;
1523 LFO3Sync = false;
1524 InvertAttenuationController = false;
1525 AttenuationController.type = attenuation_ctrl_t::type_none;
1526 AttenuationController.controller_number = 0;
1527 LFO2Controller = lfo2_ctrl_internal;
1528 LFO2FlipPhase = false;
1529 LFO2Sync = false;
1530 LFO1Controller = lfo1_ctrl_internal;
1531 LFO1FlipPhase = false;
1532 LFO1Sync = false;
1533 VCFResonanceController = vcf_res_ctrl_none;
1534 EG3Depth = 0;
1535 ChannelOffset = 0;
1536 MSDecode = false;
1537 SustainDefeat = false;
1538 VelocityUpperLimit = 0;
1539 ReleaseTriggerDecay = 0;
1540 EG1Hold = false;
1541 VCFEnabled = false;
1542 VCFCutoff = 0;
1543 VCFCutoffController = vcf_cutoff_ctrl_none;
1544 VCFCutoffControllerInvert = false;
1545 VCFVelocityScale = 0;
1546 VCFResonance = 0;
1547 VCFResonanceDynamic = false;
1548 VCFKeyboardTracking = false;
1549 VCFKeyboardTrackingBreakpoint = 0;
1550 VCFVelocityDynamicRange = 0x04;
1551 VCFVelocityCurve = curve_type_linear;
1552 VCFType = vcf_type_lowpass;
1553 memset(DimensionUpperLimits, 127, 8);
1554 }
1555
1556 pVelocityAttenuationTable = GetVelocityTable(VelocityResponseCurve,
1557 VelocityResponseDepth,
1558 VelocityResponseCurveScaling);
1559
1560 pVelocityReleaseTable = GetReleaseVelocityTable(
1561 ReleaseVelocityResponseCurve,
1562 ReleaseVelocityResponseDepth
1563 );
1564
1565 pVelocityCutoffTable = GetCutoffVelocityTable(VCFVelocityCurve,
1566 VCFVelocityDynamicRange,
1567 VCFVelocityScale,
1568 VCFCutoffController);
1569
1570 SampleAttenuation = pow(10.0, -Gain / (20.0 * 655360));
1571 VelocityTable = 0;
1572 }
1573
1574 /*
1575 * Constructs a DimensionRegion by copying all parameters from
1576 * another DimensionRegion
1577 */
1578 DimensionRegion::DimensionRegion(RIFF::List* _3ewl, const DimensionRegion& src) : DLS::Sampler(_3ewl) {
1579 Instances++;
1580 *this = src; // default memberwise shallow copy of all parameters
1581 pParentList = _3ewl; // restore the chunk pointer
1582
1583 // deep copy of owned structures
1584 if (src.VelocityTable) {
1585 VelocityTable = new uint8_t[128];
1586 for (int k = 0 ; k < 128 ; k++)
1587 VelocityTable[k] = src.VelocityTable[k];
1588 }
1589 if (src.pSampleLoops) {
1590 pSampleLoops = new DLS::sample_loop_t[src.SampleLoops];
1591 for (int k = 0 ; k < src.SampleLoops ; k++)
1592 pSampleLoops[k] = src.pSampleLoops[k];
1593 }
1594 }
1595
1596 /**
1597 * Updates the respective member variable and updates @c SampleAttenuation
1598 * which depends on this value.
1599 */
1600 void DimensionRegion::SetGain(int32_t gain) {
1601 DLS::Sampler::SetGain(gain);
1602 SampleAttenuation = pow(10.0, -Gain / (20.0 * 655360));
1603 }
1604
1605 /**
1606 * Apply dimension region settings to the respective RIFF chunks. You
1607 * have to call File::Save() to make changes persistent.
1608 *
1609 * Usually there is absolutely no need to call this method explicitly.
1610 * It will be called automatically when File::Save() was called.
1611 */
1612 void DimensionRegion::UpdateChunks() {
1613 // first update base class's chunk
1614 DLS::Sampler::UpdateChunks();
1615
1616 RIFF::Chunk* wsmp = pParentList->GetSubChunk(CHUNK_ID_WSMP);
1617 uint8_t* pData = (uint8_t*) wsmp->LoadChunkData();
1618 pData[12] = Crossfade.in_start;
1619 pData[13] = Crossfade.in_end;
1620 pData[14] = Crossfade.out_start;
1621 pData[15] = Crossfade.out_end;
1622
1623 // make sure '3ewa' chunk exists
1624 RIFF::Chunk* _3ewa = pParentList->GetSubChunk(CHUNK_ID_3EWA);
1625 if (!_3ewa) {
1626 File* pFile = (File*) GetParent()->GetParent()->GetParent();
1627 bool version3 = pFile->pVersion && pFile->pVersion->major == 3;
1628 _3ewa = pParentList->AddSubChunk(CHUNK_ID_3EWA, version3 ? 148 : 140);
1629 }
1630 pData = (uint8_t*) _3ewa->LoadChunkData();
1631
1632 // update '3ewa' chunk with DimensionRegion's current settings
1633
1634 const uint32_t chunksize = _3ewa->GetNewSize();
1635 store32(&pData[0], chunksize); // unknown, always chunk size?
1636
1637 const int32_t lfo3freq = (int32_t) GIG_EXP_ENCODE(LFO3Frequency);
1638 store32(&pData[4], lfo3freq);
1639
1640 const int32_t eg3attack = (int32_t) GIG_EXP_ENCODE(EG3Attack);
1641 store32(&pData[8], eg3attack);
1642
1643 // next 2 bytes unknown
1644
1645 store16(&pData[14], LFO1InternalDepth);
1646
1647 // next 2 bytes unknown
1648
1649 store16(&pData[18], LFO3InternalDepth);
1650
1651 // next 2 bytes unknown
1652
1653 store16(&pData[22], LFO1ControlDepth);
1654
1655 // next 2 bytes unknown
1656
1657 store16(&pData[26], LFO3ControlDepth);
1658
1659 const int32_t eg1attack = (int32_t) GIG_EXP_ENCODE(EG1Attack);
1660 store32(&pData[28], eg1attack);
1661
1662 const int32_t eg1decay1 = (int32_t) GIG_EXP_ENCODE(EG1Decay1);
1663 store32(&pData[32], eg1decay1);
1664
1665 // next 2 bytes unknown
1666
1667 store16(&pData[38], EG1Sustain);
1668
1669 const int32_t eg1release = (int32_t) GIG_EXP_ENCODE(EG1Release);
1670 store32(&pData[40], eg1release);
1671
1672 const uint8_t eg1ctl = (uint8_t) EncodeLeverageController(EG1Controller);
1673 pData[44] = eg1ctl;
1674
1675 const uint8_t eg1ctrloptions =
1676 (EG1ControllerInvert ? 0x01 : 0x00) |
1677 GIG_EG_CTR_ATTACK_INFLUENCE_ENCODE(EG1ControllerAttackInfluence) |
1678 GIG_EG_CTR_DECAY_INFLUENCE_ENCODE(EG1ControllerDecayInfluence) |
1679 GIG_EG_CTR_RELEASE_INFLUENCE_ENCODE(EG1ControllerReleaseInfluence);
1680 pData[45] = eg1ctrloptions;
1681
1682 const uint8_t eg2ctl = (uint8_t) EncodeLeverageController(EG2Controller);
1683 pData[46] = eg2ctl;
1684
1685 const uint8_t eg2ctrloptions =
1686 (EG2ControllerInvert ? 0x01 : 0x00) |
1687 GIG_EG_CTR_ATTACK_INFLUENCE_ENCODE(EG2ControllerAttackInfluence) |
1688 GIG_EG_CTR_DECAY_INFLUENCE_ENCODE(EG2ControllerDecayInfluence) |
1689 GIG_EG_CTR_RELEASE_INFLUENCE_ENCODE(EG2ControllerReleaseInfluence);
1690 pData[47] = eg2ctrloptions;
1691
1692 const int32_t lfo1freq = (int32_t) GIG_EXP_ENCODE(LFO1Frequency);
1693 store32(&pData[48], lfo1freq);
1694
1695 const int32_t eg2attack = (int32_t) GIG_EXP_ENCODE(EG2Attack);
1696 store32(&pData[52], eg2attack);
1697
1698 const int32_t eg2decay1 = (int32_t) GIG_EXP_ENCODE(EG2Decay1);
1699 store32(&pData[56], eg2decay1);
1700
1701 // next 2 bytes unknown
1702
1703 store16(&pData[62], EG2Sustain);
1704
1705 const int32_t eg2release = (int32_t) GIG_EXP_ENCODE(EG2Release);
1706 store32(&pData[64], eg2release);
1707
1708 // next 2 bytes unknown
1709
1710 store16(&pData[70], LFO2ControlDepth);
1711
1712 const int32_t lfo2freq = (int32_t) GIG_EXP_ENCODE(LFO2Frequency);
1713 store32(&pData[72], lfo2freq);
1714
1715 // next 2 bytes unknown
1716
1717 store16(&pData[78], LFO2InternalDepth);
1718
1719 const int32_t eg1decay2 = (int32_t) (EG1InfiniteSustain) ? 0x7fffffff : (int32_t) GIG_EXP_ENCODE(EG1Decay2);
1720 store32(&pData[80], eg1decay2);
1721
1722 // next 2 bytes unknown
1723
1724 store16(&pData[86], EG1PreAttack);
1725
1726 const int32_t eg2decay2 = (int32_t) (EG2InfiniteSustain) ? 0x7fffffff : (int32_t) GIG_EXP_ENCODE(EG2Decay2);
1727 store32(&pData[88], eg2decay2);
1728
1729 // next 2 bytes unknown
1730
1731 store16(&pData[94], EG2PreAttack);
1732
1733 {
1734 if (VelocityResponseDepth > 4) throw Exception("VelocityResponseDepth must be between 0 and 4");
1735 uint8_t velocityresponse = VelocityResponseDepth;
1736 switch (VelocityResponseCurve) {
1737 case curve_type_nonlinear:
1738 break;
1739 case curve_type_linear:
1740 velocityresponse += 5;
1741 break;
1742 case curve_type_special:
1743 velocityresponse += 10;
1744 break;
1745 case curve_type_unknown:
1746 default:
1747 throw Exception("Could not update DimensionRegion's chunk, unknown VelocityResponseCurve selected");
1748 }
1749 pData[96] = velocityresponse;
1750 }
1751
1752 {
1753 if (ReleaseVelocityResponseDepth > 4) throw Exception("ReleaseVelocityResponseDepth must be between 0 and 4");
1754 uint8_t releasevelocityresponse = ReleaseVelocityResponseDepth;
1755 switch (ReleaseVelocityResponseCurve) {
1756 case curve_type_nonlinear:
1757 break;
1758 case curve_type_linear:
1759 releasevelocityresponse += 5;
1760 break;
1761 case curve_type_special:
1762 releasevelocityresponse += 10;
1763 break;
1764 case curve_type_unknown:
1765 default:
1766 throw Exception("Could not update DimensionRegion's chunk, unknown ReleaseVelocityResponseCurve selected");
1767 }
1768 pData[97] = releasevelocityresponse;
1769 }
1770
1771 pData[98] = VelocityResponseCurveScaling;
1772
1773 pData[99] = AttenuationControllerThreshold;
1774
1775 // next 4 bytes unknown
1776
1777 store16(&pData[104], SampleStartOffset);
1778
1779 // next 2 bytes unknown
1780
1781 {
1782 uint8_t pitchTrackDimensionBypass = GIG_PITCH_TRACK_ENCODE(PitchTrack);
1783 switch (DimensionBypass) {
1784 case dim_bypass_ctrl_94:
1785 pitchTrackDimensionBypass |= 0x10;
1786 break;
1787 case dim_bypass_ctrl_95:
1788 pitchTrackDimensionBypass |= 0x20;
1789 break;
1790 case dim_bypass_ctrl_none:
1791 //FIXME: should we set anything here?
1792 break;
1793 default:
1794 throw Exception("Could not update DimensionRegion's chunk, unknown DimensionBypass selected");
1795 }
1796 pData[108] = pitchTrackDimensionBypass;
1797 }
1798
1799 const uint8_t pan = (Pan >= 0) ? Pan : ((-Pan) + 63); // signed 8 bit -> signed 7 bit
1800 pData[109] = pan;
1801
1802 const uint8_t selfmask = (SelfMask) ? 0x01 : 0x00;
1803 pData[110] = selfmask;
1804
1805 // next byte unknown
1806
1807 {
1808 uint8_t lfo3ctrl = LFO3Controller & 0x07; // lower 3 bits
1809 if (LFO3Sync) lfo3ctrl |= 0x20; // bit 5
1810 if (InvertAttenuationController) lfo3ctrl |= 0x80; // bit 7
1811 if (VCFType == vcf_type_lowpassturbo) lfo3ctrl |= 0x40; // bit 6
1812 pData[112] = lfo3ctrl;
1813 }
1814
1815 const uint8_t attenctl = EncodeLeverageController(AttenuationController);
1816 pData[113] = attenctl;
1817
1818 {
1819 uint8_t lfo2ctrl = LFO2Controller & 0x07; // lower 3 bits
1820 if (LFO2FlipPhase) lfo2ctrl |= 0x80; // bit 7
1821 if (LFO2Sync) lfo2ctrl |= 0x20; // bit 5
1822 if (VCFResonanceController != vcf_res_ctrl_none) lfo2ctrl |= 0x40; // bit 6
1823 pData[114] = lfo2ctrl;
1824 }
1825
1826 {
1827 uint8_t lfo1ctrl = LFO1Controller & 0x07; // lower 3 bits
1828 if (LFO1FlipPhase) lfo1ctrl |= 0x80; // bit 7
1829 if (LFO1Sync) lfo1ctrl |= 0x40; // bit 6
1830 if (VCFResonanceController != vcf_res_ctrl_none)
1831 lfo1ctrl |= GIG_VCF_RESONANCE_CTRL_ENCODE(VCFResonanceController);
1832 pData[115] = lfo1ctrl;
1833 }
1834
1835 const uint16_t eg3depth = (EG3Depth >= 0) ? EG3Depth
1836 : uint16_t(((-EG3Depth) - 1) ^ 0xffff); /* binary complementary for negatives */
1837 pData[116] = eg3depth;
1838
1839 // next 2 bytes unknown
1840
1841 const uint8_t channeloffset = ChannelOffset * 4;
1842 pData[120] = channeloffset;
1843
1844 {
1845 uint8_t regoptions = 0;
1846 if (MSDecode) regoptions |= 0x01; // bit 0
1847 if (SustainDefeat) regoptions |= 0x02; // bit 1
1848 pData[121] = regoptions;
1849 }
1850
1851 // next 2 bytes unknown
1852
1853 pData[124] = VelocityUpperLimit;
1854
1855 // next 3 bytes unknown
1856
1857 pData[128] = ReleaseTriggerDecay;
1858
1859 // next 2 bytes unknown
1860
1861 const uint8_t eg1hold = (EG1Hold) ? 0x80 : 0x00; // bit 7
1862 pData[131] = eg1hold;
1863
1864 const uint8_t vcfcutoff = (VCFEnabled ? 0x80 : 0x00) | /* bit 7 */
1865 (VCFCutoff & 0x7f); /* lower 7 bits */
1866 pData[132] = vcfcutoff;
1867
1868 pData[133] = VCFCutoffController;
1869
1870 const uint8_t vcfvelscale = (VCFCutoffControllerInvert ? 0x80 : 0x00) | /* bit 7 */
1871 (VCFVelocityScale & 0x7f); /* lower 7 bits */
1872 pData[134] = vcfvelscale;
1873
1874 // next byte unknown
1875
1876 const uint8_t vcfresonance = (VCFResonanceDynamic ? 0x00 : 0x80) | /* bit 7 */
1877 (VCFResonance & 0x7f); /* lower 7 bits */
1878 pData[136] = vcfresonance;
1879
1880 const uint8_t vcfbreakpoint = (VCFKeyboardTracking ? 0x80 : 0x00) | /* bit 7 */
1881 (VCFKeyboardTrackingBreakpoint & 0x7f); /* lower 7 bits */
1882 pData[137] = vcfbreakpoint;
1883
1884 const uint8_t vcfvelocity = VCFVelocityDynamicRange % 5 |
1885 VCFVelocityCurve * 5;
1886 pData[138] = vcfvelocity;
1887
1888 const uint8_t vcftype = (VCFType == vcf_type_lowpassturbo) ? vcf_type_lowpass : VCFType;
1889 pData[139] = vcftype;
1890
1891 if (chunksize >= 148) {
1892 memcpy(&pData[140], DimensionUpperLimits, 8);
1893 }
1894 }
1895
1896 double* DimensionRegion::GetReleaseVelocityTable(curve_type_t releaseVelocityResponseCurve, uint8_t releaseVelocityResponseDepth) {
1897 curve_type_t curveType = releaseVelocityResponseCurve;
1898 uint8_t depth = releaseVelocityResponseDepth;
1899 // this models a strange behaviour or bug in GSt: two of the
1900 // velocity response curves for release time are not used even
1901 // if specified, instead another curve is chosen.
1902 if ((curveType == curve_type_nonlinear && depth == 0) ||
1903 (curveType == curve_type_special && depth == 4)) {
1904 curveType = curve_type_nonlinear;
1905 depth = 3;
1906 }
1907 return GetVelocityTable(curveType, depth, 0);
1908 }
1909
1910 double* DimensionRegion::GetCutoffVelocityTable(curve_type_t vcfVelocityCurve,
1911 uint8_t vcfVelocityDynamicRange,
1912 uint8_t vcfVelocityScale,
1913 vcf_cutoff_ctrl_t vcfCutoffController)
1914 {
1915 curve_type_t curveType = vcfVelocityCurve;
1916 uint8_t depth = vcfVelocityDynamicRange;
1917 // even stranger GSt: two of the velocity response curves for
1918 // filter cutoff are not used, instead another special curve
1919 // is chosen. This curve is not used anywhere else.
1920 if ((curveType == curve_type_nonlinear && depth == 0) ||
1921 (curveType == curve_type_special && depth == 4)) {
1922 curveType = curve_type_special;
1923 depth = 5;
1924 }
1925 return GetVelocityTable(curveType, depth,
1926 (vcfCutoffController <= vcf_cutoff_ctrl_none2)
1927 ? vcfVelocityScale : 0);
1928 }
1929
1930 // get the corresponding velocity table from the table map or create & calculate that table if it doesn't exist yet
1931 double* DimensionRegion::GetVelocityTable(curve_type_t curveType, uint8_t depth, uint8_t scaling)
1932 {
1933 double* table;
1934 uint32_t tableKey = (curveType<<16) | (depth<<8) | scaling;
1935 if (pVelocityTables->count(tableKey)) { // if key exists
1936 table = (*pVelocityTables)[tableKey];
1937 }
1938 else {
1939 table = CreateVelocityTable(curveType, depth, scaling);
1940 (*pVelocityTables)[tableKey] = table; // put the new table into the tables map
1941 }
1942 return table;
1943 }
1944
1945 Region* DimensionRegion::GetParent() const {
1946 return pRegion;
1947 }
1948
1949 leverage_ctrl_t DimensionRegion::DecodeLeverageController(_lev_ctrl_t EncodedController) {
1950 leverage_ctrl_t decodedcontroller;
1951 switch (EncodedController) {
1952 // special controller
1953 case _lev_ctrl_none:
1954 decodedcontroller.type = leverage_ctrl_t::type_none;
1955 decodedcontroller.controller_number = 0;
1956 break;
1957 case _lev_ctrl_velocity:
1958 decodedcontroller.type = leverage_ctrl_t::type_velocity;
1959 decodedcontroller.controller_number = 0;
1960 break;
1961 case _lev_ctrl_channelaftertouch:
1962 decodedcontroller.type = leverage_ctrl_t::type_channelaftertouch;
1963 decodedcontroller.controller_number = 0;
1964 break;
1965
1966 // ordinary MIDI control change controller
1967 case _lev_ctrl_modwheel:
1968 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1969 decodedcontroller.controller_number = 1;
1970 break;
1971 case _lev_ctrl_breath:
1972 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1973 decodedcontroller.controller_number = 2;
1974 break;
1975 case _lev_ctrl_foot:
1976 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1977 decodedcontroller.controller_number = 4;
1978 break;
1979 case _lev_ctrl_effect1:
1980 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1981 decodedcontroller.controller_number = 12;
1982 break;
1983 case _lev_ctrl_effect2:
1984 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1985 decodedcontroller.controller_number = 13;
1986 break;
1987 case _lev_ctrl_genpurpose1:
1988 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1989 decodedcontroller.controller_number = 16;
1990 break;
1991 case _lev_ctrl_genpurpose2:
1992 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1993 decodedcontroller.controller_number = 17;
1994 break;
1995 case _lev_ctrl_genpurpose3:
1996 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
1997 decodedcontroller.controller_number = 18;
1998 break;
1999 case _lev_ctrl_genpurpose4:
2000 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2001 decodedcontroller.controller_number = 19;
2002 break;
2003 case _lev_ctrl_portamentotime:
2004 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2005 decodedcontroller.controller_number = 5;
2006 break;
2007 case _lev_ctrl_sustainpedal:
2008 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2009 decodedcontroller.controller_number = 64;
2010 break;
2011 case _lev_ctrl_portamento:
2012 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2013 decodedcontroller.controller_number = 65;
2014 break;
2015 case _lev_ctrl_sostenutopedal:
2016 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2017 decodedcontroller.controller_number = 66;
2018 break;
2019 case _lev_ctrl_softpedal:
2020 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2021 decodedcontroller.controller_number = 67;
2022 break;
2023 case _lev_ctrl_genpurpose5:
2024 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2025 decodedcontroller.controller_number = 80;
2026 break;
2027 case _lev_ctrl_genpurpose6:
2028 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2029 decodedcontroller.controller_number = 81;
2030 break;
2031 case _lev_ctrl_genpurpose7:
2032 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2033 decodedcontroller.controller_number = 82;
2034 break;
2035 case _lev_ctrl_genpurpose8:
2036 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2037 decodedcontroller.controller_number = 83;
2038 break;
2039 case _lev_ctrl_effect1depth:
2040 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2041 decodedcontroller.controller_number = 91;
2042 break;
2043 case _lev_ctrl_effect2depth:
2044 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2045 decodedcontroller.controller_number = 92;
2046 break;
2047 case _lev_ctrl_effect3depth:
2048 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2049 decodedcontroller.controller_number = 93;
2050 break;
2051 case _lev_ctrl_effect4depth:
2052 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2053 decodedcontroller.controller_number = 94;
2054 break;
2055 case _lev_ctrl_effect5depth:
2056 decodedcontroller.type = leverage_ctrl_t::type_controlchange;
2057 decodedcontroller.controller_number = 95;
2058 break;
2059
2060 // unknown controller type
2061 default:
2062 throw gig::Exception("Unknown leverage controller type.");
2063 }
2064 return decodedcontroller;
2065 }
2066
2067 DimensionRegion::_lev_ctrl_t DimensionRegion::EncodeLeverageController(leverage_ctrl_t DecodedController) {
2068 _lev_ctrl_t encodedcontroller;
2069 switch (DecodedController.type) {
2070 // special controller
2071 case leverage_ctrl_t::type_none:
2072 encodedcontroller = _lev_ctrl_none;
2073 break;
2074 case leverage_ctrl_t::type_velocity:
2075 encodedcontroller = _lev_ctrl_velocity;
2076 break;
2077 case leverage_ctrl_t::type_channelaftertouch:
2078 encodedcontroller = _lev_ctrl_channelaftertouch;
2079 break;
2080
2081 // ordinary MIDI control change controller
2082 case leverage_ctrl_t::type_controlchange:
2083 switch (DecodedController.controller_number) {
2084 case 1:
2085 encodedcontroller = _lev_ctrl_modwheel;
2086 break;
2087 case 2:
2088 encodedcontroller = _lev_ctrl_breath;
2089 break;
2090 case 4:
2091 encodedcontroller = _lev_ctrl_foot;
2092 break;
2093 case 12:
2094 encodedcontroller = _lev_ctrl_effect1;
2095 break;
2096 case 13:
2097 encodedcontroller = _lev_ctrl_effect2;
2098 break;
2099 case 16:
2100 encodedcontroller = _lev_ctrl_genpurpose1;
2101 break;
2102 case 17:
2103 encodedcontroller = _lev_ctrl_genpurpose2;
2104 break;
2105 case 18:
2106 encodedcontroller = _lev_ctrl_genpurpose3;
2107 break;
2108 case 19:
2109 encodedcontroller = _lev_ctrl_genpurpose4;
2110 break;
2111 case 5:
2112 encodedcontroller = _lev_ctrl_portamentotime;
2113 break;
2114 case 64:
2115 encodedcontroller = _lev_ctrl_sustainpedal;
2116 break;
2117 case 65:
2118 encodedcontroller = _lev_ctrl_portamento;
2119 break;
2120 case 66:
2121 encodedcontroller = _lev_ctrl_sostenutopedal;
2122 break;
2123 case 67:
2124 encodedcontroller = _lev_ctrl_softpedal;
2125 break;
2126 case 80:
2127 encodedcontroller = _lev_ctrl_genpurpose5;
2128 break;
2129 case 81:
2130 encodedcontroller = _lev_ctrl_genpurpose6;
2131 break;
2132 case 82:
2133 encodedcontroller = _lev_ctrl_genpurpose7;
2134 break;
2135 case 83:
2136 encodedcontroller = _lev_ctrl_genpurpose8;
2137 break;
2138 case 91:
2139 encodedcontroller = _lev_ctrl_effect1depth;
2140 break;
2141 case 92:
2142 encodedcontroller = _lev_ctrl_effect2depth;
2143 break;
2144 case 93:
2145 encodedcontroller = _lev_ctrl_effect3depth;
2146 break;
2147 case 94:
2148 encodedcontroller = _lev_ctrl_effect4depth;
2149 break;
2150 case 95:
2151 encodedcontroller = _lev_ctrl_effect5depth;
2152 break;
2153 default:
2154 throw gig::Exception("leverage controller number is not supported by the gig format");
2155 }
2156 break;
2157 default:
2158 throw gig::Exception("Unknown leverage controller type.");
2159 }
2160 return encodedcontroller;
2161 }
2162
2163 DimensionRegion::~DimensionRegion() {
2164 Instances--;
2165 if (!Instances) {
2166 // delete the velocity->volume tables
2167 VelocityTableMap::iterator iter;
2168 for (iter = pVelocityTables->begin(); iter != pVelocityTables->end(); iter++) {
2169 double* pTable = iter->second;
2170 if (pTable) delete[] pTable;
2171 }
2172 pVelocityTables->clear();
2173 delete pVelocityTables;
2174 pVelocityTables = NULL;
2175 }
2176 if (VelocityTable) delete[] VelocityTable;
2177 }
2178
2179 /**
2180 * Returns the correct amplitude factor for the given \a MIDIKeyVelocity.
2181 * All involved parameters (VelocityResponseCurve, VelocityResponseDepth
2182 * and VelocityResponseCurveScaling) involved are taken into account to
2183 * calculate the amplitude factor. Use this method when a key was
2184 * triggered to get the volume with which the sample should be played
2185 * back.
2186 *
2187 * @param MIDIKeyVelocity MIDI velocity value of the triggered key (between 0 and 127)
2188 * @returns amplitude factor (between 0.0 and 1.0)
2189 */
2190 double DimensionRegion::GetVelocityAttenuation(uint8_t MIDIKeyVelocity) {
2191 return pVelocityAttenuationTable[MIDIKeyVelocity];
2192 }
2193
2194 double DimensionRegion::GetVelocityRelease(uint8_t MIDIKeyVelocity) {
2195 return pVelocityReleaseTable[MIDIKeyVelocity];
2196 }
2197
2198 double DimensionRegion::GetVelocityCutoff(uint8_t MIDIKeyVelocity) {
2199 return pVelocityCutoffTable[MIDIKeyVelocity];
2200 }
2201
2202 /**
2203 * Updates the respective member variable and the lookup table / cache
2204 * that depends on this value.
2205 */
2206 void DimensionRegion::SetVelocityResponseCurve(curve_type_t curve) {
2207 pVelocityAttenuationTable =
2208 GetVelocityTable(
2209 curve, VelocityResponseDepth, VelocityResponseCurveScaling
2210 );
2211 VelocityResponseCurve = curve;
2212 }
2213
2214 /**
2215 * Updates the respective member variable and the lookup table / cache
2216 * that depends on this value.
2217 */
2218 void DimensionRegion::SetVelocityResponseDepth(uint8_t depth) {
2219 pVelocityAttenuationTable =
2220 GetVelocityTable(
2221 VelocityResponseCurve, depth, VelocityResponseCurveScaling
2222 );
2223 VelocityResponseDepth = depth;
2224 }
2225
2226 /**
2227 * Updates the respective member variable and the lookup table / cache
2228 * that depends on this value.
2229 */
2230 void DimensionRegion::SetVelocityResponseCurveScaling(uint8_t scaling) {
2231 pVelocityAttenuationTable =
2232 GetVelocityTable(
2233 VelocityResponseCurve, VelocityResponseDepth, scaling
2234 );
2235 VelocityResponseCurveScaling = scaling;
2236 }
2237
2238 /**
2239 * Updates the respective member variable and the lookup table / cache
2240 * that depends on this value.
2241 */
2242 void DimensionRegion::SetReleaseVelocityResponseCurve(curve_type_t curve) {
2243 pVelocityReleaseTable = GetReleaseVelocityTable(curve, ReleaseVelocityResponseDepth);
2244 ReleaseVelocityResponseCurve = curve;
2245 }
2246
2247 /**
2248 * Updates the respective member variable and the lookup table / cache
2249 * that depends on this value.
2250 */
2251 void DimensionRegion::SetReleaseVelocityResponseDepth(uint8_t depth) {
2252 pVelocityReleaseTable = GetReleaseVelocityTable(ReleaseVelocityResponseCurve, depth);
2253 ReleaseVelocityResponseDepth = depth;
2254 }
2255
2256 /**
2257 * Updates the respective member variable and the lookup table / cache
2258 * that depends on this value.
2259 */
2260 void DimensionRegion::SetVCFCutoffController(vcf_cutoff_ctrl_t controller) {
2261 pVelocityCutoffTable = GetCutoffVelocityTable(VCFVelocityCurve, VCFVelocityDynamicRange, VCFVelocityScale, controller);
2262 VCFCutoffController = controller;
2263 }
2264
2265 /**
2266 * Updates the respective member variable and the lookup table / cache
2267 * that depends on this value.
2268 */
2269 void DimensionRegion::SetVCFVelocityCurve(curve_type_t curve) {
2270 pVelocityCutoffTable = GetCutoffVelocityTable(curve, VCFVelocityDynamicRange, VCFVelocityScale, VCFCutoffController);
2271 VCFVelocityCurve = curve;
2272 }
2273
2274 /**
2275 * Updates the respective member variable and the lookup table / cache
2276 * that depends on this value.
2277 */
2278 void DimensionRegion::SetVCFVelocityDynamicRange(uint8_t range) {
2279 pVelocityCutoffTable = GetCutoffVelocityTable(VCFVelocityCurve, range, VCFVelocityScale, VCFCutoffController);
2280 VCFVelocityDynamicRange = range;
2281 }
2282
2283 /**
2284 * Updates the respective member variable and the lookup table / cache
2285 * that depends on this value.
2286 */
2287 void DimensionRegion::SetVCFVelocityScale(uint8_t scaling) {
2288 pVelocityCutoffTable = GetCutoffVelocityTable(VCFVelocityCurve, VCFVelocityDynamicRange, scaling, VCFCutoffController);
2289 VCFVelocityScale = scaling;
2290 }
2291
2292 double* DimensionRegion::CreateVelocityTable(curve_type_t curveType, uint8_t depth, uint8_t scaling) {
2293
2294 // line-segment approximations of the 15 velocity curves
2295
2296 // linear
2297 const int lin0[] = { 1, 1, 127, 127 };
2298 const int lin1[] = { 1, 21, 127, 127 };
2299 const int lin2[] = { 1, 45, 127, 127 };
2300 const int lin3[] = { 1, 74, 127, 127 };
2301 const int lin4[] = { 1, 127, 127, 127 };
2302
2303 // non-linear
2304 const int non0[] = { 1, 4, 24, 5, 57, 17, 92, 57, 122, 127, 127, 127 };
2305 const int non1[] = { 1, 4, 46, 9, 93, 56, 118, 106, 123, 127,
2306 127, 127 };
2307 const int non2[] = { 1, 4, 46, 9, 57, 20, 102, 107, 107, 127,
2308 127, 127 };
2309 const int non3[] = { 1, 15, 10, 19, 67, 73, 80, 80, 90, 98, 98, 127,
2310 127, 127 };
2311 const int non4[] = { 1, 25, 33, 57, 82, 81, 92, 127, 127, 127 };
2312
2313 // special
2314 const int spe0[] = { 1, 2, 76, 10, 90, 15, 95, 20, 99, 28, 103, 44,
2315 113, 127, 127, 127 };
2316 const int spe1[] = { 1, 2, 27, 5, 67, 18, 89, 29, 95, 35, 107, 67,
2317 118, 127, 127, 127 };
2318 const int spe2[] = { 1, 1, 33, 1, 53, 5, 61, 13, 69, 32, 79, 74,
2319 85, 90, 91, 127, 127, 127 };
2320 const int spe3[] = { 1, 32, 28, 35, 66, 48, 89, 59, 95, 65, 99, 73,
2321 117, 127, 127, 127 };
2322 const int spe4[] = { 1, 4, 23, 5, 49, 13, 57, 17, 92, 57, 122, 127,
2323 127, 127 };
2324
2325 // this is only used by the VCF velocity curve
2326 const int spe5[] = { 1, 2, 30, 5, 60, 19, 77, 70, 83, 85, 88, 106,
2327 91, 127, 127, 127 };
2328
2329 const int* const curves[] = { non0, non1, non2, non3, non4,
2330 lin0, lin1, lin2, lin3, lin4,
2331 spe0, spe1, spe2, spe3, spe4, spe5 };
2332
2333 double* const table = new double[128];
2334
2335 const int* curve = curves[curveType * 5 + depth];
2336 const int s = scaling == 0 ? 20 : scaling; // 0 or 20 means no scaling
2337
2338 table[0] = 0;
2339 for (int x = 1 ; x < 128 ; x++) {
2340
2341 if (x > curve[2]) curve += 2;
2342 double y = curve[1] + (x - curve[0]) *
2343 (double(curve[3] - curve[1]) / (curve[2] - curve[0]));
2344 y = y / 127;
2345
2346 // Scale up for s > 20, down for s < 20. When
2347 // down-scaling, the curve still ends at 1.0.
2348 if (s < 20 && y >= 0.5)
2349 y = y / ((2 - 40.0 / s) * y + 40.0 / s - 1);
2350 else
2351 y = y * (s / 20.0);
2352 if (y > 1) y = 1;
2353
2354 table[x] = y;
2355 }
2356 return table;
2357 }
2358
2359
2360 // *************** Region ***************
2361 // *
2362
2363 Region::Region(Instrument* pInstrument, RIFF::List* rgnList) : DLS::Region((DLS::Instrument*) pInstrument, rgnList) {
2364 // Initialization
2365 Dimensions = 0;
2366 for (int i = 0; i < 256; i++) {
2367 pDimensionRegions[i] = NULL;
2368 }
2369 Layers = 1;
2370 File* file = (File*) GetParent()->GetParent();
2371 int dimensionBits = (file->pVersion && file->pVersion->major == 3) ? 8 : 5;
2372
2373 // Actual Loading
2374
2375 LoadDimensionRegions(rgnList);
2376
2377 RIFF::Chunk* _3lnk = rgnList->GetSubChunk(CHUNK_ID_3LNK);
2378 if (_3lnk) {
2379 DimensionRegions = _3lnk->ReadUint32();
2380 for (int i = 0; i < dimensionBits; i++) {
2381 dimension_t dimension = static_cast<dimension_t>(_3lnk->ReadUint8());
2382 uint8_t bits = _3lnk->ReadUint8();
2383 _3lnk->ReadUint8(); // bit position of the dimension (bits[0] + bits[1] + ... + bits[i-1])
2384 _3lnk->ReadUint8(); // (1 << bit position of next dimension) - (1 << bit position of this dimension)
2385 uint8_t zones = _3lnk->ReadUint8(); // new for v3: number of zones doesn't have to be == pow(2,bits)
2386 if (dimension == dimension_none) { // inactive dimension
2387 pDimensionDefinitions[i].dimension = dimension_none;
2388 pDimensionDefinitions[i].bits = 0;
2389 pDimensionDefinitions[i].zones = 0;
2390 pDimensionDefinitions[i].split_type = split_type_bit;
2391 pDimensionDefinitions[i].zone_size = 0;
2392 }
2393 else { // active dimension
2394 pDimensionDefinitions[i].dimension = dimension;
2395 pDimensionDefinitions[i].bits = bits;
2396 pDimensionDefinitions[i].zones = zones ? zones : 0x01 << bits; // = pow(2,bits)
2397 pDimensionDefinitions[i].split_type = __resolveSplitType(dimension);
2398 pDimensionDefinitions[i].zone_size = __resolveZoneSize(pDimensionDefinitions[i]);
2399 Dimensions++;
2400
2401 // if this is a layer dimension, remember the amount of layers
2402 if (dimension == dimension_layer) Layers = pDimensionDefinitions[i].zones;
2403 }
2404 _3lnk->SetPos(3, RIFF::stream_curpos); // jump forward to next dimension definition
2405 }
2406 for (int i = dimensionBits ; i < 8 ; i++) pDimensionDefinitions[i].bits = 0;
2407
2408 // if there's a velocity dimension and custom velocity zone splits are used,
2409 // update the VelocityTables in the dimension regions
2410 UpdateVelocityTable();
2411
2412 // jump to start of the wave pool indices (if not already there)
2413 if (file->pVersion && file->pVersion->major == 3)
2414 _3lnk->SetPos(68); // version 3 has a different 3lnk structure
2415 else
2416 _3lnk->SetPos(44);
2417
2418 // load sample references
2419 for (uint i = 0; i < DimensionRegions; i++) {
2420 uint32_t wavepoolindex = _3lnk->ReadUint32();
2421 if (file->pWavePoolTable) pDimensionRegions[i]->pSample = GetSampleFromWavePool(wavepoolindex);
2422 }
2423 GetSample(); // load global region sample reference
2424 } else {
2425 DimensionRegions = 0;
2426 for (int i = 0 ; i < 8 ; i++) {
2427 pDimensionDefinitions[i].dimension = dimension_none;
2428 pDimensionDefinitions[i].bits = 0;
2429 pDimensionDefinitions[i].zones = 0;
2430 }
2431 }
2432
2433 // make sure there is at least one dimension region
2434 if (!DimensionRegions) {
2435 RIFF::List* _3prg = rgnList->GetSubList(LIST_TYPE_3PRG);
2436 if (!_3prg) _3prg = rgnList->AddSubList(LIST_TYPE_3PRG);
2437 RIFF::List* _3ewl = _3prg->AddSubList(LIST_TYPE_3EWL);
2438 pDimensionRegions[0] = new DimensionRegion(this, _3ewl);
2439 DimensionRegions = 1;
2440 }
2441 }
2442
2443 /**
2444 * Apply Region settings and all its DimensionRegions to the respective
2445 * RIFF chunks. You have to call File::Save() to make changes persistent.
2446 *
2447 * Usually there is absolutely no need to call this method explicitly.
2448 * It will be called automatically when File::Save() was called.
2449 *
2450 * @throws gig::Exception if samples cannot be dereferenced
2451 */
2452 void Region::UpdateChunks() {
2453 // in the gig format we don't care about the Region's sample reference
2454 // but we still have to provide some existing one to not corrupt the
2455 // file, so to avoid the latter we simply always assign the sample of
2456 // the first dimension region of this region
2457 pSample = pDimensionRegions[0]->pSample;
2458
2459 // first update base class's chunks
2460 DLS::Region::UpdateChunks();
2461
2462 // update dimension region's chunks
2463 for (int i = 0; i < DimensionRegions; i++) {
2464 pDimensionRegions[i]->UpdateChunks();
2465 }
2466
2467 File* pFile = (File*) GetParent()->GetParent();
2468 bool version3 = pFile->pVersion && pFile->pVersion->major == 3;
2469 const int iMaxDimensions = version3 ? 8 : 5;
2470 const int iMaxDimensionRegions = version3 ? 256 : 32;
2471
2472 // make sure '3lnk' chunk exists
2473 RIFF::Chunk* _3lnk = pCkRegion->GetSubChunk(CHUNK_ID_3LNK);
2474 if (!_3lnk) {
2475 const int _3lnkChunkSize = version3 ? 1092 : 172;
2476 _3lnk = pCkRegion->AddSubChunk(CHUNK_ID_3LNK, _3lnkChunkSize);
2477 memset(_3lnk->LoadChunkData(), 0, _3lnkChunkSize);
2478
2479 // move 3prg to last position
2480 pCkRegion->MoveSubChunk(pCkRegion->GetSubList(LIST_TYPE_3PRG), 0);
2481 }
2482
2483 // update dimension definitions in '3lnk' chunk
2484 uint8_t* pData = (uint8_t*) _3lnk->LoadChunkData();
2485 store32(&pData[0], DimensionRegions);
2486 int shift = 0;
2487 for (int i = 0; i < iMaxDimensions; i++) {
2488 pData[4 + i * 8] = (uint8_t) pDimensionDefinitions[i].dimension;
2489 pData[5 + i * 8] = pDimensionDefinitions[i].bits;
2490 pData[6 + i * 8] = pDimensionDefinitions[i].dimension == dimension_none ? 0 : shift;
2491 pData[7 + i * 8] = (1 << (shift + pDimensionDefinitions[i].bits)) - (1 << shift);
2492 pData[8 + i * 8] = pDimensionDefinitions[i].zones;
2493 // next 3 bytes unknown, always zero?
2494
2495 shift += pDimensionDefinitions[i].bits;
2496 }
2497
2498 // update wave pool table in '3lnk' chunk
2499 const int iWavePoolOffset = version3 ? 68 : 44;
2500 for (uint i = 0; i < iMaxDimensionRegions; i++) {
2501 int iWaveIndex = -1;
2502 if (i < DimensionRegions) {
2503 if (!pFile->pSamples || !pFile->pSamples->size()) throw gig::Exception("Could not update gig::Region, there are no samples");
2504 File::SampleList::iterator iter = pFile->pSamples->begin();
2505 File::SampleList::iterator end = pFile->pSamples->end();
2506 for (int index = 0; iter != end; ++iter, ++index) {
2507 if (*iter == pDimensionRegions[i]->pSample) {
2508 iWaveIndex = index;
2509 break;
2510 }
2511 }
2512 }
2513 store32(&pData[iWavePoolOffset + i * 4], iWaveIndex);
2514 }
2515 }
2516
2517 void Region::LoadDimensionRegions(RIFF::List* rgn) {
2518 RIFF::List* _3prg = rgn->GetSubList(LIST_TYPE_3PRG);
2519 if (_3prg) {
2520 int dimensionRegionNr = 0;
2521 RIFF::List* _3ewl = _3prg->GetFirstSubList();
2522 while (_3ewl) {
2523 if (_3ewl->GetListType() == LIST_TYPE_3EWL) {
2524 pDimensionRegions[dimensionRegionNr] = new DimensionRegion(this, _3ewl);
2525 dimensionRegionNr++;
2526 }
2527 _3ewl = _3prg->GetNextSubList();
2528 }
2529 if (dimensionRegionNr == 0) throw gig::Exception("No dimension region found.");
2530 }
2531 }
2532
2533 void Region::SetKeyRange(uint16_t Low, uint16_t High) {
2534 // update KeyRange struct and make sure regions are in correct order
2535 DLS::Region::SetKeyRange(Low, High);
2536 // update Region key table for fast lookup
2537 ((gig::Instrument*)GetParent())->UpdateRegionKeyTable();
2538 }
2539
2540 void Region::UpdateVelocityTable() {
2541 // get velocity dimension's index
2542 int veldim = -1;
2543 for (int i = 0 ; i < Dimensions ; i++) {
2544 if (pDimensionDefinitions[i].dimension == gig::dimension_velocity) {
2545 veldim = i;
2546 break;
2547 }
2548 }
2549 if (veldim == -1) return;
2550
2551 int step = 1;
2552 for (int i = 0 ; i < veldim ; i++) step <<= pDimensionDefinitions[i].bits;
2553 int skipveldim = (step << pDimensionDefinitions[veldim].bits) - step;
2554 int end = step * pDimensionDefinitions[veldim].zones;
2555
2556 // loop through all dimension regions for all dimensions except the velocity dimension
2557 int dim[8] = { 0 };
2558 for (int i = 0 ; i < DimensionRegions ; i++) {
2559
2560 if (pDimensionRegions[i]->DimensionUpperLimits[veldim] ||
2561 pDimensionRegions[i]->VelocityUpperLimit) {
2562 // create the velocity table
2563 uint8_t* table = pDimensionRegions[i]->VelocityTable;
2564 if (!table) {
2565 table = new uint8_t[128];
2566 pDimensionRegions[i]->VelocityTable = table;
2567 }
2568 int tableidx = 0;
2569 int velocityZone = 0;
2570 if (pDimensionRegions[i]->DimensionUpperLimits[veldim]) { // gig3
2571 for (int k = i ; k < end ; k += step) {
2572 DimensionRegion *d = pDimensionRegions[k];
2573 for (; tableidx <= d->DimensionUpperLimits[veldim] ; tableidx++) table[tableidx] = velocityZone;
2574 velocityZone++;
2575 }
2576 } else { // gig2
2577 for (int k = i ; k < end ; k += step) {
2578 DimensionRegion *d = pDimensionRegions[k];
2579 for (; tableidx <= d->VelocityUpperLimit ; tableidx++) table[tableidx] = velocityZone;
2580 velocityZone++;
2581 }
2582 }
2583 } else {
2584 if (pDimensionRegions[i]->VelocityTable) {
2585 delete[] pDimensionRegions[i]->VelocityTable;
2586 pDimensionRegions[i]->VelocityTable = 0;
2587 }
2588 }
2589
2590 int j;
2591 int shift = 0;
2592 for (j = 0 ; j < Dimensions ; j++) {
2593 if (j == veldim) i += skipveldim; // skip velocity dimension
2594 else {
2595 dim[j]++;
2596 if (dim[j] < pDimensionDefinitions[j].zones) break;
2597 else {
2598 // skip unused dimension regions
2599 dim[j] = 0;
2600 i += ((1 << pDimensionDefinitions[j].bits) -
2601 pDimensionDefinitions[j].zones) << shift;
2602 }
2603 }
2604 shift += pDimensionDefinitions[j].bits;
2605 }
2606 if (j == Dimensions) break;
2607 }
2608 }
2609
2610 /** @brief Einstein would have dreamed of it - create a new dimension.
2611 *
2612 * Creates a new dimension with the dimension definition given by
2613 * \a pDimDef. The appropriate amount of DimensionRegions will be created.
2614 * There is a hard limit of dimensions and total amount of "bits" all
2615 * dimensions can have. This limit is dependant to what gig file format
2616 * version this file refers to. The gig v2 (and lower) format has a
2617 * dimension limit and total amount of bits limit of 5, whereas the gig v3
2618 * format has a limit of 8.
2619 *
2620 * @param pDimDef - defintion of the new dimension
2621 * @throws gig::Exception if dimension of the same type exists already
2622 * @throws gig::Exception if amount of dimensions or total amount of
2623 * dimension bits limit is violated
2624 */
2625 void Region::AddDimension(dimension_def_t* pDimDef) {
2626 // check if max. amount of dimensions reached
2627 File* file = (File*) GetParent()->GetParent();
2628 const int iMaxDimensions = (file->pVersion && file->pVersion->major == 3) ? 8 : 5;
2629 if (Dimensions >= iMaxDimensions)
2630 throw gig::Exception("Could not add new dimension, max. amount of " + ToString(iMaxDimensions) + " dimensions already reached");
2631 // check if max. amount of dimension bits reached
2632 int iCurrentBits = 0;
2633 for (int i = 0; i < Dimensions; i++)
2634 iCurrentBits += pDimensionDefinitions[i].bits;
2635 if (iCurrentBits >= iMaxDimensions)
2636 throw gig::Exception("Could not add new dimension, max. amount of " + ToString(iMaxDimensions) + " dimension bits already reached");
2637 const int iNewBits = iCurrentBits + pDimDef->bits;
2638 if (iNewBits > iMaxDimensions)
2639 throw gig::Exception("Could not add new dimension, new dimension would exceed max. amount of " + ToString(iMaxDimensions) + " dimension bits");
2640 // check if there's already a dimensions of the same type
2641 for (int i = 0; i < Dimensions; i++)
2642 if (pDimensionDefinitions[i].dimension == pDimDef->dimension)
2643 throw gig::Exception("Could not add new dimension, there is already a dimension of the same type");
2644
2645 // pos is where the new dimension should be placed, normally
2646 // last in list, except for the samplechannel dimension which
2647 // has to be first in list
2648 int pos = pDimDef->dimension == dimension_samplechannel ? 0 : Dimensions;
2649 int bitpos = 0;
2650 for (int i = 0 ; i < pos ; i++)
2651 bitpos += pDimensionDefinitions[i].bits;
2652
2653 // make room for the new dimension
2654 for (int i = Dimensions ; i > pos ; i--) pDimensionDefinitions[i] = pDimensionDefinitions[i - 1];
2655 for (int i = 0 ; i < (1 << iCurrentBits) ; i++) {
2656 for (int j = Dimensions ; j > pos ; j--) {
2657 pDimensionRegions[i]->DimensionUpperLimits[j] =
2658 pDimensionRegions[i]->DimensionUpperLimits[j - 1];
2659 }
2660 }
2661
2662 // assign definition of new dimension
2663 pDimensionDefinitions[pos] = *pDimDef;
2664
2665 // auto correct certain dimension definition fields (where possible)
2666 pDimensionDefinitions[pos].split_type =
2667 __resolveSplitType(pDimensionDefinitions[pos].dimension);
2668 pDimensionDefinitions[pos].zone_size =
2669 __resolveZoneSize(pDimensionDefinitions[pos]);
2670
2671 // create new dimension region(s) for this new dimension, and make
2672 // sure that the dimension regions are placed correctly in both the
2673 // RIFF list and the pDimensionRegions array
2674 RIFF::Chunk* moveTo = NULL;
2675 RIFF::List* _3prg = pCkRegion->GetSubList(LIST_TYPE_3PRG);
2676 for (int i = (1 << iCurrentBits) - (1 << bitpos) ; i >= 0 ; i -= (1 << bitpos)) {
2677 for (int k = 0 ; k < (1 << bitpos) ; k++) {
2678 pDimensionRegions[(i << pDimDef->bits) + k] = pDimensionRegions[i + k];
2679 }
2680 for (int j = 1 ; j < (1 << pDimDef->bits) ; j++) {
2681 for (int k = 0 ; k < (1 << bitpos) ; k++) {
2682 RIFF::List* pNewDimRgnListChunk = _3prg->AddSubList(LIST_TYPE_3EWL);
2683 if (moveTo) _3prg->MoveSubChunk(pNewDimRgnListChunk, moveTo);
2684 // create a new dimension region and copy all parameter values from
2685 // an existing dimension region
2686 pDimensionRegions[(i << pDimDef->bits) + (j << bitpos) + k] =
2687 new DimensionRegion(pNewDimRgnListChunk, *pDimensionRegions[i + k]);
2688
2689 DimensionRegions++;
2690 }
2691 }
2692 moveTo = pDimensionRegions[i]->pParentList;
2693 }
2694
2695 // initialize the upper limits for this dimension
2696 int mask = (1 << bitpos) - 1;
2697 for (int z = 0 ; z < pDimDef->zones ; z++) {
2698 uint8_t upperLimit = uint8_t((z + 1) * 128.0 / pDimDef->zones - 1);
2699 for (int i = 0 ; i < 1 << iCurrentBits ; i++) {
2700 pDimensionRegions[((i & ~mask) << pDimDef->bits) |
2701 (z << bitpos) |
2702 (i & mask)]->DimensionUpperLimits[pos] = upperLimit;
2703 }
2704 }
2705
2706 Dimensions++;
2707
2708 // if this is a layer dimension, update 'Layers' attribute
2709 if (pDimDef->dimension == dimension_layer) Layers = pDimDef->zones;
2710
2711 UpdateVelocityTable();
2712 }
2713
2714 /** @brief Delete an existing dimension.
2715 *
2716 * Deletes the dimension given by \a pDimDef and deletes all respective
2717 * dimension regions, that is all dimension regions where the dimension's
2718 * bit(s) part is greater than 0. In case of a 'sustain pedal' dimension
2719 * for example this would delete all dimension regions for the case(s)
2720 * where the sustain pedal is pressed down.
2721 *
2722 * @param pDimDef - dimension to delete
2723 * @throws gig::Exception if given dimension cannot be found
2724 */
2725 void Region::DeleteDimension(dimension_def_t* pDimDef) {
2726 // get dimension's index
2727 int iDimensionNr = -1;
2728 for (int i = 0; i < Dimensions; i++) {
2729 if (&pDimensionDefinitions[i] == pDimDef) {
2730 iDimensionNr = i;
2731 break;
2732 }
2733 }
2734 if (iDimensionNr < 0) throw gig::Exception("Invalid dimension_def_t pointer");
2735
2736 // get amount of bits below the dimension to delete
2737 int iLowerBits = 0;
2738 for (int i = 0; i < iDimensionNr; i++)
2739 iLowerBits += pDimensionDefinitions[i].bits;
2740
2741 // get amount ot bits above the dimension to delete
2742 int iUpperBits = 0;
2743 for (int i = iDimensionNr + 1; i < Dimensions; i++)
2744 iUpperBits += pDimensionDefinitions[i].bits;
2745
2746 RIFF::List* _3prg = pCkRegion->GetSubList(LIST_TYPE_3PRG);
2747
2748 // delete dimension regions which belong to the given dimension
2749 // (that is where the dimension's bit > 0)
2750 for (int iUpperBit = 0; iUpperBit < 1 << iUpperBits; iUpperBit++) {
2751 for (int iObsoleteBit = 1; iObsoleteBit < 1 << pDimensionDefinitions[iDimensionNr].bits; iObsoleteBit++) {
2752 for (int iLowerBit = 0; iLowerBit < 1 << iLowerBits; iLowerBit++) {
2753 int iToDelete = iUpperBit << (pDimensionDefinitions[iDimensionNr].bits + iLowerBits) |
2754 iObsoleteBit << iLowerBits |
2755 iLowerBit;
2756
2757 _3prg->DeleteSubChunk(pDimensionRegions[iToDelete]->pParentList);
2758 delete pDimensionRegions[iToDelete];
2759 pDimensionRegions[iToDelete] = NULL;
2760 DimensionRegions--;
2761 }
2762 }
2763 }
2764
2765 // defrag pDimensionRegions array
2766 // (that is remove the NULL spaces within the pDimensionRegions array)
2767 for (int iFrom = 2, iTo = 1; iFrom < 256 && iTo < 256 - 1; iTo++) {
2768 if (!pDimensionRegions[iTo]) {
2769 if (iFrom <= iTo) iFrom = iTo + 1;
2770 while (!pDimensionRegions[iFrom] && iFrom < 256) iFrom++;
2771 if (iFrom < 256 && pDimensionRegions[iFrom]) {
2772 pDimensionRegions[iTo] = pDimensionRegions[iFrom];
2773 pDimensionRegions[iFrom] = NULL;
2774 }
2775 }
2776 }
2777
2778 // remove the this dimension from the upper limits arrays
2779 for (int j = 0 ; j < 256 && pDimensionRegions[j] ; j++) {
2780 DimensionRegion* d = pDimensionRegions[j];
2781 for (int i = iDimensionNr + 1; i < Dimensions; i++) {
2782 d->DimensionUpperLimits[i - 1] = d->DimensionUpperLimits[i];
2783 }
2784 d->DimensionUpperLimits[Dimensions - 1] = 127;
2785 }
2786
2787 // 'remove' dimension definition
2788 for (int i = iDimensionNr + 1; i < Dimensions; i++) {
2789 pDimensionDefinitions[i - 1] = pDimensionDefinitions[i];
2790 }
2791 pDimensionDefinitions[Dimensions - 1].dimension = dimension_none;
2792 pDimensionDefinitions[Dimensions - 1].bits = 0;
2793 pDimensionDefinitions[Dimensions - 1].zones = 0;
2794
2795 Dimensions--;
2796
2797 // if this was a layer dimension, update 'Layers' attribute
2798 if (pDimDef->dimension == dimension_layer) Layers = 1;
2799 }
2800
2801 Region::~Region() {
2802 for (int i = 0; i < 256; i++) {
2803 if (pDimensionRegions[i]) delete pDimensionRegions[i];
2804 }
2805 }
2806
2807 /**
2808 * Use this method in your audio engine to get the appropriate dimension
2809 * region with it's articulation data for the current situation. Just
2810 * call the method with the current MIDI controller values and you'll get
2811 * the DimensionRegion with the appropriate articulation data for the
2812 * current situation (for this Region of course only). To do that you'll
2813 * first have to look which dimensions with which controllers and in
2814 * which order are defined for this Region when you load the .gig file.
2815 * Special cases are e.g. layer or channel dimensions where you just put
2816 * in the index numbers instead of a MIDI controller value (means 0 for
2817 * left channel, 1 for right channel or 0 for layer 0, 1 for layer 1,
2818 * etc.).
2819 *
2820 * @param DimValues MIDI controller values (0-127) for dimension 0 to 7
2821 * @returns adress to the DimensionRegion for the given situation
2822 * @see pDimensionDefinitions
2823 * @see Dimensions
2824 */
2825 DimensionRegion* Region::GetDimensionRegionByValue(const uint DimValues[8]) {
2826 uint8_t bits;
2827 int veldim = -1;
2828 int velbitpos;
2829 int bitpos = 0;
2830 int dimregidx = 0;
2831 for (uint i = 0; i < Dimensions; i++) {
2832 if (pDimensionDefinitions[i].dimension == dimension_velocity) {
2833 // the velocity dimension must be handled after the other dimensions
2834 veldim = i;
2835 velbitpos = bitpos;
2836 } else {
2837 switch (pDimensionDefinitions[i].split_type) {
2838 case split_type_normal:
2839 if (pDimensionRegions[0]->DimensionUpperLimits[i]) {
2840 // gig3: all normal dimensions (not just the velocity dimension) have custom zone ranges
2841 for (bits = 0 ; bits < pDimensionDefinitions[i].zones ; bits++) {
2842 if (DimValues[i] <= pDimensionRegions[bits << bitpos]->DimensionUpperLimits[i]) break;
2843 }
2844 } else {
2845 // gig2: evenly sized zones
2846 bits = uint8_t(DimValues[i] / pDimensionDefinitions[i].zone_size);
2847 }
2848 break;
2849 case split_type_bit: // the value is already the sought dimension bit number
2850 const uint8_t limiter_mask = (0xff << pDimensionDefinitions[i].bits) ^ 0xff;
2851 bits = DimValues[i] & limiter_mask; // just make sure the value doesn't use more bits than allowed
2852 break;
2853 }
2854 dimregidx |= bits << bitpos;
2855 }
2856 bitpos += pDimensionDefinitions[i].bits;
2857 }
2858 DimensionRegion* dimreg = pDimensionRegions[dimregidx];
2859 if (veldim != -1) {
2860 // (dimreg is now the dimension region for the lowest velocity)
2861 if (dimreg->VelocityTable) // custom defined zone ranges
2862 bits = dimreg->VelocityTable[DimValues[veldim]];
2863 else // normal split type
2864 bits = uint8_t(DimValues[veldim] / pDimensionDefinitions[veldim].zone_size);
2865
2866 dimregidx |= bits << velbitpos;
2867 dimreg = pDimensionRegions[dimregidx];
2868 }
2869 return dimreg;
2870 }
2871
2872 /**
2873 * Returns the appropriate DimensionRegion for the given dimension bit
2874 * numbers (zone index). You usually use <i>GetDimensionRegionByValue</i>
2875 * instead of calling this method directly!
2876 *
2877 * @param DimBits Bit numbers for dimension 0 to 7
2878 * @returns adress to the DimensionRegion for the given dimension
2879 * bit numbers
2880 * @see GetDimensionRegionByValue()
2881 */
2882 DimensionRegion* Region::GetDimensionRegionByBit(const uint8_t DimBits[8]) {
2883 return pDimensionRegions[((((((DimBits[7] << pDimensionDefinitions[6].bits | DimBits[6])
2884 << pDimensionDefinitions[5].bits | DimBits[5])
2885 << pDimensionDefinitions[4].bits | DimBits[4])
2886 << pDimensionDefinitions[3].bits | DimBits[3])
2887 << pDimensionDefinitions[2].bits | DimBits[2])
2888 << pDimensionDefinitions[1].bits | DimBits[1])
2889 << pDimensionDefinitions[0].bits | DimBits[0]];
2890 }
2891
2892 /**
2893 * Returns pointer address to the Sample referenced with this region.
2894 * This is the global Sample for the entire Region (not sure if this is
2895 * actually used by the Gigasampler engine - I would only use the Sample
2896 * referenced by the appropriate DimensionRegion instead of this sample).
2897 *
2898 * @returns address to Sample or NULL if there is no reference to a
2899 * sample saved in the .gig file
2900 */
2901 Sample* Region::GetSample() {
2902 if (pSample) return static_cast<gig::Sample*>(pSample);
2903 else return static_cast<gig::Sample*>(pSample = GetSampleFromWavePool(WavePoolTableIndex));
2904 }
2905
2906 Sample* Region::GetSampleFromWavePool(unsigned int WavePoolTableIndex, progress_t* pProgress) {
2907 if ((int32_t)WavePoolTableIndex == -1) return NULL;
2908 File* file = (File*) GetParent()->GetParent();
2909 if (!file->pWavePoolTable) return NULL;
2910 unsigned long soughtoffset = file->pWavePoolTable[WavePoolTableIndex];
2911 unsigned long soughtfileno = file->pWavePoolTableHi[WavePoolTableIndex];
2912 Sample* sample = file->GetFirstSample(pProgress);
2913 while (sample) {
2914 if (sample->ulWavePoolOffset == soughtoffset &&
2915 sample->FileNo == soughtfileno) return static_cast<gig::Sample*>(sample);
2916 sample = file->GetNextSample();
2917 }
2918 return NULL;
2919 }
2920
2921
2922
2923 // *************** Instrument ***************
2924 // *
2925
2926 Instrument::Instrument(File* pFile, RIFF::List* insList, progress_t* pProgress) : DLS::Instrument((DLS::File*)pFile, insList) {
2927 static const DLS::Info::FixedStringLength fixedStringLengths[] = {
2928 { CHUNK_ID_INAM, 64 },
2929 { CHUNK_ID_ISFT, 12 },
2930 { 0, 0 }
2931 };
2932 pInfo->FixedStringLengths = fixedStringLengths;
2933
2934 // Initialization
2935 for (int i = 0; i < 128; i++) RegionKeyTable[i] = NULL;
2936 EffectSend = 0;
2937 Attenuation = 0;
2938 FineTune = 0;
2939 PitchbendRange = 0;
2940 PianoReleaseMode = false;
2941 DimensionKeyRange.low = 0;
2942 DimensionKeyRange.high = 0;
2943
2944 // Loading
2945 RIFF::List* lart = insList->GetSubList(LIST_TYPE_LART);
2946 if (lart) {
2947 RIFF::Chunk* _3ewg = lart->GetSubChunk(CHUNK_ID_3EWG);
2948 if (_3ewg) {
2949 EffectSend = _3ewg->ReadUint16();
2950 Attenuation = _3ewg->ReadInt32();
2951 FineTune = _3ewg->ReadInt16();
2952 PitchbendRange = _3ewg->ReadInt16();
2953 uint8_t dimkeystart = _3ewg->ReadUint8();
2954 PianoReleaseMode = dimkeystart & 0x01;
2955 DimensionKeyRange.low = dimkeystart >> 1;
2956 DimensionKeyRange.high = _3ewg->ReadUint8();
2957 }
2958 }
2959
2960 if (!pRegions) pRegions = new RegionList;
2961 RIFF::List* lrgn = insList->GetSubList(LIST_TYPE_LRGN);
2962 if (lrgn) {
2963 RIFF::List* rgn = lrgn->GetFirstSubList();
2964 while (rgn) {
2965 if (rgn->GetListType() == LIST_TYPE_RGN) {
2966 __notify_progress(pProgress, (float) pRegions->size() / (float) Regions);
2967 pRegions->push_back(new Region(this, rgn));
2968 }
2969 rgn = lrgn->GetNextSubList();
2970 }
2971 // Creating Region Key Table for fast lookup
2972 UpdateRegionKeyTable();
2973 }
2974
2975 __notify_progress(pProgress, 1.0f); // notify done
2976 }
2977
2978 void Instrument::UpdateRegionKeyTable() {
2979 for (int i = 0; i < 128; i++) RegionKeyTable[i] = NULL;
2980 RegionList::iterator iter = pRegions->begin();
2981 RegionList::iterator end = pRegions->end();
2982 for (; iter != end; ++iter) {
2983 gig::Region* pRegion = static_cast<gig::Region*>(*iter);
2984 for (int iKey = pRegion->KeyRange.low; iKey <= pRegion->KeyRange.high; iKey++) {
2985 RegionKeyTable[iKey] = pRegion;
2986 }
2987 }
2988 }
2989
2990 Instrument::~Instrument() {
2991 }
2992
2993 /**
2994 * Apply Instrument with all its Regions to the respective RIFF chunks.
2995 * You have to call File::Save() to make changes persistent.
2996 *
2997 * Usually there is absolutely no need to call this method explicitly.
2998 * It will be called automatically when File::Save() was called.
2999 *
3000 * @throws gig::Exception if samples cannot be dereferenced
3001 */
3002 void Instrument::UpdateChunks() {
3003 // first update base classes' chunks
3004 DLS::Instrument::UpdateChunks();
3005
3006 // update Regions' chunks
3007 {
3008 RegionList::iterator iter = pRegions->begin();
3009 RegionList::iterator end = pRegions->end();
3010 for (; iter != end; ++iter)
3011 (*iter)->UpdateChunks();
3012 }
3013
3014 // make sure 'lart' RIFF list chunk exists
3015 RIFF::List* lart = pCkInstrument->GetSubList(LIST_TYPE_LART);
3016 if (!lart) lart = pCkInstrument->AddSubList(LIST_TYPE_LART);
3017 // make sure '3ewg' RIFF chunk exists
3018 RIFF::Chunk* _3ewg = lart->GetSubChunk(CHUNK_ID_3EWG);
3019 if (!_3ewg) {
3020 File* pFile = (File*) GetParent();
3021
3022 // 3ewg is bigger in gig3, as it includes the iMIDI rules
3023 int size = (pFile->pVersion && pFile->pVersion->major == 3) ? 16416 : 12;
3024 _3ewg = lart->AddSubChunk(CHUNK_ID_3EWG, size);
3025 memset(_3ewg->LoadChunkData(), 0, size);
3026 }
3027 // update '3ewg' RIFF chunk
3028 uint8_t* pData = (uint8_t*) _3ewg->LoadChunkData();
3029 store16(&pData[0], EffectSend);
3030 store32(&pData[2], Attenuation);
3031 store16(&pData[6], FineTune);
3032 store16(&pData[8], PitchbendRange);
3033 const uint8_t dimkeystart = (PianoReleaseMode ? 0x01 : 0x00) |
3034 DimensionKeyRange.low << 1;
3035 pData[10] = dimkeystart;
3036 pData[11] = DimensionKeyRange.high;
3037 }
3038
3039 /**
3040 * Returns the appropriate Region for a triggered note.
3041 *
3042 * @param Key MIDI Key number of triggered note / key (0 - 127)
3043 * @returns pointer adress to the appropriate Region or NULL if there
3044 * there is no Region defined for the given \a Key
3045 */
3046 Region* Instrument::GetRegion(unsigned int Key) {
3047 if (!pRegions || pRegions->empty() || Key > 127) return NULL;
3048 return RegionKeyTable[Key];
3049
3050 /*for (int i = 0; i < Regions; i++) {
3051 if (Key <= pRegions[i]->KeyRange.high &&
3052 Key >= pRegions[i]->KeyRange.low) return pRegions[i];
3053 }
3054 return NULL;*/
3055 }
3056
3057 /**
3058 * Returns the first Region of the instrument. You have to call this
3059 * method once before you use GetNextRegion().
3060 *
3061 * @returns pointer address to first region or NULL if there is none
3062 * @see GetNextRegion()
3063 */
3064 Region* Instrument::GetFirstRegion() {
3065 if (!pRegions) return NULL;
3066 RegionsIterator = pRegions->begin();
3067 return static_cast<gig::Region*>( (RegionsIterator != pRegions->end()) ? *RegionsIterator : NULL );
3068 }
3069
3070 /**
3071 * Returns the next Region of the instrument. You have to call
3072 * GetFirstRegion() once before you can use this method. By calling this
3073 * method multiple times it iterates through the available Regions.
3074 *
3075 * @returns pointer address to the next region or NULL if end reached
3076 * @see GetFirstRegion()
3077 */
3078 Region* Instrument::GetNextRegion() {
3079 if (!pRegions) return NULL;
3080 RegionsIterator++;
3081 return static_cast<gig::Region*>( (RegionsIterator != pRegions->end()) ? *RegionsIterator : NULL );
3082 }
3083
3084 Region* Instrument::AddRegion() {
3085 // create new Region object (and its RIFF chunks)
3086 RIFF::List* lrgn = pCkInstrument->GetSubList(LIST_TYPE_LRGN);
3087 if (!lrgn) lrgn = pCkInstrument->AddSubList(LIST_TYPE_LRGN);
3088 RIFF::List* rgn = lrgn->AddSubList(LIST_TYPE_RGN);
3089 Region* pNewRegion = new Region(this, rgn);
3090 pRegions->push_back(pNewRegion);
3091 Regions = pRegions->size();
3092 // update Region key table for fast lookup
3093 UpdateRegionKeyTable();
3094 // done
3095 return pNewRegion;
3096 }
3097
3098 void Instrument::DeleteRegion(Region* pRegion) {
3099 if (!pRegions) return;
3100 DLS::Instrument::DeleteRegion((DLS::Region*) pRegion);
3101 // update Region key table for fast lookup
3102 UpdateRegionKeyTable();
3103 }
3104
3105
3106
3107 // *************** Group ***************
3108 // *
3109
3110 /** @brief Constructor.
3111 *
3112 * @param file - pointer to the gig::File object
3113 * @param ck3gnm - pointer to 3gnm chunk associated with this group or
3114 * NULL if this is a new Group
3115 */
3116 Group::Group(File* file, RIFF::Chunk* ck3gnm) {
3117 pFile = file;
3118 pNameChunk = ck3gnm;
3119 ::LoadString(pNameChunk, Name);
3120 }
3121
3122 Group::~Group() {
3123 // remove the chunk associated with this group (if any)
3124 if (pNameChunk) pNameChunk->GetParent()->DeleteSubChunk(pNameChunk);
3125 }
3126
3127 /** @brief Update chunks with current group settings.
3128 *
3129 * Apply current Group field values to the respective chunks. You have
3130 * to call File::Save() to make changes persistent.
3131 *
3132 * Usually there is absolutely no need to call this method explicitly.
3133 * It will be called automatically when File::Save() was called.
3134 */
3135 void Group::UpdateChunks() {
3136 // make sure <3gri> and <3gnl> list chunks exist
3137 RIFF::List* _3gri = pFile->pRIFF->GetSubList(LIST_TYPE_3GRI);
3138 if (!_3gri) {
3139 _3gri = pFile->pRIFF->AddSubList(LIST_TYPE_3GRI);
3140 pFile->pRIFF->MoveSubChunk(_3gri, pFile->pRIFF->GetSubChunk(CHUNK_ID_PTBL));
3141 }
3142 RIFF::List* _3gnl = _3gri->GetSubList(LIST_TYPE_3GNL);
3143 if (!_3gnl) _3gnl = _3gri->AddSubList(LIST_TYPE_3GNL);
3144
3145 if (!pNameChunk && pFile->pVersion && pFile->pVersion->major == 3) {
3146 // v3 has a fixed list of 128 strings, find a free one
3147 for (RIFF::Chunk* ck = _3gnl->GetFirstSubChunk() ; ck ; ck = _3gnl->GetNextSubChunk()) {
3148 if (strcmp(static_cast<char*>(ck->LoadChunkData()), "") == 0) {
3149 pNameChunk = ck;
3150 break;
3151 }
3152 }
3153 }
3154
3155 // now store the name of this group as <3gnm> chunk as subchunk of the <3gnl> list chunk
3156 ::SaveString(CHUNK_ID_3GNM, pNameChunk, _3gnl, Name, String("Unnamed Group"), true, 64);
3157 }
3158
3159 /**
3160 * Returns the first Sample of this Group. You have to call this method
3161 * once before you use GetNextSample().
3162 *
3163 * <b>Notice:</b> this method might block for a long time, in case the
3164 * samples of this .gig file were not scanned yet
3165 *
3166 * @returns pointer address to first Sample or NULL if there is none
3167 * applied to this Group
3168 * @see GetNextSample()
3169 */
3170 Sample* Group::GetFirstSample() {
3171 // FIXME: lazy und unsafe implementation, should be an autonomous iterator
3172 for (Sample* pSample = pFile->GetFirstSample(); pSample; pSample = pFile->GetNextSample()) {
3173 if (pSample->GetGroup() == this) return pSample;
3174 }
3175 return NULL;
3176 }
3177
3178 /**
3179 * Returns the next Sample of the Group. You have to call
3180 * GetFirstSample() once before you can use this method. By calling this
3181 * method multiple times it iterates through the Samples assigned to
3182 * this Group.
3183 *
3184 * @returns pointer address to the next Sample of this Group or NULL if
3185 * end reached
3186 * @see GetFirstSample()
3187 */
3188 Sample* Group::GetNextSample() {
3189 // FIXME: lazy und unsafe implementation, should be an autonomous iterator
3190 for (Sample* pSample = pFile->GetNextSample(); pSample; pSample = pFile->GetNextSample()) {
3191 if (pSample->GetGroup() == this) return pSample;
3192 }
3193 return NULL;
3194 }
3195
3196 /**
3197 * Move Sample given by \a pSample from another Group to this Group.
3198 */
3199 void Group::AddSample(Sample* pSample) {
3200 pSample->pGroup = this;
3201 }
3202
3203 /**
3204 * Move all members of this group to another group (preferably the 1st
3205 * one except this). This method is called explicitly by
3206 * File::DeleteGroup() thus when a Group was deleted. This code was
3207 * intentionally not placed in the destructor!
3208 */
3209 void Group::MoveAll() {
3210 // get "that" other group first
3211 Group* pOtherGroup = NULL;
3212 for (pOtherGroup = pFile->GetFirstGroup(); pOtherGroup; pOtherGroup = pFile->GetNextGroup()) {
3213 if (pOtherGroup != this) break;
3214 }
3215 if (!pOtherGroup) throw Exception(
3216 "Could not move samples to another group, since there is no "
3217 "other Group. This is a bug, report it!"
3218 );
3219 // now move all samples of this group to the other group
3220 for (Sample* pSample = GetFirstSample(); pSample; pSample = GetNextSample()) {
3221 pOtherGroup->AddSample(pSample);
3222 }
3223 }
3224
3225
3226
3227 // *************** File ***************
3228 // *
3229
3230 /// Reflects Gigasampler file format version 2.0 (1998-06-28).
3231 const DLS::version_t File::VERSION_2 = {
3232 0, 2, 19980628 & 0xffff, 19980628 >> 16
3233 };
3234
3235 /// Reflects Gigasampler file format version 3.0 (2003-03-31).
3236 const DLS::version_t File::VERSION_3 = {
3237 0, 3, 20030331 & 0xffff, 20030331 >> 16
3238 };
3239
3240 const DLS::Info::FixedStringLength File::FixedStringLengths[] = {
3241 { CHUNK_ID_IARL, 256 },
3242 { CHUNK_ID_IART, 128 },
3243 { CHUNK_ID_ICMS, 128 },
3244 { CHUNK_ID_ICMT, 1024 },
3245 { CHUNK_ID_ICOP, 128 },
3246 { CHUNK_ID_ICRD, 128 },
3247 { CHUNK_ID_IENG, 128 },
3248 { CHUNK_ID_IGNR, 128 },
3249 { CHUNK_ID_IKEY, 128 },
3250 { CHUNK_ID_IMED, 128 },
3251 { CHUNK_ID_INAM, 128 },
3252 { CHUNK_ID_IPRD, 128 },
3253 { CHUNK_ID_ISBJ, 128 },
3254 { CHUNK_ID_ISFT, 128 },
3255 { CHUNK_ID_ISRC, 128 },
3256 { CHUNK_ID_ISRF, 128 },
3257 { CHUNK_ID_ITCH, 128 },
3258 { 0, 0 }
3259 };
3260
3261 File::File() : DLS::File() {
3262 *pVersion = VERSION_3;
3263 pGroups = NULL;
3264 pInfo->FixedStringLengths = FixedStringLengths;
3265 pInfo->ArchivalLocation = String(256, ' ');
3266
3267 // add some mandatory chunks to get the file chunks in right
3268 // order (INFO chunk will be moved to first position later)
3269 pRIFF->AddSubChunk(CHUNK_ID_VERS, 8);
3270 pRIFF->AddSubChunk(CHUNK_ID_COLH, 4);
3271 pRIFF->AddSubChunk(CHUNK_ID_DLID, 16);
3272
3273 GenerateDLSID();
3274 }
3275
3276 File::File(RIFF::File* pRIFF) : DLS::File(pRIFF) {
3277 pGroups = NULL;
3278 pInfo->FixedStringLengths = FixedStringLengths;
3279 }
3280
3281 File::~File() {
3282 if (pGroups) {
3283 std::list<Group*>::iterator iter = pGroups->begin();
3284 std::list<Group*>::iterator end = pGroups->end();
3285 while (iter != end) {
3286 delete *iter;
3287 ++iter;
3288 }
3289 delete pGroups;
3290 }
3291 }
3292
3293 Sample* File::GetFirstSample(progress_t* pProgress) {
3294 if (!pSamples) LoadSamples(pProgress);
3295 if (!pSamples) return NULL;
3296 SamplesIterator = pSamples->begin();
3297 return static_cast<gig::Sample*>( (SamplesIterator != pSamples->end()) ? *SamplesIterator : NULL );
3298 }
3299
3300 Sample* File::GetNextSample() {
3301 if (!pSamples) return NULL;
3302 SamplesIterator++;
3303 return static_cast<gig::Sample*>( (SamplesIterator != pSamples->end()) ? *SamplesIterator : NULL );
3304 }
3305
3306 /** @brief Add a new sample.
3307 *
3308 * This will create a new Sample object for the gig file. You have to
3309 * call Save() to make this persistent to the file.
3310 *
3311 * @returns pointer to new Sample object
3312 */
3313 Sample* File::AddSample() {
3314 if (!pSamples) LoadSamples();
3315 __ensureMandatoryChunksExist();
3316 RIFF::List* wvpl = pRIFF->GetSubList(LIST_TYPE_WVPL);
3317 // create new Sample object and its respective 'wave' list chunk
3318 RIFF::List* wave = wvpl->AddSubList(LIST_TYPE_WAVE);
3319 Sample* pSample = new Sample(this, wave, 0 /*arbitrary value, we update offsets when we save*/);
3320
3321 // add mandatory chunks to get the chunks in right order
3322 wave->AddSubChunk(CHUNK_ID_FMT, 16);
3323 wave->AddSubList(LIST_TYPE_INFO);
3324
3325 pSamples->push_back(pSample);
3326 return pSample;
3327 }
3328
3329 /** @brief Delete a sample.
3330 *
3331 * This will delete the given Sample object from the gig file. Any
3332 * references to this sample from Regions and DimensionRegions will be
3333 * removed. You have to call Save() to make this persistent to the file.
3334 *
3335 * @param pSample - sample to delete
3336 * @throws gig::Exception if given sample could not be found
3337 */
3338 void File::DeleteSample(Sample* pSample) {
3339 if (!pSamples || !pSamples->size()) throw gig::Exception("Could not delete sample as there are no samples");
3340 SampleList::iterator iter = find(pSamples->begin(), pSamples->end(), (DLS::Sample*) pSample);
3341 if (iter == pSamples->end()) throw gig::Exception("Could not delete sample, could not find given sample");
3342 if (SamplesIterator != pSamples->end() && *SamplesIterator == pSample) ++SamplesIterator; // avoid iterator invalidation
3343 pSamples->erase(iter);
3344 delete pSample;
3345
3346 // remove all references to the sample
3347 for (Instrument* instrument = GetFirstInstrument() ; instrument ;
3348 instrument = GetNextInstrument()) {
3349 for (Region* region = instrument->GetFirstRegion() ; region ;
3350 region = instrument->GetNextRegion()) {
3351
3352 if (region->GetSample() == pSample) region->SetSample(NULL);
3353
3354 for (int i = 0 ; i < region->DimensionRegions ; i++) {
3355 gig::DimensionRegion *d = region->pDimensionRegions[i];
3356 if (d->pSample == pSample) d->pSample = NULL;
3357 }
3358 }
3359 }
3360 }
3361
3362 void File::LoadSamples() {
3363 LoadSamples(NULL);
3364 }
3365
3366 void File::LoadSamples(progress_t* pProgress) {
3367 // Groups must be loaded before samples, because samples will try
3368 // to resolve the group they belong to
3369 if (!pGroups) LoadGroups();
3370
3371 if (!pSamples) pSamples = new SampleList;
3372
3373 RIFF::File* file = pRIFF;
3374
3375 // just for progress calculation
3376 int iSampleIndex = 0;
3377 int iTotalSamples = WavePoolCount;
3378
3379 // check if samples should be loaded from extension files
3380 int lastFileNo = 0;
3381 for (int i = 0 ; i < WavePoolCount ; i++) {
3382 if (pWavePoolTableHi[i] > lastFileNo) lastFileNo = pWavePoolTableHi[i];
3383 }
3384 String name(pRIFF->GetFileName());
3385 int nameLen = name.length();
3386 char suffix[6];
3387 if (nameLen > 4 && name.substr(nameLen - 4) == ".gig") nameLen -= 4;
3388
3389 for (int fileNo = 0 ; ; ) {
3390 RIFF::List* wvpl = file->GetSubList(LIST_TYPE_WVPL);
3391 if (wvpl) {
3392 unsigned long wvplFileOffset = wvpl->GetFilePos();
3393 RIFF::List* wave = wvpl->GetFirstSubList();
3394 while (wave) {
3395 if (wave->GetListType() == LIST_TYPE_WAVE) {
3396 // notify current progress
3397 const float subprogress = (float) iSampleIndex / (float) iTotalSamples;
3398 __notify_progress(pProgress, subprogress);
3399
3400 unsigned long waveFileOffset = wave->GetFilePos();
3401 pSamples->push_back(new Sample(this, wave, waveFileOffset - wvplFileOffset, fileNo));
3402
3403 iSampleIndex++;
3404 }
3405 wave = wvpl->GetNextSubList();
3406 }
3407
3408 if (fileNo == lastFileNo) break;
3409
3410 // open extension file (*.gx01, *.gx02, ...)
3411 fileNo++;
3412 sprintf(suffix, ".gx%02d", fileNo);
3413 name.replace(nameLen, 5, suffix);
3414 file = new RIFF::File(name);
3415 ExtensionFiles.push_back(file);
3416 } else break;
3417 }
3418
3419 __notify_progress(pProgress, 1.0); // notify done
3420 }
3421
3422 Instrument* File::GetFirstInstrument() {
3423 if (!pInstruments) LoadInstruments();
3424 if (!pInstruments) return NULL;
3425 InstrumentsIterator = pInstruments->begin();
3426 return static_cast<gig::Instrument*>( (InstrumentsIterator != pInstruments->end()) ? *InstrumentsIterator : NULL );
3427 }
3428
3429 Instrument* File::GetNextInstrument() {
3430 if (!pInstruments) return NULL;
3431 InstrumentsIterator++;
3432 return static_cast<gig::Instrument*>( (InstrumentsIterator != pInstruments->end()) ? *InstrumentsIterator : NULL );
3433 }
3434
3435 /**
3436 * Returns the instrument with the given index.
3437 *
3438 * @param index - number of the sought instrument (0..n)
3439 * @param pProgress - optional: callback function for progress notification
3440 * @returns sought instrument or NULL if there's no such instrument
3441 */
3442 Instrument* File::GetInstrument(uint index, progress_t* pProgress) {
3443 if (!pInstruments) {
3444 // TODO: hack - we simply load ALL samples here, it would have been done in the Region constructor anyway (ATM)
3445
3446 // sample loading subtask
3447 progress_t subprogress;
3448 __divide_progress(pProgress, &subprogress, 3.0f, 0.0f); // randomly schedule 33% for this subtask
3449 __notify_progress(&subprogress, 0.0f);
3450 GetFirstSample(&subprogress); // now force all samples to be loaded
3451 __notify_progress(&subprogress, 1.0f);
3452
3453 // instrument loading subtask
3454 if (pProgress && pProgress->callback) {
3455 subprogress.__range_min = subprogress.__range_max;
3456 subprogress.__range_max = pProgress->__range_max; // schedule remaining percentage for this subtask
3457 }
3458 __notify_progress(&subprogress, 0.0f);
3459 LoadInstruments(&subprogress);
3460 __notify_progress(&subprogress, 1.0f);
3461 }
3462 if (!pInstruments) return NULL;
3463 InstrumentsIterator = pInstruments->begin();
3464 for (uint i = 0; InstrumentsIterator != pInstruments->end(); i++) {
3465 if (i == index) return static_cast<gig::Instrument*>( *InstrumentsIterator );
3466 InstrumentsIterator++;
3467 }
3468 return NULL;
3469 }
3470
3471 /** @brief Add a new instrument definition.
3472 *
3473 * This will create a new Instrument object for the gig file. You have
3474 * to call Save() to make this persistent to the file.
3475 *
3476 * @returns pointer to new Instrument object
3477 */
3478 Instrument* File::AddInstrument() {
3479 if (!pInstruments) LoadInstruments();
3480 __ensureMandatoryChunksExist();
3481 RIFF::List* lstInstruments = pRIFF->GetSubList(LIST_TYPE_LINS);
3482 RIFF::List* lstInstr = lstInstruments->AddSubList(LIST_TYPE_INS);
3483
3484 // add mandatory chunks to get the chunks in right order
3485 lstInstr->AddSubList(LIST_TYPE_INFO);
3486 lstInstr->AddSubChunk(CHUNK_ID_DLID, 16);
3487
3488 Instrument* pInstrument = new Instrument(this, lstInstr);
3489 pInstrument->GenerateDLSID();
3490
3491 lstInstr->AddSubChunk(CHUNK_ID_INSH, 12);
3492
3493 // this string is needed for the gig to be loadable in GSt:
3494 pInstrument->pInfo->Software = "Endless Wave";
3495
3496 pInstruments->push_back(pInstrument);
3497 return pInstrument;
3498 }
3499
3500 /** @brief Delete an instrument.
3501 *
3502 * This will delete the given Instrument object from the gig file. You
3503 * have to call Save() to make this persistent to the file.
3504 *
3505 * @param pInstrument - instrument to delete
3506 * @throws gig::Exception if given instrument could not be found
3507 */
3508 void File::DeleteInstrument(Instrument* pInstrument) {
3509 if (!pInstruments) throw gig::Exception("Could not delete instrument as there are no instruments");
3510 InstrumentList::iterator iter = find(pInstruments->begin(), pInstruments->end(), (DLS::Instrument*) pInstrument);
3511 if (iter == pInstruments->end()) throw gig::Exception("Could not delete instrument, could not find given instrument");
3512 pInstruments->erase(iter);
3513 delete pInstrument;
3514 }
3515
3516 void File::LoadInstruments() {
3517 LoadInstruments(NULL);
3518 }
3519
3520 void File::LoadInstruments(progress_t* pProgress) {
3521 if (!pInstruments) pInstruments = new InstrumentList;
3522 RIFF::List* lstInstruments = pRIFF->GetSubList(LIST_TYPE_LINS);
3523 if (lstInstruments) {
3524 int iInstrumentIndex = 0;
3525 RIFF::List* lstInstr = lstInstruments->GetFirstSubList();
3526 while (lstInstr) {
3527 if (lstInstr->GetListType() == LIST_TYPE_INS) {
3528 // notify current progress
3529 const float localProgress = (float) iInstrumentIndex / (float) Instruments;
3530 __notify_progress(pProgress, localProgress);
3531
3532 // divide local progress into subprogress for loading current Instrument
3533 progress_t subprogress;
3534 __divide_progress(pProgress, &subprogress, Instruments, iInstrumentIndex);
3535
3536 pInstruments->push_back(new Instrument(this, lstInstr, &subprogress));
3537
3538 iInstrumentIndex++;
3539 }
3540 lstInstr = lstInstruments->GetNextSubList();
3541 }
3542 __notify_progress(pProgress, 1.0); // notify done
3543 }
3544 }
3545
3546 /// Updates the 3crc chunk with the checksum of a sample. The
3547 /// update is done directly to disk, as this method is called
3548 /// after File::Save()
3549 void File::SetSampleChecksum(Sample* pSample, uint32_t crc) {
3550 RIFF::Chunk* _3crc = pRIFF->GetSubChunk(CHUNK_ID_3CRC);
3551 if (!_3crc) return;
3552
3553 // get the index of the sample
3554 int iWaveIndex = -1;
3555 File::SampleList::iterator iter = pSamples->begin();
3556 File::SampleList::iterator end = pSamples->end();
3557 for (int index = 0; iter != end; ++iter, ++index) {
3558 if (*iter == pSample) {
3559 iWaveIndex = index;
3560 break;
3561 }
3562 }
3563 if (iWaveIndex < 0) throw gig::Exception("Could not update crc, could not find sample");
3564
3565 // write the CRC-32 checksum to disk
3566 _3crc->SetPos(iWaveIndex * 8);
3567 uint32_t tmp = 1;
3568 _3crc->WriteUint32(&tmp); // unknown, always 1?
3569 _3crc->WriteUint32(&crc);
3570 }
3571
3572 Group* File::GetFirstGroup() {
3573 if (!pGroups) LoadGroups();
3574 // there must always be at least one group
3575 GroupsIterator = pGroups->begin();
3576 return *GroupsIterator;
3577 }
3578
3579 Group* File::GetNextGroup() {
3580 if (!pGroups) return NULL;
3581 ++GroupsIterator;
3582 return (GroupsIterator == pGroups->end()) ? NULL : *GroupsIterator;
3583 }
3584
3585 /**
3586 * Returns the group with the given index.
3587 *
3588 * @param index - number of the sought group (0..n)
3589 * @returns sought group or NULL if there's no such group
3590 */
3591 Group* File::GetGroup(uint index) {
3592 if (!pGroups) LoadGroups();
3593 GroupsIterator = pGroups->begin();
3594 for (uint i = 0; GroupsIterator != pGroups->end(); i++) {
3595 if (i == index) return *GroupsIterator;
3596 ++GroupsIterator;
3597 }
3598 return NULL;
3599 }
3600
3601 Group* File::AddGroup() {
3602 if (!pGroups) LoadGroups();
3603 // there must always be at least one group
3604 __ensureMandatoryChunksExist();
3605 Group* pGroup = new Group(this, NULL);
3606 pGroups->push_back(pGroup);
3607 return pGroup;
3608 }
3609
3610 /** @brief Delete a group and its samples.
3611 *
3612 * This will delete the given Group object and all the samples that
3613 * belong to this group from the gig file. You have to call Save() to
3614 * make this persistent to the file.
3615 *
3616 * @param pGroup - group to delete
3617 * @throws gig::Exception if given group could not be found
3618 */
3619 void File::DeleteGroup(Group* pGroup) {
3620 if (!pGroups) LoadGroups();
3621 std::list<Group*>::iterator iter = find(pGroups->begin(), pGroups->end(), pGroup);
3622 if (iter == pGroups->end()) throw gig::Exception("Could not delete group, could not find given group");
3623 if (pGroups->size() == 1) throw gig::Exception("Cannot delete group, there must be at least one default group!");
3624 // delete all members of this group
3625 for (Sample* pSample = pGroup->GetFirstSample(); pSample; pSample = pGroup->GetNextSample()) {
3626 DeleteSample(pSample);
3627 }
3628 // now delete this group object
3629 pGroups->erase(iter);
3630 delete pGroup;
3631 }
3632
3633 /** @brief Delete a group.
3634 *
3635 * This will delete the given Group object from the gig file. All the
3636 * samples that belong to this group will not be deleted, but instead
3637 * be moved to another group. You have to call Save() to make this
3638 * persistent to the file.
3639 *
3640 * @param pGroup - group to delete
3641 * @throws gig::Exception if given group could not be found
3642 */
3643 void File::DeleteGroupOnly(Group* pGroup) {
3644 if (!pGroups) LoadGroups();
3645 std::list<Group*>::iterator iter = find(pGroups->begin(), pGroups->end(), pGroup);
3646 if (iter == pGroups->end()) throw gig::Exception("Could not delete group, could not find given group");
3647 if (pGroups->size() == 1) throw gig::Exception("Cannot delete group, there must be at least one default group!");
3648 // move all members of this group to another group
3649 pGroup->MoveAll();
3650 pGroups->erase(iter);
3651 delete pGroup;
3652 }
3653
3654 void File::LoadGroups() {
3655 if (!pGroups) pGroups = new std::list<Group*>;
3656 // try to read defined groups from file
3657 RIFF::List* lst3gri = pRIFF->GetSubList(LIST_TYPE_3GRI);
3658 if (lst3gri) {
3659 RIFF::List* lst3gnl = lst3gri->GetSubList(LIST_TYPE_3GNL);
3660 if (lst3gnl) {
3661 RIFF::Chunk* ck = lst3gnl->GetFirstSubChunk();
3662 while (ck) {
3663 if (ck->GetChunkID() == CHUNK_ID_3GNM) {
3664 if (pVersion && pVersion->major == 3 &&
3665 strcmp(static_cast<char*>(ck->LoadChunkData()), "") == 0) break;
3666
3667 pGroups->push_back(new Group(this, ck));
3668 }
3669 ck = lst3gnl->GetNextSubChunk();
3670 }
3671 }
3672 }
3673 // if there were no group(s), create at least the mandatory default group
3674 if (!pGroups->size()) {
3675 Group* pGroup = new Group(this, NULL);
3676 pGroup->Name = "Default Group";
3677 pGroups->push_back(pGroup);
3678 }
3679 }
3680
3681 /**
3682 * Apply all the gig file's current instruments, samples, groups and settings
3683 * to the respective RIFF chunks. You have to call Save() to make changes
3684 * persistent.
3685 *
3686 * Usually there is absolutely no need to call this method explicitly.
3687 * It will be called automatically when File::Save() was called.
3688 *
3689 * @throws Exception - on errors
3690 */
3691 void File::UpdateChunks() {
3692 bool newFile = pRIFF->GetSubList(LIST_TYPE_INFO) == NULL;
3693
3694 b64BitWavePoolOffsets = pVersion && pVersion->major == 3;
3695
3696 // first update base class's chunks
3697 DLS::File::UpdateChunks();
3698
3699 if (newFile) {
3700 // INFO was added by Resource::UpdateChunks - make sure it
3701 // is placed first in file
3702 RIFF::Chunk* info = pRIFF->GetSubList(LIST_TYPE_INFO);
3703 RIFF::Chunk* first = pRIFF->GetFirstSubChunk();
3704 if (first != info) {
3705 pRIFF->MoveSubChunk(info, first);
3706 }
3707 }
3708
3709 // update group's chunks
3710 if (pGroups) {
3711 std::list<Group*>::iterator iter = pGroups->begin();
3712 std::list<Group*>::iterator end = pGroups->end();
3713 for (; iter != end; ++iter) {
3714 (*iter)->UpdateChunks();
3715 }
3716
3717 // v3: make sure the file has 128 3gnm chunks
3718 if (pVersion && pVersion->major == 3) {
3719 RIFF::List* _3gnl = pRIFF->GetSubList(LIST_TYPE_3GRI)->GetSubList(LIST_TYPE_3GNL);
3720 RIFF::Chunk* _3gnm = _3gnl->GetFirstSubChunk();
3721 for (int i = 0 ; i < 128 ; i++) {
3722 if (i >= pGroups->size()) ::SaveString(CHUNK_ID_3GNM, _3gnm, _3gnl, "", "", true, 64);
3723 if (_3gnm) _3gnm = _3gnl->GetNextSubChunk();
3724 }
3725 }
3726 }
3727
3728 // update einf chunk
3729
3730 // The einf chunk contains statistics about the gig file, such
3731 // as the number of regions and samples used by each
3732 // instrument. It is divided in equally sized parts, where the
3733 // first part contains information about the whole gig file,
3734 // and the rest of the parts map to each instrument in the
3735 // file.
3736 //
3737 // At the end of each part there is a bit map of each sample
3738 // in the file, where a set bit means that the sample is used
3739 // by the file/instrument.
3740 //
3741 // Note that there are several fields with unknown use. These
3742 // are set to zero.
3743
3744 int sublen = pSamples->size() / 8 + 49;
3745 int einfSize = (Instruments + 1) * sublen;
3746
3747 RIFF::Chunk* einf = pRIFF->GetSubChunk(CHUNK_ID_EINF);
3748 if (einf) {
3749 if (einf->GetSize() != einfSize) {
3750 einf->Resize(einfSize);
3751 memset(einf->LoadChunkData(), 0, einfSize);
3752 }
3753 } else if (newFile) {
3754 einf = pRIFF->AddSubChunk(CHUNK_ID_EINF, einfSize);
3755 }
3756 if (einf) {
3757 uint8_t* pData = (uint8_t*) einf->LoadChunkData();
3758
3759 std::map<gig::Sample*,int> sampleMap;
3760 int sampleIdx = 0;
3761 for (Sample* pSample = GetFirstSample(); pSample; pSample = GetNextSample()) {
3762 sampleMap[pSample] = sampleIdx++;
3763 }
3764
3765 int totnbusedsamples = 0;
3766 int totnbusedchannels = 0;
3767 int totnbregions = 0;
3768 int totnbdimregions = 0;
3769 int totnbloops = 0;
3770 int instrumentIdx = 0;
3771
3772 memset(&pData[48], 0, sublen - 48);
3773
3774 for (Instrument* instrument = GetFirstInstrument() ; instrument ;
3775 instrument = GetNextInstrument()) {
3776 int nbusedsamples = 0;
3777 int nbusedchannels = 0;
3778 int nbdimregions = 0;
3779 int nbloops = 0;
3780
3781 memset(&pData[(instrumentIdx + 1) * sublen + 48], 0, sublen - 48);
3782
3783 for (Region* region = instrument->GetFirstRegion() ; region ;
3784 region = instrument->GetNextRegion()) {
3785 for (int i = 0 ; i < region->DimensionRegions ; i++) {
3786 gig::DimensionRegion *d = region->pDimensionRegions[i];
3787 if (d->pSample) {
3788 int sampleIdx = sampleMap[d->pSample];
3789 int byte = 48 + sampleIdx / 8;
3790 int bit = 1 << (sampleIdx & 7);
3791 if ((pData[(instrumentIdx + 1) * sublen + byte] & bit) == 0) {
3792 pData[(instrumentIdx + 1) * sublen + byte] |= bit;
3793 nbusedsamples++;
3794 nbusedchannels += d->pSample->Channels;
3795
3796 if ((pData[byte] & bit) == 0) {
3797 pData[byte] |= bit;
3798 totnbusedsamples++;
3799 totnbusedchannels += d->pSample->Channels;
3800 }
3801 }
3802 }
3803 if (d->SampleLoops) nbloops++;
3804 }
3805 nbdimregions += region->DimensionRegions;
3806 }
3807 // first 4 bytes unknown - sometimes 0, sometimes length of einf part
3808 // store32(&pData[(instrumentIdx + 1) * sublen], sublen);
3809 store32(&pData[(instrumentIdx + 1) * sublen + 4], nbusedchannels);
3810 store32(&pData[(instrumentIdx + 1) * sublen + 8], nbusedsamples);
3811 store32(&pData[(instrumentIdx + 1) * sublen + 12], 1);
3812 store32(&pData[(instrumentIdx + 1) * sublen + 16], instrument->Regions);
3813 store32(&pData[(instrumentIdx + 1) * sublen + 20], nbdimregions);
3814 store32(&pData[(instrumentIdx + 1) * sublen + 24], nbloops);
3815 // next 8 bytes unknown
3816 store32(&pData[(instrumentIdx + 1) * sublen + 36], instrumentIdx);
3817 store32(&pData[(instrumentIdx + 1) * sublen + 40], pSamples->size());
3818 // next 4 bytes unknown
3819
3820 totnbregions += instrument->Regions;
3821 totnbdimregions += nbdimregions;
3822 totnbloops += nbloops;
3823 instrumentIdx++;
3824 }
3825 // first 4 bytes unknown - sometimes 0, sometimes length of einf part
3826 // store32(&pData[0], sublen);
3827 store32(&pData[4], totnbusedchannels);
3828 store32(&pData[8], totnbusedsamples);
3829 store32(&pData[12], Instruments);
3830 store32(&pData[16], totnbregions);
3831 store32(&pData[20], totnbdimregions);
3832 store32(&pData[24], totnbloops);
3833 // next 8 bytes unknown
3834 // next 4 bytes unknown, not always 0
3835 store32(&pData[40], pSamples->size());
3836 // next 4 bytes unknown
3837 }
3838
3839 // update 3crc chunk
3840
3841 // The 3crc chunk contains CRC-32 checksums for the
3842 // samples. The actual checksum values will be filled in
3843 // later, by Sample::Write.
3844
3845 RIFF::Chunk* _3crc = pRIFF->GetSubChunk(CHUNK_ID_3CRC);
3846 if (_3crc) {
3847 _3crc->Resize(pSamples->size() * 8);
3848 } else if (newFile) {
3849 _3crc = pRIFF->AddSubChunk(CHUNK_ID_3CRC, pSamples->size() * 8);
3850 _3crc->LoadChunkData();
3851
3852 // the order of einf and 3crc is not the same in v2 and v3
3853 if (einf && pVersion && pVersion->major == 3) pRIFF->MoveSubChunk(_3crc, einf);
3854 }
3855 }
3856
3857
3858
3859 // *************** Exception ***************
3860 // *
3861
3862 Exception::Exception(String Message) : DLS::Exception(Message) {
3863 }
3864
3865 void Exception::PrintMessage() {
3866 std::cout << "gig::Exception: " << Message << std::endl;
3867 }
3868
3869
3870 // *************** functions ***************
3871 // *
3872
3873 /**
3874 * Returns the name of this C++ library. This is usually "libgig" of
3875 * course. This call is equivalent to RIFF::libraryName() and
3876 * DLS::libraryName().
3877 */
3878 String libraryName() {
3879 return PACKAGE;
3880 }
3881
3882 /**
3883 * Returns version of this C++ library. This call is equivalent to
3884 * RIFF::libraryVersion() and DLS::libraryVersion().
3885 */
3886 String libraryVersion() {
3887 return VERSION;
3888 }
3889
3890 } // namespace gig

  ViewVC Help
Powered by ViewVC