/* * 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 "@(#) point_disc.c 1.10 05/08/19 SwRI" #include "user_defs.h" #include "ret_codes.h" #include "libtrec_idfs.h" /**************************************************************************** * * * IR_POINT_DISCONTINUOUS SUBROUTINE * * * * DESCRIPTION * * This routine is called in order to transfer discontinuous data from * * the temporary data matrices into the bins for the buffer of interest. * * The bin in which the data is to be placed is calculated using the * * center sweep values associated with each element of the data matrix. * * Each center sweep value is examined to determine which bin or bins the * * data sample lies within. If the center sweep value for the sample is * * not found within the defined bands, the data is ignored. If the center * * sweep value is found, the data is placed into appropriate bin(s). This * * routine processes one data level (unit of data). Similar to the * * checking for boundary crossings for sweeps of data, a check is made for * * boundary crossings when multiple data values are merged to the same bin.* * * * INPUT VARIABLES * * SDDAS_SHORT num_disc the number of elements in the discontinuous* * data matrix * * SDDAS_FLOAT *dptr pointer to the discontinuous data * * SDDAS_FLOAT *tfrac pointer to the normalization factors for * * the discontinuous data * * SDDAS_CHAR *bin_stat pointer to the bin status values for the * * discontinuous data * * SDDAS_SHORT num_buf number of bins for the buffer of interest * * SDDAS_FLOAT *ret_data pointer to the buffer data * * SDDAS_FLOAT *ret_frac pointer to the normalization factors for * * the buffer * * SDDAS_CHAR *ret_stat pointer to the bin status values for the * * buffer * * SDDAS_SHORT sensor the sensor being processed * * * * USAGE * * ir_point_discontinuous (num_disc, &dptr, &tfrac, &bin_stat, num_buf, * * &ret_data, &ret_frac, &ret_stat, sensor) * * * * NECESSARY SUBPROGRAMS * * sizeof () the size of the specified object in bytes * * ir_find_bin () determines the bin(s) a value falls within * * 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 ginfo structure holding information concerning * * the experiment that is being processed * * void *ir_tmp_space scratch space for various uses * * * * INTERNAL VARIABLES * * struct experiment_info a pointer to the structure that holds * * *ex specific experiment information * * struct bin_info *bptr a pointer to the structure holding sweep * * binning information * * reg SDDAS_FLOAT *ddata, *dfrac, fast pointers for looping over data * * *rdata, *rfrac and normalization factors * * reg SDDAS_FLOAT *stop_loop loop termination variable * * register SDDAS_SHORT *s1 fast short ptr to the start and stop bins * * SDDAS_FLOAT *bin_low pointer to lowest sweep bin edge * * SDDAS_FLOAT *bin_high pointer to higest sweep bin edge * * SDDAS_FLOAT mxmn[] minimum and maximum extent of sweep bins * * SDDAS_FLOAT *temp temporary pointer * * SDDAS_FLOAT comp_val comparison value (last value processed) * * SDDAS_FLOAT new_val value to be added to buffer data array * * SDDAS_FLOAT *buf_last pointer to the last data values for the * * buffer bins being processed * * SDDAS_FLOAT center center sweep values (always raw steps) * * SDDAS_LONG band_offset offset to get to the band width values for * * the scan range associated with the sensor * * SDDAS_SHORT sbins[] starting and ending sweep bins * * SDDAS_SHORT i looping variable * * SDDAS_CHAR *rstat, *dstat pointers to the bin status values * * SDDAS_CHAR *buf_cross pointer to the boundary crossing flags * * for the buffer bins being processed * * SDDAS_CHAR *cptr pointer to the boundary crossing flag for * * the specific bin of interest * * * * SUBSYSTEM * * Display Level * * * ***************************************************************************/ void ir_point_discontinuous (SDDAS_SHORT num_disc, SDDAS_FLOAT *dptr, SDDAS_FLOAT *tfrac, SDDAS_CHAR *bin_stat, SDDAS_SHORT num_buf, SDDAS_FLOAT *ret_data, SDDAS_FLOAT *ret_frac, SDDAS_CHAR *ret_stat, SDDAS_SHORT sensor) { extern struct general_info ginfo; extern void *ir_tmp_space; struct experiment_info *ex; struct bin_info *bptr; register SDDAS_FLOAT *ddata, *rdata, *rfrac, *dfrac, *stop_loop; register SDDAS_SHORT *s1; SDDAS_FLOAT *bin_low, *bin_high, mxmn[2], *temp, comp_val, new_val; SDDAS_FLOAT *buf_last, center; SDDAS_LONG band_offset; SDDAS_SHORT sbins[2], i; SDDAS_CHAR *rstat, *dstat, *buf_cross, *cptr; /*********************************************************************/ /* Initialize boundary crossing and last data value for the buffer. */ /*********************************************************************/ buf_last = (SDDAS_FLOAT *) ir_tmp_space; buf_cross = (SDDAS_CHAR *) (ir_tmp_space + sizeof (SDDAS_FLOAT) * num_buf); for (i = 0; i < num_buf; ++i) { *(buf_last + i) = OUTSIDE_MIN; *(buf_cross + i) = 0; } /*********************************************************************/ /* Establish the location of the band edges of the bins in which */ /* the data is to be placed. In the case of discrete bands the */ /* band edges are stored in separate arrays, one for the set of low */ /* edges and one for the set of upper edges. In the case of */ /* continuous bands the upper edge of one band is the lower edge */ /* of the next band. */ /*********************************************************************/ ex = ginfo.expt; bptr = ex->bin_ptr; if (bptr->swp_fmt == ZERO_SPACING) band_offset = *(bptr->sen_index + sensor) * bptr->num_bins; else band_offset = *(bptr->sen_index + sensor) * (bptr->num_bins + 1); bin_low = (SDDAS_FLOAT *) (bptr->band_low + band_offset); if (bptr->swp_fmt == ZERO_SPACING) bin_high = (SDDAS_FLOAT *) (bptr->band_high + band_offset); else bin_high = bin_low + 1; /*********************************************************************/ /* The search routines which locate the appropriate bins in which */ /* the data is to be placed want to see the bins presented in */ /* ascending order - that is, the lower edge being the smaller of */ /* the two edges. At this time, if the band edges need to be */ /* switched, go ahead and do so. At the same time, grab the least */ /* and greatest value which can be stored within these bands. This */ /* will be used to prevent trying to locate a bin for a data value */ /* which has none within these bins. */ /*********************************************************************/ if (*bin_low < *(bin_low + 1)) { mxmn[0] = *bin_low; mxmn[1] = *(bin_high + bptr->num_bins - 1); } else { mxmn[0] = *(bin_high + bptr->num_bins - 1); mxmn[1] = *bin_low; temp = bin_low; bin_low = bin_high; bin_high = temp; } /*******************************************************************/ /* Set up pointers to the various data elements. */ /*******************************************************************/ s1 = sbins; ddata = dptr; dfrac = tfrac; dstat = bin_stat; stop_loop = ddata + num_disc; rdata = ret_data; rfrac = ret_frac; rstat = ret_stat; /*******************************************************************/ /* Loop over all the elements in the temporary data matrix, using */ /* the center values (always raw steps) to determine which bin */ /* the element is to be transferred to. */ /*******************************************************************/ for (center = 0.0; ddata < stop_loop; ++center, ++ddata, ++dfrac, ++dstat) { /*****************************************************************/ /* Determine which bin(s) encompass the data. */ /*****************************************************************/ ir_find_bin (center, center, bin_low, bin_high, mxmn, sbins, bptr->input_fmt, bptr->swp_fmt, bptr->num_bins); if (*s1 != -1) { /*****************************************************************/ /* If no discontinuous data in the current element, continue. */ /*****************************************************************/ if (*dstat == 0) continue; /*****************************************************************/ /* Check for boundary crossing. */ /*****************************************************************/ comp_val = *(buf_last + *s1); cptr = buf_cross + *s1; ir_check_boundary (cptr, &new_val, *ddata, comp_val); if (*(rstat + *s1) == 0) { *(rdata + *s1) = new_val * *dfrac; *(rstat + *s1) = 1; *(rfrac + *s1) = *dfrac; } else { *(rdata + *s1) += new_val * *dfrac; *(rfrac + *s1) += *dfrac; } /***************************************************************/ /* Save the last value processed if it is processed. */ /***************************************************************/ *(buf_last + *s1) = *ddata; } } }