/* * 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 "@(#) reset_set.c 1.23 05/08/19 SwRI" #include #include "libbase_idfs.h" #include "libVIDF.h" /* for header format comparison */ /******************************************************************************* * * * IR_RESET_SEN_SET SUBROUTINE * * * * DESCRIPTION * * This routine is called to adjust the cumulative sensor set time values. * * Time was advanced and in doing so, a new sensor set was encountered. * * These cumulative sensor set values are used in the equation defined in the * * IDFS document for computing the time of a given sample. * * * * INPUT VARIABLES * * None * * * * USAGE * * ir_reset_sen_set_time () * * * * NECESSARY SUBPROGRAMS * * abs() returns the absolute value of a number * * * * EXTERNAL VARIABLES * * struct general_info structure that holds information concerning * * ginfo the experiment that is being processed * * * * INTERNAL VARIABLES * * struct experiment_info a pointer to the structure that holds * * *ex specific experiment information * * struct ptr_rec *ptr a pointer to the structure which holds all * * pointers to the header and data for the * * experiment of interest * * SDDAS_LONG num_of_bits number of bits to bypass the sensor set(s) * * SDDAS_LONG num_bytes number of bytes to bypass the sensor set(s) * * SDDAS_ULONG num_cal number of calibration values * * SDDAS_ULONG num_sample the number of samples returned for each sensor* * SDDAS_ULONG set_sample the number of samples to use to determine time* * SDDAS_SHORT n_sen the number of sensors returned in the current * * record * * SDDAS_SHORT base_swp_off sweep step offset for first element in column * * SDDAS_SHORT swp_off sweep step offset for last element in column * * SDDAS_SHORT byte_size how many bits are used per data element * * within each byte (necessary due to padding) * * * * SUBSYSTEM * * Display Level * * * ******************************************************************************/ void ir_reset_sen_set_time (void) { extern struct general_info ginfo; struct experiment_info *ex; struct ptr_rec *ptr; SDDAS_LONG num_of_bits, num_bytes; SDDAS_ULONG num_cal, num_sample, set_sample; SDDAS_SHORT n_sen, base_swp_off, swp_off, byte_size; /****************************************************************************/ /* Set a pointer to the structure which holds all pointers for header and */ /* data information for the experiment currently being processed and point */ /* to the sensor structure for the sensor of interest. */ /****************************************************************************/ ex = ginfo.expt; ptr = ex->info_ptr; n_sen = *ptr->N_SEN; /*************************************************************************/ /* CARRIE - Not sure this is correct. */ /*************************************************************************/ if (ex->header_format == ORIGINAL_HEADER) { num_sample = *ptr->hdr_fmt1_ptr->N_SAMPLE; if (ex->smp_id == 2) set_sample = num_sample; else { /***********************************************************/ /* Instrument could be in a mode where a single step is */ /* being returned. */ /***********************************************************/ if (num_sample == 1) set_sample = 1; else if (ex->da_method == 3) { /*************************************************************/ /* Determine how many steps are missing and then multiply */ /* by the number of samples returned to get the length of */ /* the sweep. The assumption is that the number of missing */ /* steps is the same from one scan_index value to the next, */ /* so just use 0 and 1. */ /*************************************************************/ base_swp_off = *ptr->hdr_fmt1_ptr->SAMP_INDEX; swp_off = *(ptr->hdr_fmt1_ptr->SAMP_INDEX + 1); set_sample = abs (swp_off - base_swp_off) * num_sample; } else { base_swp_off = *ptr->hdr_fmt1_ptr->SAMP_INDEX; swp_off = *(ptr->hdr_fmt1_ptr->SAMP_INDEX + (num_sample - 1)); set_sample = (ex->da_method == 0) ? num_sample : (ex->da_method == 1) ? ex->swp_len : abs (swp_off - base_swp_off); } } } else { num_sample = ptr->hdr_fmt2_ptr->TENSOR_ELEMENTS; set_sample = num_sample; } /*************************************************************************/ /* Determine the time between 2 successive sensor sets of data and add */ /* this value to the cumulative sensor set time values. */ /*************************************************************************/ ex->accum_ss_ms += ex->time_row_ms * (n_sen - 1) + ex->time_col_ms * (set_sample - 1) + ex->swp_ms + ex->sen_ms + ex->time_sm_ms; ex->accum_ss_ns += ex->time_row_ns * (n_sen - 1) + ex->time_col_ns * (set_sample - 1) + ex->swp_ns + ex->sen_ns + ex->time_sm_ns; /****************************************************************************/ /* Byte_size indicates how many bits are used per data element within each */ /* byte. For 5, 6 and 7 bit data, there are pad bits so that there is */ /* only one sample per byte (takes 8 bits). For 3 bit data, use 4 since */ /* the data is laid down as a 4-bit value with the most significant bit */ /* set to zero. The rest of the cases divide evenly into the byte. */ /****************************************************************************/ if (ex->tdw_len < 8) byte_size = (ex->tdw_len >= 5) ? 8 : (ex->tdw_len == 3) ? 4 : ex->tdw_len; else byte_size = (ex->tdw_len == 8) ? 8 : (ex->tdw_len <= 16) ? 16 : 32; /**************************************************************************/ /* The no. of bits needed for the old sensor set just changed. Since */ /* the next sensor set starts at the next byte, make sure number of bits */ /* gets adjusted to next byte. */ /**************************************************************************/ num_cal = ptr->num_all_swp_cal + ptr->num_all_sen_cal + ptr->num_swp_cal + ptr->num_sen_cal; num_of_bits = (num_sample * n_sen + num_cal) * byte_size; num_bytes = num_of_bits / 8; if (num_of_bits % 8 != 0) ++num_bytes; num_of_bits = num_bytes * 8; ex->accum_ss_sz += num_of_bits; }