qse/qse/lib/cmn/str-dup.c

237 lines
5.6 KiB
C
Raw Normal View History

/*
2012-08-16 03:47:55 +00:00
* $Id$
*
Copyright 2006-2012 Chung, Hyung-Hwan.
This file is part of QSE.
QSE is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation, either version 3 of
the License, or (at your option) any later version.
QSE is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with QSE. If not, see <http://www.gnu.org/licenses/>.
*/
#include <qse/cmn/str.h>
#include "mem.h"
qse_mchar_t* qse_mbsdup (const qse_mchar_t* str, qse_mmgr_t* mmgr)
{
qse_mchar_t* tmp;
2011-06-23 10:17:35 +00:00
QSE_ASSERT (mmgr != QSE_NULL);
tmp = (qse_mchar_t*) QSE_MMGR_ALLOC (
mmgr, (qse_mbslen(str)+1)*QSE_SIZEOF(qse_mchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_mbscpy (tmp, str);
return tmp;
}
qse_mchar_t* qse_mbsdup2 (
const qse_mchar_t* str1, const qse_mchar_t* str2, qse_mmgr_t* mmgr)
{
return qse_mbsxdup2 (
str1, qse_mbslen(str1), str2, qse_mbslen(str2), mmgr);
}
qse_mchar_t* qse_mbsxdup (
const qse_mchar_t* str, qse_size_t len, qse_mmgr_t* mmgr)
{
qse_mchar_t* tmp;
tmp = (qse_mchar_t*) QSE_MMGR_ALLOC (
mmgr, (len+1)*QSE_SIZEOF(qse_mchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_mbsncpy (tmp, str, len);
return tmp;
}
qse_mchar_t* qse_mbsxdup2 (
const qse_mchar_t* str1, qse_size_t len1,
const qse_mchar_t* str2, qse_size_t len2, qse_mmgr_t* mmgr)
{
qse_mchar_t* tmp;
2011-06-23 10:17:35 +00:00
QSE_ASSERT (mmgr != QSE_NULL);
tmp = (qse_mchar_t*) QSE_MMGR_ALLOC (
mmgr, (len1+len2+1) * QSE_SIZEOF(qse_mchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_mbsncpy (tmp, str1, len1);
qse_mbsncpy (tmp + len1, str2, len2);
return tmp;
}
qse_mchar_t* qse_mbsadup (const qse_mchar_t* str[], qse_size_t* len, qse_mmgr_t* mmgr)
{
qse_mchar_t* buf, * ptr;
qse_size_t i;
qse_size_t capa = 0;
QSE_ASSERT (mmgr != QSE_NULL);
for (i = 0; str[i]; i++) capa += qse_mbslen(str[i]);
buf = (qse_mchar_t*) QSE_MMGR_ALLOC (mmgr, (capa+1)*QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
ptr = buf;
for (i = 0; str[i]; i++) ptr += qse_mbscpy (ptr, str[i]);
if (len) *len = capa;
return buf;
}
qse_mchar_t* qse_mcstrdup (const qse_mcstr_t* str, qse_mmgr_t* mmgr)
{
qse_mchar_t* buf;
QSE_ASSERT (mmgr != QSE_NULL);
buf = (qse_mchar_t*) QSE_MMGR_ALLOC (
mmgr, (str->len + 1) * QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
qse_mbsncpy (buf, str->ptr, str->len);
return buf;
}
qse_mchar_t* qse_mcstradup (const qse_mcstr_t str[], qse_size_t* len, qse_mmgr_t* mmgr)
{
qse_mchar_t* buf, * ptr;
qse_size_t i;
qse_size_t capa = 0;
QSE_ASSERT (mmgr != QSE_NULL);
for (i = 0; str[i].ptr; i++) capa += str[i].len;
buf = (qse_mchar_t*) QSE_MMGR_ALLOC (mmgr, (capa+1)*QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
ptr = buf;
for (i = 0; str[i].ptr; i++) ptr += qse_mbsncpy (ptr, str[i].ptr, str[i].len);
if (len) *len = capa;
return buf;
}
/* --------------------------------------------------------------- */
qse_wchar_t* qse_wcsdup (const qse_wchar_t* str, qse_mmgr_t* mmgr)
{
qse_wchar_t* tmp;
2011-06-23 10:17:35 +00:00
QSE_ASSERT (mmgr != QSE_NULL);
tmp = (qse_wchar_t*) QSE_MMGR_ALLOC (
mmgr, (qse_wcslen(str)+1)*QSE_SIZEOF(qse_wchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_wcscpy (tmp, str);
return tmp;
}
qse_wchar_t* qse_wcsdup2 (
const qse_wchar_t* str1, const qse_wchar_t* str2, qse_mmgr_t* mmgr)
{
return qse_wcsxdup2 (
str1, qse_wcslen(str1), str2, qse_wcslen(str2), mmgr);
}
qse_wchar_t* qse_wcsxdup (
const qse_wchar_t* str, qse_size_t len, qse_mmgr_t* mmgr)
{
qse_wchar_t* tmp;
2011-06-23 10:17:35 +00:00
QSE_ASSERT (mmgr != QSE_NULL);
tmp = (qse_wchar_t*) QSE_MMGR_ALLOC (
mmgr, (len+1)*QSE_SIZEOF(qse_wchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_wcsncpy (tmp, str, len);
return tmp;
}
qse_wchar_t* qse_wcsxdup2 (
const qse_wchar_t* str1, qse_size_t len1,
const qse_wchar_t* str2, qse_size_t len2, qse_mmgr_t* mmgr)
{
qse_wchar_t* tmp;
2011-06-23 10:17:35 +00:00
QSE_ASSERT (mmgr != QSE_NULL);
tmp = (qse_wchar_t*) QSE_MMGR_ALLOC (
mmgr, (len1+len2+1) * QSE_SIZEOF(qse_wchar_t));
if (tmp == QSE_NULL) return QSE_NULL;
qse_wcsncpy (tmp, str1, len1);
qse_wcsncpy (tmp + len1, str2, len2);
return tmp;
}
qse_wchar_t* qse_wcsadup (const qse_wchar_t* str[], qse_size_t* len, qse_mmgr_t* mmgr)
{
qse_wchar_t* buf, * ptr;
qse_size_t i;
qse_size_t capa = 0;
QSE_ASSERT (mmgr != QSE_NULL);
for (i = 0; str[i]; i++) capa += qse_wcslen(str[i]);
buf = (qse_wchar_t*) QSE_MMGR_ALLOC (mmgr, (capa+1)*QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
ptr = buf;
for (i = 0; str[i]; i++) ptr += qse_wcscpy (ptr, str[i]);
if (len) *len = capa;
return buf;
}
qse_wchar_t* qse_wcstrdup (const qse_wcstr_t* str, qse_mmgr_t* mmgr)
{
qse_wchar_t* buf;
QSE_ASSERT (mmgr != QSE_NULL);
buf = (qse_wchar_t*) QSE_MMGR_ALLOC (
mmgr, (str->len + 1) * QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
qse_wcsncpy (buf, str->ptr, str->len);
return buf;
}
qse_wchar_t* qse_wcstradup (const qse_wcstr_t str[], qse_size_t* len, qse_mmgr_t* mmgr)
{
qse_wchar_t* buf, * ptr;
qse_size_t i;
qse_size_t capa = 0;
QSE_ASSERT (mmgr != QSE_NULL);
for (i = 0; str[i].ptr; i++) capa += str[i].len;
buf = (qse_wchar_t*) QSE_MMGR_ALLOC (mmgr, (capa+1)*QSE_SIZEOF(*buf));
if (buf == QSE_NULL) return QSE_NULL;
ptr = buf;
for (i = 0; str[i].ptr; i++) ptr += qse_wcsncpy (ptr, str[i].ptr, str[i].len);
if (len) *len = capa;
return buf;
}