integrated Ville Laurikari's TRE
This commit is contained in:
126
qse/lib/cmn/str-dup.c
Normal file
126
qse/lib/cmn/str-dup.c
Normal file
@ -0,0 +1,126 @@
|
||||
/*
|
||||
* $Id: str-dup.c 556 2011-08-31 15:43:46Z hyunghwan.chung $
|
||||
*
|
||||
Copyright 2006-2011 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;
|
||||
|
||||
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;
|
||||
|
||||
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_wchar_t* qse_wcsdup (const qse_wchar_t* str, qse_mmgr_t* mmgr)
|
||||
{
|
||||
qse_wchar_t* tmp;
|
||||
|
||||
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;
|
||||
|
||||
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;
|
||||
|
||||
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;
|
||||
}
|
Reference in New Issue
Block a user