/*---------------------------------------------------------------
 * Copyright (c) 1999,2000,2001,2002,2003
 * The Board of Trustees of the University of Illinois
 * All Rights Reserved.
 *---------------------------------------------------------------
 * Permission is hereby granted, free of charge, to any person
 * obtaining a copy of this software (Iperf) and associated
 * documentation files (the "Software"), to deal in the Software
 * without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute,
 * sublicense, and/or sell copies of the Software, and to permit
 * persons to whom the Software is furnished to do
 * so, subject to the following conditions:
 *
 *
 * Redistributions of source code must retain the above
 * copyright notice, this list of conditions and
 * the following disclaimers.
 *
 *
 * Redistributions in binary form must reproduce the above
 * copyright notice, this list of conditions and the following
 * disclaimers in the documentation and/or other materials
 * provided with the distribution.
 *
 *
 * Neither the names of the University of Illinois, NCSA,
 * nor the names of its contributors may be used to endorse
 * or promote products derived from this Software without
 * specific prior written permission.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE CONTIBUTORS OR COPYRIGHT
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 * ________________________________________________________________
 * National Laboratory for Applied Network Research
 * National Center for Supercomputing Applications
 * University of Illinois at Urbana-Champaign
 * http://www.ncsa.uiuc.edu
 * ________________________________________________________________
 *
 * stdio.c
 * by Mark Gates <mgates@nlanr.net>
 * and Ajay Tirumalla <tirumala@ncsa.uiuc.edu>
 * -------------------------------------------------------------------
 * input and output numbers, converting with kilo, mega, giga
 * ------------------------------------------------------------------- */

#include "headers.h"
#include "util.h"

#ifdef __cplusplus
extern "C" {
#endif

const long kKilo_to_Unit = 1024;
const long kMega_to_Unit = 1024 * 1024;
const long kGiga_to_Unit = 1024 * 1024 * 1024;

const long kkilo_to_Unit = 1000;
const long kmega_to_Unit = 1000 * 1000;
const long kgiga_to_Unit = 1000 * 1000 * 1000;

/* -------------------------------------------------------------------
 * byte_atof
 *
 * Given a string of form #x where # is a number and x is a format
 * character listed below, this returns the interpreted integer.
 * Gg, Mm, Kk are giga, mega, kilo respectively
 * ------------------------------------------------------------------- */

double byte_atof(const char *inString) {
    double theNum;
    char suffix = '\0';

    assert(inString != NULL);

    /* scan the number and any suffices */
    sscanf(inString, "%lf%c", &theNum, &suffix);

    /* convert according to [Gg Mm Kk] */
    switch (suffix) {
        case 'G':  theNum *= kGiga_to_Unit;  break;
        case 'M':  theNum *= kMega_to_Unit;  break;
        case 'K':  theNum *= kKilo_to_Unit;  break;
        case 'g':  theNum *= kgiga_to_Unit;  break;
        case 'm':  theNum *= kmega_to_Unit;  break;
        case 'k':  theNum *= kkilo_to_Unit;  break;
        default: break;
    }
    return theNum;
} /* end byte_atof */

/* -------------------------------------------------------------------
 * byte_atoi
 *
 * Given a string of form #x where # is a number and x is a format
 * character listed below, this returns the interpreted integer.
 * Gg, Mm, Kk are giga, mega, kilo respectively
 * ------------------------------------------------------------------- */

intmax_t byte_atoi(const char *inString) {
    double theNum;
    char suffix = '\0';

    assert(inString != NULL);

    /* scan the number and any suffices */
    sscanf(inString, "%lf%c", &theNum, &suffix);

    /* convert according to [Gg Mm Kk] */
    switch (suffix) {
        case 'G':  theNum *= kGiga_to_Unit;  break;
        case 'M':  theNum *= kMega_to_Unit;  break;
        case 'K':  theNum *= kKilo_to_Unit;  break;
        case 'g':  theNum *= kgiga_to_Unit;  break;
        case 'm':  theNum *= kmega_to_Unit;  break;
        case 'k':  theNum *= kkilo_to_Unit;  break;
        default: break;
    }
    return (intmax_t) theNum;
} /* end byte_atof */

/* -------------------------------------------------------------------
 * bitorbyte_atoi
 *
 * Given a string of form #x where # is a number and x is a format
 * character listed below, this returns the interpreted integer.
 * Gg, Mm, Kk are giga, mega, kilo respectively
 * ------------------------------------------------------------------- */
uintmax_t bitorbyte_atoi(const char *inString) {
    double theNum;
    char suffix = '\0';

    assert(inString != NULL);

    /* scan the number and any suffices */
    sscanf(inString, "%lf%c", &theNum, &suffix);

    /* convert according to [Gg Mm Kk] */
    switch (suffix) {
    case 'G':  theNum *= (kgiga_to_Unit * 8.0);  break;
    case 'M':  theNum *= (kmega_to_Unit * 8.0);  break;
    case 'K':  theNum *= (kkilo_to_Unit * 8.0);  break;
    case 'g':  theNum *= kgiga_to_Unit;  break;
    case 'm':  theNum *= kmega_to_Unit;  break;
    case 'k':  theNum *= kkilo_to_Unit;  break;
    default: break;
    }
    return (uintmax_t) theNum;
} /* end byte_atof */

/* -------------------------------------------------------------------
 * bitorbyte_atof
 *
 * Given a string of form #x where # is a number and x is a format
 * character listed below, this returns the interpreted integer.
 * Gg, Mm, Kk are giga, mega, kilo respectively
 * ------------------------------------------------------------------- */
double bitorbyte_atof(const char *inString) {
    double theNum;
    char suffix = '\0';

    assert(inString != NULL);

    /* scan the number and any suffices */
    sscanf(inString, "%lf%c", &theNum, &suffix);

    /* convert according to [Gg Mm Kk] */
    switch (suffix) {
    case 'G':  theNum *= (kgiga_to_Unit * 8.0);  break;
    case 'M':  theNum *= (kmega_to_Unit * 8.0);  break;
    case 'K':  theNum *= (kkilo_to_Unit * 8.0);  break;
    case 'g':  theNum *= kgiga_to_Unit;  break;
    case 'm':  theNum *= kmega_to_Unit;  break;
    case 'k':  theNum *= kkilo_to_Unit;  break;
    case 'p':
    case 'P':  theNum *= -1; break;
    default: break;
    }
    return theNum;
} /* end byte_atof */

/* -------------------------------------------------------------------
 * constants for byte_printf
 * ------------------------------------------------------------------- */

/* used as indices into kConversion[], kLabel_Byte[], and kLabel_bit[] */
enum {
    kConv_Unit,
    kConv_Kilo,
    kConv_Mega,
    kConv_Giga,
    kConv_Tera,
    kConv_Peta
};

/* factor to multiply the number by */
const double kConversion[] =
{
    1.0,                                    /* unit */
    1.0 / 1024,                             /* kilo */
    1.0 / 1024 / 1024,                      /* mega */
    1.0 / 1024 / 1024 / 1024,               /* giga */
    1.0 / 1024 / 1024 / 1024 / 1024,        /* tera */
    1.0 / 1024 / 1024 / 1024 / 1024 / 1024  /* peta */
};

/* factor to multiply the number by for bits*/
const double kConversionForBits[] =
{
    1.0,                                    /* unit */
    1.0 / 1000,                             /* kilo */
    1.0 / 1000 / 1000,                      /* mega */
    1.0 / 1000 / 1000 / 1000,               /* giga */
    1.0 / 1000 / 1000 / 1000 / 1000,        /* tera */
    1.0 / 1000 / 1000 / 1000 / 1000/ 1000   /* peta */
};


/* labels for Byte formats [KMG] */
const char* kLabel_Byte[] =
{
    "Byte",
    "KByte",
    "MByte",
    "GByte",
    "TByte",
    "PByte"
};

/* labels for bit formats [kmg] */
const char* kLabel_bit[]  =
{
    "bit",
    "Kbit",
    "Mbit",
    "Gbit",
    "Tbit",
    "Pbit"
};

/* -------------------------------------------------------------------
 * byte_snprintf
 *
 * Given a number in bytes and a format, converts the number and
 * prints it out with a bits or bytes label.
 *   B, K, M, G, A, P, T for Byte, Kbyte, Mbyte, Gbyte, Tbyte, Pbyte adaptive byte
 *   b, k, m, g, a, p, t for bit,  Kbit,  Mbit,  Gbit, Tbit, Pbit, adaptive bit
 * adaptive picks the "best" one based on the number.
 * outString should be at least 11 chars long
 * (4 digits + space + 5 chars max + null)
 * ------------------------------------------------------------------- */

void byte_snprintf(char* outString, int inLen, double inNum, char inFormat) {
    int conv = 0;
    const char* suffix;
    const char* format;
    double tmpNum;

    /* convert to bits for [bkmga] */
    if (!isupper((int)inFormat)) {
        inNum *= 8;
    }

    switch (toupper((int)inFormat)) {
        case 'B': conv = kConv_Unit; break;
        case 'K': conv = kConv_Kilo; break;
        case 'M': conv = kConv_Mega; break;
        case 'G': conv = kConv_Giga; break;
        case 'T': conv = kConv_Tera; break;
        case 'P': conv = kConv_Peta; break;

        default:
        case 'A': {
	    tmpNum = (inNum < 0.0 ? (-1 * inNum) : inNum);
	    conv = kConv_Unit;

	    if (isupper((int)inFormat)) {
		while (tmpNum >= 1024.0  &&  conv < kConv_Peta) {
		    tmpNum /= 1024.0;
		    conv++;
		}
	    } else {
		while (tmpNum >= 1000.0  &&  conv < kConv_Peta) {
		    tmpNum /= 1000.0;
		    conv++;
		}
	    }
	    break;
	}
    }

    if (!isupper((int)inFormat)) {
        inNum *= kConversionForBits[conv];
        suffix = kLabel_bit[conv];
    } else {
        inNum *= kConversion[conv];
        suffix = kLabel_Byte[conv];
    }

    /* print such that we always fit in 4 places */
    tmpNum = (inNum < 0.0 ? (-1 * inNum) : inNum);
    if (tmpNum < 0.9995) {          /* 0.995 would be rounded to 1.000 */
        format = "%4.3f %s";        /* #.## */
    } else if (tmpNum < 9.995) {    /* 9.995 would be rounded to 10.00 */
        format = "%4.2f %s";        /* #.## */
    } else if (tmpNum < 99.95) {    /* 99.95 would be rounded to 100.0 */
        format = "%4.1f %s";        /* ##.# */
    } else if (tmpNum < 999.5) {    /* 999.5 would be rounded to 1000 */
	format = "%4.0f %s";        /*  ### */
    } else {                        /* 1000-1024 fits in 4 places
				     * If not using Adaptive sizes then
				     * this code will not control spaces*/
        format = "%4.0f %s";        /* #### */
    }
    snprintf(outString, inLen, format, inNum, suffix);
} /* end byte_snprintf */


void make_lower (char *s) {
    if (s) {
	int length = strlen(s);
	for (int i = 0; i < length; i++) {
	    s[i] = tolower(s[i]);
	}
    }
    return;
}

/* -------------------------------------------------------------------
 * redirect
 *
 * redirect the stdout into a specified file
 * return: none
 * ------------------------------------------------------------------- */

void redirect(const char *inOutputFileName) {
#ifdef WIN32

    FILE *fp;

    if (inOutputFileName == NULL) {
        fprintf(stderr, "should specify the output file name.\n");
        return;
    }

    fp = freopen(inOutputFileName, "a+", stdout);
    if (fp == NULL) {
        fprintf(stderr, "redirect stdout failed!\n");
        return;
    }

#endif

}


#ifdef __cplusplus
} /* end extern "C" */
#endif
