asar coverage - build #131

src/asar/
File: src/asar/libstr.h
Date: 2024-01-22 23:17:50
Lines:
230/238
96.6%
Functions:
54/55
98.2%
Branches:
423/636
66.5%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4 #include "libmisc.h"
5 #include <cstdint>
6 //ty alcaro
7 extern const unsigned char char_props[256];
8 5649698 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
9 static inline int to_upper(unsigned char c) { return c&~(char_props[c]&0x20); }
10
11
10/10
✓ Branch 0 taken 73488 times.
✓ Branch 1 taken 29046 times.
✓ Branch 2 taken 73398 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2583 times.
✓ Branch 7 taken 6594 times.
✓ Branch 8 taken 2637 times.
✓ Branch 9 taken 2583 times.
 763459 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 150059 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
13 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
14 3696 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
15 5142 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
16 inline bool is_alnum(unsigned char c) { return char_props[c] & 0x60; }
17 41228 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 393020 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 9504 times.
✓ Branch 1 taken 10212 times.
✓ Branch 2 taken 720 times.
✓ Branch 3 taken 243 times.
 41402 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 1939766 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 4463688 memcpy(dest, source, copy_length*sizeof(char));
24 1939766 return dest;
25 }
26
27 class string {
28 public:
29 6852881 const char *data() const
30 {
31
226/368
✓ Branch 0 taken 5024 times.
✓ Branch 1 taken 970218 times.
✓ Branch 2 taken 954719 times.
✓ Branch 3 taken 2970 times.
✓ Branch 4 taken 5246 times.
✓ Branch 5 taken 81690 times.
✓ Branch 6 taken 16347 times.
✓ Branch 7 taken 3997 times.
✓ Branch 8 taken 15883 times.
✓ Branch 9 taken 5289 times.
✓ Branch 10 taken 1629 times.
✓ Branch 11 taken 2305 times.
✓ Branch 12 taken 1152 times.
✓ Branch 13 taken 206 times.
✓ Branch 14 taken 1590 times.
✓ Branch 15 taken 472 times.
✓ Branch 16 taken 11377 times.
✓ Branch 17 taken 433 times.
✓ Branch 18 taken 504 times.
✓ Branch 19 taken 1052 times.
✓ Branch 20 taken 210 times.
✓ Branch 21 taken 5174 times.
✓ Branch 22 taken 1175 times.
✓ Branch 23 taken 381 times.
✓ Branch 24 taken 367 times.
✓ Branch 25 taken 144 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 668 times.
✓ Branch 28 taken 550 times.
✓ Branch 29 taken 108 times.
✓ Branch 30 taken 236 times.
✓ Branch 31 taken 540 times.
✓ Branch 32 taken 216 times.
✓ Branch 33 taken 80241 times.
✓ Branch 34 taken 48 times.
✓ Branch 35 taken 828 times.
✓ Branch 36 taken 1404 times.
✓ Branch 37 taken 84156 times.
✓ Branch 38 taken 783 times.
✓ Branch 39 taken 4825 times.
✓ Branch 40 taken 18 times.
✓ Branch 41 taken 5625 times.
✓ Branch 42 taken 3 times.
✓ Branch 43 taken 36 times.
✓ Branch 44 taken 48 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 54 times.
✓ Branch 47 taken 163 times.
✗ Branch 48 not taken.
✓ Branch 49 taken 42 times.
✓ Branch 50 taken 1141 times.
✓ Branch 51 taken 3 times.
✓ Branch 52 taken 1284 times.
✓ Branch 53 taken 64747 times.
✓ Branch 54 taken 15009 times.
✓ Branch 55 taken 129 times.
✗ Branch 56 not taken.
✓ Branch 57 taken 517 times.
✓ Branch 58 taken 15833 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 406 times.
✓ Branch 61 taken 66 times.
✓ Branch 62 taken 151 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 59304 times.
✓ Branch 65 taken 15012 times.
✓ Branch 66 taken 118 times.
✓ Branch 67 taken 36 times.
✗ Branch 68 not taken.
✓ Branch 69 taken 9 times.
✓ Branch 70 taken 57 times.
✓ Branch 71 taken 66780 times.
✓ Branch 72 taken 15468 times.
✓ Branch 73 taken 117 times.
✓ Branch 74 taken 177 times.
✗ Branch 75 not taken.
✓ Branch 76 taken 21 times.
✓ Branch 77 taken 171 times.
✓ Branch 78 taken 9 times.
✓ Branch 79 taken 3903 times.
✓ Branch 80 taken 9 times.
✓ Branch 81 taken 1077 times.
✓ Branch 82 taken 71 times.
✓ Branch 83 taken 6 times.
✓ Branch 84 taken 492 times.
✓ Branch 85 taken 27 times.
✗ Branch 86 not taken.
✓ Branch 87 taken 153 times.
✓ Branch 88 taken 46 times.
✗ Branch 89 not taken.
✓ Branch 90 taken 81 times.
✓ Branch 91 taken 136 times.
✗ Branch 92 not taken.
✓ Branch 93 taken 81 times.
✓ Branch 94 taken 148 times.
✗ Branch 95 not taken.
✓ Branch 96 taken 2889 times.
✓ Branch 97 taken 118 times.
✗ Branch 98 not taken.
✓ Branch 99 taken 2898 times.
✓ Branch 100 taken 21 times.
✓ Branch 101 taken 228 times.
✓ Branch 102 taken 17880 times.
✓ Branch 103 taken 45 times.
✓ Branch 104 taken 60 times.
✗ Branch 105 not taken.
✓ Branch 106 taken 21 times.
✓ Branch 107 taken 10837 times.
✗ Branch 108 not taken.
✓ Branch 109 taken 10837 times.
✓ Branch 110 taken 72 times.
✗ Branch 111 not taken.
✓ Branch 112 taken 15535 times.
✓ Branch 113 taken 18 times.
✗ Branch 114 not taken.
✓ Branch 115 taken 14 times.
✓ Branch 116 taken 337 times.
✗ Branch 117 not taken.
✓ Branch 118 taken 12 times.
✗ Branch 119 not taken.
✓ Branch 120 taken 15486 times.
✗ Branch 121 not taken.
✗ Branch 122 not taken.
✓ Branch 123 taken 99 times.
✗ Branch 124 not taken.
✓ Branch 125 taken 54 times.
✓ Branch 126 taken 24 times.
✓ Branch 127 taken 54 times.
✗ Branch 128 not taken.
✓ Branch 129 taken 54 times.
✓ Branch 130 taken 141 times.
✗ Branch 131 not taken.
✓ Branch 132 taken 24 times.
✗ Branch 133 not taken.
✗ Branch 134 not taken.
✓ Branch 135 taken 81 times.
✗ Branch 136 not taken.
✓ Branch 137 taken 12 times.
✓ Branch 138 taken 33 times.
✓ Branch 139 taken 9605 times.
✗ Branch 140 not taken.
✓ Branch 141 taken 75 times.
✓ Branch 142 taken 556 times.
✓ Branch 143 taken 45 times.
✗ Branch 144 not taken.
✓ Branch 145 taken 559 times.
✓ Branch 146 taken 123 times.
✓ Branch 147 taken 553 times.
✓ Branch 148 taken 36 times.
✗ Branch 149 not taken.
✓ Branch 150 taken 1780 times.
✓ Branch 151 taken 213 times.
✓ Branch 152 taken 81 times.
✗ Branch 153 not taken.
✓ Branch 154 taken 9 times.
✗ Branch 155 not taken.
✓ Branch 156 taken 18 times.
✗ Branch 157 not taken.
✗ Branch 158 not taken.
✓ Branch 159 taken 9 times.
✗ Branch 160 not taken.
✗ Branch 161 not taken.
✗ Branch 162 not taken.
✓ Branch 163 taken 12 times.
✗ Branch 164 not taken.
✓ Branch 165 taken 9 times.
✗ Branch 166 not taken.
✗ Branch 167 not taken.
✗ Branch 168 not taken.
✓ Branch 169 taken 12 times.
✗ Branch 170 not taken.
✓ Branch 171 taken 9 times.
✗ Branch 172 not taken.
✗ Branch 173 not taken.
✗ Branch 174 not taken.
✓ Branch 175 taken 90 times.
✗ Branch 176 not taken.
✓ Branch 177 taken 192 times.
✗ Branch 178 not taken.
✓ Branch 179 taken 180 times.
✗ Branch 180 not taken.
✓ Branch 181 taken 9 times.
✗ Branch 182 not taken.
✗ Branch 183 not taken.
✗ Branch 184 not taken.
✓ Branch 185 taken 75 times.
✗ Branch 186 not taken.
✓ Branch 187 taken 180 times.
✗ Branch 188 not taken.
✗ Branch 189 not taken.
✗ Branch 190 not taken.
✓ Branch 191 taken 9 times.
✗ Branch 192 not taken.
✓ Branch 193 taken 12 times.
✗ Branch 194 not taken.
✓ Branch 195 taken 18 times.
✗ Branch 196 not taken.
✓ Branch 197 taken 27 times.
✗ Branch 198 not taken.
✓ Branch 199 taken 27 times.
✗ Branch 200 not taken.
✓ Branch 201 taken 12 times.
✗ Branch 202 not taken.
✓ Branch 203 taken 18 times.
✗ Branch 204 not taken.
✓ Branch 205 taken 27 times.
✗ Branch 206 not taken.
✓ Branch 207 taken 27 times.
✗ Branch 208 not taken.
✓ Branch 209 taken 12 times.
✗ Branch 210 not taken.
✓ Branch 211 taken 9 times.
✗ Branch 212 not taken.
✓ Branch 213 taken 18 times.
✗ Branch 214 not taken.
✓ Branch 215 taken 27 times.
✗ Branch 216 not taken.
✓ Branch 217 taken 30 times.
✗ Branch 218 not taken.
✓ Branch 219 taken 18 times.
✗ Branch 220 not taken.
✓ Branch 221 taken 27 times.
✗ Branch 222 not taken.
✓ Branch 223 taken 27 times.
✗ Branch 224 not taken.
✓ Branch 225 taken 12 times.
✗ Branch 226 not taken.
✓ Branch 227 taken 9 times.
✗ Branch 228 not taken.
✓ Branch 229 taken 9 times.
✗ Branch 230 not taken.
✓ Branch 231 taken 18 times.
✗ Branch 232 not taken.
✓ Branch 233 taken 30 times.
✗ Branch 234 not taken.
✓ Branch 235 taken 27 times.
✗ Branch 236 not taken.
✓ Branch 237 taken 9 times.
✗ Branch 238 not taken.
✓ Branch 239 taken 18 times.
✗ Branch 240 not taken.
✓ Branch 241 taken 27 times.
✗ Branch 242 not taken.
✓ Branch 243 taken 51 times.
✗ Branch 244 not taken.
✓ Branch 245 taken 81 times.
✗ Branch 246 not taken.
✓ Branch 247 taken 9 times.
✗ Branch 248 not taken.
✓ Branch 249 taken 42 times.
✗ Branch 250 not taken.
✓ Branch 251 taken 99 times.
✗ Branch 252 not taken.
✓ Branch 253 taken 27 times.
✗ Branch 254 not taken.
✓ Branch 255 taken 33 times.
✗ Branch 256 not taken.
✓ Branch 257 taken 81 times.
✗ Branch 258 not taken.
✓ Branch 259 taken 27 times.
✗ Branch 260 not taken.
✓ Branch 261 taken 51 times.
✗ Branch 262 not taken.
✓ Branch 263 taken 99 times.
✗ Branch 264 not taken.
✓ Branch 265 taken 18 times.
✗ Branch 266 not taken.
✓ Branch 267 taken 42 times.
✗ Branch 268 not taken.
✓ Branch 269 taken 81 times.
✗ Branch 270 not taken.
✓ Branch 271 taken 45 times.
✗ Branch 272 not taken.
✓ Branch 273 taken 117 times.
✗ Branch 274 not taken.
✓ Branch 275 taken 27 times.
✗ Branch 276 not taken.
✓ Branch 277 taken 51 times.
✗ Branch 278 not taken.
✓ Branch 279 taken 99 times.
✗ Branch 280 not taken.
✓ Branch 281 taken 81 times.
✗ Branch 282 not taken.
✓ Branch 283 taken 234 times.
✗ Branch 284 not taken.
✓ Branch 285 taken 99 times.
✗ Branch 286 not taken.
✓ Branch 287 taken 243 times.
✗ Branch 288 not taken.
✓ Branch 289 taken 300 times.
✓ Branch 290 taken 3 times.
✓ Branch 291 taken 798 times.
✗ Branch 292 not taken.
✓ Branch 293 taken 117 times.
✗ Branch 294 not taken.
✓ Branch 295 taken 297 times.
✗ Branch 296 not taken.
✓ Branch 297 taken 234 times.
✗ Branch 298 not taken.
✓ Branch 299 taken 378 times.
✗ Branch 300 not taken.
✓ Branch 301 taken 126 times.
✗ Branch 302 not taken.
✓ Branch 303 taken 324 times.
✗ Branch 304 not taken.
✓ Branch 305 taken 237 times.
✓ Branch 306 taken 3 times.
✓ Branch 307 taken 393 times.
✗ Branch 308 not taken.
✓ Branch 309 taken 126 times.
✗ Branch 310 not taken.
✓ Branch 311 taken 270 times.
✗ Branch 312 not taken.
✓ Branch 313 taken 1170 times.
✓ Branch 314 taken 34983 times.
✓ Branch 315 taken 5787 times.
✓ Branch 316 taken 30456 times.
✓ Branch 317 taken 54 times.
✓ Branch 318 taken 5763 times.
✓ Branch 319 taken 24 times.
✓ Branch 320 taken 9 times.
✓ Branch 321 taken 24 times.
✗ Branch 322 not taken.
✓ Branch 323 taken 9 times.
✓ Branch 324 taken 72 times.
✗ Branch 325 not taken.
✓ Branch 326 taken 9 times.
✗ Branch 327 not taken.
✓ Branch 328 taken 9 times.
✗ Branch 329 not taken.
✓ Branch 330 taken 9 times.
✗ Branch 331 not taken.
✓ Branch 332 taken 9 times.
✗ Branch 333 not taken.
✓ Branch 334 taken 9 times.
✗ Branch 335 not taken.
✓ Branch 336 taken 9 times.
✗ Branch 337 not taken.
✓ Branch 338 taken 9 times.
✗ Branch 339 not taken.
✗ Branch 340 not taken.
✗ Branch 341 not taken.
✓ Branch 342 taken 9 times.
✗ Branch 343 not taken.
✓ Branch 344 taken 9 times.
✗ Branch 345 not taken.
✓ Branch 346 taken 9 times.
✗ Branch 347 not taken.
✗ Branch 348 not taken.
✗ Branch 349 not taken.
✓ Branch 350 taken 9 times.
✗ Branch 351 not taken.
✓ Branch 352 taken 9 times.
✗ Branch 353 not taken.
✗ Branch 354 not taken.
✗ Branch 355 not taken.
✓ Branch 356 taken 9 times.
✗ Branch 357 not taken.
✓ Branch 358 taken 9 times.
✗ Branch 359 not taken.
✓ Branch 360 taken 9 times.
✗ Branch 361 not taken.
✗ Branch 362 not taken.
✗ Branch 363 not taken.
✓ Branch 364 taken 9 times.
✗ Branch 365 not taken.
✗ Branch 366 not taken.
✗ Branch 367 not taken.
 9875271 return cached_data;
32 }
33
34 183079 char *temp_raw() const //things to cleanup and take a look at
35 {
36
4/8
✓ Branch 0 taken 161868 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6897 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2205 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 180 times.
✗ Branch 7 not taken.
 391559 return cached_data;
37 }
38
39 3242450 char *raw() const
40 {
41
5/8
✓ Branch 0 taken 2106 times.
✓ Branch 1 taken 82890 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 9 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 36 times.
 7305781 return cached_data;
42 }
43
44 6700567 int length() const
45 {
46
2/2
✓ Branch 0 taken 6547222 times.
✓ Branch 1 taken 153345 times.
 15345792 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 6777440 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 38416 times.
✓ Branch 1 taken 6739024 times.
 6777440 if(length > max_inline_length_){
52 38416 inlined.len = (unsigned char)-1;
53 38416 allocated.len = length;
54 }else{
55 6739024 inlined.len = length;
56 }
57 6777440 }
58
59 1170 void truncate(int newlen)
60 {
61 2340 resize(newlen);
62 2340 }
63
64 1973219 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 236 times.
✓ Branch 1 taken 1972983 times.
 1973219 if (!newstr) newstr = "";
67 1973219 assign(newstr, strlen(newstr));
68 1973219 }
69
70 1324912 void assign(const string &newstr)
71 {
72 1324912 assign(newstr, newstr.length());
73 1324912 }
74
75 3550778 void assign(const char * newstr, int end)
76 {
77 3550778 resize(end);
78 3550778 copy(newstr, length(), cached_data);
79 3550778 }
80
81
82 355750 string& operator=(const char * newstr)
83 {
84 793932 assign(newstr);
85 365000 return *this;
86 }
87
88 413571 string& operator=(const string &newstr)
89 {
90 535625 assign(newstr);
91 445116 return *this;
92 }
93
94 string& append(const string& other, int start, int end)
95 {
96 int current_end = length();
97 resize(length() + end - start);
98 copy(other.cached_data + start, end - start, cached_data + current_end);
99 return *this;
100 }
101
102 9564 string& append(const char *other, int start, int end)
103 {
104 4785 int current_end = length();
105 9564 resize(length() + end - start);
106 9564 copy(other + start, end - start, cached_data + current_end);
107 9564 return *this;
108 }
109
110 215440 string& operator+=(const string& other)
111 {
112 84065 int current_end = length();
113 215440 resize(length() + other.length());
114 346815 copy(other.cached_data, other.length(), cached_data + current_end);
115 215440 return *this;
116 }
117
118 666508 string& operator+=(const char *other)
119 {
120 287977 int current_end = length();
121 666508 int otherlen=(int)strlen(other);
122 666508 resize(length() + otherlen);
123 666508 copy(other, otherlen, cached_data + current_end);
124 666508 return *this;
125 }
126
127 2332584 string& operator+=(char c)
128 {
129 2332584 resize(length() + 1);
130 3687167 cached_data[length() - 1] = c;
131 2332584 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 56516 string operator+(const char * right) const
142 {
143 56516 string ret=*this;
144
1/2
✓ Branch 0 taken 56516 times.
✗ Branch 1 not taken.
 147681 ret+=right;
145 62112 return ret;
146 ✗ }
147
148 20224 bool operator==(const char * right) const
149 {
150 20224 return !strcmp(data(), right);
151 }
152
153 222 bool operator==(const string& right) const
154 {
155 222 return !strcmp(data(), right.data());
156 }
157
158 27565 bool operator!=(const char * right) const
159 {
160 27565 return (strcmp(data(), right) != 0);
161 }
162
163 bool operator!=(const string& right) const
164 {
165 return (strcmp(data(), right.data()) != 0);
166 }
167
168 3796167 operator const char*() const
169 {
170 3796167 return data();
171 }
172
173 34800 explicit operator bool() const
174 {
175 34800 return length();
176 }
177
178 4421442 string()
179 4421442 {
180 //todo reduce I know this isn't all needed
181 4421442 allocated.bufferlen = 0;
182 4421442 allocated.str = 0;
183 4421442 allocated.len = 0;
184 4421442 inlined.len = 0;
185 4421442 cached_data = inlined.str;
186 4421442 next_resize = max_inline_length_+1;
187
188 3456376 }
189 983665 string(const char * newstr) : string()
190 {
191
1/2
✓ Branch 0 taken 448125 times.
✗ Branch 1 not taken.
 983665 assign(newstr);
192 888480 }
193 219975 string(const char * newstr, int newlen) : string()
194 {
195
1/2
✓ Branch 0 taken 100311 times.
✗ Branch 1 not taken.
 219975 assign(newstr, newlen);
196 219948 }
197 195622 string(const string& old) : string()
198 {
199
1/2
✓ Branch 0 taken 80521 times.
✗ Branch 1 not taken.
 195622 assign(old.data());
200 195301 }
201
202 24954 string(string &&move) : string()
203 {
204
1/2
✓ Branch 0 taken 9228 times.
✗ Branch 1 not taken.
 9228 *this = move;
205 24954 }
206
207 387237 string& operator=(string&& move)
208 {
209
2/2
✓ Branch 0 taken 81 times.
✓ Branch 1 taken 137589 times.
 137751 if(!is_inlined()) free(allocated.str);
210
2/2
✓ Branch 0 taken 107 times.
✓ Branch 1 taken 137563 times.
 387237 if(!move.is_inlined()){
211 226 allocated.str = move.allocated.str;
212 226 allocated.bufferlen = move.allocated.bufferlen;
213 226 set_length(move.allocated.len);
214
215 226 move.inlined.len = 0;
216 226 move.inlined.str[0] = 0;
217 226 cached_data = allocated.str;
218 226 next_resize = move.next_resize;
219
220 }else{
221 387011 inlined.len = 0;
222 387011 cached_data = inlined.str;
223 387011 next_resize = max_inline_length_+1;
224 387011 assign(move);
225 }
226 387237 return *this;
227 }
228
229 10915848 ~string()
230 {
231
2/2
✓ Branch 0 taken 10343 times.
✓ Branch 1 taken 1892881 times.
 6409536 if(!is_inlined()){
232 34093 free(allocated.str);
233 }
234 10915848 }
235
236 //maybe these should return refs to chain. but also good not to encourage chaining
237 4963 void strip_prefix(char c)
238 {
239
2/2
✓ Branch 0 taken 1418 times.
✓ Branch 1 taken 3545 times.
 4963 if(cached_data[0] == c){
240
3/6
✓ Branch 0 taken 710 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 710 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 710 times.
✗ Branch 5 not taken.
 1418 *this = string(cached_data + 1, length() - 1);
241 }
242 4963 }
243
244 void strip_suffix(char c)
245 {
246 if(cached_data[length() - 1] == c){
247 truncate(length() - 1);
248 }
249 }
250
251 string& qreplace(const char * instr, const char * outstr);
252 string& qnormalize();
253
254 // RPG Hacker: My hack shmeck to get around no longer supporting text mode.
255 // Symbol files are currently the only thing that use text mode, anyways, and I don't even know
256 // if the emulators that read them care about line endings.
257 ✗ string& convert_line_endings_to_native()
258 {
259 #if defined(windows)
260 // RPG Hacker: This is quite stinky, but doing the replacement directly will lead to a dead-lock.
261 // \x08 = backspace should never appear inside a string, so I'm abusing it here.
262 ✗ return qreplace("\n", "\x08").qreplace("\x08", "\r\n");
263 #else
264 ✗ return *this;
265 #endif
266 }
267
268 #ifdef SERIALIZER
269 void serialize(serializer & s)
270 {
271 s(str, allocated.bufferlen);
272 set_length(strlen(str));
273 }
274 #endif
275 #define SERIALIZER_BANNED
276
277 private:
278 static const int scale_factor = 4; //scale sso
279 static const int max_inline_length_ = ((sizeof(char *) + sizeof(int) * 2) * scale_factor) - 2;
280 char *cached_data;
281 int next_resize;
282 struct si{
283 char str[max_inline_length_ + 1];
284 unsigned char len;
285 };
286
287 struct sa{
288 char *str;
289 int len;
290 int bufferlen ;
291 };
292 union{
293 si inlined;
294 sa allocated;
295 };
296
297
298 6777214 void resize(int new_length)
299 {
300 2908192 const char *old_data = data();
301
8/8
✓ Branch 0 taken 6756061 times.
✓ Branch 1 taken 21153 times.
✓ Branch 2 taken 8513 times.
✓ Branch 3 taken 2899098 times.
✓ Branch 4 taken 921 times.
✓ Branch 5 taken 7484 times.
✓ Branch 6 taken 11163 times.
✓ Branch 7 taken 2897029 times.
 6786875 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
302
7/8
✓ Branch 0 taken 21153 times.
✓ Branch 1 taken 1029 times.
✓ Branch 2 taken 418 times.
✓ Branch 3 taken 10190 times.
✓ Branch 4 taken 418 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 10242 times.
✓ Branch 7 taken 921 times.
 22548 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
303 21153 int new_size = bitround(new_length + 1);
304
2/2
✓ Branch 0 taken 20369 times.
✓ Branch 1 taken 784 times.
 21153 if(old_data == inlined.str){
305
1/2
✓ Branch 0 taken 10545 times.
✗ Branch 1 not taken.
 30914 allocated.str = copy(old_data, min(length(), new_length), (char *)malloc(new_size));
306 }else{
307 784 allocated.str = (char *)realloc(allocated.str, new_size);
308 418 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
309 }
310 21153 allocated.bufferlen = new_size;
311 21153 cached_data = allocated.str;
312 21153 next_resize = allocated.bufferlen;
313
5/6
✓ Branch 0 taken 921 times.
✓ Branch 1 taken 108 times.
✓ Branch 2 taken 921 times.
✓ Branch 3 taken 108 times.
✓ Branch 4 taken 921 times.
✗ Branch 5 not taken.
 1029 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
314 1029 copy(old_data, new_length, inlined.str);
315 1029 cached_data = inlined.str;
316 1029 next_resize = max_inline_length_+1;
317 }
318
5/6
✓ Branch 0 taken 1029 times.
✓ Branch 1 taken 21153 times.
✓ Branch 2 taken 1029 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 921 times.
✓ Branch 5 taken 10242 times.
 22182 if(old_data != inlined.str && old_data != data()){
319 1029 free((char *)old_data);
320 }
321 }
322 6777214 set_length(new_length);
323
324 6777214 raw()[new_length] = 0; //always ensure null terminator
325 6777214 }
326
327 11787323 bool is_inlined() const
328 {
329
51/82
✓ Branch 0 taken 1080485 times.
✓ Branch 1 taken 2655717 times.
✓ Branch 2 taken 988086 times.
✓ Branch 3 taken 1206544 times.
✓ Branch 4 taken 15592 times.
✓ Branch 5 taken 1945 times.
✓ Branch 6 taken 354 times.
✓ Branch 7 taken 9 times.
✓ Branch 8 taken 41427 times.
✓ Branch 9 taken 1596109 times.
✓ Branch 10 taken 33967 times.
✓ Branch 11 taken 858589 times.
✓ Branch 12 taken 148399 times.
✓ Branch 13 taken 214222 times.
✓ Branch 14 taken 1113351 times.
✓ Branch 15 taken 70813 times.
✓ Branch 16 taken 2503956 times.
✓ Branch 17 taken 3585 times.
✓ Branch 18 taken 824365 times.
✓ Branch 19 taken 1437 times.
✓ Branch 20 taken 237285 times.
✓ Branch 21 taken 900 times.
✓ Branch 22 taken 239377 times.
✓ Branch 23 taken 3221 times.
✓ Branch 24 taken 684652 times.
✓ Branch 25 taken 6930 times.
✓ Branch 26 taken 307242 times.
✓ Branch 27 taken 5767 times.
✓ Branch 28 taken 96085 times.
✓ Branch 29 taken 5413 times.
✓ Branch 30 taken 279 times.
✗ Branch 31 not taken.
✓ Branch 32 taken 108 times.
✗ Branch 33 not taken.
✓ Branch 34 taken 36 times.
✗ Branch 35 not taken.
✓ Branch 36 taken 504 times.
✗ Branch 37 not taken.
✓ Branch 38 taken 270 times.
✗ Branch 39 not taken.
✓ Branch 40 taken 2250 times.
✗ Branch 41 not taken.
✓ Branch 42 taken 3330 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 3447 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 4212 times.
✗ Branch 47 not taken.
✓ Branch 48 taken 99 times.
✗ Branch 49 not taken.
✓ Branch 50 taken 171 times.
✗ Branch 51 not taken.
✓ Branch 52 taken 90 times.
✗ Branch 53 not taken.
✓ Branch 54 taken 180 times.
✗ Branch 55 not taken.
✓ Branch 56 taken 252 times.
✗ Branch 57 not taken.
✓ Branch 58 taken 324 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 72 times.
✗ Branch 61 not taken.
✓ Branch 62 taken 224223 times.
✓ Branch 63 taken 738 times.
✗ Branch 64 not taken.
✗ Branch 65 not taken.
✗ Branch 66 not taken.
✗ Branch 67 not taken.
✗ Branch 68 not taken.
✗ Branch 69 not taken.
✗ Branch 70 not taken.
✗ Branch 71 not taken.
✗ Branch 72 not taken.
✓ Branch 73 taken 450 times.
✗ Branch 74 not taken.
✓ Branch 75 taken 450 times.
✓ Branch 76 taken 34599 times.
✗ Branch 77 not taken.
✗ Branch 78 not taken.
✗ Branch 79 not taken.
✗ Branch 80 not taken.
✗ Branch 81 not taken.
 26759745 return inlined.len != (unsigned char)-1;
330 }
331 };
332 #define STR (string)
333
334 char * readfile(const char * fname, const char * basepath);
335 char * readfilenative(const char * fname);
336 bool readfile(const char * fname, const char * basepath, char ** data, int * len);//if you want an uchar*, cast it
337 char ** split(char * str, char key, int * len= nullptr);
338 char ** qsplit(char * str, char key, int * len= nullptr);
339 char ** qpsplit(char * str, char key, int * len= nullptr);
340 char ** qsplitstr(char * str, const char * key, int * len= nullptr);
341 bool confirmquotes(const char * str);
342 bool confirmqpar(const char * str);
343 char* strqpchr(char* str, char key);
344 char* strqpstr(char* str, const char* key);
345
346 18 inline string hex(unsigned int value)
347 {
348 char buffer[64];
349 if(0);
350
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 18 times.
 18 else if (value<=0x000000FF) sprintf(buffer, "%.2X", value);
351
1/2
✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
 18 else if (value<=0x0000FFFF) sprintf(buffer, "%.4X", value);
352 ✗ else if (value<=0x00FFFFFF) sprintf(buffer, "%.6X", value);
353 ✗ else sprintf(buffer, "%.8X", value);
354
1/2
✓ Branch 0 taken 9 times.
✗ Branch 1 not taken.
 27 return buffer;
355 }
356
357 676 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 676 sprintf(buffer, "%.*X", width, value);
361
1/2
✓ Branch 0 taken 338 times.
✗ Branch 1 not taken.
 1014 return buffer;
362 }
363
364 20059 inline string dec(int value)
365 {
366 char buffer[64];
367 20059 sprintf(buffer, "%i", value);
368
1/2
✓ Branch 0 taken 7893 times.
✗ Branch 1 not taken.
 27952 return buffer;
369 }
370
371 6498 inline string ftostr(double value)
372 {
373 // randomdude999: With 100 digits of precision, the buffer needs to be approx. 311+100,
374 // but let's be safe here https://stackoverflow.com/questions/7235456
375 char rval[512];
376 // RPG Hacker: Ridiculously high precision, I know, but we're working with doubles
377 // here and can afford it, so no need to waste any precision
378 6498 sprintf(rval, "%.100f", value);
379
1/2
✓ Branch 0 taken 6498 times.
✗ Branch 1 not taken.
 6498 if (strchr(rval, '.'))//nuke useless zeroes
380 {
381 6498 char * end=strrchr(rval, '\0')-1;
382
2/2
✓ Branch 0 taken 648756 times.
✓ Branch 1 taken 6498 times.
 655254 while (*end=='0')
383 {
384 648756 *end='\0';
385 648756 end--;
386 }
387
2/2
✓ Branch 0 taken 6480 times.
✓ Branch 1 taken 18 times.
 6498 if (*end=='.') *end='\0';
388 }
389
1/2
✓ Branch 0 taken 3249 times.
✗ Branch 1 not taken.
 9747 return rval;
390 }
391
392 // Same as above, but with variable precision
393 138 inline string ftostrvar(double value, int precision)
394 {
395 69 int clampedprecision = precision;
396
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69 times.
 69 if (clampedprecision < 0) clampedprecision = 0;
397
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 69 times.
 138 if (clampedprecision > 100) clampedprecision = 100;
398
399 // see above
400 char rval[512];
401 138 sprintf(rval, "%.*f", clampedprecision, (double)value);
402
2/2
✓ Branch 0 taken 132 times.
✓ Branch 1 taken 6 times.
 138 if (strchr(rval, '.'))//nuke useless zeroes
403 {
404 132 char * end = strrchr(rval, '\0') - 1;
405
2/2
✓ Branch 0 taken 414 times.
✓ Branch 1 taken 132 times.
 546 while (*end == '0')
406 {
407 414 *end = '\0';
408 414 end--;
409 }
410
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 78 times.
 132 if (*end == '.') *end = '\0';
411 }
412
1/2
✓ Branch 0 taken 69 times.
✗ Branch 1 not taken.
 207 return rval;
413 }
414
415 261211 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 897255 times.
✓ Branch 1 taken 26133 times.
 923388 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 570485 times.
✓ Branch 1 taken 326770 times.
 897255 if (to_lower(str[i])!=to_lower(key[i])) return false;
420 }
421 5568 return true;
422 }
423
424 inline bool striend(const char * str, const char * key)
425 {
426 const char * keyend=strrchr(key, '\0');
427 const char * strend=strrchr(str, '\0');
428 if(keyend-key > strend-str) return false;
429
430 while (key!=keyend)
431 {
432 keyend--;
433 strend--;
434 if (to_lower(*strend)!=to_lower(*keyend)) return false;
435 }
436 return true;
437 }
438
439 inline bool stricmpwithupper(const char *word1, const char *word2)
440 {
441 while(*word2)
442 {
443 if(to_upper(*word1++) != *word2++) return true;
444 }
445 return *word1;
446 }
447
448 1765524 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 2462823 times.
✓ Branch 1 taken 114158 times.
 2576981 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 1157389 times.
✓ Branch 1 taken 1305434 times.
 2462823 if(to_lower(*word1++) != *word2++) return true;
453 }
454 114158 return *word1;
455 }
456
457 //function: return the string without quotes around it, if any exists
458 //if they don't exist, return it unaltered
459 //it is not guaranteed to return str
460 //it is not guaranteed to not edit str
461 //the input must be freed even though it's garbage, the output must not
462 29250 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 17886 times.
✓ Branch 1 taken 11364 times.
 29250 if (*str!='"') return str;
465 26997 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 26997 times.
✗ Branch 1 not taken.
 26997 if (end)
467 {
468 26997 *end = 0;
469 26997 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 26997 times.
 27429 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 10248 return str + 1;
472 }
473 ✗ return nullptr;
474 }
475
476 35212 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 335435 times.
✓ Branch 1 taken 24511 times.
 359946 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 10695 times.
✓ Branch 1 taken 324740 times.
 335435 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 322917 times.
✓ Branch 1 taken 1823 times.
✓ Branch 2 taken 534 times.
✓ Branch 3 taken 322383 times.
 324740 else if (*str == '"' || *str == '\'')
482 {
483 // Special case hack for ''', which is currently our official way of handling the ' character.
484 // Even though it really stinks.
485
5/6
✓ Branch 0 taken 534 times.
✓ Branch 1 taken 1823 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 504 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 2357 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 1198 char delimiter = *str;
489
490 do
491 {
492 26869 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 24548 times.
✓ Branch 1 taken 2321 times.
✓ Branch 2 taken 24542 times.
✓ Branch 3 taken 6 times.
 26869 } while (*str != delimiter && *str != '\0');
496
497 // This feels like a superfluous check, but I can't really find a clean way to avoid it.
498
2/2
✓ Branch 0 taken 1129 times.
✓ Branch 1 taken 1198 times.
 2327 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 324734 str++;
503 }
504
505 12282 return nullptr;
506 }
507
508 3876 inline string substr(const char * str, int len)
509 {
510 3876 return string(str, len);
511 }
512
513 //todo make these members
514 string &strip_prefix(string &str, char c);
515 string &strip_suffix(string &str, char c);
516
517
518 201038 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11068 times.
✓ Branch 1 taken 201038 times.
 212106 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 188761 times.
✓ Branch 1 taken 59679 times.
 248440 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 141359 times.
✓ Branch 1 taken 47402 times.
 188761 if(!is_space(str[i]))
524 {
525 141359 str[i + 1] = 0;
526 141359 return str;
527 }
528 }
529 29861 return str;
530 }
531 6667 inline void strip_whitespace(string &str)
532 {
533
2/4
✓ Branch 0 taken 3339 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 3339 times.
✗ Branch 3 not taken.
 9995 str = string(strip_whitespace(str.temp_raw()));
534 6667 }
535
536 string &itrim(string &str, const char * left, const char * right);
537
538
2/2
✓ Branch 0 taken 34066 times.
✓ Branch 1 taken 18 times.
 34166 inline string &lower(string &old)
539 {
540 82 int length = old.length();
541
2/2
✓ Branch 0 taken 955067 times.
✓ Branch 1 taken 34166 times.
 989233 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
542 34166 return old;
543 }
544
545
546 // Returns number of connected lines - 1
547 template<typename stringarraytype>
548 142149 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 67896 int count = 0;
551
552
1/2
✓ Branch 0 taken 142203 times.
✗ Branch 1 not taken.
 142203 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 142203 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 105003 times.
✓ Branch 1 taken 37200 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 104949 times.
 142203 if(linestartpos && lines[i][linestartpos - 1] == '\\')
558 {
559 54 count++;
560
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 out += string(lines[i], linestartpos - 1);
561 27 continue;
562 }
563 else
564 {
565
2/4
✓ Branch 0 taken 67896 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 67896 times.
✗ Branch 3 not taken.
 142149 out += string(lines[i], linestartpos);
566 142149 return count;
567 }
568 }
569
570 ✗ return count;
571 }
572