1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6da2e3ebdSchin * Common Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt * 11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #include "sfhdr.h" 23da2e3ebdSchin 24da2e3ebdSchin /* Return the length of a double value if coded in a portable format 25da2e3ebdSchin ** 26da2e3ebdSchin ** Written by Kiem-Phong Vo 27da2e3ebdSchin */ 28da2e3ebdSchin 29da2e3ebdSchin #if __STD_C _sfdlen(Sfdouble_t v)30da2e3ebdSchinint _sfdlen(Sfdouble_t v) 31da2e3ebdSchin #else 32da2e3ebdSchin int _sfdlen(v) 33da2e3ebdSchin Sfdouble_t v; 34da2e3ebdSchin #endif 35da2e3ebdSchin { 36da2e3ebdSchin #define N_ARRAY (16*sizeof(Sfdouble_t)) 37da2e3ebdSchin reg int n, w; 38da2e3ebdSchin Sfdouble_t x; 39da2e3ebdSchin int exp; 40da2e3ebdSchin 41da2e3ebdSchin if(v < 0) 42da2e3ebdSchin v = -v; 43da2e3ebdSchin 44da2e3ebdSchin /* make the magnitude of v < 1 */ 45da2e3ebdSchin if(v != 0.) 46da2e3ebdSchin v = frexpl(v,&exp); 47da2e3ebdSchin else exp = 0; 48da2e3ebdSchin 49da2e3ebdSchin for(w = 1; w <= N_ARRAY; ++w) 50da2e3ebdSchin { /* get 2^SF_PRECIS precision at a time */ 51da2e3ebdSchin n = (int)(x = ldexpl(v,SF_PRECIS)); 52da2e3ebdSchin v = x-n; 53da2e3ebdSchin if(v <= 0.) 54da2e3ebdSchin break; 55da2e3ebdSchin } 56da2e3ebdSchin 57da2e3ebdSchin return 1 + sfulen(exp) + w; 58da2e3ebdSchin } 59