/* * 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 "@(#) alloc_timing.c 1.23 05/08/19 SwRI" #include #include "ret_codes.h" #include "gen_defs.h" #include "libbase_idfs.h" /******************************************************************************* * * * IR_ALLOC_TIMING SUBROUTINE * * * * DESCRIPTION * * This routine is called in order to allocate space to hold timing * * information that is needed to place the data into appropriate buffers by * * FILL_DATA(). The number of timing structures used depends on the time * * offset values for the sensors being processed. If the values are * * different, then there is a need for one timing structure per sensor; * * otherwise, just one timing structure is needed for use by all sensors. * * * * INPUT VARIABLES * * None * * * * USAGE * * x = ir_alloc_timing () * * * * NECESSARY SUBPROGRAMS * * malloc() allocates memory * * sizeof () the size of the specified object in bytes * * * * EXTERNAL VARIABLES * * struct general_info structure holding information concerning * * ginfo the experiment that is being processed * * * * INTERNAL VARIABLES * * reg struct experiment_info a pointer to the structure that holds * * *ex specific experiment information * * reg struct timing *tptr a pointer to the structure that holds * * timing information * * reg struct timing *stop_tptr loop termination variable * * reg SDDAS_SHORT num_struct number of timing structures to allocate * * SDDAS_SHORT days_in_yr the number of days in the year * * size_t bytes the number of bytes to allocate * * void *tmp_ptr pointer which holds address passed back by * * the call to the MALLOC routine * * * * SUBSYSTEM * * Display Level * * * ******************************************************************************/ SDDAS_SHORT ir_alloc_timing (void) { extern struct general_info ginfo; register struct experiment_info *ex; register struct timing *tptr, *stop_tptr; register SDDAS_SHORT num_struct; SDDAS_SHORT days_in_yr; size_t bytes; void *tmp_ptr; /****************************************************************************/ /* If memory already exists, free and reset. May be true since file_pos() */ /* is called again AFTER reset_experiment_info() is called. */ /****************************************************************************/ ex = ginfo.expt; if (ex->bmem.base_timing != NULL) { free (ex->bmem.base_timing); ex->bmem.base_timing = NULL; } /**************************************************************************/ /* If the time offsets are different (all_or_one set to 1), need one */ /* timing structure per sensor; otherwise, just 1 structure needed. */ /**************************************************************************/ num_struct = (ex->all_or_one) ? ex->num_sensor : 1; bytes = sizeof (struct timing) * num_struct; if ((tmp_ptr = malloc (bytes)) == NO_MEMORY) return (TIMING_MALLOC); ex->bmem.base_timing = tmp_ptr; ex->timing_ptr = (struct timing *) ex->bmem.base_timing; tptr = ex->timing_ptr; stop_tptr = ex->timing_ptr + num_struct; /**************************************************************************/ /* The base time has not been set, so just initialize to some values. */ /**************************************************************************/ if (ex->time_values.base_year == 0) for (; tptr < stop_tptr; ++tptr) { tptr->pix_num = -1; tptr->start_sec = 0; tptr->start_nano = 0; tptr->end_sec = 0; tptr->end_nano = 0; tptr->start_yr = 0; tptr->start_day = 0; tptr->end_yr = 0; tptr->end_day = 0; } /**************************************************************************/ /* If the base time has been set, initial the elements using that info. */ /**************************************************************************/ else { /**********************************************************************/ /* Since these values do not change, check once instead of checking */ /* everytime through the loop. */ /**********************************************************************/ SDDAS_LONG end_sec, end_nano; SDDAS_SHORT end_day, end_yr; end_sec = ex->time_values.base_sec + ex->time_values.res_sec; end_nano = ex->time_values.base_nano + ex->time_values.res_nano; end_day = ex->time_values.base_day; end_yr = ex->time_values.base_year; /**********************************************************************/ /* Make sure all time components stay within boundaries. */ /* This code assumes that res_nano cannot be more than one second. */ /**********************************************************************/ if (end_nano >= 1000000000) { ++end_sec; end_nano -= 1000000000; } end_day += end_sec / 86400; end_sec = end_sec % 86400; if ((end_yr % 4 == 0 && end_yr % 100 != 0) || end_yr % 400 == 0) days_in_yr = 366; else days_in_yr = 365; if (end_day > days_in_yr) { end_yr += end_day / days_in_yr; end_day = end_day % days_in_yr; } for (; tptr < stop_tptr; ++tptr) { tptr->pix_num = ex->time_values.base_pix; tptr->start_sec = ex->time_values.base_sec; tptr->start_nano = ex->time_values.base_nano; tptr->start_yr = ex->time_values.base_year; tptr->start_day = ex->time_values.base_day; tptr->end_sec = end_sec; tptr->end_nano = end_nano; tptr->end_yr = end_yr; tptr->end_day = end_day; } } return (ALL_OKAY); }