/* * Copyright (C) 1998 by Southwest Research Institute (SwRI) * * All rights reserved under U.S. Copyright Law and International Conventions. * * The development of this Software was supported by contracts NAG5-3148, * NAG5-6855, NAS8-36840, NAG5-2323, and NAG5-7043 issued on behalf of * the United States Government by its National Aeronautics and Space * Administration. Southwest Research Institute grants to the Government, * and others acting on its behalf, a paid-up nonexclusive, irrevocable, * worldwide license to reproduce, prepare derivative works, and perform * publicly and display publicly, by or on behalf of the Government. * Other than those rights granted to the United States Government, no part * of this Software may be reproduced in any form or by any means, electronic * or mechanical, including photocopying, without permission in writing from * Southwest Research Institute. All inquiries should be addressed to: * * Director of Contracts * Southwest Research Institute * P. O. Drawer 28510 * San Antonio, Texas 78228-0510 * * * Use of this Software is governed by the terms of the end user license * agreement, if any, which accompanies or is included with the Software * (the "License Agreement"). An end user will be unable to install any * Software that is accompanied by or includes a License Agreement, unless * the end user first agrees to the terms of the License Agreement. Except * as set forth in the applicable License Agreement, any further copying, * reproduction or distribution of this Software is expressly prohibited. * Installation assistance, product support and maintenance, if any, of the * Software is available from SwRI and/or the Third Party Providers, as the * case may be. * * Disclaimer of Warranty * * SOFTWARE IS WARRANTED, IF AT ALL, IN ACCORDANCE WITH THESE TERMS OF THE * LICENSE AGREEMENT. UNLESS OTHERWISE EXPLICITLY STATED, THIS SOFTWARE IS * PROVIDED "AS IS", IS EXPERIMENTAL, AND IS FOR NON-COMMERCIAL USE ONLY, * AND ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND WARRANTIES, * INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, FITNESS FOR A PARTICULAR * PURPOSE, OR NON-INFRINGEMENT, ARE DISCLAIMED, EXCEPT TO THE EXTENT THAT * SUCH DISCLAIMERS ARE HELD TO BE LEGALLY INVALID. * * Limitation of Liability * * SwRI SHALL NOT BE LIABLE FOR ANY DAMAGES SUFFERED AS A RESULT OF USING, * MODIFYING, CONTRIBUTING, COPYING, DISTRIBUTING, OR DOWNLOADING THIS * SOFTWARE. IN NO EVENT SHALL SwRI BE LIABLE FOR ANY INDIRECT, PUNITIVE, * SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGE (INCLUDING LOSS OF BUSINESS, * REVENUE, PROFITS, USE, DATA OR OTHER ECONOMIC ADVANTAGE) HOWEVER IT ARISES, * WHETHER FOR BREACH OF IN TORT, EVEN IF SwRI HAS BEEN PREVIOUSLY ADVISED OF * THE POSSIBILITY OF SUCH DAMAGE. YOU HAVE SOLE RESPONSIBILITY FOR ADEQUATE * PROTECTION AND BACKUP OF DATA AND/OR EQUIPMENT USED IN CONNECTION WITH THE * SOFTWARE AND WILL NOT MAKE A CLAIM AGAINST SwRI FOR LOST DATA, RE-RUN TIME, * INACCURATE OUTPUT, WORK DELAYS OR LOST PROFITS RESULTING FROM THE USE OF * THIS SOFTWARE. YOU AGREE TO HOLD SwRI HARMLESS FROM, AND YOU COVENANT NOT * TO SUE SwRI FOR, ANY CLAIMS BASED ON USING THE SOFTWARE. * * Local Laws: Export Control * * You acknowledge and agree this Software is subject to the U.S. Export * Administration Laws and Regulations. Diversion of such Software contrary * to U.S. law is prohibited. You agree that none of the Software, nor any * direct product therefrom, is being or will be acquired for, shipped, * transferred, or reexported, directly or indirectly, to proscribed or * embargoed countries or their nationals, nor be used for nuclear activities, * chemical biological weapons, or missile projects unless authorized by U.S. * Government. Proscribed countries are set forth in the U.S. Export * Administration Regulations. Countries subject to U.S embargo are: Cuba, * Iran, Iraq, Libya, North Korea, Syria, and the Sudan. This list is subject * to change without further notice from SwRI, and you must comply with the * list as it exists in fact. You certify that you are not on the U.S. * Department of Commerce's Denied Persons List or affiliated lists or on the * U.S. Department of Treasury's Specially Designated Nationals List. You agree * to comply strictly with all U.S. export laws and assume sole responsibilities * for obtaining licenses to export or reexport as may be required. * * General * * These Terms represent the entire understanding relating to the use of the * Software and prevail over any prior or contemporaneous, conflicting or * additional, communications. SwRI can revise these Terms at any time * without notice by updating this posting. * * Trademarks * * The SwRI logo is a trademark of SwRI in the United States and other countries. * */ #ident "@(#) chk_cal_size.c 1.10 05/08/19 SwRI" #include #include "ret_codes.h" #include "gen_defs.h" #include "libbase_idfs.h" #include "libVIDF.h" /* for header format comparison */ /****************************************************************************** * * * IR_CHECK_CAL_SIZE SUBROUTINE * * * * DESCRIPTION * * This routine is called to determine if the array that holds the cal. * * data is of sufficient size. If the total number of calibration values * * exceeds the size of the memory allocated to return this information, the * * array is reallocated. * * * * INPUT VARIABLES * * void *data_ptr ptr to memory location for the structure * * that holds returned data values (either * * idf_data or tensor_data) * * * * USAGE * * x = ir_check_cal_size (data_ptr) * * * * NECESSARY SUBPROGRAMS * * realloc() reallocates previously allocated memory * * sizeof () the size of the specified object in bytes * * * * EXTERNAL VARIABLES * * struct general_info ginfo structure that holds information concerning* * the experiment that is being processed * * * * INTERNAL VARIABLES * * struct idf_data *EXP_DATA structure that holds all of the currently * * returned data values to be processed * * struct tensor_data *TENSOR_DATA structure that holds all the currently * * returned data values to be processed * * struct experiment_info *ex a pointer to the structure that holds * * specific experiment information * * register SDDAS_SHORT i looping variable * * SDDAS_ULONG num_cal the number of calibration values for all * * calibration sets * * size_t bytes the number of bytes to allocate * * size_t num_bytes_slong the number of bytes needed for a SDDAS_LONG* * void *tmp_ptr pointer which holds address passed back by * * the call to the MALLOC routine * * * * SUBSYSTEM * * Display Level * * * ******************************************************************************/ SDDAS_SHORT ir_check_cal_size (void *data_ptr) { extern struct general_info ginfo; struct idf_data *EXP_DATA; struct tensor_data *TENSOR_DATA; struct experiment_info *ex; register SDDAS_SHORT i; SDDAS_ULONG num_cal; size_t bytes, num_bytes_slong; void *tmp_ptr; /************************************************************************/ /* Determine how many calibration values will be returned for all cal. */ /* sets for this virtual instrument. */ /************************************************************************/ ex = ginfo.expt; num_bytes_slong = sizeof (SDDAS_LONG); for (i = 0, num_cal = 0; i < ex->cal_sets; ++i) num_cal += *(ex->CSET_NUM + i); bytes = num_bytes_slong * num_cal; /************************************************************************/ /* If the space for the calibration data is not large enough to handle */ /* this virtual instrument, enlarge the memory size. This array will */ /* end up being maxed out to the largest number of elements for ALL */ /* virtual instruments that use this data structure. For speed issues,*/ /* got rid of conditional check for first allocation and call to */ /* malloc() since realloc() with NULL ptr acts the same. */ /************************************************************************/ if (ex->header_format == ORIGINAL_HEADER) { EXP_DATA = (struct idf_data *) data_ptr; if (bytes > EXP_DATA->cal_size) { if ((tmp_ptr = realloc (EXP_DATA->base_cal, bytes)) == NO_MEMORY) return (NUM_CAL_REALLOC); EXP_DATA->base_cal = tmp_ptr; EXP_DATA->cal_data = (SDDAS_LONG *) EXP_DATA->base_cal; EXP_DATA->cal_size = (SDDAS_UINT) bytes; EXP_DATA->cal_len = bytes / num_bytes_slong; } } else { TENSOR_DATA = (struct tensor_data *) data_ptr; if (bytes > TENSOR_DATA->cal_size) { if ((tmp_ptr = realloc (TENSOR_DATA->base_cal, bytes)) == NO_MEMORY) return (NUM_CAL_REALLOC); TENSOR_DATA->base_cal = tmp_ptr; TENSOR_DATA->cal_data = (SDDAS_LONG *) TENSOR_DATA->base_cal; TENSOR_DATA->cal_size = (SDDAS_UINT) bytes; TENSOR_DATA->cal_len = bytes / num_bytes_slong; /**************************************************************************/ /* Allocate space to hold the tensor that is to be returned to the user, */ /* converted according to d_type. Within the SDDAS typedefs, SDDAS_LONG */ /* and SDDAS_FLOAT are the same size, so no need to have separate */ /* cal_size, cal_len elements. */ /**************************************************************************/ if ((tmp_ptr = realloc (TENSOR_DATA->base_tcaldata, bytes)) == NO_MEMORY) return (NUM_CAL_REALLOC); TENSOR_DATA->base_tcaldata = tmp_ptr; TENSOR_DATA->tcaldata = (SDDAS_FLOAT *) TENSOR_DATA->base_tcaldata; } } return (ALL_OKAY); }