qse/lib/cmn/str-subst.h

189 lines
4.3 KiB
C

/*
* $Id$
*
Copyright (c) 2006-2019 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.
*/
#if !defined(char_t) && !defined(cstr_t) && !defined(strxsubst)
# error Never include this file
#endif
static const char_t* scan_dollar (
const char_t* f, qse_size_t l, cstr_t* ident, cstr_t* dfl, int depth)
{
const char_t* end = f + l;
QSE_ASSERT (l >= 2);
f += 2; /* skip ${ */
if (ident) ident->ptr = f;
while (1)
{
if (f >= end) return QSE_NULL;
if (*f == T('}') || *f == T(':')) break;
f++;
}
if (*f == T(':'))
{
if (f >= end || *(f + 1) != T('='))
{
/* not := */
return QSE_NULL;
}
if (ident) ident->len = f - ident->ptr;
f += 2; /* skip := */
if (dfl) dfl->ptr = f;
while (1)
{
if (f >= end) return QSE_NULL;
else if (*f == T('$') && *(f + 1) == T('{'))
{
if (depth >= 64) return QSE_NULL; /* depth too deep */
/* TODO: remove recursion */
f = scan_dollar (f, end - f, QSE_NULL, QSE_NULL, depth + 1);
if (f == QSE_NULL) return QSE_NULL;
}
else if (*f == T('}'))
{
/* ending bracket */
if (dfl) dfl->len = f - dfl->ptr;
return f + 1;
}
else f++;
}
}
else if (*f == T('}'))
{
if (ident) ident->len = f - ident->ptr;
if (dfl)
{
dfl->ptr = QSE_NULL;
dfl->len = 0;
}
return f + 1;
}
/* this part must not be reached */
return QSE_NULL;
}
static char_t* expand_dollar (
char_t* buf, qse_size_t bsz, const cstr_t* ident, const cstr_t* dfl,
subst_t subst, void* ctx)
{
char_t* tmp;
tmp = subst (buf, bsz, ident, ctx);
if (tmp == QSE_NULL)
{
/* substitution failed */
if (dfl->len > 0)
{
/* take the default value */
qse_size_t len;
/* TODO: remove recursion */
len = strxnsubst (buf, bsz, dfl->ptr, dfl->len, subst, ctx);
tmp = buf + len;
}
else tmp = buf;
}
return tmp;
}
qse_size_t strxnsubst (
char_t* buf, qse_size_t bsz, const char_t* fmt, qse_size_t fsz,
subst_t subst, void* ctx)
{
char_t* b = buf;
char_t* end = buf + bsz - 1;
const char_t* f = fmt;
const char_t* fend = fmt + fsz;
if (buf != NOBUF && bsz <= 0) return 0;
while (f < fend)
{
if (*f == T('$') && f < fend - 1)
{
if (*(f + 1) == T('{'))
{
const char_t* tmp;
cstr_t ident, dfl;
tmp = scan_dollar (f, fend - f, &ident, &dfl, 0);
if (tmp == QSE_NULL || ident.len <= 0) goto normal;
f = tmp;
if (buf != NOBUF)
{
b = expand_dollar (b, end - b + 1, &ident, &dfl, subst, ctx);
if (b >= end) goto fini;
}
else
{
/* the buffer points to NOBUF. */
tmp = expand_dollar (buf, bsz, &ident, &dfl, subst, ctx);
/* increment b by the length of the expanded string */
b += (tmp - buf);
}
continue;
}
else if (*(f + 1) == T('$'))
{
/* $$ -> $. */
f++;
}
}
normal:
if (buf != NOBUF)
{
if (b >= end) break;
*b = *f;
}
b++; f++;
}
fini:
if (buf != NOBUF) *b = T('\0');
return b - buf;
}
qse_size_t strxsubst (
char_t* buf, qse_size_t bsz, const char_t* fmt,
subst_t subst, void* ctx)
{
return strxnsubst (buf, bsz, fmt, strlen(fmt), subst, ctx);
}