Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1 | /* |
| 2 | * jmemmgr.c |
| 3 | * |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 4 | * This file was part of the Independent JPEG Group's software: |
Thomas G. Lane | 5ead57a | 1998-03-27 00:00:00 +0000 | [diff] [blame] | 5 | * Copyright (C) 1991-1997, Thomas G. Lane. |
DRC | 04dd34c | 2016-02-04 10:59:21 -0600 | [diff] [blame] | 6 | * libjpeg-turbo Modifications: |
| 7 | * Copyright (C) 2016, D. R. Commander. |
DRC | 7e3acc0 | 2015-10-10 10:25:46 -0500 | [diff] [blame] | 8 | * For conditions of distribution and use, see the accompanying README.ijg |
| 9 | * file. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 10 | * |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 11 | * This file contains the JPEG system-independent memory management |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 12 | * routines. This code is usable across a wide variety of machines; most |
| 13 | * of the system dependencies have been isolated in a separate file. |
| 14 | * The major functions provided here are: |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 15 | * * pool-based allocation and freeing of memory; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 16 | * * policy decisions about how to divide available memory among the |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 17 | * virtual arrays; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 18 | * * control logic for swapping virtual arrays between main memory and |
| 19 | * backing storage. |
| 20 | * The separate system-dependent file provides the actual backing-storage |
| 21 | * access code, and it contains the policy decision about how much total |
| 22 | * main memory to use. |
| 23 | * This file is system-dependent in the sense that some of its functions |
| 24 | * are unnecessary in some systems. For example, if there is enough virtual |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 25 | * memory so that backing storage will never be used, much of the virtual |
| 26 | * array control logic could be removed. (Of course, if you have that much |
| 27 | * memory then you shouldn't care about a little bit of unused code...) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 28 | */ |
| 29 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 30 | #define JPEG_INTERNALS |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 31 | #define AM_MEMORY_MANAGER /* we define jvirt_Xarray_control structs */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 32 | #include "jinclude.h" |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 33 | #include "jpeglib.h" |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 34 | #include "jmemsys.h" /* import the system-dependent declarations */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 35 | |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 36 | #ifndef NO_GETENV |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 37 | #ifndef HAVE_STDLIB_H /* <stdlib.h> should declare getenv() */ |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 38 | extern char *getenv (const char *name); |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 39 | #endif |
| 40 | #endif |
| 41 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 42 | |
DRC | a8eabfe | 2011-03-29 04:58:40 +0000 | [diff] [blame] | 43 | LOCAL(size_t) |
| 44 | round_up_pow2 (size_t a, size_t b) |
| 45 | /* a rounded up to the next multiple of b, i.e. ceil(a/b)*b */ |
| 46 | /* Assumes a >= 0, b > 0, and b is a power of 2 */ |
| 47 | { |
| 48 | return ((a + b - 1) & (~(b - 1))); |
| 49 | } |
| 50 | |
| 51 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 52 | /* |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 53 | * Some important notes: |
| 54 | * The allocation routines provided here must never return NULL. |
| 55 | * They should exit to error_exit if unsuccessful. |
| 56 | * |
| 57 | * It's not a good idea to try to merge the sarray and barray routines, |
| 58 | * even though they are textually almost the same, because samples are |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 59 | * usually stored as bytes while coefficients are shorts or ints. Thus, |
| 60 | * in machines where byte pointers have a different representation from |
| 61 | * word pointers, the resulting machine code could not be the same. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 62 | */ |
| 63 | |
| 64 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 65 | /* |
| 66 | * Many machines require storage alignment: longs must start on 4-byte |
| 67 | * boundaries, doubles on 8-byte boundaries, etc. On such machines, malloc() |
| 68 | * always returns pointers that are multiples of the worst-case alignment |
| 69 | * requirement, and we had better do so too. |
| 70 | * There isn't any really portable way to determine the worst-case alignment |
| 71 | * requirement. This module assumes that the alignment requirement is |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 72 | * multiples of ALIGN_SIZE. |
DRC | 271b0bf | 2016-02-04 10:08:38 -0600 | [diff] [blame] | 73 | * By default, we define ALIGN_SIZE as sizeof(double). This is necessary on |
| 74 | * some workstations (where doubles really do need 8-byte alignment) and will |
| 75 | * work fine on nearly everything. If your machine has lesser alignment needs, |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 76 | * you can save a few bytes by making ALIGN_SIZE smaller. |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 77 | * The only place I know of where this will NOT work is certain Macintosh |
| 78 | * 680x0 compilers that define double as a 10-byte IEEE extended float. |
| 79 | * Doing 10-byte alignment is counterproductive because longwords won't be |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 80 | * aligned well. Put "#define ALIGN_SIZE 4" in jconfig.h if you have |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 81 | * such a compiler. |
| 82 | */ |
| 83 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 84 | #ifndef ALIGN_SIZE /* so can override from jconfig.h */ |
Pierre Ossman | 7311830 | 2009-03-09 13:30:47 +0000 | [diff] [blame] | 85 | #ifndef WITH_SIMD |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 86 | #define ALIGN_SIZE sizeof(double) |
Pierre Ossman | 7311830 | 2009-03-09 13:30:47 +0000 | [diff] [blame] | 87 | #else |
DRC | 2cf199c | 2016-05-20 10:45:32 -0500 | [diff] [blame^] | 88 | #define ALIGN_SIZE 32 /* Most of the SIMD instructions we support require |
| 89 | 16-byte (128-bit) alignment, but AVX2 requires |
| 90 | 32-byte alignment. */ |
Pierre Ossman | 7311830 | 2009-03-09 13:30:47 +0000 | [diff] [blame] | 91 | #endif |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 92 | #endif |
| 93 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 94 | /* |
| 95 | * We allocate objects from "pools", where each pool is gotten with a single |
| 96 | * request to jpeg_get_small() or jpeg_get_large(). There is no per-object |
| 97 | * overhead within a pool, except for alignment padding. Each pool has a |
| 98 | * header with a link to the next pool of the same class. |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 99 | * Small and large pool headers are identical. |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 100 | */ |
| 101 | |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 102 | typedef struct small_pool_struct *small_pool_ptr; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 103 | |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 104 | typedef struct small_pool_struct { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 105 | small_pool_ptr next; /* next in list of pools */ |
| 106 | size_t bytes_used; /* how many bytes already used within pool */ |
| 107 | size_t bytes_left; /* bytes still available in this pool */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 108 | } small_pool_hdr; |
| 109 | |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 110 | typedef struct large_pool_struct *large_pool_ptr; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 111 | |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 112 | typedef struct large_pool_struct { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 113 | large_pool_ptr next; /* next in list of pools */ |
| 114 | size_t bytes_used; /* how many bytes already used within pool */ |
| 115 | size_t bytes_left; /* bytes still available in this pool */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 116 | } large_pool_hdr; |
| 117 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 118 | /* |
| 119 | * Here is the full definition of a memory manager object. |
| 120 | */ |
| 121 | |
| 122 | typedef struct { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 123 | struct jpeg_memory_mgr pub; /* public fields */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 124 | |
| 125 | /* Each pool identifier (lifetime class) names a linked list of pools. */ |
| 126 | small_pool_ptr small_list[JPOOL_NUMPOOLS]; |
| 127 | large_pool_ptr large_list[JPOOL_NUMPOOLS]; |
| 128 | |
| 129 | /* Since we only have one lifetime class of virtual arrays, only one |
| 130 | * linked list is necessary (for each datatype). Note that the virtual |
| 131 | * array control blocks being linked together are actually stored somewhere |
| 132 | * in the small-pool list. |
| 133 | */ |
| 134 | jvirt_sarray_ptr virt_sarray_list; |
| 135 | jvirt_barray_ptr virt_barray_list; |
| 136 | |
| 137 | /* This counts total space obtained from jpeg_get_small/large */ |
DRC | 0489909 | 2010-02-26 23:01:19 +0000 | [diff] [blame] | 138 | size_t total_space_allocated; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 139 | |
| 140 | /* alloc_sarray and alloc_barray set this value for use by virtual |
| 141 | * array routines. |
| 142 | */ |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 143 | JDIMENSION last_rowsperchunk; /* from most recent alloc_sarray/barray */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 144 | } my_memory_mgr; |
| 145 | |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 146 | typedef my_memory_mgr *my_mem_ptr; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 147 | |
| 148 | |
| 149 | /* |
| 150 | * The control blocks for virtual arrays. |
| 151 | * Note that these blocks are allocated in the "small" pool area. |
| 152 | * System-dependent info for the associated backing store (if any) is hidden |
| 153 | * inside the backing_store_info struct. |
| 154 | */ |
| 155 | |
| 156 | struct jvirt_sarray_control { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 157 | JSAMPARRAY mem_buffer; /* => the in-memory buffer */ |
| 158 | JDIMENSION rows_in_array; /* total virtual array height */ |
| 159 | JDIMENSION samplesperrow; /* width of array (and of memory buffer) */ |
| 160 | JDIMENSION maxaccess; /* max rows accessed by access_virt_sarray */ |
| 161 | JDIMENSION rows_in_mem; /* height of memory buffer */ |
| 162 | JDIMENSION rowsperchunk; /* allocation chunk size in mem_buffer */ |
| 163 | JDIMENSION cur_start_row; /* first logical row # in the buffer */ |
| 164 | JDIMENSION first_undef_row; /* row # of first uninitialized row */ |
| 165 | boolean pre_zero; /* pre-zero mode requested? */ |
| 166 | boolean dirty; /* do current buffer contents need written? */ |
| 167 | boolean b_s_open; /* is backing-store data valid? */ |
| 168 | jvirt_sarray_ptr next; /* link to next virtual sarray control block */ |
| 169 | backing_store_info b_s_info; /* System-dependent control info */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 170 | }; |
| 171 | |
| 172 | struct jvirt_barray_control { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 173 | JBLOCKARRAY mem_buffer; /* => the in-memory buffer */ |
| 174 | JDIMENSION rows_in_array; /* total virtual array height */ |
| 175 | JDIMENSION blocksperrow; /* width of array (and of memory buffer) */ |
| 176 | JDIMENSION maxaccess; /* max rows accessed by access_virt_barray */ |
| 177 | JDIMENSION rows_in_mem; /* height of memory buffer */ |
| 178 | JDIMENSION rowsperchunk; /* allocation chunk size in mem_buffer */ |
| 179 | JDIMENSION cur_start_row; /* first logical row # in the buffer */ |
| 180 | JDIMENSION first_undef_row; /* row # of first uninitialized row */ |
| 181 | boolean pre_zero; /* pre-zero mode requested? */ |
| 182 | boolean dirty; /* do current buffer contents need written? */ |
| 183 | boolean b_s_open; /* is backing-store data valid? */ |
| 184 | jvirt_barray_ptr next; /* link to next virtual barray control block */ |
| 185 | backing_store_info b_s_info; /* System-dependent control info */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 186 | }; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 187 | |
| 188 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 189 | #ifdef MEM_STATS /* optional extra stuff for statistics */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 190 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 191 | LOCAL(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 192 | print_mem_stats (j_common_ptr cinfo, int pool_id) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 193 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 194 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 195 | small_pool_ptr shdr_ptr; |
| 196 | large_pool_ptr lhdr_ptr; |
| 197 | |
| 198 | /* Since this is only a debugging stub, we can cheat a little by using |
| 199 | * fprintf directly rather than going through the trace message code. |
| 200 | * This is helpful because message parm array can't handle longs. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 201 | */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 202 | fprintf(stderr, "Freeing pool %d, total space = %ld\n", |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 203 | pool_id, mem->total_space_allocated); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 204 | |
| 205 | for (lhdr_ptr = mem->large_list[pool_id]; lhdr_ptr != NULL; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 206 | lhdr_ptr = lhdr_ptr->next) { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 207 | fprintf(stderr, " Large chunk used %ld\n", |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 208 | (long) lhdr_ptr->bytes_used); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 209 | } |
| 210 | |
| 211 | for (shdr_ptr = mem->small_list[pool_id]; shdr_ptr != NULL; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 212 | shdr_ptr = shdr_ptr->next) { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 213 | fprintf(stderr, " Small chunk used %ld free %ld\n", |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 214 | (long) shdr_ptr->bytes_used, |
| 215 | (long) shdr_ptr->bytes_left); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 216 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 217 | } |
| 218 | |
| 219 | #endif /* MEM_STATS */ |
| 220 | |
| 221 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 222 | LOCAL(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 223 | out_of_memory (j_common_ptr cinfo, int which) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 224 | /* Report an out-of-memory error and stop execution */ |
| 225 | /* If we compiled MEM_STATS support, report alloc requests before dying */ |
| 226 | { |
| 227 | #ifdef MEM_STATS |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 228 | cinfo->err->trace_level = 2; /* force self_destruct to report stats */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 229 | #endif |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 230 | ERREXIT1(cinfo, JERR_OUT_OF_MEMORY, which); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 231 | } |
| 232 | |
| 233 | |
| 234 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 235 | * Allocation of "small" objects. |
| 236 | * |
| 237 | * For these, we use pooled storage. When a new pool must be created, |
| 238 | * we try to get enough space for the current request plus a "slop" factor, |
| 239 | * where the slop will be the amount of leftover space in the new pool. |
| 240 | * The speed vs. space tradeoff is largely determined by the slop values. |
| 241 | * A different slop value is provided for each pool class (lifetime), |
| 242 | * and we also distinguish the first pool of a class from later ones. |
| 243 | * NOTE: the values given work fairly well on both 16- and 32-bit-int |
| 244 | * machines, but may be too small if longs are 64 bits or more. |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 245 | * |
| 246 | * Since we do not know what alignment malloc() gives us, we have to |
| 247 | * allocate ALIGN_SIZE-1 extra space per pool to have room for alignment |
| 248 | * adjustment. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 249 | */ |
| 250 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 251 | static const size_t first_pool_slop[JPOOL_NUMPOOLS] = |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 252 | { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 253 | 1600, /* first PERMANENT pool */ |
| 254 | 16000 /* first IMAGE pool */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 255 | }; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 256 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 257 | static const size_t extra_pool_slop[JPOOL_NUMPOOLS] = |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 258 | { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 259 | 0, /* additional PERMANENT pools */ |
| 260 | 5000 /* additional IMAGE pools */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 261 | }; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 262 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 263 | #define MIN_SLOP 50 /* greater than 0 to avoid futile looping */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 264 | |
| 265 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 266 | METHODDEF(void *) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 267 | alloc_small (j_common_ptr cinfo, int pool_id, size_t sizeofobject) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 268 | /* Allocate a "small" object */ |
| 269 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 270 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 271 | small_pool_ptr hdr_ptr, prev_hdr_ptr; |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 272 | char *data_ptr; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 273 | size_t min_request, slop; |
| 274 | |
| 275 | /* |
| 276 | * Round up the requested size to a multiple of ALIGN_SIZE in order |
| 277 | * to assure alignment for the next object allocated in the same pool |
| 278 | * and so that algorithms can straddle outside the proper area up |
| 279 | * to the next alignment. |
| 280 | */ |
DRC | 04dd34c | 2016-02-04 10:59:21 -0600 | [diff] [blame] | 281 | if (sizeofobject > MAX_ALLOC_CHUNK) { |
| 282 | /* This prevents overflow/wrap-around in round_up_pow2() if sizeofobject |
| 283 | is close to SIZE_MAX. */ |
| 284 | out_of_memory(cinfo, 7); |
| 285 | } |
DRC | a8eabfe | 2011-03-29 04:58:40 +0000 | [diff] [blame] | 286 | sizeofobject = round_up_pow2(sizeofobject, ALIGN_SIZE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 287 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 288 | /* Check for unsatisfiable request (do now to ensure no overflow below) */ |
DRC | 271b0bf | 2016-02-04 10:08:38 -0600 | [diff] [blame] | 289 | if ((sizeof(small_pool_hdr) + sizeofobject + ALIGN_SIZE - 1) > |
| 290 | MAX_ALLOC_CHUNK) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 291 | out_of_memory(cinfo, 1); /* request exceeds malloc's ability */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 292 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 293 | /* See if space is available in any existing pool */ |
| 294 | if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 295 | ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 296 | prev_hdr_ptr = NULL; |
| 297 | hdr_ptr = mem->small_list[pool_id]; |
| 298 | while (hdr_ptr != NULL) { |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 299 | if (hdr_ptr->bytes_left >= sizeofobject) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 300 | break; /* found pool with enough space */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 301 | prev_hdr_ptr = hdr_ptr; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 302 | hdr_ptr = hdr_ptr->next; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 303 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 304 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 305 | /* Time to make a new pool? */ |
| 306 | if (hdr_ptr == NULL) { |
| 307 | /* min_request is what we need now, slop is what will be leftover */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 308 | min_request = sizeof(small_pool_hdr) + sizeofobject + ALIGN_SIZE - 1; |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 309 | if (prev_hdr_ptr == NULL) /* first pool in class? */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 310 | slop = first_pool_slop[pool_id]; |
| 311 | else |
| 312 | slop = extra_pool_slop[pool_id]; |
| 313 | /* Don't ask for more than MAX_ALLOC_CHUNK */ |
| 314 | if (slop > (size_t) (MAX_ALLOC_CHUNK-min_request)) |
| 315 | slop = (size_t) (MAX_ALLOC_CHUNK-min_request); |
| 316 | /* Try to get space, if fail reduce slop and try again */ |
| 317 | for (;;) { |
| 318 | hdr_ptr = (small_pool_ptr) jpeg_get_small(cinfo, min_request + slop); |
| 319 | if (hdr_ptr != NULL) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 320 | break; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 321 | slop /= 2; |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 322 | if (slop < MIN_SLOP) /* give up when it gets real small */ |
| 323 | out_of_memory(cinfo, 2); /* jpeg_get_small failed */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 324 | } |
| 325 | mem->total_space_allocated += min_request + slop; |
| 326 | /* Success, initialize the new pool header and add to end of list */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 327 | hdr_ptr->next = NULL; |
| 328 | hdr_ptr->bytes_used = 0; |
| 329 | hdr_ptr->bytes_left = sizeofobject + slop; |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 330 | if (prev_hdr_ptr == NULL) /* first pool in class? */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 331 | mem->small_list[pool_id] = hdr_ptr; |
| 332 | else |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 333 | prev_hdr_ptr->next = hdr_ptr; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 334 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 335 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 336 | /* OK, allocate the object from the current pool */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 337 | data_ptr = (char *) hdr_ptr; /* point to first data byte in pool... */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 338 | data_ptr += sizeof(small_pool_hdr); /* ...by skipping the header... */ |
DRC | 0489909 | 2010-02-26 23:01:19 +0000 | [diff] [blame] | 339 | if ((size_t)data_ptr % ALIGN_SIZE) /* ...and adjust for alignment */ |
| 340 | data_ptr += ALIGN_SIZE - (size_t)data_ptr % ALIGN_SIZE; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 341 | data_ptr += hdr_ptr->bytes_used; /* point to place for object */ |
| 342 | hdr_ptr->bytes_used += sizeofobject; |
| 343 | hdr_ptr->bytes_left -= sizeofobject; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 344 | |
| 345 | return (void *) data_ptr; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 346 | } |
| 347 | |
| 348 | |
| 349 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 350 | * Allocation of "large" objects. |
| 351 | * |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 352 | * The external semantics of these are the same as "small" objects. However, |
| 353 | * the pool management heuristics are quite different. We assume that each |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 354 | * request is large enough that it may as well be passed directly to |
| 355 | * jpeg_get_large; the pool management just links everything together |
| 356 | * so that we can free it all on demand. |
| 357 | * Note: the major use of "large" objects is in JSAMPARRAY and JBLOCKARRAY |
| 358 | * structures. The routines that create these structures (see below) |
| 359 | * deliberately bunch rows together to ensure a large request size. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 360 | */ |
| 361 | |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 362 | METHODDEF(void *) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 363 | alloc_large (j_common_ptr cinfo, int pool_id, size_t sizeofobject) |
| 364 | /* Allocate a "large" object */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 365 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 366 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 367 | large_pool_ptr hdr_ptr; |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 368 | char *data_ptr; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 369 | |
| 370 | /* |
| 371 | * Round up the requested size to a multiple of ALIGN_SIZE so that |
| 372 | * algorithms can straddle outside the proper area up to the next |
| 373 | * alignment. |
| 374 | */ |
DRC | 04dd34c | 2016-02-04 10:59:21 -0600 | [diff] [blame] | 375 | if (sizeofobject > MAX_ALLOC_CHUNK) { |
| 376 | /* This prevents overflow/wrap-around in round_up_pow2() if sizeofobject |
| 377 | is close to SIZE_MAX. */ |
| 378 | out_of_memory(cinfo, 8); |
| 379 | } |
DRC | a8eabfe | 2011-03-29 04:58:40 +0000 | [diff] [blame] | 380 | sizeofobject = round_up_pow2(sizeofobject, ALIGN_SIZE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 381 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 382 | /* Check for unsatisfiable request (do now to ensure no overflow below) */ |
DRC | 271b0bf | 2016-02-04 10:08:38 -0600 | [diff] [blame] | 383 | if ((sizeof(large_pool_hdr) + sizeofobject + ALIGN_SIZE - 1) > |
| 384 | MAX_ALLOC_CHUNK) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 385 | out_of_memory(cinfo, 3); /* request exceeds malloc's ability */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 386 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 387 | /* Always make a new pool */ |
| 388 | if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 389 | ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 390 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 391 | hdr_ptr = (large_pool_ptr) jpeg_get_large(cinfo, sizeofobject + |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 392 | sizeof(large_pool_hdr) + |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 393 | ALIGN_SIZE - 1); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 394 | if (hdr_ptr == NULL) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 395 | out_of_memory(cinfo, 4); /* jpeg_get_large failed */ |
DRC | 271b0bf | 2016-02-04 10:08:38 -0600 | [diff] [blame] | 396 | mem->total_space_allocated += sizeofobject + sizeof(large_pool_hdr) + |
| 397 | ALIGN_SIZE - 1; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 398 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 399 | /* Success, initialize the new pool header and add to list */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 400 | hdr_ptr->next = mem->large_list[pool_id]; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 401 | /* We maintain space counts in each pool header for statistical purposes, |
| 402 | * even though they are not needed for allocation. |
| 403 | */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 404 | hdr_ptr->bytes_used = sizeofobject; |
| 405 | hdr_ptr->bytes_left = 0; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 406 | mem->large_list[pool_id] = hdr_ptr; |
| 407 | |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 408 | data_ptr = (char *) hdr_ptr; /* point to first data byte in pool... */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 409 | data_ptr += sizeof(small_pool_hdr); /* ...by skipping the header... */ |
DRC | 0489909 | 2010-02-26 23:01:19 +0000 | [diff] [blame] | 410 | if ((size_t)data_ptr % ALIGN_SIZE) /* ...and adjust for alignment */ |
| 411 | data_ptr += ALIGN_SIZE - (size_t)data_ptr % ALIGN_SIZE; |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 412 | |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 413 | return (void *) data_ptr; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 414 | } |
| 415 | |
| 416 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 417 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 418 | * Creation of 2-D sample arrays. |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 419 | * |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 420 | * To minimize allocation overhead and to allow I/O of large contiguous |
| 421 | * blocks, we allocate the sample rows in groups of as many rows as possible |
| 422 | * without exceeding MAX_ALLOC_CHUNK total bytes per allocation request. |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 423 | * NB: the virtual array control routines, later in this file, know about |
| 424 | * this chunking of rows. The rowsperchunk value is left in the mem manager |
| 425 | * object so that it can be saved away if this sarray is the workspace for |
| 426 | * a virtual array. |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 427 | * |
| 428 | * Since we are often upsampling with a factor 2, we align the size (not |
| 429 | * the start) to 2 * ALIGN_SIZE so that the upsampling routines don't have |
| 430 | * to be as careful about size. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 431 | */ |
| 432 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 433 | METHODDEF(JSAMPARRAY) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 434 | alloc_sarray (j_common_ptr cinfo, int pool_id, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 435 | JDIMENSION samplesperrow, JDIMENSION numrows) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 436 | /* Allocate a 2-D sample array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 437 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 438 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 439 | JSAMPARRAY result; |
| 440 | JSAMPROW workspace; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 441 | JDIMENSION rowsperchunk, currow, i; |
| 442 | long ltemp; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 443 | |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 444 | /* Make sure each row is properly aligned */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 445 | if ((ALIGN_SIZE % sizeof(JSAMPLE)) != 0) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 446 | out_of_memory(cinfo, 5); /* safety check */ |
DRC | 04dd34c | 2016-02-04 10:59:21 -0600 | [diff] [blame] | 447 | |
| 448 | if (samplesperrow > MAX_ALLOC_CHUNK) { |
| 449 | /* This prevents overflow/wrap-around in round_up_pow2() if sizeofobject |
| 450 | is close to SIZE_MAX. */ |
| 451 | out_of_memory(cinfo, 9); |
| 452 | } |
DRC | 271b0bf | 2016-02-04 10:08:38 -0600 | [diff] [blame] | 453 | samplesperrow = (JDIMENSION)round_up_pow2(samplesperrow, (2 * ALIGN_SIZE) / |
| 454 | sizeof(JSAMPLE)); |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 455 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 456 | /* Calculate max # of rows allowed in one allocation chunk */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 457 | ltemp = (MAX_ALLOC_CHUNK-sizeof(large_pool_hdr)) / |
| 458 | ((long) samplesperrow * sizeof(JSAMPLE)); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 459 | if (ltemp <= 0) |
| 460 | ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); |
| 461 | if (ltemp < (long) numrows) |
| 462 | rowsperchunk = (JDIMENSION) ltemp; |
| 463 | else |
| 464 | rowsperchunk = numrows; |
| 465 | mem->last_rowsperchunk = rowsperchunk; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 466 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 467 | /* Get space for row pointers (small object) */ |
| 468 | result = (JSAMPARRAY) alloc_small(cinfo, pool_id, |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 469 | (size_t) (numrows * sizeof(JSAMPROW))); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 470 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 471 | /* Get the rows themselves (large objects) */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 472 | currow = 0; |
| 473 | while (currow < numrows) { |
| 474 | rowsperchunk = MIN(rowsperchunk, numrows - currow); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 475 | workspace = (JSAMPROW) alloc_large(cinfo, pool_id, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 476 | (size_t) ((size_t) rowsperchunk * (size_t) samplesperrow |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 477 | * sizeof(JSAMPLE))); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 478 | for (i = rowsperchunk; i > 0; i--) { |
| 479 | result[currow++] = workspace; |
| 480 | workspace += samplesperrow; |
| 481 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 482 | } |
| 483 | |
| 484 | return result; |
| 485 | } |
| 486 | |
| 487 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 488 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 489 | * Creation of 2-D coefficient-block arrays. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 490 | * This is essentially the same as the code for sample arrays, above. |
| 491 | */ |
| 492 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 493 | METHODDEF(JBLOCKARRAY) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 494 | alloc_barray (j_common_ptr cinfo, int pool_id, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 495 | JDIMENSION blocksperrow, JDIMENSION numrows) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 496 | /* Allocate a 2-D coefficient-block array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 497 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 498 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 499 | JBLOCKARRAY result; |
| 500 | JBLOCKROW workspace; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 501 | JDIMENSION rowsperchunk, currow, i; |
| 502 | long ltemp; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 503 | |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 504 | /* Make sure each row is properly aligned */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 505 | if ((sizeof(JBLOCK) % ALIGN_SIZE) != 0) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 506 | out_of_memory(cinfo, 6); /* safety check */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 507 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 508 | /* Calculate max # of rows allowed in one allocation chunk */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 509 | ltemp = (MAX_ALLOC_CHUNK-sizeof(large_pool_hdr)) / |
| 510 | ((long) blocksperrow * sizeof(JBLOCK)); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 511 | if (ltemp <= 0) |
| 512 | ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); |
| 513 | if (ltemp < (long) numrows) |
| 514 | rowsperchunk = (JDIMENSION) ltemp; |
| 515 | else |
| 516 | rowsperchunk = numrows; |
| 517 | mem->last_rowsperchunk = rowsperchunk; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 518 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 519 | /* Get space for row pointers (small object) */ |
| 520 | result = (JBLOCKARRAY) alloc_small(cinfo, pool_id, |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 521 | (size_t) (numrows * sizeof(JBLOCKROW))); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 522 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 523 | /* Get the rows themselves (large objects) */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 524 | currow = 0; |
| 525 | while (currow < numrows) { |
| 526 | rowsperchunk = MIN(rowsperchunk, numrows - currow); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 527 | workspace = (JBLOCKROW) alloc_large(cinfo, pool_id, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 528 | (size_t) ((size_t) rowsperchunk * (size_t) blocksperrow |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 529 | * sizeof(JBLOCK))); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 530 | for (i = rowsperchunk; i > 0; i--) { |
| 531 | result[currow++] = workspace; |
| 532 | workspace += blocksperrow; |
| 533 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 534 | } |
| 535 | |
| 536 | return result; |
| 537 | } |
| 538 | |
| 539 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 540 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 541 | * About virtual array management: |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 542 | * |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 543 | * The above "normal" array routines are only used to allocate strip buffers |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 544 | * (as wide as the image, but just a few rows high). Full-image-sized buffers |
| 545 | * are handled as "virtual" arrays. The array is still accessed a strip at a |
| 546 | * time, but the memory manager must save the whole array for repeated |
| 547 | * accesses. The intended implementation is that there is a strip buffer in |
| 548 | * memory (as high as is possible given the desired memory limit), plus a |
| 549 | * backing file that holds the rest of the array. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 550 | * |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 551 | * The request_virt_array routines are told the total size of the image and |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 552 | * the maximum number of rows that will be accessed at once. The in-memory |
| 553 | * buffer must be at least as large as the maxaccess value. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 554 | * |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 555 | * The request routines create control blocks but not the in-memory buffers. |
| 556 | * That is postponed until realize_virt_arrays is called. At that time the |
| 557 | * total amount of space needed is known (approximately, anyway), so free |
| 558 | * memory can be divided up fairly. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 559 | * |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 560 | * The access_virt_array routines are responsible for making a specific strip |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 561 | * area accessible (after reading or writing the backing file, if necessary). |
| 562 | * Note that the access routines are told whether the caller intends to modify |
| 563 | * the accessed strip; during a read-only pass this saves having to rewrite |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 564 | * data to disk. The access routines are also responsible for pre-zeroing |
| 565 | * any newly accessed rows, if pre-zeroing was requested. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 566 | * |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 567 | * In current usage, the access requests are usually for nonoverlapping |
| 568 | * strips; that is, successive access start_row numbers differ by exactly |
| 569 | * num_rows = maxaccess. This means we can get good performance with simple |
| 570 | * buffer dump/reload logic, by making the in-memory buffer be a multiple |
| 571 | * of the access height; then there will never be accesses across bufferload |
| 572 | * boundaries. The code will still work with overlapping access requests, |
| 573 | * but it doesn't handle bufferload overlaps very efficiently. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 574 | */ |
| 575 | |
| 576 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 577 | METHODDEF(jvirt_sarray_ptr) |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 578 | request_virt_sarray (j_common_ptr cinfo, int pool_id, boolean pre_zero, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 579 | JDIMENSION samplesperrow, JDIMENSION numrows, |
| 580 | JDIMENSION maxaccess) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 581 | /* Request a virtual 2-D sample array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 582 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 583 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 584 | jvirt_sarray_ptr result; |
| 585 | |
| 586 | /* Only IMAGE-lifetime virtual arrays are currently supported */ |
| 587 | if (pool_id != JPOOL_IMAGE) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 588 | ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 589 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 590 | /* get control block */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 591 | result = (jvirt_sarray_ptr) alloc_small(cinfo, pool_id, |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 592 | sizeof(struct jvirt_sarray_control)); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 593 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 594 | result->mem_buffer = NULL; /* marks array not yet realized */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 595 | result->rows_in_array = numrows; |
| 596 | result->samplesperrow = samplesperrow; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 597 | result->maxaccess = maxaccess; |
| 598 | result->pre_zero = pre_zero; |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 599 | result->b_s_open = FALSE; /* no associated backing-store object */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 600 | result->next = mem->virt_sarray_list; /* add to list of virtual arrays */ |
| 601 | mem->virt_sarray_list = result; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 602 | |
| 603 | return result; |
| 604 | } |
| 605 | |
| 606 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 607 | METHODDEF(jvirt_barray_ptr) |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 608 | request_virt_barray (j_common_ptr cinfo, int pool_id, boolean pre_zero, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 609 | JDIMENSION blocksperrow, JDIMENSION numrows, |
| 610 | JDIMENSION maxaccess) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 611 | /* Request a virtual 2-D coefficient-block array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 612 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 613 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 614 | jvirt_barray_ptr result; |
| 615 | |
| 616 | /* Only IMAGE-lifetime virtual arrays are currently supported */ |
| 617 | if (pool_id != JPOOL_IMAGE) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 618 | ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 619 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 620 | /* get control block */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 621 | result = (jvirt_barray_ptr) alloc_small(cinfo, pool_id, |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 622 | sizeof(struct jvirt_barray_control)); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 623 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 624 | result->mem_buffer = NULL; /* marks array not yet realized */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 625 | result->rows_in_array = numrows; |
| 626 | result->blocksperrow = blocksperrow; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 627 | result->maxaccess = maxaccess; |
| 628 | result->pre_zero = pre_zero; |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 629 | result->b_s_open = FALSE; /* no associated backing-store object */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 630 | result->next = mem->virt_barray_list; /* add to list of virtual arrays */ |
| 631 | mem->virt_barray_list = result; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 632 | |
| 633 | return result; |
| 634 | } |
| 635 | |
| 636 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 637 | METHODDEF(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 638 | realize_virt_arrays (j_common_ptr cinfo) |
| 639 | /* Allocate the in-memory buffers for any unrealized virtual arrays */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 640 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 641 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
DRC | 0489909 | 2010-02-26 23:01:19 +0000 | [diff] [blame] | 642 | size_t space_per_minheight, maximum_space, avail_mem; |
| 643 | size_t minheights, max_minheights; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 644 | jvirt_sarray_ptr sptr; |
| 645 | jvirt_barray_ptr bptr; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 646 | |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 647 | /* Compute the minimum space needed (maxaccess rows in each buffer) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 648 | * and the maximum space needed (full image height in each buffer). |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 649 | * These may be of use to the system-dependent jpeg_mem_available routine. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 650 | */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 651 | space_per_minheight = 0; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 652 | maximum_space = 0; |
| 653 | for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 654 | if (sptr->mem_buffer == NULL) { /* if not realized yet */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 655 | space_per_minheight += (long) sptr->maxaccess * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 656 | (long) sptr->samplesperrow * sizeof(JSAMPLE); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 657 | maximum_space += (long) sptr->rows_in_array * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 658 | (long) sptr->samplesperrow * sizeof(JSAMPLE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 659 | } |
| 660 | } |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 661 | for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 662 | if (bptr->mem_buffer == NULL) { /* if not realized yet */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 663 | space_per_minheight += (long) bptr->maxaccess * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 664 | (long) bptr->blocksperrow * sizeof(JBLOCK); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 665 | maximum_space += (long) bptr->rows_in_array * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 666 | (long) bptr->blocksperrow * sizeof(JBLOCK); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 667 | } |
| 668 | } |
| 669 | |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 670 | if (space_per_minheight <= 0) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 671 | return; /* no unrealized arrays, no work */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 672 | |
| 673 | /* Determine amount of memory to actually use; this is system-dependent. */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 674 | avail_mem = jpeg_mem_available(cinfo, space_per_minheight, maximum_space, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 675 | mem->total_space_allocated); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 676 | |
| 677 | /* If the maximum space needed is available, make all the buffers full |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 678 | * height; otherwise parcel it out with the same number of minheights |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 679 | * in each buffer. |
| 680 | */ |
| 681 | if (avail_mem >= maximum_space) |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 682 | max_minheights = 1000000000L; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 683 | else { |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 684 | max_minheights = avail_mem / space_per_minheight; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 685 | /* If there doesn't seem to be enough space, try to get the minimum |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 686 | * anyway. This allows a "stub" implementation of jpeg_mem_available(). |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 687 | */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 688 | if (max_minheights <= 0) |
| 689 | max_minheights = 1; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 690 | } |
| 691 | |
| 692 | /* Allocate the in-memory buffers and initialize backing store as needed. */ |
| 693 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 694 | for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 695 | if (sptr->mem_buffer == NULL) { /* if not realized yet */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 696 | minheights = ((long) sptr->rows_in_array - 1L) / sptr->maxaccess + 1L; |
| 697 | if (minheights <= max_minheights) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 698 | /* This buffer fits in memory */ |
| 699 | sptr->rows_in_mem = sptr->rows_in_array; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 700 | } else { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 701 | /* It doesn't fit in memory, create backing store. */ |
| 702 | sptr->rows_in_mem = (JDIMENSION) (max_minheights * sptr->maxaccess); |
| 703 | jpeg_open_backing_store(cinfo, & sptr->b_s_info, |
| 704 | (long) sptr->rows_in_array * |
| 705 | (long) sptr->samplesperrow * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 706 | (long) sizeof(JSAMPLE)); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 707 | sptr->b_s_open = TRUE; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 708 | } |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 709 | sptr->mem_buffer = alloc_sarray(cinfo, JPOOL_IMAGE, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 710 | sptr->samplesperrow, sptr->rows_in_mem); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 711 | sptr->rowsperchunk = mem->last_rowsperchunk; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 712 | sptr->cur_start_row = 0; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 713 | sptr->first_undef_row = 0; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 714 | sptr->dirty = FALSE; |
| 715 | } |
| 716 | } |
| 717 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 718 | for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 719 | if (bptr->mem_buffer == NULL) { /* if not realized yet */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 720 | minheights = ((long) bptr->rows_in_array - 1L) / bptr->maxaccess + 1L; |
| 721 | if (minheights <= max_minheights) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 722 | /* This buffer fits in memory */ |
| 723 | bptr->rows_in_mem = bptr->rows_in_array; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 724 | } else { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 725 | /* It doesn't fit in memory, create backing store. */ |
| 726 | bptr->rows_in_mem = (JDIMENSION) (max_minheights * bptr->maxaccess); |
| 727 | jpeg_open_backing_store(cinfo, & bptr->b_s_info, |
| 728 | (long) bptr->rows_in_array * |
| 729 | (long) bptr->blocksperrow * |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 730 | (long) sizeof(JBLOCK)); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 731 | bptr->b_s_open = TRUE; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 732 | } |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 733 | bptr->mem_buffer = alloc_barray(cinfo, JPOOL_IMAGE, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 734 | bptr->blocksperrow, bptr->rows_in_mem); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 735 | bptr->rowsperchunk = mem->last_rowsperchunk; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 736 | bptr->cur_start_row = 0; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 737 | bptr->first_undef_row = 0; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 738 | bptr->dirty = FALSE; |
| 739 | } |
| 740 | } |
| 741 | } |
| 742 | |
| 743 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 744 | LOCAL(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 745 | do_sarray_io (j_common_ptr cinfo, jvirt_sarray_ptr ptr, boolean writing) |
| 746 | /* Do backing store read or write of a virtual sample array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 747 | { |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 748 | long bytesperrow, file_offset, byte_count, rows, thisrow, i; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 749 | |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 750 | bytesperrow = (long) ptr->samplesperrow * sizeof(JSAMPLE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 751 | file_offset = ptr->cur_start_row * bytesperrow; |
| 752 | /* Loop to read or write each allocation chunk in mem_buffer */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 753 | for (i = 0; i < (long) ptr->rows_in_mem; i += ptr->rowsperchunk) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 754 | /* One chunk, but check for short chunk at end of buffer */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 755 | rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i); |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 756 | /* Transfer no more than is currently defined */ |
| 757 | thisrow = (long) ptr->cur_start_row + i; |
| 758 | rows = MIN(rows, (long) ptr->first_undef_row - thisrow); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 759 | /* Transfer no more than fits in file */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 760 | rows = MIN(rows, (long) ptr->rows_in_array - thisrow); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 761 | if (rows <= 0) /* this chunk might be past end of file! */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 762 | break; |
| 763 | byte_count = rows * bytesperrow; |
| 764 | if (writing) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 765 | (*ptr->b_s_info.write_backing_store) (cinfo, & ptr->b_s_info, |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 766 | (void *) ptr->mem_buffer[i], |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 767 | file_offset, byte_count); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 768 | else |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 769 | (*ptr->b_s_info.read_backing_store) (cinfo, & ptr->b_s_info, |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 770 | (void *) ptr->mem_buffer[i], |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 771 | file_offset, byte_count); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 772 | file_offset += byte_count; |
| 773 | } |
| 774 | } |
| 775 | |
| 776 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 777 | LOCAL(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 778 | do_barray_io (j_common_ptr cinfo, jvirt_barray_ptr ptr, boolean writing) |
| 779 | /* Do backing store read or write of a virtual coefficient-block array */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 780 | { |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 781 | long bytesperrow, file_offset, byte_count, rows, thisrow, i; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 782 | |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 783 | bytesperrow = (long) ptr->blocksperrow * sizeof(JBLOCK); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 784 | file_offset = ptr->cur_start_row * bytesperrow; |
| 785 | /* Loop to read or write each allocation chunk in mem_buffer */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 786 | for (i = 0; i < (long) ptr->rows_in_mem; i += ptr->rowsperchunk) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 787 | /* One chunk, but check for short chunk at end of buffer */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 788 | rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i); |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 789 | /* Transfer no more than is currently defined */ |
| 790 | thisrow = (long) ptr->cur_start_row + i; |
| 791 | rows = MIN(rows, (long) ptr->first_undef_row - thisrow); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 792 | /* Transfer no more than fits in file */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 793 | rows = MIN(rows, (long) ptr->rows_in_array - thisrow); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 794 | if (rows <= 0) /* this chunk might be past end of file! */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 795 | break; |
| 796 | byte_count = rows * bytesperrow; |
| 797 | if (writing) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 798 | (*ptr->b_s_info.write_backing_store) (cinfo, & ptr->b_s_info, |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 799 | (void *) ptr->mem_buffer[i], |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 800 | file_offset, byte_count); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 801 | else |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 802 | (*ptr->b_s_info.read_backing_store) (cinfo, & ptr->b_s_info, |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 803 | (void *) ptr->mem_buffer[i], |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 804 | file_offset, byte_count); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 805 | file_offset += byte_count; |
| 806 | } |
| 807 | } |
| 808 | |
| 809 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 810 | METHODDEF(JSAMPARRAY) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 811 | access_virt_sarray (j_common_ptr cinfo, jvirt_sarray_ptr ptr, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 812 | JDIMENSION start_row, JDIMENSION num_rows, |
| 813 | boolean writable) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 814 | /* Access the part of a virtual sample array starting at start_row */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 815 | /* and extending for num_rows rows. writable is true if */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 816 | /* caller intends to modify the accessed area. */ |
| 817 | { |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 818 | JDIMENSION end_row = start_row + num_rows; |
| 819 | JDIMENSION undef_row; |
| 820 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 821 | /* debugging check */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 822 | if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess || |
| 823 | ptr->mem_buffer == NULL) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 824 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 825 | |
| 826 | /* Make the desired part of the virtual array accessible */ |
| 827 | if (start_row < ptr->cur_start_row || |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 828 | end_row > ptr->cur_start_row+ptr->rows_in_mem) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 829 | if (! ptr->b_s_open) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 830 | ERREXIT(cinfo, JERR_VIRTUAL_BUG); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 831 | /* Flush old buffer contents if necessary */ |
| 832 | if (ptr->dirty) { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 833 | do_sarray_io(cinfo, ptr, TRUE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 834 | ptr->dirty = FALSE; |
| 835 | } |
| 836 | /* Decide what part of virtual array to access. |
| 837 | * Algorithm: if target address > current window, assume forward scan, |
| 838 | * load starting at target address. If target address < current window, |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 839 | * assume backward scan, load so that target area is top of window. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 840 | * Note that when switching from forward write to forward read, will have |
| 841 | * start_row = 0, so the limiting case applies and we load from 0 anyway. |
| 842 | */ |
| 843 | if (start_row > ptr->cur_start_row) { |
| 844 | ptr->cur_start_row = start_row; |
| 845 | } else { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 846 | /* use long arithmetic here to avoid overflow & unsigned problems */ |
| 847 | long ltemp; |
| 848 | |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 849 | ltemp = (long) end_row - (long) ptr->rows_in_mem; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 850 | if (ltemp < 0) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 851 | ltemp = 0; /* don't fall off front end of file */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 852 | ptr->cur_start_row = (JDIMENSION) ltemp; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 853 | } |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 854 | /* Read in the selected part of the array. |
| 855 | * During the initial write pass, we will do no actual read |
| 856 | * because the selected part is all undefined. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 857 | */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 858 | do_sarray_io(cinfo, ptr, FALSE); |
| 859 | } |
| 860 | /* Ensure the accessed part of the array is defined; prezero if needed. |
| 861 | * To improve locality of access, we only prezero the part of the array |
| 862 | * that the caller is about to access, not the entire in-memory array. |
| 863 | */ |
| 864 | if (ptr->first_undef_row < end_row) { |
| 865 | if (ptr->first_undef_row < start_row) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 866 | if (writable) /* writer skipped over a section of array */ |
| 867 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
| 868 | undef_row = start_row; /* but reader is allowed to read ahead */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 869 | } else { |
| 870 | undef_row = ptr->first_undef_row; |
| 871 | } |
| 872 | if (writable) |
| 873 | ptr->first_undef_row = end_row; |
| 874 | if (ptr->pre_zero) { |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 875 | size_t bytesperrow = (size_t) ptr->samplesperrow * sizeof(JSAMPLE); |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 876 | undef_row -= ptr->cur_start_row; /* make indexes relative to buffer */ |
| 877 | end_row -= ptr->cur_start_row; |
| 878 | while (undef_row < end_row) { |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 879 | jzero_far((void *) ptr->mem_buffer[undef_row], bytesperrow); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 880 | undef_row++; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 881 | } |
| 882 | } else { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 883 | if (! writable) /* reader looking at undefined data */ |
| 884 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 885 | } |
| 886 | } |
| 887 | /* Flag the buffer dirty if caller will write in it */ |
| 888 | if (writable) |
| 889 | ptr->dirty = TRUE; |
| 890 | /* Return address of proper part of the buffer */ |
| 891 | return ptr->mem_buffer + (start_row - ptr->cur_start_row); |
| 892 | } |
| 893 | |
| 894 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 895 | METHODDEF(JBLOCKARRAY) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 896 | access_virt_barray (j_common_ptr cinfo, jvirt_barray_ptr ptr, |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 897 | JDIMENSION start_row, JDIMENSION num_rows, |
| 898 | boolean writable) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 899 | /* Access the part of a virtual block array starting at start_row */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 900 | /* and extending for num_rows rows. writable is true if */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 901 | /* caller intends to modify the accessed area. */ |
| 902 | { |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 903 | JDIMENSION end_row = start_row + num_rows; |
| 904 | JDIMENSION undef_row; |
| 905 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 906 | /* debugging check */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 907 | if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess || |
| 908 | ptr->mem_buffer == NULL) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 909 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 910 | |
| 911 | /* Make the desired part of the virtual array accessible */ |
| 912 | if (start_row < ptr->cur_start_row || |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 913 | end_row > ptr->cur_start_row+ptr->rows_in_mem) { |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 914 | if (! ptr->b_s_open) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 915 | ERREXIT(cinfo, JERR_VIRTUAL_BUG); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 916 | /* Flush old buffer contents if necessary */ |
| 917 | if (ptr->dirty) { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 918 | do_barray_io(cinfo, ptr, TRUE); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 919 | ptr->dirty = FALSE; |
| 920 | } |
| 921 | /* Decide what part of virtual array to access. |
| 922 | * Algorithm: if target address > current window, assume forward scan, |
| 923 | * load starting at target address. If target address < current window, |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 924 | * assume backward scan, load so that target area is top of window. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 925 | * Note that when switching from forward write to forward read, will have |
| 926 | * start_row = 0, so the limiting case applies and we load from 0 anyway. |
| 927 | */ |
| 928 | if (start_row > ptr->cur_start_row) { |
| 929 | ptr->cur_start_row = start_row; |
| 930 | } else { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 931 | /* use long arithmetic here to avoid overflow & unsigned problems */ |
| 932 | long ltemp; |
| 933 | |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 934 | ltemp = (long) end_row - (long) ptr->rows_in_mem; |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 935 | if (ltemp < 0) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 936 | ltemp = 0; /* don't fall off front end of file */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 937 | ptr->cur_start_row = (JDIMENSION) ltemp; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 938 | } |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 939 | /* Read in the selected part of the array. |
| 940 | * During the initial write pass, we will do no actual read |
| 941 | * because the selected part is all undefined. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 942 | */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 943 | do_barray_io(cinfo, ptr, FALSE); |
| 944 | } |
| 945 | /* Ensure the accessed part of the array is defined; prezero if needed. |
| 946 | * To improve locality of access, we only prezero the part of the array |
| 947 | * that the caller is about to access, not the entire in-memory array. |
| 948 | */ |
| 949 | if (ptr->first_undef_row < end_row) { |
| 950 | if (ptr->first_undef_row < start_row) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 951 | if (writable) /* writer skipped over a section of array */ |
| 952 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
| 953 | undef_row = start_row; /* but reader is allowed to read ahead */ |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 954 | } else { |
| 955 | undef_row = ptr->first_undef_row; |
| 956 | } |
| 957 | if (writable) |
| 958 | ptr->first_undef_row = end_row; |
| 959 | if (ptr->pre_zero) { |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 960 | size_t bytesperrow = (size_t) ptr->blocksperrow * sizeof(JBLOCK); |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 961 | undef_row -= ptr->cur_start_row; /* make indexes relative to buffer */ |
| 962 | end_row -= ptr->cur_start_row; |
| 963 | while (undef_row < end_row) { |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 964 | jzero_far((void *) ptr->mem_buffer[undef_row], bytesperrow); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 965 | undef_row++; |
Thomas G. Lane | bc79e06 | 1995-08-02 00:00:00 +0000 | [diff] [blame] | 966 | } |
| 967 | } else { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 968 | if (! writable) /* reader looking at undefined data */ |
| 969 | ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 970 | } |
| 971 | } |
| 972 | /* Flag the buffer dirty if caller will write in it */ |
| 973 | if (writable) |
| 974 | ptr->dirty = TRUE; |
| 975 | /* Return address of proper part of the buffer */ |
| 976 | return ptr->mem_buffer + (start_row - ptr->cur_start_row); |
| 977 | } |
| 978 | |
| 979 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 980 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 981 | * Release all objects belonging to a specified pool. |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 982 | */ |
| 983 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 984 | METHODDEF(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 985 | free_pool (j_common_ptr cinfo, int pool_id) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 986 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 987 | my_mem_ptr mem = (my_mem_ptr) cinfo->mem; |
| 988 | small_pool_ptr shdr_ptr; |
| 989 | large_pool_ptr lhdr_ptr; |
| 990 | size_t space_freed; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 991 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 992 | if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 993 | ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 994 | |
| 995 | #ifdef MEM_STATS |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 996 | if (cinfo->err->trace_level > 1) |
| 997 | print_mem_stats(cinfo, pool_id); /* print pool's memory usage statistics */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 998 | #endif |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 999 | |
| 1000 | /* If freeing IMAGE pool, close any virtual arrays first */ |
| 1001 | if (pool_id == JPOOL_IMAGE) { |
| 1002 | jvirt_sarray_ptr sptr; |
| 1003 | jvirt_barray_ptr bptr; |
| 1004 | |
| 1005 | for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1006 | if (sptr->b_s_open) { /* there may be no backing store */ |
| 1007 | sptr->b_s_open = FALSE; /* prevent recursive close if error */ |
| 1008 | (*sptr->b_s_info.close_backing_store) (cinfo, & sptr->b_s_info); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1009 | } |
| 1010 | } |
| 1011 | mem->virt_sarray_list = NULL; |
| 1012 | for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1013 | if (bptr->b_s_open) { /* there may be no backing store */ |
| 1014 | bptr->b_s_open = FALSE; /* prevent recursive close if error */ |
| 1015 | (*bptr->b_s_info.close_backing_store) (cinfo, & bptr->b_s_info); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1016 | } |
| 1017 | } |
| 1018 | mem->virt_barray_list = NULL; |
| 1019 | } |
| 1020 | |
| 1021 | /* Release large objects */ |
| 1022 | lhdr_ptr = mem->large_list[pool_id]; |
| 1023 | mem->large_list[pool_id] = NULL; |
| 1024 | |
| 1025 | while (lhdr_ptr != NULL) { |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 1026 | large_pool_ptr next_lhdr_ptr = lhdr_ptr->next; |
| 1027 | space_freed = lhdr_ptr->bytes_used + |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1028 | lhdr_ptr->bytes_left + |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1029 | sizeof(large_pool_hdr); |
DRC | 5033f3e | 2014-05-18 18:33:44 +0000 | [diff] [blame] | 1030 | jpeg_free_large(cinfo, (void *) lhdr_ptr, space_freed); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1031 | mem->total_space_allocated -= space_freed; |
| 1032 | lhdr_ptr = next_lhdr_ptr; |
| 1033 | } |
| 1034 | |
| 1035 | /* Release small objects */ |
| 1036 | shdr_ptr = mem->small_list[pool_id]; |
| 1037 | mem->small_list[pool_id] = NULL; |
| 1038 | |
| 1039 | while (shdr_ptr != NULL) { |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 1040 | small_pool_ptr next_shdr_ptr = shdr_ptr->next; |
| 1041 | space_freed = shdr_ptr->bytes_used + |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1042 | shdr_ptr->bytes_left + |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1043 | sizeof(small_pool_hdr); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1044 | jpeg_free_small(cinfo, (void *) shdr_ptr, space_freed); |
| 1045 | mem->total_space_allocated -= space_freed; |
| 1046 | shdr_ptr = next_shdr_ptr; |
| 1047 | } |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1048 | } |
| 1049 | |
| 1050 | |
| 1051 | /* |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1052 | * Close up shop entirely. |
| 1053 | * Note that this cannot be called unless cinfo->mem is non-NULL. |
| 1054 | */ |
| 1055 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 1056 | METHODDEF(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1057 | self_destruct (j_common_ptr cinfo) |
| 1058 | { |
| 1059 | int pool; |
| 1060 | |
| 1061 | /* Close all backing store, release all memory. |
| 1062 | * Releasing pools in reverse order might help avoid fragmentation |
| 1063 | * with some (brain-damaged) malloc libraries. |
| 1064 | */ |
| 1065 | for (pool = JPOOL_NUMPOOLS-1; pool >= JPOOL_PERMANENT; pool--) { |
| 1066 | free_pool(cinfo, pool); |
| 1067 | } |
| 1068 | |
| 1069 | /* Release the memory manager control block too. */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1070 | jpeg_free_small(cinfo, (void *) cinfo->mem, sizeof(my_memory_mgr)); |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1071 | cinfo->mem = NULL; /* ensures I will be called only once */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1072 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1073 | jpeg_mem_term(cinfo); /* system-dependent cleanup */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1074 | } |
| 1075 | |
| 1076 | |
| 1077 | /* |
| 1078 | * Memory manager initialization. |
| 1079 | * When this is called, only the error manager pointer is valid in cinfo! |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1080 | */ |
| 1081 | |
Thomas G. Lane | 489583f | 1996-02-07 00:00:00 +0000 | [diff] [blame] | 1082 | GLOBAL(void) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1083 | jinit_memory_mgr (j_common_ptr cinfo) |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1084 | { |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1085 | my_mem_ptr mem; |
| 1086 | long max_to_use; |
| 1087 | int pool; |
| 1088 | size_t test_mac; |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1089 | |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1090 | cinfo->mem = NULL; /* for safety if init fails */ |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1091 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1092 | /* Check for configuration errors. |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1093 | * sizeof(ALIGN_TYPE) should be a power of 2; otherwise, it probably |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1094 | * doesn't reflect any real hardware alignment requirement. |
| 1095 | * The test is a little tricky: for X>0, X and X-1 have no one-bits |
| 1096 | * in common if and only if X is a power of 2, ie has only one one-bit. |
| 1097 | * Some compilers may give an "unreachable code" warning here; ignore it. |
| 1098 | */ |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 1099 | if ((ALIGN_SIZE & (ALIGN_SIZE-1)) != 0) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1100 | ERREXIT(cinfo, JERR_BAD_ALIGN_TYPE); |
| 1101 | /* MAX_ALLOC_CHUNK must be representable as type size_t, and must be |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 1102 | * a multiple of ALIGN_SIZE. |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1103 | * Again, an "unreachable code" warning may be ignored here. |
| 1104 | * But a "constant too large" warning means you need to fix MAX_ALLOC_CHUNK. |
| 1105 | */ |
| 1106 | test_mac = (size_t) MAX_ALLOC_CHUNK; |
| 1107 | if ((long) test_mac != MAX_ALLOC_CHUNK || |
Pierre Ossman | 5557fd2 | 2009-03-09 10:34:53 +0000 | [diff] [blame] | 1108 | (MAX_ALLOC_CHUNK % ALIGN_SIZE) != 0) |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1109 | ERREXIT(cinfo, JERR_BAD_ALLOC_CHUNK); |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1110 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1111 | max_to_use = jpeg_mem_init(cinfo); /* system-dependent initialization */ |
| 1112 | |
| 1113 | /* Attempt to allocate memory manager's control block */ |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1114 | mem = (my_mem_ptr) jpeg_get_small(cinfo, sizeof(my_memory_mgr)); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1115 | |
| 1116 | if (mem == NULL) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1117 | jpeg_mem_term(cinfo); /* system-dependent cleanup */ |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1118 | ERREXIT1(cinfo, JERR_OUT_OF_MEMORY, 0); |
| 1119 | } |
| 1120 | |
| 1121 | /* OK, fill in the method pointers */ |
| 1122 | mem->pub.alloc_small = alloc_small; |
| 1123 | mem->pub.alloc_large = alloc_large; |
| 1124 | mem->pub.alloc_sarray = alloc_sarray; |
| 1125 | mem->pub.alloc_barray = alloc_barray; |
| 1126 | mem->pub.request_virt_sarray = request_virt_sarray; |
| 1127 | mem->pub.request_virt_barray = request_virt_barray; |
| 1128 | mem->pub.realize_virt_arrays = realize_virt_arrays; |
| 1129 | mem->pub.access_virt_sarray = access_virt_sarray; |
| 1130 | mem->pub.access_virt_barray = access_virt_barray; |
| 1131 | mem->pub.free_pool = free_pool; |
| 1132 | mem->pub.self_destruct = self_destruct; |
| 1133 | |
Thomas G. Lane | 5ead57a | 1998-03-27 00:00:00 +0000 | [diff] [blame] | 1134 | /* Make MAX_ALLOC_CHUNK accessible to other modules */ |
| 1135 | mem->pub.max_alloc_chunk = MAX_ALLOC_CHUNK; |
| 1136 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1137 | /* Initialize working state */ |
| 1138 | mem->pub.max_memory_to_use = max_to_use; |
| 1139 | |
| 1140 | for (pool = JPOOL_NUMPOOLS-1; pool >= JPOOL_PERMANENT; pool--) { |
| 1141 | mem->small_list[pool] = NULL; |
| 1142 | mem->large_list[pool] = NULL; |
| 1143 | } |
| 1144 | mem->virt_sarray_list = NULL; |
| 1145 | mem->virt_barray_list = NULL; |
| 1146 | |
DRC | 5de454b | 2014-05-18 19:04:03 +0000 | [diff] [blame] | 1147 | mem->total_space_allocated = sizeof(my_memory_mgr); |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1148 | |
| 1149 | /* Declare ourselves open for business */ |
| 1150 | cinfo->mem = & mem->pub; |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 1151 | |
| 1152 | /* Check for an environment variable JPEGMEM; if found, override the |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1153 | * default max_memory setting from jpeg_mem_init. Note that the |
| 1154 | * surrounding application may again override this value. |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 1155 | * If your system doesn't support getenv(), define NO_GETENV to disable |
| 1156 | * this feature. |
| 1157 | */ |
| 1158 | #ifndef NO_GETENV |
DRC | bd49803 | 2016-02-19 08:53:33 -0600 | [diff] [blame] | 1159 | { char *memenv; |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 1160 | |
| 1161 | if ((memenv = getenv("JPEGMEM")) != NULL) { |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 1162 | char ch = 'x'; |
| 1163 | |
Thomas G. Lane | 36a4ccc | 1994-09-24 00:00:00 +0000 | [diff] [blame] | 1164 | if (sscanf(memenv, "%ld%c", &max_to_use, &ch) > 0) { |
DRC | e5eaf37 | 2014-05-09 18:00:32 +0000 | [diff] [blame] | 1165 | if (ch == 'm' || ch == 'M') |
| 1166 | max_to_use *= 1000L; |
| 1167 | mem->pub.max_memory_to_use = max_to_use * 1000L; |
Thomas G. Lane | 88aeed4 | 1992-12-10 00:00:00 +0000 | [diff] [blame] | 1168 | } |
| 1169 | } |
| 1170 | } |
| 1171 | #endif |
| 1172 | |
Thomas G. Lane | 4a6b730 | 1992-03-17 00:00:00 +0000 | [diff] [blame] | 1173 | } |