asar coverage - build #162

src/asar/
File: src/asar/libstr.h
Date: 2024-01-27 03:08:57
Lines:
226/238
95.0%
Functions:
53/55
96.4%
Branches:
416/634
65.6%
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 5826855 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 74649 times.
✓ Branch 1 taken 29100 times.
✓ Branch 2 taken 74559 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2583 times.
✓ Branch 7 taken 6621 times.
✓ Branch 8 taken 2637 times.
✓ Branch 9 taken 2583 times.
 777612 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 152213 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 4200 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
15 5862 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 42004 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 404952 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 9504 times.
✓ Branch 1 taken 10380 times.
✓ Branch 2 taken 756 times.
✓ Branch 3 taken 261 times.
 41854 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 2007316 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 4581238 memcpy(dest, source, copy_length*sizeof(char));
24 2007316 return dest;
25 }
26
27 class string {
28 public:
29 7234694 const char *data() const
30 {
31
221/366
✓ Branch 0 taken 5192 times.
✓ Branch 1 taken 975940 times.
✓ Branch 2 taken 960411 times.
✓ Branch 3 taken 3168 times.
✓ Branch 4 taken 5305 times.
✓ Branch 5 taken 2295 times.
✓ Branch 6 taken 15654 times.
✓ Branch 7 taken 4190 times.
✓ Branch 8 taken 15899 times.
✓ Branch 9 taken 5547 times.
✓ Branch 10 taken 1665 times.
✓ Branch 11 taken 2511 times.
✓ Branch 12 taken 1152 times.
✓ Branch 13 taken 206 times.
✓ Branch 14 taken 1614 times.
✓ Branch 15 taken 488 times.
✓ Branch 16 taken 11405 times.
✓ Branch 17 taken 437 times.
✓ Branch 18 taken 504 times.
✓ Branch 19 taken 1084 times.
✓ Branch 20 taken 210 times.
✓ Branch 21 taken 5414 times.
✓ Branch 22 taken 1199 times.
✓ Branch 23 taken 385 times.
✓ Branch 24 taken 375 times.
✓ Branch 25 taken 144 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 664 times.
✓ Branch 28 taken 554 times.
✓ Branch 29 taken 108 times.
✓ Branch 30 taken 244 times.
✓ Branch 31 taken 540 times.
✓ Branch 32 taken 216 times.
✓ Branch 33 taken 81753 times.
✓ Branch 34 taken 48 times.
✓ Branch 35 taken 828 times.
✓ Branch 36 taken 1404 times.
✓ Branch 37 taken 85920 times.
✓ Branch 38 taken 783 times.
✓ Branch 39 taken 5045 times.
✓ Branch 40 taken 18 times.
✓ Branch 41 taken 5841 times.
✓ Branch 42 taken 3 times.
✓ Branch 43 taken 51 times.
✓ Branch 44 taken 48 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 51 times.
✓ Branch 47 taken 167 times.
✗ Branch 48 not taken.
✓ Branch 49 taken 33 times.
✓ Branch 50 taken 1141 times.
✓ Branch 51 taken 3 times.
✓ Branch 52 taken 1269 times.
✓ Branch 53 taken 66515 times.
✓ Branch 54 taken 15009 times.
✓ Branch 55 taken 114 times.
✗ Branch 56 not taken.
✓ Branch 57 taken 529 times.
✓ Branch 58 taken 15812 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 418 times.
✓ Branch 61 taken 138 times.
✓ Branch 62 taken 155 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 61071 times.
✓ Branch 65 taken 15012 times.
✓ Branch 66 taken 122 times.
✓ Branch 67 taken 39 times.
✗ Branch 68 not taken.
✓ Branch 69 taken 90 times.
✓ Branch 70 taken 84051 times.
✓ Branch 71 taken 9 times.
✓ Branch 72 taken 9 times.
✓ Branch 73 taken 68697 times.
✓ Branch 74 taken 15450 times.
✗ Branch 75 not taken.
✓ Branch 76 taken 192 times.
✓ Branch 77 taken 9 times.
✗ Branch 78 not taken.
✓ Branch 79 taken 201 times.
✓ Branch 80 taken 18 times.
✓ Branch 81 taken 4245 times.
✓ Branch 82 taken 71 times.
✓ Branch 83 taken 771 times.
✓ Branch 84 taken 351 times.
✓ Branch 85 taken 21 times.
✓ Branch 86 taken 153 times.
✗ Branch 87 not taken.
✓ Branch 88 taken 46 times.
✓ Branch 89 taken 153 times.
✗ Branch 90 not taken.
✓ Branch 91 taken 142 times.
✓ Branch 92 taken 81 times.
✗ Branch 93 not taken.
✓ Branch 94 taken 167 times.
✓ Branch 95 taken 81 times.
✗ Branch 96 not taken.
✓ Branch 97 taken 359 times.
✓ Branch 98 taken 17889 times.
✗ Branch 99 not taken.
✓ Branch 100 taken 87 times.
✓ Branch 101 taken 2889 times.
✗ Branch 102 not taken.
✓ Branch 103 taken 90 times.
✓ Branch 104 taken 2880 times.
✗ Branch 105 not taken.
✓ Branch 106 taken 123 times.
✗ Branch 107 not taken.
✗ Branch 108 not taken.
✓ Branch 109 taken 10858 times.
✗ Branch 110 not taken.
✓ Branch 111 taken 10828 times.
✓ Branch 112 taken 9 times.
✗ Branch 113 not taken.
✓ Branch 114 taken 15586 times.
✗ Branch 115 not taken.
✗ Branch 116 not taken.
✓ Branch 117 taken 11 times.
✓ Branch 118 taken 343 times.
✗ Branch 119 not taken.
✓ Branch 120 taken 54 times.
✓ Branch 121 taken 9 times.
✓ Branch 122 taken 54 times.
✓ Branch 123 taken 15456 times.
✓ Branch 124 taken 54 times.
✗ Branch 125 not taken.
✓ Branch 126 taken 150 times.
✗ Branch 127 not taken.
✓ Branch 128 taken 12 times.
✗ Branch 129 not taken.
✗ Branch 130 not taken.
✗ Branch 131 not taken.
✓ Branch 132 taken 21 times.
✗ Branch 133 not taken.
✓ Branch 134 taken 9941 times.
✓ Branch 135 taken 9 times.
✓ Branch 136 taken 3 times.
✓ Branch 137 taken 601 times.
✓ Branch 138 taken 3 times.
✗ Branch 139 not taken.
✗ Branch 140 not taken.
✓ Branch 141 taken 613 times.
✓ Branch 142 taken 6 times.
✓ Branch 143 taken 598 times.
✓ Branch 144 taken 9 times.
✗ Branch 145 not taken.
✗ Branch 146 not taken.
✓ Branch 147 taken 1993 times.
✓ Branch 148 taken 252 times.
✓ Branch 149 taken 12 times.
✗ Branch 150 not taken.
✓ Branch 151 taken 9 times.
✗ Branch 152 not taken.
✗ Branch 153 not taken.
✗ Branch 154 not taken.
✗ Branch 155 not taken.
✓ Branch 156 taken 9 times.
✗ Branch 157 not taken.
✓ Branch 158 taken 12 times.
✗ Branch 159 not taken.
✗ Branch 160 not taken.
✗ Branch 161 not taken.
✓ Branch 162 taken 9 times.
✗ Branch 163 not taken.
✓ Branch 164 taken 9 times.
✗ Branch 165 not taken.
✓ Branch 166 taken 3 times.
✗ Branch 167 not taken.
✓ Branch 168 taken 9 times.
✗ Branch 169 not taken.
✓ Branch 170 taken 9 times.
✗ Branch 171 not taken.
✗ Branch 172 not taken.
✗ Branch 173 not taken.
✓ Branch 174 taken 93 times.
✗ Branch 175 not taken.
✓ Branch 176 taken 189 times.
✗ Branch 177 not taken.
✓ Branch 178 taken 180 times.
✗ Branch 179 not taken.
✓ Branch 180 taken 9 times.
✗ Branch 181 not taken.
✓ Branch 182 taken 3 times.
✗ Branch 183 not taken.
✓ Branch 184 taken 72 times.
✗ Branch 185 not taken.
✓ Branch 186 taken 180 times.
✗ Branch 187 not taken.
✗ Branch 188 not taken.
✗ Branch 189 not taken.
✓ Branch 190 taken 12 times.
✗ Branch 191 not taken.
✓ Branch 192 taken 9 times.
✗ Branch 193 not taken.
✓ Branch 194 taken 18 times.
✗ Branch 195 not taken.
✓ Branch 196 taken 27 times.
✗ Branch 197 not taken.
✓ Branch 198 taken 51 times.
✗ Branch 199 not taken.
✓ Branch 200 taken 33 times.
✗ Branch 201 not taken.
✓ Branch 202 taken 42 times.
✗ Branch 203 not taken.
✓ Branch 204 taken 51 times.
✗ Branch 205 not taken.
✓ Branch 206 taken 51 times.
✗ Branch 207 not taken.
✓ Branch 208 taken 45 times.
✗ Branch 209 not taken.
✓ Branch 210 taken 33 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 90 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 105 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 279 times.
✓ Branch 217 taken 3 times.
✓ Branch 218 taken 81 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 99 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 99 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 84 times.
✓ Branch 225 taken 3 times.
✓ Branch 226 taken 81 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 1170 times.
✓ Branch 229 taken 35523 times.
✓ Branch 230 taken 6039 times.
✓ Branch 231 taken 30789 times.
✓ Branch 232 taken 18 times.
✓ Branch 233 taken 6015 times.
✓ Branch 234 taken 24 times.
✓ Branch 235 taken 27 times.
✓ Branch 236 taken 24 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 27 times.
✗ Branch 239 not taken.
✓ Branch 240 taken 9 times.
✗ Branch 241 not taken.
✓ Branch 242 taken 18 times.
✗ Branch 243 not taken.
✓ Branch 244 taken 27 times.
✗ Branch 245 not taken.
✓ Branch 246 taken 27 times.
✗ Branch 247 not taken.
✓ Branch 248 taken 9 times.
✗ Branch 249 not taken.
✓ Branch 250 taken 9 times.
✗ Branch 251 not taken.
✓ Branch 252 taken 18 times.
✗ Branch 253 not taken.
✓ Branch 254 taken 27 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 27 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 9 times.
✗ Branch 259 not taken.
✓ Branch 260 taken 9 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 18 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 27 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 27 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 27 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 27 times.
✗ Branch 271 not taken.
✓ Branch 272 taken 9 times.
✗ Branch 273 not taken.
✓ Branch 274 taken 9 times.
✗ Branch 275 not taken.
✓ Branch 276 taken 9 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 18 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 27 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 27 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 9 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 18 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 27 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 27 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 54 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 54 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 54 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 108 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 162 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 162 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 54 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 108 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 162 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 162 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 54 times.
✗ Branch 313 not taken.
✓ Branch 314 taken 54 times.
✗ Branch 315 not taken.
✓ Branch 316 taken 54 times.
✗ Branch 317 not taken.
✓ Branch 318 taken 54 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 9 times.
✗ Branch 321 not taken.
✓ Branch 322 taken 9 times.
✗ Branch 323 not taken.
✓ Branch 324 taken 9 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 not taken.
✗ Branch 339 not taken.
✓ Branch 340 taken 9 times.
✗ Branch 341 not taken.
✓ Branch 342 taken 9 times.
✗ Branch 343 not taken.
✓ Branch 344 taken 9 times.
✗ Branch 345 not taken.
✗ Branch 346 not taken.
✗ Branch 347 not taken.
✓ Branch 348 taken 9 times.
✗ Branch 349 not taken.
✓ Branch 350 taken 9 times.
✗ Branch 351 not taken.
✗ Branch 352 not taken.
✗ Branch 353 not taken.
✓ Branch 354 taken 9 times.
✗ Branch 355 not taken.
✓ Branch 356 taken 9 times.
✗ Branch 357 not taken.
✓ Branch 358 taken 9 times.
✗ Branch 359 not taken.
✗ Branch 360 not taken.
✗ Branch 361 not taken.
✓ Branch 362 taken 9 times.
✗ Branch 363 not taken.
✗ Branch 364 not taken.
✗ Branch 365 not taken.
 10288422 return cached_data;
32 }
33
34 188561 char *temp_raw() const //things to cleanup and take a look at
35 {
36
4/8
✓ Branch 0 taken 165504 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7140 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2313 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 180 times.
✗ Branch 7 not taken.
 401236 return cached_data;
37 }
38
39 3342141 char *raw() const
40 {
41
5/8
✓ Branch 0 taken 2106 times.
✓ Branch 1 taken 84429 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.
 7468078 return cached_data;
42 }
43
44 6995174 int length() const
45 {
46
2/2
✓ Branch 0 taken 6828750 times.
✓ Branch 1 taken 166424 times.
 15828848 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 6928668 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 41063 times.
✓ Branch 1 taken 6887605 times.
 6928668 if(length > max_inline_length_){
52 41063 inlined.len = (unsigned char)-1;
53 41063 allocated.len = length;
54 }else{
55 6887605 inlined.len = length;
56 }
57 6928668 }
58
59 1188 void truncate(int newlen)
60 {
61 2376 resize(newlen);
62 2376 }
63
64 2029465 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 12331 times.
✓ Branch 1 taken 2017134 times.
 2029465 if (!newstr) newstr = "";
67 2029465 assign(newstr, strlen(newstr));
68 2029465 }
69
70 1358055 void assign(const string &newstr)
71 {
72 1358055 assign(newstr, newstr.length());
73 1358055 }
74
75 3648929 void assign(const char * newstr, int end)
76 {
77 3648929 resize(end);
78 3648929 copy(newstr, length(), cached_data);
79 3648929 }
80
81
82 365895 string& operator=(const char * newstr)
83 {
84 812830 assign(newstr);
85 375545 return *this;
86 }
87
88 430418 string& operator=(const string &newstr)
89 {
90 558428 assign(newstr);
91 462528 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 220947 string& operator+=(const string& other)
111 {
112 86677 int current_end = length();
113 220947 resize(length() + other.length());
114 355217 copy(other.cached_data, other.length(), cached_data + current_end);
115 220947 return *this;
116 }
117
118 678310 string& operator+=(const char *other)
119 {
120 296065 int current_end = length();
121 678310 int otherlen=(int)strlen(other);
122 678310 resize(length() + otherlen);
123 678310 copy(other, otherlen, cached_data + current_end);
124 678310 return *this;
125 }
126
127 2368306 string& operator+=(char c)
128 {
129 2368306 resize(length() + 1);
130 3733181 cached_data[length() - 1] = c;
131 2368306 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 58330 string operator+(const char * right) const
142 {
143 58330 string ret=*this;
144
1/2
✓ Branch 0 taken 58330 times.
✗ Branch 1 not taken.
 149661 ret+=right;
145 63916 return ret;
146 ✗ }
147
148 21418 bool operator==(const char * right) const
149 {
150 21418 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 28026 bool operator!=(const char * right) const
159 {
160 28026 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 3923042 operator const char*() const
169 {
170 3923042 return data();
171 }
172
173 36200 explicit operator bool() const
174 {
175 36200 return length();
176 }
177
178 4527931 string()
179 4527931 {
180 //todo reduce I know this isn't all needed
181 4527931 allocated.bufferlen = 0;
182 4527931 allocated.str = 0;
183 4527931 allocated.len = 0;
184 4527931 inlined.len = 0;
185 4527931 cached_data = inlined.str;
186 4527931 next_resize = max_inline_length_+1;
187
188 3542920 }
189 1017763 string(const char * newstr) : string()
190 {
191
1/2
✓ Branch 0 taken 467346 times.
✗ Branch 1 not taken.
 1017763 assign(newstr);
192 920810 }
193 228669 string(const char * newstr, int newlen) : string()
194 {
195
1/2
✓ Branch 0 taken 105132 times.
✗ Branch 1 not taken.
 228669 assign(newstr, newlen);
196 228642 }
197 198872 string(const string& old) : string()
198 {
199
1/2
✓ Branch 0 taken 82970 times.
✗ Branch 1 not taken.
 198872 assign(old.data());
200 198551 }
201
202 25263 string(string &&move) : string()
203 {
204
1/2
✓ Branch 0 taken 9537 times.
✗ Branch 1 not taken.
 9537 *this = move;
205 25263 }
206
207 390405 string& operator=(string&& move)
208 {
209
2/2
✓ Branch 0 taken 86 times.
✓ Branch 1 taken 139787 times.
 139959 if(!is_inlined()) free(allocated.str);
210
2/2
✓ Branch 0 taken 112 times.
✓ Branch 1 taken 139761 times.
 390405 if(!move.is_inlined()){
211 236 allocated.str = move.allocated.str;
212 236 allocated.bufferlen = move.allocated.bufferlen;
213 236 set_length(move.allocated.len);
214
215 236 move.inlined.len = 0;
216 236 move.inlined.str[0] = 0;
217 236 cached_data = allocated.str;
218 236 next_resize = move.next_resize;
219
220 }else{
221 390169 inlined.len = 0;
222 390169 cached_data = inlined.str;
223 390169 next_resize = max_inline_length_+1;
224 390169 assign(move);
225 }
226 390405 return *this;
227 }
228
229 11158243 ~string()
230 {
231
2/2
✓ Branch 0 taken 9846 times.
✓ Branch 1 taken 1954101 times.
 6561095 if(!is_inlined()){
232 32430 free(allocated.str);
233 }
234 11158243 }
235
236 //maybe these should return refs to chain. but also good not to encourage chaining
237 5131 void strip_prefix(char c)
238 {
239
2/2
✓ Branch 0 taken 1466 times.
✓ Branch 1 taken 3665 times.
 5131 if(cached_data[0] == c){
240
3/6
✓ Branch 0 taken 734 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 734 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 734 times.
✗ Branch 5 not taken.
 1466 *this = string(cached_data + 1, length() - 1);
241 }
242 5131 }
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 6928432 void resize(int new_length)
299 {
300 3000055 const char *old_data = data();
301
8/8
✓ Branch 0 taken 6905193 times.
✓ Branch 1 taken 23239 times.
✓ Branch 2 taken 8940 times.
✓ Branch 3 taken 2989595 times.
✓ Branch 4 taken 974 times.
✓ Branch 5 taken 7853 times.
✓ Branch 6 taken 12342 times.
✓ Branch 7 taken 2987713 times.
 6938280 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
302
7/8
✓ Branch 0 taken 23239 times.
✓ Branch 1 taken 1087 times.
✓ Branch 2 taken 462 times.
✓ Branch 3 taken 11282 times.
✓ Branch 4 taken 462 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 11368 times.
✓ Branch 7 taken 974 times.
 24702 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
303 23239 int new_size = bitround(new_length + 1);
304
2/2
✓ Branch 0 taken 22401 times.
✓ Branch 1 taken 838 times.
 23239 if(old_data == inlined.str){
305
1/2
✓ Branch 0 taken 11495 times.
✗ Branch 1 not taken.
 33896 allocated.str = copy(old_data, min(length(), new_length), (char *)malloc(new_size));
306 }else{
307 838 allocated.str = (char *)realloc(allocated.str, new_size);
308 462 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
309 }
310 23239 allocated.bufferlen = new_size;
311 23239 cached_data = allocated.str;
312 23239 next_resize = allocated.bufferlen;
313
5/6
✓ Branch 0 taken 974 times.
✓ Branch 1 taken 113 times.
✓ Branch 2 taken 974 times.
✓ Branch 3 taken 113 times.
✓ Branch 4 taken 974 times.
✗ Branch 5 not taken.
 1087 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
314 1087 copy(old_data, new_length, inlined.str);
315 1087 cached_data = inlined.str;
316 1087 next_resize = max_inline_length_+1;
317 }
318
5/6
✓ Branch 0 taken 1087 times.
✓ Branch 1 taken 23239 times.
✓ Branch 2 taken 1087 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 974 times.
✓ Branch 5 taken 11368 times.
 24326 if(old_data != inlined.str && old_data != data()){
319 1087 free((char *)old_data);
320 }
321 }
322 6928432 set_length(new_length);
323
324 6928432 raw()[new_length] = 0; //always ensure null terminator
325 6928432 }
326
327 12238922 bool is_inlined() const
328 {
329
52/82
✓ Branch 0 taken 1161449 times.
✓ Branch 1 taken 2695008 times.
✓ Branch 2 taken 995442 times.
✓ Branch 3 taken 1232339 times.
✓ Branch 4 taken 15594 times.
✓ Branch 5 taken 2274 times.
✓ Branch 6 taken 366 times.
✓ Branch 7 taken 9 times.
✓ Branch 8 taken 42211 times.
✓ Branch 9 taken 1625942 times.
✓ Branch 10 taken 34957 times.
✓ Branch 11 taken 875056 times.
✓ Branch 12 taken 149524 times.
✓ Branch 13 taken 178824 times.
✓ Branch 14 taken 1120789 times.
✓ Branch 15 taken 70909 times.
✓ Branch 16 taken 2531366 times.
✓ Branch 17 taken 38969 times.
✓ Branch 18 taken 622079 times.
✓ Branch 19 taken 782 times.
✓ Branch 20 taken 238867 times.
✓ Branch 21 taken 882 times.
✓ Branch 22 taken 228981 times.
✓ Branch 23 taken 923 times.
✓ Branch 24 taken 842817 times.
✓ Branch 25 taken 4788 times.
✓ Branch 26 taken 314018 times.
✓ Branch 27 taken 5536 times.
✓ Branch 28 taken 97858 times.
✓ Branch 29 taken 5413 times.
✓ Branch 30 taken 96703 times.
✓ Branch 31 taken 5413 times.
✓ 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 2286 times.
✗ Branch 41 not taken.
✓ Branch 42 taken 3528 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 3645 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 4428 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 226203 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 1062 times.
✗ Branch 74 not taken.
✓ Branch 75 taken 1062 times.
✓ Branch 76 taken 34851 times.
✗ Branch 77 not taken.
✗ Branch 78 not taken.
✗ Branch 79 not taken.
✗ Branch 80 not taken.
✗ Branch 81 not taken.
 27504473 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 ✗ inline string hex(unsigned int value)
347 {
348 char buffer[64];
349 if(0);
350 ✗ else if (value<=0x000000FF) sprintf(buffer, "%.2X", value);
351 ✗ else if (value<=0x0000FFFF) sprintf(buffer, "%.4X", value);
352 ✗ else if (value<=0x00FFFFFF) sprintf(buffer, "%.6X", value);
353 ✗ else sprintf(buffer, "%.8X", value);
354 ✗ return buffer;
355 }
356
357 718 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 718 sprintf(buffer, "%.*X", width, value);
361
1/2
✓ Branch 0 taken 359 times.
✗ Branch 1 not taken.
 1077 return buffer;
362 }
363
364 20327 inline string dec(int value)
365 {
366 char buffer[64];
367 20327 sprintf(buffer, "%i", value);
368
1/2
✓ Branch 0 taken 8131 times.
✗ Branch 1 not taken.
 28458 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 266278 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 908499 times.
✓ Branch 1 taken 26175 times.
 934674 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 573503 times.
✓ Branch 1 taken 334996 times.
 908499 if (to_lower(str[i])!=to_lower(key[i])) return false;
420 }
421 5589 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 1891737 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 2603925 times.
✓ Branch 1 taken 116138 times.
 2720063 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 1225453 times.
✓ Branch 1 taken 1378472 times.
 2603925 if(to_lower(*word1++) != *word2++) return true;
453 }
454 116138 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 29559 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 17886 times.
✓ Branch 1 taken 11673 times.
 29559 if (*str!='"') return str;
465 27306 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 27306 times.
✗ Branch 1 not taken.
 27306 if (end)
467 {
468 27306 *end = 0;
469 27306 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 27306 times.
 27738 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 10557 return str + 1;
472 }
473 ✗ return nullptr;
474 }
475
476 36393 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 342146 times.
✓ Branch 1 taken 25344 times.
 367490 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 11043 times.
✓ Branch 1 taken 331103 times.
 342146 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 329262 times.
✓ Branch 1 taken 1841 times.
✓ Branch 2 taken 534 times.
✓ Branch 3 taken 328728 times.
 331103 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 1841 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 504 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 2375 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 1207 char delimiter = *str;
489
490 do
491 {
492 27031 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 24692 times.
✓ Branch 1 taken 2339 times.
✓ Branch 2 taken 24686 times.
✓ Branch 3 taken 6 times.
 27031 } 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 1138 times.
✓ Branch 1 taken 1207 times.
 2345 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 331097 str++;
503 }
504
505 12701 return nullptr;
506 }
507
508 3921 inline string substr(const char * str, int len)
509 {
510 3921 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 206493 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11182 times.
✓ Branch 1 taken 206493 times.
 217675 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 191564 times.
✓ Branch 1 taken 62305 times.
 253869 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 144188 times.
✓ Branch 1 taken 47376 times.
 191564 if(!is_space(str[i]))
524 {
525 144188 str[i + 1] = 0;
526 144188 return str;
527 }
528 }
529 31178 return str;
530 }
531 6867 inline void strip_whitespace(string &str)
532 {
533
2/4
✓ Branch 0 taken 3439 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 3439 times.
✗ Branch 3 not taken.
 10295 str = string(strip_whitespace(str.temp_raw()));
534 6867 }
535
536 string &itrim(string &str, const char * left, const char * right);
537
538
2/2
✓ Branch 0 taken 34131 times.
✓ Branch 1 taken 66 times.
 34284 inline string &lower(string &old)
539 {
540 87 int length = old.length();
541
2/2
✓ Branch 0 taken 960789 times.
✓ Branch 1 taken 34284 times.
 995073 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
542 34284 return old;
543 }
544
545
546 // Returns number of connected lines - 1
547 template<typename stringarraytype>
548 146001 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 69984 int count = 0;
551
552
1/2
✓ Branch 0 taken 146055 times.
✗ Branch 1 not taken.
 146055 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 146055 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 106977 times.
✓ Branch 1 taken 39078 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 106923 times.
 146055 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 69984 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 69984 times.
✗ Branch 3 not taken.
 146001 out += string(lines[i], linestartpos);
566 146001 return count;
567 }
568 }
569
570 ✗ return count;
571 }
572