/* * 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 "@(#) stuff_pband.c 1.16 05/08/19 SwRI" #include "libtrec_idfs.h" /**************************************************************************** * * * IR_STUFF_PHI_BAND SUBROUTINE * * * * DESCRIPTION * * This routine is called in order to stuff the data into the determined * * sweep bin(s) for the specified phi bin. This is necessary since data * * sample may cover many phi sweep bins. This routine will be called * * once for each phi bin to be covered. The data must be multiplied by * * the percentage of the phi bin covered, the percentage of the sweep bin * * covered and the time percentage. * * * * INPUT VARIABLES * * SDDAS_FLOAT *dptr pointer to the data array * * SDDAS_FLOAT *tot_frac pointer to normalization factors * * SDDAS_FLOAT *tmp_buf pointer to the converted data levels * * SDDAS_FLOAT *smnmx lower and upper data cutoff values * * SDDAS_CHAR *bin_stat pointer to the bin status array * * register SDDAS_SHORT *bins starting and stopping data bins * * reg SDDAS_FLOAT *fracs array of 3 fractions; (0) time_frac times * * phi_frac times swp_sfrac; (1) time_frac * * times phi_frac; (2) time_frac times * * phi_frac times swp_efrac; * * SDDAS_LONG offset_phi offset to get to correct phi bin column * * * * USAGE * * ir_stuff_phi_band (&dptr, &tot_frac, &bin_stat, &tmp_buf, smnmx, * * offset_phi, bins, fracs) * * * * NECESSARY SUBPROGRAMS * * ir_stuff_phi () stuffs the data into specified bin within * * specified phi bin using the percentage of * * phi bin covered, the sweep percentage and * * the time percentage * * * * EXTERNAL VARIABLES * * struct general_info ginfo structure that holds information concerning* * the experiment that is being processed * * * * INTERNAL VARIABLES * * struct bin_info *bptr a pointer to the structure that holds sweep* * binning information * * register SDDAS_LONG offset looping variable * * register SDDAS_LONG end loop terminator * * * * SUBSYSTEM * * Display Level * * * * OPTIMAZATION STATUS * * Fully optimized: Note that now this routine assumes the following * * 1) all 3 data fractions need to be computed externally and passed in * * the fracs array * * 2) offsets into tmp_buf are handled externally * * 3) sensor minimum and maximum ranges for data inclusion form an * * array. * * 4) offset_phi is input for the correct phi bin * * * * The above conditions are now placed on the calling routines * * * * HANDLES * * This routine handles the demand that the phi offsets into stuff_phi * * include the sweep offset * ***************************************************************************/ void ir_stuff_phi_band (SDDAS_FLOAT *dptr, SDDAS_FLOAT *tot_frac, SDDAS_CHAR *bin_stat, SDDAS_FLOAT *tmp_buf, SDDAS_FLOAT *smnmx, SDDAS_LONG offset_phi, register SDDAS_SHORT *bins, register SDDAS_FLOAT *fracs) { extern struct general_info ginfo; register struct bin_info *bptr; register SDDAS_LONG offset, end; /*********************************************************************/ /* Fill in the data for the specified starting sweep bin. */ /* If the start bin is -1, the starting sweep value was less than */ /* the value of the first sweep bin. */ /*********************************************************************/ bptr = ginfo.expt->bin_ptr; if (*bins != -1) { offset = offset_phi + *bins; ir_stuff_phi (dptr, tot_frac, bin_stat, tmp_buf, smnmx, offset, *fracs); } /*********************************************************************/ /* 100% of the sweep bin is covered for those bins between the */ /* start bin and the stop bin. If the stop bin is -1, the ending */ /* sweep value was greater than the value of the last sweep bin. */ /*********************************************************************/ offset = (*bins == -1) ? offset_phi : offset_phi + *bins + 1; end = (*(bins+1) == -1) ? offset_phi + bptr->num_bins : offset_phi + *(bins+1); for ( ; offset < end; ) ir_stuff_phi (dptr, tot_frac, bin_stat, tmp_buf, smnmx, offset++, *(fracs+1)); /*********************************************************************/ /* Fill in the data for the last sweep bin if the data covers more */ /* than one sweep bin. */ /*********************************************************************/ if (*(bins+1) != -1 && (*bins != *(bins+1))) { offset = offset_phi + *(bins+1); ir_stuff_phi (dptr, tot_frac, bin_stat, tmp_buf, smnmx, offset, *(fracs+2)); } }