7 * Copyright (C) 1991-1995, Thomas G. Lane.
\r
9 * This file is part of the Independent JPEG Group's software.
\r
11 * For conditions of distribution and use, see the accompanying README file.
\r
15 * This file contains tables and miscellaneous utility routines needed
\r
17 * for both compression and decompression.
\r
19 * Note we prefix all global names with "j" to minimize conflicts with
\r
21 * a surrounding application.
\r
27 #define JPEG_INTERNALS
\r
29 #include "jinclude.h"
\r
31 #include "radiant_jpeglib.h"
\r
39 * jpeg_zigzag_order[i] is the zigzag-order position of the i'th element
\r
41 * of a DCT block read in natural order (left to right, top to bottom).
\r
47 const int jpeg_zigzag_order[DCTSIZE2] = {
\r
49 0, 1, 5, 6, 14, 15, 27, 28,
\r
51 2, 4, 7, 13, 16, 26, 29, 42,
\r
53 3, 8, 12, 17, 25, 30, 41, 43,
\r
55 9, 11, 18, 24, 31, 40, 44, 53,
\r
57 10, 19, 23, 32, 39, 45, 52, 54,
\r
59 20, 22, 33, 38, 46, 51, 55, 60,
\r
61 21, 34, 37, 47, 50, 56, 59, 61,
\r
63 35, 36, 48, 49, 57, 58, 62, 63
\r
71 * jpeg_natural_order[i] is the natural-order position of the i'th element
\r
77 * When reading corrupted data, the Huffman decoders could attempt
\r
79 * to reference an entry beyond the end of this array (if the decoded
\r
81 * zero run length reaches past the end of the block). To prevent
\r
83 * wild stores without adding an inner-loop test, we put some extra
\r
85 * "63"s after the real entries. This will cause the extra coefficient
\r
87 * to be stored in location 63 of the block, not somewhere random.
\r
89 * The worst case would be a run-length of 15, which means we need 16
\r
97 const int jpeg_natural_order[DCTSIZE2+16] = {
\r
99 0, 1, 8, 16, 9, 2, 3, 10,
\r
101 17, 24, 32, 25, 18, 11, 4, 5,
\r
103 12, 19, 26, 33, 40, 48, 41, 34,
\r
105 27, 20, 13, 6, 7, 14, 21, 28,
\r
107 35, 42, 49, 56, 57, 50, 43, 36,
\r
109 29, 22, 15, 23, 30, 37, 44, 51,
\r
111 58, 59, 52, 45, 38, 31, 39, 46,
\r
113 53, 60, 61, 54, 47, 55, 62, 63,
\r
115 63, 63, 63, 63, 63, 63, 63, 63, /* extra entries for safety in decoder */
\r
117 63, 63, 63, 63, 63, 63, 63, 63
\r
127 * Arithmetic utilities
\r
135 jdiv_round_up (long a, long b)
\r
137 /* Compute a/b rounded up to next integer, ie, ceil(a/b) */
\r
139 /* Assumes a >= 0, b > 0 */
\r
143 return (a + b - 1L) / b;
\r
153 jround_up (long a, long b)
\r
155 /* Compute a rounded up to next multiple of b, ie, ceil(a/b)*b */
\r
157 /* Assumes a >= 0, b > 0 */
\r
163 return a - (a % b);
\r
171 /* On normal machines we can apply MEMCOPY() and MEMZERO() to sample arrays
\r
173 * and coefficient-block arrays. This won't work on 80x86 because the arrays
\r
175 * are FAR and we're assuming a small-pointer memory model. However, some
\r
177 * DOS compilers provide far-pointer versions of memcpy() and memset() even
\r
179 * in the small-model libraries. These will be used if USE_FMEM is defined.
\r
181 * Otherwise, the routines below do it the hard way. (The performance cost
\r
183 * is not all that great, because these routines aren't very heavily used.)
\r
189 #ifndef NEED_FAR_POINTERS /* normal case, same as regular macros */
\r
191 #define FMEMCOPY(dest,src,size) MEMCOPY(dest,src,size)
\r
193 #define FMEMZERO(target,size) MEMZERO(target,size)
\r
195 #else /* 80x86 case, define if we can */
\r
199 #define FMEMCOPY(dest,src,size) _fmemcpy((void FAR *)(dest), (const void FAR *)(src), (size_t)(size))
\r
201 #define FMEMZERO(target,size) _fmemset((void FAR *)(target), 0, (size_t)(size))
\r
213 jcopy_sample_rows (JSAMPARRAY input_array, int source_row,
\r
215 JSAMPARRAY output_array, int dest_row,
\r
217 int num_rows, JDIMENSION num_cols)
\r
219 /* Copy some rows of samples from one place to another.
\r
221 * num_rows rows are copied from input_array[source_row++]
\r
223 * to output_array[dest_row++]; these areas may overlap for duplication.
\r
225 * The source and destination arrays must be at least as wide as num_cols.
\r
231 register JSAMPROW inptr, outptr;
\r
235 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
\r
239 register JDIMENSION count;
\r
247 input_array += source_row;
\r
249 output_array += dest_row;
\r
253 for (row = num_rows; row > 0; row--) {
\r
255 inptr = *input_array++;
\r
257 outptr = *output_array++;
\r
261 FMEMCOPY(outptr, inptr, count);
\r
265 for (count = num_cols; count > 0; count--)
\r
267 *outptr++ = *inptr++; /* needn't bother with GETJSAMPLE() here */
\r
281 jcopy_block_row (JBLOCKROW input_row, JBLOCKROW output_row,
\r
283 JDIMENSION num_blocks)
\r
285 /* Copy a row of coefficient blocks from one place to another. */
\r
291 FMEMCOPY(output_row, input_row, num_blocks * (DCTSIZE2 * SIZEOF(JCOEF)));
\r
295 register JCOEFPTR inptr, outptr;
\r
297 register long count;
\r
301 inptr = (JCOEFPTR) input_row;
\r
303 outptr = (JCOEFPTR) output_row;
\r
305 for (count = (long) num_blocks * DCTSIZE2; count > 0; count--) {
\r
307 *outptr++ = *inptr++;
\r
321 jzero_far (void FAR * target, size_t bytestozero)
\r
323 /* Zero out a chunk of FAR memory. */
\r
325 /* This might be sample-array data, block-array data, or alloc_large data. */
\r
331 FMEMZERO(target, bytestozero);
\r
335 register char FAR * ptr = (char FAR *) target;
\r
337 register size_t count;
\r
341 for (count = bytestozero; count > 0; count--) {
\r