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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
|
/* Leave the OpenBSD version below so we can track upstream fixes */
/* $OpenBSD: strlcpy.c,v 1.11 2006/05/05 15:27:38 millert Exp $ */
/*
* Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
#include <ctype.h>
#ifdef HAVE_ICONV
# include <errno.h>
# include <iconv.h>
#endif
#include "eina_private.h"
#include "eina_str.h"
/*============================================================================*
* Local *
*============================================================================*/
/**
* @cond LOCAL
*/
/*
* Internal helper function used by eina_str_has_suffix() and
* eina_str_has_extension()
*/
static inline Eina_Bool
eina_str_has_suffix_helper(const char *str,
const char *suffix,
int (*cmp)(const char *, const char *))
{
size_t str_len;
size_t suffix_len;
if ((!str) || (!suffix)) return EINA_FALSE;
str_len = strlen(str);
suffix_len = eina_strlen_bounded(suffix, str_len);
if (suffix_len == (size_t)-1)
return EINA_FALSE;
return cmp(str + str_len - suffix_len, suffix) == 0;
}
static inline char **
eina_str_split_full_helper(const char *str,
const char *delim,
int max_tokens,
unsigned int *elements)
{
char *s, **str_array;
const char *src;
size_t len, dlen;
unsigned int tokens;
dlen = strlen(delim);
if (dlen == 0)
{
if (elements)
*elements = 0;
return NULL;
}
tokens = 0;
src = str;
/* count tokens and check strlen(str) */
while (*src != '\0')
{
const char *d = delim, *d_end = d + dlen;
const char *tmp = src;
for (; (d < d_end) && (*tmp != '\0'); d++, tmp++)
{
if (EINA_LIKELY(*d != *tmp))
break;
}
if (EINA_UNLIKELY(d == d_end))
{
src = tmp;
tokens++;
}
else
src++;
}
len = src - str;
if ((max_tokens > 0) && (tokens > (unsigned int)max_tokens))
tokens = max_tokens;
str_array = malloc(sizeof(char *) * (tokens + 2));
if (!str_array)
{
if (elements)
*elements = 0;
return NULL;
}
s = malloc(len + 1);
if (!s)
{
free(str_array);
if (elements)
*elements = 0;
return NULL;
}
/* copy tokens and string */
tokens = 0;
str_array[0] = s;
src = str;
while (*src != '\0')
{
const char *d = delim, *d_end = d + dlen;
const char *tmp = src;
for (; (d < d_end) && (*tmp != '\0'); d++, tmp++)
{
if (EINA_LIKELY(*d != *tmp))
break;
}
if (EINA_UNLIKELY(d == d_end))
{
src = tmp;
*s = '\0';
s += dlen;
tokens++;
str_array[tokens] = s;
}
else
{
*s = *src;
s++;
src++;
}
}
*s = '\0';
str_array[tokens + 1] = NULL;
if (elements)
*elements = (tokens + 1);
return str_array;
}
/**
* @endcond
*/
/*============================================================================*
* Global *
*============================================================================*/
/*============================================================================*
* API *
*============================================================================*/
EAPI size_t
eina_strlcpy(char *dst, const char *src, size_t siz)
{
#ifdef HAVE_STRLCPY
return strlcpy(dst, src, siz);
#else
char *d = dst;
const char *s = src;
size_t n = siz;
/* Copy as many bytes as will fit */
if (n != 0)
while (--n != 0)
{
if ((*d++ = *s++) == '\0')
break;
}
/* Not enough room in dst, add NUL and traverse rest of src */
if (n == 0)
{
if (siz != 0)
*d = '\0'; /* NUL-terminate dst */
while (*s++)
;
}
return(s - src - 1); /* count does not include NUL */
#endif
}
EAPI size_t
eina_strlcat(char *dst, const char *src, size_t siz)
{
char *d = dst;
const char *s = src;
size_t n = siz;
size_t dlen;
/* Find the end of dst and adjust bytes left but don't go past end */
while (n-- != 0 && *d != '\0')
d++;
dlen = d - dst;
n = siz - dlen;
if (n == 0)
return(dlen + strlen(s));
while (*s != '\0') {
if (n != 1)
{
*d++ = *s;
n--;
}
s++;
}
*d = '\0';
return(dlen + (s - src)); /* count does not include NUL */
}
EAPI Eina_Bool
eina_str_has_prefix(const char *str, const char *prefix)
{
size_t str_len;
size_t prefix_len;
str_len = strlen(str);
prefix_len = eina_strlen_bounded(prefix, str_len);
if (prefix_len == (size_t)-1)
return EINA_FALSE;
return (strncmp(str, prefix, prefix_len) == 0);
}
EAPI Eina_Bool
eina_str_has_suffix(const char *str, const char *suffix)
{
return eina_str_has_suffix_helper(str, suffix, strcmp);
}
EAPI Eina_Bool
eina_str_has_extension(const char *str, const char *ext)
{
return eina_str_has_suffix_helper(str, ext, strcasecmp);
}
EAPI char **
eina_str_split_full(const char *str,
const char *delim,
int max_tokens,
unsigned int *elements)
{
return eina_str_split_full_helper(str, delim, max_tokens, elements);
}
EAPI char **
eina_str_split(const char *str, const char *delim, int max_tokens)
{
return eina_str_split_full_helper(str, delim, max_tokens, NULL);
}
EAPI size_t
eina_str_join_len(char *dst,
size_t size,
char sep,
const char *a,
size_t a_len,
const char *b,
size_t b_len)
{
size_t ret = a_len + b_len + 1;
size_t off;
if (size < 1)
return ret;
if (size <= a_len)
{
memcpy(dst, a, size - 1);
dst[size - 1] = '\0';
return ret;
}
memcpy(dst, a, a_len);
off = a_len;
if (size <= off + 1)
{
dst[size - 1] = '\0';
return ret;
}
dst[off] = sep;
off++;
if (size <= off + b_len + 1)
{
memcpy(dst + off, b, size - off - 1);
dst[size - 1] = '\0';
return ret;
}
memcpy(dst + off, b, b_len);
dst[off + b_len] = '\0';
return ret;
}
#ifdef HAVE_ICONV
EAPI char *
eina_str_convert(const char *enc_from, const char *enc_to, const char *text)
{
iconv_t ic;
char *new_txt, *inp, *outp;
size_t inb, outb, outlen, tob, outalloc;
if (!text)
return NULL;
ic = iconv_open(enc_to, enc_from);
if (ic == (iconv_t)(-1))
return NULL;
new_txt = malloc(64);
inb = strlen(text);
outb = 64;
inp = (char *)text;
outp = new_txt;
outalloc = 64;
outlen = 0;
for (;; )
{
size_t count;
tob = outb;
count = iconv(ic, &inp, &inb, &outp, &outb);
outlen += tob - outb;
if (count == (size_t)(-1))
{
if (errno == E2BIG)
{
new_txt = realloc(new_txt, outalloc + 64);
outp = new_txt + outlen;
outalloc += 64;
outb += 64;
}
else if (errno == EILSEQ)
{
if (new_txt)
free(new_txt);
new_txt = NULL;
break;
}
else if (errno == EINVAL)
{
if (new_txt)
free(new_txt);
new_txt = NULL;
break;
}
else
{
if (new_txt)
free(new_txt);
new_txt = NULL;
break;
}
}
if (inb == 0)
{
if (outalloc == outlen)
new_txt = realloc(new_txt, outalloc + 1);
new_txt[outlen] = 0;
break;
}
}
iconv_close(ic);
return new_txt;
}
#else
EAPI char *
eina_str_convert(const char *enc_from __UNUSED__,
const char *enc_to __UNUSED__,
const char *text __UNUSED__)
{
return NULL;
}
#endif
EAPI char *
eina_str_escape(const char *str)
{
char *s2, *d;
const char *s;
s2 = malloc((strlen(str) * 2) + 1);
if (!s2)
return NULL;
for (s = str, d = s2; *s != 0; s++, d++)
{
if ((*s == ' ') || (*s == '\\') || (*s == '\''))
{
*d = '\\';
d++;
}
*d = *s;
}
*d = 0;
return s2;
}
EAPI void
eina_str_tolower(char **str)
{
char *p;
if ((!str) || (!(*str)))
return;
for (p = *str; (*p); p++)
*p = tolower((unsigned char )(*p));
}
EAPI void
eina_str_toupper(char **str)
{
char *p;
if ((!str) || (!(*str)))
return;
for (p = *str; (*p); p++)
*p = toupper((unsigned char)(*p));
}
|