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
|
/*
* Copyright (C) 2015 Michael Brown <mbrown@fensystems.co.uk>.
*
* 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., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*
* You can also choose to distribute this program under the terms of
* the Unmodified Binary Distribution Licence (as given in the file
* COPYING.UBDL), provided that you have satisfied its requirements.
*/
FILE_LICENCE ( GPL2_OR_LATER_OR_UBDL );
#include <stddef.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
/** @file
*
* String functions
*
*/
/**
* Fill memory region
*
* @v dest Destination region
* @v character Fill character
* @v len Length
* @ret dest Destination region
*/
void * generic_memset ( void *dest, int character, size_t len ) {
uint8_t *dest_bytes = dest;
while ( len-- )
*(dest_bytes++) = character;
return dest;
}
/**
* Copy memory region
*
* @v dest Destination region
* @v src Source region
* @v len Length
* @ret dest Destination region
*/
void * generic_memcpy ( void *dest, const void *src, size_t len ) {
const uint8_t *src_bytes = src;
uint8_t *dest_bytes = dest;
while ( len-- )
*(dest_bytes++) = *(src_bytes++);
return dest;
}
/**
* Copy (possibly overlapping) memory region
*
* @v dest Destination region
* @v src Source region
* @v len Length
* @ret dest Destination region
*/
void * generic_memmove ( void *dest, const void *src, size_t len ) {
const uint8_t *src_bytes = ( src + len );
uint8_t *dest_bytes = ( dest + len );
if ( dest < src )
return memcpy ( dest, src, len );
while ( len-- )
*(--dest_bytes) = *(--src_bytes);
return dest;
}
/**
* Compare memory regions
*
* @v first First region
* @v second Second region
* @v len Length
* @ret diff Difference
*/
int memcmp ( const void *first, const void *second, size_t len ) {
const uint8_t *first_bytes = first;
const uint8_t *second_bytes = second;
int diff;
while ( len-- ) {
diff = ( *(second_bytes++) - *(first_bytes++) );
if ( diff )
return diff;
}
return 0;
}
/**
* Find character within a memory region
*
* @v src Source region
* @v character Character to find
* @v len Length
* @ret found Found character, or NULL if not found
*/
void * memchr ( const void *src, int character, size_t len ) {
const uint8_t *src_bytes = src;
for ( ; len-- ; src_bytes++ ) {
if ( *src_bytes == character )
return ( ( void * ) src_bytes );
}
return NULL;
}
/**
* Swap memory regions
*
* @v first First region
* @v second Second region
* @v len Length
* @ret first First region
*/
void * memswap ( void *first, void *second, size_t len ) {
uint8_t *first_bytes = first;
uint8_t *second_bytes = second;
uint8_t temp;
for ( ; len-- ; first_bytes++, second_bytes++ ) {
temp = *first_bytes;
*first_bytes = *second_bytes;
*second_bytes = temp;
}
return first;
}
/**
* Compare strings
*
* @v first First string
* @v second Second string
* @ret diff Difference
*/
int strcmp ( const char *first, const char *second ) {
return strncmp ( first, second, ~( ( size_t ) 0 ) );
}
/**
* Compare strings
*
* @v first First string
* @v second Second string
* @v max Maximum length to compare
* @ret diff Difference
*/
int strncmp ( const char *first, const char *second, size_t max ) {
const uint8_t *first_bytes = ( ( const uint8_t * ) first );
const uint8_t *second_bytes = ( ( const uint8_t * ) second );
int diff;
for ( ; max-- ; first_bytes++, second_bytes++ ) {
diff = ( *second_bytes - *first_bytes );
if ( diff )
return diff;
if ( ! *first_bytes )
return 0;
}
return 0;
}
/**
* Compare case-insensitive strings
*
* @v first First string
* @v second Second string
* @ret diff Difference
*/
int strcasecmp ( const char *first, const char *second ) {
const uint8_t *first_bytes = ( ( const uint8_t * ) first );
const uint8_t *second_bytes = ( ( const uint8_t * ) second );
int diff;
for ( ; ; first_bytes++, second_bytes++ ) {
diff = ( toupper ( *second_bytes ) -
toupper ( *first_bytes ) );
if ( diff )
return diff;
if ( ! *first_bytes )
return 0;
}
}
/**
* Get length of string
*
* @v src String
* @ret len Length
*/
size_t strlen ( const char *src ) {
return strnlen ( src, ~( ( size_t ) 0 ) );
}
/**
* Get length of string
*
* @v src String
* @v max Maximum length
* @ret len Length
*/
size_t strnlen ( const char *src, size_t max ) {
const uint8_t *src_bytes = ( ( const uint8_t * ) src );
size_t len = 0;
while ( max-- && *(src_bytes++) )
len++;
return len;
}
/**
* Find character within a string
*
* @v src String
* @v character Character to find
* @ret found Found character, or NULL if not found
*/
char * strchr ( const char *src, int character ) {
const uint8_t *src_bytes = ( ( const uint8_t * ) src );
for ( ; ; src_bytes++ ) {
if ( *src_bytes == character )
return ( ( char * ) src_bytes );
if ( ! *src_bytes )
return NULL;
}
}
/**
* Find rightmost character within a string
*
* @v src String
* @v character Character to find
* @ret found Found character, or NULL if not found
*/
char * strrchr ( const char *src, int character ) {
const uint8_t *src_bytes = ( ( const uint8_t * ) src );
const uint8_t *start = src_bytes;
while ( *src_bytes )
src_bytes++;
for ( src_bytes-- ; src_bytes >= start ; src_bytes-- ) {
if ( *src_bytes == character )
return ( ( char * ) src_bytes );
}
return NULL;
}
/**
* Find substring
*
* @v haystack String
* @v needle Substring
* @ret found Found substring, or NULL if not found
*/
char * strstr ( const char *haystack, const char *needle ) {
size_t len = strlen ( needle );
for ( ; *haystack ; haystack++ ) {
if ( memcmp ( haystack, needle, len ) == 0 )
return ( ( char * ) haystack );
}
return NULL;
}
/**
* Copy string
*
* @v dest Destination string
* @v src Source string
* @ret dest Destination string
*/
char * strcpy ( char *dest, const char *src ) {
const uint8_t *src_bytes = ( ( const uint8_t * ) src );
uint8_t *dest_bytes = ( ( uint8_t * ) dest );
/* We cannot use strncpy(), since that would pad the destination */
for ( ; ; src_bytes++, dest_bytes++ ) {
*dest_bytes = *src_bytes;
if ( ! *dest_bytes )
break;
}
return dest;
}
/**
* Copy string
*
* @v dest Destination string
* @v src Source string
* @v max Maximum length
* @ret dest Destination string
*/
char * strncpy ( char *dest, const char *src, size_t max ) {
const uint8_t *src_bytes = ( ( const uint8_t * ) src );
uint8_t *dest_bytes = ( ( uint8_t * ) dest );
for ( ; max ; max--, src_bytes++, dest_bytes++ ) {
*dest_bytes = *src_bytes;
if ( ! *dest_bytes )
break;
}
while ( max-- )
*(dest_bytes++) = '\0';
return dest;
}
/**
* Concatenate string
*
* @v dest Destination string
* @v src Source string
* @ret dest Destination string
*/
char * strcat ( char *dest, const char *src ) {
strcpy ( ( dest + strlen ( dest ) ), src );
return dest;
}
/**
* Duplicate string
*
* @v src Source string
* @ret dup Duplicated string, or NULL if allocation failed
*/
char * strdup ( const char *src ) {
return strndup ( src, ~( ( size_t ) 0 ) );
}
/**
* Duplicate string
*
* @v src Source string
* @v max Maximum length
* @ret dup Duplicated string, or NULL if allocation failed
*/
char * strndup ( const char *src, size_t max ) {
size_t len = strnlen ( src, max );
char *dup;
dup = malloc ( len + 1 /* NUL */ );
if ( dup ) {
memcpy ( dup, src, len );
dup[len] = '\0';
}
return dup;
}
/**
* Calculate digit value
*
* @v character Digit character
* @ret digit Digit value
*
* Invalid digits will be returned as a value greater than or equal to
* the numeric base.
*/
unsigned int digit_value ( unsigned int character ) {
if ( character >= 'a' )
return ( character - ( 'a' - 10 ) );
if ( character >= 'A' )
return ( character - ( 'A' - 10 ) );
if ( character <= '9' )
return ( character - '0' );
return character;
}
/**
* Preprocess string for strtoul() or strtoull()
*
* @v string String
* @v negate Final value should be negated
* @v base Numeric base
* @ret string Remaining string
*/
static const char * strtoul_pre ( const char *string, int *negate, int *base ) {
/* Skip any leading whitespace */
while ( isspace ( *string ) )
string++;
/* Process arithmetic sign, if present */
*negate = 0;
if ( *string == '-' ) {
string++;
*negate = 1;
} else if ( *string == '+' ) {
string++;
}
/* Process base, if present */
if ( *base == 0 ) {
*base = 10;
if ( *string == '0' ) {
string++;
*base = 8;
if ( ( *string & ~0x20 ) == 'X' ) {
string++;
*base = 16;
}
}
}
return string;
}
/**
* Convert string to numeric value
*
* @v string String
* @v endp End pointer (or NULL)
* @v base Numeric base (or zero to autodetect)
* @ret value Numeric value
*/
unsigned long strtoul ( const char *string, char **endp, int base ) {
unsigned long value = 0;
unsigned int digit;
int negate;
/* Preprocess string */
string = strtoul_pre ( string, &negate, &base );
/* Process digits */
for ( ; ; string++ ) {
digit = digit_value ( *string );
if ( digit >= ( unsigned int ) base )
break;
value = ( ( value * base ) + digit );
}
/* Negate value if, applicable */
if ( negate )
value = -value;
/* Fill in end pointer, if applicable */
if ( endp )
*endp = ( ( char * ) string );
return value;
}
/**
* Convert string to numeric value
*
* @v string String
* @v endp End pointer (or NULL)
* @v base Numeric base (or zero to autodetect)
* @ret value Numeric value
*/
unsigned long long strtoull ( const char *string, char **endp, int base ) {
unsigned long long value = 0;
unsigned int digit;
int negate;
/* Preprocess string */
string = strtoul_pre ( string, &negate, &base );
/* Process digits */
for ( ; ; string++ ) {
digit = digit_value ( *string );
if ( digit >= ( unsigned int ) base )
break;
value = ( ( value * base ) + digit );
}
/* Negate value if, applicable */
if ( negate )
value = -value;
/* Fill in end pointer, if applicable */
if ( endp )
*endp = ( ( char * ) string );
return value;
}
|