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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/*
* wsclen.c
*
* $Id: wcslen.c,v 1.1.1.1 2006/04/11 17:56:16 source Exp $
*
* This file is part of the OpenLink Software Virtuoso Open-Source (VOS)
* project.
*
* Copyright (C) 1998-2006 OpenLink Software
*
* This project 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; only version 2 of the License, dated June 1991.
*
* 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.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
*
*/
#ifdef __APPLE__
#include <stdlib.h>
size_t wcslen (s) const wchar_t *s;
{
size_t len = 0;
while (s[len] != L'\0')
{
if (s[++len] == L'\0')
return len;
if (s[++len] == L'\0')
return len;
if (s[++len] == L'\0')
return len;
++len;
}
return len;
}
int wcscmp (s1, s2) const wchar_t *s1; const wchar_t *s2;
{
unsigned int c1, c2;
do
{
c1 = *s1++;
c2 = *s2++;
if (c1 == L'\0')
return c1 - c2;
}
while (c1 == c2);
return c1 - c2;
}
wchar_t * wcscpy (dest, src) wchar_t *dest; const wchar_t *src;
{
wchar_t *wcp = (wchar_t *) src;
unsigned int c;
int off = dest - src - 1;
do
{
c = *wcp++;
wcp[off] = c;
}
while (c != L'\0');
return dest;
}
wchar_t * wcsncpy (dest, src, n) wchar_t *dest; const wchar_t *src; size_t n;
{
unsigned int c;
wchar_t *const s = dest;
--dest;
if (n >= 4)
{
size_t n4 = n >> 2;
for (;;)
{
c = *src++;
*++dest = c;
if (c == L'\0')
break;
c = *src++;
*++dest = c;
if (c == L'\0')
break;
c = *src++;
*++dest = c;
if (c == L'\0')
break;
c = *src++;
*++dest = c;
if (c == L'\0')
break;
if (--n4 == 0)
goto last_chars;
}
n = n - (dest - s) - 1;
if (n == 0)
return s;
goto zero_fill;
}
last_chars:
n &= 3;
if (n == 0)
return s;
do
{
c = *src++;
*++dest = c;
if (--n == 0)
return s;
}
while (c != L'\0');
zero_fill:
do
*++dest = L'\0';
while (--n > 0);
return s;
}
wchar_t *
wcscat (dest, src)
wchar_t *dest;
const wchar_t *src;
{
register wchar_t *s1 = dest;
register const wchar_t *s2 = src;
wchar_t c;
do
c = *s1++;
while (c != L'\0');
s1 -= 2;
do
{
c = *s2++;
*++s1 = c;
}
while (c != L'\0');
return dest;
}
wchar_t *
wcsncat (dest, src, n)
wchar_t *dest;
const wchar_t *src;
size_t n;
{
wchar_t c;
wchar_t * const s = dest;
/* Find the end of DEST. */
do
c = *dest++;
while (c != L'\0');
/* Make DEST point before next character, so we can increment
it while memory is read (wins on pipelined cpus). */
dest -= 2;
if (n >= 4)
{
size_t n4 = n >> 2;
do
{
c = *src++;
*++dest = c;
if (c == L'\0')
return s;
c = *src++;
*++dest = c;
if (c == L'\0')
return s;
c = *src++;
*++dest = c;
if (c == L'\0')
return s;
c = *src++;
*++dest = c;
if (c == L'\0')
return s;
} while (--n4 > 0);
n &= 3;
}
while (n > 0)
{
c = *src++;
*++dest = c;
if (c == L'\0')
return s;
n--;
}
if (c != L'\0')
*++dest = L'\0';
return s;
}
#endif
|
