asar coverage - build #86

src/asar/
File: src/asar/libstr.h
Date: 2024-01-19 10:47:59
Lines:
223/239
93.3%
Functions:
45/49
91.8%
Branches:
428/570
75.1%
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 27251524 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
7 126494 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 12 times.
 2088 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
10 10070568 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
11 2756 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
12 2940 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
13 3954 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
14 23690 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 1332504 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
17
4/4
✓ Branch 0 taken 8772 times.
✓ Branch 1 taken 9162 times.
✓ Branch 2 taken 9252 times.
✓ Branch 3 taken 2672 times.
 29858 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 16589545 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 9479 inline int bit_round(int v)
31 {
32 9479 v--;
33 9479 v |= v >> 1;
34 9479 v |= v >> 2;
35 9479 v |= v >> 4;
36 9479 v |= v >> 8;
37 9479 v |= v >> 16;
38 9479 v++;
39 9479 return v;
40 }
41
42 class string {
43 public:
44 const char *data() const
45 {
46
276/388
✓ Branch 0 taken 2076 times.
✓ Branch 1 taken 94956 times.
✓ Branch 2 taken 100694 times.
✓ Branch 3 taken 3589 times.
✓ Branch 4 taken 2647 times.
✓ Branch 5 taken 538384 times.
✓ Branch 6 taken 539332 times.
✓ Branch 7 taken 539573 times.
✓ Branch 8 taken 539227 times.
✓ Branch 9 taken 327621 times.
✓ Branch 10 taken 326851 times.
✓ Branch 11 taken 945 times.
✓ Branch 12 taken 1708 times.
✓ Branch 13 taken 327153 times.
✓ Branch 14 taken 326798 times.
✓ Branch 15 taken 891 times.
✓ Branch 16 taken 2063539 times.
✓ Branch 17 taken 2068146 times.
✓ Branch 18 taken 7064 times.
✓ Branch 19 taken 918 times.
✓ Branch 20 taken 337 times.
✓ Branch 21 taken 312 times.
✓ Branch 22 taken 850 times.
✓ Branch 23 taken 95 times.
✓ Branch 24 taken 1821 times.
✓ Branch 25 taken 1826 times.
✓ Branch 26 taken 5748 times.
✓ Branch 27 taken 6021 times.
✓ Branch 28 taken 344 times.
✓ Branch 29 taken 95 times.
✓ Branch 30 taken 104 times.
✓ Branch 31 taken 612 times.
✓ Branch 32 taken 482 times.
✓ Branch 33 taken 48 times.
✓ Branch 34 taken 110 times.
✓ Branch 35 taken 575 times.
✓ Branch 36 taken 467 times.
✓ Branch 37 taken 158 times.
✓ Branch 38 taken 112 times.
✓ Branch 39 taken 104 times.
✓ Branch 40 taken 435550 times.
✓ Branch 41 taken 435703 times.
✓ Branch 42 taken 276 times.
✓ Branch 43 taken 435444 times.
✓ Branch 44 taken 435569 times.
✓ Branch 45 taken 1250 times.
✓ Branch 46 taken 436254 times.
✓ Branch 47 taken 437555 times.
✓ Branch 48 taken 110 times.
✓ Branch 49 taken 437006 times.
✓ Branch 50 taken 437010 times.
✓ Branch 51 taken 65 times.
✓ Branch 52 taken 87 times.
✓ Branch 53 taken 35540 times.
✓ Branch 54 taken 155 times.
✓ Branch 55 taken 147 times.
✓ Branch 56 taken 107779 times.
✓ Branch 57 taken 105726 times.
✓ Branch 58 taken 1359 times.
✓ Branch 59 taken 192 times.
✓ Branch 60 taken 17 times.
✓ Branch 61 taken 33 times.
✓ Branch 62 taken 137 times.
✓ Branch 63 taken 30 times.
✓ Branch 64 taken 57 times.
✓ Branch 65 taken 95 times.
✓ Branch 66 taken 212 times.
✓ Branch 67 taken 1231 times.
✓ Branch 68 taken 1297 times.
✓ Branch 69 taken 421 times.
✓ Branch 70 taken 23 times.
✓ Branch 71 taken 26 times.
✓ Branch 72 taken 319 times.
✓ Branch 73 taken 105516 times.
✓ Branch 74 taken 105507 times.
✓ Branch 75 taken 41 times.
✓ Branch 76 taken 105509 times.
✓ Branch 77 taken 106780 times.
✓ Branch 78 taken 17 times.
✓ Branch 79 taken 105530 times.
✓ Branch 80 taken 106704 times.
✓ Branch 81 taken 11 times.
✓ Branch 82 taken 22 times.
✓ Branch 83 taken 24 times.
✓ Branch 84 taken 212018 times.
✓ Branch 85 taken 211995 times.
✓ Branch 86 taken 211989 times.
✓ Branch 87 taken 212018 times.
✓ Branch 88 taken 114 times.
✓ Branch 89 taken 1220 times.
✓ Branch 90 taken 118 times.
✓ Branch 91 taken 1262 times.
✓ Branch 92 taken 42 times.
✓ Branch 93 taken 63 times.
✓ Branch 94 taken 105 times.
✓ Branch 95 taken 14 times.
✓ Branch 96 taken 36 times.
✓ Branch 97 taken 85 times.
✗ Branch 98 not taken.
✓ Branch 99 taken 96 times.
✓ Branch 100 taken 1159 times.
✓ Branch 101 taken 39 times.
✓ Branch 102 taken 1169 times.
✓ Branch 103 taken 3 times.
✓ Branch 104 taken 10 times.
✓ Branch 105 taken 33 times.
✓ Branch 106 taken 3 times.
✓ Branch 107 taken 30 times.
✓ Branch 108 taken 33 times.
✓ Branch 109 taken 12 times.
✓ Branch 110 taken 60 times.
✓ Branch 111 taken 1156 times.
✓ Branch 112 taken 3 times.
✓ Branch 113 taken 60 times.
✓ Branch 114 taken 63 times.
✓ Branch 115 taken 249 times.
✓ Branch 116 taken 20 times.
✓ Branch 117 taken 21 times.
✓ Branch 118 taken 3 times.
✓ Branch 119 taken 60 times.
✓ Branch 120 taken 15 times.
✓ Branch 121 taken 3 times.
✓ Branch 122 taken 120 times.
✓ Branch 123 taken 252 times.
✓ Branch 124 taken 2315 times.
✓ Branch 125 taken 18 times.
✓ Branch 126 taken 3 times.
✓ Branch 127 taken 175 times.
✓ Branch 128 taken 15 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 519 times.
✓ Branch 131 taken 27 times.
✓ Branch 132 taken 6 times.
✓ Branch 133 taken 264 times.
✓ Branch 134 taken 3 times.
✓ Branch 135 taken 3 times.
✓ Branch 136 taken 519 times.
✗ Branch 137 not taken.
✗ Branch 138 not taken.
✓ Branch 139 taken 30 times.
✓ Branch 140 taken 1796 times.
✓ Branch 141 taken 3 times.
✓ Branch 142 taken 3 times.
✓ Branch 143 taken 26 times.
✓ Branch 144 taken 3 times.
✓ Branch 145 taken 3 times.
✓ Branch 146 taken 78 times.
✗ Branch 147 not taken.
✓ Branch 148 taken 3 times.
✓ Branch 149 taken 66 times.
✓ Branch 150 taken 3 times.
✗ Branch 151 not taken.
✓ Branch 152 taken 12 times.
✓ Branch 153 taken 3 times.
✓ Branch 154 taken 3 times.
✓ Branch 155 taken 6 times.
✗ Branch 156 not taken.
✓ Branch 157 taken 3 times.
✓ Branch 158 taken 18 times.
✓ Branch 159 taken 3 times.
✗ Branch 160 not taken.
✓ Branch 161 taken 54 times.
✓ Branch 162 taken 3 times.
✓ Branch 163 taken 3 times.
✓ Branch 164 taken 69 times.
✗ Branch 165 not taken.
✓ Branch 166 taken 18 times.
✓ Branch 167 taken 552 times.
✓ Branch 168 taken 18 times.
✗ Branch 169 not taken.
✓ Branch 170 taken 1658 times.
✓ Branch 171 taken 19 times.
✓ Branch 172 taken 18 times.
✓ Branch 173 taken 1322 times.
✓ Branch 174 taken 15 times.
✓ Branch 175 taken 3 times.
✓ Branch 176 taken 2825 times.
✓ Branch 177 taken 3 times.
✓ Branch 178 taken 1 times.
✓ Branch 179 taken 167 times.
✓ Branch 180 taken 3 times.
✓ Branch 181 taken 3 times.
✗ Branch 182 not taken.
✓ Branch 183 taken 151 times.
✓ Branch 184 taken 3 times.
✓ Branch 185 taken 2961 times.
✓ Branch 186 taken 30 times.
✓ Branch 187 taken 1 times.
✓ Branch 188 taken 154 times.
✓ Branch 189 taken 771 times.
✓ Branch 190 taken 96 times.
✓ Branch 191 taken 151 times.
✗ Branch 192 not taken.
✓ Branch 193 taken 214 times.
✗ Branch 194 not taken.
✓ Branch 195 taken 60 times.
✓ Branch 196 taken 60 times.
✓ Branch 197 taken 711 times.
✓ Branch 198 taken 63 times.
✓ Branch 199 taken 6 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 33 times.
✗ Branch 206 not taken.
✓ Branch 207 taken 9 times.
✓ Branch 208 taken 60 times.
✗ Branch 209 not taken.
✓ Branch 210 taken 3 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 9 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 12 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 15 times.
✗ Branch 217 not taken.
✓ Branch 218 taken 12 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 12 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 9 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 15 times.
✗ Branch 225 not taken.
✓ Branch 226 taken 18 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 15 times.
✗ Branch 229 not taken.
✓ Branch 230 taken 12 times.
✗ Branch 231 not taken.
✓ Branch 232 taken 12 times.
✗ Branch 233 not taken.
✓ Branch 234 taken 9 times.
✗ Branch 235 not taken.
✓ Branch 236 taken 12 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 12 times.
✗ Branch 239 not taken.
✓ Branch 240 taken 12 times.
✗ Branch 241 not taken.
✓ Branch 242 taken 18 times.
✗ Branch 243 not taken.
✓ Branch 244 taken 18 times.
✗ Branch 245 not taken.
✓ Branch 246 taken 6 times.
✗ Branch 247 not taken.
✓ Branch 248 taken 9 times.
✗ Branch 249 not taken.
✓ Branch 250 taken 12 times.
✗ Branch 251 not taken.
✓ Branch 252 taken 15 times.
✗ Branch 253 not taken.
✓ Branch 254 taken 12 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 12 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 9 times.
✗ Branch 259 not taken.
✓ Branch 260 taken 15 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 18 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 12 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 6 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 9 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 15 times.
✗ Branch 271 not taken.
✓ Branch 272 taken 18 times.
✗ Branch 273 not taken.
✓ Branch 274 taken 12 times.
✗ Branch 275 not taken.
✓ Branch 276 taken 6 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 6 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 9 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 12 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 15 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 12 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 12 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 6 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 9 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 12 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 15 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 27 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 27 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 21 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 42 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 63 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 63 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 36 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 54 times.
✗ Branch 313 not taken.
✓ Branch 314 taken 72 times.
✗ Branch 315 not taken.
✓ Branch 316 taken 90 times.
✗ Branch 317 not taken.
✓ Branch 318 taken 72 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 72 times.
✗ Branch 321 not taken.
✓ Branch 322 taken 36 times.
✗ Branch 323 not taken.
✓ Branch 324 taken 54 times.
✗ Branch 325 not taken.
✓ Branch 326 taken 57 times.
✗ Branch 327 not taken.
✓ Branch 328 taken 57 times.
✗ Branch 329 not taken.
✓ Branch 330 taken 21 times.
✗ Branch 331 not taken.
✓ Branch 332 taken 21 times.
✗ Branch 333 not taken.
✓ Branch 334 taken 21 times.
✗ Branch 335 not taken.
✓ Branch 336 taken 21 times.
✗ Branch 337 not taken.
✓ Branch 338 taken 6 times.
✗ Branch 339 not taken.
✓ Branch 340 taken 6 times.
✗ Branch 341 not taken.
✓ Branch 342 taken 6 times.
✗ Branch 343 not taken.
✓ Branch 344 taken 3 times.
✗ Branch 345 not taken.
✓ Branch 346 taken 6 times.
✗ Branch 347 not taken.
✓ Branch 348 taken 6 times.
✗ Branch 349 not taken.
✓ Branch 350 taken 6 times.
✗ Branch 351 not taken.
✓ Branch 352 taken 3 times.
✗ Branch 353 not taken.
✓ Branch 354 taken 6 times.
✗ Branch 355 not taken.
✓ Branch 356 taken 3 times.
✗ Branch 357 not taken.
✓ Branch 358 taken 3 times.
✗ Branch 359 not taken.
✓ Branch 360 taken 6 times.
✗ Branch 361 not taken.
✓ Branch 362 taken 6 times.
✗ Branch 363 not taken.
✓ Branch 364 taken 3 times.
✗ Branch 365 not taken.
✓ Branch 366 taken 3 times.
✗ Branch 367 not taken.
✓ Branch 368 taken 6 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.
 13864364 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 1746734 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 72 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 876 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 114 times.
✗ Branch 7 not taken.
 1750498 return cached_data;
52 }
53
54 char *raw() const
55 {
56
1/2
✓ Branch 0 taken 12 times.
✗ Branch 1 not taken.
 54197354 return cached_data;
57 }
58
59 int length() const
60 {
61 50372033 return is_inlined() ? inlined.len : allocated.len;
62 }
63
64 27983347 void set_length(int length)
65 {
66
2/2
✓ Branch 0 taken 40853 times.
✓ Branch 1 taken 27942494 times.
 27983347 if(length > max_inline_length_){
67 40853 inlined.len = (unsigned char)-1;
68 40853 allocated.len = length;
69 }else{
70 27942494 inlined.len = length;
71 }
72 27983347 }
73
74 void truncate(int newlen)
75 {
76 1745000 resize(newlen);
77 1092030 }
78
79 5338462 void assign(const char * newstr)
80 {
81
2/2
✓ Branch 0 taken 190 times.
✓ Branch 1 taken 5338272 times.
 5338462 if (!newstr) newstr = "";
82 5338462 assign(newstr, strlen(newstr));
83 5338462 }
84
85 5884999 void assign(const string &newstr)
86 {
87 5884999 assign(newstr, newstr.length());
88 5884999 }
89
90 15663447 void assign(const char * newstr, int end)
91 {
92 15663447 resize(end);
93 copy(newstr, length(), raw());
94 15663447 }
95
96
97 string& operator=(const char * newstr)
98 {
99 1099008 assign(newstr);
100 1092464 return *this;
101 }
102
103 string& operator=(const string &newstr)
104 {
105 2638703 assign(newstr);
106 10928 return *this;
107 }
108
109 873644 string& operator+=(const string& other)
110 {
111 int current_end = length();
112 873644 resize(length() + other.length());
113 873644 copy(other.data(), other.length(), raw() + current_end);
114 873644 return *this;
115 }
116
117 43510 string& operator+=(const char *other)
118 {
119 int current_end = length();
120 43510 int otherlen=(int)strlen(other);
121 43510 resize(length() + otherlen);
122 43510 copy(other, otherlen, raw() + current_end);
123 43510 return *this;
124 }
125
126 9656816 string& operator+=(char c)
127 {
128 9656816 resize(length() + 1);
129 9656816 raw()[length() - 1] = c;
130 9656816 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 41344 ret+=right;
144 138 return ret;
145 }
146
147 5210 bool operator==(const char * right) const
148 {
149 5210 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 1536 bool operator!=(const char * right) const
158 {
159 1536 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 429042 explicit operator bool() const
173 {
174 429042 return length();
175 }
176
177 16455572 string()
178 16455572 {
179 //todo reduce I know this isn't all needed
180 16455572 allocated.bufferlen = 0;
181 16455572 allocated.str = 0;
182 16455572 allocated.len = 0;
183 16455572 inlined.len = 0;
184 16455572 cached_data = inlined.str;
185 16455572 next_resize = max_inline_length_+1;
186
187 12790868 }
188 3771522 string(const char * newstr) : string()
189 {
190 3771522 assign(newstr);
191 3334819 }
192 2611620 string(const char * newstr, int newlen) : string()
193 {
194 2611620 assign(newstr, newlen);
195 2175914 }
196 467932 string(const string& old) : string()
197 {
198 467932 assign(old.data());
199 467769 }
200
201 1074 string(string &&move) : string()
202 {
203 *this = move;
204 1074 }
205
206 2823950 string& operator=(string&& move)
207 {
208 700 if(!is_inlined()) free(allocated.str);
209 2823950 if(!move.is_inlined()){
210 930 allocated.str = move.allocated.str;
211 930 allocated.bufferlen = move.allocated.bufferlen;
212 930 set_length(move.allocated.len);
213
214 930 move.inlined.len = 0;
215 930 move.inlined.str[0] = 0;
216 930 cached_data = allocated.str;
217 930 next_resize = move.next_resize;
218
219 }else{
220 2823020 inlined.len = 0;
221 2823020 cached_data = inlined.str;
222 2823020 next_resize = max_inline_length_+1;
223 2823020 assign(move);
224 }
225 2823950 return *this;
226 }
227
228 41020863 ~string()
229 {
230 24624319 if(!is_inlined()){
231 12176 free(allocated.str);
232 }
233 41020863 }
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 27982417 void resize(int new_length)
269 {
270 const char *old_data = data();
271
4/4
✓ Branch 0 taken 27972938 times.
✓ Branch 1 taken 9479 times.
✓ Branch 2 taken 115 times.
✓ Branch 3 taken 30444 times.
 28012976 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
272
3/4
✓ Branch 0 taken 9479 times.
✓ Branch 1 taken 115 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 650 times.
 10244 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
273 9479 int new_size = bit_round(new_length + 1);
274
2/2
✓ Branch 0 taken 8829 times.
✓ Branch 1 taken 650 times.
 9479 if(old_data == inlined.str){
275
1/2
✓ Branch 0 taken 8829 times.
✗ Branch 1 not taken.
 17658 allocated.str = copy(old_data, min_val(length(), new_length), (char *)malloc(new_size));
276 }else{
277 650 allocated.str = (char *)realloc(allocated.str, new_size);
278 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
279 }
280 9479 allocated.bufferlen = new_size;
281 9479 cached_data = allocated.str;
282 9479 next_resize = allocated.bufferlen;
283
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 115 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 115 times.
 115 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
284 115 copy(old_data, new_length, inlined.str);
285 115 cached_data = inlined.str;
286 115 next_resize = max_inline_length_+1;
287 }
288
3/4
✓ Branch 0 taken 115 times.
✓ Branch 1 taken 9479 times.
✓ Branch 2 taken 115 times.
✗ Branch 3 not taken.
 9594 if(old_data != inlined.str && old_data != data()){
289 115 free((char *)old_data);
290 }
291 }
292 27982417 set_length(new_length);
293
294 27982417 raw()[new_length] = 0; //always ensure null terminator
295 27982417 }
296
297 bool is_inlined() const
298 {
299
36/40
✓ Branch 0 taken 2399417 times.
✓ Branch 1 taken 27960131 times.
✓ Branch 2 taken 78280 times.
✓ Branch 3 taken 26441 times.
✓ Branch 4 taken 2992 times.
✓ Branch 5 taken 155 times.
✓ Branch 6 taken 1093592 times.
✓ Branch 7 taken 16418475 times.
✓ Branch 8 taken 1085600 times.
✓ Branch 9 taken 5648 times.
✓ Branch 10 taken 350 times.
✓ Branch 11 taken 1091382 times.
✓ Branch 12 taken 876078 times.
✓ Branch 13 taken 1086608 times.
✓ Branch 14 taken 532231 times.
✓ Branch 15 taken 2047 times.
✓ Branch 16 taken 10487852 times.
✓ Branch 17 taken 17100 times.
✓ Branch 18 taken 9550797 times.
✓ Branch 19 taken 16095 times.
✓ Branch 20 taken 15654182 times.
✓ Branch 21 taken 13689 times.
✓ Branch 22 taken 6748778 times.
✓ Branch 23 taken 7345 times.
✓ Branch 24 taken 873153 times.
✓ Branch 25 taken 491 times.
✓ Branch 26 taken 872731 times.
✓ Branch 27 taken 1732135 times.
✓ Branch 28 taken 694 times.
✓ Branch 29 taken 1731650 times.
✓ Branch 30 taken 20508 times.
✓ Branch 31 taken 5340 times.
✓ Branch 32 taken 20232 times.
✓ Branch 33 taken 5616 times.
✓ Branch 34 taken 258 times.
✓ Branch 35 taken 144 times.
✗ Branch 36 not taken.
✗ Branch 37 not taken.
✗ Branch 38 not taken.
✗ Branch 39 not taken.
 97594967 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 1126 inline char ** split(char * str, const char * key, int * len= nullptr) { return nsplit(str, key, 0, len); }
311 1746456 inline char ** qsplit(char * str, const char * key, int * len= nullptr) { return qnsplit(str, key, 0, len); }
312 220066 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 char buffer[64];
379 2 sprintf(buffer, "%.6X", value);
380 2 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 1610 inline string dec(int value)
391 {
392 char buffer[64];
393 1610 sprintf(buffer, "%i", value);
394 1610 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 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.
 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 211206 return rval;
416 }
417
418 // Same as above, but with variable precision
419 46 inline string ftostrvar(double value, int precision)
420 {
421 int clampedprecision = precision;
422 if (clampedprecision < 0) clampedprecision = 0;
423 46 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.
 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 46 return rval;
439 }
440
441 2797742 inline bool stribegin(const char * str, const char * key)
442 {
443
2/2
✓ Branch 0 taken 4059256 times.
✓ Branch 1 taken 219300 times.
 4278556 for (int i=0;key[i];i++)
444 {
445
2/2
✓ Branch 0 taken 1480814 times.
✓ Branch 1 taken 2578442 times.
 4059256 if (to_lower(str[i])!=to_lower(key[i])) return false;
446 }
447 return true;
448 }
449
450 7860 inline bool striend(const char * str, const char * key)
451 {
452 3930 const char * keyend=strrchr(key, '\0');
453 3930 const char * strend=strrchr(str, '\0');
454
2/2
✓ Branch 0 taken 8748 times.
✓ Branch 1 taken 1434 times.
 10182 while (key!=keyend)
455 {
456 8748 keyend--;
457 8748 strend--;
458
2/2
✓ Branch 0 taken 2322 times.
✓ Branch 1 taken 6426 times.
 8748 if (to_lower(*strend)!=to_lower(*keyend)) return false;
459 }
460 return true;
461 }
462
463 113270 inline bool stricmpwithupper(const char *word1, const char *word2)
464 {
465
2/2
✓ Branch 0 taken 126494 times.
✓ Branch 1 taken 3676 times.
 130170 while(*word2)
466 {
467
2/2
✓ Branch 0 taken 16900 times.
✓ Branch 1 taken 109594 times.
 126494 if(to_upper(*word1++) != *word2++) return true;
468 }
469 3676 return *word1;
470 }
471
472 10468766 inline bool stricmpwithlower(const char *word1, const char *word2)
473 {
474
2/2
✓ Branch 0 taken 18982906 times.
✓ Branch 1 taken 1703116 times.
 20686022 while(*word2)
475 {
476
2/2
✓ Branch 0 taken 10217256 times.
✓ Branch 1 taken 8765650 times.
 18982906 if(to_lower(*word1++) != *word2++) return true;
477 }
478 1703116 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 int inpos=1;
490 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
1/2
✓ Branch 0 taken 16962 times.
✗ Branch 1 not taken.
 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 22290 inline char * strqchr(const char * str, char key)
507 {
508
2/2
✓ Branch 0 taken 171304 times.
✓ Branch 1 taken 18050 times.
 189354 while (*str != '\0')
509 {
510
2/2
✓ Branch 0 taken 4236 times.
✓ Branch 1 taken 167068 times.
 171304 if (*str == key) { return const_cast<char*>(str); }
511
4/4
✓ Branch 0 taken 166252 times.
✓ Branch 1 taken 816 times.
✓ Branch 2 taken 144 times.
✓ Branch 3 taken 166108 times.
 167068 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 816 times.
✓ Branch 2 taken 8 times.
✓ Branch 3 taken 136 times.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
 960 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
516 else
517 {
518 char delimiter = *str;
519
520 do
521 {
522 13122 str++;
523
524 // If we want to support backslash escapes, we'll have to add that right here.
525
4/4
✓ Branch 0 taken 12174 times.
✓ Branch 1 taken 948 times.
✓ Branch 2 taken 12170 times.
✓ Branch 3 taken 4 times.
 13122 } 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 948 times.
✓ Branch 1 taken 4 times.
 952 if (*str == '\0') { return nullptr; }
529 }
530 }
531
532 167064 str++;
533 }
534
535 return nullptr;
536 }
537
538 // RPG Hacker: WOW, these functions are poopy!
539 11372 inline char * strqrchr(const char * str, char key)
540 {
541 const char * ret= nullptr;
542
2/2
✓ Branch 0 taken 71672 times.
✓ Branch 1 taken 11372 times.
 83044 while (*str)
543 {
544
4/4
✓ Branch 0 taken 71074 times.
✓ Branch 1 taken 598 times.
✓ Branch 2 taken 72 times.
✓ Branch 3 taken 71002 times.
 71672 if (*str=='"' || *str=='\'')
545 {
546 char token = *str;
547
548 670 str++;
549
550 // Special case hack for '''
551
4/4
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 664 times.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 4 times.
 670 if (str[0] == '\'' && str[1] == '\'') { str += 2; }
552 else
553 {
554
2/2
✓ Branch 0 taken 6320 times.
✓ Branch 1 taken 666 times.
 6986 while (*str != token)
555 {
556
1/2
✓ Branch 0 taken 6320 times.
✗ Branch 1 not taken.
 6320 if (!*str) return nullptr;
557 6320 str++;
558 }
559 666 str++;
560 }
561 }
562 else
563 {
564
2/2
✓ Branch 0 taken 1936 times.
✓ Branch 1 taken 69066 times.
 71002 if (*str==key) ret=str;
565 71002 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
2/2
✓ Branch 0 taken 1183 times.
✓ Branch 1 taken 168 times.
 1351 inline string &lower(string &old)
592 {
593 int length = old.length();
594
2/2
✓ Branch 0 taken 46746 times.
✓ Branch 1 taken 1351 times.
 48097 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
595 1351 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 872432 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
625 {
626 872432 out = string("");
627 int count = 1;
628
629
1/2
✓ Branch 0 taken 872450 times.
✗ Branch 1 not taken.
 873488 for (int i = startline; lines[i]; i++)
630 {
631 // The line should already be stripped of any comments at this point
632 872450 int linestartpos = (int)strlen(lines[i]);
633
634 bool found = false;
635
636
2/2
✓ Branch 0 taken 1725152 times.
✓ Branch 1 taken 9964 times.
 1735116 for (int j = linestartpos; j > 0; j--)
637 {
638
4/6
✓ Branch 0 taken 1725152 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 862486 times.
✓ Branch 3 taken 862666 times.
✓ Branch 4 taken 862486 times.
✗ Branch 5 not taken.
 1728266 if (!is_space(lines[i][j]) && lines[i][j] != '\0' && lines[i][j] != ';')
639 {
640
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 862468 times.
 862486 if (lines[i][j] == '\\')
641 {
642 18 count++;
643 18 out += string(lines[i], j);
644 found = true;
645 18 break;
646 }
647 else
648 {
649 862984 out += string(lines[i], j + 1);
650 862468 return count - 1;
651 }
652 }
653 }
654
655
2/2
✓ Branch 0 taken 9964 times.
✓ Branch 1 taken 18 times.
 9982 if (!found)
656 {
657 9964 out += string(lines[i], 1);
658 9964 return count - 1;
659 }
660 }
661
662 ✗ return count - 1;
663 }
664