-
Notifications
You must be signed in to change notification settings - Fork 2
/
dst_init.c
337 lines (291 loc) · 12.7 KB
/
dst_init.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
/***********************************************************************
MPEG-4 Audio RM Module
Lossless coding of 1-bit oversampled audio - DST (Direct Stream Transfer)
This software was originally developed by:
* Aad Rijnberg
Philips Digital Systems Laboratories Eindhoven
* Fons Bruekers
Philips Research Laboratories Eindhoven
* Eric Knapen
Philips Digital Systems Laboratories Eindhoven
And edited by:
* Richard Theelen
Philips Digital Systems Laboratories Eindhoven
in the course of development of the MPEG-4 Audio standard ISO-14496-1, 2 and 3.
This software module is an implementation of a part of one or more MPEG-4 Audio
tools as specified by the MPEG-4 Audio standard. ISO/IEC gives users of the
MPEG-4 Audio standards free licence to this software module or modifications
thereof for use in hardware or software products claiming conformance to the
MPEG-4 Audio standards. Those intending to use this software module in hardware
or software products are advised that this use may infringe existing patents.
The original developers of this software of this module and their company,
the subsequent editors and their companies, and ISO/EIC have no liability for
use of this software module or modifications thereof in an implementation.
Copyright is not released for non MPEG-4 Audio conforming products. The
original developer retains full right to use this code for his/her own purpose,
assign or donate the code to a third party and to inhibit third party from
using the code for non MPEG-4 Audio conforming products. This copyright notice
must be included in all copies of derivative works.
Copyright © 2004.
Source file: DST_init.c (DST Coder Initialisation)
Required libraries: <none>
Authors:
RT: Richard Theelen, PDSL-labs Eindhoven <[email protected]>
Changes:
08-Mar-2004 RT Initial version
************************************************************************/
/*============================================================================*/
/* INCLUDES */
/*============================================================================*/
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <malloc.h>
#include "dst_init.h"
#include "ccp_calc.h"
#include "conststr.h"
#include "types.h"
/*============================================================================*/
/* STATIC FUNCTION IMPLEMENTATIONS */
/*============================================================================*/
/* General function for allocating memory for array of any type */
static void *MemoryAllocate(int NrOfElements, int SizeOfElement)
{
void *Array;
if ((Array = _mm_malloc(NrOfElements * SizeOfElement, 16)) == NULL)
{
fprintf(stderr,"ERROR: not enough memory available!\n\n");
}
return Array;
}
static void MemoryFree(void *Array)
{
_mm_free(Array);
}
/* General function for allocating memory for array of any type */
static void *AllocateArray(int Dim, int ElementSize, ...)
{
void ***A; /* stores a pointer to the start of the allocated block for */
/* each dimension */
void *AA; /* contains the start of the allocated nD-array */
va_list ap; /* argument pointer in the variable length list */
int i; /* */
int j; /* */
int n; /* number of entries that are to allocated for a block */
int *Size; /* Size (in number of entries) for each dimension */
/* Retrieve sizes for the different dimensions from the variable arg. list. */
Size = MemoryAllocate(Dim, sizeof(*Size));
va_start(ap, ElementSize);
for (i = 0; i < Dim; i++)
{
Size[i] = va_arg(ap, int);
}
va_end(ap);
A = MemoryAllocate(Dim, sizeof(**A));
/* Allocate for each dimension a contiguous block of memory. */
for (n = 1, i = 0; i < Dim - 1; i++)
{
n *= Size[i];
A[i] = MemoryAllocate(n, sizeof(void*));
}
n *= Size[i];
A[i] = MemoryAllocate(n, ElementSize);
/* Set pointers for each dimension to the correct entries of its lower dim.*/
for (n = 1, i = 0; i < Dim - 1; i++)
{
n *= Size[i];
for (j = 0; j < n; j++)
{
/* A[i][j] = &A[i+1][j * Size[i+1]]; */
A[i][j] = &((char *)A[i+1])[j * Size[i+1] * ElementSize];
}
}
AA = A[0];
MemoryFree(A);
MemoryFree(Size);
return AA;
}
/***************************************************************************/
/* */
/* name : AllocateSChar2D */
/* */
/* function : Function for allocating memory for a 2D signed char array */
/* */
/* pre : Rows, Cols */
/* */
/* post : Pointer to the allocated memory */
/* */
/***************************************************************************/
/*
static signed char **AllocateSChar2D(int Rows, int Cols)
{
signed char **Array;
int r;
if ((Array = MemoryAllocate(Rows, sizeof(*Array))) == NULL)
{
fprintf(stderr,"ERROR: not enough memory available!\n\n");
}
if ((Array[0] = MemoryAllocate(Rows * Cols, sizeof(**Array))) == NULL)
{
fprintf(stderr,"ERROR: not enough memory available!\n\n");
}
for (r = 1; r < Rows; r++)
{
Array[r] = Array[r - 1] + Cols;
}
return Array;
}
*/
/* Function for allocating memory for a 2D unsigned char array */
/*
static unsigned char **AllocateUChar2D (int Rows, int Cols)
{
unsigned char **Array;
int r;
if ((Array = MemoryAllocate(Rows, sizeof(*Array))) == NULL)
{
fprintf(stderr,"ERROR: not enough memory available!\n\n");
}
if ((Array[0] = MemoryAllocate(Rows * Cols, sizeof(**Array))) == NULL)
{
fprintf(stderr,"ERROR: not enough memory available!\n\n");
}
for (r = 1; r < Rows; r++)
{
Array[r] = Array[r - 1] + Cols;
}
return Array;
}
*/
/* Release memory for all dynamic variables of the decoder.*/
static void FreeDecMemory (ebunch * D)
{
MemoryFree(D->FrameHdr.ICoefA[0]);
MemoryFree(D->FrameHdr.ICoefA);
MemoryFree(D->StrFilter.m[0]);
MemoryFree(D->StrFilter.m);
MemoryFree(D->StrFilter.Data[0]);
MemoryFree(D->StrFilter.Data);
MemoryFree(D->StrFilter.CPredOrder);
MemoryFree(D->StrFilter.CPredCoef[0]);
MemoryFree(D->StrFilter.CPredCoef);
MemoryFree(D->StrFilter.Coded);
MemoryFree(D->StrFilter.BestMethod);
MemoryFree(D->StrFilter.DataLen);
MemoryFree(D->StrPtable.m[0]);
MemoryFree(D->StrPtable.m);
MemoryFree(D->StrPtable.Data[0]);
MemoryFree(D->StrPtable.Data);
MemoryFree(D->StrPtable.CPredOrder);
MemoryFree(D->StrPtable.CPredCoef[0]);
MemoryFree(D->StrPtable.CPredCoef);
MemoryFree(D->StrPtable.Coded);
MemoryFree(D->StrPtable.BestMethod);
MemoryFree(D->StrPtable.DataLen);
MemoryFree(D->P_one[0]);
MemoryFree(D->P_one);
MemoryFree(D->AData);
}
/* Allocate memory for all dynamic variables of the decoder. */
static void AllocateDecMemory (ebunch * D)
{
D->FrameHdr.ICoefA = AllocateArray(2,sizeof(**D->FrameHdr.ICoefA),D->FrameHdr.MaxNrOfFilters, (1<<SIZE_CODEDPREDORDER));
D->StrFilter.Coded = MemoryAllocate(D->FrameHdr.MaxNrOfFilters, sizeof(*D->StrFilter.Coded));
D->StrFilter.BestMethod = MemoryAllocate(D->FrameHdr.MaxNrOfFilters, sizeof(*D->StrFilter.BestMethod));
D->StrFilter.m = AllocateArray(2, sizeof(**D->StrFilter.m), D->FrameHdr.MaxNrOfFilters, NROFFRICEMETHODS);
D->StrFilter.Data = AllocateArray(2, sizeof(**D->StrFilter.Data), D->FrameHdr.MaxNrOfFilters, (1<<SIZE_CODEDPREDORDER) * SIZE_PREDCOEF);
D->StrFilter.DataLen = MemoryAllocate(D->FrameHdr.MaxNrOfFilters, sizeof(*D->StrFilter.DataLen));
D->StrFilter.CPredOrder = MemoryAllocate(NROFFRICEMETHODS, sizeof(*D->StrFilter.CPredOrder));
D->StrFilter.CPredCoef = AllocateArray(2, sizeof(**D->StrFilter.CPredCoef), NROFFRICEMETHODS, MAXCPREDORDER);
D->StrPtable.Coded = MemoryAllocate(D->FrameHdr.MaxNrOfPtables, sizeof(*D->StrPtable.Coded));
D->StrPtable.BestMethod = MemoryAllocate(D->FrameHdr.MaxNrOfPtables, sizeof(*D->StrPtable.BestMethod));
D->StrPtable.m = AllocateArray(2, sizeof(**D->StrPtable.m), D->FrameHdr.MaxNrOfPtables, NROFPRICEMETHODS);
D->StrPtable.Data = AllocateArray(2, sizeof(**D->StrPtable.Data), D->FrameHdr.MaxNrOfPtables, AC_BITS * AC_HISMAX);
D->StrPtable.DataLen = MemoryAllocate(D->FrameHdr.MaxNrOfPtables, sizeof(*D->StrPtable.DataLen));
D->StrPtable.CPredOrder = MemoryAllocate(NROFPRICEMETHODS, sizeof(*D->StrPtable.CPredOrder));
D->StrPtable.CPredCoef = AllocateArray(2, sizeof(**D->StrPtable.CPredCoef), NROFPRICEMETHODS, MAXCPREDORDER);
D->P_one = AllocateArray(2, sizeof(**D->P_one), D->FrameHdr.MaxNrOfPtables, AC_HISMAX);
D->AData = MemoryAllocate(D->FrameHdr.BitStreamLen, sizeof(*D->AData));
}
/***************************************************************************/
/* */
/* name : DST_InitDecoder */
/* */
/* function : Complete initialisation of the DST decoder. */
/* */
/* pre : argc, argv[][] */
/* */
/* post : D->CodOpt: .Format, .Mask, .InStreamName, .JobName, */
/* .OutFileName, .DebugName, .Debug, .LengthName, */
/* .Length */
/* D->StrFilter.TableType, D->StrPtable.TableType */
/* */
/* Memory allocated for: */
/* D->FirPtrs : .Pnt, */
/* D->FrameHdr : .PredOrder, .ICoefA, */
/* .FSeg.NrOfSegments, .FSeg.SegmentLen, */
/* .FSeg.Table4Segment, .Filter4Bit, */
/* .PSeg.NrOfSegments, .PSeg.SegmentLen, */
/* .PSeg.Table4Segment, .Ptable4Bit, */
/* D->DsdFrame, */
/* D->PredicVal, D->P_one, D->AData */
/* */
/***************************************************************************/
int DST_InitDecoder(ebunch * D)
{
int retval = 0;
D->FrameHdr.FrameNr = 0;
D->StrFilter.TableType = FILTER;
D->StrPtable.TableType = PTABLE;
if (retval==0)
{
AllocateDecMemory(D);
}
if (retval==0)
{
retval = CCP_CalcInit(&D->StrFilter);
}
if (retval==0)
{
retval = CCP_CalcInit(&D->StrPtable);
}
D->SSE2 = 0;
#if !defined(NO_SSE2) && (defined(_M_IX86) || defined(_M_X64) || defined(__i386__) || defined(__x86_64__))
{
int CPUInfo[4];
#if defined(__i386__) || defined(__x86_64__)
#define cpuid(type, a, b, c, d) \
__asm__ ("cpuid":\
"=a" (a), "=b" (b), "=c" (c), "=d" (d) : "a" (type));
cpuid(1, CPUInfo[0], CPUInfo[1], CPUInfo[2], CPUInfo[3]);
#else
__cpuid(CPUInfo, 1);
#endif
D->SSE2 = (CPUInfo[3] & (1L << 26)) ? 1 : 0;
}
#endif
return(retval);
}
/***************************************************************************/
/* */
/* name : DST_CloseDecoder */
/* */
/* function : Complete termination of the DST decoder. */
/* */
/* pre : Complete D-structure */
/* */
/* post : None */
/* */
/***************************************************************************/
int DST_CloseDecoder(ebunch * D)
{
int retval = 0;
/* Free the memory that was used for the arrays */
FreeDecMemory(D);
return(retval);
}