1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
dbx_tree: tree database driver for Miranda IM
Copyright 2007-2010 Michael "Protogenes" Kunz,
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#pragma once
inline int strcpy_s(
char *strDestination,
size_t numberOfElements,
const char *strSource
)
{
if (!strDestination) return EINVAL;
if (!strSource) {strDestination[0] = 0; return EINVAL;}
size_t l = strlen(strSource);
if (numberOfElements < l + 1) {strDestination[0] = 0; return ERANGE;}
memcpy(strDestination, strSource, l + 1);
return 0;
}
template <size_t size>
inline int strcpy_s(
char (&strDestination)[size],
const char *strSource
)
{
if (!strDestination) return EINVAL;
if (!strSource) {strDestination[0] = 0; return EINVAL;}
size_t l = strlen(strSource);
if (size < l + 1) {strDestination[0] = 0; return ERANGE;}
memcpy(strDestination, strSource, l + 1);
return 0;
}
inline int strcat_s(
char *strDestination,
size_t numberOfElements,
const char *strSource
)
{
if (!strDestination) return EINVAL;
if (!strSource) {strDestination[0] = 0; return EINVAL;}
size_t l = strlen(strSource);
size_t m = strlen(strDestination);
if (numberOfElements < l + m + 1) {strDestination[0] = 0; return ERANGE;}
memcpy(&strDestination[m], strSource, l + 1);
return 0;
}
template <size_t size>
inline int strcat_s(
char (&strDestination)[size],
const char *strSource
)
{
if (!strDestination) return EINVAL;
if (!strSource) {strDestination[0] = 0; return EINVAL;}
size_t l = strlen(strSource);
size_t m = strlen(strDestination);
if (size < l + m + 1) {strDestination[0] = 0; return ERANGE;}
memcpy(&strDestination[m], strSource, l + 1);
return 0;
}
inline int strncpy_s(
char *strDest,
size_t numberOfElements,
const char *strSource,
size_t count
)
{
if (count > numberOfElements)
return strcpy_s(strDest, numberOfElements, strSource);
else
return strcpy_s(strDest, count + 1, strSource);
}
template <size_t size>
inline int sprintf_s(
char (&buffer)[size],
const char *format,
...
)
{
va_list va;
va_start(va, format);
vsnprintf(buffer, size, format, va);
va_end(va);
}
template <size_t size>
inline int swprintf_s(
wchar_t (&buffer)[size],
const wchar_t *format,
...
)
{
va_list va;
va_start(va, format);
vsnwprintf(buffer, size, format, va);
va_end(va);
}
#define vsprintf_s vsnprintf
|
