-
Notifications
You must be signed in to change notification settings - Fork 1
/
spstring.c
555 lines (508 loc) · 15.3 KB
/
spstring.c
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
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
/*
* C Implementation: SPString
*
* Description:
* This class provides a safe and convenient, albeit slower, alternative
* to C character chains.
*
* One can easily create a String from a C string with newString(char *).
* String.str always returns a null-terminated C chain, and String.len
* returns its length.
* One should always avoid to manipulate the String structure members
* directly in order to prevent corruption (i.e incorrect sz and len values).
*
* Most functions mirror standard C functions.
* stringcpy and stringcat can increase their buffer size if necessary in
* order to prevent buffer overflow.
*
* Author: Nicolas Janin <>, (C) 2009
*
* Published under MIT License
* strlcpy copyrghted by its author
*
*/
#include <stddef.h>
#include <string.h>
#include <malloc.h>
#include <assert.h>
#include <stdarg.h>
#include <stdio.h>
#include "spstring.h"
#undef TIDY /* Tidy up buffers by filling them with zeroes */
/* Slows things down a little, so uncomment this */
/* only if needed. */
/* private (internal mechanics) */
static int ST_ERR = ST_NO_ERR;
static int incsz ( String *string, size_t len );
size_t strlcpy(char *dst, const char *src, size_t siz);
/* --- Dynamic allocation
String can dynamically increase in size as necessary. */
String * newString ( const char *chars )
{
String *newS = NULL;
if ( chars != NULL )
{
size_t len = strlen ( chars );
newS = ( String * ) malloc ( sizeof ( String ) );
if ( newS != NULL )
{
newS->len = len;
newS->sz = len + 1;
newS->str = strdup ( chars );
if ( newS->str == NULL )
{
ST_ERR = ST_ALLOC_ERR;
}
}
else
{
ST_ERR = ST_ALLOC_ERR;
}
}
else
{
ST_ERR = ST_NULLPARAM_ERR;
}
return newS;
}
void delString ( String *string )
{
#ifdef NDEBUG
stringcheck ( string, __FILE__, __LINE__ );
#endif
if ( string != NULL )
{
if ( string->str != NULL )
{
free ( string->str );
string->str = NULL;
}
else
{
ST_ERR = ST_NULLSTR_ERR;
}
free ( string );
string = NULL;
}
else
{
ST_ERR = ST_NULLPARAM_ERR;
}
}
/* Copy - Will increase dst allocation if src is too large */
size_t stringcpy ( String *dst, const String *src )
{
#ifdef NDEBUG
stringcheck ( src, __FILE__, __LINE__ );
stringcheck ( dst, __FILE__, __LINE__ );
#endif
size_t len = src->len;
if ( dst->sz <= len )
{
if ( incsz ( dst, len + 1 ) == ST_ALLOC_ERR )
{
return ST_ALLOC_ERR;
}
}
dst->len = len;
#ifdef TIDY
strlcpy ( dst->str, src->str, len + 1 );
#else
strcpy ( dst->str, src->str );
#endif
return len;
}
/* Copy - Will increase dst allocation if src is too large */
size_t stringchcpy ( String *dst, const char *src )
{
#ifdef NDEBUG
stringcheck ( dst, __FILE__, __LINE__ );
#endif
if ( src == NULL )
{
ST_ERR = ST_NULLPARAM_ERR;
return ST_NULLPARAM_ERR;
}
size_t len = strlen ( src );
if ( dst->sz <= len )
{
if ( incsz ( dst, len + 1 ) == ST_ALLOC_ERR )
{
return ST_ALLOC_ERR;
}
}
dst->len = len;
#ifdef TIDY
strlcpy ( dst->str, src, len + 1 );
#else
strcpy ( dst->str, src );
#endif
return len;
}
/* Concatenation - Will increase dst allocation when necessary */
size_t stringcat ( String *dst, const String *src )
{
#ifdef NDEBUG
stringcheck ( src, __FILE__, __LINE__ );
stringcheck ( dst, __FILE__, __LINE__ );
#endif
size_t len = src->len;
size_t finallen = dst->len + len;
if ( dst->sz <= finallen )
{
if ( incsz ( dst, finallen + 1 ) == ST_ALLOC_ERR )
{
return ST_ALLOC_ERR;
}
}
dst->len = finallen;
strcat ( dst->str, src->str );
#ifdef TIDY
size_t l = dst->len;
char * end = dst->str + l;
for ( ; l < dst->sz; l++ ) *end++ = 0;
#endif
return len;
}
/* Concatenation - Will increase dst allocation when necessary */
size_t stringchcat ( String *dst, const char *src )
{
#ifdef NDEBUG
stringcheck ( dst, __FILE__, __LINE__ );
#endif
if ( src == NULL )
{
ST_ERR = ST_NULLPARAM_ERR;
return ST_NULLPARAM_ERR;
}
size_t len = strlen ( src );
size_t finallen = dst->len + len;
if ( dst->sz <= finallen )
{
if ( incsz ( dst, finallen + 1 ) == ST_ALLOC_ERR )
{
return ST_ALLOC_ERR;
}
}
dst->len = finallen;
strcat ( dst->str, src );
#ifdef TIDY
size_t l = dst->len;
char * end = dst->str + l;
for ( ; l < dst->sz; l++ ) *end++ = 0;
#endif
return len;
}
/* Duplication - allocate a new String */
String * stringdup ( const String *src )
{
#ifdef NDEBUG
stringcheck ( src, __FILE__, __LINE__ );
#endif
String *string = NULL;
if ( src != NULL )
{
string = newString ( src->str );
}
else
{
ST_ERR = ST_NULLPARAM_ERR;
}
return string;
}
/* ---- Allocation on the stack (non dynamic) */
/*
Allocation on the stack
Here, szMax is a maximum size of the buffer, which is allocated
once and for all, and cannot be increased at runtime.
Furthermore, the chars array must not be deallocated before the release
of the LString (else mangling pointer).
If you need fully extensible Strings, use dynamic allocation instead.
*/
LString localString ( char *chars, size_t szMax )
{
LString newS;
if ( chars != NULL )
{
newS = ( LString ) {szMax, strlen ( chars ), chars};
#ifdef TIDY
size_t l = newS.len;
char * end = chars + l;
for ( ; l < szMax; l++ ) *end++ = 0;
#endif
}
else
{
ST_ERR = ST_NULLPARAM_ERR;
newS = ( LString ) {0, 0, NULL};
}
return newS;
}
/* Copy of LString - checks that there is no buffer overflow */
size_t lstringcpy ( LString *dst, const LString *src )
{
#ifdef NDEBUG
stringcheck ( ( String * ) src, __FILE__, __LINE__ );
stringcheck ( ( String * ) dst, __FILE__, __LINE__ );
#endif
size_t len = src->len;
if ( dst->sz <= len )
{
ST_ERR = ST_OVERWRITE_ERR;
return ST_OVERWRITE_ERR;
}
dst->len = len;
#ifdef TIDY
strlcpy ( dst->str, src->str, dst->sz + 1 );
#else
strcpy ( dst->str, src->str );
#endif
return len;
}
/* Copy of a fixed character chain in a LString
* checks that there is no buffer overflow
*/
size_t lstringchcpy ( LString *dst, const char *src )
{
#ifdef NDEBUG
stringcheck ( ( String * ) dst, __FILE__, __LINE__ );
#endif
if ( src == NULL )
{
ST_ERR = ST_NULLPARAM_ERR;
return ST_NULLPARAM_ERR;
}
size_t len = strlen ( src );
if ( dst->sz <= len )
{
ST_ERR = ST_OVERWRITE_ERR;
return ST_OVERWRITE_ERR;
}
dst->len = len;
#ifdef TIDY
strlcpy ( dst->str, src, dst->sz + 1 );
#else
strcpy ( dst->str, src );
#endif
return len;
}
size_t lstringcat ( LString *dst, const LString *src )
{
#ifdef NDEBUG
stringcheck ( ( String * ) src, __FILE__, __LINE__ );
stringcheck ( ( String * ) dst, __FILE__, __LINE__ );
#endif
size_t len = src->len;
size_t finallen = dst->len + len;
if ( finallen >= dst->sz )
{
ST_ERR = ST_OVERWRITE_ERR;
return ST_OVERWRITE_ERR;
}
dst->len = finallen;
strcat ( dst->str, src->str );
#ifdef TIDY
size_t l = dst->len;
char * end = dst->str + l;
for ( ; l < dst->sz; l++ ) *end++ = 0;
#endif
return len;
}
/* Cooncatenation of a fixed character chain to a LString */
size_t lstringchcat ( LString *dst, const char *src )
{
#ifdef NDEBUG
stringcheck ( ( String * ) dst, __FILE__, __LINE__ );
#endif
if ( src == NULL )
{
ST_ERR = ST_NULLPARAM_ERR;
return ST_NULLPARAM_ERR;
}
size_t len = strlen ( src );
size_t finallen = dst->len + len;
if ( finallen >= dst->sz )
{
ST_ERR = ST_OVERWRITE_ERR;
return ST_OVERWRITE_ERR;
}
dst->len = finallen;
strcat ( dst->str, src );
#ifdef TIDY
size_t l = dst->len;
char * end = dst->str + l;
for ( ; l < dst->sz; l++ ) *end++ = 0;
#endif
return len;
}
/* The following functions apply both on String and LString */
size_t stringlen ( const String *string )
{
return string->len;
}
/*
Check for an internal inconsistency in a LString.
You can use this in a debugging session.
*/
int stringcheck ( const String *string, char *file, int line )
{
#ifdef NDEBUG
#define ASSERT(cond) if ( !(cond) ) { \
printf("stringcheck error %s line %d:String(%zu/%zu)=\"%s\"\n", \
file, line, string->len, string->sz, string->str); \
assert( string != NULL ); }
ASSERT ( string != NULL );
ASSERT ( string->str != NULL );
ASSERT ( string->len < string->sz );
ASSERT ( string->len == strlen ( string->str ) );
return 0;
#undef ASSERT
#else
if ( string == NULL )
return ST_NULLPARAM_ERR;
if ( string->str == NULL )
return ST_NULLSTR_ERR;
if ( string->len >= string->sz )
return ST_INCONSISTENTSZ_ERR;
if ( string->len != strlen ( string->str ) )
return ST_INCONSISTENTLEN_ERR;
return 0;
#endif
}
/* String comparison */
int stringcmp ( const String *st1, const String *st2 )
{
#ifdef NDEBUG
stringcheck ( ( String * ) st1, __FILE__, __LINE__ );
stringcheck ( ( String * ) st2, __FILE__, __LINE__ );
#endif
if ( st1->len != st2->len )
{
return ( int ) ( st2->len - st1->len );
}
return strcmp ( st1->str, st2->str );
}
/* Comparison with a C chain */
int stringchcmp ( const String *st1, const char *st2 )
{
#ifdef NDEBUG
stringcheck ( ( String * ) st1, __FILE__, __LINE__ );
#endif
size_t lt2 = strlen ( st2 );
if ( st1->len != lt2 )
{
return ( int ) ( lt2 - st1->len );
}
return strcmp ( st1->str, st2 );
}
/* Truncation to the Nth character */
String * stringtrunc ( String *string, size_t N )
{
#ifdef NDEBUG
stringcheck ( string, __FILE__, __LINE__ );
#endif
string->len = N-1;
string->str[N-1] = '\0';
#ifdef TIDY
size_t l = string->len;
char * end = string->str + l;
for ( ; l < string->sz; l++ ) *end++ = 0;
#endif
return string;
}
/* Formatting */
void stringprintf ( String *dst, const char * format, ... )
{
#ifdef NDEBUG
stringcheck ( dst, __FILE__, __LINE__ );
#endif
va_list argp;
va_start ( argp, format );
dst->len = vsnprintf ( dst->str, dst->sz, format, argp ) ;
va_end ( argp ) ;
}
/* Returns error type and resets ST_ERR */
int get_stringerr()
{
int err = ST_ERR;
ST_ERR = ST_NO_ERR;
return err;
}
/*************************************************
* PRIVATE
**************************************************/
/* Increase string.sz to desired size */
static int incsz ( String *string, size_t size )
{
ST_ERR = ST_NO_ERR;
if ( string->sz < size )
{
/* double as necessary */
size_t newsz = string->sz;
do
{
newsz *= 2;
} while (newsz < size);
char *tmp = realloc ( string->str, (size_t)newsz );
if ( tmp != NULL )
{
#ifdef TIDY
size_t l = string->len;
char * end = tmp + l;
for ( ; l < size; l++ ) *end++ = 0;
#endif
string->str = tmp;
string->sz = newsz;
}
else
{
ST_ERR = ST_ALLOC_ERR;
}
}
return ST_ERR;
}
/*
* Copyright (c) 1998 Todd C. Miller <[email protected]>
*
* 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.
*/
/*
* Copy src to string dst of size siz. At most siz-1 characters
* will be copied. Always NUL terminates (unless siz == 0).
* Returns strlen(src); if retval >= siz, truncation occurred.
*/
size_t strlcpy(char *dst, const char *src, size_t siz)
{
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 */
}
#undef TIDY