vrshoot

annotate libs/libjpeg/jutils.c @ 0:b2f14e535253

find changesets by author, revision, files, or words in the commit message
initial commit
author John Tsiombikas <nuclear@member.fsf.org>
date Sat, 01 Feb 2014 19:58:19 +0200
parents
children
rev   line source
nuclear@0 1 /*
nuclear@0 2 * jutils.c
nuclear@0 3 *
nuclear@0 4 * Copyright (C) 1991-1996, Thomas G. Lane.
nuclear@0 5 * This file is part of the Independent JPEG Group's software.
nuclear@0 6 * For conditions of distribution and use, see the accompanying README file.
nuclear@0 7 *
nuclear@0 8 * This file contains tables and miscellaneous utility routines needed
nuclear@0 9 * for both compression and decompression.
nuclear@0 10 * Note we prefix all global names with "j" to minimize conflicts with
nuclear@0 11 * a surrounding application.
nuclear@0 12 */
nuclear@0 13
nuclear@0 14 #define JPEG_INTERNALS
nuclear@0 15 #include "jinclude.h"
nuclear@0 16 #include "jpeglib.h"
nuclear@0 17
nuclear@0 18
nuclear@0 19 /*
nuclear@0 20 * jpeg_zigzag_order[i] is the zigzag-order position of the i'th element
nuclear@0 21 * of a DCT block read in natural order (left to right, top to bottom).
nuclear@0 22 */
nuclear@0 23
nuclear@0 24 #if 0 /* This table is not actually needed in v6a */
nuclear@0 25
nuclear@0 26 const int jpeg_zigzag_order[DCTSIZE2] = {
nuclear@0 27 0, 1, 5, 6, 14, 15, 27, 28,
nuclear@0 28 2, 4, 7, 13, 16, 26, 29, 42,
nuclear@0 29 3, 8, 12, 17, 25, 30, 41, 43,
nuclear@0 30 9, 11, 18, 24, 31, 40, 44, 53,
nuclear@0 31 10, 19, 23, 32, 39, 45, 52, 54,
nuclear@0 32 20, 22, 33, 38, 46, 51, 55, 60,
nuclear@0 33 21, 34, 37, 47, 50, 56, 59, 61,
nuclear@0 34 35, 36, 48, 49, 57, 58, 62, 63
nuclear@0 35 };
nuclear@0 36
nuclear@0 37 #endif
nuclear@0 38
nuclear@0 39 /*
nuclear@0 40 * jpeg_natural_order[i] is the natural-order position of the i'th element
nuclear@0 41 * of zigzag order.
nuclear@0 42 *
nuclear@0 43 * When reading corrupted data, the Huffman decoders could attempt
nuclear@0 44 * to reference an entry beyond the end of this array (if the decoded
nuclear@0 45 * zero run length reaches past the end of the block). To prevent
nuclear@0 46 * wild stores without adding an inner-loop test, we put some extra
nuclear@0 47 * "63"s after the real entries. This will cause the extra coefficient
nuclear@0 48 * to be stored in location 63 of the block, not somewhere random.
nuclear@0 49 * The worst case would be a run-length of 15, which means we need 16
nuclear@0 50 * fake entries.
nuclear@0 51 */
nuclear@0 52
nuclear@0 53 const int jpeg_natural_order[DCTSIZE2+16] = {
nuclear@0 54 0, 1, 8, 16, 9, 2, 3, 10,
nuclear@0 55 17, 24, 32, 25, 18, 11, 4, 5,
nuclear@0 56 12, 19, 26, 33, 40, 48, 41, 34,
nuclear@0 57 27, 20, 13, 6, 7, 14, 21, 28,
nuclear@0 58 35, 42, 49, 56, 57, 50, 43, 36,
nuclear@0 59 29, 22, 15, 23, 30, 37, 44, 51,
nuclear@0 60 58, 59, 52, 45, 38, 31, 39, 46,
nuclear@0 61 53, 60, 61, 54, 47, 55, 62, 63,
nuclear@0 62 63, 63, 63, 63, 63, 63, 63, 63, /* extra entries for safety in decoder */
nuclear@0 63 63, 63, 63, 63, 63, 63, 63, 63
nuclear@0 64 };
nuclear@0 65
nuclear@0 66
nuclear@0 67 /*
nuclear@0 68 * Arithmetic utilities
nuclear@0 69 */
nuclear@0 70
nuclear@0 71 GLOBAL(long)
nuclear@0 72 jdiv_round_up (long a, long b)
nuclear@0 73 /* Compute a/b rounded up to next integer, ie, ceil(a/b) */
nuclear@0 74 /* Assumes a >= 0, b > 0 */
nuclear@0 75 {
nuclear@0 76 return (a + b - 1L) / b;
nuclear@0 77 }
nuclear@0 78
nuclear@0 79
nuclear@0 80 GLOBAL(long)
nuclear@0 81 jround_up (long a, long b)
nuclear@0 82 /* Compute a rounded up to next multiple of b, ie, ceil(a/b)*b */
nuclear@0 83 /* Assumes a >= 0, b > 0 */
nuclear@0 84 {
nuclear@0 85 a += b - 1L;
nuclear@0 86 return a - (a % b);
nuclear@0 87 }
nuclear@0 88
nuclear@0 89
nuclear@0 90 /* On normal machines we can apply MEMCOPY() and MEMZERO() to sample arrays
nuclear@0 91 * and coefficient-block arrays. This won't work on 80x86 because the arrays
nuclear@0 92 * are FAR and we're assuming a small-pointer memory model. However, some
nuclear@0 93 * DOS compilers provide far-pointer versions of memcpy() and memset() even
nuclear@0 94 * in the small-model libraries. These will be used if USE_FMEM is defined.
nuclear@0 95 * Otherwise, the routines below do it the hard way. (The performance cost
nuclear@0 96 * is not all that great, because these routines aren't very heavily used.)
nuclear@0 97 */
nuclear@0 98
nuclear@0 99 #ifndef NEED_FAR_POINTERS /* normal case, same as regular macros */
nuclear@0 100 #define FMEMCOPY(dest,src,size) MEMCOPY(dest,src,size)
nuclear@0 101 #define FMEMZERO(target,size) MEMZERO(target,size)
nuclear@0 102 #else /* 80x86 case, define if we can */
nuclear@0 103 #ifdef USE_FMEM
nuclear@0 104 #define FMEMCOPY(dest,src,size) _fmemcpy((void FAR *)(dest), (const void FAR *)(src), (size_t)(size))
nuclear@0 105 #define FMEMZERO(target,size) _fmemset((void FAR *)(target), 0, (size_t)(size))
nuclear@0 106 #endif
nuclear@0 107 #endif
nuclear@0 108
nuclear@0 109
nuclear@0 110 GLOBAL(void)
nuclear@0 111 jcopy_sample_rows (JSAMPARRAY input_array, int source_row,
nuclear@0 112 JSAMPARRAY output_array, int dest_row,
nuclear@0 113 int num_rows, JDIMENSION num_cols)
nuclear@0 114 /* Copy some rows of samples from one place to another.
nuclear@0 115 * num_rows rows are copied from input_array[source_row++]
nuclear@0 116 * to output_array[dest_row++]; these areas may overlap for duplication.
nuclear@0 117 * The source and destination arrays must be at least as wide as num_cols.
nuclear@0 118 */
nuclear@0 119 {
nuclear@0 120 register JSAMPROW inptr, outptr;
nuclear@0 121 #ifdef FMEMCOPY
nuclear@0 122 register size_t count = (size_t) (num_cols * SIZEOF(JSAMPLE));
nuclear@0 123 #else
nuclear@0 124 register JDIMENSION count;
nuclear@0 125 #endif
nuclear@0 126 register int row;
nuclear@0 127
nuclear@0 128 input_array += source_row;
nuclear@0 129 output_array += dest_row;
nuclear@0 130
nuclear@0 131 for (row = num_rows; row > 0; row--) {
nuclear@0 132 inptr = *input_array++;
nuclear@0 133 outptr = *output_array++;
nuclear@0 134 #ifdef FMEMCOPY
nuclear@0 135 FMEMCOPY(outptr, inptr, count);
nuclear@0 136 #else
nuclear@0 137 for (count = num_cols; count > 0; count--)
nuclear@0 138 *outptr++ = *inptr++; /* needn't bother with GETJSAMPLE() here */
nuclear@0 139 #endif
nuclear@0 140 }
nuclear@0 141 }
nuclear@0 142
nuclear@0 143
nuclear@0 144 GLOBAL(void)
nuclear@0 145 jcopy_block_row (JBLOCKROW input_row, JBLOCKROW output_row,
nuclear@0 146 JDIMENSION num_blocks)
nuclear@0 147 /* Copy a row of coefficient blocks from one place to another. */
nuclear@0 148 {
nuclear@0 149 #ifdef FMEMCOPY
nuclear@0 150 FMEMCOPY(output_row, input_row, num_blocks * (DCTSIZE2 * SIZEOF(JCOEF)));
nuclear@0 151 #else
nuclear@0 152 register JCOEFPTR inptr, outptr;
nuclear@0 153 register long count;
nuclear@0 154
nuclear@0 155 inptr = (JCOEFPTR) input_row;
nuclear@0 156 outptr = (JCOEFPTR) output_row;
nuclear@0 157 for (count = (long) num_blocks * DCTSIZE2; count > 0; count--) {
nuclear@0 158 *outptr++ = *inptr++;
nuclear@0 159 }
nuclear@0 160 #endif
nuclear@0 161 }
nuclear@0 162
nuclear@0 163
nuclear@0 164 GLOBAL(void)
nuclear@0 165 jzero_far (void FAR * target, size_t bytestozero)
nuclear@0 166 /* Zero out a chunk of FAR memory. */
nuclear@0 167 /* This might be sample-array data, block-array data, or alloc_large data. */
nuclear@0 168 {
nuclear@0 169 #ifdef FMEMZERO
nuclear@0 170 FMEMZERO(target, bytestozero);
nuclear@0 171 #else
nuclear@0 172 register char FAR * ptr = (char FAR *) target;
nuclear@0 173 register size_t count;
nuclear@0 174
nuclear@0 175 for (count = bytestozero; count > 0; count--) {
nuclear@0 176 *ptr++ = 0;
nuclear@0 177 }
nuclear@0 178 #endif
nuclear@0 179 }