/* * 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 "@(#) pps_disc.c 1.13 05/08/19 SwRI" #include "user_defs.h" #include "libtrec_idfs.h" /**************************************************************************** * * * IR_PPS_DISCONTINUOUS SUBROUTINE * * * * DESCRIPTION * * This routine is called in order to stuff data into the temporary data * * matrices utilized for discontinuous data. The data is stored according * * to the SAMP INDEX values returned by each data sample. This routine * * only works for a discontinuous range of -180 to 180. This routine * * processes one data level or unit. * * * * INPUT VARIABLES * * SDDAS_USHORT num_sample the number of elements to be processed * * SDDAS_FLOAT time_frac percentage of the time resolution covered * * by the sweep * * SDDAS_LONG offset_unit offset used to get to correct data level * * sub-buffer in the data matrix * * SDDAS_FLOAT *dptr pointer to the discontinuous data matrix * * SDDAS_FLOAT *tmp_buf pointer to the converted data levels * * SDDAS_FLOAT *tfrac pointer to the normalization factors for * * the discontinuous data * * SDDAS_FLOAT *last_data pointer to the last_data array for the * * discontinuous data matrices * * SDDAS_CHAR *bin_stat pointer to the bin status array for the * * discontinuous data * * SDDAS_CHAR data_type type of data to be processed * * SDDAS_CHAR *cross_bound pointer to the boundary crossing flags * * void *idf_data_ptr ptr to memory location for the structure * * that holds returned data values (read_drec)* * * * USAGE * * ir_pps_discontinuous (num_sample, time_frac, offset_unit, &dptr, * * &tfrac, &bin_stat, &tmp_buf, data_type, * * &last_data, &cross_bound, idf_data_ptr) * * * * NECESSARY SUBPROGRAMS * * ir_check_boundary () determines if a boundary was crossed * * between the last processed value and the * * new data value and corrects the new data * * value if necessary * * * * EXTERNAL VARIABLES * * struct general_info structure that holds information concerning* * ginfo 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 experiment_info a pointer to the structure that holds * * *ex specific experiment information * * reg SDDAS_FLOAT *ret_data pointer to the discontinuous data for the * * data level (unit) being processed * * reg SDDAS_FLOAT *ret_frac pointer to the normalization factors for * * the data level (unit) being processed * * reg SDDAS_FLOAT *data_ptr pointer to the converted data levels * * reg SDDAS_FLOAT *last_ptr pointer to the last_data matrix for the * * the data level (unit) being processed * * reg SDDAS_LONG *pps_step pointer to the SAMP_INDEX values * * reg SDDAS_CHAR *ret_stat pointer to the bin status array for the * * data level (unit) being processed * * reg SDDAS_CHAR *cross_ptr pointer to the boundary crossing flags * * for the data level (unit) being processed * * SDDAS_FLOAT new_val value to be added to discontinuous data * * matrix * * SDDAS_FLOAT comp_val comparison value (last value processed) * * SDDAS_FLOAT *stop_loop loop termination variable * * SDDAS_LONG *step_end loop termination variable * * SDDAS_CHAR *cptr pointer to the boundary crossing flag for * * the element of interest * * * * SUBSYSTEM * * Display Level * * * ***************************************************************************/ void ir_pps_discontinuous (SDDAS_USHORT num_sample, SDDAS_FLOAT time_frac, SDDAS_LONG offset_unit, SDDAS_FLOAT *dptr, SDDAS_FLOAT *tfrac, SDDAS_CHAR *bin_stat, SDDAS_FLOAT *tmp_buf, SDDAS_CHAR data_type, SDDAS_FLOAT *last_data, SDDAS_CHAR *cross_bound, void *idf_data_ptr) { extern struct general_info ginfo; struct idf_data *EXP_DATA; struct experiment_info *ex; register SDDAS_FLOAT *ret_data, *ret_frac, *data_ptr, *last_ptr; register SDDAS_LONG *pps_step; register SDDAS_CHAR *ret_stat, *cross_ptr; SDDAS_FLOAT *stop_loop, new_val, comp_val; SDDAS_LONG *step_end; SDDAS_CHAR *cptr; /*********************************************************************/ /* Set up pointers to the data level (unit) being accessed. */ /*********************************************************************/ EXP_DATA = (struct idf_data *) idf_data_ptr; ex = ginfo.expt; ret_data = dptr + offset_unit; ret_frac = tfrac + offset_unit; ret_stat = bin_stat + offset_unit; last_ptr = last_data + offset_unit; cross_ptr = cross_bound + offset_unit; /*********************************************************************/ /* This data object is not associated with any particular band, */ /* therefore, just place the value into all the bins. */ /*********************************************************************/ if (data_type == D_QUAL) { /*****************************************************************/ /* The check for boundary crossings needs to be done once since */ /* tmp_buf[0] is copied into all data bins. Make sure data is */ /* within range; if not, do not use the data value. */ /*****************************************************************/ if (*tmp_buf >= -180.0 && *tmp_buf <= 180.0) ir_check_boundary (cross_ptr, &new_val, *tmp_buf, *last_ptr); stop_loop = ret_data + ex->swp_len; for (; ret_data < stop_loop; ++ret_data, ++ret_frac, ++ret_stat, ++last_ptr) { /****************************************************************/ /* Include only data values that fall within the cutoff range. */ /* TMP_BUF[0] holds the data in converted units. Unlike the */ /* processing of continuous data, no need to set data value to */ /* OUTSIDE_MAX if outside range - data is either there or it is */ /* not there. */ /****************************************************************/ if (*tmp_buf >= -180.0 && *tmp_buf <= 180.0) { if (*ret_stat == 0) { *ret_data = new_val * time_frac; *ret_stat = 1; *ret_frac = time_frac; } else { *ret_data += new_val * time_frac; *ret_frac += time_frac; } /***************************************************************/ /* Only save the last value processed if it is a good value. */ /***************************************************************/ *last_ptr = *tmp_buf; } } } else { pps_step = EXP_DATA->swp_data; step_end = pps_step + num_sample; data_ptr = tmp_buf; for (; pps_step < step_end; ++pps_step, ++data_ptr) { /*****************************************************************/ /* Is the data within the discontinuous range? Unlike the */ /* processing of continuous data, no need to set data value to */ /* OUTSIDE_MAX if outside range - data is either there or it is */ /* not there. */ /*****************************************************************/ if (*data_ptr >= -180.0 && *data_ptr <= 180.0) { /*****************************************************************/ /* Check for boundary crossing from sweep to sweep. */ /*****************************************************************/ comp_val = *(last_ptr + *pps_step); cptr = cross_ptr + *pps_step; ir_check_boundary (cptr, &new_val, *data_ptr, comp_val); if (*(ret_stat + *pps_step) == 0) { *(ret_data + *pps_step) = new_val * time_frac; *(ret_stat + *pps_step) = 1; *(ret_frac + *pps_step) = time_frac; } else { *(ret_data + *pps_step) += new_val * time_frac; *(ret_frac + *pps_step) += time_frac; } /***************************************************************/ /* Only save the last value processed if it is a good value. */ /***************************************************************/ *(last_ptr + *pps_step) = *data_ptr; } } } }