/* * 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 "@(#) con_lin_phi.c 1.17 05/08/19 SwRI" #include "user_defs.h" #include "libtrec_idfs.h" #include "libIDFSFill.h" /***************************************************************************** * * * IR_CONSTANT_LINEAR_PHI SUBROUTINE * * * * DESCRIPTION * * This routine is called to fill in the missing bins for the phi data * * matrix for all fill methods except for the least square's fit method. * * The bins are filled using a constant or linear interpolation of the rows * * and columns. All units are processed, one at a time, in addition to all * * theta groups. * * * * INPUT VARIABLES * * SDDAS_CHAR cyclic flag indicating if the data is cyclic * * SDDAS_CHAR fill_method method chosen for filling in missing bins * * SDDAS_CHAR project flag indicating if the data is to be * * projected to the end of the bins * * SDDAS_LONG need_filled number of filled bins needed to perform * * the calculations to determine the missing * * value * * SDDAS_CHAR cur_buf the buffer being processed (0 - 4) * * * * USAGE * * ir_constant_linear_phi (cyclic, need_filled, fill_method, project, * * cur_buf) * * * * NECESSARY SUBPROGRAMS * * IDFSFill_row_constant_cyc() fills a partially filled row of data by * * projecting the known values for cyclic * * data * * IDFSFill_row_constant_ncyc() fills a partially filled row of data by * * projecting the known values for non-cyclic* * data * * IDFSFill_row_linear_cyc () fills a partially filled row of data by * * linear interpolation between known values * * for cyclic data * * IDFSFill_row_linear_ncyc () fills a partially filled row of data by * * linear interpolation between known values * * for non-cyclic data * * IDFSFill_column_constant () fills a partially filled column of data * * by projecting the known values * * IDFSFill_column_linear () fills a partially filled column of data * * by linear interpolation between known * * values * * * * EXTERNAL VARIABLES * * struct general_info structure that holds information concern- * * ginfo ing the experiment that is being processed* * * * INTERNAL VARIABLES * * struct experiment_info a pointer to the structure that holds * * *ex specific experiment information * * struct collapse_data pointer to the collapse_data structure * * *cptr being processed * * struct bin_info *bptr a pointer to the structure holding sweep * * binning information * * register SDDAS_FLOAT *dptr pointer to the data array * * register SDDAS_FLOAT *f1 pointer to the data being filled * * register SDDAS_SHORT unit looping variable for data levels (units) * * register SDDAS_SHORT theta looping variable for theta bins * * reg SDDAS_CHAR *bin_stat pointer to the bin status array * * register SDDAS_CHAR *c1 pointer to the bin status values for the * * data being filled * * SDDAS_FLOAT *stop_loop loop termination variable * * SDDAS_FLOAT *base_4d base pointer to phi matrix being processed* * SDDAS_LONG offset_theta offset to get to the theta column being * * processed in the input data matrix * * SDDAS_LONG offset_unit offset to get to the beginning of the data* * matrix for the data level being processed * * SDDAS_LONG phi_bins the number of phi bins * * SDDAS_LONG num_steps the number of sweep bins * * SDDAS_LONG all_elements the number of elements in the data block * * SDDAS_LONG next_theta_block no. of elements to get to next theta group* * SDDAS_SHORT num_theta the number of theta bins * * SDDAS_CHAR *base_bin_stat ptr to bin stat for phi being processed * * * * SUBSYSTEM * * Display Level * * * ****************************************************************************/ void ir_constant_linear_phi (SDDAS_CHAR cyclic, SDDAS_LONG need_filled, SDDAS_CHAR fill_method, SDDAS_CHAR project, SDDAS_CHAR cur_buf) { extern struct general_info ginfo; struct experiment_info *ex; struct collapse_data *cptr; struct bin_info *bptr; register SDDAS_FLOAT *dptr, *f1; register SDDAS_SHORT unit, theta; register SDDAS_CHAR *bin_stat, *c1; SDDAS_FLOAT *stop_loop, *base_4d; SDDAS_LONG offset_theta, offset_unit, phi_bins, num_steps, all_elements; SDDAS_LONG next_theta_block; SDDAS_SHORT num_theta; SDDAS_CHAR *base_bin_stat; /************************************************************************/ /* Initialize pointers to the beginning of the phi matrix. */ /************************************************************************/ ex = ginfo.expt; bptr = ex->bin_ptr; cptr = ex->collapse_ptr; num_theta = (cptr->theta_bins <= 0) ? ex->num_sensor : cptr->theta_bins; phi_bins = (SDDAS_LONG) cptr->phi_bins; num_steps = (SDDAS_LONG) bptr->num_bins; next_theta_block = num_steps * phi_bins; all_elements = num_steps * num_theta * phi_bins; base_4d = *(cptr->data_4d_ptr + cur_buf); base_bin_stat = *(cptr->bin_stat_ptr + cur_buf); /**********************************************************************/ /* Process one unit at a time. */ /**********************************************************************/ offset_unit = 0; for (unit = 0; unit < cptr->num_units; ++unit, offset_unit += all_elements) { /********************************************************************/ /* Process one theta group at a time. */ /********************************************************************/ offset_theta = 0; for (theta = 0; theta < num_theta; ++theta, offset_theta += next_theta_block) { dptr = base_4d + offset_unit + offset_theta; bin_stat = base_bin_stat + offset_unit + offset_theta; /*******************************************************************/ /* Process all rows of this theta grouping, then all columns. */ /*******************************************************************/ if (fill_method == CON_ROW_COL) { stop_loop = dptr + num_steps; if (cyclic) for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_constant_cyc (f1, c1, phi_bins, num_steps, need_filled); else for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_constant_ncyc (f1, c1, phi_bins, num_steps, need_filled, project); stop_loop = dptr + next_theta_block; for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; f1 += num_steps, c1 += num_steps) IDFSFill_column_constant (f1, c1, num_steps, need_filled, project); } /*******************************************************************/ /* Process all rows of this theta grouping, then all columns. */ /*******************************************************************/ else if (fill_method == LIN_ROW_COL) { stop_loop = dptr + num_steps; if (cyclic) for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_linear_cyc (f1, c1, phi_bins, num_steps, need_filled); else for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_linear_ncyc (f1, c1, phi_bins, num_steps, need_filled, project); stop_loop = dptr + next_theta_block; for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; f1 += num_steps, c1 += num_steps) IDFSFill_column_linear (f1, c1, num_steps, need_filled, project); } /*******************************************************************/ /* Process all columns of this theta grouping, then all rows. */ /*******************************************************************/ else if (fill_method == CON_COL_ROW) { stop_loop = dptr + next_theta_block; for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; f1 += num_steps, c1 += num_steps) IDFSFill_column_constant (f1, c1, num_steps, need_filled, project); stop_loop = dptr + num_steps; if (cyclic) for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_constant_cyc (f1, c1, phi_bins, num_steps, need_filled); else for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_constant_ncyc (f1, c1, phi_bins, num_steps, need_filled, project); } /*******************************************************************/ /* Process all columns of this theta grouping, then all rows. */ /*******************************************************************/ else if (fill_method == LIN_COL_ROW) { stop_loop = dptr + next_theta_block; for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; f1 += num_steps, c1 += num_steps) IDFSFill_column_linear (f1, c1, num_steps, need_filled, project); stop_loop = dptr + num_steps; if (cyclic) for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_linear_cyc (f1, c1, phi_bins, num_steps, need_filled); else for (f1 = dptr, c1 = bin_stat; f1 < stop_loop; ++f1, ++c1) IDFSFill_row_linear_ncyc (f1, c1, phi_bins, num_steps, need_filled, project); } } } }