-
Notifications
You must be signed in to change notification settings - Fork 0
/
CClmWriter.cpp
299 lines (254 loc) · 7.87 KB
/
CClmWriter.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
#include "stdafx.h"
#include "CClmWriter.h"
extern int g_cLocks;
const char CClmWriter::tagClmFile[32] = "OP2 Clump File Version 1.0\x01A";
ULONG __stdcall CClmWriter::AddRef()
{
return ++m_cRef;
}
ULONG __stdcall CClmWriter::Release()
{
if (--m_cRef != 0)
return m_cRef;
delete this;
return 0;
}
HRESULT __stdcall CClmWriter::QueryInterface(REFIID riid, void** ppv)
{
if(riid == IID_IUnknown)
*ppv = (IUnknown*)this;
else if(riid == IID_ArchiveWriter)
*ppv = (ArchiveWriter*)this;
else
{
*ppv = NULL;
return E_NOINTERFACE;
}
AddRef();
return S_OK;
}
// ArchiveWriter
// *************
HRESULT CClmWriter::AddToArchive(BSTR fileName, SeekableStreamReader *inStream, int reserved)
{
LinkedListNode *newNode;
int stringLength;
// Check for invalid parameters
if (reserved != 0)
return E_INVALIDARG;
if (inStream == NULL)
return E_INVALIDARG;
stringLength = SysStringLen(fileName); // Cache the string length
if (stringLength > 8)
return E_INVALIDARG;
// Create a new linked list node to hold the data
newNode = new LinkedListNode;
memset(newNode->indexEntry.fileName, 0, 8); // NULL pad the string/initialize
// Convert the filename from UNICODE to ASCII
WideCharToMultiByte(CP_ACP, 0, fileName, stringLength, newNode->indexEntry.fileName, stringLength, 0, 0);
// Store the stream pointer
newNode->inStream = inStream;
inStream->AddRef();
// Store the starting stream offset and data size
inStream->get_ReadOffset(&newNode->streamStartOffset);
inStream->get_StreamSize(&newNode->indexEntry.dataSize);
newNode->indexEntry.dataSize -= newNode->streamStartOffset; // Adjust for start of data
// Store the new node to the linked list
newNode->next = head;
head = newNode;
numNodes++;
// Update max data size
if (newNode->indexEntry.dataSize > maxDataSize)
maxDataSize = newNode->indexEntry.dataSize;
return S_OK;
}
HRESULT CClmWriter::WriteArchive(StreamWriter *outStream)
{
WAVEFORMATEX waveFormat;
int temp = 0; // Used for NULL padding
int offset;
int numBytesWritten;
LinkedListNode *current;
char *buffer = NULL;
// Sort the index
head = SortIndex(head);
// Prepare WAVEFORMATEX structure
// ******************************
waveFormat.cbSize = sizeof(WAVEFORMATEX);
waveFormat.wFormatTag = WAVE_FORMAT_PCM;
waveFormat.nChannels = 1;
waveFormat.nSamplesPerSec = 22050;
waveFormat.nAvgBytesPerSec = 44100;
waveFormat.nBlockAlign = 2;
waveFormat.wBitsPerSample = 16;
// Create a write buffer
buffer = new char[maxDataSize];
if (buffer == NULL)
return E_OUTOFMEMORY;
// Begin writing the CLM file contents
// ***********************************
// Write out the header
// ********************
// Write the header tag
outStream->Write(32, (int)tagClmFile, &numBytesWritten);
// Write the WAVEFORMATEX structure
outStream->Write(sizeof(WAVEFORMATEX), (int)&waveFormat, &numBytesWritten);
// Pad with NULL bytes
outStream->Write(2, (int)&temp, &numBytesWritten);
// Write unknown DWORD **TODO** Find out what this DWORD means
outStream->Write(4, (int)&unknown, &numBytesWritten);
// Write out the number of files stored in archive
outStream->Write(4, (int)&numNodes, &numBytesWritten);
// Write out the index table
// *************************
// Calculate the starting data offset
offset = 32 + sizeof(WAVEFORMATEX) + 2 + 4 + 4 + numNodes*sizeof(IndexEntry);
current = head;
while (current)
{
// Store the offset to the data
current->indexEntry.dataOffset = offset;
// Update the current data offset
offset += (current->indexEntry.dataSize + 3) & ~3;
// Write out the index entry
outStream->Write(sizeof(IndexEntry), (int)¤t->indexEntry, &numBytesWritten);
// Process next node
current = current->next;
}
// Write out the file data
// ***********************
current = head;
while (current)
{
// Seek to the start of the file data
current->inStream->Seek(current->streamStartOffset);
// Read in the file data
current->inStream->Read(current->indexEntry.dataSize, (int)buffer, &numBytesWritten);
// Write out the file data
outStream->Write(current->indexEntry.dataSize, (int)buffer, &numBytesWritten);
// Pad with NULL bytes
outStream->Write(-current->indexEntry.dataSize & 3, (int)&temp, &numBytesWritten);
// Proccess next node
current = current->next;
}
// Release the write buffer
delete [] buffer;
return S_OK;
}
// Class specific
// **************
CClmWriter::CClmWriter() : m_cRef(1)
{
// Initialize variables
head = NULL;
numNodes = 0;
unknown = 65536;
maxDataSize = 0;
g_cLocks++;
}
CClmWriter::~CClmWriter()
{
LinkedListNode *current, *next;
// Delete the linked list
current = head;
while (current)
{
next = current->next; // Read the pointer to the next node
current->inStream->Release(); // Release the input stream for this node
delete current; // Release this node
current = next; // Process next node
}
g_cLocks--;
}
// Performs a Merge Sort on the linked list
CClmWriter::LinkedListNode* CClmWriter::SortIndex(LinkedListNode *list)
{
struct Tape
{
LinkedListNode *head;
LinkedListNode *tail;
int count;
};
Tape tape[4];
LinkedListNode *current, *next;
int destTape, sourceTape;
int blockSize;
int blockCount[2];
// Initialize tapes
tape[0].head = NULL;
tape[0].tail = NULL;
tape[0].count = 0;
tape[1].head = NULL;
tape[1].tail = NULL;
tape[1].count = 0;
// Break list into two
destTape = 0;
for (current = list; current != NULL; destTape ^= 1)
{
// Cache the next node in the list
next = current->next;
// Add the node to the tape
if (tape[destTape].head == NULL)
tape[destTape].head = current;
else
tape[destTape].tail->next = current;
tape[destTape].tail = current;
tape[destTape].count++;
// Process next node
current = next;
}
// Note: The tail nodes will have invalid next pointers at this point
// Merge tapes using successively larger blocks in sorted order and split output
for (blockSize = 1; tape[1].count != 0; blockSize <<= 1)
{
// Initialize new tapes
tape[2].head = NULL;
tape[2].tail = NULL;
tape[2].count = 0;
tape[3].head = NULL;
tape[3].tail = NULL;
tape[3].count = 0;
// Merge all blocks on two tapes and split the output
for (destTape = 2; (tape[0].count != 0) || (tape[1].count != 0); destTape ^= 1)
{
// Merge a block from each tape
blockCount[0] = blockCount[1] = blockSize;
if (blockCount[0] > tape[0].count)
blockCount[0] = tape[0].count;
if (blockCount[1] > tape[1].count)
blockCount[1] = tape[1].count;
for ( ; blockCount[0] | blockCount[1]; )
{
// Check for empty tapes
if (blockCount[0] == 0)
sourceTape = 1; // Node must come from tape[1]
else if (blockCount[1] == 0)
sourceTape = 0; // Node must come from tape[0]
// Check for proper sorted order
else if (strcmp(tape[0].head->indexEntry.fileName, tape[1].head->indexEntry.fileName) < 0)
sourceTape = 0; // Node on tape[0] comes before
else
sourceTape = 1; // Node on tape[1] comes before
// Move the node from the source tape to the dest tape
// Extract the node from the source tape
blockCount[sourceTape]--;
next = tape[sourceTape].head;
tape[sourceTape].head = tape[sourceTape].head->next;
tape[sourceTape].count--;
// Add the node to the dest tape
if (tape[destTape].tail == NULL)
tape[destTape].head = next;
else
tape[destTape].tail->next = next;
tape[destTape].tail = next;
next->next = NULL;
tape[destTape].count++;
}
}
// Swap tapes for next round
tape[0] = tape[2];
tape[1] = tape[3];
}
// Return the first element of the sorted list
return tape[0].head;
}