asar coverage - build #174

src/asar/
File: src/asar/libstr.h
Date: 2024-01-28 00:31:05
Lines:
226/238
95.0%
Functions:
53/55
96.4%
Branches:
417/636
65.6%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4 #include "libmisc.h"
5 #include <cstdint>
6 //ty alcaro
7 extern const unsigned char char_props[256];
8 6321764 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
9 static inline int to_upper(unsigned char c) { return c&~(char_props[c]&0x20); }
10
11
10/10
✓ Branch 0 taken 74649 times.
✓ Branch 1 taken 29118 times.
✓ Branch 2 taken 74559 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2583 times.
✓ Branch 7 taken 6621 times.
✓ Branch 8 taken 2637 times.
✓ Branch 9 taken 2583 times.
 777840 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 149899 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
13 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
14 4074 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
15 5694 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
16 inline bool is_alnum(unsigned char c) { return char_props[c] & 0x60; }
17 41652 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 404952 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 9504 times.
✓ Branch 1 taken 10344 times.
✓ Branch 2 taken 756 times.
✓ Branch 3 taken 261 times.
 41782 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 2008858 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 4582823 memcpy(dest, source, copy_length*sizeof(char));
24 2008858 return dest;
25 }
26
27 class string {
28 public:
29 7242649 const char *data() const
30 {
31
222/368
✓ Branch 0 taken 5192 times.
✓ Branch 1 taken 975817 times.
✓ Branch 2 taken 960288 times.
✓ Branch 3 taken 3168 times.
✓ Branch 4 taken 5305 times.
✓ Branch 5 taken 2295 times.
✓ Branch 6 taken 15654 times.
✓ Branch 7 taken 4190 times.
✓ Branch 8 taken 15899 times.
✓ Branch 9 taken 5547 times.
✓ Branch 10 taken 1665 times.
✓ Branch 11 taken 2511 times.
✓ Branch 12 taken 1152 times.
✓ Branch 13 taken 206 times.
✓ Branch 14 taken 1614 times.
✓ Branch 15 taken 488 times.
✓ Branch 16 taken 11405 times.
✓ Branch 17 taken 437 times.
✓ Branch 18 taken 504 times.
✓ Branch 19 taken 1084 times.
✓ Branch 20 taken 210 times.
✓ Branch 21 taken 5414 times.
✓ Branch 22 taken 1196 times.
✓ Branch 23 taken 385 times.
✓ Branch 24 taken 383 times.
✓ Branch 25 taken 144 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 658 times.
✓ Branch 28 taken 554 times.
✓ Branch 29 taken 126 times.
✓ Branch 30 taken 244 times.
✓ Branch 31 taken 540 times.
✓ Branch 32 taken 216 times.
✓ Branch 33 taken 81780 times.
✓ Branch 34 taken 48 times.
✓ Branch 35 taken 828 times.
✓ Branch 36 taken 1404 times.
✓ Branch 37 taken 85947 times.
✓ Branch 38 taken 783 times.
✓ Branch 39 taken 5045 times.
✓ Branch 40 taken 18 times.
✓ Branch 41 taken 5841 times.
✓ Branch 42 taken 3 times.
✓ Branch 43 taken 51 times.
✓ Branch 44 taken 48 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 51 times.
✓ Branch 47 taken 167 times.
✗ Branch 48 not taken.
✓ Branch 49 taken 33 times.
✓ Branch 50 taken 1141 times.
✓ Branch 51 taken 3 times.
✓ Branch 52 taken 1269 times.
✓ Branch 53 taken 66542 times.
✓ Branch 54 taken 15009 times.
✓ Branch 55 taken 114 times.
✗ Branch 56 not taken.
✓ Branch 57 taken 529 times.
✓ Branch 58 taken 15812 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 418 times.
✓ Branch 61 taken 138 times.
✓ Branch 62 taken 155 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 61098 times.
✓ Branch 65 taken 15012 times.
✓ Branch 66 taken 122 times.
✓ Branch 67 taken 39 times.
✗ Branch 68 not taken.
✓ Branch 69 taken 90 times.
✓ Branch 70 taken 84078 times.
✓ Branch 71 taken 9 times.
✓ Branch 72 taken 9 times.
✓ Branch 73 taken 68757 times.
✓ Branch 74 taken 15417 times.
✗ Branch 75 not taken.
✓ Branch 76 taken 192 times.
✓ Branch 77 taken 9 times.
✗ Branch 78 not taken.
✓ Branch 79 taken 201 times.
✓ Branch 80 taken 18 times.
✓ Branch 81 taken 4245 times.
✓ Branch 82 taken 71 times.
✓ Branch 83 taken 771 times.
✓ Branch 84 taken 351 times.
✓ Branch 85 taken 21 times.
✓ Branch 86 taken 153 times.
✗ Branch 87 not taken.
✓ Branch 88 taken 50 times.
✓ Branch 89 taken 153 times.
✗ Branch 90 not taken.
✓ Branch 91 taken 146 times.
✓ Branch 92 taken 81 times.
✗ Branch 93 not taken.
✓ Branch 94 taken 164 times.
✓ Branch 95 taken 81 times.
✗ Branch 96 not taken.
✓ Branch 97 taken 356 times.
✓ Branch 98 taken 17889 times.
✗ Branch 99 not taken.
✓ Branch 100 taken 87 times.
✓ Branch 101 taken 2889 times.
✗ Branch 102 not taken.
✓ Branch 103 taken 90 times.
✓ Branch 104 taken 2880 times.
✗ Branch 105 not taken.
✓ Branch 106 taken 123 times.
✗ Branch 107 not taken.
✗ Branch 108 not taken.
✓ Branch 109 taken 10858 times.
✗ Branch 110 not taken.
✓ Branch 111 taken 10828 times.
✓ Branch 112 taken 9 times.
✗ Branch 113 not taken.
✓ Branch 114 taken 15586 times.
✗ Branch 115 not taken.
✗ Branch 116 not taken.
✓ Branch 117 taken 12 times.
✓ Branch 118 taken 345 times.
✗ Branch 119 not taken.
✓ Branch 120 taken 54 times.
✓ Branch 121 taken 9 times.
✓ Branch 122 taken 54 times.
✓ Branch 123 taken 15459 times.
✓ Branch 124 taken 54 times.
✗ Branch 125 not taken.
✓ Branch 126 taken 150 times.
✗ Branch 127 not taken.
✓ Branch 128 taken 12 times.
✗ Branch 129 not taken.
✗ Branch 130 not taken.
✗ Branch 131 not taken.
✓ Branch 132 taken 21 times.
✗ Branch 133 not taken.
✓ Branch 134 taken 9941 times.
✓ Branch 135 taken 9 times.
✓ Branch 136 taken 3 times.
✓ Branch 137 taken 601 times.
✓ Branch 138 taken 3 times.
✗ Branch 139 not taken.
✗ Branch 140 not taken.
✓ Branch 141 taken 613 times.
✓ Branch 142 taken 6 times.
✓ Branch 143 taken 598 times.
✓ Branch 144 taken 9 times.
✗ Branch 145 not taken.
✗ Branch 146 not taken.
✓ Branch 147 taken 1993 times.
✓ Branch 148 taken 252 times.
✓ Branch 149 taken 12 times.
✗ Branch 150 not taken.
✓ Branch 151 taken 9 times.
✗ Branch 152 not taken.
✗ Branch 153 not taken.
✗ Branch 154 not taken.
✗ Branch 155 not taken.
✓ Branch 156 taken 9 times.
✗ Branch 157 not taken.
✓ Branch 158 taken 12 times.
✗ Branch 159 not taken.
✗ Branch 160 not taken.
✗ Branch 161 not taken.
✓ Branch 162 taken 9 times.
✗ Branch 163 not taken.
✓ Branch 164 taken 9 times.
✗ Branch 165 not taken.
✓ Branch 166 taken 3 times.
✗ Branch 167 not taken.
✓ Branch 168 taken 9 times.
✗ Branch 169 not taken.
✓ Branch 170 taken 9 times.
✗ Branch 171 not taken.
✗ Branch 172 not taken.
✗ Branch 173 not taken.
✓ Branch 174 taken 93 times.
✗ Branch 175 not taken.
✓ Branch 176 taken 189 times.
✗ Branch 177 not taken.
✓ Branch 178 taken 9 times.
✗ Branch 179 not taken.
✗ Branch 180 not taken.
✗ Branch 181 not taken.
✓ Branch 182 taken 3 times.
✗ Branch 183 not taken.
✓ Branch 184 taken 180 times.
✗ Branch 185 not taken.
✓ Branch 186 taken 72 times.
✗ Branch 187 not taken.
✓ Branch 188 taken 180 times.
✗ Branch 189 not taken.
✓ Branch 190 taken 3 times.
✗ Branch 191 not taken.
✓ Branch 192 taken 9 times.
✗ Branch 193 not taken.
✓ Branch 194 taken 9 times.
✗ Branch 195 not taken.
✓ Branch 196 taken 18 times.
✗ Branch 197 not taken.
✓ Branch 198 taken 51 times.
✗ Branch 199 not taken.
✓ Branch 200 taken 51 times.
✗ Branch 201 not taken.
✓ Branch 202 taken 33 times.
✗ Branch 203 not taken.
✓ Branch 204 taken 42 times.
✗ Branch 205 not taken.
✓ Branch 206 taken 51 times.
✗ Branch 207 not taken.
✓ Branch 208 taken 63 times.
✗ Branch 209 not taken.
✓ Branch 210 taken 33 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 81 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 96 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 279 times.
✓ Branch 217 taken 3 times.
✓ Branch 218 taken 90 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 90 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 99 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 102 times.
✓ Branch 225 taken 3 times.
✓ Branch 226 taken 81 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 1170 times.
✓ Branch 229 taken 35523 times.
✓ Branch 230 taken 6039 times.
✓ Branch 231 taken 30789 times.
✓ Branch 232 taken 9 times.
✓ Branch 233 taken 6015 times.
✓ Branch 234 taken 24 times.
✓ Branch 235 taken 18 times.
✓ Branch 236 taken 24 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 27 times.
✗ Branch 239 not taken.
✓ Branch 240 taken 27 times.
✗ Branch 241 not taken.
✓ Branch 242 taken 9 times.
✗ Branch 243 not taken.
✓ Branch 244 taken 18 times.
✗ Branch 245 not taken.
✓ Branch 246 taken 27 times.
✗ Branch 247 not taken.
✓ Branch 248 taken 27 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 18 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 27 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 27 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 18 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 27 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 27 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 27 times.
✗ Branch 271 not taken.
✓ Branch 272 taken 27 times.
✗ Branch 273 not taken.
✓ Branch 274 taken 9 times.
✗ Branch 275 not taken.
✓ Branch 276 taken 9 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 9 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 18 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 27 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 27 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 9 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 18 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 27 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 27 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 54 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 54 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 54 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 108 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 162 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 162 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 54 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 108 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 162 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 162 times.
✗ Branch 313 not taken.
✓ Branch 314 taken 54 times.
✗ Branch 315 not taken.
✓ Branch 316 taken 54 times.
✗ Branch 317 not taken.
✓ Branch 318 taken 54 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 54 times.
✗ Branch 321 not taken.
✓ Branch 322 taken 9 times.
✗ Branch 323 not taken.
✓ Branch 324 taken 9 times.
✗ Branch 325 not taken.
✓ Branch 326 taken 9 times.
✗ Branch 327 not taken.
✓ Branch 328 taken 9 times.
✗ Branch 329 not taken.
✓ Branch 330 taken 9 times.
✗ Branch 331 not taken.
✓ Branch 332 taken 9 times.
✗ Branch 333 not taken.
✓ Branch 334 taken 9 times.
✗ Branch 335 not taken.
✓ Branch 336 taken 9 times.
✗ Branch 337 not taken.
✓ Branch 338 taken 9 times.
✗ Branch 339 not taken.
✗ Branch 340 not taken.
✗ Branch 341 not taken.
✓ Branch 342 taken 9 times.
✗ Branch 343 not taken.
✓ Branch 344 taken 9 times.
✗ Branch 345 not taken.
✓ Branch 346 taken 9 times.
✗ Branch 347 not taken.
✗ Branch 348 not taken.
✗ Branch 349 not taken.
✓ Branch 350 taken 9 times.
✗ Branch 351 not taken.
✓ Branch 352 taken 9 times.
✗ Branch 353 not taken.
✗ Branch 354 not taken.
✗ Branch 355 not taken.
✓ Branch 356 taken 9 times.
✗ Branch 357 not taken.
✓ Branch 358 taken 9 times.
✗ Branch 359 not taken.
✓ Branch 360 taken 9 times.
✗ Branch 361 not taken.
✗ Branch 362 not taken.
✗ Branch 363 not taken.
✓ Branch 364 taken 9 times.
✗ Branch 365 not taken.
✗ Branch 366 not taken.
✗ Branch 367 not taken.
 10296206 return cached_data;
32 }
33
34 188573 char *temp_raw() const //things to cleanup and take a look at
35 {
36
4/8
✓ Branch 0 taken 165558 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7131 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2313 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 60 times.
✗ Branch 7 not taken.
 401170 return cached_data;
37 }
38
39 3345110 char *raw() const
40 {
41
5/8
✓ Branch 0 taken 2106 times.
✓ Branch 1 taken 84456 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 9 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 36 times.
 7471025 return cached_data;
42 }
43
44 6994366 int length() const
45 {
46
2/2
✓ Branch 0 taken 6827926 times.
✓ Branch 1 taken 166440 times.
 15819998 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 6931223 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 41005 times.
✓ Branch 1 taken 6890218 times.
 6931223 if(length > max_inline_length_){
52 41005 inlined.len = (unsigned char)-1;
53 41005 allocated.len = length;
54 }else{
55 6890218 inlined.len = length;
56 }
57 6931223 }
58
59 1188 void truncate(int newlen)
60 {
61 2376 resize(newlen);
62 2376 }
63
64 2031077 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 12331 times.
✓ Branch 1 taken 2018746 times.
 2031077 if (!newstr) newstr = "";
67 2031077 assign(newstr, strlen(newstr));
68 2031077 }
69
70 1358970 void assign(const string &newstr)
71 {
72 1358970 assign(newstr, newstr.length());
73 1358970 }
74
75 3651038 void assign(const char * newstr, int end)
76 {
77 3651038 resize(end);
78 3651038 copy(newstr, length(), cached_data);
79 3651038 }
80
81
82 366198 string& operator=(const char * newstr)
83 {
84 813244 assign(newstr);
85 375848 return *this;
86 }
87
88 430978 string& operator=(const string &newstr)
89 {
90 559145 assign(newstr);
91 463088 return *this;
92 }
93
94 string& append(const string& other, int start, int end)
95 {
96 int current_end = length();
97 resize(length() + end - start);
98 copy(other.cached_data + start, end - start, cached_data + current_end);
99 return *this;
100 }
101
102 9564 string& append(const char *other, int start, int end)
103 {
104 4785 int current_end = length();
105 9564 resize(length() + end - start);
106 9564 copy(other + start, end - start, cached_data + current_end);
107 9564 return *this;
108 }
109
110 220949 string& operator+=(const string& other)
111 {
112 86710 int current_end = length();
113 220949 resize(length() + other.length());
114 355188 copy(other.cached_data, other.length(), cached_data + current_end);
115 220949 return *this;
116 }
117
118 677792 string& operator+=(const char *other)
119 {
120 295967 int current_end = length();
121 677792 int otherlen=(int)strlen(other);
122 677792 resize(length() + otherlen);
123 677792 copy(other, otherlen, cached_data + current_end);
124 677792 return *this;
125 }
126
127 2369278 string& operator+=(char c)
128 {
129 2369278 resize(length() + 1);
130 3734024 cached_data[length() - 1] = c;
131 2369278 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 58453 string operator+(const char * right) const
142 {
143 58453 string ret=*this;
144
1/2
✓ Branch 0 taken 58453 times.
✗ Branch 1 not taken.
 149779 ret+=right;
145 64036 return ret;
146 ✗ }
147
148 21420 bool operator==(const char * right) const
149 {
150 21420 return !strcmp(data(), right);
151 }
152
153 222 bool operator==(const string& right) const
154 {
155 222 return !strcmp(data(), right.data());
156 }
157
158 28044 bool operator!=(const char * right) const
159 {
160 28044 return (strcmp(data(), right) != 0);
161 }
162
163 bool operator!=(const string& right) const
164 {
165 return (strcmp(data(), right.data()) != 0);
166 }
167
168 3928060 operator const char*() const
169 {
170 3928060 return data();
171 }
172
173 36202 explicit operator bool() const
174 {
175 36202 return length();
176 }
177
178 4514103 string()
179 4514103 {
180 //todo reduce I know this isn't all needed
181 4514103 allocated.bufferlen = 0;
182 4514103 allocated.str = 0;
183 4514103 allocated.len = 0;
184 4514103 inlined.len = 0;
185 4514103 cached_data = inlined.str;
186 4514103 next_resize = max_inline_length_+1;
187
188 3528638 }
189 1018841 string(const char * newstr) : string()
190 {
191
1/2
✓ Branch 0 taken 468053 times.
✗ Branch 1 not taken.
 1018841 assign(newstr);
192 921861 }
193 228555 string(const char * newstr, int newlen) : string()
194 {
195
1/2
✓ Branch 0 taken 105108 times.
✗ Branch 1 not taken.
 228555 assign(newstr, newlen);
196 228528 }
197 198992 string(const string& old) : string()
198 {
199
1/2
✓ Branch 0 taken 83094 times.
✗ Branch 1 not taken.
 198992 assign(old.data());
200 198671 }
201
202 25621 string(string &&move) : string()
203 {
204
1/2
✓ Branch 0 taken 9730 times.
✗ Branch 1 not taken.
 9730 *this = move;
205 25621 }
206
207 390485 string& operator=(string&& move)
208 {
209
2/2
✓ Branch 0 taken 87 times.
✓ Branch 1 taken 139874 times.
 140048 if(!is_inlined()) free(allocated.str);
210
2/2
✓ Branch 0 taken 107 times.
✓ Branch 1 taken 139854 times.
 390485 if(!move.is_inlined()){
211 226 allocated.str = move.allocated.str;
212 226 allocated.bufferlen = move.allocated.bufferlen;
213 226 set_length(move.allocated.len);
214
215 226 move.inlined.len = 0;
216 226 move.inlined.str[0] = 0;
217 226 cached_data = allocated.str;
218 226 next_resize = move.next_resize;
219
220 }else{
221 390259 inlined.len = 0;
222 390259 cached_data = inlined.str;
223 390259 next_resize = max_inline_length_+1;
224 390259 assign(move);
225 }
226 390485 return *this;
227 }
228
229 11121868 ~string()
230 {
231
2/2
✓ Branch 0 taken 9843 times.
✓ Branch 1 taken 1947793 times.
 6539752 if(!is_inlined()){
232 32405 free(allocated.str);
233 }
234 11121868 }
235
236 //maybe these should return refs to chain. but also good not to encourage chaining
237 5131 void strip_prefix(char c)
238 {
239
2/2
✓ Branch 0 taken 1466 times.
✓ Branch 1 taken 3665 times.
 5131 if(cached_data[0] == c){
240
3/6
✓ Branch 0 taken 734 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 734 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 734 times.
✗ Branch 5 not taken.
 1466 *this = string(cached_data + 1, length() - 1);
241 }
242 5131 }
243
244 void strip_suffix(char c)
245 {
246 if(cached_data[length() - 1] == c){
247 truncate(length() - 1);
248 }
249 }
250
251 string& qreplace(const char * instr, const char * outstr);
252 string& qnormalize();
253
254 // RPG Hacker: My hack shmeck to get around no longer supporting text mode.
255 // Symbol files are currently the only thing that use text mode, anyways, and I don't even know
256 // if the emulators that read them care about line endings.
257 ✗ string& convert_line_endings_to_native()
258 {
259 #if defined(windows)
260 // RPG Hacker: This is quite stinky, but doing the replacement directly will lead to a dead-lock.
261 // \x08 = backspace should never appear inside a string, so I'm abusing it here.
262 ✗ return qreplace("\n", "\x08").qreplace("\x08", "\r\n");
263 #else
264 ✗ return *this;
265 #endif
266 }
267
268 #ifdef SERIALIZER
269 void serialize(serializer & s)
270 {
271 s(str, allocated.bufferlen);
272 set_length(strlen(str));
273 }
274 #endif
275 #define SERIALIZER_BANNED
276
277 private:
278 static const int scale_factor = 4; //scale sso
279 static const int max_inline_length_ = ((sizeof(char *) + sizeof(int) * 2) * scale_factor) - 2;
280 char *cached_data;
281 int next_resize;
282 struct si{
283 char str[max_inline_length_ + 1];
284 unsigned char len;
285 };
286
287 struct sa{
288 char *str;
289 int len;
290 int bufferlen ;
291 };
292 union{
293 si inlined;
294 sa allocated;
295 };
296
297
298 6930997 void resize(int new_length)
299 {
300 3002698 const char *old_data = data();
301
8/8
✓ Branch 0 taken 6907766 times.
✓ Branch 1 taken 23231 times.
✓ Branch 2 taken 8926 times.
✓ Branch 3 taken 2992229 times.
✓ Branch 4 taken 975 times.
✓ Branch 5 taken 7837 times.
✓ Branch 6 taken 12343 times.
✓ Branch 7 taken 2990355 times.
 6940822 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
302
7/8
✓ Branch 0 taken 23231 times.
✓ Branch 1 taken 1089 times.
✓ Branch 2 taken 463 times.
✓ Branch 3 taken 11282 times.
✓ Branch 4 taken 463 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 11368 times.
✓ Branch 7 taken 975 times.
 24697 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
303 23231 int new_size = bitround(new_length + 1);
304
2/2
✓ Branch 0 taken 22391 times.
✓ Branch 1 taken 840 times.
 23231 if(old_data == inlined.str){
305
1/2
✓ Branch 0 taken 11486 times.
✗ Branch 1 not taken.
 33877 allocated.str = copy(old_data, min(length(), new_length), (char *)malloc(new_size));
306 }else{
307 840 allocated.str = (char *)realloc(allocated.str, new_size);
308 463 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
309 }
310 23231 allocated.bufferlen = new_size;
311 23231 cached_data = allocated.str;
312 23231 next_resize = allocated.bufferlen;
313
5/6
✓ Branch 0 taken 975 times.
✓ Branch 1 taken 114 times.
✓ Branch 2 taken 975 times.
✓ Branch 3 taken 114 times.
✓ Branch 4 taken 975 times.
✗ Branch 5 not taken.
 1089 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
314 1089 copy(old_data, new_length, inlined.str);
315 1089 cached_data = inlined.str;
316 1089 next_resize = max_inline_length_+1;
317 }
318
5/6
✓ Branch 0 taken 1089 times.
✓ Branch 1 taken 23231 times.
✓ Branch 2 taken 1089 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 975 times.
✓ Branch 5 taken 11368 times.
 24320 if(old_data != inlined.str && old_data != data()){
319 1089 free((char *)old_data);
320 }
321 }
322 6930997 set_length(new_length);
323
324 6930997 raw()[new_length] = 0; //always ensure null terminator
325 6930997 }
326
327 12234622 bool is_inlined() const
328 {
329
52/82
✓ Branch 0 taken 1153509 times.
✓ Branch 1 taken 2694996 times.
✓ Branch 2 taken 995307 times.
✓ Branch 3 taken 1232300 times.
✓ Branch 4 taken 15594 times.
✓ Branch 5 taken 2270 times.
✓ Branch 6 taken 366 times.
✓ Branch 7 taken 9 times.
✓ Branch 8 taken 42205 times.
✓ Branch 9 taken 1620975 times.
✓ Branch 10 taken 34953 times.
✓ Branch 11 taken 872500 times.
✓ Branch 12 taken 149519 times.
✓ Branch 13 taken 178812 times.
✓ Branch 14 taken 1120676 times.
✓ Branch 15 taken 70922 times.
✓ Branch 16 taken 2531600 times.
✓ Branch 17 taken 38991 times.
✓ Branch 18 taken 622240 times.
✓ Branch 19 taken 790 times.
✓ Branch 20 taken 238378 times.
✓ Branch 21 taken 852 times.
✓ Branch 22 taken 228924 times.
✓ Branch 23 taken 923 times.
✓ Branch 24 taken 842959 times.
✓ Branch 25 taken 4795 times.
✓ Branch 26 taken 314070 times.
✓ Branch 27 taken 5540 times.
✓ Branch 28 taken 97887 times.
✓ Branch 29 taken 5413 times.
✓ Branch 30 taken 96732 times.
✓ Branch 31 taken 5413 times.
✓ Branch 32 taken 108 times.
✗ Branch 33 not taken.
✓ Branch 34 taken 36 times.
✗ Branch 35 not taken.
✓ Branch 36 taken 504 times.
✗ Branch 37 not taken.
✓ Branch 38 taken 270 times.
✗ Branch 39 not taken.
✓ Branch 40 taken 2286 times.
✗ Branch 41 not taken.
✓ Branch 42 taken 3528 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 3645 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 4428 times.
✗ Branch 47 not taken.
✓ Branch 48 taken 99 times.
✗ Branch 49 not taken.
✓ Branch 50 taken 171 times.
✗ Branch 51 not taken.
✓ Branch 52 taken 90 times.
✗ Branch 53 not taken.
✓ Branch 54 taken 180 times.
✗ Branch 55 not taken.
✓ Branch 56 taken 252 times.
✗ Branch 57 not taken.
✓ Branch 58 taken 324 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 72 times.
✗ Branch 61 not taken.
✓ Branch 62 taken 226230 times.
✓ Branch 63 taken 738 times.
✗ Branch 64 not taken.
✗ Branch 65 not taken.
✗ Branch 66 not taken.
✗ Branch 67 not taken.
✗ Branch 68 not taken.
✗ Branch 69 not taken.
✗ Branch 70 not taken.
✗ Branch 71 not taken.
✗ Branch 72 not taken.
✓ Branch 73 taken 1062 times.
✗ Branch 74 not taken.
✓ Branch 75 taken 1062 times.
✓ Branch 76 taken 34851 times.
✗ Branch 77 not taken.
✗ Branch 78 not taken.
✗ Branch 79 not taken.
✗ Branch 80 not taken.
✗ Branch 81 not taken.
 27484541 return inlined.len != (unsigned char)-1;
330 }
331 };
332 #define STR (string)
333
334 char * readfile(const char * fname, const char * basepath);
335 char * readfilenative(const char * fname);
336 bool readfile(const char * fname, const char * basepath, char ** data, int * len);//if you want an uchar*, cast it
337 char ** split(char * str, char key, int * len= nullptr);
338 char ** qsplit(char * str, char key, int * len= nullptr);
339 char ** qpsplit(char * str, char key, int * len= nullptr);
340 char ** qsplitstr(char * str, const char * key, int * len= nullptr);
341 bool confirmquotes(const char * str);
342 bool confirmqpar(const char * str);
343 char* strqpchr(char* str, char key);
344 char* strqpstr(char* str, const char* key);
345
346 ✗ inline string hex(unsigned int value)
347 {
348 char buffer[64];
349 if(0);
350 ✗ else if (value<=0x000000FF) sprintf(buffer, "%.2X", value);
351 ✗ else if (value<=0x0000FFFF) sprintf(buffer, "%.4X", value);
352 ✗ else if (value<=0x00FFFFFF) sprintf(buffer, "%.6X", value);
353 ✗ else sprintf(buffer, "%.8X", value);
354 ✗ return buffer;
355 }
356
357 718 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 718 sprintf(buffer, "%.*X", width, value);
361
1/2
✓ Branch 0 taken 359 times.
✗ Branch 1 not taken.
 1077 return buffer;
362 }
363
364 20241 inline string dec(int value)
365 {
366 char buffer[64];
367 20241 sprintf(buffer, "%i", value);
368
1/2
✓ Branch 0 taken 8096 times.
✗ Branch 1 not taken.
 28337 return buffer;
369 }
370
371 6498 inline string ftostr(double value)
372 {
373 // randomdude999: With 100 digits of precision, the buffer needs to be approx. 311+100,
374 // but let's be safe here https://stackoverflow.com/questions/7235456
375 char rval[512];
376 // RPG Hacker: Ridiculously high precision, I know, but we're working with doubles
377 // here and can afford it, so no need to waste any precision
378 6498 sprintf(rval, "%.100f", value);
379
1/2
✓ Branch 0 taken 6498 times.
✗ Branch 1 not taken.
 6498 if (strchr(rval, '.'))//nuke useless zeroes
380 {
381 6498 char * end=strrchr(rval, '\0')-1;
382
2/2
✓ Branch 0 taken 648756 times.
✓ Branch 1 taken 6498 times.
 655254 while (*end=='0')
383 {
384 648756 *end='\0';
385 648756 end--;
386 }
387
2/2
✓ Branch 0 taken 6480 times.
✓ Branch 1 taken 18 times.
 6498 if (*end=='.') *end='\0';
388 }
389
1/2
✓ Branch 0 taken 3249 times.
✗ Branch 1 not taken.
 9747 return rval;
390 }
391
392 // Same as above, but with variable precision
393 54 inline string ftostrvar(double value, int precision)
394 {
395 27 int clampedprecision = precision;
396
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 27 times.
 27 if (clampedprecision < 0) clampedprecision = 0;
397
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 27 times.
 54 if (clampedprecision > 100) clampedprecision = 100;
398
399 // see above
400 char rval[512];
401 54 sprintf(rval, "%.*f", clampedprecision, (double)value);
402
2/2
✓ Branch 0 taken 48 times.
✓ Branch 1 taken 6 times.
 54 if (strchr(rval, '.'))//nuke useless zeroes
403 {
404 48 char * end = strrchr(rval, '\0') - 1;
405
2/2
✓ Branch 0 taken 138 times.
✓ Branch 1 taken 48 times.
 186 while (*end == '0')
406 {
407 138 *end = '\0';
408 138 end--;
409 }
410
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 30 times.
 48 if (*end == '.') *end = '\0';
411 }
412
1/2
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
 81 return rval;
413 }
414
415 266386 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 909234 times.
✓ Branch 1 taken 26181 times.
 935415 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 573659 times.
✓ Branch 1 taken 335575 times.
 909234 if (to_lower(str[i])!=to_lower(key[i])) return false;
420 }
421 5592 return true;
422 }
423
424 inline bool striend(const char * str, const char * key)
425 {
426 const char * keyend=strrchr(key, '\0');
427 const char * strend=strrchr(str, '\0');
428 if(keyend-key > strend-str) return false;
429
430 while (key!=keyend)
431 {
432 keyend--;
433 strend--;
434 if (to_lower(*strend)!=to_lower(*keyend)) return false;
435 }
436 return true;
437 }
438
439 inline bool stricmpwithupper(const char *word1, const char *word2)
440 {
441 while(*word2)
442 {
443 if(to_upper(*word1++) != *word2++) return true;
444 }
445 return *word1;
446 }
447
448 2345114 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 3097301 times.
✓ Branch 1 taken 116180 times.
 3213481 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 1463673 times.
✓ Branch 1 taken 1633628 times.
 3097301 if(to_lower(*word1++) != *word2++) return true;
453 }
454 116180 return *word1;
455 }
456
457 //function: return the string without quotes around it, if any exists
458 //if they don't exist, return it unaltered
459 //it is not guaranteed to return str
460 //it is not guaranteed to not edit str
461 //the input must be freed even though it's garbage, the output must not
462 28783 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 17490 times.
✓ Branch 1 taken 11293 times.
 28783 if (*str!='"') return str;
465 26530 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 26530 times.
✗ Branch 1 not taken.
 26530 if (end)
467 {
468 26530 *end = 0;
469 26530 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 26530 times.
 26962 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 10177 return str + 1;
472 }
473 ✗ return nullptr;
474 }
475
476 36411 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 342134 times.
✓ Branch 1 taken 25350 times.
 367484 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 11055 times.
✓ Branch 1 taken 331079 times.
 342134 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 329226 times.
✓ Branch 1 taken 1853 times.
✓ Branch 2 taken 534 times.
✓ Branch 3 taken 328692 times.
 331079 else if (*str == '"' || *str == '\'')
482 {
483 // Special case hack for ''', which is currently our official way of handling the ' character.
484 // Even though it really stinks.
485
5/6
✓ Branch 0 taken 534 times.
✓ Branch 1 taken 1853 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 504 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 2387 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 1213 char delimiter = *str;
489
490 do
491 {
492 27073 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 24722 times.
✓ Branch 1 taken 2351 times.
✓ Branch 2 taken 24716 times.
✓ Branch 3 taken 6 times.
 27073 } while (*str != delimiter && *str != '\0');
496
497 // This feels like a superfluous check, but I can't really find a clean way to avoid it.
498
2/2
✓ Branch 0 taken 1144 times.
✓ Branch 1 taken 1213 times.
 2357 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 331073 str++;
503 }
504
505 12704 return nullptr;
506 }
507
508 3921 inline string substr(const char * str, int len)
509 {
510 3921 return string(str, len);
511 }
512
513 //todo make these members
514 string &strip_prefix(string &str, char c);
515 string &strip_suffix(string &str, char c);
516
517
518 206589 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11182 times.
✓ Branch 1 taken 206589 times.
 217771 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 191588 times.
✓ Branch 1 taken 62377 times.
 253965 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 144212 times.
✓ Branch 1 taken 47376 times.
 191588 if(!is_space(str[i]))
524 {
525 144212 str[i + 1] = 0;
526 144212 return str;
527 }
528 }
529 31214 return str;
530 }
531 6867 inline void strip_whitespace(string &str)
532 {
533
2/4
✓ Branch 0 taken 3439 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 3439 times.
✗ Branch 3 not taken.
 10295 str = string(strip_whitespace(str.temp_raw()));
534 6867 }
535
536 string &itrim(string &str, const char * left, const char * right);
537
538
2/2
✓ Branch 0 taken 34129 times.
✓ Branch 1 taken 66 times.
 34283 inline string &lower(string &old)
539 {
540 88 int length = old.length();
541
2/2
✓ Branch 0 taken 960672 times.
✓ Branch 1 taken 34283 times.
 994955 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
542 34283 return old;
543 }
544
545
546 // Returns number of connected lines - 1
547 template<typename stringarraytype>
548 146079 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 70035 int count = 0;
551
552
1/2
✓ Branch 0 taken 146133 times.
✗ Branch 1 not taken.
 146133 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 146133 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 107001 times.
✓ Branch 1 taken 39132 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 106947 times.
 146133 if(linestartpos && lines[i][linestartpos - 1] == '\\')
558 {
559 54 count++;
560
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 out += string(lines[i], linestartpos - 1);
561 27 continue;
562 }
563 else
564 {
565
2/4
✓ Branch 0 taken 70035 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 70035 times.
✗ Branch 3 not taken.
 146079 out += string(lines[i], linestartpos);
566 146079 return count;
567 }
568 }
569
570 ✗ return count;
571 }
572