asar coverage - build #209

src/asar/
File: src/asar/libstr.h
Date: 2024-02-22 21:34:57
Lines:
226/238
95.0%
Functions:
53/55
96.4%
Branches:
424/598
70.9%
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 6460233 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 74757 times.
✓ Branch 1 taken 29010 times.
✓ Branch 2 taken 74667 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2571 times.
✓ Branch 7 taken 6534 times.
✓ Branch 8 taken 2625 times.
✓ Branch 9 taken 2571 times.
 784704 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 150256 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
13 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
14 4200 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
15 5862 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
16 inline bool is_alnum(unsigned char c) { return char_props[c] & 0x60; }
17 41709 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 407238 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 9504 times.
✓ Branch 1 taken 10404 times.
✓ Branch 2 taken 756 times.
✓ Branch 3 taken 261 times.
 41956 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 2070827 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 4648960 memcpy(dest, source, copy_length*sizeof(char));
24 2070827 return dest;
25 }
26
27 class string {
28 public:
29 7571989 const char *data() const
30 {
31
233/337
✓ Branch 0 taken 5276 times.
✓ Branch 1 taken 978168 times.
✓ Branch 2 taken 962714 times.
✓ Branch 3 taken 3177 times.
✓ Branch 4 taken 5357 times.
✓ Branch 5 taken 2304 times.
✓ Branch 6 taken 15654 times.
✓ Branch 7 taken 4219 times.
✓ Branch 8 taken 15907 times.
✓ Branch 9 taken 5568 times.
✓ Branch 10 taken 1665 times.
✓ Branch 11 taken 2524 times.
✓ Branch 12 taken 1152 times.
✓ Branch 13 taken 206 times.
✓ Branch 14 taken 11379 times.
✓ Branch 15 taken 496 times.
✓ Branch 16 taken 1165 times.
✓ Branch 17 taken 439 times.
✓ Branch 18 taken 426 times.
✓ Branch 19 taken 1181 times.
✓ Branch 20 taken 210 times.
✓ Branch 21 taken 5534 times.
✓ Branch 22 taken 1007 times.
✓ Branch 23 taken 216 times.
✓ Branch 24 taken 378 times.
✓ Branch 25 taken 180 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 640 times.
✓ Branch 28 taken 1795 times.
✓ Branch 29 taken 90 times.
✓ Branch 30 taken 248 times.
✓ Branch 31 taken 591 times.
✓ Branch 32 taken 225 times.
✓ Branch 33 taken 82185 times.
✓ Branch 34 taken 48 times.
✓ Branch 35 taken 972 times.
✓ Branch 36 taken 1437 times.
✓ Branch 37 taken 86208 times.
✓ Branch 38 taken 792 times.
✓ Branch 39 taken 5065 times.
✗ Branch 40 not taken.
✓ Branch 41 taken 5931 times.
✓ Branch 42 taken 3 times.
✓ Branch 43 taken 132 times.
✓ Branch 44 taken 75 times.
✓ Branch 45 taken 9 times.
✓ Branch 46 taken 33 times.
✓ Branch 47 taken 232 times.
✓ Branch 48 taken 15 times.
✓ Branch 49 taken 15 times.
✓ Branch 50 taken 1213 times.
✓ Branch 51 taken 9 times.
✓ Branch 52 taken 3 times.
✓ Branch 53 taken 66976 times.
✓ Branch 54 taken 15018 times.
✗ Branch 55 not taken.
✓ Branch 56 taken 18 times.
✓ Branch 57 taken 517 times.
✓ Branch 58 taken 15806 times.
✓ Branch 59 taken 27 times.
✓ Branch 60 taken 427 times.
✓ Branch 61 taken 9 times.
✓ Branch 62 taken 151 times.
✓ Branch 63 taken 3 times.
✓ Branch 64 taken 61665 times.
✓ Branch 65 taken 30114 times.
✓ Branch 66 taken 127 times.
✓ Branch 67 taken 72 times.
✓ Branch 68 taken 54 times.
✓ Branch 69 taken 84 times.
✓ Branch 70 taken 84498 times.
✓ Branch 71 taken 27 times.
✓ Branch 72 taken 12 times.
✓ Branch 73 taken 69204 times.
✓ Branch 74 taken 15420 times.
✓ Branch 75 taken 12 times.
✓ Branch 76 taken 180 times.
✓ Branch 77 taken 27 times.
✓ Branch 78 taken 3 times.
✓ Branch 79 taken 162 times.
✓ Branch 80 taken 36 times.
✓ Branch 81 taken 4254 times.
✓ Branch 82 taken 5 times.
✓ Branch 83 taken 225 times.
✓ Branch 84 taken 360 times.
✓ Branch 85 taken 54 times.
✓ Branch 86 taken 108 times.
✓ Branch 87 taken 69 times.
✓ Branch 88 taken 20 times.
✓ Branch 89 taken 108 times.
✓ Branch 90 taken 156 times.
✓ Branch 91 taken 20 times.
✓ Branch 92 taken 2907 times.
✓ Branch 93 taken 24 times.
✓ Branch 94 taken 95 times.
✓ Branch 95 taken 2898 times.
✓ Branch 96 taken 24 times.
✓ Branch 97 taken 107 times.
✓ Branch 98 taken 2889 times.
✓ Branch 99 taken 36 times.
✓ Branch 100 taken 36 times.
✓ Branch 101 taken 10837 times.
✓ Branch 102 taken 10145 times.
✓ Branch 103 taken 10828 times.
✓ Branch 104 taken 12 times.
✓ Branch 105 taken 610 times.
✓ Branch 106 taken 15586 times.
✓ Branch 107 taken 9 times.
✓ Branch 108 taken 610 times.
✓ Branch 109 taken 12 times.
✓ Branch 110 taken 345 times.
✗ Branch 111 not taken.
✓ Branch 112 taken 2005 times.
✓ Branch 113 taken 264 times.
✓ Branch 114 taken 15459 times.
✓ Branch 115 taken 3 times.
✓ Branch 116 taken 9 times.
✗ Branch 117 not taken.
✓ Branch 118 taken 9 times.
✓ Branch 119 taken 3 times.
✗ Branch 120 not taken.
✓ Branch 121 taken 9 times.
✗ Branch 122 not taken.
✓ Branch 123 taken 12 times.
✗ Branch 124 not taken.
✓ Branch 125 taken 9 times.
✗ Branch 126 not taken.
✓ Branch 127 taken 3 times.
✓ Branch 128 taken 9 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 9 times.
✗ Branch 131 not taken.
✓ Branch 132 taken 3 times.
✗ Branch 133 not taken.
✓ Branch 134 taken 9 times.
✗ Branch 135 not taken.
✓ Branch 136 taken 9 times.
✓ Branch 137 taken 3 times.
✗ Branch 138 not taken.
✓ Branch 139 taken 9 times.
✗ Branch 140 not taken.
✓ Branch 141 taken 12 times.
✗ Branch 142 not taken.
✓ Branch 143 taken 9 times.
✗ Branch 144 not taken.
✓ Branch 145 taken 3 times.
✓ Branch 146 taken 9 times.
✗ Branch 147 not taken.
✓ Branch 148 taken 9 times.
✓ Branch 149 taken 24 times.
✗ Branch 150 not taken.
✓ Branch 151 taken 9 times.
✓ Branch 152 taken 24 times.
✗ Branch 153 not taken.
✓ Branch 154 taken 114 times.
✗ Branch 155 not taken.
✓ Branch 156 taken 213 times.
✗ Branch 157 not taken.
✓ Branch 158 taken 33 times.
✗ Branch 159 not taken.
✓ Branch 160 taken 36 times.
✗ Branch 161 not taken.
✓ Branch 162 taken 180 times.
✓ Branch 163 taken 24 times.
✗ Branch 164 not taken.
✓ Branch 165 taken 72 times.
✓ Branch 166 taken 72 times.
✗ Branch 167 not taken.
✓ Branch 168 taken 180 times.
✓ Branch 169 taken 78 times.
✗ Branch 170 not taken.
✓ Branch 171 taken 264 times.
✓ Branch 172 taken 3 times.
✓ Branch 173 taken 72 times.
✗ Branch 174 not taken.
✓ Branch 175 taken 90 times.
✗ Branch 176 not taken.
✓ Branch 177 taken 99 times.
✗ Branch 178 not taken.
✓ Branch 179 taken 102 times.
✓ Branch 180 taken 3 times.
✓ Branch 181 taken 81 times.
✗ Branch 182 not taken.
✓ Branch 183 taken 1170 times.
✓ Branch 184 taken 35721 times.
✓ Branch 185 taken 6057 times.
✓ Branch 186 taken 30960 times.
✓ Branch 187 taken 27 times.
✓ Branch 188 taken 6033 times.
✓ Branch 189 taken 24 times.
✓ Branch 190 taken 27 times.
✓ Branch 191 taken 24 times.
✗ Branch 192 not taken.
✓ Branch 193 taken 9 times.
✗ Branch 194 not taken.
✓ Branch 195 taken 9 times.
✗ Branch 196 not taken.
✓ Branch 197 taken 18 times.
✗ Branch 198 not taken.
✓ Branch 199 taken 27 times.
✗ Branch 200 not taken.
✓ Branch 201 taken 27 times.
✗ Branch 202 not taken.
✓ Branch 203 taken 18 times.
✗ Branch 204 not taken.
✓ Branch 205 taken 27 times.
✗ Branch 206 not taken.
✓ Branch 207 taken 27 times.
✗ Branch 208 not taken.
✓ Branch 209 taken 9 times.
✗ Branch 210 not taken.
✓ Branch 211 taken 9 times.
✗ Branch 212 not taken.
✓ Branch 213 taken 9 times.
✗ Branch 214 not taken.
✓ Branch 215 taken 18 times.
✗ Branch 216 not taken.
✓ Branch 217 taken 27 times.
✗ Branch 218 not taken.
✓ Branch 219 taken 27 times.
✗ Branch 220 not taken.
✓ Branch 221 taken 9 times.
✗ Branch 222 not taken.
✓ Branch 223 taken 18 times.
✗ Branch 224 not taken.
✓ Branch 225 taken 27 times.
✗ Branch 226 not taken.
✓ Branch 227 taken 27 times.
✗ Branch 228 not taken.
✓ Branch 229 taken 9 times.
✗ Branch 230 not taken.
✓ Branch 231 taken 9 times.
✗ Branch 232 not taken.
✓ Branch 233 taken 18 times.
✗ Branch 234 not taken.
✓ Branch 235 taken 27 times.
✗ Branch 236 not taken.
✓ Branch 237 taken 27 times.
✗ Branch 238 not taken.
✓ Branch 239 taken 9 times.
✗ Branch 240 not taken.
✓ Branch 241 taken 9 times.
✗ Branch 242 not taken.
✓ Branch 243 taken 18 times.
✗ Branch 244 not taken.
✓ Branch 245 taken 27 times.
✗ Branch 246 not taken.
✓ Branch 247 taken 27 times.
✗ Branch 248 not taken.
✓ Branch 249 taken 27 times.
✗ Branch 250 not taken.
✓ Branch 251 taken 27 times.
✗ Branch 252 not taken.
✓ Branch 253 taken 9 times.
✗ Branch 254 not taken.
✓ Branch 255 taken 9 times.
✗ Branch 256 not taken.
✓ Branch 257 taken 9 times.
✗ Branch 258 not taken.
✓ Branch 259 taken 18 times.
✗ Branch 260 not taken.
✓ Branch 261 taken 27 times.
✗ Branch 262 not taken.
✓ Branch 263 taken 27 times.
✗ Branch 264 not taken.
✓ Branch 265 taken 9 times.
✗ Branch 266 not taken.
✓ Branch 267 taken 18 times.
✗ Branch 268 not taken.
✓ Branch 269 taken 27 times.
✗ Branch 270 not taken.
✓ Branch 271 taken 27 times.
✗ Branch 272 not taken.
✓ Branch 273 taken 54 times.
✗ Branch 274 not taken.
✓ Branch 275 taken 54 times.
✗ Branch 276 not taken.
✓ Branch 277 taken 54 times.
✗ Branch 278 not taken.
✓ Branch 279 taken 108 times.
✗ Branch 280 not taken.
✓ Branch 281 taken 162 times.
✗ Branch 282 not taken.
✓ Branch 283 taken 162 times.
✗ Branch 284 not taken.
✓ Branch 285 taken 54 times.
✗ Branch 286 not taken.
✓ Branch 287 taken 108 times.
✗ Branch 288 not taken.
✓ Branch 289 taken 162 times.
✗ Branch 290 not taken.
✓ Branch 291 taken 162 times.
✗ Branch 292 not taken.
✓ Branch 293 taken 54 times.
✗ Branch 294 not taken.
✓ Branch 295 taken 54 times.
✗ Branch 296 not taken.
✓ Branch 297 taken 54 times.
✗ Branch 298 not taken.
✓ Branch 299 taken 54 times.
✗ Branch 300 not taken.
✓ Branch 301 taken 9 times.
✗ Branch 302 not taken.
✓ Branch 303 taken 9 times.
✗ Branch 304 not taken.
✓ Branch 305 taken 9 times.
✗ Branch 306 not taken.
✓ Branch 307 taken 9 times.
✗ Branch 308 not taken.
✓ Branch 309 taken 9 times.
✗ Branch 310 not taken.
✓ Branch 311 taken 9 times.
✗ Branch 312 not taken.
✓ Branch 313 taken 9 times.
✗ Branch 314 not taken.
✓ Branch 315 taken 9 times.
✗ Branch 316 not taken.
✓ Branch 317 taken 9 times.
✗ Branch 318 not taken.
✓ Branch 319 taken 9 times.
✗ Branch 320 not taken.
✓ Branch 321 taken 9 times.
✗ Branch 322 not taken.
✓ Branch 323 taken 9 times.
✗ Branch 324 not taken.
✓ Branch 325 taken 9 times.
✗ Branch 326 not taken.
✓ Branch 327 taken 9 times.
✗ Branch 328 not taken.
✓ Branch 329 taken 9 times.
✗ Branch 330 not taken.
✓ Branch 331 taken 9 times.
✗ Branch 332 not taken.
✓ Branch 333 taken 9 times.
✗ Branch 334 not taken.
✓ Branch 335 taken 9 times.
✗ Branch 336 not taken.
 10633981 return cached_data;
32 }
33
34 193138 char *temp_raw() const //things to cleanup and take a look at
35 {
36
3/6
✓ Branch 0 taken 166368 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7176 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 60 times.
✗ Branch 5 not taken.
 406424 return cached_data;
37 }
38
39 3460175 char *raw() const
40 {
41
2/3
✓ Branch 0 taken 2091 times.
✓ Branch 1 taken 80982 times.
✗ Branch 2 not taken.
 7586968 return cached_data;
42 }
43
44 7307559 int length() const
45 {
46
2/2
✓ Branch 0 taken 7134955 times.
✓ Branch 1 taken 172604 times.
 16152765 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 7050603 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 41727 times.
✓ Branch 1 taken 7008876 times.
 7050603 if(length > max_inline_length_){
52 41727 inlined.len = (unsigned char)-1;
53 41727 allocated.len = length;
54 }else{
55 7008876 inlined.len = length;
56 }
57 7050603 }
58
59 1188 void truncate(int newlen)
60 {
61 2376 resize(newlen);
62 2376 }
63
64 2060988 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 12379 times.
✓ Branch 1 taken 2048609 times.
 2060988 if (!newstr) newstr = "";
67 2060988 assign(newstr, strlen(newstr));
68 2060988 }
69
70 1376560 void assign(const string &newstr)
71 {
72 1376560 assign(newstr, newstr.length());
73 1376560 }
74
75 3702244 void assign(const char * newstr, int end)
76 {
77 3702244 resize(end);
78 3702244 copy(newstr, length(), cached_data);
79 3702244 }
80
81
82 375592 string& operator=(const char * newstr)
83 {
84 824954 assign(newstr);
85 385298 return *this;
86 }
87
88 443625 string& operator=(const string &newstr)
89 {
90 569854 assign(newstr);
91 475899 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 9516 string& append(const char *other, int start, int end)
103 {
104 4764 int current_end = length();
105 9516 resize(length() + end - start);
106 9516 copy(other + start, end - start, cached_data + current_end);
107 9516 return *this;
108 }
109
110 224745 string& operator+=(const string& other)
111 {
112 89573 int current_end = length();
113 224745 resize(length() + other.length());
114 359917 copy(other.cached_data, other.length(), cached_data + current_end);
115 224745 return *this;
116 }
117
118 688575 string& operator+=(const char *other)
119 {
120 307759 int current_end = length();
121 688575 int otherlen=(int)strlen(other);
122 688575 resize(length() + otherlen);
123 688575 copy(other, otherlen, cached_data + current_end);
124 688575 return *this;
125 }
126
127 2422915 string& operator+=(char c)
128 {
129 2422915 resize(length() + 1);
130 3791341 cached_data[length() - 1] = c;
131 2422915 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 61062 string operator+(const char * right) const
142 {
143 61062 string ret=*this;
144
1/2
✓ Branch 0 taken 61062 times.
✗ Branch 1 not taken.
 150231 ret+=right;
145 66645 return ret;
146 ✗ }
147
148 26382 bool operator==(const char * right) const
149 {
150 26382 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 28965 bool operator!=(const char * right) const
159 {
160 28965 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 4130941 operator const char*() const
169 {
170 4130941 return data();
171 }
172
173 31699 explicit operator bool() const
174 {
175 31699 return length();
176 }
177
178 4573788 string()
179 4573788 {
180 //todo reduce I know this isn't all needed
181 4573788 allocated.bufferlen = 0;
182 4573788 allocated.str = 0;
183 4573788 allocated.len = 0;
184 4573788 inlined.len = 0;
185 4573788 cached_data = inlined.str;
186 4573788 next_resize = max_inline_length_+1;
187
188 3586184 }
189 1027048 string(const char * newstr) : string()
190 {
191
1/2
✓ Branch 0 taken 478622 times.
✗ Branch 1 not taken.
 1027048 assign(newstr);
192 929661 }
193 232237 string(const char * newstr, int newlen) : string()
194 {
195
1/2
✓ Branch 0 taken 108331 times.
✗ Branch 1 not taken.
 232237 assign(newstr, newlen);
196 232210 }
197 208986 string(const string& old) : string()
198 {
199
1/2
✓ Branch 0 taken 90491 times.
✗ Branch 1 not taken.
 208986 assign(old.data());
200 203958 }
201
202 26496 string(string &&move) : string()
203 {
204
1/2
✓ Branch 0 taken 10605 times.
✗ Branch 1 not taken.
 10605 *this = move;
205 26496 }
206
207 394123 string& operator=(string&& move)
208 {
209
2/2
✓ Branch 0 taken 89 times.
✓ Branch 1 taken 143572 times.
 143750 if(!is_inlined()) free(allocated.str);
210
2/2
✓ Branch 0 taken 111 times.
✓ Branch 1 taken 143550 times.
 394123 if(!move.is_inlined()){
211 232 allocated.str = move.allocated.str;
212 232 allocated.bufferlen = move.allocated.bufferlen;
213 232 set_length(move.allocated.len);
214
215 232 move.inlined.len = 0;
216 232 move.inlined.str[0] = 0;
217 232 cached_data = allocated.str;
218 232 next_resize = move.next_resize;
219
220 }else{
221 393891 inlined.len = 0;
222 393891 cached_data = inlined.str;
223 393891 next_resize = max_inline_length_+1;
224 393891 assign(move);
225 }
226 394123 return *this;
227 }
228
229 11197447 ~string()
230 {
231
2/2
✓ Branch 0 taken 10155 times.
✓ Branch 1 taken 2001344 times.
 6604473 if(!is_inlined()){
232 32725 free(allocated.str);
233 }
234 11197447 }
235
236 //maybe these should return refs to chain. but also good not to encourage chaining
237 5228 void strip_prefix(char c)
238 {
239
2/2
✓ Branch 0 taken 1492 times.
✓ Branch 1 taken 3736 times.
 5228 if(cached_data[0] == c){
240
3/6
✓ Branch 0 taken 748 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 748 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 748 times.
✗ Branch 5 not taken.
 1492 *this = string(cached_data + 1, length() - 1);
241 }
242 5228 }
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 7050371 void resize(int new_length)
299 {
300 3114234 const char *old_data = data();
301
8/8
✓ Branch 0 taken 7026768 times.
✓ Branch 1 taken 23603 times.
✓ Branch 2 taken 9293 times.
✓ Branch 3 taken 3103057 times.
✓ Branch 4 taken 1013 times.
✓ Branch 5 taken 8164 times.
✓ Branch 6 taken 12741 times.
✓ Branch 7 taken 3101493 times.
 7060215 if(new_length >= next_resize || (!is_inlined() && new_length <= max_inline_length_)) {
302
7/8
✓ Branch 0 taken 23603 times.
✓ Branch 1 taken 1129 times.
✓ Branch 2 taken 471 times.
✓ Branch 3 taken 11638 times.
✓ Branch 4 taken 471 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 11728 times.
✓ Branch 7 taken 1013 times.
 25113 if(new_length > max_inline_length_ && (is_inlined() || allocated.bufferlen <= new_length)){ //SSO or big to big
303 23603 int new_size = bitround(new_length + 1);
304
2/2
✓ Branch 0 taken 22751 times.
✓ Branch 1 taken 852 times.
 23603 if(old_data == inlined.str){
305
1/2
✓ Branch 0 taken 11494 times.
✗ Branch 1 not taken.
 34245 allocated.str = copy(old_data, min(length(), new_length), (char *)malloc(new_size));
306 }else{
307 852 allocated.str = (char *)realloc(allocated.str, new_size);
308 471 old_data = inlined.str; //this will prevent freeing a dead realloc ptr
309 }
310 23603 allocated.bufferlen = new_size;
311 23603 cached_data = allocated.str;
312 23603 next_resize = allocated.bufferlen;
313
5/6
✓ Branch 0 taken 1013 times.
✓ Branch 1 taken 116 times.
✓ Branch 2 taken 1013 times.
✓ Branch 3 taken 116 times.
✓ Branch 4 taken 1013 times.
✗ Branch 5 not taken.
 1129 }else if(length() > max_inline_length_ && new_length <= max_inline_length_){ //big to SSO
314 1129 copy(old_data, new_length, inlined.str);
315 1129 cached_data = inlined.str;
316 1129 next_resize = max_inline_length_+1;
317 }
318
5/6
✓ Branch 0 taken 1129 times.
✓ Branch 1 taken 23603 times.
✓ Branch 2 taken 1129 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 1013 times.
✓ Branch 5 taken 11728 times.
 24732 if(old_data != inlined.str && old_data != data()){
319 1129 free((char *)old_data);
320 }
321 }
322 7050371 set_length(new_length);
323
324 7050371 raw()[new_length] = 0; //always ensure null terminator
325 7050371 }
326
327 12720614 bool is_inlined() const
328 {
329
52/82
✓ Branch 0 taken 1156679 times.
✓ Branch 1 taken 2698879 times.
✓ Branch 2 taken 997838 times.
✓ Branch 3 taken 1236228 times.
✓ Branch 4 taken 15594 times.
✓ Branch 5 taken 2276 times.
✓ Branch 6 taken 381 times.
✓ Branch 7 taken 9 times.
✓ Branch 8 taken 42761 times.
✓ Branch 9 taken 1624145 times.
✓ Branch 10 taken 35509 times.
✓ Branch 11 taken 874635 times.
✓ Branch 12 taken 150047 times.
✓ Branch 13 taken 178724 times.
✓ Branch 14 taken 1121339 times.
✓ Branch 15 taken 70978 times.
✓ Branch 16 taken 2537455 times.
✓ Branch 17 taken 39017 times.
✓ Branch 18 taken 623151 times.
✓ Branch 19 taken 790 times.
✓ Branch 20 taken 236805 times.
✓ Branch 21 taken 852 times.
✓ Branch 22 taken 229511 times.
✓ Branch 23 taken 925 times.
✓ Branch 24 taken 845264 times.
✓ Branch 25 taken 4815 times.
✓ Branch 26 taken 314956 times.
✓ Branch 27 taken 5541 times.
✓ Branch 28 taken 98303 times.
✓ Branch 29 taken 5413 times.
✓ Branch 30 taken 97139 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 2295 times.
✗ Branch 41 not taken.
✓ Branch 42 taken 3546 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 3663 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 4446 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 227598 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 35121 times.
✗ Branch 77 not taken.
✗ Branch 78 not taken.
✗ Branch 79 not taken.
✗ Branch 80 not taken.
✗ Branch 81 not taken.
 28003250 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 734 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 734 sprintf(buffer, "%.*X", width, value);
361
1/2
✓ Branch 0 taken 371 times.
✗ Branch 1 not taken.
 1105 return buffer;
362 }
363
364 20893 inline string dec(int value)
365 {
366 char buffer[64];
367 20893 sprintf(buffer, "%i", value);
368
1/2
✓ Branch 0 taken 8730 times.
✗ Branch 1 not taken.
 29623 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 269171 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 928789 times.
✓ Branch 1 taken 26242 times.
 955031 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 576068 times.
✓ Branch 1 taken 352721 times.
 928789 if (to_lower(str[i])!=to_lower(key[i])) return false;
420 }
421 5635 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 2420456 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 3186026 times.
✓ Branch 1 taken 117575 times.
 3303601 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 1518333 times.
✓ Branch 1 taken 1667693 times.
 3186026 if(to_lower(*word1++) != *word2++) return true;
453 }
454 117575 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 29670 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 17505 times.
✓ Branch 1 taken 12165 times.
 29670 if (*str!='"') return str;
465 27402 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 27402 times.
✗ Branch 1 not taken.
 27402 if (end)
467 {
468 27402 *end = 0;
469 27402 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 27402 times.
 27834 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 11049 return str + 1;
472 }
473 ✗ return nullptr;
474 }
475
476 36724 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 344529 times.
✓ Branch 1 taken 25573 times.
 370102 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 11145 times.
✓ Branch 1 taken 333384 times.
 344529 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 331530 times.
✓ Branch 1 taken 1854 times.
✓ Branch 2 taken 534 times.
✓ Branch 3 taken 330996 times.
 333384 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 1854 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 504 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
 2388 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 1214 char delimiter = *str;
489
490 do
491 {
492 27084 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 24732 times.
✓ Branch 1 taken 2352 times.
✓ Branch 2 taken 24726 times.
✓ Branch 3 taken 6 times.
 27084 } 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 1214 times.
 2358 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 333378 str++;
503 }
504
505 12834 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 208830 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11210 times.
✓ Branch 1 taken 208830 times.
 220040 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 193270 times.
✓ Branch 1 taken 62974 times.
 256244 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 145856 times.
✓ Branch 1 taken 47414 times.
 193270 if(!is_space(str[i]))
524 {
525 145856 str[i + 1] = 0;
526 145856 return str;
527 }
528 }
529 31527 return str;
530 }
531 6984 inline void strip_whitespace(string &str)
532 {
533
2/4
✓ Branch 0 taken 3506 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 3506 times.
✗ Branch 3 not taken.
 10462 str = string(strip_whitespace(str.temp_raw()));
534 6984 }
535
536 string &itrim(string &str, const char * left, const char * right);
537
538
2/2
✓ Branch 0 taken 34185 times.
✓ Branch 1 taken 66 times.
 34343 inline string &lower(string &old)
539 {
540 92 int length = old.length();
541
2/2
✓ Branch 0 taken 963116 times.
✓ Branch 1 taken 34343 times.
 997459 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
542 34343 return old;
543 }
544
545
546 // Returns number of connected lines - 1
547 template<typename stringarraytype>
548 147870 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 71421 int count = 0;
551
552
1/2
✓ Branch 0 taken 147924 times.
✗ Branch 1 not taken.
 147924 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 147924 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 108366 times.
✓ Branch 1 taken 39558 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 108312 times.
 147924 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 71421 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 71421 times.
✗ Branch 3 not taken.
 147870 out += string(lines[i], linestartpos);
566 147870 return count;
567 }
568 }
569
570 ✗ return count;
571 }
572