253 lines
6.4 KiB
C
253 lines
6.4 KiB
C
|
/*
|
||
|
* $Id$
|
||
|
*
|
||
|
Copyright (c) 2014-2016 Chung, Hyung-Hwan. All rights reserved.
|
||
|
|
||
|
Redistribution and use in source and binary forms, with or without
|
||
|
modification, are permitted provided that the following conditions
|
||
|
are met:
|
||
|
1. Redistributions of source code must retain the above copyright
|
||
|
notice, this list of conditions and the following disclaimer.
|
||
|
2. Redistributions in binary form must reproduce the above copyright
|
||
|
notice, this list of conditions and the following disclaimer in the
|
||
|
documentation and/or other materials provided with the distribution.
|
||
|
|
||
|
THIS SOFTWARE IS PROVIDED BY THE AUTHOR "AS IS" AND ANY EXPRESS OR
|
||
|
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
||
|
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
||
|
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
||
|
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
||
|
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
||
|
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include "stix-prv.h"
|
||
|
|
||
|
#include <stdio.h> /* for snrintf(). used for floating-point number formatting */
|
||
|
#include <stdarg.h>
|
||
|
|
||
|
#if defined(_MSC_VER) || defined(__BORLANDC__) || (defined(__WATCOMC__) && (__WATCOMC__ < 1200))
|
||
|
# define snprintf _snprintf
|
||
|
# if !defined(HAVE_SNPRINTF)
|
||
|
# define HAVE_SNPRINTF
|
||
|
# endif
|
||
|
#endif
|
||
|
#if defined(HAVE_QUADMATH_H)
|
||
|
# include <quadmath.h> /* for quadmath_snprintf() */
|
||
|
#endif
|
||
|
/* TODO: remove stdio.h and quadmath.h once snprintf gets replaced by own
|
||
|
floting-point conversion implementation*/
|
||
|
|
||
|
/* Max number conversion buffer length:
|
||
|
* stix_intmax_t in base 2, plus NUL byte. */
|
||
|
#define MAXNBUF (STIX_SIZEOF(stix_intmax_t) * 8 + 1)
|
||
|
|
||
|
enum
|
||
|
{
|
||
|
/* integer */
|
||
|
LF_C = (1 << 0),
|
||
|
LF_H = (1 << 1),
|
||
|
LF_J = (1 << 2),
|
||
|
LF_L = (1 << 3),
|
||
|
LF_Q = (1 << 4),
|
||
|
LF_T = (1 << 5),
|
||
|
LF_Z = (1 << 6),
|
||
|
|
||
|
/* long double */
|
||
|
LF_LD = (1 << 7),
|
||
|
/* __float128 */
|
||
|
LF_QD = (1 << 8)
|
||
|
};
|
||
|
|
||
|
static struct
|
||
|
{
|
||
|
stix_uint8_t flag; /* for single occurrence */
|
||
|
stix_uint8_t dflag; /* for double occurrence */
|
||
|
} lm_tab[26] =
|
||
|
{
|
||
|
{ 0, 0 }, /* a */
|
||
|
{ 0, 0 }, /* b */
|
||
|
{ 0, 0 }, /* c */
|
||
|
{ 0, 0 }, /* d */
|
||
|
{ 0, 0 }, /* e */
|
||
|
{ 0, 0 }, /* f */
|
||
|
{ 0, 0 }, /* g */
|
||
|
{ LF_H, LF_C }, /* h */
|
||
|
{ 0, 0 }, /* i */
|
||
|
{ LF_J, 0 }, /* j */
|
||
|
{ 0, 0 }, /* k */
|
||
|
{ LF_L, LF_Q }, /* l */
|
||
|
{ 0, 0 }, /* m */
|
||
|
{ 0, 0 }, /* n */
|
||
|
{ 0, 0 }, /* o */
|
||
|
{ 0, 0 }, /* p */
|
||
|
{ LF_Q, 0 }, /* q */
|
||
|
{ 0, 0 }, /* r */
|
||
|
{ 0, 0 }, /* s */
|
||
|
{ LF_T, 0 }, /* t */
|
||
|
{ 0, 0 }, /* u */
|
||
|
{ 0, 0 }, /* v */
|
||
|
{ 0, 0 }, /* w */
|
||
|
{ 0, 0 }, /* z */
|
||
|
{ 0, 0 }, /* y */
|
||
|
{ LF_Z, 0 }, /* z */
|
||
|
};
|
||
|
|
||
|
|
||
|
enum
|
||
|
{
|
||
|
FLAGC_DOT = (1 << 0),
|
||
|
FLAGC_SPACE = (1 << 1),
|
||
|
FLAGC_SHARP = (1 << 2),
|
||
|
FLAGC_SIGN = (1 << 3),
|
||
|
FLAGC_LEFTADJ = (1 << 4),
|
||
|
FLAGC_ZEROPAD = (1 << 5),
|
||
|
FLAGC_WIDTH = (1 << 6),
|
||
|
FLAGC_PRECISION = (1 << 7),
|
||
|
FLAGC_STAR1 = (1 << 8),
|
||
|
FLAGC_STAR2 = (1 << 9),
|
||
|
FLAGC_LENMOD = (1 << 10) /* length modifier */
|
||
|
};
|
||
|
|
||
|
static const stix_bch_t hex2ascii_lower[] =
|
||
|
{
|
||
|
'0','1','2','3','4','5','6','7','8','9',
|
||
|
'a','b','c','d','e','f','g','h','i','j','k','l','m',
|
||
|
'n','o','p','q','r','s','t','u','v','w','x','y','z'
|
||
|
};
|
||
|
|
||
|
static const stix_bch_t hex2ascii_upper[] =
|
||
|
{
|
||
|
'0','1','2','3','4','5','6','7','8','9',
|
||
|
'A','B','C','D','E','F','G','H','I','J','K','L','M',
|
||
|
'N','O','P','Q','R','S','T','U','V','W','X','H','Z'
|
||
|
};
|
||
|
|
||
|
static stix_ooch_t ooch_nullstr[] = { '(','n','u','l','l', ')','\0' };
|
||
|
static stix_bch_t bch_nullstr[] = { '(','n','u','l','l', ')','\0' };
|
||
|
|
||
|
typedef int (*stix_fmtout_put_t) (
|
||
|
stix_t* stix,
|
||
|
stix_ooch_t c
|
||
|
);
|
||
|
|
||
|
typedef struct stix_fmtout_t stix_fmtout_t;
|
||
|
struct stix_fmtout_t
|
||
|
{
|
||
|
stix_oow_t count; /* out */
|
||
|
stix_oow_t limit; /* in */
|
||
|
stix_fmtout_put_t put;
|
||
|
};
|
||
|
|
||
|
/* ------------------------------------------------------------------------- */
|
||
|
/*
|
||
|
* Put a NUL-terminated ASCII number (base <= 36) in a buffer in reverse
|
||
|
* order; return an optional length and a pointer to the last character
|
||
|
* written in the buffer (i.e., the first character of the string).
|
||
|
* The buffer pointed to by `nbuf' must have length >= MAXNBUF.
|
||
|
*/
|
||
|
|
||
|
static stix_bch_t* sprintn_lower (stix_bch_t* nbuf, stix_uintmax_t num, int base, stix_ooi_t *lenp)
|
||
|
{
|
||
|
stix_bch_t* p;
|
||
|
|
||
|
p = nbuf;
|
||
|
*p = '\0';
|
||
|
do { *++p = hex2ascii_lower[num % base]; } while (num /= base);
|
||
|
|
||
|
if (lenp) *lenp = p - nbuf;
|
||
|
return p; /* returns the end */
|
||
|
}
|
||
|
|
||
|
static stix_bch_t* sprintn_upper (stix_bch_t* nbuf, stix_uintmax_t num, int base, stix_ooi_t *lenp)
|
||
|
{
|
||
|
stix_bch_t* p;
|
||
|
|
||
|
p = nbuf;
|
||
|
*p = '\0';
|
||
|
do { *++p = hex2ascii_upper[num % base]; } while (num /= base);
|
||
|
|
||
|
if (lenp) *lenp = p - nbuf;
|
||
|
return p; /* returns the end */
|
||
|
}
|
||
|
|
||
|
/* ------------------------------------------------------------------------- */
|
||
|
|
||
|
static int put_ooch (stix_t* stix, stix_ooch_t ch)
|
||
|
{
|
||
|
|
||
|
if (stix->log.len >= stix->log.capa)
|
||
|
{
|
||
|
stix_oow_t newcapa;
|
||
|
stix_ooch_t* tmp;
|
||
|
|
||
|
newcapa = stix->log.capa + 512; /* TODO: adjust this capacity */
|
||
|
tmp = stix_reallocmem (stix, stix->log.ptr, newcapa * STIX_SIZEOF(*tmp));
|
||
|
if (!tmp) return -1;
|
||
|
|
||
|
stix->log.ptr = tmp;
|
||
|
stix->log.capa = newcapa;
|
||
|
}
|
||
|
|
||
|
stix->log.ptr[stix->log.len++] = ch;
|
||
|
if (ch == '\n')
|
||
|
{
|
||
|
stix->vmprim.log_write (stix, 0, stix->log.ptr, stix->log.len);
|
||
|
/* TODO: error handling */
|
||
|
stix->log.len = 0;
|
||
|
}
|
||
|
|
||
|
return 1;
|
||
|
}
|
||
|
|
||
|
/* ------------------------------------------------------------------------- */
|
||
|
|
||
|
#undef fmtchar_t
|
||
|
#undef fmtoutv
|
||
|
#define fmtchar_t stix_bch_t
|
||
|
#define fmtoutv stix_bfmtoutv
|
||
|
#include "fmtoutv.h"
|
||
|
|
||
|
#undef fmtchar_t
|
||
|
#undef fmtoutv
|
||
|
#define fmtchar_t stix_ooch_t
|
||
|
#define fmtoutv stix_oofmtoutv
|
||
|
#include "fmtoutv.h"
|
||
|
|
||
|
stix_ooi_t stix_bfmtout (stix_t* stix, const stix_bch_t* fmt, ...)
|
||
|
{
|
||
|
stix_ooi_t x;
|
||
|
va_list ap;
|
||
|
stix_fmtout_t fo;
|
||
|
|
||
|
fo.count = 0;
|
||
|
fo.limit = STIX_TYPE_MAX(stix_ooi_t);
|
||
|
fo.put = put_ooch;
|
||
|
|
||
|
va_start (ap, fmt);
|
||
|
x = stix_bfmtoutv (stix, fmt, &fo, ap);
|
||
|
va_end (ap);
|
||
|
|
||
|
return (x <= -1)? -1: fo.count;
|
||
|
}
|
||
|
|
||
|
stix_ooi_t stix_oofmtout (stix_t* stix, const stix_ooch_t* fmt, ...)
|
||
|
{
|
||
|
stix_ooi_t x;
|
||
|
va_list ap;
|
||
|
stix_fmtout_t fo;
|
||
|
|
||
|
fo.count = 0;
|
||
|
fo.limit = STIX_TYPE_MAX(stix_ooi_t);
|
||
|
fo.put = put_ooch;
|
||
|
|
||
|
va_start (ap, fmt);
|
||
|
x = stix_oofmtoutv (stix, fmt, &fo, ap);
|
||
|
va_end (ap);
|
||
|
|
||
|
return (x <= -1)? -1: fo.count;
|
||
|
}
|