Tue, 10 Jun 2014 15:43:13 +0200
fixed some sstring issues + added allocator macros
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2013 Olaf Wintermann. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
26 * POSSIBILITY OF SUCH DAMAGE.
27 */
29 #include <stdlib.h>
30 #include <string.h>
31 #include <stdarg.h>
33 #include "string.h"
34 #include "allocator.h"
36 sstr_t sstr(char *cstring) {
37 sstr_t string;
38 string.ptr = cstring;
39 string.length = strlen(cstring);
40 return string;
41 }
43 sstr_t sstrn(char *cstring, size_t length) {
44 sstr_t string;
45 string.ptr = cstring;
46 string.length = length;
47 return string;
48 }
50 size_t sstrnlen(size_t n, sstr_t s, ...) {
51 va_list ap;
52 size_t size = s.length;
53 va_start(ap, s);
55 for (size_t i = 1 ; i < n ; i++) {
56 sstr_t str = va_arg(ap, sstr_t);
57 size += str.length;
58 }
59 va_end(ap);
61 return size;
62 }
64 sstr_t sstrncat(sstr_t s, size_t n, sstr_t c1, ...) {
65 va_list ap;
66 va_start(ap, c1);
67 s.ptr[0] = 0;
69 size_t len = s.length;
70 size_t cplen = c1.length > len ? len : c1.length;
71 char *ptr = s.ptr;
73 memcpy(ptr, c1.ptr, cplen);
74 len -= cplen;
75 ptr += cplen;
76 for (size_t i = 1 ; i < n ; i++) {
77 sstr_t str = va_arg (ap, sstr_t);
78 cplen = str.length > len ? len : str.length;
79 if(cplen <= 0) {
80 va_end(ap);
81 return s;
82 }
83 memcpy(ptr, str.ptr, cplen);
84 len -= cplen;
85 ptr += cplen;
86 }
87 va_end(ap);
88 s.length = ptr - s.ptr;
90 return s;
91 }
93 sstr_t sstrsubs(sstr_t s, size_t start) {
94 return sstrsubsl (s, start, s.length-start);
95 }
97 sstr_t sstrsubsl(sstr_t s, size_t start, size_t length) {
98 sstr_t new_sstr;
99 if (start >= s.length) {
100 new_sstr.ptr = NULL;
101 new_sstr.length = 0;
102 } else {
103 if (length > s.length-start) {
104 length = s.length-start;
105 }
106 new_sstr.ptr = &s.ptr[start];
107 new_sstr.length = length;
108 }
109 return new_sstr;
110 }
112 sstr_t sstrchr(sstr_t s, int c) {
113 for(size_t i=0;i<s.length;i++) {
114 if(s.ptr[i] == c) {
115 return sstrsubs(s, i);
116 }
117 }
118 sstr_t n;
119 n.ptr = NULL;
120 n.length = 0;
121 return n;
122 }
124 sstr_t sstrrchr(sstr_t s, int c) {
125 if (s.length > 0) {
126 for(size_t i=s.length;i>0;i--) {
127 if(s.ptr[i-1] == c) {
128 return sstrsubs(s, i-1);
129 }
130 }
131 }
132 sstr_t n;
133 n.ptr = NULL;
134 n.length = 0;
135 return n;
136 }
138 sstr_t* sstrsplit(sstr_t s, sstr_t d, ssize_t *n) {
139 return sstrsplit_a(ucx_default_allocator(), s, d, n);
140 }
142 sstr_t* sstrsplit_a(UcxAllocator *allocator, sstr_t s, sstr_t d, ssize_t *n) {
143 if (s.length == 0 || d.length == 0) {
144 *n = -1;
145 return NULL;
146 }
148 sstr_t* result;
149 ssize_t nmax = *n;
150 *n = 1;
152 /* special case: exact match - no processing needed */
153 if (sstrcmp(s, d) == 0) {
154 *n = 0;
155 return NULL;
156 }
157 sstr_t sv = sstrdup(s);
158 if (sv.length == 0) {
159 *n = -2;
160 return NULL;
161 }
163 for (size_t i = 0 ; i < s.length ; i++) {
164 if (sv.ptr[i] == d.ptr[0]) {
165 _Bool match = 1;
166 for (size_t j = 1 ; j < d.length ; j++) {
167 if (j+i < s.length) {
168 match &= (sv.ptr[i+j] == d.ptr[j]);
169 } else {
170 match = 0;
171 break;
172 }
173 }
174 if (match) {
175 (*n)++;
176 for (size_t j = 0 ; j < d.length ; j++) {
177 sv.ptr[i+j] = 0;
178 }
179 i += d.length;
180 }
181 }
182 if ((*n) == nmax) break;
183 }
184 result = (sstr_t*) almalloc(allocator, sizeof(sstr_t)*(*n));
186 if (result) {
187 char *pptr = sv.ptr;
188 for (ssize_t i = 0 ; i < *n ; i++) {
189 size_t l = strlen(pptr);
190 char* ptr = (char*) almalloc(allocator, l + 1);
191 if (ptr) {
192 memcpy(ptr, pptr, l);
193 ptr[l] = 0;
195 result[i] = sstrn(ptr, l);
196 pptr += l + d.length;
197 } else {
198 for (ssize_t j = i-1 ; j >= 0 ; j--) {
199 alfree(allocator, result[j].ptr);
200 }
201 alfree(allocator, result);
202 *n = -2;
203 break;
204 }
205 }
206 } else {
207 *n = -2;
208 }
210 free(sv.ptr);
212 return result;
213 }
215 int sstrcmp(sstr_t s1, sstr_t s2) {
216 if (s1.length == s2.length) {
217 return memcmp(s1.ptr, s2.ptr, s1.length);
218 } else if (s1.length > s2.length) {
219 return 1;
220 } else {
221 return -1;
222 }
223 }
225 int sstrcasecmp(sstr_t s1, sstr_t s2) {
226 if (s1.length == s2.length) {
227 #ifdef _WIN32
228 return _strnicmp(s1.ptr, s2.ptr, s1.length);
229 #else
230 return strncasecmp(s1.ptr, s2.ptr, s1.length);
231 #endif
232 } else if (s1.length > s2.length) {
233 return 1;
234 } else {
235 return -1;
236 }
237 }
239 sstr_t sstrdup(sstr_t s) {
240 return sstrdup_a(ucx_default_allocator(), s);
241 }
243 sstr_t sstrdup_a(UcxAllocator *allocator, sstr_t s) {
244 sstr_t newstring;
245 newstring.ptr = (char*)almalloc(allocator, s.length + 1);
246 if (newstring.ptr) {
247 newstring.length = s.length;
248 newstring.ptr[newstring.length] = 0;
250 memcpy(newstring.ptr, s.ptr, s.length);
251 } else {
252 newstring.length = 0;
253 }
255 return newstring;
256 }
258 sstr_t sstrtrim(sstr_t string) {
259 sstr_t newstr = string;
260 if (string.length == 0) {
261 return newstr;
262 }
264 size_t i;
265 for(i=0;i<string.length;i++) {
266 char c = string.ptr[i];
267 if(c > 32) {
268 break;
269 }
270 }
271 newstr.ptr = &string.ptr[i];
272 newstr.length = string.length - i;
274 if(newstr.length == 0) {
275 return newstr;
276 }
278 i = newstr.length - 1;
279 for(;;) {
280 char c = newstr.ptr[i];
281 if(c > 32) {
282 break;
283 }
284 if(i > 0) {
285 i--;
286 } else {
287 break;
288 }
289 }
290 newstr.length = i + 1;
292 return newstr;
293 }
295 int sstrprefix(sstr_t string, sstr_t prefix) {
296 if (string.length == 0) {
297 return prefix.length == 0;
298 }
299 if (prefix.length == 0) {
300 return 1;
301 }
303 if (prefix.length > string.length) {
304 return 0;
305 } else {
306 return memcmp(string.ptr, prefix.ptr, prefix.length) == 0;
307 }
308 }
310 int sstrsuffix(sstr_t string, sstr_t suffix) {
311 if (string.length == 0) {
312 return suffix.length == 0;
313 }
314 if (suffix.length == 0) {
315 return 1;
316 }
318 if (suffix.length > string.length) {
319 return 0;
320 } else {
321 return memcmp(string.ptr+string.length-suffix.length,
322 suffix.ptr, suffix.length) == 0;
323 }
324 }