universe@39: /* universe@39: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. universe@39: * universe@39: * Copyright 2015 Olaf Wintermann. All rights reserved. universe@39: * universe@39: * Redistribution and use in source and binary forms, with or without universe@39: * modification, are permitted provided that the following conditions are met: universe@39: * universe@39: * 1. Redistributions of source code must retain the above copyright universe@39: * notice, this list of conditions and the following disclaimer. universe@39: * universe@39: * 2. Redistributions in binary form must reproduce the above copyright universe@39: * notice, this list of conditions and the following disclaimer in the universe@39: * documentation and/or other materials provided with the distribution. universe@39: * universe@39: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" universe@39: * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE universe@39: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE universe@39: * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE universe@39: * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR universe@39: * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF universe@39: * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS universe@39: * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN universe@39: * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) universe@39: * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE universe@39: * POSSIBILITY OF SUCH DAMAGE. universe@39: */ universe@39: universe@39: #include universe@39: #include universe@39: #include universe@39: #include universe@39: universe@39: #include "string.h" universe@39: #include "allocator.h" universe@39: universe@39: sstr_t sstr(char *cstring) { universe@39: sstr_t string; universe@39: string.ptr = cstring; universe@39: string.length = strlen(cstring); universe@39: return string; universe@39: } universe@39: universe@39: sstr_t sstrn(char *cstring, size_t length) { universe@39: sstr_t string; universe@39: string.ptr = cstring; universe@39: string.length = length; universe@39: return string; universe@39: } universe@39: universe@39: size_t sstrnlen(size_t n, sstr_t s, ...) { universe@39: va_list ap; universe@39: size_t size = s.length; universe@39: va_start(ap, s); universe@39: universe@39: for (size_t i = 1 ; i < n ; i++) { universe@39: sstr_t str = va_arg(ap, sstr_t); universe@39: size += str.length; universe@39: } universe@39: va_end(ap); universe@39: universe@39: return size; universe@39: } universe@39: universe@39: static sstr_t sstrvcat_a( universe@39: UcxAllocator *a, universe@39: size_t count, universe@39: sstr_t s1, universe@39: sstr_t s2, universe@39: va_list ap) { universe@39: sstr_t str; universe@39: str.ptr = NULL; universe@39: str.length = 0; universe@39: if(count < 2) { universe@39: return str; universe@39: } universe@39: universe@39: sstr_t *strings = (sstr_t*) calloc(count, sizeof(sstr_t)); universe@39: if(!strings) { universe@39: return str; universe@39: } universe@39: universe@39: // get all args and overall length universe@39: strings[0] = s1; universe@39: strings[1] = s2; universe@39: size_t strlen = s1.length + s2.length; universe@39: for (size_t i=2;i= s.length) { universe@39: new_sstr.ptr = NULL; universe@39: new_sstr.length = 0; universe@39: } else { universe@39: if (length > s.length-start) { universe@39: length = s.length-start; universe@39: } universe@39: new_sstr.ptr = &s.ptr[start]; universe@39: new_sstr.length = length; universe@39: } universe@39: return new_sstr; universe@39: } universe@39: universe@39: sstr_t sstrchr(sstr_t s, int c) { universe@39: for(size_t i=0;i 0) { universe@39: for(size_t i=s.length;i>0;i--) { universe@39: if(s.ptr[i-1] == c) { universe@39: return sstrsubs(s, i-1); universe@39: } universe@39: } universe@39: } universe@39: sstr_t n; universe@39: n.ptr = NULL; universe@39: n.length = 0; universe@39: return n; universe@39: } universe@39: universe@39: sstr_t sstrstr(sstr_t string, sstr_t match) { universe@39: if (match.length == 0) { universe@39: return string; universe@39: } universe@39: universe@39: for (size_t i = 0 ; i < string.length ; i++) { universe@39: sstr_t substr = sstrsubs(string, i); universe@39: if (sstrprefix(substr, match)) { universe@39: return substr; universe@39: } universe@39: } universe@39: universe@39: sstr_t emptystr; universe@39: emptystr.length = 0; universe@39: emptystr.ptr = NULL; universe@39: return emptystr; universe@39: } universe@39: universe@39: sstr_t* sstrsplit(sstr_t s, sstr_t d, ssize_t *n) { universe@39: return sstrsplit_a(ucx_default_allocator(), s, d, n); universe@39: } universe@39: universe@39: sstr_t* sstrsplit_a(UcxAllocator *allocator, sstr_t s, sstr_t d, ssize_t *n) { universe@39: if (s.length == 0 || d.length == 0) { universe@39: *n = -1; universe@39: return NULL; universe@39: } universe@39: universe@39: sstr_t* result; universe@39: ssize_t nmax = *n; universe@39: *n = 1; universe@39: universe@39: /* special case: exact match - no processing needed */ universe@39: if (sstrcmp(s, d) == 0) { universe@39: *n = 0; universe@39: return NULL; universe@39: } universe@39: sstr_t sv = sstrdup(s); universe@39: if (sv.length == 0) { universe@39: *n = -2; universe@39: return NULL; universe@39: } universe@39: universe@39: for (size_t i = 0 ; i < s.length ; i++) { universe@39: sstr_t substr = sstrsubs(sv, i); universe@39: if (sstrprefix(substr, d)) { universe@39: (*n)++; universe@39: for (size_t j = 0 ; j < d.length ; j++) { universe@39: sv.ptr[i+j] = 0; universe@39: } universe@39: i += d.length - 1; // -1, because the loop will do a i++ universe@39: } universe@39: if ((*n) == nmax) break; universe@39: } universe@39: result = (sstr_t*) almalloc(allocator, sizeof(sstr_t)*(*n)); universe@39: universe@39: if (result) { universe@39: char *pptr = sv.ptr; universe@39: for (ssize_t i = 0 ; i < *n ; i++) { universe@39: size_t l = strlen(pptr); universe@39: char* ptr = (char*) almalloc(allocator, l + 1); universe@39: if (ptr) { universe@39: memcpy(ptr, pptr, l); universe@39: ptr[l] = 0; universe@39: universe@39: result[i] = sstrn(ptr, l); universe@39: pptr += l + d.length; universe@39: } else { universe@39: for (ssize_t j = i-1 ; j >= 0 ; j--) { universe@39: alfree(allocator, result[j].ptr); universe@39: } universe@39: alfree(allocator, result); universe@39: *n = -2; universe@39: break; universe@39: } universe@39: } universe@39: } else { universe@39: *n = -2; universe@39: } universe@39: universe@39: free(sv.ptr); universe@39: universe@39: return result; universe@39: } universe@39: universe@39: int sstrcmp(sstr_t s1, sstr_t s2) { universe@39: if (s1.length == s2.length) { universe@39: return memcmp(s1.ptr, s2.ptr, s1.length); universe@39: } else if (s1.length > s2.length) { universe@39: return 1; universe@39: } else { universe@39: return -1; universe@39: } universe@39: } universe@39: universe@39: int sstrcasecmp(sstr_t s1, sstr_t s2) { universe@39: if (s1.length == s2.length) { universe@39: #ifdef _WIN32 universe@39: return _strnicmp(s1.ptr, s2.ptr, s1.length); universe@39: #else universe@39: return strncasecmp(s1.ptr, s2.ptr, s1.length); universe@39: #endif universe@39: } else if (s1.length > s2.length) { universe@39: return 1; universe@39: } else { universe@39: return -1; universe@39: } universe@39: } universe@39: universe@39: sstr_t sstrdup(sstr_t s) { universe@39: return sstrdup_a(ucx_default_allocator(), s); universe@39: } universe@39: universe@39: sstr_t sstrdup_a(UcxAllocator *allocator, sstr_t s) { universe@39: sstr_t newstring; universe@39: newstring.ptr = (char*)almalloc(allocator, s.length + 1); universe@39: if (newstring.ptr) { universe@39: newstring.length = s.length; universe@39: newstring.ptr[newstring.length] = 0; universe@39: universe@39: memcpy(newstring.ptr, s.ptr, s.length); universe@39: } else { universe@39: newstring.length = 0; universe@39: } universe@39: universe@39: return newstring; universe@39: } universe@39: universe@39: sstr_t sstrtrim(sstr_t string) { universe@39: sstr_t newstr = string; universe@39: universe@39: while (newstr.length > 0 && isspace(*newstr.ptr)) { universe@39: newstr.ptr++; universe@39: newstr.length--; universe@39: } universe@39: while (newstr.length > 0 && isspace(newstr.ptr[newstr.length-1])) { universe@39: newstr.length--; universe@39: } universe@39: universe@39: return newstr; universe@39: } universe@39: universe@39: int sstrprefix(sstr_t string, sstr_t prefix) { universe@39: if (string.length == 0) { universe@39: return prefix.length == 0; universe@39: } universe@39: if (prefix.length == 0) { universe@39: return 1; universe@39: } universe@39: universe@39: if (prefix.length > string.length) { universe@39: return 0; universe@39: } else { universe@39: return memcmp(string.ptr, prefix.ptr, prefix.length) == 0; universe@39: } universe@39: } universe@39: universe@39: int sstrsuffix(sstr_t string, sstr_t suffix) { universe@39: if (string.length == 0) { universe@39: return suffix.length == 0; universe@39: } universe@39: if (suffix.length == 0) { universe@39: return 1; universe@39: } universe@39: universe@39: if (suffix.length > string.length) { universe@39: return 0; universe@39: } else { universe@39: return memcmp(string.ptr+string.length-suffix.length, universe@39: suffix.ptr, suffix.length) == 0; universe@39: } universe@39: } universe@39: universe@39: sstr_t sstrlower(sstr_t string) { universe@39: sstr_t ret = sstrdup(string); universe@39: for (size_t i = 0; i < ret.length ; i++) { universe@39: ret.ptr[i] = tolower(ret.ptr[i]); universe@39: } universe@39: return ret; universe@39: } universe@39: universe@39: sstr_t sstrlower_a(UcxAllocator *allocator, sstr_t string) { universe@39: sstr_t ret = sstrdup_a(allocator, string); universe@39: for (size_t i = 0; i < ret.length ; i++) { universe@39: ret.ptr[i] = tolower(ret.ptr[i]); universe@39: } universe@39: return ret; universe@39: } universe@39: universe@39: sstr_t sstrupper(sstr_t string) { universe@39: sstr_t ret = sstrdup(string); universe@39: for (size_t i = 0; i < ret.length ; i++) { universe@39: ret.ptr[i] = toupper(ret.ptr[i]); universe@39: } universe@39: return ret; universe@39: } universe@39: universe@39: sstr_t sstrupper_a(UcxAllocator *allocator, sstr_t string) { universe@39: sstr_t ret = sstrdup_a(allocator, string); universe@39: for (size_t i = 0; i < ret.length ; i++) { universe@39: ret.ptr[i] = toupper(ret.ptr[i]); universe@39: } universe@39: return ret; universe@39: }