[286] | 1 | // This file is a part of Framsticks SDK. http://www.framsticks.com/ |
---|
| 2 | // Copyright (C) 1999-2015 Maciej Komosinski and Szymon Ulatowski. |
---|
| 3 | // See LICENSE.txt for details. |
---|
[109] | 4 | |
---|
| 5 | #include "sstringutils.h" |
---|
[382] | 6 | #include <common/virtfile/virtfile.h> |
---|
[375] | 7 | #include <common/log.h> |
---|
[109] | 8 | #include <common/nonstd.h> |
---|
[691] | 9 | #include <common/Convert.h> |
---|
[109] | 10 | |
---|
[529] | 11 | int loadSString(const char* filename, SString& s, const char* framsgmodule, const char* error, bool remove_cr) |
---|
[109] | 12 | { |
---|
[257] | 13 | VirtFILE *f; |
---|
| 14 | int ret = 0; |
---|
| 15 | if (f = Vfopen(filename, FOPEN_READ_BINARY)) |
---|
[109] | 16 | { |
---|
[529] | 17 | loadSString(f, s, remove_cr); |
---|
[257] | 18 | ret = 1; |
---|
[523] | 19 | delete f; |
---|
[109] | 20 | } |
---|
[257] | 21 | else if (framsgmodule) |
---|
[691] | 22 | logPrintf(framsgmodule, "loadSString", LOG_WARN, error ? error : "Can't open file \"%s\"", filename); |
---|
[257] | 23 | return ret; |
---|
[109] | 24 | } |
---|
| 25 | |
---|
[529] | 26 | void loadSString(VirtFILE *f, SString& s, bool remove_cr) |
---|
[109] | 27 | { |
---|
[257] | 28 | char buf[1024]; |
---|
| 29 | int len; |
---|
| 30 | while (!f->Veof()) |
---|
[109] | 31 | { |
---|
[523] | 32 | len = f->Vread(buf, 1, sizeof(buf)); |
---|
[257] | 33 | s.append(buf, len); |
---|
[109] | 34 | } |
---|
[529] | 35 | if (remove_cr) |
---|
| 36 | removeCR(s); |
---|
[109] | 37 | } |
---|
| 38 | |
---|
| 39 | //load single line, discarding any \r or \n found at the end, return false if nothing could be loaded (error or eof) |
---|
[257] | 40 | bool loadSStringLine(VirtFILE* f, SString& s) |
---|
[109] | 41 | { |
---|
[257] | 42 | char buf[100]; |
---|
| 43 | bool eolfound = false; |
---|
| 44 | bool ret = false; |
---|
| 45 | s = SString::empty(); |
---|
| 46 | while (!eolfound) |
---|
[109] | 47 | { |
---|
[523] | 48 | char *r = f->Vgets(buf, sizeof(buf)); |
---|
[257] | 49 | if (r == NULL) break; |
---|
| 50 | ret = true; |
---|
| 51 | int d = strlen(r); |
---|
| 52 | if (d > 0) |
---|
[109] | 53 | { |
---|
[257] | 54 | if (r[d - 1] == '\n') { d--; eolfound = true; } |
---|
| 55 | if (d > 0) if (r[d - 1] == '\r') d--; |
---|
| 56 | s += SString(r, d); |
---|
[109] | 57 | } |
---|
| 58 | } |
---|
[257] | 59 | return ret; |
---|
[109] | 60 | } |
---|
| 61 | |
---|
| 62 | ////////////////////////// |
---|
| 63 | |
---|
| 64 | /** "x~xx~xxx" -> "x\~xx\~xxx" */ |
---|
| 65 | int quoteTilde(SString &target) |
---|
| 66 | { |
---|
[348] | 67 | const char* x = target.c_str(); |
---|
[257] | 68 | SString tmp; |
---|
| 69 | char *f; |
---|
| 70 | while (1) |
---|
[109] | 71 | { |
---|
[257] | 72 | f = strchr((char*)x, '~'); |
---|
| 73 | if (f) |
---|
[109] | 74 | { |
---|
[257] | 75 | tmp.append(x, f - x); |
---|
| 76 | tmp += "\\~"; |
---|
| 77 | x = f + 1; |
---|
[109] | 78 | } |
---|
[257] | 79 | else |
---|
[109] | 80 | { |
---|
[257] | 81 | if (tmp.len() == 0) return 0; // nothing was changed! |
---|
| 82 | tmp += x; |
---|
| 83 | target = tmp; |
---|
| 84 | return 1; |
---|
[109] | 85 | } |
---|
| 86 | } |
---|
| 87 | } |
---|
| 88 | |
---|
| 89 | /** "x\~xx\~xxx" -> "x~xx~xxx" */ |
---|
| 90 | int unquoteTilde(SString &target) |
---|
| 91 | { |
---|
[348] | 92 | const char* x = target.c_str(); |
---|
[257] | 93 | SString tmp; |
---|
| 94 | char *f; |
---|
| 95 | while (1) |
---|
[109] | 96 | { |
---|
[257] | 97 | f = strchr((char*)x, '\\'); |
---|
| 98 | if (f) |
---|
[109] | 99 | { |
---|
[257] | 100 | tmp.append(x, f - x); |
---|
| 101 | if (f[1] == '~') |
---|
[109] | 102 | { |
---|
[257] | 103 | tmp += '~'; |
---|
| 104 | x = f + 2; |
---|
[109] | 105 | } |
---|
[257] | 106 | else |
---|
[109] | 107 | { |
---|
[257] | 108 | tmp += "\\"; |
---|
| 109 | x = f + 1; |
---|
[109] | 110 | } |
---|
| 111 | } |
---|
[257] | 112 | else |
---|
[109] | 113 | { |
---|
[257] | 114 | if (tmp.len() == 0) return 0; // nothing was changed! |
---|
| 115 | tmp += x; |
---|
| 116 | target = tmp; |
---|
| 117 | return 1; |
---|
[109] | 118 | } |
---|
| 119 | } |
---|
| 120 | } |
---|
| 121 | |
---|
| 122 | ///////////////// |
---|
| 123 | |
---|
[257] | 124 | bool strContainsOneOf(const char* str, const char* chars) |
---|
[109] | 125 | { |
---|
[257] | 126 | while (*str) |
---|
[109] | 127 | { |
---|
[257] | 128 | if (strchr(chars, *str)) return 1; |
---|
| 129 | str++; |
---|
[109] | 130 | } |
---|
[257] | 131 | return 0; |
---|
[109] | 132 | } |
---|
| 133 | |
---|
| 134 | ////////////// |
---|
| 135 | |
---|
| 136 | bool sstringQuote(SString& target) |
---|
| 137 | { |
---|
[348] | 138 | const char* x = target.c_str(); |
---|
[257] | 139 | bool changed = 0; |
---|
| 140 | SString tmp; |
---|
| 141 | tmp.memoryHint(target.len()); |
---|
| 142 | while (*x) |
---|
[109] | 143 | { |
---|
[257] | 144 | switch (*x) |
---|
[109] | 145 | { |
---|
[257] | 146 | case '\n': tmp += "\\n"; changed = 1; break; |
---|
| 147 | case '\r': tmp += "\\r"; changed = 1; break; |
---|
| 148 | case '\t': tmp += "\\t"; changed = 1; break; |
---|
| 149 | case '\"': tmp += "\\\""; changed = 1; break; |
---|
| 150 | case '\\': tmp += "\\\\"; changed = 1; break; |
---|
| 151 | default: tmp += *x; |
---|
[109] | 152 | } |
---|
[257] | 153 | x++; |
---|
[109] | 154 | } |
---|
[257] | 155 | if (changed) target = tmp; |
---|
| 156 | return changed; |
---|
[109] | 157 | } |
---|
| 158 | |
---|
[786] | 159 | SString sstringDelimitAndShorten(const SString &in, int maxlen, bool show_length, const SString& before, const SString& after) |
---|
[785] | 160 | { |
---|
| 161 | SString out; |
---|
| 162 | if (in.len() > maxlen) |
---|
[786] | 163 | out = in.substr(0, maxlen / 2) + "..." + in.substr(in.len() - maxlen + maxlen / 2); |
---|
[785] | 164 | else |
---|
[786] | 165 | { |
---|
| 166 | out = in; show_length = false; |
---|
| 167 | } |
---|
[785] | 168 | sstringQuote(out); |
---|
[786] | 169 | out = before + out + after; |
---|
| 170 | if (show_length) |
---|
| 171 | out += SString::sprintf(" (length %d)", in.len()); |
---|
[785] | 172 | return out; |
---|
| 173 | } |
---|
| 174 | |
---|
[109] | 175 | const char* skipQuoteString(const char* txt, const char* limit) |
---|
| 176 | { |
---|
[257] | 177 | while (*txt) |
---|
[109] | 178 | { |
---|
[257] | 179 | if (*txt == '\"') return txt; |
---|
| 180 | if (*txt == '\\') txt++; |
---|
| 181 | txt++; |
---|
| 182 | if (txt == limit) break; |
---|
[109] | 183 | } |
---|
[257] | 184 | return txt; |
---|
[109] | 185 | } |
---|
| 186 | |
---|
| 187 | int sstringUnquote(SString &target) |
---|
| 188 | { |
---|
[348] | 189 | const char* x = target.c_str(); |
---|
[257] | 190 | SString tmp; |
---|
| 191 | char *f; |
---|
| 192 | while (1) |
---|
[109] | 193 | { |
---|
[257] | 194 | f = strchr((char*)x, '\\'); |
---|
| 195 | if (f) |
---|
[109] | 196 | { |
---|
[257] | 197 | tmp.append(x, f - x); |
---|
| 198 | switch (f[1]) |
---|
[109] | 199 | { |
---|
[257] | 200 | case 'n': tmp += '\n'; break; |
---|
| 201 | case 'r': tmp += '\r'; break; |
---|
| 202 | case 't': tmp += '\t'; break; |
---|
| 203 | case '\"': tmp += '\"'; break; |
---|
| 204 | default: tmp += f[1]; |
---|
[109] | 205 | } |
---|
[257] | 206 | x = f + 2; |
---|
[109] | 207 | } |
---|
[257] | 208 | else |
---|
[109] | 209 | { |
---|
[257] | 210 | if (tmp.len() == 0) return 0; // nothing was changed! |
---|
| 211 | tmp += x; |
---|
| 212 | target = tmp; |
---|
| 213 | return 1; |
---|
[109] | 214 | } |
---|
| 215 | } |
---|
| 216 | } |
---|
| 217 | |
---|
[257] | 218 | int strFindField(const SString& txt, const SString& name, int &end) |
---|
[109] | 219 | { |
---|
[348] | 220 | const char* t = txt.c_str(), *n; |
---|
[257] | 221 | int pos = 0; |
---|
| 222 | while (1) |
---|
[109] | 223 | { |
---|
[257] | 224 | n = strchr(t + pos, ','); |
---|
[348] | 225 | if ((!strncmp(t + pos, name.c_str(), name.len())) && (t[pos + name.len()] == '=')) |
---|
[109] | 226 | { |
---|
[257] | 227 | if (n) end = n - t; else end = txt.len(); |
---|
| 228 | return pos; |
---|
[109] | 229 | } |
---|
[257] | 230 | if (n) pos = n - t + 1; else break; |
---|
[109] | 231 | } |
---|
[257] | 232 | return -1; |
---|
[109] | 233 | } |
---|
| 234 | |
---|
[257] | 235 | SString strGetField(const SString& txt, const SString& name) |
---|
[109] | 236 | { |
---|
[257] | 237 | int p, e; |
---|
| 238 | p = strFindField(txt, name, e); |
---|
| 239 | if (p < 0) return SString(); |
---|
| 240 | p += name.len() + 1; |
---|
| 241 | return SString(txt.substr(p, e - p)); |
---|
[109] | 242 | } |
---|
| 243 | |
---|
[257] | 244 | void strSetField(SString& txt, const SString& name, const SString& value) |
---|
[109] | 245 | { |
---|
[257] | 246 | int p, e; |
---|
| 247 | p = strFindField(txt, name, e); |
---|
| 248 | if (p < 0) |
---|
[109] | 249 | { |
---|
[257] | 250 | if (!value.len()) return; |
---|
| 251 | char *t = txt.directAppend(1 + name.len() + value.len()); |
---|
| 252 | char *b = t; |
---|
| 253 | if (txt.len()) *(t++) = ','; |
---|
[348] | 254 | strcpy(t, name.c_str()); t += name.len(); |
---|
[257] | 255 | *(t++) = '='; |
---|
[348] | 256 | strcpy(t, value.c_str()); t += value.len(); |
---|
[257] | 257 | txt.endAppend(t - b); |
---|
[109] | 258 | } |
---|
[257] | 259 | else |
---|
[109] | 260 | { |
---|
[257] | 261 | if (!value.len()) |
---|
[109] | 262 | { |
---|
[257] | 263 | if (p > 0) p--; else if (e < txt.len()) e++; |
---|
| 264 | char *t = txt.directWrite(0); |
---|
| 265 | memmove(t + p, t + e, txt.len() - e); |
---|
| 266 | txt.endWrite(txt.len() + value.len() - (e - p)); |
---|
[109] | 267 | } |
---|
[257] | 268 | else |
---|
[109] | 269 | { |
---|
[257] | 270 | p += name.len() + 1; |
---|
| 271 | char *t = txt.directWrite(txt.len() + value.len() - (e - p)); |
---|
| 272 | memmove(t + p + value.len(), t + e, txt.len() - e); |
---|
[348] | 273 | memmove(t + p, value.c_str(), value.len()); |
---|
[257] | 274 | txt.endWrite(txt.len() + value.len() - (e - p)); |
---|
[109] | 275 | } |
---|
| 276 | } |
---|
| 277 | } |
---|
| 278 | |
---|
[512] | 279 | SString trim(const SString& s) |
---|
[109] | 280 | { |
---|
[348] | 281 | const unsigned char*b = (const unsigned char*)s.c_str(); |
---|
[257] | 282 | const unsigned char*e = b + s.len(); |
---|
| 283 | while ((b < e) && (*b <= ' ')) b++; |
---|
| 284 | while ((b < e) && (e[-1] <= ' ')) e--; |
---|
| 285 | if ((e - b) == s.len()) return s; |
---|
| 286 | SString newstring; |
---|
| 287 | char* t = newstring.directWrite(e - b); |
---|
| 288 | memmove(t, b, e - b); |
---|
| 289 | newstring.endWrite(e - b); |
---|
| 290 | return newstring; |
---|
[109] | 291 | } |
---|
| 292 | |
---|
[904] | 293 | SString concatPath(const SString& in1,const SString& in2) |
---|
| 294 | { |
---|
| 295 | SString out=in1; |
---|
| 296 | if (out.len()>0 && out[out.len()-1]!=PATH_SEPARATOR_CHAR) |
---|
| 297 | out+=PATH_SEPARATOR_CHAR; |
---|
| 298 | out+=in2; |
---|
| 299 | return out; |
---|
| 300 | } |
---|
| 301 | |
---|
[109] | 302 | bool removeCR(SString& s) |
---|
| 303 | { |
---|
[348] | 304 | const char* p = s.c_str(); |
---|
[257] | 305 | const char* cr = strchr(p, '\r'); |
---|
| 306 | if (!cr) return false; |
---|
| 307 | char* begin = s.directWrite(); |
---|
| 308 | char* src = begin + (cr - p), *dst = src; |
---|
| 309 | while (*src) |
---|
| 310 | if (*src == '\r') |
---|
| 311 | src++; |
---|
| 312 | else |
---|
| 313 | *(dst++) = *(src++); |
---|
| 314 | s.endWrite(dst - begin); |
---|
| 315 | return true; |
---|
[109] | 316 | } |
---|
[210] | 317 | |
---|
[257] | 318 | bool matchWildcard(const SString& word, const SString& pattern) |
---|
[210] | 319 | { |
---|
[257] | 320 | if (pattern.len() == 0) |
---|
| 321 | return word.len() == 0; |
---|
| 322 | int aster = pattern.indexOf('*'); |
---|
| 323 | if (aster >= 0) |
---|
[210] | 324 | { |
---|
[257] | 325 | SString before = pattern.substr(0, aster); |
---|
| 326 | SString after = pattern.substr(aster + 1); |
---|
| 327 | if (!word.len()) return false; |
---|
[348] | 328 | if (before.len()) if (!word.startsWith(before.c_str())) return false; |
---|
[257] | 329 | if (after.len()) |
---|
| 330 | if ((word.len() < after.len()) |
---|
[348] | 331 | || (strcmp(after.c_str(), word.c_str() + word.len() - after.len()))) |
---|
[257] | 332 | return false; |
---|
| 333 | return true; |
---|
[210] | 334 | } |
---|
[257] | 335 | else |
---|
| 336 | return word == pattern; |
---|
[210] | 337 | } |
---|
| 338 | |
---|
[257] | 339 | bool matchWildcardList(const SString& word, const SString& patterns) |
---|
[210] | 340 | { |
---|
[257] | 341 | if (patterns.len() == 0) |
---|
| 342 | return word.len() == 0; |
---|
| 343 | int pos = 0; |
---|
| 344 | SString pattern; |
---|
| 345 | while (patterns.getNextToken(pos, pattern, ',')) |
---|
| 346 | if (matchWildcard(word, pattern)) |
---|
| 347 | return true; |
---|
| 348 | return false; |
---|
[210] | 349 | } |
---|
| 350 | |
---|
[691] | 351 | SString getUIDString(uint64_t uid, char prefix) |
---|
| 352 | { |
---|
| 353 | return SString::sprintf("%c" UINT64_FORMAT, prefix, uid); |
---|
| 354 | } |
---|
| 355 | |
---|
| 356 | bool parseUIDString(const char* str, char prefix, uint64_t &uid, bool err) |
---|
| 357 | { |
---|
| 358 | if ((str[0] == prefix) && (isdigit(str[1]))) |
---|
| 359 | { |
---|
| 360 | char* end; |
---|
| 361 | uid = strtoull(str + 1, &end, 10); |
---|
| 362 | if (end == (str + 1 + strlen(str + 1))) |
---|
| 363 | return true; |
---|
| 364 | } |
---|
| 365 | if (err) |
---|
| 366 | logPrintf("SString", "parseUIDString", LOG_ERROR, "Invalid uid: '%s'", str); |
---|
| 367 | return false; |
---|
| 368 | } |
---|