asar coverage - build #94

src/asar/
File: src/asar/libstr.h
Date: 2024-01-19 18:27:09
Lines:
217/221
98.2%
Functions:
44/45
97.8%
Branches:
417/563
74.1%
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 4850775 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
9 345966 static inline int to_upper(unsigned char c) { return c&~(char_props[c]&0x20); }
10
11
10/10
✓ Branch 0 taken 132915 times.
✓ Branch 1 taken 44640 times.
✓ Branch 2 taken 132735 times.
✓ Branch 3 taken 144 times.
✓ Branch 4 taken 576 times.
✓ Branch 5 taken 180 times.
✓ Branch 6 taken 5169 times.
✓ Branch 7 taken 13215 times.
✓ Branch 8 taken 5277 times.
✓ Branch 9 taken 5169 times.
 724405 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 149687 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 3570 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
15 4974 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 40849 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 387044 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 27954 times.
✓ Branch 1 taken 21222 times.
✓ Branch 2 taken 29430 times.
✓ Branch 3 taken 8319 times.
 86925 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 3844317 memcpy(dest, source, copy_length*sizeof(char));
24 return dest;
25 }
26
27 class string {
28 public:
29 const char *data() const
30 {
31
263/381
✓ Branch 0 taken 13442 times.
✓ Branch 1 taken 1207703 times.
✓ Branch 2 taken 1187068 times.
✓ Branch 3 taken 6495 times.
✓ Branch 4 taken 10511 times.
✓ Branch 5 taken 80632 times.
✓ Branch 6 taken 84366 times.
✓ Branch 7 taken 4938 times.
✓ Branch 8 taken 19021 times.
✓ Branch 9 taken 3790 times.
✓ Branch 10 taken 298 times.
✓ Branch 11 taken 918 times.
✓ Branch 12 taken 2428 times.
✓ Branch 13 taken 223 times.
✓ Branch 14 taken 2883 times.
✓ Branch 15 taken 1068 times.
✓ Branch 16 taken 22658 times.
✓ Branch 17 taken 366 times.
✓ Branch 18 taken 288 times.
✓ Branch 19 taken 1630 times.
✓ Branch 20 taken 774 times.
✓ Branch 21 taken 910 times.
✓ Branch 22 taken 2830 times.
✓ Branch 23 taken 409 times.
✓ Branch 24 taken 945 times.
✓ Branch 25 taken 343 times.
✓ Branch 26 taken 355 times.
✓ Branch 27 taken 560 times.
✓ Branch 28 taken 308 times.
✓ Branch 29 taken 160 times.
✓ Branch 30 taken 242 times.
✓ Branch 31 taken 262 times.
✓ Branch 32 taken 28 times.
✓ Branch 33 taken 79593 times.
✓ Branch 34 taken 22085 times.
✓ Branch 35 taken 137 times.
✓ Branch 36 taken 852 times.
✓ Branch 37 taken 83568 times.
✓ Branch 38 taken 68160 times.
✓ Branch 39 taken 553 times.
✓ Branch 40 taken 18 times.
✓ Branch 41 taken 768 times.
✓ Branch 42 taken 46654 times.
✓ Branch 43 taken 544 times.
✓ Branch 44 taken 420 times.
✓ Branch 45 taken 3895 times.
✓ Branch 46 taken 336 times.
✓ Branch 47 taken 4297 times.
✓ Branch 48 taken 42 times.
✓ Branch 49 taken 74 times.
✓ Branch 50 taken 1213 times.
✓ Branch 51 taken 33 times.
✓ Branch 52 taken 2639 times.
✓ Branch 53 taken 65083 times.
✓ Branch 54 taken 15027 times.
✓ Branch 55 taken 2448 times.
✓ Branch 56 taken 3942 times.
✓ Branch 57 taken 796 times.
✓ Branch 58 taken 19953 times.
✓ Branch 59 taken 21229 times.
✓ Branch 60 taken 961 times.
✓ Branch 61 taken 530 times.
✓ Branch 62 taken 190 times.
✓ Branch 63 taken 90 times.
✓ Branch 64 taken 58882 times.
✓ Branch 65 taken 54207 times.
✓ Branch 66 taken 23617 times.
✓ Branch 67 taken 4475 times.
✓ Branch 68 taken 4183 times.
✓ Branch 69 taken 123 times.
✓ Branch 70 taken 36 times.
✓ Branch 71 taken 66210 times.
✓ Branch 72 taken 59829 times.
✓ Branch 73 taken 1351 times.
✓ Branch 74 taken 1536 times.
✓ Branch 75 taken 207 times.
✓ Branch 76 taken 270 times.
✓ Branch 77 taken 4212 times.
✓ Branch 78 taken 144 times.
✓ Branch 79 taken 4053 times.
✓ Branch 80 taken 3885 times.
✓ Branch 81 taken 3681 times.
✓ Branch 82 taken 149 times.
✓ Branch 83 taken 579 times.
✓ Branch 84 taken 858 times.
✓ Branch 85 taken 122 times.
✓ Branch 86 taken 174 times.
✓ Branch 87 taken 519 times.
✓ Branch 88 taken 241 times.
✓ Branch 89 taken 3900 times.
✓ Branch 90 taken 399 times.
✓ Branch 91 taken 4805 times.
✓ Branch 92 taken 54 times.
✓ Branch 93 taken 150 times.
✓ Branch 94 taken 1222 times.
✓ Branch 95 taken 54 times.
✓ Branch 96 taken 2997 times.
✓ Branch 97 taken 1266 times.
✓ Branch 98 taken 1926 times.
✓ Branch 99 taken 3189 times.
✓ Branch 100 taken 3726 times.
✓ Branch 101 taken 2244 times.
✓ Branch 102 taken 25182 times.
✓ Branch 103 taken 9 times.
✓ Branch 104 taken 5607 times.
✓ Branch 105 taken 99 times.
✓ Branch 106 taken 12 times.
✓ Branch 107 taken 16108 times.
✓ Branch 108 taken 99 times.
✓ Branch 109 taken 18269 times.
✓ Branch 110 taken 1752 times.
✓ Branch 111 taken 10851 times.
✓ Branch 112 taken 18591 times.
✓ Branch 113 taken 813 times.
✓ Branch 114 taken 10384 times.
✓ Branch 115 taken 86 times.
✓ Branch 116 taken 424 times.
✓ Branch 117 taken 30 times.
✓ Branch 118 taken 171 times.
✓ Branch 119 taken 90 times.
✗ Branch 120 not taken.
✓ Branch 121 taken 18798 times.
✓ Branch 122 taken 765 times.
✓ Branch 123 taken 3026 times.
✓ Branch 124 taken 426 times.
✗ Branch 125 not taken.
✓ Branch 126 taken 842 times.
✓ Branch 127 taken 774 times.
✓ Branch 128 taken 819 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 2222 times.
✓ Branch 131 taken 591 times.
✗ Branch 132 not taken.
✓ Branch 133 taken 819 times.
✓ Branch 134 taken 3510 times.
✓ Branch 135 taken 1961 times.
✓ Branch 136 taken 84 times.
✓ Branch 137 taken 39 times.
✓ Branch 138 taken 59 times.
✓ Branch 139 taken 222 times.
✓ Branch 140 taken 9731 times.
✗ Branch 141 not taken.
✓ Branch 142 taken 102 times.
✓ Branch 143 taken 649 times.
✗ Branch 144 not taken.
✓ Branch 145 taken 22 times.
✓ Branch 146 taken 17 times.
✓ Branch 147 taken 5016 times.
✓ Branch 148 taken 5372 times.
✓ Branch 149 taken 572 times.
✓ Branch 150 taken 182 times.
✓ Branch 151 taken 444 times.
✓ Branch 152 taken 81 times.
✗ Branch 153 not taken.
✓ Branch 154 taken 1802 times.
✓ Branch 155 taken 652 times.
✓ Branch 156 taken 183 times.
✓ Branch 157 taken 1266 times.
✓ Branch 158 taken 891 times.
✓ Branch 159 taken 3 times.
✓ Branch 160 taken 2694 times.
✓ Branch 161 taken 3172 times.
✓ Branch 162 taken 1100 times.
✓ Branch 163 taken 2340 times.
✓ Branch 164 taken 2148 times.
✗ Branch 165 not taken.
✓ Branch 166 taken 9 times.
✓ Branch 167 taken 9 times.
✗ Branch 168 not taken.
✗ Branch 169 not taken.
✓ Branch 170 taken 9 times.
✗ Branch 171 not taken.
✓ Branch 172 taken 9 times.
✗ Branch 173 not taken.
✗ Branch 174 not taken.
✓ Branch 175 taken 9 times.
✓ Branch 176 taken 9 times.
✗ Branch 177 not taken.
✗ Branch 178 not taken.
✓ Branch 179 taken 9 times.
✗ Branch 180 not taken.
✓ Branch 181 taken 9 times.
✗ Branch 182 not taken.
✗ Branch 183 not taken.
✓ Branch 184 taken 9 times.
✓ Branch 185 taken 90 times.
✗ Branch 186 not taken.
✓ Branch 187 taken 9 times.
✓ Branch 188 taken 180 times.
✓ Branch 189 taken 9 times.
✓ Branch 190 taken 90 times.
✗ Branch 191 not taken.
✗ Branch 192 not taken.
✓ Branch 193 taken 369 times.
✗ Branch 194 not taken.
✗ Branch 195 not taken.
✓ Branch 196 taken 180 times.
✓ Branch 197 taken 9 times.
✗ Branch 198 not taken.
✓ Branch 199 taken 18 times.
✗ Branch 200 not taken.
✓ Branch 201 taken 18 times.
✗ Branch 202 not taken.
✓ Branch 203 taken 99 times.
✗ Branch 204 not taken.
✓ Branch 205 taken 207 times.
✗ Branch 206 not taken.
✓ Branch 207 taken 9 times.
✗ Branch 208 not taken.
✓ Branch 209 taken 27 times.
✗ Branch 210 not taken.
✓ Branch 211 taken 36 times.
✗ Branch 212 not taken.
✓ Branch 213 taken 45 times.
✗ Branch 214 not taken.
✓ Branch 215 taken 36 times.
✗ Branch 216 not taken.
✓ Branch 217 taken 36 times.
✗ Branch 218 not taken.
✓ Branch 219 taken 27 times.
✗ Branch 220 not taken.
✓ Branch 221 taken 45 times.
✗ Branch 222 not taken.
✓ Branch 223 taken 54 times.
✗ Branch 224 not taken.
✓ Branch 225 taken 45 times.
✗ Branch 226 not taken.
✓ Branch 227 taken 36 times.
✗ Branch 228 not taken.
✓ Branch 229 taken 36 times.
✗ Branch 230 not taken.
✓ Branch 231 taken 27 times.
✗ Branch 232 not taken.
✓ Branch 233 taken 36 times.
✗ Branch 234 not taken.
✓ Branch 235 taken 36 times.
✗ Branch 236 not taken.
✓ Branch 237 taken 36 times.
✗ Branch 238 not taken.
✓ Branch 239 taken 54 times.
✗ Branch 240 not taken.
✓ Branch 241 taken 54 times.
✗ Branch 242 not taken.
✓ Branch 243 taken 18 times.
✗ Branch 244 not taken.
✓ Branch 245 taken 27 times.
✗ Branch 246 not taken.
✓ Branch 247 taken 36 times.
✗ Branch 248 not taken.
✓ Branch 249 taken 45 times.
✗ Branch 250 not taken.
✓ Branch 251 taken 36 times.
✗ Branch 252 not taken.
✓ Branch 253 taken 36 times.
✗ Branch 254 not taken.
✓ Branch 255 taken 27 times.
✗ Branch 256 not taken.
✓ Branch 257 taken 45 times.
✗ Branch 258 not taken.
✓ Branch 259 taken 54 times.
✗ Branch 260 not taken.
✓ Branch 261 taken 36 times.
✗ Branch 262 not taken.
✓ Branch 263 taken 18 times.
✗ Branch 264 not taken.
✓ Branch 265 taken 27 times.
✗ Branch 266 not taken.
✓ Branch 267 taken 45 times.
✗ Branch 268 not taken.
✓ Branch 269 taken 54 times.
✗ Branch 270 not taken.
✓ Branch 271 taken 36 times.
✗ Branch 272 not taken.
✓ Branch 273 taken 18 times.
✗ Branch 274 not taken.
✓ Branch 275 taken 18 times.
✗ Branch 276 not taken.
✓ Branch 277 taken 27 times.
✗ Branch 278 not taken.
✓ Branch 279 taken 36 times.
✗ Branch 280 not taken.
✓ Branch 281 taken 45 times.
✗ Branch 282 not taken.
✓ Branch 283 taken 36 times.
✗ Branch 284 not taken.
✓ Branch 285 taken 36 times.
✗ Branch 286 not taken.
✓ Branch 287 taken 18 times.
✗ Branch 288 not taken.
✓ Branch 289 taken 27 times.
✗ Branch 290 not taken.
✓ Branch 291 taken 36 times.
✗ Branch 292 not taken.
✓ Branch 293 taken 45 times.
✗ Branch 294 not taken.
✓ Branch 295 taken 81 times.
✗ Branch 296 not taken.
✓ Branch 297 taken 81 times.
✗ Branch 298 not taken.
✓ Branch 299 taken 63 times.
✗ Branch 300 not taken.
✓ Branch 301 taken 126 times.
✗ Branch 302 not taken.
✓ Branch 303 taken 189 times.
✗ Branch 304 not taken.
✓ Branch 305 taken 189 times.
✗ Branch 306 not taken.
✓ Branch 307 taken 108 times.
✗ Branch 308 not taken.
✓ Branch 309 taken 162 times.
✗ Branch 310 not taken.
✓ Branch 311 taken 216 times.
✗ Branch 312 not taken.
✓ Branch 313 taken 270 times.
✗ Branch 314 not taken.
✓ Branch 315 taken 216 times.
✗ Branch 316 not taken.
✓ Branch 317 taken 216 times.
✗ Branch 318 not taken.
✓ Branch 319 taken 108 times.
✗ Branch 320 not taken.
✓ Branch 321 taken 162 times.
✗ Branch 322 not taken.
✓ Branch 323 taken 171 times.
✗ Branch 324 not taken.
✓ Branch 325 taken 171 times.
✗ Branch 326 not taken.
✓ Branch 327 taken 63 times.
✗ Branch 328 not taken.
✓ Branch 329 taken 63 times.
✗ Branch 330 not taken.
✓ Branch 331 taken 63 times.
✗ Branch 332 not taken.
✓ Branch 333 taken 63 times.
✗ Branch 334 not taken.
✓ Branch 335 taken 18 times.
✗ Branch 336 not taken.
✓ Branch 337 taken 18 times.
✗ Branch 338 not taken.
✓ Branch 339 taken 18 times.
✗ Branch 340 not taken.
✓ Branch 341 taken 9 times.
✗ Branch 342 not taken.
✓ Branch 343 taken 18 times.
✗ Branch 344 not taken.
✓ Branch 345 taken 18 times.
✗ Branch 346 not taken.
✓ Branch 347 taken 18 times.
✗ Branch 348 not taken.
✓ Branch 349 taken 9 times.
✗ Branch 350 not taken.
✓ Branch 351 taken 18 times.
✗ Branch 352 not taken.
✓ Branch 353 taken 9 times.
✗ Branch 354 not taken.
✓ Branch 355 taken 9 times.
✗ Branch 356 not taken.
✓ Branch 357 taken 18 times.
✗ Branch 358 not taken.
✓ Branch 359 taken 18 times.
✗ Branch 360 not taken.
✓ Branch 361 taken 9 times.
✗ Branch 362 not taken.
✓ Branch 363 taken 9 times.
✗ Branch 364 not taken.
✓ Branch 365 taken 18 times.
✗ Branch 366 not taken.
✗ Branch 367 not taken.
✗ Branch 368 not taken.
✓ Branch 369 taken 9 times.
✗ Branch 370 not taken.
✓ Branch 371 taken 9 times.
✗ Branch 372 not taken.
✓ Branch 373 taken 9 times.
✗ Branch 374 not taken.
✗ Branch 375 not taken.
✗ Branch 376 not taken.
✓ Branch 377 taken 9 times.
✗ Branch 378 not taken.
✗ Branch 379 not taken.
✗ Branch 380 not taken.
 3779639 return cached_data;
32 }
33
34 char *temp_raw() const //things to cleanup and take a look at
35 {
36
4/8
✓ Branch 0 taken 294687 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 13818 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 4374 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 369 times.
✗ Branch 7 not taken.
 361163 return cached_data;
37 }
38
39 char *raw() const
40 {
41
9/14
✓ Branch 0 taken 4215 times.
✓ Branch 1 taken 151254 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 72 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 45 times.
✓ Branch 6 taken 3 times.
✓ Branch 7 taken 36 times.
✓ Branch 8 taken 6 times.
✗ Branch 9 not taken.
✓ Branch 10 taken 36 times.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
✓ Branch 13 taken 24 times.
 6128611 return cached_data;
42 }
43
44 int length() const
45 {
46 11986165 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 5782988 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 32099 times.
✓ Branch 1 taken 5750889 times.
 5782988 if(length > max_inline_length_){
52 32099 inlined.len = (unsigned char)-1;
53 32099 allocated.len = length;
54 }else{
55 5750889 inlined.len = length;
56 }
57 5782988 }
58
59 void truncate(int newlen)
60 {
61 2898 resize(newlen);
62 2898 }
63
64 1694285 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 236 times.
✓ Branch 1 taken 1694049 times.
 1694285 if (!newstr) newstr = "";
67 1694285 assign(newstr, strlen(newstr));
68 1694285 }
69
70 1135296 void assign(const string &newstr)
71 {
72 1135296 assign(newstr, newstr.length());
73 1135296 }
74
75 3056889 void assign(const char * newstr, int end)
76 {
77 3056889 resize(end);
78 3056889 copy(newstr, length(), cached_data);
79 3056889 }
80
81
82 string& operator=(const char * newstr)
83 {
84 733271 assign(newstr);
85 17411 return *this;
86 }
87
88 string& operator=(const string &newstr)
89 {
90 155398 assign(newstr);
91 49839 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 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 195578 string& operator+=(const string& other)
111 {
112 int current_end = length();
113 195578 resize(length() + other.length());
114 391156 copy(other.cached_data, other.length(), cached_data + current_end);
115 195578 return *this;
116 }
117
118 565514 string& operator+=(const char *other)
119 {
120 int current_end = length();
121 565514 int otherlen=(int)strlen(other);
122 565514 resize(length() + otherlen);
123 565514 copy(other, otherlen, cached_data + current_end);
124 565514 return *this;
125 }
126
127 1952317 string& operator+=(char c)
128 {
129 1952317 resize(length() + 1);
130 3904634 cached_data[length() - 1] = c;
131 1952317 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 string operator+(const char * right) const
142 {
143 19434 string ret=*this;
144 110765 ret+=right;
145 6685 return ret;
146 }
147
148 13056 bool operator==(const char * right) const
149 {
150 13056 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 19885 bool operator!=(const char * right) const
159 {
160 19885 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 operator const char*() const
169 {
170 return data();
171 }
172
173 34466 explicit operator bool() const
174 {
175 34466 return length();
176 }
177
178 3882425 string()
179 3882425 {
180 //todo reduce I know this isn't all needed
181 3882425 allocated.bufferlen = 0;
182 3882425 allocated.str = 0;
183 3882425 allocated.len = 0;
184 3882425 inlined.len = 0;
185 3882425 cached_data = inlined.str;
186 3882425 next_resize = max_inline_length_+1;
187
188 2969061 }
189 824619 string(const char * newstr) : string()
190 {
191 824619 assign(newstr);
192 730046 }
193 194619 string(const char * newstr, int newlen) : string()
194 {
195 194619 assign(newstr, newlen);
196 194886 }
197 136394 string(const string& old) : string()
198 {
199 136394 assign(old.data());
200 136073 }
201
202 17970 string(string &&move) : string()
203 {
204 *this = move;
205 17970 }
206
207 287606 string& operator=(string&& move)
208 {
209 164 if(!is_inlined()) free(allocated.str);
210 287606 if(!move.is_inlined()){
211 228 allocated.str = move.allocated.str;
212 228 allocated.bufferlen = move.allocated.bufferlen;
213 228 set_length(move.allocated.len);
214
215 228 move.inlined.len = 0;
216 228 move.inlined.str[0] = 0;
217 228 cached_data = allocated.str;
218 228 next_resize = move.next_resize;
219
220 }else{
221 287378 inlined.len = 0;
222 287378 cached_data = inlined.str;
223 287378 next_resize = max_inline_length_+1;
224 287378 assign(move);
225 }
226 287606 return *this;
227 }
228
229 10270327 ~string()
230 {
231 5885101 if(!is_inlined()){
232 26508 free(allocated.str);
233 }
234 10270327 }
235
236 //maybe these should return refs to chain. but also good not to encourage chaining
237 6730 void strip_prefix(char c)
238 {
239
2/2
✓ Branch 0 taken 3185 times.
✓ Branch 1 taken 3545 times.
 6730 if(cached_data[0] == c){
240 3185 *this = string(cached_data + 1, length() - 1);
241 }
242 6730 }
243
244 378 void strip_suffix(char c)
245 {
246
1/2
✓ Branch 0 taken 378 times.
✗ Branch 1 not taken.
 378 if(cached_data[length() - 1] == c){
247 378 truncate(length() - 1);
248 }
249 378 }
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 5782760 void resize(int new_length)
299 {
300 const char *old_data = data();
301
4/4
✓ Branch 0 taken 5765468 times.
✓ Branch 1 taken 17292 times.
✓ Branch 2 taken 218 times.
✓ Branch 3 taken 14579 times.
 5797557 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
302
3/4
✓ Branch 0 taken 17292 times.
✓ Branch 1 taken 218 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 738 times.
 18248 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
303 17292 int new_size = bitround(new_length + 1);
304
2/2
✓ Branch 0 taken 16554 times.
✓ Branch 1 taken 738 times.
 17292 if(old_data == inlined.str){
305
1/2
✓ Branch 0 taken 16554 times.
✗ Branch 1 not taken.
 33108 allocated.str = copy(old_data, min(length(), new_length), (char *)malloc(new_size));
306 }else{
307 738 allocated.str = (char *)realloc(allocated.str, new_size);
308 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
309 }
310 17292 allocated.bufferlen = new_size;
311 17292 cached_data = allocated.str;
312 17292 next_resize = allocated.bufferlen;
313
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 218 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 218 times.
 218 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
314 218 copy(old_data, new_length, inlined.str);
315 218 cached_data = inlined.str;
316 218 next_resize = max_inline_length_+1;
317 }
318
3/4
✓ Branch 0 taken 218 times.
✓ Branch 1 taken 17292 times.
✓ Branch 2 taken 218 times.
✗ Branch 3 not taken.
 17510 if(old_data != inlined.str && old_data != data()){
319 218 free((char *)old_data);
320 }
321 }
322 5782760 set_length(new_length);
323
324 5782760 raw()[new_length] = 0; //always ensure null terminator
325 5782760 }
326
327 bool is_inlined() const
328 {
329
30/34
✓ Branch 0 taken 1397203 times.
✓ Branch 1 taken 3929483 times.
✓ Branch 2 taken 1228028 times.
✓ Branch 3 taken 1843452 times.
✓ Branch 4 taken 19502 times.
✓ Branch 5 taken 3854 times.
✓ Branch 6 taken 2267 times.
✓ Branch 7 taken 18 times.
✓ Branch 8 taken 45354 times.
✓ Branch 9 taken 2561161 times.
✓ Branch 10 taken 35348 times.
✓ Branch 11 taken 1358900 times.
✓ Branch 12 taken 266482 times.
✓ Branch 13 taken 242330 times.
✓ Branch 14 taken 1473676 times.
✓ Branch 15 taken 87115 times.
✓ Branch 16 taken 3590686 times.
✓ Branch 17 taken 7703 times.
✓ Branch 18 taken 1307428 times.
✓ Branch 19 taken 2846 times.
✓ Branch 20 taken 474961 times.
✓ Branch 21 taken 1800 times.
✓ Branch 22 taken 336138 times.
✓ Branch 23 taken 6415 times.
✓ Branch 24 taken 1101450 times.
✓ Branch 25 taken 8300 times.
✓ Branch 26 taken 484004 times.
✓ Branch 27 taken 7010 times.
✓ Branch 28 taken 156660 times.
✓ Branch 29 taken 6326 times.
✗ Branch 30 not taken.
✗ Branch 31 not taken.
✗ Branch 32 not taken.
✗ Branch 33 not taken.
 21698458 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 18 return buffer;
355 }
356
357 660 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 660 sprintf(buffer, "%.*X", width, value);
361 660 return buffer;
362 }
363
364 15757 inline string dec(int value)
365 {
366 char buffer[64];
367 15757 sprintf(buffer, "%i", value);
368 15757 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
1/2
✓ Branch 0 taken 3249 times.
✗ Branch 1 not taken.
 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 6498 return rval;
390 }
391
392 // Same as above, but with variable precision
393 138 inline string ftostrvar(double value, int precision)
394 {
395 int clampedprecision = precision;
396 if (clampedprecision < 0) clampedprecision = 0;
397 138 if (clampedprecision > 100) clampedprecision = 100;
398
399 // see above
400 char rval[512];
401
2/2
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 3 times.
 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 138 return rval;
413 }
414
415 313108 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 812643 times.
✓ Branch 1 taken 39240 times.
 851883 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 538775 times.
✓ Branch 1 taken 273868 times.
 812643 if (to_lower(str[i])!=to_lower(key[i])) return false;
420 }
421 return true;
422 }
423
424
2/2
✓ Branch 0 taken 351 times.
✓ Branch 1 taken 11349 times.
 23256 inline bool striend(const char * str, const char * key)
425 {
426 11556 const char * keyend=strrchr(key, '\0');
427 11556 const char * strend=strrchr(str, '\0');
428
2/2
✓ Branch 0 taken 675 times.
✓ Branch 1 taken 22581 times.
 23256 if(keyend-key > strend-str) return false;
429
430
2/2
✓ Branch 0 taken 26613 times.
✓ Branch 1 taken 2898 times.
 29511 while (key!=keyend)
431 {
432 26613 keyend--;
433 26613 strend--;
434
2/2
✓ Branch 0 taken 19683 times.
✓ Branch 1 taken 6930 times.
 26613 if (to_lower(*strend)!=to_lower(*keyend)) return false;
435 }
436 return true;
437 }
438
439 306378 inline bool stricmpwithupper(const char *word1, const char *word2)
440 {
441
2/2
✓ Branch 0 taken 345966 times.
✓ Branch 1 taken 11343 times.
 357309 while(*word2)
442 {
443
2/2
✓ Branch 0 taken 50931 times.
✓ Branch 1 taken 295035 times.
 345966 if(to_upper(*word1++) != *word2++) return true;
444 }
445 11343 return *word1;
446 }
447
448 1522900 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 2155561 times.
✓ Branch 1 taken 106976 times.
 2262537 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 739637 times.
✓ Branch 1 taken 1415924 times.
 2155561 if(to_lower(*word1++) != *word2++) return true;
453 }
454 106976 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 22266 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 20013 times.
✓ Branch 1 taken 2253 times.
 22266 if (*str!='"') return str;
465 16749 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 20013 times.
✗ Branch 1 not taken.
 20013 if (end)
467 {
468 20013 *end = 0;
469 20013 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 20013 times.
 20445 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 return str + 1;
472 }
473 return nullptr;
474 }
475
476 34741 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 331895 times.
✓ Branch 1 taken 24211 times.
 356106 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 10524 times.
✓ Branch 1 taken 321371 times.
 331895 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 319611 times.
✓ Branch 1 taken 1760 times.
✓ Branch 2 taken 534 times.
✓ Branch 3 taken 319077 times.
 321371 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 1760 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 504 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 2294 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 char delimiter = *str;
489
490 do
491 {
492 25843 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 23585 times.
✓ Branch 1 taken 2258 times.
✓ Branch 2 taken 23579 times.
✓ Branch 3 taken 6 times.
 25843 } 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 2258 times.
✓ Branch 1 taken 6 times.
 2264 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 321365 str++;
503 }
504
505 return nullptr;
506 }
507
508 inline string substr(const char * str, int len)
509 {
510 3828 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 192422 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11050 times.
✓ Branch 1 taken 192422 times.
 203472 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 180913 times.
✓ Branch 1 taken 58911 times.
 239824 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 133511 times.
✓ Branch 1 taken 47402 times.
 180913 if(!is_space(str[i]))
524 {
525 133511 str[i + 1] = 0;
526 133511 return str;
527 }
528 }
529 return str;
530 }
531 6667 inline void strip_whitespace(string &str)
532 {
533 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 34153 times.
✓ Branch 1 taken 18 times.
 34171 inline string &lower(string &old)
539 {
540 int length = old.length();
541
2/2
✓ Branch 0 taken 955184 times.
✓ Branch 1 taken 34171 times.
 989355 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
542 34171 return old;
543 }
544
545
546 // Returns number of connected lines - 1
547 template<typename stringarraytype>
548 133941 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 int count = 0;
551
552
1/2
✓ Branch 0 taken 133995 times.
✗ Branch 1 not taken.
 133995 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 133995 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 97371 times.
✓ Branch 1 taken 36624 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 97317 times.
 133995 if(linestartpos && lines[i][linestartpos - 1] == '\\')
558 {
559 54 count++;
560 54 out += string(lines[i], linestartpos - 1);
561 continue;
562 }
563 else
564 {
565 133941 out += string(lines[i], linestartpos);
566 133941 return count;
567 }
568 }
569
570 return count;
571 }
572