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