/* * 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 "@(#) idf_look.c 1.19 05/08/19 SwRI" #include "gen_defs.h" #include "user_defs.h" #include "libbase_idfs.h" /******************************************************************************* * * * IR_IDF_LOOK_UP SUBROUTINE * * * * DESCRIPTION * * This routine is used in conjunction with the definition of the tables * * in the VIDF file. This module will be used when the TBL_OPER value * * specifies the look up operation. * * * * INPUT VARIABLES * * SDDAS_FLOAT *ret_data pointer to the array that holds the values * * returned by the module * * SDDAS_FLOAT *tbl pointer to the table values being utilized * * SDDAS_LONG inp_start index value indicating where to start in the * * input data array * * SDDAS_LONG tbl_sz the number of elements in the table * * SDDAS_LONG num_data the number of elements being returned * * SDDAS_LONG hold_val the number of successive data values to be * * modified by a single input data value (used * * for calibration data; otherwise, set to 1) * * SDDAS_CHAR look_up flag that indicates if the table has been * * expanded and serves as a lookup table or if * * the value or if the values need to be * * calculated using the poly. coefficients * * SDDAS_CHAR *inp_data pointer to the array that holds the input * * data values * * SDDAS_CHAR dtype the format of the data - uns int, int, float * * SDDAS_CHAR fn_of_raw flag indicating if the table is a function of * * raw or processed data * * SDDAS_CHAR tdw_len the data word length for the sensor (in bits) * * SDDAS_CHAR tbl_type the TBL_TYPE value for the table of interest * * SDDAS_LONG *swp_data pointer to the raw sample sequence values * * SDDAS_SHORT swp_len the maximum number of sample sequence values * * * * USAGE * * ir_idf_look_up (&ret_data, &inp_data, inp_start, &tbl, tbl_sz, num_data, * * look_up, dtype, hold_val, fn_of_raw, tdw_len, tbl_type, * * swp_data, swp_len) * * * * NECESSARY SUBPROGRAMS * * ir_poly_expand() calculates values using a set of polynomial * * coefficients * * ir_intfp2fp () reconstructs raw floating point data * * ir_to_sign() converts raw data into signed integer data * * * * EXTERNAL VARIABLES * * None * * * * INTERNAL VARIABLES * * reg SDDAS_FLOAT *f1,*f2,*f3 pointers to SDDAS_FLOAT values * * register SDDAS_LONG *l1 pointer to a signed long data value * * register SDDAS_LONG j, k looping variables * * reg SDDAS_LONG stop_loop the stopping value for the loop * * register SDDAS_ULONG *ul pointer to an uns. long data value * * SDDAS_LONG index index value into the data array * * SDDAS_LONG *swp_ptr pointer to the sample sequence values * * SDDAS_LONG num_left_to_do no. of values that still need to be processed * * SDDAS_FLOAT fval floating point variable used to hold value * * * * SUBSYSTEM * * Display Level * * * ******************************************************************************/ void ir_idf_look_up (SDDAS_FLOAT *ret_data, SDDAS_CHAR *inp_data, SDDAS_LONG inp_start, SDDAS_FLOAT *tbl, SDDAS_LONG tbl_sz, SDDAS_LONG num_data, SDDAS_CHAR look_up, SDDAS_CHAR dtype, SDDAS_LONG hold_val, SDDAS_CHAR fn_of_raw, SDDAS_CHAR tdw_len, SDDAS_CHAR tbl_type, SDDAS_LONG *swp_data, SDDAS_SHORT swp_len) { register SDDAS_FLOAT *f1, *f2, *f3; register SDDAS_LONG *l1, j, k, stop_loop; register SDDAS_ULONG *ul; SDDAS_LONG index, *swp_ptr, num_left_to_do; SDDAS_FLOAT fval; /***********************************************************************/ /* The table has been expanded to lookup table format. There should */ /* be no OUTSIDE_MIN values contained in the table itself. */ /***********************************************************************/ swp_ptr = swp_data; if (look_up) { f1 = tbl; f2 = ret_data; /***********************************************************************/ /* The format of the injested data is unsigned binary data. */ /***********************************************************************/ if (dtype == 0) { /***********************************************************************/ /* Entries are 4-byte integers and all scan steps use the same table. */ /***********************************************************************/ if (tbl_type == INTEGER_TBL) { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = *(f1 + *ul); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++ul; } } /***********************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type. */ /***********************************************************************/ else { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * swp_len); *f2 = *(f1 + *ul); } j += stop_loop; ++ul; } } } /***********************************************************************/ /* The format of the injested data is signed binary data. */ /***********************************************************************/ else if (dtype == 1) { /***********************************************************************/ /* Entries are 4-byte integers and all scan steps use the same table. */ /***********************************************************************/ if (tbl_type == INTEGER_TBL) { l1 = (SDDAS_LONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; index = (SDDAS_LONG) (ir_to_sign (*l1, tdw_len)); fval = *(f1 + index); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++l1; } } /***********************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type. */ /***********************************************************************/ else { l1 = (SDDAS_LONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; index = (SDDAS_LONG) (ir_to_sign (*l1, tdw_len)); for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * swp_len); *f2 = *(f1 + index); } j += stop_loop; ++l1; } } } } /**********************************************************************/ /* The table holds polynomial coefficients, it has not been expanded */ /* to a lookup table. */ /**********************************************************************/ else { f2 = ret_data; /*********************************************************************/ /* The table is a function of raw data. */ /*********************************************************************/ if (fn_of_raw) { /******************************************************************/ /* The format of the injested data is unsigned binary data. */ /******************************************************************/ if (dtype == 0) { /*******************************************************************/ /* Entries are 4-byte integers; all scan steps use the same table.*/ /*******************************************************************/ if (tbl_type == INTEGER_TBL) { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = (SDDAS_FLOAT) *ul; /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval >= VALID_MIN) fval = ir_poly_expand (fval, tbl, tbl_sz); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++ul; } } /*******************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type.*/ /*******************************************************************/ else { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = (SDDAS_FLOAT) *ul; /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval < VALID_MIN) { for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; } else { for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * tbl_sz); *f2 = ir_poly_expand (fval, f1, tbl_sz); } } j += stop_loop; ++ul; } } } /*********************************************************************/ /* The table is a function of raw signed binary data. */ /*********************************************************************/ else if (dtype == 1) { /*******************************************************************/ /* Entries are 4-byte integers; all scan steps use the same table.*/ /*******************************************************************/ if (tbl_type == INTEGER_TBL) { l1 = (SDDAS_LONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = ir_to_sign (*l1, tdw_len); /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval >= VALID_MIN) fval = ir_poly_expand (fval, tbl, tbl_sz); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++l1; } } /*******************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type.*/ /*******************************************************************/ else { l1 = (SDDAS_LONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = ir_to_sign (*l1, tdw_len); /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval < VALID_MIN) { for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; } else { for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * tbl_sz); *f2 = ir_poly_expand (fval, f1, tbl_sz); } } j += stop_loop; ++l1; } } } /*********************************************************************/ /* The table is a function of raw floating point data. */ /*********************************************************************/ else { /*******************************************************************/ /* Entries are 4-byte integers; all scan steps use the same table.*/ /*******************************************************************/ if (tbl_type == INTEGER_TBL) { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = ir_intfp2fp (*ul, dtype); /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval >= VALID_MIN) fval = ir_poly_expand (fval, tbl, tbl_sz); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++ul; } } /*******************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type.*/ /*******************************************************************/ else { ul = (SDDAS_ULONG *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = ir_intfp2fp (*ul, dtype); /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval < VALID_MIN) { for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; } else { for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * tbl_sz); *f2 = ir_poly_expand (fval, f1, tbl_sz); } } j += stop_loop; ++ul; } } } } /*********************************************************************/ /* The table is a function of processed data so the data are */ /* floating point values. */ /*********************************************************************/ else { /*******************************************************************/ /* Entries are 4-byte integers; all scan steps use the same table.*/ /*******************************************************************/ if (tbl_type == INTEGER_TBL) { f3 = (SDDAS_FLOAT *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = *f3; /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval >= VALID_MIN) fval = ir_poly_expand (fval, tbl, tbl_sz); for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; j += stop_loop; ++f3; } } /*******************************************************************/ /* Entries are 4-byte integers and each scan step uses a different */ /* table. No need for a conditional check since ASCII tables have */ /* been excluded and there are only 3 possible values for tbl_type.*/ /*******************************************************************/ else { f3 = (SDDAS_FLOAT *) inp_data + inp_start; for (j = 0; j < num_data;) { num_left_to_do = num_data - j; stop_loop = (num_left_to_do < hold_val) ? num_left_to_do : hold_val; fval = *f3; /* No need to do a polynomial expansion on OUTSIDE_MIN. */ if (fval < VALID_MIN) { for (k = 0; k < stop_loop; ++k, ++f2) *f2 = fval; } else { for (k = 0; k < stop_loop; ++k, ++f2, ++swp_ptr) { f1 = tbl + (*swp_ptr * tbl_sz); *f2 = ir_poly_expand (fval, f1, tbl_sz); } } j += stop_loop; ++f3; } } } } }