nuclear@14: /* nuclear@14: * jmemmgr.c nuclear@14: * nuclear@14: * Copyright (C) 1991-1997, Thomas G. Lane. nuclear@14: * This file is part of the Independent JPEG Group's software. nuclear@14: * For conditions of distribution and use, see the accompanying README file. nuclear@14: * nuclear@14: * This file contains the JPEG system-independent memory management nuclear@14: * routines. This code is usable across a wide variety of machines; most nuclear@14: * of the system dependencies have been isolated in a separate file. nuclear@14: * The major functions provided here are: nuclear@14: * * pool-based allocation and freeing of memory; nuclear@14: * * policy decisions about how to divide available memory among the nuclear@14: * virtual arrays; nuclear@14: * * control logic for swapping virtual arrays between main memory and nuclear@14: * backing storage. nuclear@14: * The separate system-dependent file provides the actual backing-storage nuclear@14: * access code, and it contains the policy decision about how much total nuclear@14: * main memory to use. nuclear@14: * This file is system-dependent in the sense that some of its functions nuclear@14: * are unnecessary in some systems. For example, if there is enough virtual nuclear@14: * memory so that backing storage will never be used, much of the virtual nuclear@14: * array control logic could be removed. (Of course, if you have that much nuclear@14: * memory then you shouldn't care about a little bit of unused code...) nuclear@14: */ nuclear@14: nuclear@14: #define JPEG_INTERNALS nuclear@14: #define AM_MEMORY_MANAGER /* we define jvirt_Xarray_control structs */ nuclear@14: #include "jinclude.h" nuclear@14: #include "jpeglib.h" nuclear@14: #include "jmemsys.h" /* import the system-dependent declarations */ nuclear@14: nuclear@14: #ifndef NO_GETENV nuclear@14: #ifndef HAVE_STDLIB_H /* should declare getenv() */ nuclear@14: extern char * getenv JPP((const char * name)); nuclear@14: #endif nuclear@14: #endif nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Some important notes: nuclear@14: * The allocation routines provided here must never return NULL. nuclear@14: * They should exit to error_exit if unsuccessful. nuclear@14: * nuclear@14: * It's not a good idea to try to merge the sarray and barray routines, nuclear@14: * even though they are textually almost the same, because samples are nuclear@14: * usually stored as bytes while coefficients are shorts or ints. Thus, nuclear@14: * in machines where byte pointers have a different representation from nuclear@14: * word pointers, the resulting machine code could not be the same. nuclear@14: */ nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Many machines require storage alignment: longs must start on 4-byte nuclear@14: * boundaries, doubles on 8-byte boundaries, etc. On such machines, malloc() nuclear@14: * always returns pointers that are multiples of the worst-case alignment nuclear@14: * requirement, and we had better do so too. nuclear@14: * There isn't any really portable way to determine the worst-case alignment nuclear@14: * requirement. This module assumes that the alignment requirement is nuclear@14: * multiples of sizeof(ALIGN_TYPE). nuclear@14: * By default, we define ALIGN_TYPE as double. This is necessary on some nuclear@14: * workstations (where doubles really do need 8-byte alignment) and will work nuclear@14: * fine on nearly everything. If your machine has lesser alignment needs, nuclear@14: * you can save a few bytes by making ALIGN_TYPE smaller. nuclear@14: * The only place I know of where this will NOT work is certain Macintosh nuclear@14: * 680x0 compilers that define double as a 10-byte IEEE extended float. nuclear@14: * Doing 10-byte alignment is counterproductive because longwords won't be nuclear@14: * aligned well. Put "#define ALIGN_TYPE long" in jconfig.h if you have nuclear@14: * such a compiler. nuclear@14: */ nuclear@14: nuclear@14: #ifndef ALIGN_TYPE /* so can override from jconfig.h */ nuclear@14: #define ALIGN_TYPE double nuclear@14: #endif nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * We allocate objects from "pools", where each pool is gotten with a single nuclear@14: * request to jpeg_get_small() or jpeg_get_large(). There is no per-object nuclear@14: * overhead within a pool, except for alignment padding. Each pool has a nuclear@14: * header with a link to the next pool of the same class. nuclear@14: * Small and large pool headers are identical except that the latter's nuclear@14: * link pointer must be FAR on 80x86 machines. nuclear@14: * Notice that the "real" header fields are union'ed with a dummy ALIGN_TYPE nuclear@14: * field. This forces the compiler to make SIZEOF(small_pool_hdr) a multiple nuclear@14: * of the alignment requirement of ALIGN_TYPE. nuclear@14: */ nuclear@14: nuclear@14: typedef union small_pool_struct * small_pool_ptr; nuclear@14: nuclear@14: typedef union small_pool_struct { nuclear@14: struct { nuclear@14: small_pool_ptr next; /* next in list of pools */ nuclear@14: size_t bytes_used; /* how many bytes already used within pool */ nuclear@14: size_t bytes_left; /* bytes still available in this pool */ nuclear@14: } hdr; nuclear@14: ALIGN_TYPE dummy; /* included in union to ensure alignment */ nuclear@14: } small_pool_hdr; nuclear@14: nuclear@14: typedef union large_pool_struct FAR * large_pool_ptr; nuclear@14: nuclear@14: typedef union large_pool_struct { nuclear@14: struct { nuclear@14: large_pool_ptr next; /* next in list of pools */ nuclear@14: size_t bytes_used; /* how many bytes already used within pool */ nuclear@14: size_t bytes_left; /* bytes still available in this pool */ nuclear@14: } hdr; nuclear@14: ALIGN_TYPE dummy; /* included in union to ensure alignment */ nuclear@14: } large_pool_hdr; nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Here is the full definition of a memory manager object. nuclear@14: */ nuclear@14: nuclear@14: typedef struct { nuclear@14: struct jpeg_memory_mgr pub; /* public fields */ nuclear@14: nuclear@14: /* Each pool identifier (lifetime class) names a linked list of pools. */ nuclear@14: small_pool_ptr small_list[JPOOL_NUMPOOLS]; nuclear@14: large_pool_ptr large_list[JPOOL_NUMPOOLS]; nuclear@14: nuclear@14: /* Since we only have one lifetime class of virtual arrays, only one nuclear@14: * linked list is necessary (for each datatype). Note that the virtual nuclear@14: * array control blocks being linked together are actually stored somewhere nuclear@14: * in the small-pool list. nuclear@14: */ nuclear@14: jvirt_sarray_ptr virt_sarray_list; nuclear@14: jvirt_barray_ptr virt_barray_list; nuclear@14: nuclear@14: /* This counts total space obtained from jpeg_get_small/large */ nuclear@14: long total_space_allocated; nuclear@14: nuclear@14: /* alloc_sarray and alloc_barray set this value for use by virtual nuclear@14: * array routines. nuclear@14: */ nuclear@14: JDIMENSION last_rowsperchunk; /* from most recent alloc_sarray/barray */ nuclear@14: } my_memory_mgr; nuclear@14: nuclear@14: typedef my_memory_mgr * my_mem_ptr; nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * The control blocks for virtual arrays. nuclear@14: * Note that these blocks are allocated in the "small" pool area. nuclear@14: * System-dependent info for the associated backing store (if any) is hidden nuclear@14: * inside the backing_store_info struct. nuclear@14: */ nuclear@14: nuclear@14: struct jvirt_sarray_control { nuclear@14: JSAMPARRAY mem_buffer; /* => the in-memory buffer */ nuclear@14: JDIMENSION rows_in_array; /* total virtual array height */ nuclear@14: JDIMENSION samplesperrow; /* width of array (and of memory buffer) */ nuclear@14: JDIMENSION maxaccess; /* max rows accessed by access_virt_sarray */ nuclear@14: JDIMENSION rows_in_mem; /* height of memory buffer */ nuclear@14: JDIMENSION rowsperchunk; /* allocation chunk size in mem_buffer */ nuclear@14: JDIMENSION cur_start_row; /* first logical row # in the buffer */ nuclear@14: JDIMENSION first_undef_row; /* row # of first uninitialized row */ nuclear@14: boolean pre_zero; /* pre-zero mode requested? */ nuclear@14: boolean dirty; /* do current buffer contents need written? */ nuclear@14: boolean b_s_open; /* is backing-store data valid? */ nuclear@14: jvirt_sarray_ptr next; /* link to next virtual sarray control block */ nuclear@14: backing_store_info b_s_info; /* System-dependent control info */ nuclear@14: }; nuclear@14: nuclear@14: struct jvirt_barray_control { nuclear@14: JBLOCKARRAY mem_buffer; /* => the in-memory buffer */ nuclear@14: JDIMENSION rows_in_array; /* total virtual array height */ nuclear@14: JDIMENSION blocksperrow; /* width of array (and of memory buffer) */ nuclear@14: JDIMENSION maxaccess; /* max rows accessed by access_virt_barray */ nuclear@14: JDIMENSION rows_in_mem; /* height of memory buffer */ nuclear@14: JDIMENSION rowsperchunk; /* allocation chunk size in mem_buffer */ nuclear@14: JDIMENSION cur_start_row; /* first logical row # in the buffer */ nuclear@14: JDIMENSION first_undef_row; /* row # of first uninitialized row */ nuclear@14: boolean pre_zero; /* pre-zero mode requested? */ nuclear@14: boolean dirty; /* do current buffer contents need written? */ nuclear@14: boolean b_s_open; /* is backing-store data valid? */ nuclear@14: jvirt_barray_ptr next; /* link to next virtual barray control block */ nuclear@14: backing_store_info b_s_info; /* System-dependent control info */ nuclear@14: }; nuclear@14: nuclear@14: nuclear@14: #ifdef MEM_STATS /* optional extra stuff for statistics */ nuclear@14: nuclear@14: LOCAL(void) nuclear@14: print_mem_stats (j_common_ptr cinfo, int pool_id) nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: small_pool_ptr shdr_ptr; nuclear@14: large_pool_ptr lhdr_ptr; nuclear@14: nuclear@14: /* Since this is only a debugging stub, we can cheat a little by using nuclear@14: * fprintf directly rather than going through the trace message code. nuclear@14: * This is helpful because message parm array can't handle longs. nuclear@14: */ nuclear@14: fprintf(stderr, "Freeing pool %d, total space = %ld\n", nuclear@14: pool_id, mem->total_space_allocated); nuclear@14: nuclear@14: for (lhdr_ptr = mem->large_list[pool_id]; lhdr_ptr != NULL; nuclear@14: lhdr_ptr = lhdr_ptr->hdr.next) { nuclear@14: fprintf(stderr, " Large chunk used %ld\n", nuclear@14: (long) lhdr_ptr->hdr.bytes_used); nuclear@14: } nuclear@14: nuclear@14: for (shdr_ptr = mem->small_list[pool_id]; shdr_ptr != NULL; nuclear@14: shdr_ptr = shdr_ptr->hdr.next) { nuclear@14: fprintf(stderr, " Small chunk used %ld free %ld\n", nuclear@14: (long) shdr_ptr->hdr.bytes_used, nuclear@14: (long) shdr_ptr->hdr.bytes_left); nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: #endif /* MEM_STATS */ nuclear@14: nuclear@14: nuclear@14: LOCAL(void) nuclear@14: out_of_memory (j_common_ptr cinfo, int which) nuclear@14: /* Report an out-of-memory error and stop execution */ nuclear@14: /* If we compiled MEM_STATS support, report alloc requests before dying */ nuclear@14: { nuclear@14: #ifdef MEM_STATS nuclear@14: cinfo->err->trace_level = 2; /* force self_destruct to report stats */ nuclear@14: #endif nuclear@14: ERREXIT1(cinfo, JERR_OUT_OF_MEMORY, which); nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Allocation of "small" objects. nuclear@14: * nuclear@14: * For these, we use pooled storage. When a new pool must be created, nuclear@14: * we try to get enough space for the current request plus a "slop" factor, nuclear@14: * where the slop will be the amount of leftover space in the new pool. nuclear@14: * The speed vs. space tradeoff is largely determined by the slop values. nuclear@14: * A different slop value is provided for each pool class (lifetime), nuclear@14: * and we also distinguish the first pool of a class from later ones. nuclear@14: * NOTE: the values given work fairly well on both 16- and 32-bit-int nuclear@14: * machines, but may be too small if longs are 64 bits or more. nuclear@14: */ nuclear@14: nuclear@14: static const size_t first_pool_slop[JPOOL_NUMPOOLS] = nuclear@14: { nuclear@14: 1600, /* first PERMANENT pool */ nuclear@14: 16000 /* first IMAGE pool */ nuclear@14: }; nuclear@14: nuclear@14: static const size_t extra_pool_slop[JPOOL_NUMPOOLS] = nuclear@14: { nuclear@14: 0, /* additional PERMANENT pools */ nuclear@14: 5000 /* additional IMAGE pools */ nuclear@14: }; nuclear@14: nuclear@14: #define MIN_SLOP 50 /* greater than 0 to avoid futile looping */ nuclear@14: nuclear@14: nuclear@14: METHODDEF(void *) nuclear@14: alloc_small (j_common_ptr cinfo, int pool_id, size_t sizeofobject) nuclear@14: /* Allocate a "small" object */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: small_pool_ptr hdr_ptr, prev_hdr_ptr; nuclear@14: char * data_ptr; nuclear@14: size_t odd_bytes, min_request, slop; nuclear@14: nuclear@14: /* Check for unsatisfiable request (do now to ensure no overflow below) */ nuclear@14: if (sizeofobject > (size_t) (MAX_ALLOC_CHUNK-SIZEOF(small_pool_hdr))) nuclear@14: out_of_memory(cinfo, 1); /* request exceeds malloc's ability */ nuclear@14: nuclear@14: /* Round up the requested size to a multiple of SIZEOF(ALIGN_TYPE) */ nuclear@14: odd_bytes = sizeofobject % SIZEOF(ALIGN_TYPE); nuclear@14: if (odd_bytes > 0) nuclear@14: sizeofobject += SIZEOF(ALIGN_TYPE) - odd_bytes; nuclear@14: nuclear@14: /* See if space is available in any existing pool */ nuclear@14: if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) nuclear@14: ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ nuclear@14: prev_hdr_ptr = NULL; nuclear@14: hdr_ptr = mem->small_list[pool_id]; nuclear@14: while (hdr_ptr != NULL) { nuclear@14: if (hdr_ptr->hdr.bytes_left >= sizeofobject) nuclear@14: break; /* found pool with enough space */ nuclear@14: prev_hdr_ptr = hdr_ptr; nuclear@14: hdr_ptr = hdr_ptr->hdr.next; nuclear@14: } nuclear@14: nuclear@14: /* Time to make a new pool? */ nuclear@14: if (hdr_ptr == NULL) { nuclear@14: /* min_request is what we need now, slop is what will be leftover */ nuclear@14: min_request = sizeofobject + SIZEOF(small_pool_hdr); nuclear@14: if (prev_hdr_ptr == NULL) /* first pool in class? */ nuclear@14: slop = first_pool_slop[pool_id]; nuclear@14: else nuclear@14: slop = extra_pool_slop[pool_id]; nuclear@14: /* Don't ask for more than MAX_ALLOC_CHUNK */ nuclear@14: if (slop > (size_t) (MAX_ALLOC_CHUNK-min_request)) nuclear@14: slop = (size_t) (MAX_ALLOC_CHUNK-min_request); nuclear@14: /* Try to get space, if fail reduce slop and try again */ nuclear@14: for (;;) { nuclear@14: hdr_ptr = (small_pool_ptr) jpeg_get_small(cinfo, min_request + slop); nuclear@14: if (hdr_ptr != NULL) nuclear@14: break; nuclear@14: slop /= 2; nuclear@14: if (slop < MIN_SLOP) /* give up when it gets real small */ nuclear@14: out_of_memory(cinfo, 2); /* jpeg_get_small failed */ nuclear@14: } nuclear@14: mem->total_space_allocated += min_request + slop; nuclear@14: /* Success, initialize the new pool header and add to end of list */ nuclear@14: hdr_ptr->hdr.next = NULL; nuclear@14: hdr_ptr->hdr.bytes_used = 0; nuclear@14: hdr_ptr->hdr.bytes_left = sizeofobject + slop; nuclear@14: if (prev_hdr_ptr == NULL) /* first pool in class? */ nuclear@14: mem->small_list[pool_id] = hdr_ptr; nuclear@14: else nuclear@14: prev_hdr_ptr->hdr.next = hdr_ptr; nuclear@14: } nuclear@14: nuclear@14: /* OK, allocate the object from the current pool */ nuclear@14: data_ptr = (char *) (hdr_ptr + 1); /* point to first data byte in pool */ nuclear@14: data_ptr += hdr_ptr->hdr.bytes_used; /* point to place for object */ nuclear@14: hdr_ptr->hdr.bytes_used += sizeofobject; nuclear@14: hdr_ptr->hdr.bytes_left -= sizeofobject; nuclear@14: nuclear@14: return (void *) data_ptr; nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Allocation of "large" objects. nuclear@14: * nuclear@14: * The external semantics of these are the same as "small" objects, nuclear@14: * except that FAR pointers are used on 80x86. However the pool nuclear@14: * management heuristics are quite different. We assume that each nuclear@14: * request is large enough that it may as well be passed directly to nuclear@14: * jpeg_get_large; the pool management just links everything together nuclear@14: * so that we can free it all on demand. nuclear@14: * Note: the major use of "large" objects is in JSAMPARRAY and JBLOCKARRAY nuclear@14: * structures. The routines that create these structures (see below) nuclear@14: * deliberately bunch rows together to ensure a large request size. nuclear@14: */ nuclear@14: nuclear@14: METHODDEF(void FAR *) nuclear@14: alloc_large (j_common_ptr cinfo, int pool_id, size_t sizeofobject) nuclear@14: /* Allocate a "large" object */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: large_pool_ptr hdr_ptr; nuclear@14: size_t odd_bytes; nuclear@14: nuclear@14: /* Check for unsatisfiable request (do now to ensure no overflow below) */ nuclear@14: if (sizeofobject > (size_t) (MAX_ALLOC_CHUNK-SIZEOF(large_pool_hdr))) nuclear@14: out_of_memory(cinfo, 3); /* request exceeds malloc's ability */ nuclear@14: nuclear@14: /* Round up the requested size to a multiple of SIZEOF(ALIGN_TYPE) */ nuclear@14: odd_bytes = sizeofobject % SIZEOF(ALIGN_TYPE); nuclear@14: if (odd_bytes > 0) nuclear@14: sizeofobject += SIZEOF(ALIGN_TYPE) - odd_bytes; nuclear@14: nuclear@14: /* Always make a new pool */ nuclear@14: if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) nuclear@14: ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ nuclear@14: nuclear@14: hdr_ptr = (large_pool_ptr) jpeg_get_large(cinfo, sizeofobject + nuclear@14: SIZEOF(large_pool_hdr)); nuclear@14: if (hdr_ptr == NULL) nuclear@14: out_of_memory(cinfo, 4); /* jpeg_get_large failed */ nuclear@14: mem->total_space_allocated += sizeofobject + SIZEOF(large_pool_hdr); nuclear@14: nuclear@14: /* Success, initialize the new pool header and add to list */ nuclear@14: hdr_ptr->hdr.next = mem->large_list[pool_id]; nuclear@14: /* We maintain space counts in each pool header for statistical purposes, nuclear@14: * even though they are not needed for allocation. nuclear@14: */ nuclear@14: hdr_ptr->hdr.bytes_used = sizeofobject; nuclear@14: hdr_ptr->hdr.bytes_left = 0; nuclear@14: mem->large_list[pool_id] = hdr_ptr; nuclear@14: nuclear@14: return (void FAR *) (hdr_ptr + 1); /* point to first data byte in pool */ nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Creation of 2-D sample arrays. nuclear@14: * The pointers are in near heap, the samples themselves in FAR heap. nuclear@14: * nuclear@14: * To minimize allocation overhead and to allow I/O of large contiguous nuclear@14: * blocks, we allocate the sample rows in groups of as many rows as possible nuclear@14: * without exceeding MAX_ALLOC_CHUNK total bytes per allocation request. nuclear@14: * NB: the virtual array control routines, later in this file, know about nuclear@14: * this chunking of rows. The rowsperchunk value is left in the mem manager nuclear@14: * object so that it can be saved away if this sarray is the workspace for nuclear@14: * a virtual array. nuclear@14: */ nuclear@14: nuclear@14: METHODDEF(JSAMPARRAY) nuclear@14: alloc_sarray (j_common_ptr cinfo, int pool_id, nuclear@14: JDIMENSION samplesperrow, JDIMENSION numrows) nuclear@14: /* Allocate a 2-D sample array */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: JSAMPARRAY result; nuclear@14: JSAMPROW workspace; nuclear@14: JDIMENSION rowsperchunk, currow, i; nuclear@14: long ltemp; nuclear@14: nuclear@14: /* Calculate max # of rows allowed in one allocation chunk */ nuclear@14: ltemp = (MAX_ALLOC_CHUNK-SIZEOF(large_pool_hdr)) / nuclear@14: ((long) samplesperrow * SIZEOF(JSAMPLE)); nuclear@14: if (ltemp <= 0) nuclear@14: ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); nuclear@14: if (ltemp < (long) numrows) nuclear@14: rowsperchunk = (JDIMENSION) ltemp; nuclear@14: else nuclear@14: rowsperchunk = numrows; nuclear@14: mem->last_rowsperchunk = rowsperchunk; nuclear@14: nuclear@14: /* Get space for row pointers (small object) */ nuclear@14: result = (JSAMPARRAY) alloc_small(cinfo, pool_id, nuclear@14: (size_t) (numrows * SIZEOF(JSAMPROW))); nuclear@14: nuclear@14: /* Get the rows themselves (large objects) */ nuclear@14: currow = 0; nuclear@14: while (currow < numrows) { nuclear@14: rowsperchunk = MIN(rowsperchunk, numrows - currow); nuclear@14: workspace = (JSAMPROW) alloc_large(cinfo, pool_id, nuclear@14: (size_t) ((size_t) rowsperchunk * (size_t) samplesperrow nuclear@14: * SIZEOF(JSAMPLE))); nuclear@14: for (i = rowsperchunk; i > 0; i--) { nuclear@14: result[currow++] = workspace; nuclear@14: workspace += samplesperrow; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: return result; nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Creation of 2-D coefficient-block arrays. nuclear@14: * This is essentially the same as the code for sample arrays, above. nuclear@14: */ nuclear@14: nuclear@14: METHODDEF(JBLOCKARRAY) nuclear@14: alloc_barray (j_common_ptr cinfo, int pool_id, nuclear@14: JDIMENSION blocksperrow, JDIMENSION numrows) nuclear@14: /* Allocate a 2-D coefficient-block array */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: JBLOCKARRAY result; nuclear@14: JBLOCKROW workspace; nuclear@14: JDIMENSION rowsperchunk, currow, i; nuclear@14: long ltemp; nuclear@14: nuclear@14: /* Calculate max # of rows allowed in one allocation chunk */ nuclear@14: ltemp = (MAX_ALLOC_CHUNK-SIZEOF(large_pool_hdr)) / nuclear@14: ((long) blocksperrow * SIZEOF(JBLOCK)); nuclear@14: if (ltemp <= 0) nuclear@14: ERREXIT(cinfo, JERR_WIDTH_OVERFLOW); nuclear@14: if (ltemp < (long) numrows) nuclear@14: rowsperchunk = (JDIMENSION) ltemp; nuclear@14: else nuclear@14: rowsperchunk = numrows; nuclear@14: mem->last_rowsperchunk = rowsperchunk; nuclear@14: nuclear@14: /* Get space for row pointers (small object) */ nuclear@14: result = (JBLOCKARRAY) alloc_small(cinfo, pool_id, nuclear@14: (size_t) (numrows * SIZEOF(JBLOCKROW))); nuclear@14: nuclear@14: /* Get the rows themselves (large objects) */ nuclear@14: currow = 0; nuclear@14: while (currow < numrows) { nuclear@14: rowsperchunk = MIN(rowsperchunk, numrows - currow); nuclear@14: workspace = (JBLOCKROW) alloc_large(cinfo, pool_id, nuclear@14: (size_t) ((size_t) rowsperchunk * (size_t) blocksperrow nuclear@14: * SIZEOF(JBLOCK))); nuclear@14: for (i = rowsperchunk; i > 0; i--) { nuclear@14: result[currow++] = workspace; nuclear@14: workspace += blocksperrow; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: return result; nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * About virtual array management: nuclear@14: * nuclear@14: * The above "normal" array routines are only used to allocate strip buffers nuclear@14: * (as wide as the image, but just a few rows high). Full-image-sized buffers nuclear@14: * are handled as "virtual" arrays. The array is still accessed a strip at a nuclear@14: * time, but the memory manager must save the whole array for repeated nuclear@14: * accesses. The intended implementation is that there is a strip buffer in nuclear@14: * memory (as high as is possible given the desired memory limit), plus a nuclear@14: * backing file that holds the rest of the array. nuclear@14: * nuclear@14: * The request_virt_array routines are told the total size of the image and nuclear@14: * the maximum number of rows that will be accessed at once. The in-memory nuclear@14: * buffer must be at least as large as the maxaccess value. nuclear@14: * nuclear@14: * The request routines create control blocks but not the in-memory buffers. nuclear@14: * That is postponed until realize_virt_arrays is called. At that time the nuclear@14: * total amount of space needed is known (approximately, anyway), so free nuclear@14: * memory can be divided up fairly. nuclear@14: * nuclear@14: * The access_virt_array routines are responsible for making a specific strip nuclear@14: * area accessible (after reading or writing the backing file, if necessary). nuclear@14: * Note that the access routines are told whether the caller intends to modify nuclear@14: * the accessed strip; during a read-only pass this saves having to rewrite nuclear@14: * data to disk. The access routines are also responsible for pre-zeroing nuclear@14: * any newly accessed rows, if pre-zeroing was requested. nuclear@14: * nuclear@14: * In current usage, the access requests are usually for nonoverlapping nuclear@14: * strips; that is, successive access start_row numbers differ by exactly nuclear@14: * num_rows = maxaccess. This means we can get good performance with simple nuclear@14: * buffer dump/reload logic, by making the in-memory buffer be a multiple nuclear@14: * of the access height; then there will never be accesses across bufferload nuclear@14: * boundaries. The code will still work with overlapping access requests, nuclear@14: * but it doesn't handle bufferload overlaps very efficiently. nuclear@14: */ nuclear@14: nuclear@14: nuclear@14: METHODDEF(jvirt_sarray_ptr) nuclear@14: request_virt_sarray (j_common_ptr cinfo, int pool_id, boolean pre_zero, nuclear@14: JDIMENSION samplesperrow, JDIMENSION numrows, nuclear@14: JDIMENSION maxaccess) nuclear@14: /* Request a virtual 2-D sample array */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: jvirt_sarray_ptr result; nuclear@14: nuclear@14: /* Only IMAGE-lifetime virtual arrays are currently supported */ nuclear@14: if (pool_id != JPOOL_IMAGE) nuclear@14: ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ nuclear@14: nuclear@14: /* get control block */ nuclear@14: result = (jvirt_sarray_ptr) alloc_small(cinfo, pool_id, nuclear@14: SIZEOF(struct jvirt_sarray_control)); nuclear@14: nuclear@14: result->mem_buffer = NULL; /* marks array not yet realized */ nuclear@14: result->rows_in_array = numrows; nuclear@14: result->samplesperrow = samplesperrow; nuclear@14: result->maxaccess = maxaccess; nuclear@14: result->pre_zero = pre_zero; nuclear@14: result->b_s_open = FALSE; /* no associated backing-store object */ nuclear@14: result->next = mem->virt_sarray_list; /* add to list of virtual arrays */ nuclear@14: mem->virt_sarray_list = result; nuclear@14: nuclear@14: return result; nuclear@14: } nuclear@14: nuclear@14: nuclear@14: METHODDEF(jvirt_barray_ptr) nuclear@14: request_virt_barray (j_common_ptr cinfo, int pool_id, boolean pre_zero, nuclear@14: JDIMENSION blocksperrow, JDIMENSION numrows, nuclear@14: JDIMENSION maxaccess) nuclear@14: /* Request a virtual 2-D coefficient-block array */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: jvirt_barray_ptr result; nuclear@14: nuclear@14: /* Only IMAGE-lifetime virtual arrays are currently supported */ nuclear@14: if (pool_id != JPOOL_IMAGE) nuclear@14: ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ nuclear@14: nuclear@14: /* get control block */ nuclear@14: result = (jvirt_barray_ptr) alloc_small(cinfo, pool_id, nuclear@14: SIZEOF(struct jvirt_barray_control)); nuclear@14: nuclear@14: result->mem_buffer = NULL; /* marks array not yet realized */ nuclear@14: result->rows_in_array = numrows; nuclear@14: result->blocksperrow = blocksperrow; nuclear@14: result->maxaccess = maxaccess; nuclear@14: result->pre_zero = pre_zero; nuclear@14: result->b_s_open = FALSE; /* no associated backing-store object */ nuclear@14: result->next = mem->virt_barray_list; /* add to list of virtual arrays */ nuclear@14: mem->virt_barray_list = result; nuclear@14: nuclear@14: return result; nuclear@14: } nuclear@14: nuclear@14: nuclear@14: METHODDEF(void) nuclear@14: realize_virt_arrays (j_common_ptr cinfo) nuclear@14: /* Allocate the in-memory buffers for any unrealized virtual arrays */ nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: long space_per_minheight, maximum_space, avail_mem; nuclear@14: long minheights, max_minheights; nuclear@14: jvirt_sarray_ptr sptr; nuclear@14: jvirt_barray_ptr bptr; nuclear@14: nuclear@14: /* Compute the minimum space needed (maxaccess rows in each buffer) nuclear@14: * and the maximum space needed (full image height in each buffer). nuclear@14: * These may be of use to the system-dependent jpeg_mem_available routine. nuclear@14: */ nuclear@14: space_per_minheight = 0; nuclear@14: maximum_space = 0; nuclear@14: for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { nuclear@14: if (sptr->mem_buffer == NULL) { /* if not realized yet */ nuclear@14: space_per_minheight += (long) sptr->maxaccess * nuclear@14: (long) sptr->samplesperrow * SIZEOF(JSAMPLE); nuclear@14: maximum_space += (long) sptr->rows_in_array * nuclear@14: (long) sptr->samplesperrow * SIZEOF(JSAMPLE); nuclear@14: } nuclear@14: } nuclear@14: for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { nuclear@14: if (bptr->mem_buffer == NULL) { /* if not realized yet */ nuclear@14: space_per_minheight += (long) bptr->maxaccess * nuclear@14: (long) bptr->blocksperrow * SIZEOF(JBLOCK); nuclear@14: maximum_space += (long) bptr->rows_in_array * nuclear@14: (long) bptr->blocksperrow * SIZEOF(JBLOCK); nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: if (space_per_minheight <= 0) nuclear@14: return; /* no unrealized arrays, no work */ nuclear@14: nuclear@14: /* Determine amount of memory to actually use; this is system-dependent. */ nuclear@14: avail_mem = jpeg_mem_available(cinfo, space_per_minheight, maximum_space, nuclear@14: mem->total_space_allocated); nuclear@14: nuclear@14: /* If the maximum space needed is available, make all the buffers full nuclear@14: * height; otherwise parcel it out with the same number of minheights nuclear@14: * in each buffer. nuclear@14: */ nuclear@14: if (avail_mem >= maximum_space) nuclear@14: max_minheights = 1000000000L; nuclear@14: else { nuclear@14: max_minheights = avail_mem / space_per_minheight; nuclear@14: /* If there doesn't seem to be enough space, try to get the minimum nuclear@14: * anyway. This allows a "stub" implementation of jpeg_mem_available(). nuclear@14: */ nuclear@14: if (max_minheights <= 0) nuclear@14: max_minheights = 1; nuclear@14: } nuclear@14: nuclear@14: /* Allocate the in-memory buffers and initialize backing store as needed. */ nuclear@14: nuclear@14: for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { nuclear@14: if (sptr->mem_buffer == NULL) { /* if not realized yet */ nuclear@14: minheights = ((long) sptr->rows_in_array - 1L) / sptr->maxaccess + 1L; nuclear@14: if (minheights <= max_minheights) { nuclear@14: /* This buffer fits in memory */ nuclear@14: sptr->rows_in_mem = sptr->rows_in_array; nuclear@14: } else { nuclear@14: /* It doesn't fit in memory, create backing store. */ nuclear@14: sptr->rows_in_mem = (JDIMENSION) (max_minheights * sptr->maxaccess); nuclear@14: jpeg_open_backing_store(cinfo, & sptr->b_s_info, nuclear@14: (long) sptr->rows_in_array * nuclear@14: (long) sptr->samplesperrow * nuclear@14: (long) SIZEOF(JSAMPLE)); nuclear@14: sptr->b_s_open = TRUE; nuclear@14: } nuclear@14: sptr->mem_buffer = alloc_sarray(cinfo, JPOOL_IMAGE, nuclear@14: sptr->samplesperrow, sptr->rows_in_mem); nuclear@14: sptr->rowsperchunk = mem->last_rowsperchunk; nuclear@14: sptr->cur_start_row = 0; nuclear@14: sptr->first_undef_row = 0; nuclear@14: sptr->dirty = FALSE; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { nuclear@14: if (bptr->mem_buffer == NULL) { /* if not realized yet */ nuclear@14: minheights = ((long) bptr->rows_in_array - 1L) / bptr->maxaccess + 1L; nuclear@14: if (minheights <= max_minheights) { nuclear@14: /* This buffer fits in memory */ nuclear@14: bptr->rows_in_mem = bptr->rows_in_array; nuclear@14: } else { nuclear@14: /* It doesn't fit in memory, create backing store. */ nuclear@14: bptr->rows_in_mem = (JDIMENSION) (max_minheights * bptr->maxaccess); nuclear@14: jpeg_open_backing_store(cinfo, & bptr->b_s_info, nuclear@14: (long) bptr->rows_in_array * nuclear@14: (long) bptr->blocksperrow * nuclear@14: (long) SIZEOF(JBLOCK)); nuclear@14: bptr->b_s_open = TRUE; nuclear@14: } nuclear@14: bptr->mem_buffer = alloc_barray(cinfo, JPOOL_IMAGE, nuclear@14: bptr->blocksperrow, bptr->rows_in_mem); nuclear@14: bptr->rowsperchunk = mem->last_rowsperchunk; nuclear@14: bptr->cur_start_row = 0; nuclear@14: bptr->first_undef_row = 0; nuclear@14: bptr->dirty = FALSE; nuclear@14: } nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: nuclear@14: LOCAL(void) nuclear@14: do_sarray_io (j_common_ptr cinfo, jvirt_sarray_ptr ptr, boolean writing) nuclear@14: /* Do backing store read or write of a virtual sample array */ nuclear@14: { nuclear@14: long bytesperrow, file_offset, byte_count, rows, thisrow, i; nuclear@14: nuclear@14: bytesperrow = (long) ptr->samplesperrow * SIZEOF(JSAMPLE); nuclear@14: file_offset = ptr->cur_start_row * bytesperrow; nuclear@14: /* Loop to read or write each allocation chunk in mem_buffer */ nuclear@14: for (i = 0; i < (long) ptr->rows_in_mem; i += ptr->rowsperchunk) { nuclear@14: /* One chunk, but check for short chunk at end of buffer */ nuclear@14: rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i); nuclear@14: /* Transfer no more than is currently defined */ nuclear@14: thisrow = (long) ptr->cur_start_row + i; nuclear@14: rows = MIN(rows, (long) ptr->first_undef_row - thisrow); nuclear@14: /* Transfer no more than fits in file */ nuclear@14: rows = MIN(rows, (long) ptr->rows_in_array - thisrow); nuclear@14: if (rows <= 0) /* this chunk might be past end of file! */ nuclear@14: break; nuclear@14: byte_count = rows * bytesperrow; nuclear@14: if (writing) nuclear@14: (*ptr->b_s_info.write_backing_store) (cinfo, & ptr->b_s_info, nuclear@14: (void FAR *) ptr->mem_buffer[i], nuclear@14: file_offset, byte_count); nuclear@14: else nuclear@14: (*ptr->b_s_info.read_backing_store) (cinfo, & ptr->b_s_info, nuclear@14: (void FAR *) ptr->mem_buffer[i], nuclear@14: file_offset, byte_count); nuclear@14: file_offset += byte_count; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: nuclear@14: LOCAL(void) nuclear@14: do_barray_io (j_common_ptr cinfo, jvirt_barray_ptr ptr, boolean writing) nuclear@14: /* Do backing store read or write of a virtual coefficient-block array */ nuclear@14: { nuclear@14: long bytesperrow, file_offset, byte_count, rows, thisrow, i; nuclear@14: nuclear@14: bytesperrow = (long) ptr->blocksperrow * SIZEOF(JBLOCK); nuclear@14: file_offset = ptr->cur_start_row * bytesperrow; nuclear@14: /* Loop to read or write each allocation chunk in mem_buffer */ nuclear@14: for (i = 0; i < (long) ptr->rows_in_mem; i += ptr->rowsperchunk) { nuclear@14: /* One chunk, but check for short chunk at end of buffer */ nuclear@14: rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i); nuclear@14: /* Transfer no more than is currently defined */ nuclear@14: thisrow = (long) ptr->cur_start_row + i; nuclear@14: rows = MIN(rows, (long) ptr->first_undef_row - thisrow); nuclear@14: /* Transfer no more than fits in file */ nuclear@14: rows = MIN(rows, (long) ptr->rows_in_array - thisrow); nuclear@14: if (rows <= 0) /* this chunk might be past end of file! */ nuclear@14: break; nuclear@14: byte_count = rows * bytesperrow; nuclear@14: if (writing) nuclear@14: (*ptr->b_s_info.write_backing_store) (cinfo, & ptr->b_s_info, nuclear@14: (void FAR *) ptr->mem_buffer[i], nuclear@14: file_offset, byte_count); nuclear@14: else nuclear@14: (*ptr->b_s_info.read_backing_store) (cinfo, & ptr->b_s_info, nuclear@14: (void FAR *) ptr->mem_buffer[i], nuclear@14: file_offset, byte_count); nuclear@14: file_offset += byte_count; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: nuclear@14: METHODDEF(JSAMPARRAY) nuclear@14: access_virt_sarray (j_common_ptr cinfo, jvirt_sarray_ptr ptr, nuclear@14: JDIMENSION start_row, JDIMENSION num_rows, nuclear@14: boolean writable) nuclear@14: /* Access the part of a virtual sample array starting at start_row */ nuclear@14: /* and extending for num_rows rows. writable is true if */ nuclear@14: /* caller intends to modify the accessed area. */ nuclear@14: { nuclear@14: JDIMENSION end_row = start_row + num_rows; nuclear@14: JDIMENSION undef_row; nuclear@14: nuclear@14: /* debugging check */ nuclear@14: if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess || nuclear@14: ptr->mem_buffer == NULL) nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: nuclear@14: /* Make the desired part of the virtual array accessible */ nuclear@14: if (start_row < ptr->cur_start_row || nuclear@14: end_row > ptr->cur_start_row+ptr->rows_in_mem) { nuclear@14: if (! ptr->b_s_open) nuclear@14: ERREXIT(cinfo, JERR_VIRTUAL_BUG); nuclear@14: /* Flush old buffer contents if necessary */ nuclear@14: if (ptr->dirty) { nuclear@14: do_sarray_io(cinfo, ptr, TRUE); nuclear@14: ptr->dirty = FALSE; nuclear@14: } nuclear@14: /* Decide what part of virtual array to access. nuclear@14: * Algorithm: if target address > current window, assume forward scan, nuclear@14: * load starting at target address. If target address < current window, nuclear@14: * assume backward scan, load so that target area is top of window. nuclear@14: * Note that when switching from forward write to forward read, will have nuclear@14: * start_row = 0, so the limiting case applies and we load from 0 anyway. nuclear@14: */ nuclear@14: if (start_row > ptr->cur_start_row) { nuclear@14: ptr->cur_start_row = start_row; nuclear@14: } else { nuclear@14: /* use long arithmetic here to avoid overflow & unsigned problems */ nuclear@14: long ltemp; nuclear@14: nuclear@14: ltemp = (long) end_row - (long) ptr->rows_in_mem; nuclear@14: if (ltemp < 0) nuclear@14: ltemp = 0; /* don't fall off front end of file */ nuclear@14: ptr->cur_start_row = (JDIMENSION) ltemp; nuclear@14: } nuclear@14: /* Read in the selected part of the array. nuclear@14: * During the initial write pass, we will do no actual read nuclear@14: * because the selected part is all undefined. nuclear@14: */ nuclear@14: do_sarray_io(cinfo, ptr, FALSE); nuclear@14: } nuclear@14: /* Ensure the accessed part of the array is defined; prezero if needed. nuclear@14: * To improve locality of access, we only prezero the part of the array nuclear@14: * that the caller is about to access, not the entire in-memory array. nuclear@14: */ nuclear@14: if (ptr->first_undef_row < end_row) { nuclear@14: if (ptr->first_undef_row < start_row) { nuclear@14: if (writable) /* writer skipped over a section of array */ nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: undef_row = start_row; /* but reader is allowed to read ahead */ nuclear@14: } else { nuclear@14: undef_row = ptr->first_undef_row; nuclear@14: } nuclear@14: if (writable) nuclear@14: ptr->first_undef_row = end_row; nuclear@14: if (ptr->pre_zero) { nuclear@14: size_t bytesperrow = (size_t) ptr->samplesperrow * SIZEOF(JSAMPLE); nuclear@14: undef_row -= ptr->cur_start_row; /* make indexes relative to buffer */ nuclear@14: end_row -= ptr->cur_start_row; nuclear@14: while (undef_row < end_row) { nuclear@14: jzero_far((void FAR *) ptr->mem_buffer[undef_row], bytesperrow); nuclear@14: undef_row++; nuclear@14: } nuclear@14: } else { nuclear@14: if (! writable) /* reader looking at undefined data */ nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: } nuclear@14: } nuclear@14: /* Flag the buffer dirty if caller will write in it */ nuclear@14: if (writable) nuclear@14: ptr->dirty = TRUE; nuclear@14: /* Return address of proper part of the buffer */ nuclear@14: return ptr->mem_buffer + (start_row - ptr->cur_start_row); nuclear@14: } nuclear@14: nuclear@14: nuclear@14: METHODDEF(JBLOCKARRAY) nuclear@14: access_virt_barray (j_common_ptr cinfo, jvirt_barray_ptr ptr, nuclear@14: JDIMENSION start_row, JDIMENSION num_rows, nuclear@14: boolean writable) nuclear@14: /* Access the part of a virtual block array starting at start_row */ nuclear@14: /* and extending for num_rows rows. writable is true if */ nuclear@14: /* caller intends to modify the accessed area. */ nuclear@14: { nuclear@14: JDIMENSION end_row = start_row + num_rows; nuclear@14: JDIMENSION undef_row; nuclear@14: nuclear@14: /* debugging check */ nuclear@14: if (end_row > ptr->rows_in_array || num_rows > ptr->maxaccess || nuclear@14: ptr->mem_buffer == NULL) nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: nuclear@14: /* Make the desired part of the virtual array accessible */ nuclear@14: if (start_row < ptr->cur_start_row || nuclear@14: end_row > ptr->cur_start_row+ptr->rows_in_mem) { nuclear@14: if (! ptr->b_s_open) nuclear@14: ERREXIT(cinfo, JERR_VIRTUAL_BUG); nuclear@14: /* Flush old buffer contents if necessary */ nuclear@14: if (ptr->dirty) { nuclear@14: do_barray_io(cinfo, ptr, TRUE); nuclear@14: ptr->dirty = FALSE; nuclear@14: } nuclear@14: /* Decide what part of virtual array to access. nuclear@14: * Algorithm: if target address > current window, assume forward scan, nuclear@14: * load starting at target address. If target address < current window, nuclear@14: * assume backward scan, load so that target area is top of window. nuclear@14: * Note that when switching from forward write to forward read, will have nuclear@14: * start_row = 0, so the limiting case applies and we load from 0 anyway. nuclear@14: */ nuclear@14: if (start_row > ptr->cur_start_row) { nuclear@14: ptr->cur_start_row = start_row; nuclear@14: } else { nuclear@14: /* use long arithmetic here to avoid overflow & unsigned problems */ nuclear@14: long ltemp; nuclear@14: nuclear@14: ltemp = (long) end_row - (long) ptr->rows_in_mem; nuclear@14: if (ltemp < 0) nuclear@14: ltemp = 0; /* don't fall off front end of file */ nuclear@14: ptr->cur_start_row = (JDIMENSION) ltemp; nuclear@14: } nuclear@14: /* Read in the selected part of the array. nuclear@14: * During the initial write pass, we will do no actual read nuclear@14: * because the selected part is all undefined. nuclear@14: */ nuclear@14: do_barray_io(cinfo, ptr, FALSE); nuclear@14: } nuclear@14: /* Ensure the accessed part of the array is defined; prezero if needed. nuclear@14: * To improve locality of access, we only prezero the part of the array nuclear@14: * that the caller is about to access, not the entire in-memory array. nuclear@14: */ nuclear@14: if (ptr->first_undef_row < end_row) { nuclear@14: if (ptr->first_undef_row < start_row) { nuclear@14: if (writable) /* writer skipped over a section of array */ nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: undef_row = start_row; /* but reader is allowed to read ahead */ nuclear@14: } else { nuclear@14: undef_row = ptr->first_undef_row; nuclear@14: } nuclear@14: if (writable) nuclear@14: ptr->first_undef_row = end_row; nuclear@14: if (ptr->pre_zero) { nuclear@14: size_t bytesperrow = (size_t) ptr->blocksperrow * SIZEOF(JBLOCK); nuclear@14: undef_row -= ptr->cur_start_row; /* make indexes relative to buffer */ nuclear@14: end_row -= ptr->cur_start_row; nuclear@14: while (undef_row < end_row) { nuclear@14: jzero_far((void FAR *) ptr->mem_buffer[undef_row], bytesperrow); nuclear@14: undef_row++; nuclear@14: } nuclear@14: } else { nuclear@14: if (! writable) /* reader looking at undefined data */ nuclear@14: ERREXIT(cinfo, JERR_BAD_VIRTUAL_ACCESS); nuclear@14: } nuclear@14: } nuclear@14: /* Flag the buffer dirty if caller will write in it */ nuclear@14: if (writable) nuclear@14: ptr->dirty = TRUE; nuclear@14: /* Return address of proper part of the buffer */ nuclear@14: return ptr->mem_buffer + (start_row - ptr->cur_start_row); nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Release all objects belonging to a specified pool. nuclear@14: */ nuclear@14: nuclear@14: METHODDEF(void) nuclear@14: free_pool (j_common_ptr cinfo, int pool_id) nuclear@14: { nuclear@14: my_mem_ptr mem = (my_mem_ptr) cinfo->mem; nuclear@14: small_pool_ptr shdr_ptr; nuclear@14: large_pool_ptr lhdr_ptr; nuclear@14: size_t space_freed; nuclear@14: nuclear@14: if (pool_id < 0 || pool_id >= JPOOL_NUMPOOLS) nuclear@14: ERREXIT1(cinfo, JERR_BAD_POOL_ID, pool_id); /* safety check */ nuclear@14: nuclear@14: #ifdef MEM_STATS nuclear@14: if (cinfo->err->trace_level > 1) nuclear@14: print_mem_stats(cinfo, pool_id); /* print pool's memory usage statistics */ nuclear@14: #endif nuclear@14: nuclear@14: /* If freeing IMAGE pool, close any virtual arrays first */ nuclear@14: if (pool_id == JPOOL_IMAGE) { nuclear@14: jvirt_sarray_ptr sptr; nuclear@14: jvirt_barray_ptr bptr; nuclear@14: nuclear@14: for (sptr = mem->virt_sarray_list; sptr != NULL; sptr = sptr->next) { nuclear@14: if (sptr->b_s_open) { /* there may be no backing store */ nuclear@14: sptr->b_s_open = FALSE; /* prevent recursive close if error */ nuclear@14: (*sptr->b_s_info.close_backing_store) (cinfo, & sptr->b_s_info); nuclear@14: } nuclear@14: } nuclear@14: mem->virt_sarray_list = NULL; nuclear@14: for (bptr = mem->virt_barray_list; bptr != NULL; bptr = bptr->next) { nuclear@14: if (bptr->b_s_open) { /* there may be no backing store */ nuclear@14: bptr->b_s_open = FALSE; /* prevent recursive close if error */ nuclear@14: (*bptr->b_s_info.close_backing_store) (cinfo, & bptr->b_s_info); nuclear@14: } nuclear@14: } nuclear@14: mem->virt_barray_list = NULL; nuclear@14: } nuclear@14: nuclear@14: /* Release large objects */ nuclear@14: lhdr_ptr = mem->large_list[pool_id]; nuclear@14: mem->large_list[pool_id] = NULL; nuclear@14: nuclear@14: while (lhdr_ptr != NULL) { nuclear@14: large_pool_ptr next_lhdr_ptr = lhdr_ptr->hdr.next; nuclear@14: space_freed = lhdr_ptr->hdr.bytes_used + nuclear@14: lhdr_ptr->hdr.bytes_left + nuclear@14: SIZEOF(large_pool_hdr); nuclear@14: jpeg_free_large(cinfo, (void FAR *) lhdr_ptr, space_freed); nuclear@14: mem->total_space_allocated -= space_freed; nuclear@14: lhdr_ptr = next_lhdr_ptr; nuclear@14: } nuclear@14: nuclear@14: /* Release small objects */ nuclear@14: shdr_ptr = mem->small_list[pool_id]; nuclear@14: mem->small_list[pool_id] = NULL; nuclear@14: nuclear@14: while (shdr_ptr != NULL) { nuclear@14: small_pool_ptr next_shdr_ptr = shdr_ptr->hdr.next; nuclear@14: space_freed = shdr_ptr->hdr.bytes_used + nuclear@14: shdr_ptr->hdr.bytes_left + nuclear@14: SIZEOF(small_pool_hdr); nuclear@14: jpeg_free_small(cinfo, (void *) shdr_ptr, space_freed); nuclear@14: mem->total_space_allocated -= space_freed; nuclear@14: shdr_ptr = next_shdr_ptr; nuclear@14: } nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Close up shop entirely. nuclear@14: * Note that this cannot be called unless cinfo->mem is non-NULL. nuclear@14: */ nuclear@14: nuclear@14: METHODDEF(void) nuclear@14: self_destruct (j_common_ptr cinfo) nuclear@14: { nuclear@14: int pool; nuclear@14: nuclear@14: /* Close all backing store, release all memory. nuclear@14: * Releasing pools in reverse order might help avoid fragmentation nuclear@14: * with some (brain-damaged) malloc libraries. nuclear@14: */ nuclear@14: for (pool = JPOOL_NUMPOOLS-1; pool >= JPOOL_PERMANENT; pool--) { nuclear@14: free_pool(cinfo, pool); nuclear@14: } nuclear@14: nuclear@14: /* Release the memory manager control block too. */ nuclear@14: jpeg_free_small(cinfo, (void *) cinfo->mem, SIZEOF(my_memory_mgr)); nuclear@14: cinfo->mem = NULL; /* ensures I will be called only once */ nuclear@14: nuclear@14: jpeg_mem_term(cinfo); /* system-dependent cleanup */ nuclear@14: } nuclear@14: nuclear@14: nuclear@14: /* nuclear@14: * Memory manager initialization. nuclear@14: * When this is called, only the error manager pointer is valid in cinfo! nuclear@14: */ nuclear@14: nuclear@14: GLOBAL(void) nuclear@14: jinit_memory_mgr (j_common_ptr cinfo) nuclear@14: { nuclear@14: my_mem_ptr mem; nuclear@14: long max_to_use; nuclear@14: int pool; nuclear@14: size_t test_mac; nuclear@14: nuclear@14: cinfo->mem = NULL; /* for safety if init fails */ nuclear@14: nuclear@14: /* Check for configuration errors. nuclear@14: * SIZEOF(ALIGN_TYPE) should be a power of 2; otherwise, it probably nuclear@14: * doesn't reflect any real hardware alignment requirement. nuclear@14: * The test is a little tricky: for X>0, X and X-1 have no one-bits nuclear@14: * in common if and only if X is a power of 2, ie has only one one-bit. nuclear@14: * Some compilers may give an "unreachable code" warning here; ignore it. nuclear@14: */ nuclear@14: if ((SIZEOF(ALIGN_TYPE) & (SIZEOF(ALIGN_TYPE)-1)) != 0) nuclear@14: ERREXIT(cinfo, JERR_BAD_ALIGN_TYPE); nuclear@14: /* MAX_ALLOC_CHUNK must be representable as type size_t, and must be nuclear@14: * a multiple of SIZEOF(ALIGN_TYPE). nuclear@14: * Again, an "unreachable code" warning may be ignored here. nuclear@14: * But a "constant too large" warning means you need to fix MAX_ALLOC_CHUNK. nuclear@14: */ nuclear@14: test_mac = (size_t) MAX_ALLOC_CHUNK; nuclear@14: if ((long) test_mac != MAX_ALLOC_CHUNK || nuclear@14: (MAX_ALLOC_CHUNK % SIZEOF(ALIGN_TYPE)) != 0) nuclear@14: ERREXIT(cinfo, JERR_BAD_ALLOC_CHUNK); nuclear@14: nuclear@14: max_to_use = jpeg_mem_init(cinfo); /* system-dependent initialization */ nuclear@14: nuclear@14: /* Attempt to allocate memory manager's control block */ nuclear@14: mem = (my_mem_ptr) jpeg_get_small(cinfo, SIZEOF(my_memory_mgr)); nuclear@14: nuclear@14: if (mem == NULL) { nuclear@14: jpeg_mem_term(cinfo); /* system-dependent cleanup */ nuclear@14: ERREXIT1(cinfo, JERR_OUT_OF_MEMORY, 0); nuclear@14: } nuclear@14: nuclear@14: /* OK, fill in the method pointers */ nuclear@14: mem->pub.alloc_small = alloc_small; nuclear@14: mem->pub.alloc_large = alloc_large; nuclear@14: mem->pub.alloc_sarray = alloc_sarray; nuclear@14: mem->pub.alloc_barray = alloc_barray; nuclear@14: mem->pub.request_virt_sarray = request_virt_sarray; nuclear@14: mem->pub.request_virt_barray = request_virt_barray; nuclear@14: mem->pub.realize_virt_arrays = realize_virt_arrays; nuclear@14: mem->pub.access_virt_sarray = access_virt_sarray; nuclear@14: mem->pub.access_virt_barray = access_virt_barray; nuclear@14: mem->pub.free_pool = free_pool; nuclear@14: mem->pub.self_destruct = self_destruct; nuclear@14: nuclear@14: /* Make MAX_ALLOC_CHUNK accessible to other modules */ nuclear@14: mem->pub.max_alloc_chunk = MAX_ALLOC_CHUNK; nuclear@14: nuclear@14: /* Initialize working state */ nuclear@14: mem->pub.max_memory_to_use = max_to_use; nuclear@14: nuclear@14: for (pool = JPOOL_NUMPOOLS-1; pool >= JPOOL_PERMANENT; pool--) { nuclear@14: mem->small_list[pool] = NULL; nuclear@14: mem->large_list[pool] = NULL; nuclear@14: } nuclear@14: mem->virt_sarray_list = NULL; nuclear@14: mem->virt_barray_list = NULL; nuclear@14: nuclear@14: mem->total_space_allocated = SIZEOF(my_memory_mgr); nuclear@14: nuclear@14: /* Declare ourselves open for business */ nuclear@14: cinfo->mem = & mem->pub; nuclear@14: nuclear@14: /* Check for an environment variable JPEGMEM; if found, override the nuclear@14: * default max_memory setting from jpeg_mem_init. Note that the nuclear@14: * surrounding application may again override this value. nuclear@14: * If your system doesn't support getenv(), define NO_GETENV to disable nuclear@14: * this feature. nuclear@14: */ nuclear@14: #ifndef NO_GETENV nuclear@14: { char * memenv; nuclear@14: nuclear@14: if ((memenv = getenv("JPEGMEM")) != NULL) { nuclear@14: char ch = 'x'; nuclear@14: nuclear@14: if (sscanf(memenv, "%ld%c", &max_to_use, &ch) > 0) { nuclear@14: if (ch == 'm' || ch == 'M') nuclear@14: max_to_use *= 1000L; nuclear@14: mem->pub.max_memory_to_use = max_to_use * 1000L; nuclear@14: } nuclear@14: } nuclear@14: } nuclear@14: #endif nuclear@14: nuclear@14: }