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