108 lines
2.1 KiB
C
108 lines
2.1 KiB
C
/*
|
|
* $Id: tio_put.c 76 2009-02-22 14:18:06Z hyunghwan.chung $
|
|
*
|
|
Copyright 2006-2009 Chung, Hyung-Hwan.
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
*/
|
|
|
|
#include <qse/cmn/tio.h>
|
|
#include <qse/cmn/chr.h>
|
|
|
|
static qse_ssize_t tio_putc (qse_tio_t* tio, qse_char_t c)
|
|
{
|
|
#ifndef QSE_CHAR_IS_MCHAR
|
|
qse_size_t n, i;
|
|
qse_mchar_t mc[50];
|
|
#endif
|
|
|
|
if (tio->outbuf_len >= QSE_COUNTOF(tio->outbuf))
|
|
{
|
|
/* maybe, previous flush operation has failed a few
|
|
* times previously. so the buffer is full.
|
|
*/
|
|
tio->errnum = QSE_TIO_ENOSPC;
|
|
return -1;
|
|
}
|
|
|
|
#ifdef QSE_CHAR_IS_MCHAR
|
|
tio->outbuf[tio->outbuf_len++] = c;
|
|
if (tio->outbuf_len >= QSE_COUNTOF(tio->outbuf))
|
|
return qse_tio_flush (tio);
|
|
#else
|
|
|
|
n = qse_wctomb (c, mc, QSE_COUNTOF(mc));
|
|
if (n == 0)
|
|
{
|
|
tio->errnum = QSE_TIO_EILCHR;
|
|
return -1;
|
|
}
|
|
else if (n > QSE_COUNTOF(mc))
|
|
{
|
|
tio->errnum = QSE_TIO_ENOSPC;
|
|
return -1;
|
|
}
|
|
|
|
for (i = 0; i < n; i++)
|
|
{
|
|
tio->outbuf[tio->outbuf_len++] = mc[i];
|
|
if (tio->outbuf_len >= QSE_COUNTOF(tio->outbuf))
|
|
{
|
|
if (qse_tio_flush (tio) == -1) return -1;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
if (c == QSE_T('\n') && tio->outbuf_len > 0)
|
|
{
|
|
if (qse_tio_flush (tio) == -1) return -1;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
qse_ssize_t qse_tio_write (qse_tio_t* tio, const qse_char_t* str, qse_size_t size)
|
|
{
|
|
qse_ssize_t n;
|
|
const qse_char_t* p;
|
|
|
|
if (size == 0) return 0;
|
|
|
|
p = str;
|
|
|
|
if (size == (qse_size_t)-1)
|
|
{
|
|
while (*p != QSE_T('\0'))
|
|
{
|
|
n = tio_putc (tio, *p);
|
|
if (n == -1) return -1;
|
|
if (n == 0) break;
|
|
p++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
const qse_char_t* end = str + size;
|
|
while (p < end)
|
|
{
|
|
n = tio_putc (tio, *p);
|
|
if (n == -1) return -1;
|
|
if (n == 0) break;
|
|
p++;
|
|
}
|
|
}
|
|
|
|
return p - str;
|
|
}
|
|
|