Fri, 16 Aug 2013 13:40:10 +0200
fixed documentation for netbeans parser + added sstrprefix() and sstrsuffix()
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 return s;
101 }
102 if (length > s.length-start) {
103 length = s.length-start;
104 }
105 new_sstr.ptr = &s.ptr[start];
106 new_sstr.length = length;
107 return new_sstr;
108 }
110 sstr_t sstrchr(sstr_t s, int c) {
111 for(size_t i=0;i<s.length;i++) {
112 if(s.ptr[i] == c) {
113 return sstrsubs(s, i);
114 }
115 }
116 sstr_t n;
117 n.ptr = NULL;
118 n.length = 0;
119 return n;
120 }
122 sstr_t* sstrsplit(sstr_t s, sstr_t d, size_t *n) {
123 return sstrsplit_a(ucx_default_allocator(), s, d, n);
124 }
126 sstr_t* sstrsplit_a(UcxAllocator *allocator, sstr_t s, sstr_t d, size_t *n) {
127 if (s.length == 0 || d.length == 0) {
128 *n = -1;
129 return NULL;
130 }
132 sstr_t* result;
133 size_t nmax = *n;
134 *n = 1;
136 /* special case: exact match - no processing needed */
137 if (sstrcmp(s, d) == 0) {
138 *n = 0;
139 return NULL;
140 }
141 sstr_t sv = sstrdup(s);
142 if (sv.length == 0) {
143 *n = -2;
144 return NULL;
145 }
147 for (size_t i = 0 ; i < s.length ; i++) {
148 if (sv.ptr[i] == d.ptr[0]) {
149 _Bool match = 1;
150 for (size_t j = 1 ; j < d.length ; j++) {
151 if (j+i < s.length) {
152 match &= (sv.ptr[i+j] == d.ptr[j]);
153 } else {
154 match = 0;
155 break;
156 }
157 }
158 if (match) {
159 (*n)++;
160 for (size_t j = 0 ; j < d.length ; j++) {
161 sv.ptr[i+j] = 0;
162 }
163 i += d.length;
164 }
165 }
166 if ((*n) == nmax) break;
167 }
168 result = (sstr_t*) allocator->malloc(allocator->pool, sizeof(sstr_t)*(*n));
170 if (result) {
171 char *pptr = sv.ptr;
172 for (size_t i = 0 ; i < *n ; i++) {
173 size_t l = strlen(pptr);
174 char* ptr = (char*) allocator->malloc(allocator->pool, l + 1);
175 memcpy(ptr, pptr, l);
176 ptr[l] = 0;
178 result[i] = sstrn(ptr, l);
179 pptr += l + d.length;
180 }
181 } else {
182 *n = -2;
183 }
185 free(sv.ptr);
187 return result;
188 }
190 int sstrcmp(sstr_t s1, sstr_t s2) {
191 if (s1.length == s2.length) {
192 return memcmp(s1.ptr, s2.ptr, s1.length);
193 } else if (s1.length > s2.length) {
194 return 1;
195 } else {
196 return -1;
197 }
198 }
200 sstr_t sstrdup(sstr_t s) {
201 return sstrdup_a(ucx_default_allocator(), s);
202 }
204 sstr_t sstrdup_a(UcxAllocator *allocator, sstr_t s) {
205 sstr_t newstring;
206 newstring.ptr = (char*)allocator->malloc(allocator->pool, s.length + 1);
207 if (newstring.ptr) {
208 newstring.length = s.length;
209 newstring.ptr[newstring.length] = 0;
211 memcpy(newstring.ptr, s.ptr, s.length);
212 } else {
213 newstring.length = 0;
214 }
216 return newstring;
217 }
219 sstr_t sstrtrim(sstr_t string) {
220 sstr_t newstr = string;
221 if (string.length == 0) {
222 return newstr;
223 }
225 size_t i;
226 for(i=0;i<string.length;i++) {
227 char c = string.ptr[i];
228 if(c > 32) {
229 break;
230 }
231 }
232 newstr.ptr = &string.ptr[i];
233 newstr.length = string.length - i;
235 if(newstr.length == 0) {
236 return newstr;
237 }
239 i = newstr.length - 1;
240 for(;;) {
241 char c = newstr.ptr[i];
242 if(c > 32) {
243 break;
244 }
245 if(i > 0) {
246 i--;
247 } else {
248 break;
249 }
250 }
251 newstr.length = i + 1;
253 return newstr;
254 }
256 int sstrprefix(sstr_t string, sstr_t prefix) {
257 if (string.length == 0) {
258 return prefix.length == 0;
259 }
260 if (prefix.length == 0) {
261 return 1;
262 }
264 if (prefix.length > string.length) {
265 return 0;
266 } else {
267 return memcmp(string.ptr, prefix.ptr, prefix.length) == 0;
268 }
269 }
271 int sstrsuffix(sstr_t string, sstr_t suffix) {
272 if (string.length == 0) {
273 return suffix.length == 0;
274 }
275 if (suffix.length == 0) {
276 return 1;
277 }
279 if (suffix.length > string.length) {
280 return 0;
281 } else {
282 return memcmp(string.ptr+string.length-suffix.length,
283 suffix.ptr, suffix.length) == 0;
284 }
285 }