/* * 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 "@(#) order_theta.c 1.18 05/08/19 SwRI" #include #include "ret_codes.h" #include "gen_defs.h" #include "libtrec_idfs.h" /******************************************************************************* * * * IR_ORDER_THETA_BINS SUBROUTINE * * * * DESCRIPTION * * This routine is called to order the theta bins in increasing angle order.* * The theta angle bins need to be in increasing angle order for the * * integration of the data over a specified theta angle range to work * * properly. The start and stop theta angles for each theta bin are * * retrieved. If there is only one theta bin (all angles sample at the same * * theta range), then by definition, the bin is ordered. If more bins exist, * * the starting theta angles are ordered first. A second pass is made to * * order the ending theta angles for those bins that have the same starting * * angle but different ending angles. Once the bins are ordered, an array of * * indexes are set to associate each sensor with the appropriate ordered bin. * * * * INPUT VARIABLES * * SDDAS_SHORT *chk_sen array indicating which unique theta bin * * each sensor is associated with * * SDDAS_CHAR start_ind index to get to the starting theta constants* * SDDAS_CHAR stop_ind index to get to the ending theta constants * * * * USAGE * * x = ir_order_theta_bins (chk_sen, start_ind, stop_ind) * * * * NECESSARY SUBPROGRAMS * * sizeof () the size of the specified object in bytes * * malloc() allocates memory * * free () frees previously allocated memory * * abs() returns the absolute value of a number * * * * EXTERNAL VARIABLES * * struct general_info ginfo structure that holds information concerning * * the experiment that is being processed * * * * INTERNAL VARIABLES * * struct experiment_info *ex a pointer to the structure that holds * * specific experiment information * * struct collapse_data *cptr pointer to the collapse_data structure * * being processed * * reg SDDAS_SHORT sen, bin looping variables * * size_t bytes the number of bytes to allocate * * SDDAS_FLOAT start_theta starting theta value for the bin in question* * SDDAS_FLOAT stop_theta ending theta value for the bin in question * * SDDAS_SHORT which_bin the theta bin number being swapped * * SDDAS_SHORT comp_bin looping variable for bubble sort * * SDDAS_SHORT *tmp_bin array of bin numbers * * SDDAS_SHORT num_theta_bins number of theta bins defined * * char switch_theta flag indicating that two bins were swapped * * void *tmp_ptr pointer which holds address passed back by * * the call to the MALLOC routine * * * * SUBSYSTEM * * Display Level * * * ******************************************************************************/ SDDAS_SHORT ir_order_theta_bins (SDDAS_SHORT *chk_sen, SDDAS_CHAR start_ind, SDDAS_CHAR stop_ind) { extern struct general_info ginfo; struct experiment_info *ex; struct collapse_data *cptr; register SDDAS_SHORT sen, bin; size_t bytes; SDDAS_FLOAT start_theta, stop_theta; SDDAS_SHORT which_bin, comp_bin, *tmp_bin, num_theta_bins; char switch_theta; void *tmp_ptr; /**********************************************************************/ /* Retrieve the start and stop theta angles for each bin. Find the */ /* first sensor that uses this bin. */ /**********************************************************************/ ex = ginfo.expt; cptr = ex->collapse_ptr; num_theta_bins = (SDDAS_SHORT) (abs (cptr->theta_bins)); for (bin = 0; bin < num_theta_bins; ++bin) { for (sen = 0; sen < ex->num_sensor; ++sen) { if (*(chk_sen + sen) == bin) { start_theta = *(ex->constants + (start_ind * ex->num_sensor) + sen); stop_theta = *(ex->constants + (stop_ind * ex->num_sensor) + sen); break; } } *(cptr->start_theta + bin) = start_theta; *(cptr->stop_theta + bin) = stop_theta; } /**********************************************************************/ /* The sensors utilize more than one theta bin. The theta bins */ /* need to be order with respect to increasing angle. */ /**********************************************************************/ if (num_theta_bins > 1) { /*********************************************************************/ /* Determine the order of the theta bins. Initialize the array to */ /* reflect perfect ordering as the bins currently exist. */ /*********************************************************************/ bytes = num_theta_bins * sizeof (SDDAS_SHORT); if ((tmp_ptr = malloc (bytes)) == NO_MEMORY) return (ORDER_THETA_MALLOC); tmp_bin = (SDDAS_SHORT *) tmp_ptr; for (bin = 0; bin < num_theta_bins; ++bin) *(tmp_bin + bin) = bin; /**********************************************************************/ /* Order with respect to the starting theta angles. The algorithm */ /* used is a bubble sort. */ /**********************************************************************/ switch_theta = 1; comp_bin = num_theta_bins; while (comp_bin >= 2 && switch_theta) { switch_theta = 0; for (bin = 0; bin < comp_bin - 1; ++bin) { /**************************************************************/ /* Swap the two elements since the order is not correct. */ /**************************************************************/ if (*(cptr->start_theta + bin) > *(cptr->start_theta + bin + 1)) { switch_theta = 1; start_theta = *(cptr->start_theta + bin); stop_theta = *(cptr->stop_theta + bin); which_bin = *(tmp_bin + bin); *(cptr->start_theta + bin) = *(cptr->start_theta + bin + 1); *(cptr->stop_theta + bin) = *(cptr->stop_theta + bin + 1); *(tmp_bin + bin) = *(tmp_bin + bin + 1); *(cptr->start_theta + bin + 1) = start_theta; *(cptr->stop_theta + bin + 1) = stop_theta; *(tmp_bin + bin + 1) = which_bin; } } --comp_bin; } /***********************************************************************/ /* If any of the theta bins have the same starting but different */ /* ending theta angles, order with respect to increasing ending angle.*/ /***********************************************************************/ switch_theta = 1; comp_bin = num_theta_bins; while (comp_bin >= 2 && switch_theta) { switch_theta = 0; for (bin = 0; bin < comp_bin - 1; ++bin) { /**************************************************************/ /* Swap the two elements since the order is not correct. */ /**************************************************************/ if (*(cptr->start_theta + bin) == *(cptr->start_theta + bin + 1) && *(cptr->stop_theta + bin) > *(cptr->stop_theta + bin + 1)) { switch_theta = 1; stop_theta = *(cptr->stop_theta + bin); which_bin = *(tmp_bin + bin); *(cptr->stop_theta + bin) = *(cptr->stop_theta + bin + 1); *(tmp_bin + bin) = *(tmp_bin + bin + 1); *(cptr->stop_theta + bin + 1) = stop_theta; *(tmp_bin + bin + 1) = which_bin; } } --comp_bin; } /*********************************************************************/ /* Determine which ordered bin the sensor is associated with and */ /* save the index so that the collapsing routine can put the sensor */ /* data into the correct bin. */ /*********************************************************************/ for (bin = 0; bin < num_theta_bins; ++bin) { for (sen = 0; sen < ex->num_sensor; ++sen) { if (*(chk_sen + sen) == *(tmp_bin + bin)) *(cptr->sensor_bin + sen) = bin; } } free (tmp_ptr); } /********************************************************************/ /* All sensors map to the same theta range so only one theta bin. */ /********************************************************************/ else for (sen = 0; sen < ex->num_sensor; ++sen) *(cptr->sensor_bin + sen) = 0; return (ALL_OKAY); }