25 #define BITSTREAM_READER_LE
37 unsigned int ret = 0, i, j;
41 for (i = 0, j = ret; i < n - 1; i++)
55 uint32_t exit_at_level[33] = { 404 };
57 unsigned i, j, p, code;
63 for (p = 0; (bits[p] == 0) && (p < num); ++p)
73 for (i = 0; i < bits[p]; ++i)
74 exit_at_level[i+1] = 1 << i;
79 for (i = 0; i < bits[p]; ++i)
86 for (; p < num; ++p) {
92 for (i = bits[p]; i > 0; --i)
97 code = exit_at_level[i];
100 for (j = i + 1 ;j <= bits[p]; ++j)
101 exit_at_level[j] = code + (1 << (j - 1));
107 for (i = 0; i < bits[p]; ++i)
115 for (p = 1; p < 33; p++)
116 if (exit_at_level[p])
127 for (i = 2; i < values; i++) {
132 for (j = 2; j < i; j++) {
134 if (tmp < list[i].x) {
135 if (tmp > list[list[i].low].x)
138 if (tmp < list[list[i].high].x)
143 for (i = 0; i < values - 1; i++) {
145 for (j = i + 1; j < values; j++) {
146 if (list[list[i].sort].x > list[list[j].sort].x) {
147 int tmp = list[i].
sort;
156 intptr_t sy,
int ady,
int adx,
178 static void render_line(
int x0,
int y0,
int x1,
int y1,
float *buf)
183 int sy = dy < 0 ? -1 : 1;
192 ady -=
FFABS(base) * adx;
206 uint16_t *y_list,
int *flag,
207 int multiplier,
float *out,
int samples)
211 ly = y_list[0] * multiplier;
212 for (i = 1; i < values; i++) {
213 int pos = list[i].
sort;
215 int x1 = list[pos].
x;
216 int y1 = y_list[pos] * multiplier;