/* * 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_ex_func.c 1.27 05/08/19 SwRI" #include #include "user_defs.h" #include "libbase_idfs.h" /**************************************************************************** * * * IR_IDF_EX_FUNC SUBROUTINE * * * * DESCRIPTION * * This routine applies any higher order mathematical operations defined * * for the tables contained in the VIDF file. These operations are always * * applied after the base operation has been made and always replace the * * target data. * * * * INPUT VARIABLES * * SDDAS_LONG oper_type the higher order operation to be performed * * SDDAS_FLOAT *ret_data pointer to the array that holds the values * * returned by the module * * SDDAS_LONG num_data the number of elements being returned * * void *idf_data_ptr ptr to memory location for the structure * * that holds returned data values (read_drec)* * * * USAGE * * ir_idf_ex_func (oper_type, &ret_data, num_data, idf_data_ptr) * * * * NECESSARY SUBPROGRAMS * * exp() returns double-precision exponential * * function of the argument * * log() returns double-precision logarithm base e * * of the argument * * pow() returns double-precision power function of * * the arguments * * log10() returns double-precision base 10 logarithm * * of the argument * * sqrt() returns double-precision square root of * * the argument * * cos() returns double-precision cosine function * * of the argument * * sin() returns double-precision sine function of * * the argument * * tan() returns double-precision tangent function * * of the argument * * acos() returns double-precision arccos function * * of the argument * * asin() returns double-precision arcsin function * * of the argument * * atan() returns double-precision arctan function * * of the argument * * ceil () returns the least integral value >= x * * floor () returns the greatest integral value <= x * * modf () return the fractional and integral parts * * of the input value * * erf() returns the error function of x; defined * * as erf(x) = 2/sqrt(pi) * integral from * * 0 to x of exp(-t*t) dt * * * * EXTERNAL VARIABLES * * struct general_info structure that holds information concerning* * ginfo the experiment that is being processed * * * * INTERNAL VARIABLES * * struct idf_data *EXP_DATA structure that holds all of the currently * * returned data values to be processed * * register SDDAS_FLOAT *f1 pointer to the data being modified * * reg SDDAS_FLOAT *f2, *f3 pointer to the azimuthal angles * * reg SDDAS_FLOAT *f_end loop termination variable * * reg SDDAS_FLOAT dT accumulation time * * SDDAS_FLOAT Tmp temporary variable * * SDDAS_LONG Value the data value in integer form * * SDDAS_LONG Sign the value of the sign bit * * double int_part the integer part of the data value * * double frac_part the decimal part of the data value * * * * SUBSYSTEM * * Display Level * * * ***************************************************************************/ void ir_idf_ex_func (SDDAS_LONG oper_type, SDDAS_FLOAT *ret_data, SDDAS_LONG num_data, void *idf_data_ptr) { extern struct general_info ginfo; struct idf_data *EXP_DATA; register SDDAS_FLOAT *f1, *f2, *f3, *f_end, dT; SDDAS_FLOAT Tmp; SDDAS_LONG Value, Sign; double int_part, frac_part; /***********************************************************************/ /* Initialize variables. Although conditionals slow down FOR loops, */ /* checks must be made to ensure OUTSIDE_MIN values remain unchanged. */ /***********************************************************************/ EXP_DATA = (struct idf_data *) idf_data_ptr; f1 = ret_data; f_end = f1 + num_data; switch (oper_type) { case 0: break; case 1: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = exp (*f1); } break; case 2: for ( ; f1 < f_end; ++f1) *f1 = (*f1 > 0.0) ? log (*f1) : OUTSIDE_MIN; break; case 3: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = pow (10.0,(double)*f1); } break; case 4: for ( ; f1 < f_end; ++f1) *f1 = (*f1 > 0.0) ? log10 (*f1) : OUTSIDE_MIN; break; case 5: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = pow (2.0,(double)*f1); } break; case 6: for ( ; f1 < f_end; ++f1) *f1 = (*f1 < 0.0) ? OUTSIDE_MIN : sqrt (*f1); break; case 7: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = cos (TORAD * *f1); } break; case 8: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = sin (TORAD * *f1); } break; case 9: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = tan (TORAD * *f1); } break; case 10: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = acos (*f1); } break; case 11: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = asin (*f1); } break; case 12: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = atan (*f1); } break; case 13: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = (*f1 != 0.0) ? 1.0 / *f1 : OUTSIDE_MIN; } break; case 14: dT = ginfo.expt->accum_ms * 1.0e-3 + ginfo.expt->accum_ns * 1.0e-9; for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 *= dT; } break; case 15: dT = ginfo.expt->accum_ms * 1.0e-3 + ginfo.expt->accum_ns * 1.0e-9; for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 /= dT; } break; case 16: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = -(*f1); } break; case 17: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = *f1 * *f1; } break; case 18: f2 = EXP_DATA->start_az; f3 = EXP_DATA->stop_az; for ( ; f1 < f_end; ++f1, ++f2, ++f3) { if (*f1 < VALID_MIN) continue; dT = (*f3 + *f2) * 0.5; Tmp = dT - *f2; if (Tmp > 60.0 || Tmp < -60.0) dT += 180.0; *f1 = *f1 - dT; if (*f1 < 0.0) *f1 += 360.0; } break; case 19: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = (*f1 >= 0.0) ? *f1 : -*f1; } break; case 20: f2 = EXP_DATA->start_az; for ( ; f1 < f_end; ++f1, ++f2) { if (*f1 < VALID_MIN) continue; *f1 += *f2; if (*f1 < 0.0) *f1 += 360.0; else { if (*f1 >= 360.0) *f1 -= 360.0; } } break; case 21: for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = (SDDAS_LONG) *f1; } break; case 22: /* 8 bit signed */ for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; Value = (SDDAS_LONG) *f1; Sign = (Value >> 7) & 1; *f1 = (Sign == 0) ? Value : -256 + Value; } break; case 23: /* 16 bit signed */ for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; Value = (SDDAS_LONG) *f1; Sign = (Value >> 15) & 1; *f1 = (Sign == 0) ? Value : -65536 + Value; } break; case 24: /* 12 bit signed */ for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; Value = (SDDAS_LONG) *f1; Sign = (Value >> 11) & 1; *f1 = (Sign == 0) ? Value : -4096 + Value; } break; case 25: /* 24 bit signed */ for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; Value = (SDDAS_LONG) *f1; Sign = (Value >> 23) & 1; *f1 = (Sign == 0) ? Value : -16777216 + Value; } break; case 26: for (; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; frac_part = modf ((double) *f1, &int_part); *f1 = int_part; } break; case 27: for (; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; frac_part = modf ((double) *f1, &int_part); *f1 = frac_part; } break; case 28: for (; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = ceil (*f1); } break; case 29: for (; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = floor (*f1); } break; case 30: /* error function */ for ( ; f1 < f_end; ++f1) { if (*f1 < VALID_MIN) continue; *f1 = erf (*f1); } break; } }