asar coverage - build #76

src/asar/
File: src/asar/libstr.h
Date: 2024-01-18 11:25:05
Lines:
218/237
92.0%
Functions:
44/49
89.8%
Branches:
378/558
67.7%
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 13602389 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
7 63247 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.
 1044 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
10 5035284 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
11 1378 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
12 1470 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
13 1977 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
14 11845 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 666252 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
17
4/4
✓ Branch 0 taken 4386 times.
✓ Branch 1 taken 4581 times.
✓ Branch 2 taken 4626 times.
✓ Branch 3 taken 1336 times.
 14929 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
18
19 inline char *copy(const char *source, int copy_length, char *dest)
20 {
21 8293899 memmove(dest, source, copy_length*sizeof(char));
22 return dest;
23 }
24
25 inline int min_val(int a, int b)
26 {
27 return a > b ? b : a;
28 }
29
30 4531 inline int bit_round(int v)
31 {
32 4531 v--;
33 4531 v |= v >> 1;
34 4531 v |= v >> 2;
35 4531 v |= v >> 4;
36 4531 v |= v >> 8;
37 4531 v |= v >> 16;
38 4531 v++;
39 4531 return v;
40 }
41
42 class string {
43 public:
44 const char *data() const
45 {
46
230/376
✓ Branch 0 taken 428 times.
✓ Branch 1 taken 47129 times.
✓ Branch 2 taken 49442 times.
✓ Branch 3 taken 2375 times.
✓ Branch 4 taken 1133 times.
✓ Branch 5 taken 456 times.
✓ Branch 6 taken 538321 times.
✓ Branch 7 taken 1017 times.
✓ Branch 8 taken 538550 times.
✓ Branch 9 taken 489 times.
✓ Branch 10 taken 326800 times.
✓ Branch 11 taken 225 times.
✓ Branch 12 taken 905 times.
✓ Branch 13 taken 619 times.
✓ Branch 14 taken 326595 times.
✓ Branch 15 taken 95 times.
✓ Branch 16 taken 1313 times.
✓ Branch 17 taken 2061709 times.
✓ Branch 18 taken 6437 times.
✓ Branch 19 taken 630 times.
✓ Branch 20 taken 311 times.
✗ Branch 21 not taken.
✓ Branch 22 taken 581 times.
✗ Branch 23 not taken.
✓ Branch 24 taken 119 times.
✓ Branch 25 taken 1752 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 5796 times.
✓ Branch 28 taken 225 times.
✓ Branch 29 taken 95 times.
✗ Branch 30 not taken.
✓ Branch 31 taken 96 times.
✓ Branch 32 taken 476 times.
✓ Branch 33 taken 48 times.
✗ Branch 34 not taken.
✓ Branch 35 taken 116 times.
✓ Branch 36 taken 465 times.
✗ Branch 37 not taken.
✓ Branch 38 taken 112 times.
✓ Branch 39 taken 9 times.
✓ Branch 40 taken 95 times.
✓ Branch 41 taken 435449 times.
✓ Branch 42 taken 260 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 435454 times.
✓ Branch 45 taken 13 times.
✓ Branch 46 taken 57 times.
✓ Branch 47 taken 437452 times.
✓ Branch 48 taken 104 times.
✓ Branch 49 taken 14 times.
✓ Branch 50 taken 436986 times.
✓ Branch 51 taken 10 times.
✓ Branch 52 taken 78 times.
✓ Branch 53 taken 17703 times.
✓ Branch 54 taken 101 times.
✓ Branch 55 taken 78 times.
✓ Branch 56 taken 450 times.
✓ Branch 57 taken 105726 times.
✓ Branch 58 taken 1213 times.
✓ Branch 59 taken 162 times.
✓ Branch 60 taken 17 times.
✗ Branch 61 not taken.
✓ Branch 62 taken 15 times.
✓ Branch 63 taken 30 times.
✗ Branch 64 not taken.
✓ Branch 65 taken 95 times.
✓ Branch 66 taken 33 times.
✓ Branch 67 taken 12 times.
✓ Branch 68 taken 1279 times.
✓ Branch 69 taken 134 times.
✓ Branch 70 taken 6 times.
✓ Branch 71 taken 8 times.
✓ Branch 72 taken 295 times.
✓ Branch 73 taken 14 times.
✓ Branch 74 taken 105507 times.
✓ Branch 75 taken 17 times.
✓ Branch 76 taken 12 times.
✓ Branch 77 taken 105507 times.
✓ Branch 78 taken 17 times.
✓ Branch 79 taken 33 times.
✓ Branch 80 taken 106696 times.
✓ Branch 81 taken 8 times.
✓ Branch 82 taken 11 times.
✗ Branch 83 not taken.
✓ Branch 84 taken 9 times.
✓ Branch 85 taken 211989 times.
✗ Branch 86 not taken.
✓ Branch 87 taken 211974 times.
✓ Branch 88 taken 72 times.
✗ Branch 89 not taken.
✓ Branch 90 taken 69 times.
✓ Branch 91 taken 1242 times.
✗ Branch 92 not taken.
✓ Branch 93 taken 14 times.
✓ Branch 94 taken 63 times.
✗ Branch 95 not taken.
✓ Branch 96 taken 36 times.
✓ Branch 97 taken 49 times.
✗ Branch 98 not taken.
✓ Branch 99 taken 36 times.
✗ Branch 100 not taken.
✓ Branch 101 taken 30 times.
✓ Branch 102 taken 1159 times.
✗ Branch 103 not taken.
✓ Branch 104 taken 10 times.
✓ Branch 105 taken 3 times.
✗ Branch 106 not taken.
✓ Branch 107 taken 30 times.
✓ Branch 108 taken 3 times.
✓ Branch 109 taken 9 times.
✓ Branch 110 taken 30 times.
✗ Branch 111 not taken.
✗ Branch 112 not taken.
✓ Branch 113 taken 30 times.
✓ Branch 114 taken 3 times.
✗ Branch 115 not taken.
✓ Branch 116 taken 10 times.
✓ Branch 117 taken 3 times.
✗ Branch 118 not taken.
✓ Branch 119 taken 30 times.
✗ Branch 120 not taken.
✗ Branch 121 not taken.
✓ Branch 122 taken 90 times.
✓ Branch 123 taken 252 times.
✓ Branch 124 taken 1156 times.
✓ Branch 125 taken 18 times.
✓ Branch 126 taken 3 times.
✓ Branch 127 taken 86 times.
✓ Branch 128 taken 15 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 258 times.
✗ Branch 131 not taken.
✓ Branch 132 taken 6 times.
✓ Branch 133 taken 132 times.
✗ Branch 134 not taken.
✓ Branch 135 taken 3 times.
✓ Branch 136 taken 258 times.
✗ Branch 137 not taken.
✗ Branch 138 not taken.
✓ Branch 139 taken 27 times.
✓ Branch 140 taken 898 times.
✓ Branch 141 taken 3 times.
✓ Branch 142 taken 3 times.
✓ Branch 143 taken 13 times.
✓ Branch 144 taken 3 times.
✗ Branch 145 not taken.
✓ Branch 146 taken 39 times.
✗ Branch 147 not taken.
✗ Branch 148 not taken.
✓ Branch 149 taken 33 times.
✓ Branch 150 taken 3 times.
✗ Branch 151 not taken.
✓ Branch 152 taken 6 times.
✓ Branch 153 taken 3 times.
✗ Branch 154 not taken.
✓ Branch 155 taken 3 times.
✗ Branch 156 not taken.
✗ Branch 157 not taken.
✓ Branch 158 taken 9 times.
✓ Branch 159 taken 3 times.
✗ Branch 160 not taken.
✓ Branch 161 taken 27 times.
✓ Branch 162 taken 3 times.
✗ Branch 163 not taken.
✓ Branch 164 taken 27 times.
✗ Branch 165 not taken.
✗ Branch 166 not taken.
✓ Branch 167 taken 276 times.
✓ Branch 168 taken 3 times.
✗ Branch 169 not taken.
✓ Branch 170 taken 829 times.
✓ Branch 171 taken 3 times.
✓ Branch 172 taken 15 times.
✓ Branch 173 taken 661 times.
✓ Branch 174 taken 15 times.
✗ Branch 175 not taken.
✓ Branch 176 taken 15 times.
✓ Branch 177 taken 3 times.
✗ Branch 178 not taken.
✓ Branch 179 taken 16 times.
✓ Branch 180 taken 3 times.
✗ Branch 181 not taken.
✗ Branch 182 not taken.
✗ Branch 183 not taken.
✗ Branch 184 not taken.
✓ Branch 185 taken 2810 times.
✓ Branch 186 taken 30 times.
✓ Branch 187 taken 1 times.
✓ Branch 188 taken 154 times.
✓ Branch 189 taken 60 times.
✓ Branch 190 taken 3 times.
✓ Branch 191 taken 151 times.
✗ Branch 192 not taken.
✓ Branch 193 taken 151 times.
✗ Branch 194 not taken.
✓ Branch 195 taken 60 times.
✗ Branch 196 not taken.
✓ Branch 197 taken 711 times.
✓ Branch 198 taken 63 times.
✓ Branch 199 taken 3 times.
✗ Branch 200 not taken.
✓ Branch 201 taken 3 times.
✗ Branch 202 not taken.
✓ Branch 203 taken 6 times.
✗ Branch 204 not taken.
✓ Branch 205 taken 9 times.
✗ Branch 206 not taken.
✓ Branch 207 taken 9 times.
✗ Branch 208 not taken.
✗ Branch 209 not taken.
✓ Branch 210 taken 3 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 6 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 9 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 9 times.
✗ Branch 217 not taken.
✓ Branch 218 taken 3 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 3 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 6 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 9 times.
✗ Branch 225 not taken.
✓ Branch 226 taken 9 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 6 times.
✗ Branch 229 not taken.
✓ Branch 230 taken 9 times.
✗ Branch 231 not taken.
✓ Branch 232 taken 9 times.
✗ Branch 233 not taken.
✓ Branch 234 taken 3 times.
✗ Branch 235 not taken.
✓ Branch 236 taken 3 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 3 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 6 times.
✗ Branch 249 not taken.
✓ Branch 250 taken 9 times.
✗ Branch 251 not taken.
✓ Branch 252 taken 9 times.
✗ Branch 253 not taken.
✓ Branch 254 taken 3 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 3 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 6 times.
✗ Branch 259 not taken.
✓ Branch 260 taken 9 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 9 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 3 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 3 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 6 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 9 times.
✗ Branch 271 not taken.
✓ Branch 272 taken 9 times.
✗ Branch 273 not taken.
✓ Branch 274 taken 3 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 3 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 3 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 6 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 6 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 9 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 9 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 18 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 18 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 18 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 36 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 54 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 54 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 18 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 36 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 18 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 18 times.
✗ Branch 321 not taken.
✓ Branch 322 taken 18 times.
✗ Branch 323 not taken.
✓ Branch 324 taken 18 times.
✗ Branch 325 not taken.
✓ Branch 326 taken 3 times.
✗ Branch 327 not taken.
✓ Branch 328 taken 3 times.
✗ Branch 329 not taken.
✓ Branch 330 taken 3 times.
✗ Branch 331 not taken.
✓ Branch 332 taken 3 times.
✗ Branch 333 not taken.
✓ Branch 334 taken 3 times.
✗ Branch 335 not taken.
✓ Branch 336 taken 3 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 not taken.
✗ 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 not taken.
✗ Branch 353 not taken.
✓ Branch 354 taken 3 times.
✗ Branch 355 not taken.
✓ Branch 356 taken 3 times.
✗ Branch 357 not taken.
✗ Branch 358 not taken.
✗ Branch 359 not taken.
✓ Branch 360 taken 3 times.
✗ Branch 361 not taken.
✓ Branch 362 taken 3 times.
✗ Branch 363 not taken.
✓ Branch 364 taken 3 times.
✗ Branch 365 not taken.
✗ Branch 366 not taken.
✗ Branch 367 not taken.
✓ Branch 368 taken 3 times.
✗ Branch 369 not taken.
✗ Branch 370 not taken.
✗ Branch 371 not taken.
✗ Branch 372 not taken.
✗ Branch 373 not taken.
✗ Branch 374 not taken.
✗ Branch 375 not taken.
 6927371 return cached_data;
47 }
48
49 char *temp_raw() const //things to cleanup and take a look at
50 {
51
4/8
✓ Branch 0 taken 873367 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 36 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 438 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 57 times.
✗ Branch 7 not taken.
 875249 return cached_data;
52 }
53
54 char *raw() const
55 {
56
1/2
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
 27095226 return cached_data;
57 }
58
59 int length() const
60 {
61 25179770 return is_inlined() ? inlined.len : allocated.len;
62 }
63
64 13989944 void set_length(int length)
65 {
66
2/2
✓ Branch 0 taken 19800 times.
✓ Branch 1 taken 13970144 times.
 13989944 if(length > max_inline_length_){
67 19800 inlined.len = (unsigned char)-1;
68 19800 allocated.len = length;
69 }else{
70 13970144 inlined.len = length;
71 }
72 13989944 }
73
74 void truncate(int newlen)
75 {
76 872500 resize(newlen);
77 546015 }
78
79 2669231 void assign(const char * newstr)
80 {
81
2/2
✓ Branch 0 taken 95 times.
✓ Branch 1 taken 2669136 times.
 2669231 if (!newstr) newstr = "";
82 2669231 assign(newstr, strlen(newstr));
83 2669231 }
84
85 2941828 void assign(const string &newstr)
86 {
87 2941828 assign(newstr, newstr.length());
88 2941828 }
89
90 7831052 void assign(const char * newstr, int end)
91 {
92 7831052 resize(end);
93 copy(newstr, length(), raw());
94 7831052 }
95
96
97 string& operator=(const char * newstr)
98 {
99 549504 assign(newstr);
100 546232 return *this;
101 }
102
103 string& operator=(const string &newstr)
104 {
105 1318676 assign(newstr);
106 5464 return *this;
107 }
108
109 436822 string& operator+=(const string& other)
110 {
111 int current_end = length();
112 436822 resize(length() + other.length());
113 436822 copy(other.data(), other.length(), raw() + current_end);
114 436822 return *this;
115 }
116
117 21755 string& operator+=(const char *other)
118 {
119 int current_end = length();
120 21755 int otherlen=(int)strlen(other);
121 21755 resize(length() + otherlen);
122 21755 copy(other, otherlen, raw() + current_end);
123 21755 return *this;
124 }
125
126 4827354 string& operator+=(char c)
127 {
128 4827354 resize(length() + 1);
129 4827354 raw()[length() - 1] = c;
130 4827354 return *this;
131 }
132
133 string operator+(char right) const
134 {
135 string ret=*this;
136 ret+=right;
137 return ret;
138 }
139
140 string operator+(const char * right) const
141 {
142 20672 string ret=*this;
143 20672 ret+=right;
144 69 return ret;
145 }
146
147 2605 bool operator==(const char * right) const
148 {
149 2605 return !strcmp(data(), right);
150 }
151
152 52 bool operator==(const string& right) const
153 {
154 52 return !strcmp(data(), right.data());
155 }
156
157 768 bool operator!=(const char * right) const
158 {
159 768 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 operator const char*() const
168 {
169 return data();
170 }
171
172 214521 explicit operator bool() const
173 {
174 214521 return length();
175 }
176
177 8227786 string()
178 8227786 {
179 //todo reduce I know this isn't all needed
180 8227786 allocated.bufferlen = 0;
181 8227786 allocated.str = 0;
182 8227786 allocated.len = 0;
183 8227786 inlined.len = 0;
184 8227786 cached_data = inlined.str;
185 8227786 next_resize = max_inline_length_+1;
186
187 8227786 }
188 1885761 string(const char * newstr) : string()
189 {
190 1885761 assign(newstr);
191 1885761 }
192 1305810 string(const char * newstr, int newlen) : string()
193 {
194 1305810 assign(newstr, newlen);
195 1305810 }
196 233966 string(const string& old) : string()
197 {
198 233966 assign(old.data());
199 233966 }
200
201 537 string(string &&move) : string()
202 {
203 *this = move;
204 537 }
205
206 1411975 string& operator=(string&& move)
207 {
208 350 if(!is_inlined()) free(allocated.str);
209 1411975 if(!move.is_inlined()){
210 461 allocated.str = move.allocated.str;
211 461 allocated.bufferlen = move.allocated.bufferlen;
212 461 set_length(move.allocated.len);
213
214 461 move.inlined.len = 0;
215 461 move.inlined.str[0] = 0;
216 461 cached_data = allocated.str;
217 461 next_resize = move.next_resize;
218
219 }else{
220 1411514 inlined.len = 0;
221 1411514 cached_data = inlined.str;
222 1411514 next_resize = max_inline_length_+1;
223 1411514 assign(move);
224 }
225 1411975 return *this;
226 }
227
228 8227775 ~string()
229 {
230 8227775 if(!is_inlined()){
231 3808 free(allocated.str);
232 }
233 8227775 }
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 13989483 void resize(int new_length)
269 {
270 const char *old_data = data();
271
4/4
✓ Branch 0 taken 13984952 times.
✓ Branch 1 taken 4531 times.
✓ Branch 2 taken 56 times.
✓ Branch 3 taken 14808 times.
 14004347 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
272
3/4
✓ Branch 0 taken 4531 times.
✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 317 times.
 4904 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
273 4531 int new_size = bit_round(new_length + 1);
274
2/2
✓ Branch 0 taken 4214 times.
✓ Branch 1 taken 317 times.
 4531 if(old_data == inlined.str){
275
1/2
✓ Branch 0 taken 4214 times.
✗ Branch 1 not taken.
 8428 allocated.str = copy(old_data, min_val(length(), new_length), (char *)malloc(new_size));
276 }else{
277 317 allocated.str = (char *)realloc(allocated.str, new_size);
278 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
279 }
280 4531 allocated.bufferlen = new_size;
281 4531 cached_data = allocated.str;
282 4531 next_resize = allocated.bufferlen;
283
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 56 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 56 times.
 56 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
284 56 copy(old_data, new_length, inlined.str);
285 56 cached_data = inlined.str;
286 56 next_resize = max_inline_length_+1;
287 }
288
3/4
✓ Branch 0 taken 56 times.
✓ Branch 1 taken 4531 times.
✓ Branch 2 taken 56 times.
✗ Branch 3 not taken.
 4587 if(old_data != inlined.str && old_data != data()){
289 56 free((char *)old_data);
290 }
291 }
292 13989483 set_length(new_length);
293
294 13989483 raw()[new_length] = 0; //always ensure null terminator
295 13989483 }
296
297 bool is_inlined() const
298 {
299
36/40
✓ Branch 0 taken 1198968 times.
✓ Branch 1 taken 13978330 times.
✓ Branch 2 taken 38807 times.
✓ Branch 3 taken 12386 times.
✓ Branch 4 taken 1499 times.
✓ Branch 5 taken 73 times.
✓ Branch 6 taken 546608 times.
✓ Branch 7 taken 8224177 times.
✓ Branch 8 taken 542800 times.
✓ Branch 9 taken 2824 times.
✓ Branch 10 taken 171 times.
✓ Branch 11 taken 545695 times.
✓ Branch 12 taken 438039 times.
✓ Branch 13 taken 543304 times.
✓ Branch 14 taken 265311 times.
✓ Branch 15 taken 869 times.
✓ Branch 16 taken 5243036 times.
✓ Branch 17 taken 8386 times.
✓ Branch 18 taken 4775311 times.
✓ Branch 19 taken 8040 times.
✓ Branch 20 taken 7826774 times.
✓ Branch 21 taken 6490 times.
✓ Branch 22 taken 3373987 times.
✓ Branch 23 taken 3403 times.
✓ Branch 24 taken 436577 times.
✓ Branch 25 taken 245 times.
✓ Branch 26 taken 436366 times.
✓ Branch 27 taken 866067 times.
✓ Branch 28 taken 347 times.
✓ Branch 29 taken 865825 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.
 48805139 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 563 inline char ** split(char * str, const char * key, int * len= nullptr) { return nsplit(str, key, 0, len); }
311 873228 inline char ** qsplit(char * str, const char * key, int * len= nullptr) { return qnsplit(str, key, 0, len); }
312 110033 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 1 inline string hex6(unsigned int value)
377 {
378 char buffer[64];
379 1 sprintf(buffer, "%.6X", value);
380 1 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 805 inline string dec(int value)
391 {
392 char buffer[64];
393 805 sprintf(buffer, "%i", value);
394 805 return buffer;
395 }
396
397 105603 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 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
1/2
✓ Branch 0 taken 105603 times.
✗ Branch 1 not taken.
 105603 sprintf(rval, "%.100f", value);
405
1/2
✓ Branch 0 taken 105603 times.
✗ Branch 1 not taken.
 105603 if (strchr(rval, '.'))//nuke useless zeroes
406 {
407 105603 char * end=strrchr(rval, '\0')-1;
408
2/2
✓ Branch 0 taken 10560126 times.
✓ Branch 1 taken 105603 times.
 10665729 while (*end=='0')
409 {
410 10560126 *end='\0';
411 10560126 end--;
412 }
413
2/2
✓ Branch 0 taken 105600 times.
✓ Branch 1 taken 3 times.
 105603 if (*end=='.') *end='\0';
414 }
415 105603 return rval;
416 }
417
418 // Same as above, but with variable precision
419 23 inline string ftostrvar(double value, int precision)
420 {
421 int clampedprecision = precision;
422 if (clampedprecision < 0) clampedprecision = 0;
423 23 if (clampedprecision > 100) clampedprecision = 100;
424
425 // see above
426 char rval[512];
427
2/2
✓ Branch 0 taken 22 times.
✓ Branch 1 taken 1 times.
 23 sprintf(rval, "%.*f", clampedprecision, (double)value);
428
2/2
✓ Branch 0 taken 22 times.
✓ Branch 1 taken 1 times.
 23 if (strchr(rval, '.'))//nuke useless zeroes
429 {
430 22 char * end = strrchr(rval, '\0') - 1;
431
2/2
✓ Branch 0 taken 69 times.
✓ Branch 1 taken 22 times.
 91 while (*end == '0')
432 {
433 69 *end = '\0';
434 69 end--;
435 }
436
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 13 times.
 22 if (*end == '.') *end = '\0';
437 }
438 23 return rval;
439 }
440
441 1398871 inline bool stribegin(const char * str, const char * key)
442 {
443
2/2
✓ Branch 0 taken 2029628 times.
✓ Branch 1 taken 109650 times.
 2139278 for (int i=0;key[i];i++)
444 {
445
2/2
✓ Branch 0 taken 740407 times.
✓ Branch 1 taken 1289221 times.
 2029628 if (to_lower(str[i])!=to_lower(key[i])) return false;
446 }
447 return true;
448 }
449
450 3930 inline bool striend(const char * str, const char * key)
451 {
452 const char * keyend=strrchr(key, '\0');
453 const char * strend=strrchr(str, '\0');
454
2/2
✓ Branch 0 taken 4374 times.
✓ Branch 1 taken 717 times.
 5091 while (key!=keyend)
455 {
456 4374 keyend--;
457 4374 strend--;
458
2/2
✓ Branch 0 taken 1161 times.
✓ Branch 1 taken 3213 times.
 4374 if (to_lower(*strend)!=to_lower(*keyend)) return false;
459 }
460 return true;
461 }
462
463 56635 inline bool stricmpwithupper(const char *word1, const char *word2)
464 {
465
2/2
✓ Branch 0 taken 63247 times.
✓ Branch 1 taken 1838 times.
 65085 while(*word2)
466 {
467
2/2
✓ Branch 0 taken 8450 times.
✓ Branch 1 taken 54797 times.
 63247 if(to_upper(*word1++) != *word2++) return true;
468 }
469 1838 return *word1;
470 }
471
472 5234383 inline bool stricmpwithlower(const char *word1, const char *word2)
473 {
474
2/2
✓ Branch 0 taken 9491453 times.
✓ Branch 1 taken 851558 times.
 10343011 while(*word2)
475 {
476
2/2
✓ Branch 0 taken 5108628 times.
✓ Branch 1 taken 4382825 times.
 9491453 if(to_lower(*word1++) != *word2++) return true;
477 }
478 851558 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 754 inline const char * dequote(char * str)
487 {
488
2/2
✓ Branch 0 taken 42 times.
✓ Branch 1 taken 712 times.
 754 if (*str!='"') return str;
489 int inpos=1;
490 int outpos=0;
491 while (true)
492 {
493
2/2
✓ Branch 0 taken 784 times.
✓ Branch 1 taken 8409 times.
 9193 if (str[inpos]=='"')
494 {
495
2/2
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 712 times.
 784 if (str[inpos+1]=='"') inpos++;
496
1/2
✓ Branch 0 taken 712 times.
✗ Branch 1 not taken.
 712 else if (str[inpos+1]=='\0') break;
497 else return nullptr;
498 }
499
1/2
✓ Branch 0 taken 8481 times.
✗ Branch 1 not taken.
 8481 if (!str[inpos]) return nullptr;
500 8481 str[outpos++]=str[inpos++];
501 }
502 712 str[outpos]=0;
503 712 return str;
504 }
505
506 11145 inline char * strqchr(const char * str, char key)
507 {
508
2/2
✓ Branch 0 taken 85652 times.
✓ Branch 1 taken 9025 times.
 94677 while (*str != '\0')
509 {
510
2/2
✓ Branch 0 taken 2118 times.
✓ Branch 1 taken 83534 times.
 85652 if (*str == key) { return const_cast<char*>(str); }
511
4/4
✓ Branch 0 taken 83126 times.
✓ Branch 1 taken 408 times.
✓ Branch 2 taken 72 times.
✓ Branch 3 taken 83054 times.
 83534 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 72 times.
✓ Branch 1 taken 408 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 68 times.
✓ Branch 4 taken 4 times.
✗ Branch 5 not taken.
 480 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
516 else
517 {
518 char delimiter = *str;
519
520 do
521 {
522 6561 str++;
523
524 // If we want to support backslash escapes, we'll have to add that right here.
525
4/4
✓ Branch 0 taken 6087 times.
✓ Branch 1 taken 474 times.
✓ Branch 2 taken 6085 times.
✓ Branch 3 taken 2 times.
 6561 } 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 474 times.
✓ Branch 1 taken 2 times.
 476 if (*str == '\0') { return nullptr; }
529 }
530 }
531
532 83532 str++;
533 }
534
535 return nullptr;
536 }
537
538 // RPG Hacker: WOW, these functions are poopy!
539 5686 inline char * strqrchr(const char * str, char key)
540 {
541 const char * ret= nullptr;
542
2/2
✓ Branch 0 taken 35836 times.
✓ Branch 1 taken 5686 times.
 41522 while (*str)
543 {
544
4/4
✓ Branch 0 taken 35537 times.
✓ Branch 1 taken 299 times.
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 35501 times.
 35836 if (*str=='"' || *str=='\'')
545 {
546 char token = *str;
547
548 335 str++;
549
550 // Special case hack for '''
551
4/4
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 332 times.
✓ Branch 2 taken 1 times.
✓ Branch 3 taken 2 times.
 335 if (str[0] == '\'' && str[1] == '\'') { str += 2; }
552 else
553 {
554
2/2
✓ Branch 0 taken 3160 times.
✓ Branch 1 taken 333 times.
 3493 while (*str != token)
555 {
556
1/2
✓ Branch 0 taken 3160 times.
✗ Branch 1 not taken.
 3160 if (!*str) return nullptr;
557 3160 str++;
558 }
559 333 str++;
560 }
561 }
562 else
563 {
564
2/2
✓ Branch 0 taken 968 times.
✓ Branch 1 taken 34533 times.
 35501 if (*str==key) ret=str;
565 35501 str++;
566 }
567 }
568 return const_cast<char*>(ret);
569 }
570
571 inline string substr(const char * str, int len)
572 {
573 1320 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 ✗ inline string &lower(string &old)
592 {
593 int length = old.length();
594 ✗ for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
595 ✗ 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 436216 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
625 {
626 436216 out = string("");
627 int count = 1;
628
629
1/2
✓ Branch 0 taken 436225 times.
✗ Branch 1 not taken.
 436744 for (int i = startline; lines[i]; i++)
630 {
631 // The line should already be stripped of any comments at this point
632 436225 int linestartpos = (int)strlen(lines[i]);
633
634 bool found = false;
635
636
2/2
✓ Branch 0 taken 862576 times.
✓ Branch 1 taken 4982 times.
 867558 for (int j = linestartpos; j > 0; j--)
637 {
638
4/6
✓ Branch 0 taken 862576 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 431243 times.
✓ Branch 3 taken 431333 times.
✓ Branch 4 taken 431243 times.
✗ Branch 5 not taken.
 864133 if (!is_space(lines[i][j]) && lines[i][j] != '\0' && lines[i][j] != ';')
639 {
640
2/2
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 431234 times.
 431243 if (lines[i][j] == '\\')
641 {
642 9 count++;
643 9 out += string(lines[i], j);
644 found = true;
645 9 break;
646 }
647 else
648 {
649 431234 out += string(lines[i], j + 1);
650 431234 return count - 1;
651 }
652 }
653 }
654
655
2/2
✓ Branch 0 taken 4982 times.
✓ Branch 1 taken 9 times.
 4991 if (!found)
656 {
657 4982 out += string(lines[i], 1);
658 4982 return count - 1;
659 }
660 }
661
662 ✗ return count - 1;
663 }
664