asar coverage - build #161

src/asar/
File: src/asar/libstr.h
Date: 2024-01-27 02:12:20
Lines:
264/287
92.0%
Functions:
60/64
93.8%
Branches:
437/653
66.9%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4 //ty alcaro
5 extern const unsigned char char_props[256];
6 27387591 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
7 158761 static inline int to_upper(unsigned char c) { return c&~(char_props[c]&0x20); }
8
9
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
 864274 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
10 10071992 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
11 3018 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
12 3570 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
13 4802 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
14 25202 inline bool is_alnum(unsigned char c) { return char_props[c] & 0x60; }
15 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
16 1336842 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
17
4/4
✓ Branch 0 taken 4530 times.
✓ Branch 1 taken 4747 times.
✓ Branch 2 taken 4770 times.
✓ Branch 3 taken 1366 times.
 30826 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
18
19 8739189 inline char *copy(const char *source, int copy_length, char *dest)
20 {
21 17049488 memmove(dest, source, copy_length*sizeof(char));
22 8739189 return dest;
23 }
24
25 434818 inline int min_val(int a, int b)
26 {
27
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 434818 times.
 434818 return a > b ? b : a;
28 }
29
30 440472 inline int bit_round(int v)
31 {
32 440472 v--;
33 440472 v |= v >> 1;
34 440472 v |= v >> 2;
35 440472 v |= v >> 4;
36 440472 v |= v >> 8;
37 440472 v |= v >> 16;
38 440472 v++;
39 440472 return v;
40 }
41
42 class string {
43 public:
44 27901825 const char *data() const
45 {
46
233/388
✓ Branch 0 taken 1706 times.
✓ Branch 1 taken 51205 times.
✓ Branch 2 taken 54829 times.
✓ Branch 3 taken 1221 times.
✓ Branch 4 taken 1570 times.
✓ Branch 5 taken 538288 times.
✓ Branch 6 taken 1033 times.
✓ Branch 7 taken 538936 times.
✓ Branch 8 taken 689 times.
✓ Branch 9 taken 327474 times.
✓ Branch 10 taken 51 times.
✓ Branch 11 taken 742 times.
✓ Branch 12 taken 827 times.
✓ Branch 13 taken 326858 times.
✓ Branch 14 taken 207 times.
✓ Branch 15 taken 804 times.
✓ Branch 16 taken 2065014 times.
✓ Branch 17 taken 6441 times.
✓ Branch 18 taken 627 times.
✓ Branch 19 taken 300 times.
✓ Branch 20 taken 26 times.
✓ Branch 21 taken 324 times.
✓ Branch 22 taken 326 times.
✓ Branch 23 taken 102 times.
✓ Branch 24 taken 99 times.
✓ Branch 25 taken 74 times.
✓ Branch 26 taken 5745 times.
✓ Branch 27 taken 231 times.
✓ Branch 28 taken 123 times.
✓ Branch 29 taken 6 times.
✓ Branch 30 taken 102 times.
✓ Branch 31 taken 516 times.
✗ Branch 32 not taken.
✗ Branch 33 not taken.
✓ Branch 34 taken 114 times.
✓ Branch 35 taken 467 times.
✓ Branch 36 taken 2 times.
✓ Branch 37 taken 162 times.
✓ Branch 38 taken 3 times.
✓ Branch 39 taken 99 times.
✓ Branch 40 taken 436151 times.
✓ Branch 41 taken 251 times.
✓ Branch 42 taken 16 times.
✓ Branch 43 taken 436056 times.
✓ Branch 44 taken 115 times.
✓ Branch 45 taken 1318 times.
✓ Branch 46 taken 436893 times.
✓ Branch 47 taken 107 times.
✓ Branch 48 taken 6 times.
✓ Branch 49 taken 437688 times.
✓ Branch 50 taken 39 times.
✓ Branch 51 taken 55 times.
✓ Branch 52 taken 9 times.
✓ Branch 53 taken 18875 times.
✓ Branch 54 taken 54 times.
✓ Branch 55 taken 69 times.
✓ Branch 56 taken 107440 times.
✗ Branch 57 not taken.
✓ Branch 58 taken 146 times.
✓ Branch 59 taken 42 times.
✗ Branch 60 not taken.
✓ Branch 61 taken 60 times.
✓ Branch 62 taken 114 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 33 times.
✓ Branch 65 taken 12 times.
✓ Branch 66 taken 183 times.
✓ Branch 67 taken 1300 times.
✓ Branch 68 taken 18 times.
✓ Branch 69 taken 299 times.
✓ Branch 70 taken 17 times.
✓ Branch 71 taken 6 times.
✓ Branch 72 taken 24 times.
✓ Branch 73 taken 105502 times.
✗ Branch 74 not taken.
✓ Branch 75 taken 24 times.
✓ Branch 76 taken 105497 times.
✓ Branch 77 taken 1354 times.
✗ Branch 78 not taken.
✓ Branch 79 taken 105497 times.
✓ Branch 80 taken 8 times.
✓ Branch 81 taken 3 times.
✓ Branch 82 taken 11 times.
✓ Branch 83 taken 24 times.
✓ Branch 84 taken 212010 times.
✓ Branch 85 taken 6 times.
✓ Branch 86 taken 211989 times.
✓ Branch 87 taken 45 times.
✓ Branch 88 taken 42 times.
✓ Branch 89 taken 1301 times.
✓ Branch 90 taken 50 times.
✓ Branch 91 taken 20 times.
✓ Branch 92 taken 42 times.
✓ Branch 93 taken 50 times.
✓ Branch 94 taken 42 times.
✓ Branch 95 taken 14 times.
✗ Branch 96 not taken.
✓ Branch 97 taken 36 times.
✗ Branch 98 not taken.
✓ Branch 99 taken 60 times.
✓ Branch 100 taken 1240 times.
✗ Branch 101 not taken.
✓ Branch 102 taken 10 times.
✓ Branch 103 taken 3 times.
✗ Branch 104 not taken.
✓ Branch 105 taken 30 times.
✓ Branch 106 taken 3 times.
✗ Branch 107 not taken.
✓ Branch 108 taken 90 times.
✓ Branch 109 taken 252 times.
✓ Branch 110 taken 30 times.
✓ Branch 111 taken 1255 times.
✓ Branch 112 taken 3 times.
✓ Branch 113 taken 30 times.
✓ Branch 114 taken 15 times.
✗ Branch 115 not taken.
✓ Branch 116 taken 10 times.
✗ Branch 117 not taken.
✓ Branch 118 taken 6 times.
✓ Branch 119 taken 30 times.
✗ Branch 120 not taken.
✓ Branch 121 taken 3 times.
✓ Branch 122 taken 30 times.
✗ Branch 123 not taken.
✓ Branch 124 taken 1237 times.
✓ Branch 125 taken 27 times.
✗ Branch 126 not taken.
✓ Branch 127 taken 89 times.
✓ Branch 128 taken 3 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 261 times.
✗ Branch 131 not taken.
✗ Branch 132 not taken.
✓ Branch 133 taken 132 times.
✗ Branch 134 not taken.
✗ Branch 135 not taken.
✓ Branch 136 taken 261 times.
✗ Branch 137 not taken.
✗ Branch 138 not taken.
✓ Branch 139 taken 3 times.
✓ Branch 140 taken 979 times.
✗ Branch 141 not taken.
✗ Branch 142 not taken.
✓ Branch 143 taken 13 times.
✗ Branch 144 not taken.
✓ Branch 145 taken 3 times.
✓ Branch 146 taken 39 times.
✗ Branch 147 not taken.
✓ Branch 148 taken 3 times.
✓ Branch 149 taken 33 times.
✗ Branch 150 not taken.
✗ Branch 151 not taken.
✓ Branch 152 taken 6 times.
✗ Branch 153 not taken.
✓ Branch 154 taken 3 times.
✓ Branch 155 taken 3 times.
✗ Branch 156 not taken.
✓ Branch 157 taken 3 times.
✓ Branch 158 taken 24 times.
✗ Branch 159 not taken.
✓ Branch 160 taken 15 times.
✓ Branch 161 taken 27 times.
✓ Branch 162 taken 15 times.
✓ Branch 163 taken 3 times.
✓ Branch 164 taken 27 times.
✓ Branch 165 taken 16 times.
✓ Branch 166 taken 3 times.
✓ Branch 167 taken 303 times.
✗ Branch 168 not taken.
✗ Branch 169 not taken.
✓ Branch 170 taken 910 times.
✓ Branch 171 taken 2930 times.
✓ Branch 172 taken 3 times.
✓ Branch 173 taken 743 times.
✓ Branch 174 taken 180 times.
✓ Branch 175 taken 3 times.
✗ Branch 176 not taken.
✗ Branch 177 not taken.
✓ Branch 178 taken 180 times.
✗ Branch 179 not taken.
✓ Branch 180 taken 180 times.
✓ Branch 181 taken 3 times.
✗ Branch 182 not taken.
✗ Branch 183 not taken.
✓ Branch 184 taken 836 times.
✓ Branch 185 taken 70 times.
✗ Branch 186 not taken.
✗ Branch 187 not taken.
✗ Branch 188 not taken.
✗ Branch 189 not taken.
✓ Branch 190 taken 30 times.
✗ Branch 191 not taken.
✗ Branch 192 not taken.
✓ Branch 193 taken 63 times.
✗ Branch 194 not taken.
✗ Branch 195 not taken.
✓ Branch 196 taken 60 times.
✗ Branch 197 not taken.
✗ Branch 198 not taken.
✓ Branch 199 taken 3 times.
✗ Branch 200 not taken.
✗ Branch 201 not taken.
✗ Branch 202 not taken.
✗ Branch 203 not taken.
✗ Branch 204 not taken.
✓ Branch 205 taken 24 times.
✗ Branch 206 not taken.
✗ Branch 207 not taken.
✓ Branch 208 taken 60 times.
✗ Branch 209 not taken.
✗ Branch 210 not taken.
✗ Branch 211 not taken.
✓ Branch 212 taken 3 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 3 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 6 times.
✗ Branch 217 not taken.
✓ Branch 218 taken 9 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 9 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 3 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 6 times.
✗ Branch 225 not taken.
✓ Branch 226 taken 9 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 9 times.
✗ Branch 229 not taken.
✓ Branch 230 taken 3 times.
✗ Branch 231 not taken.
✓ Branch 232 taken 3 times.
✗ Branch 233 not taken.
✓ Branch 234 taken 6 times.
✗ Branch 235 not taken.
✓ Branch 236 taken 9 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 9 times.
✗ Branch 239 not taken.
✓ Branch 240 taken 6 times.
✗ Branch 241 not taken.
✓ Branch 242 taken 9 times.
✗ Branch 243 not taken.
✓ Branch 244 taken 9 times.
✗ Branch 245 not taken.
✓ Branch 246 taken 3 times.
✗ Branch 247 not taken.
✓ Branch 248 taken 3 times.
✗ Branch 249 not taken.
✓ Branch 250 taken 3 times.
✗ Branch 251 not taken.
✓ Branch 252 taken 6 times.
✗ Branch 253 not taken.
✓ Branch 254 taken 9 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 9 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 3 times.
✗ Branch 259 not taken.
✓ Branch 260 taken 6 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 9 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 9 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 3 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 3 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 6 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 3 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 3 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 6 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 9 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 9 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 9 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 9 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 3 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 3 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 3 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 6 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 9 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 9 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 3 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 6 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 9 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 9 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 18 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 18 times.
✗ Branch 313 not taken.
✓ Branch 314 taken 18 times.
✗ Branch 315 not taken.
✓ Branch 316 taken 36 times.
✗ Branch 317 not taken.
✓ Branch 318 taken 54 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 54 times.
✗ Branch 321 not taken.
✓ Branch 322 taken 18 times.
✗ Branch 323 not taken.
✓ Branch 324 taken 36 times.
✗ Branch 325 not taken.
✓ Branch 326 taken 54 times.
✗ Branch 327 not taken.
✓ Branch 328 taken 54 times.
✗ Branch 329 not taken.
✓ Branch 330 taken 18 times.
✗ Branch 331 not taken.
✓ Branch 332 taken 18 times.
✗ Branch 333 not taken.
✓ Branch 334 taken 18 times.
✗ Branch 335 not taken.
✓ Branch 336 taken 18 times.
✗ Branch 337 not taken.
✓ Branch 338 taken 3 times.
✗ Branch 339 not taken.
✓ Branch 340 taken 3 times.
✗ Branch 341 not taken.
✓ Branch 342 taken 3 times.
✗ Branch 343 not taken.
✓ Branch 344 taken 3 times.
✗ Branch 345 not taken.
✓ Branch 346 taken 3 times.
✗ Branch 347 not taken.
✓ Branch 348 taken 3 times.
✗ Branch 349 not taken.
✓ Branch 350 taken 3 times.
✗ Branch 351 not taken.
✓ Branch 352 taken 3 times.
✗ Branch 353 not taken.
✓ Branch 354 taken 3 times.
✗ Branch 355 not taken.
✗ Branch 356 not taken.
✗ Branch 357 not taken.
✓ Branch 358 taken 3 times.
✗ Branch 359 not taken.
✓ Branch 360 taken 3 times.
✗ Branch 361 not taken.
✓ Branch 362 taken 3 times.
✗ Branch 363 not taken.
✗ Branch 364 not taken.
✗ Branch 365 not taken.
✓ Branch 366 taken 3 times.
✗ Branch 367 not taken.
✓ Branch 368 taken 3 times.
✗ Branch 369 not taken.
✗ Branch 370 not taken.
✗ Branch 371 not taken.
✓ Branch 372 taken 3 times.
✗ Branch 373 not taken.
✓ Branch 374 taken 3 times.
✗ Branch 375 not taken.
✓ Branch 376 taken 3 times.
✗ Branch 377 not taken.
✗ Branch 378 not taken.
✗ Branch 379 not taken.
✓ Branch 380 taken 3 times.
✗ Branch 381 not taken.
✗ Branch 382 not taken.
✗ Branch 383 not taken.
✗ Branch 384 not taken.
✗ Branch 385 not taken.
✗ Branch 386 not taken.
✗ Branch 387 not taken.
 34891157 return cached_data;
47 }
48
49 876741 char *temp_raw() const //things to cleanup and take a look at
50 {
51
4/8
✓ Branch 0 taken 874759 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 36 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 465 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 57 times.
✗ Branch 7 not taken.
 1753482 return cached_data;
52 }
53
54 27162684 char *raw() const
55 {
56
1/2
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
 54310356 return cached_data;
57 }
58
59 27015988 int length() const
60 {
61
2/2
✓ Branch 0 taken 23894346 times.
✓ Branch 1 taken 3121642 times.
 52257033 return is_inlined() ? inlined.len : allocated.len;
62 }
63
64 28035724 void set_length(int length)
65 {
66
2/2
✓ Branch 0 taken 1761964 times.
✓ Branch 1 taken 26273760 times.
 28035724 if(length > max_inline_length_){
67 1761964 inlined.len = (unsigned char)-1;
68 1761964 allocated.len = length;
69 }else{
70 26273760 inlined.len = length;
71 }
72 28035724 }
73
74 873184 void truncate(int newlen)
75 {
76 1746368 resize(newlen);
77 1419559 }
78
79 5351862 void assign(const char * newstr)
80 {
81
2/2
✓ Branch 0 taken 198 times.
✓ Branch 1 taken 5351664 times.
 5351862 if (!newstr) newstr = "";
82 5351862 assign(newstr, strlen(newstr));
83 5351862 }
84
85 5893185 void assign(const string &newstr)
86 {
87 5893185 assign(newstr, newstr.length());
88 5893185 }
89
90 15688071 void assign(const char * newstr, int end)
91 {
92 15688071 resize(end);
93 7843268 copy(newstr, length(), raw());
94 15688071 }
95
96
97 550497 string& operator=(const char * newstr)
98 {
99 1100994 assign(newstr);
100 1097650 return *this;
101 }
102
103 1532951 string& operator=(const string &newstr)
104 {
105 2855661 assign(newstr);
106 1538689 return *this;
107 }
108
109 875056 string& operator+=(const string& other)
110 {
111 437528 int current_end = length();
112 875056 resize(length() + other.length());
113 875056 copy(other.data(), other.length(), raw() + current_end);
114 875056 return *this;
115 }
116
117 45852 string& operator+=(const char *other)
118 {
119 22926 int current_end = length();
120 45852 int otherlen=(int)strlen(other);
121 45852 resize(length() + otherlen);
122 45852 copy(other, otherlen, raw() + current_end);
123 45852 return *this;
124 }
125
126 9679328 string& operator+=(char c)
127 {
128 9679328 resize(length() + 1);
129 9679328 raw()[length() - 1] = c;
130 9679328 return *this;
131 }
132
133 string operator+(char right) const
134 {
135 string ret=*this;
136 ret+=right;
137 return ret;
138 }
139
140 21823 string operator+(const char * right) const
141 {
142 21823 string ret=*this;
143
1/2
✓ Branch 0 taken 21823 times.
✗ Branch 1 not taken.
 43646 ret+=right;
144 21894 return ret;
145 ✗ }
146
147 5410 bool operator==(const char * right) const
148 {
149 5410 return !strcmp(data(), right);
150 }
151
152 104 bool operator==(const string& right) const
153 {
154 104 return !strcmp(data(), right.data());
155 }
156
157 1666 bool operator!=(const char * right) const
158 {
159 1666 return (strcmp(data(), right) != 0);
160 }
161
162 bool operator!=(const string& right) const
163 {
164 return (strcmp(data(), right.data()) != 0);
165 }
166
167 9033919 operator const char*() const
168 {
169 9033919 return data();
170 }
171
172 429454 explicit operator bool() const
173 {
174 429454 return length();
175 }
176
177 16481056 string()
178 16481056 {
179 //todo reduce I know this isn't all needed
180 16481056 allocated.bufferlen = 0;
181 16481056 allocated.str = 0;
182 16481056 allocated.len = 0;
183 16481056 inlined.len = 0;
184 16481056 cached_data = inlined.str;
185 16481056 next_resize = max_inline_length_+1;
186
187 12807950 }
188 3780452 string(const char * newstr) : string()
189 {
190
1/2
✓ Branch 0 taken 1890226 times.
✗ Branch 1 not taken.
 3780452 assign(newstr);
191 3343049 }
192 2614602 string(const char * newstr, int newlen) : string()
193 {
194
1/2
✓ Branch 0 taken 1307301 times.
✗ Branch 1 not taken.
 2614602 assign(newstr, newlen);
195 2178200 }
196 470416 string(const string& old) : string()
197 {
198
1/2
✓ Branch 0 taken 235208 times.
✗ Branch 1 not taken.
 470416 assign(old.data());
199 470251 }
200
201 1074 string(string &&move) : string()
202 {
203
1/2
✓ Branch 0 taken 537 times.
✗ Branch 1 not taken.
 537 *this = move;
204 1074 }
205
206 2826908 string& operator=(string&& move)
207 {
208
2/2
✓ Branch 0 taken 469 times.
✓ Branch 1 taken 1412985 times.
 1413804 if(!is_inlined()) free(allocated.str);
209
2/2
✓ Branch 0 taken 580 times.
✓ Branch 1 taken 1412874 times.
 2826908 if(!move.is_inlined()){
210 1049 allocated.str = move.allocated.str;
211 1049 allocated.bufferlen = move.allocated.bufferlen;
212 1049 set_length(move.allocated.len);
213
214 1049 move.inlined.len = 0;
215 1049 move.inlined.str[0] = 0;
216 1049 cached_data = allocated.str;
217 1049 next_resize = move.next_resize;
218
219 }else{
220 2825859 inlined.len = 0;
221 2825859 cached_data = inlined.str;
222 2825859 next_resize = max_inline_length_+1;
223 2825859 assign(move);
224 }
225 2826908 return *this;
226 }
227
228 41079365 ~string()
229 {
230
2/2
✓ Branch 0 taken 433700 times.
✓ Branch 1 taken 7806817 times.
 24659941 if(!is_inlined()){
231 442756 free(allocated.str);
232 }
233 41079365 }
234
235 string& replace(const char * instr, const char * outstr, bool all=true);
236 string& qreplace(const char * instr, const char * outstr, bool all=true);
237
238 #ifdef SERIALIZER
239 void serialize(serializer & s)
240 {
241 s(str, allocated.bufferlen);
242 set_length(strlen(str));
243 }
244 #endif
245 #define SERIALIZER_BANNED
246
247 private:
248 static const int scale_factor = 3; //scale sso
249 static const int max_inline_length_ = ((sizeof(char *) + sizeof(int) * 2) * scale_factor) - 2;
250 char *cached_data;
251 int next_resize;
252 struct si{
253 char str[max_inline_length_ + 1];
254 unsigned char len;
255 };
256
257 struct sa{
258 char *str;
259 int len;
260 int bufferlen ;
261 };
262 union{
263 si inlined;
264 sa allocated;
265 };
266
267
268 28034675 void resize(int new_length)
269 {
270 14017931 const char *old_data = data();
271
8/8
✓ Branch 0 taken 27594203 times.
✓ Branch 1 taken 440472 times.
✓ Branch 2 taken 1304499 times.
✓ Branch 3 taken 12294994 times.
✓ Branch 4 taken 649 times.
✓ Branch 5 taken 1303787 times.
✓ Branch 6 taken 435806 times.
✓ Branch 7 taken 13582125 times.
 28051394 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
272
7/8
✓ Branch 0 taken 440472 times.
✓ Branch 1 taken 712 times.
✓ Branch 2 taken 339 times.
✓ Branch 3 taken 435154 times.
✓ Branch 4 taken 339 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 435157 times.
✓ Branch 7 taken 649 times.
 441520 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
273 440472 int new_size = bit_round(new_length + 1);
274
2/2
✓ Branch 0 taken 439797 times.
✓ Branch 1 taken 675 times.
 440472 if(old_data == inlined.str){
275
1/2
✓ Branch 0 taken 4979 times.
✗ Branch 1 not taken.
 444776 allocated.str = copy(old_data, min_val(length(), new_length), (char *)malloc(new_size));
276 }else{
277 675 allocated.str = (char *)realloc(allocated.str, new_size);
278 339 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
279 }
280 440472 allocated.bufferlen = new_size;
281 440472 cached_data = allocated.str;
282 440472 next_resize = allocated.bufferlen;
283
5/6
✓ Branch 0 taken 649 times.
✓ Branch 1 taken 63 times.
✓ Branch 2 taken 649 times.
✓ Branch 3 taken 63 times.
✓ Branch 4 taken 649 times.
✗ Branch 5 not taken.
 712 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
284 712 copy(old_data, new_length, inlined.str);
285 712 cached_data = inlined.str;
286 712 next_resize = max_inline_length_+1;
287 }
288
5/6
✓ Branch 0 taken 712 times.
✓ Branch 1 taken 440472 times.
✓ Branch 2 taken 712 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 649 times.
✓ Branch 5 taken 435157 times.
 441184 if(old_data != inlined.str && old_data != data()){
289 712 free((char *)old_data);
290 }
291 }
292 28034675 set_length(new_length);
293
294 28034675 raw()[new_length] = 0; //always ensure null terminator
295 28034675 }
296
297 52101344 bool is_inlined() const
298 {
299
36/40
✓ Branch 0 taken 1204462 times.
✓ Branch 1 taken 14005485 times.
✓ Branch 2 taken 41629 times.
✓ Branch 3 taken 15684 times.
✓ Branch 4 taken 1498 times.
✓ Branch 5 taken 86 times.
✓ Branch 6 taken 548068 times.
✓ Branch 7 taken 8205394 times.
✓ Branch 8 taken 543540 times.
✓ Branch 9 taken 2854 times.
✓ Branch 10 taken 179 times.
✓ Branch 11 taken 546459 times.
✓ Branch 12 taken 438761 times.
✓ Branch 13 taken 544048 times.
✓ Branch 14 taken 270282 times.
✓ Branch 15 taken 1387 times.
✓ Branch 16 taken 5254122 times.
✓ Branch 17 taken 8945 times.
✓ Branch 18 taken 4782073 times.
✓ Branch 19 taken 8069 times.
✓ Branch 20 taken 7838754 times.
✓ Branch 21 taken 8327 times.
✓ Branch 22 taken 3378836 times.
✓ Branch 23 taken 4762 times.
✓ Branch 24 taken 437282 times.
✓ Branch 25 taken 246 times.
✓ Branch 26 taken 437071 times.
✓ Branch 27 taken 866775 times.
✓ Branch 28 taken 347 times.
✓ Branch 29 taken 866532 times.
✓ Branch 30 taken 10254 times.
✓ Branch 31 taken 2670 times.
✓ Branch 32 taken 10116 times.
✓ Branch 33 taken 2808 times.
✓ Branch 34 taken 129 times.
✓ Branch 35 taken 72 times.
✗ Branch 36 not taken.
✗ Branch 37 not taken.
✗ Branch 38 not taken.
✗ Branch 39 not taken.
 100976246 return inlined.len != (unsigned char)-1;
300 }
301 };
302 #define STR (string)
303
304 char * readfile(const char * fname, const char * basepath);
305 char * readfilenative(const char * fname);
306 bool readfile(const char * fname, const char * basepath, char ** data, int * len);//if you want an uchar*, cast it
307 char ** nsplit(char * str, const char * key, int maxlen, int * len);
308 char ** qnsplit(char * str, const char * key, int maxlen, int * len);
309 char ** qpnsplit(char * str, const char * key, int maxlen, int * len);
310 1188 inline char ** split(char * str, const char * key, int * len= nullptr) { return nsplit(str, key, 0, len); }
311 1749240 inline char ** qsplit(char * str, const char * key, int * len= nullptr) { return qnsplit(str, key, 0, len); }
312 220144 inline char ** qpsplit(char * str, const char * key, int * len= nullptr) { return qpnsplit(str, key, 0, len); }
313 inline char ** split1(char * str, const char * key, int * len= nullptr) { return nsplit(str, key, 2, len); }
314 inline char ** qsplit1(char * str, const char * key, int * len= nullptr) { return qnsplit(str, key, 2, len); }
315 inline char ** qpsplit1(char * str, const char * key, int * len= nullptr) { return qpnsplit(str, key, 2, len); }
316 //void replace(string& str, const char * instr, const char * outstr, bool all);
317 //void qreplace(string& str, const char * instr, const char * outstr, bool all);
318 bool confirmquotes(const char * str);
319 bool confirmqpar(const char * str);
320 char* strqpchr(const char* str, char key);
321 char* strqpstr(const char* str, const char* key);
322
323 ✗ inline string hex(unsigned int value)
324 {
325 ✗ char buffer[64];
326 if(0);
327 ✗ else if (value<=0x000000FF) sprintf(buffer, "%.2X", value);
328 ✗ else if (value<=0x0000FFFF) sprintf(buffer, "%.4X", value);
329 ✗ else if (value<=0x00FFFFFF) sprintf(buffer, "%.6X", value);
330 ✗ else sprintf(buffer, "%.8X", value);
331 ✗ return buffer;
332 }
333
334 inline string hex(unsigned int value, int width)
335 {
336 char buffer[64];
337 sprintf(buffer, "%.*X", width, value);
338 return buffer;
339 }
340
341 inline string hex0(unsigned int value)
342 {
343 char buffer[64];
344 sprintf(buffer, "%X", value);
345 return buffer;
346 }
347
348 ✗ inline string hex2(unsigned int value)
349 {
350 ✗ char buffer[64];
351 ✗ sprintf(buffer, "%.2X", value);
352 ✗ return buffer;
353 }
354
355 inline string hex3(unsigned int value)
356 {
357 char buffer[64];
358 sprintf(buffer, "%.3X", value);
359 return buffer;
360 }
361
362 ✗ inline string hex4(unsigned int value)
363 {
364 ✗ char buffer[64];
365 ✗ sprintf(buffer, "%.4X", value);
366 ✗ return buffer;
367 }
368
369 inline string hex5(unsigned int value)
370 {
371 char buffer[64];
372 sprintf(buffer, "%.5X", value);
373 return buffer;
374 }
375
376 2 inline string hex6(unsigned int value)
377 {
378 1 char buffer[64];
379 2 sprintf(buffer, "%.6X", value);
380
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
 3 return buffer;
381 }
382
383 ✗ inline string hex8(unsigned int value)
384 {
385 ✗ char buffer[64];
386 ✗ sprintf(buffer, "%.8X", value);
387 ✗ return buffer;
388 }
389
390 1646 inline string dec(int value)
391 {
392 823 char buffer[64];
393 1646 sprintf(buffer, "%i", value);
394
1/2
✓ Branch 0 taken 823 times.
✗ Branch 1 not taken.
 2469 return buffer;
395 }
396
397 211206 inline string ftostr(double value)
398 {
399 // randomdude999: With 100 digits of precision, the buffer needs to be approx. 311+100,
400 // but let's be safe here https://stackoverflow.com/questions/7235456
401 105603 char rval[512];
402 // RPG Hacker: Ridiculously high precision, I know, but we're working with doubles
403 // here and can afford it, so no need to waste any precision
404 211206 sprintf(rval, "%.100f", value);
405
1/2
✓ Branch 0 taken 211206 times.
✗ Branch 1 not taken.
 211206 if (strchr(rval, '.'))//nuke useless zeroes
406 {
407 211206 char * end=strrchr(rval, '\0')-1;
408
2/2
✓ Branch 0 taken 21120252 times.
✓ Branch 1 taken 211206 times.
 21331458 while (*end=='0')
409 {
410 21120252 *end='\0';
411 21120252 end--;
412 }
413
2/2
✓ Branch 0 taken 211200 times.
✓ Branch 1 taken 6 times.
 211206 if (*end=='.') *end='\0';
414 }
415
1/2
✓ Branch 0 taken 105603 times.
✗ Branch 1 not taken.
 316809 return rval;
416 }
417
418 // Same as above, but with variable precision
419 46 inline string ftostrvar(double value, int precision)
420 {
421 23 int clampedprecision = precision;
422
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 23 times.
 23 if (clampedprecision < 0) clampedprecision = 0;
423
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 23 times.
 46 if (clampedprecision > 100) clampedprecision = 100;
424
425 // see above
426 23 char rval[512];
427 46 sprintf(rval, "%.*f", clampedprecision, (double)value);
428
2/2
✓ Branch 0 taken 44 times.
✓ Branch 1 taken 2 times.
 46 if (strchr(rval, '.'))//nuke useless zeroes
429 {
430 44 char * end = strrchr(rval, '\0') - 1;
431
2/2
✓ Branch 0 taken 138 times.
✓ Branch 1 taken 44 times.
 182 while (*end == '0')
432 {
433 138 *end = '\0';
434 138 end--;
435 }
436
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 26 times.
 44 if (*end == '.') *end = '\0';
437 }
438
1/2
✓ Branch 0 taken 23 times.
✗ Branch 1 not taken.
 69 return rval;
439 }
440
441 2800766 inline bool stribegin(const char * str, const char * key)
442 {
443
2/2
✓ Branch 0 taken 4061812 times.
✓ Branch 1 taken 219798 times.
 4281610 for (int i=0;key[i];i++)
444 {
445
2/2
✓ Branch 0 taken 2030906 times.
✓ Branch 1 taken 2030906 times.
 4061812 if (to_lower(str[i])!=to_lower(key[i])) return false;
446 }
447 109899 return true;
448 }
449
450 8358 inline bool striend(const char * str, const char * key)
451 {
452 8358 const char * keyend=strrchr(key, '\0');
453 8358 const char * strend=strrchr(str, '\0');
454
2/2
✓ Branch 0 taken 9234 times.
✓ Branch 1 taken 1446 times.
 10680 while (key!=keyend)
455 {
456 9234 keyend--;
457 9234 strend--;
458
2/2
✓ Branch 0 taken 4617 times.
✓ Branch 1 taken 4617 times.
 9234 if (to_lower(*strend)!=to_lower(*keyend)) return false;
459 }
460 723 return true;
461 }
462
463 141563 inline bool stricmpwithupper(const char *word1, const char *word2)
464 {
465
2/2
✓ Branch 0 taken 158761 times.
✓ Branch 1 taken 4344 times.
 163105 while(*word2)
466 {
467
2/2
✓ Branch 0 taken 89262 times.
✓ Branch 1 taken 69499 times.
 158761 if(to_upper(*word1++) != *word2++) return true;
468 }
469 4344 return *word1;
470 }
471
472 10589504 inline bool stricmpwithlower(const char *word1, const char *word2)
473 {
474
2/2
✓ Branch 0 taken 19107820 times.
✓ Branch 1 taken 1703806 times.
 20811626 while(*word2)
475 {
476
2/2
✓ Branch 0 taken 9606620 times.
✓ Branch 1 taken 9501200 times.
 19107820 if(to_lower(*word1++) != *word2++) return true;
477 }
478 1703806 return *word1;
479 }
480
481 //function: return the string without quotes around it, if any exists
482 //if they don't exist, return it unaltered
483 //it is not guaranteed to return str
484 //it is not guaranteed to not edit str
485 //the input must be freed even though it's garbage, the output must not
486 1508 inline const char * dequote(char * str)
487 {
488
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 1424 times.
 1508 if (*str!='"') return str;
489 712 int inpos=1;
490 712 int outpos=0;
491 while (true)
492 {
493
2/2
✓ Branch 0 taken 1568 times.
✓ Branch 1 taken 16818 times.
 18386 if (str[inpos]=='"')
494 {
495
2/2
✓ Branch 0 taken 144 times.
✓ Branch 1 taken 1424 times.
 1568 if (str[inpos+1]=='"') inpos++;
496
1/2
✓ Branch 0 taken 1424 times.
✗ Branch 1 not taken.
 1424 else if (str[inpos+1]=='\0') break;
497 ✗ else return nullptr;
498 }
499
2/2
✓ Branch 0 taken 8481 times.
✓ Branch 1 taken 8481 times.
 16962 if (!str[inpos]) return nullptr;
500 16962 str[outpos++]=str[inpos++];
501 }
502 1424 str[outpos]=0;
503 1424 return str;
504 }
505
506 24093 inline char * strqchr(const char * str, char key)
507 {
508
2/2
✓ Branch 0 taken 178329 times.
✓ Branch 1 taken 18978 times.
 197307 while (*str != '\0')
509 {
510
2/2
✓ Branch 0 taken 5111 times.
✓ Branch 1 taken 173218 times.
 178329 if (*str == key) { return const_cast<char*>(str); }
511
4/4
✓ Branch 0 taken 172378 times.
✓ Branch 1 taken 840 times.
✓ Branch 2 taken 144 times.
✓ Branch 3 taken 172234 times.
 173218 else if (*str == '"' || *str == '\'')
512 {
513 // Special case hack for ''', which is currently our official way of handling the ' character.
514 // Even though it really stinks.
515
5/6
✓ Branch 0 taken 144 times.
✓ Branch 1 taken 840 times.
✓ Branch 2 taken 8 times.
✓ Branch 3 taken 136 times.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
 984 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
516 else
517 {
518 500 char delimiter = *str;
519
520 do
521 {
522 13483 str++;
523
524 // If we want to support backslash escapes, we'll have to add that right here.
525
4/4
✓ Branch 0 taken 12511 times.
✓ Branch 1 taken 972 times.
✓ Branch 2 taken 12507 times.
✓ Branch 3 taken 4 times.
 13483 } while (*str != delimiter && *str != '\0');
526
527 // This feels like a superfluous check, but I can't really find a clean way to avoid it.
528
2/2
✓ Branch 0 taken 476 times.
✓ Branch 1 taken 500 times.
 976 if (*str == '\0') { return nullptr; }
529 }
530 }
531
532 173214 str++;
533 }
534
535 9489 return nullptr;
536 }
537
538 // RPG Hacker: WOW, these functions are poopy!
539 12499 inline char * strqrchr(const char * str, char key)
540 {
541 6581 const char * ret= nullptr;
542
2/2
✓ Branch 0 taken 83671 times.
✓ Branch 1 taken 12499 times.
 96170 while (*str)
543 {
544
4/4
✓ Branch 0 taken 82983 times.
✓ Branch 1 taken 688 times.
✓ Branch 2 taken 80 times.
✓ Branch 3 taken 82903 times.
 83671 if (*str=='"' || *str=='\'')
545 {
546 433 char token = *str;
547
548 768 str++;
549
550 // Special case hack for '''
551
4/4
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 762 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 3 times.
 768 if (str[0] == '\'' && str[1] == '\'') { str += 2; }
552 else
553 {
554
2/2
✓ Branch 0 taken 7428 times.
✓ Branch 1 taken 764 times.
 8192 while (*str != token)
555 {
556
2/2
✓ Branch 0 taken 3160 times.
✓ Branch 1 taken 4268 times.
 7428 if (!*str) return nullptr;
557 7428 str++;
558 }
559 764 str++;
560 }
561 433 }
562 else
563 {
564
2/2
✓ Branch 0 taken 2755 times.
✓ Branch 1 taken 80148 times.
 82903 if (*str==key) ret=str;
565 82903 str++;
566 }
567 }
568 6581 return const_cast<char*>(ret);
569 }
570
571 1350 inline string substr(const char * str, int len)
572 {
573 1350 return string(str, len);
574 }
575
576 string &strip_prefix(string &str, char c, bool multi=false);
577 string &strip_suffix(string &str, char c, bool multi=false);
578 string &strip_both(string &str, char c, bool multi=false);
579 string &strip_whitespace(string &str);
580
581 char * itrim(char * str, const char * left, const char * right, bool multi=false);
582 string &itrim(string &str, const char * left, const char * right, bool multi=false);
583
584 inline string &upper(string &old)
585 {
586 int length = old.length();
587 for (int i=0;i<length;i++) old.raw()[i]=(char)to_upper(old.data()[i]);
588 return old;
589 }
590
591
2/2
✓ Branch 0 taken 1234 times.
✓ Branch 1 taken 190 times.
 1424 inline string &lower(string &old)
592 {
593 ✗ int length = old.length();
594
2/2
✓ Branch 0 taken 50091 times.
✓ Branch 1 taken 1424 times.
 51515 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
595 1424 return old;
596 }
597
598 inline const char * stristr(const char * string, const char * pattern)
599 {
600 if (!*pattern) return string;
601 const char * pptr;
602 const char * sptr;
603 const char * start;
604 for (start=string;*start!=0;start++)
605 {
606 for (;(*start && (to_lower(*start)!=to_lower(*pattern)));start++);
607 if (!*start) return nullptr;
608 pptr=pattern;
609 sptr=start;
610 while (to_lower(*sptr)==to_lower(*pptr))
611 {
612 sptr++;
613 pptr++;
614 if (!*pptr) return start;
615 }
616 }
617 return nullptr;
618 }
619
620
621
622 // Returns number of connected lines - 1
623 template<typename stringarraytype>
624 873824 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
625 {
626
2/4
✓ Branch 0 taken 436912 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 436912 times.
✗ Branch 3 not taken.
 873824 out = string("");
627 436912 int count = 1;
628
629
2/4
✓ Branch 0 taken 873323 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 519 times.
✗ Branch 3 not taken.
 874361 for (int i = startline; lines[i]; i++)
630 {
631 // The line should already be stripped of any comments at this point
632 873842 int linestartpos = (int)strlen(lines[i]);
633
634 436921 bool found = false;
635
636
2/2
✓ Branch 0 taken 1726448 times.
✓ Branch 1 taken 10708 times.
 1737156 for (int j = linestartpos; j > 0; j--)
637 {
638
9/12
✓ Branch 0 taken 1725410 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 863653 times.
✓ Branch 3 taken 862795 times.
✓ Branch 4 taken 862615 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 431567 times.
✓ Branch 7 taken 431657 times.
✓ Branch 8 taken 519 times.
✗ Branch 9 not taken.
✓ Branch 10 taken 519 times.
✓ Branch 11 taken 519 times.
 1728005 if (!is_space(lines[i][j]) && lines[i][j] != '\0' && lines[i][j] != ';')
639 {
640
4/4
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 862600 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 516 times.
 863134 if (lines[i][j] == '\\')
641 {
642 18 count++;
643
4/7
✓ Branch 0 taken 9 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 3 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 3 times.
✗ Branch 6 not taken.
 18 out += string(lines[i], j);
644 9 found = true;
645 18 break;
646 }
647 else
648 {
649
4/7
✓ Branch 0 taken 431558 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 431042 times.
✓ Branch 3 taken 516 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 516 times.
✗ Branch 6 not taken.
 863632 out += string(lines[i], j + 1);
650 863116 return count - 1;
651 }
652 }
653 }
654
655
2/2
✓ Branch 0 taken 10708 times.
✓ Branch 1 taken 18 times.
 10726 if (!found)
656 {
657
2/7
✓ Branch 0 taken 5354 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 5354 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 10708 out += string(lines[i], 1);
658 10708 return count - 1;
659 }
660 }
661
662 ✗ return count - 1;
663 }
664