Line data Source code
1 : #define _GNU_SOURCE
2 : #include "fd_cstr.h"
3 :
4 : /* FIXME: WEAN THIS OFF STDLIB FOR NON-HOSTED TARGETS */
5 : #include <stdio.h>
6 : #include <stdlib.h>
7 : #include <stdarg.h>
8 : #include <strings.h>
9 : #include <ctype.h>
10 :
11 2 : char const * fd_cstr_to_cstr ( char const * cstr ) { return cstr; }
12 0 : char fd_cstr_to_char ( char const * cstr ) { return cstr[0]; }
13 0 : schar fd_cstr_to_schar ( char const * cstr ) { return (schar) strtol ( cstr, NULL, 0 ); }
14 0 : short fd_cstr_to_short ( char const * cstr ) { return (short) strtol ( cstr, NULL, 0 ); }
15 0 : int fd_cstr_to_int ( char const * cstr ) { return (int) strtol ( cstr, NULL, 0 ); }
16 0 : long fd_cstr_to_long ( char const * cstr ) { return (long) strtol ( cstr, NULL, 0 ); }
17 0 : uchar fd_cstr_to_uchar ( char const * cstr ) { return (uchar) strtoul( cstr, NULL, 0 ); }
18 0 : ushort fd_cstr_to_ushort( char const * cstr ) { return (ushort)strtoul( cstr, NULL, 0 ); }
19 0 : uint fd_cstr_to_uint ( char const * cstr ) { return (uint) strtoul( cstr, NULL, 0 ); }
20 2 : ulong fd_cstr_to_ulong ( char const * cstr ) { return (ulong) strtoul( cstr, NULL, 0 ); }
21 0 : float fd_cstr_to_float ( char const * cstr ) { return strtof ( cstr, NULL ); }
22 : #if FD_HAS_DOUBLE
23 0 : double fd_cstr_to_double( char const * cstr ) { return strtod ( cstr, NULL ); }
24 : #endif
25 :
26 0 : ulong fd_cstr_to_ulong_octal( char const * cstr ) { return (ulong)strtoul( cstr, NULL, 8 ); }
27 :
28 : ulong
29 : fd_cstr_to_ulong_seq( char const * cstr,
30 : ulong * seq,
31 0 : ulong seq_max ) {
32 0 : ulong seq_cnt = 0UL;
33 :
34 0 : if( !cstr ) return seq_cnt;
35 :
36 0 : char const * p = cstr;
37 0 : for(;;) {
38 :
39 0 : char c;
40 0 : char * q;
41 :
42 0 : c = *p; while( fd_isspace( (int)c ) ) c = *(++p); /* Move and peek at next non-white-space character */
43 0 : if( c=='\0' ) break; /* end of sequence */
44 :
45 0 : ulong seq_ele_0 = strtoul( p, &q, 0 );
46 0 : if( FD_UNLIKELY( p==(char const *)q ) ) return 0UL; /* Malformed sequence, seq_ele_0 is not a ulong */
47 0 : p = (char const *)q;
48 :
49 0 : ulong seq_ele_1 = seq_ele_0;
50 0 : ulong seq_stride = 1UL;
51 :
52 0 : c = *p; while( fd_isspace( (int)c ) ) c = *(++p); /* Move and peek at next non-white-space character */
53 0 : if( c=='-' ) {
54 0 : p++;
55 :
56 0 : seq_ele_1 = strtoul( p, &q, 0 );
57 0 : if( FD_UNLIKELY( p==(char const *)q ) ) return 0UL; /* Malformed sequence, seq_ele_1 is not a ulong */
58 0 : p = (char const *)q;
59 :
60 0 : c = *p; while( fd_isspace( (int)c ) ) c = *(++p); /* Move and peek at next non-white-space character */
61 0 : if( c=='/' || c==':' ) {
62 0 : p++;
63 :
64 0 : seq_stride = strtoul( p, &q, 0 );
65 0 : if( FD_UNLIKELY( p==(char const *)q ) ) return 0UL; /* Malformed sequence, seq_stride is not a ulong */
66 0 : p = (char const *)q;
67 0 : }
68 0 : }
69 :
70 0 : c = *p; while( fd_isspace( (int)c ) ) c = *(++p); /* Move and peek at next non-white-space character */
71 0 : if( !(c==',' || c=='\0' ) ) return 0UL; /* Malformed sequence, delimiter */
72 0 : if( c==',' ) p++;
73 :
74 : /* Append the range to sequence. Written this slightly funny way to
75 : be robust against overflow with seq_ele_1 and/or seq_stride being
76 : near or equal to ULONG_MAX */
77 :
78 0 : if( FD_UNLIKELY( (seq_ele_1<seq_ele_0) | (!seq_stride) )) return 0UL; /* Malformed sequence, bad range */
79 :
80 0 : ulong seq_ele = seq_ele_0;
81 0 : while( ((seq_ele_0<=seq_ele) & (seq_ele<seq_ele_1)) ) {
82 0 : if( FD_LIKELY( seq_cnt<seq_max ) ) seq[ seq_cnt ] = seq_ele;
83 0 : seq_cnt++;
84 0 : if( FD_UNLIKELY( seq_stride>seq_ele_1-seq_ele ) ) break;
85 0 : seq_ele += seq_stride;
86 0 : }
87 0 : if( seq_ele==seq_ele_1 ) {
88 0 : if( FD_LIKELY( seq_cnt<seq_max ) ) seq[ seq_cnt ] = seq_ele;
89 0 : seq_cnt++;
90 0 : }
91 0 : }
92 :
93 0 : return seq_cnt;
94 0 : }
95 :
96 : int
97 : fd_cstr_casecmp( char const * a,
98 1 : char const * b ) {
99 1 : return strcasecmp( a, b );
100 1 : }
101 :
102 : ulong
103 : fd_cstr_nlen( char const * s,
104 0 : ulong m ) {
105 0 : return strnlen( s, m );
106 0 : }
107 :
108 : char *
109 : fd_cstr_ncpy( char * d,
110 : char const * s,
111 1 : ulong m ) {
112 1 : if( FD_LIKELY( m ) ){
113 1 : ulong i = 0UL;
114 1 : if( FD_LIKELY( s ) ) {
115 9 : for( ; i<m-1UL; i++ ) {
116 8 : char c = s[i];
117 8 : if( !c ) break;
118 8 : d[i] = c;
119 8 : }
120 1 : }
121 1 : memset( d+i, 0, m-i );
122 1 : }
123 1 : return d;
124 1 : }
125 :
126 : char *
127 : fd_cstr_printf( char * buf,
128 : ulong sz,
129 : ulong * opt_len,
130 132 : char const * fmt, ... ) {
131 132 : if( FD_UNLIKELY( (!buf) | (!sz) ) ) {
132 0 : if( opt_len ) *opt_len = 0UL;
133 0 : return buf;
134 0 : }
135 132 : va_list ap;
136 132 : va_start( ap, fmt );
137 132 : int ret = vsnprintf( buf, sz, fmt, ap );
138 132 : ulong len = fd_ulong_if( ret<0, 0UL, fd_ulong_min( (ulong)ret, sz-1UL ) );
139 132 : buf[ len ] = '\0';
140 132 : va_end( ap );
141 132 : if( opt_len ) *opt_len = len;
142 132 : return buf;
143 132 : }
144 :
145 : int
146 : fd_cstr_printf_check( char * buf,
147 : ulong sz,
148 : ulong * opt_len,
149 12 : char const * fmt, ... ) {
150 12 : if( FD_UNLIKELY( (!buf) | (!sz) ) ) {
151 0 : if( opt_len ) *opt_len = 0UL;
152 0 : return 0;
153 0 : }
154 12 : va_list ap;
155 12 : va_start( ap, fmt );
156 12 : int ret = vsnprintf( buf, sz, fmt, ap );
157 12 : ulong len = fd_ulong_if( ret<0, 0UL, fd_ulong_min( (ulong)ret, sz-1UL ) );
158 12 : buf[ len ] = '\0';
159 12 : va_end( ap );
160 12 : if( opt_len ) *opt_len = len;
161 12 : return len==(ulong)ret;
162 12 : }
163 :
164 : char *
165 : fd_cstr_append_printf( char * buf,
166 0 : char const * fmt, ... ) {
167 0 : if( FD_UNLIKELY( !buf ) ) return NULL;
168 0 : va_list ap;
169 0 : va_start( ap, fmt );
170 0 : int ret = vsprintf( buf, fmt, ap );
171 0 : va_end( ap );
172 0 : return buf + fd_ulong_if( ret<0, 0UL, (ulong)ret );
173 0 : }
174 :
175 : ulong
176 : fd_cstr_tokenize( char ** tok,
177 : ulong tok_max,
178 : char * p,
179 0 : char delim ) {
180 0 : if( FD_UNLIKELY( !p ) ) return 0UL;
181 :
182 0 : ulong tok_cnt = 0UL;
183 0 : for(;;) {
184 :
185 : /* Find token start and record it (if possible) */
186 0 : while( fd_isspace( (int)p[0] ) ) p++;
187 0 : if( p[0]=='\0' ) break;
188 0 : if( tok_cnt<tok_max ) tok[ tok_cnt ] = p;
189 0 : tok_cnt++;
190 :
191 : /* Find the token end and terminate it */
192 0 : while( ((p[0]!=delim) & (p[0]!='\0')) ) p++;
193 0 : if( p[0]=='\0' ) break;
194 0 : p[0] = '\0';
195 0 : p++;
196 0 : }
197 :
198 0 : return tok_cnt;
199 0 : }
|
