Shoaib Ahmed / Mbed 2 deprecated uzairkhan

Final 350 project

Dependencies:   uzair Camera_LS_Y201 F7_Ethernet LCD_DISCO_F746NG NetworkAPI SDFileSystem mbed

includes/jmemmgr.c@0:791a779d6220, 2017-07-31 (annotated)

Committer:
shoaib_ahmed
Date:
Mon Jul 31 09:16:35 2017 +0000
Revision:
0:791a779d6220
final project;

Who changed what in which revision?

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