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
|
/*
+--------------------------------------------------------------------------+
| CHStone : a suite of benchmark programs for C-based High-Level Synthesis |
| ======================================================================== |
| |
| * Collected and Modified : Y. Hara, H. Tomiyama, S. Honda, |
| H. Takada and K. Ishii |
| Nagoya University, Japan |
| |
| * Remark : |
| 1. This source code is modified to unify the formats of the benchmark |
| programs in CHStone. |
| 2. Test vectors are added for CHStone. |
| 3. If "main_result" is 0 at the end of the program, the program is |
| correctly executed. |
| 4. Please follow the copyright of each benchmark program. |
+--------------------------------------------------------------------------+
*/
/* getbits.c, bit level routines */
/*
* All modifications (mpeg2decode -> mpeg2play) are
* Copyright (C) 1996, Stefan Eckart. All Rights Reserved.
*/
/* Copyright (C) 1996, MPEG Software Simulation Group. All Rights Reserved. */
/*
* Disclaimer of Warranty
*
* These software programs are available to the user without any license fee or
* royalty on an "as is" basis. The MPEG Software Simulation Group disclaims
* any and all warranties, whether express, implied, or statuary, including any
* implied warranties or merchantability or of fitness for a particular
* purpose. In no event shall the copyright-holder be liable for any
* incidental, punitive, or consequential damages of any kind whatsoever
* arising from the use of these programs.
*
* This disclaimer of warranty extends to the user of these programs and user's
* customers, employees, agents, transferees, successors, and assigns.
*
* The MPEG Software Simulation Group does not represent or warrant that the
* programs furnished hereunder are free of infringement of any third-party
* patents.
*
* Commercial implementations of MPEG-1 and MPEG-2 video, including shareware,
* are subject to royalty fees to patent holders. Many of these patents are
* general enough such that they are unavoidable regardless of implementation
* design.
*
*/
/* initialize buffer, call once before first getbits or showbits */
int
read (unsigned char *s1, const unsigned char *s2, int n)
{
unsigned char *p1;
const unsigned char *p2;
int n_tmp;
p1 = s1;
p2 = s2;
n_tmp = n;
while (n_tmp-- > 0)
{
*p1 = *p2;
p1++;
p2++;
}
return n;
}
void
Fill_Buffer ()
{
int Buffer_Level;
unsigned char *p;
p = ld_Rdbfr;
Buffer_Level = read (ld_Rdbfr, inRdbfr, 2048);
ld_Rdptr = ld_Rdbfr;
if (System_Stream_Flag)
ld_Rdmax -= 2048;
/* end of the bitstream file */
if (Buffer_Level < 2048)
{
/* just to be safe */
if (Buffer_Level < 0)
Buffer_Level = 0;
/* pad until the next to the next 32-bit word boundary */
while (Buffer_Level & 3)
ld_Rdbfr[Buffer_Level++] = 0;
/* pad the buffer with sequence end codes */
while (Buffer_Level < 2048)
{
ld_Rdbfr[Buffer_Level++] = SEQUENCE_END_CODE >> 24;
ld_Rdbfr[Buffer_Level++] = SEQUENCE_END_CODE >> 16;
ld_Rdbfr[Buffer_Level++] = SEQUENCE_END_CODE >> 8;
ld_Rdbfr[Buffer_Level++] = SEQUENCE_END_CODE & 0xff;
}
}
}
unsigned int
Show_Bits (N)
int N;
{
return ld_Bfr >> (unsigned)(32-N)%32;
}
/* return next bit (could be made faster than Get_Bits(1)) */
unsigned int
Get_Bits1 ()
{
return Get_Bits (1);
}
/* advance by n bits */
void
Flush_Buffer (N)
int N;
{
int Incnt;
#ifdef RAND_VAL
/* N is between 0 and 20 with realistic input sets, while it may become larger than the width of the integer type when using randomly generated input sets which are used in the contained input set. The following is to avoid this. */
ld_Bfr <<= (N%20);
#else
ld_Bfr <<= N;
#endif
Incnt = ld_Incnt -= N;
if (Incnt <= 24)
{
if (ld_Rdptr < ld_Rdbfr + 2044)
{
do
{
#ifdef RAND_VAL
/* N is between 0 and 20 with realistic input sets, while it may become larger than the width of the integer type when using randomly generated input sets which are used in the contained input set. The following is to avoid this. */
ld_Bfr |= *ld_Rdptr++ << ((24 - Incnt)%20);
#else
ld_Bfr |= *ld_Rdptr++ << (24 - Incnt);
#endif
Incnt += 8;
}
while (Incnt <= 24);
}
else
{
do
{
if (ld_Rdptr >= ld_Rdbfr + 2048)
Fill_Buffer ();
#ifdef RAND_VAL
/* N is between 0 and 20 with realistic input sets, while it may become larger than the width of the integer type when using randomly generated input sets which are used in the contained input set. The following is to avoid this. */
ld_Bfr |= *ld_Rdptr++ << ((24 - Incnt)%20);
#else
ld_Bfr |= *ld_Rdptr++ << (24 - Incnt);
#endif
Incnt += 8;
}
while (Incnt <= 24);
}
ld_Incnt = Incnt;
}
}
/* return next n bits (right adjusted) */
unsigned int
Get_Bits (N)
int N;
{
unsigned int Val;
Val = Show_Bits (N);
Flush_Buffer (N);
return Val;
}
|
