asar coverage - build #229

src/asar/
File: src/asar/libstr.h
Date: 2024-03-19 04:31:23
Lines:
226/238
95.0%
Functions:
53/55
96.4%
Branches:
421/599
70.3%
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 6462357 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 74793 times.
✓ Branch 1 taken 29028 times.
✓ Branch 2 taken 74703 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2580 times.
✓ Branch 7 taken 6525 times.
✓ Branch 8 taken 2643 times.
✓ Branch 9 taken 2580 times.
 785304 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
12 150316 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 41733 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
18 408180 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
19
4/4
✓ Branch 0 taken 9504 times.
✓ Branch 1 taken 10407 times.
✓ Branch 2 taken 756 times.
✓ Branch 3 taken 261 times.
 41962 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
20
21 2072195 inline char *copy(const char *source, int copy_length, char *dest)
22 {
23 4651696 memcpy(dest, source, copy_length*sizeof(char));
24 2072195 return dest;
25 }
26
27 class string {
28 public:
29 7627230 const char *data() const
30 {
31
230/338
✓ 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 82248 times.
✓ Branch 34 taken 48 times.
✓ Branch 35 taken 972 times.
✓ Branch 36 taken 82677 times.
✓ Branch 37 taken 252 times.
✓ Branch 38 taken 18 times.
✓ Branch 39 taken 5893 times.
✓ Branch 40 taken 86037 times.
✓ Branch 41 taken 6498 times.
✗ Branch 42 not taken.
✓ Branch 43 taken 132 times.
✓ Branch 44 taken 234 times.
✓ Branch 45 taken 12 times.
✓ Branch 46 taken 33 times.
✓ Branch 47 taken 235 times.
✓ Branch 48 taken 15 times.
✓ Branch 49 taken 15 times.
✓ Branch 50 taken 118 times.
✓ Branch 51 taken 9 times.
✓ Branch 52 taken 3 times.
✓ Branch 53 taken 1291 times.
✓ Branch 54 taken 9 times.
✗ Branch 55 not taken.
✓ Branch 56 taken 66924 times.
✓ Branch 57 taken 15090 times.
✗ Branch 58 not taken.
✓ Branch 59 taken 27 times.
✓ Branch 60 taken 439 times.
✓ Branch 61 taken 15815 times.
✓ Branch 62 taken 151 times.
✓ Branch 63 taken 427 times.
✓ Branch 64 taken 228 times.
✓ Branch 65 taken 15102 times.
✓ Branch 66 taken 61645 times.
✓ Branch 67 taken 15066 times.
✓ Branch 68 taken 54 times.
✓ Branch 69 taken 21 times.
✓ Branch 70 taken 45 times.
✓ Branch 71 taken 108 times.
✓ Branch 72 taken 84546 times.
✓ Branch 73 taken 72 times.
✓ Branch 74 taken 18 times.
✓ Branch 75 taken 69225 times.
✓ Branch 76 taken 15420 times.
✓ Branch 77 taken 27 times.
✓ Branch 78 taken 165 times.
✗ Branch 79 not taken.
✓ Branch 80 taken 27 times.
✓ Branch 81 taken 522 times.
✓ Branch 82 taken 14 times.
✓ Branch 83 taken 3966 times.
✓ Branch 84 taken 360 times.
✓ Branch 85 taken 207 times.
✓ Branch 86 taken 27 times.
✓ Branch 87 taken 69 times.
✓ Branch 88 taken 101 times.
✓ Branch 89 taken 27 times.
✓ Branch 90 taken 159 times.
✓ Branch 91 taken 101 times.
✓ Branch 92 taken 18 times.
✓ Branch 93 taken 24 times.
✓ Branch 94 taken 2984 times.
✓ Branch 95 taken 9 times.
✓ Branch 96 taken 24 times.
✓ Branch 97 taken 2996 times.
✓ Branch 98 taken 9 times.
✓ Branch 99 taken 36 times.
✓ Branch 100 taken 2916 times.
✓ Branch 101 taken 9 times.
✓ Branch 102 taken 10145 times.
✓ Branch 103 taken 10828 times.
✓ Branch 104 taken 12 times.
✓ Branch 105 taken 11444 times.
✗ Branch 106 not taken.
✓ Branch 107 taken 9 times.
✓ Branch 108 taken 16202 times.
✗ Branch 109 not taken.
✓ Branch 110 taken 12 times.
✓ Branch 111 taken 12 times.
✓ Branch 112 taken 333 times.
✓ Branch 113 taken 2017 times.
✓ Branch 114 taken 264 times.
✗ Branch 115 not taken.
✓ Branch 116 taken 3 times.
✓ Branch 117 taken 15468 times.
✗ Branch 118 not taken.
✓ Branch 119 taken 9 times.
✓ Branch 120 taken 3 times.
✗ Branch 121 not taken.
✓ Branch 122 taken 9 times.
✗ Branch 123 not taken.
✓ Branch 124 taken 12 times.
✗ Branch 125 not taken.
✓ Branch 126 taken 9 times.
✗ Branch 127 not taken.
✓ Branch 128 taken 3 times.
✓ Branch 129 taken 9 times.
✗ Branch 130 not taken.
✓ Branch 131 taken 9 times.
✗ Branch 132 not taken.
✓ Branch 133 taken 3 times.
✗ Branch 134 not taken.
✓ Branch 135 taken 9 times.
✗ Branch 136 not taken.
✓ Branch 137 taken 9 times.
✓ Branch 138 taken 3 times.
✗ Branch 139 not taken.
✓ Branch 140 taken 9 times.
✗ Branch 141 not taken.
✓ Branch 142 taken 12 times.
✗ Branch 143 not taken.
✓ Branch 144 taken 9 times.
✗ Branch 145 not taken.
✓ Branch 146 taken 3 times.
✓ Branch 147 taken 9 times.
✗ Branch 148 not taken.
✓ Branch 149 taken 9 times.
✓ Branch 150 taken 24 times.
✗ Branch 151 not taken.
✓ Branch 152 taken 9 times.
✓ Branch 153 taken 24 times.
✗ Branch 154 not taken.
✓ Branch 155 taken 114 times.
✗ Branch 156 not taken.
✓ Branch 157 taken 213 times.
✗ Branch 158 not taken.
✓ Branch 159 taken 33 times.
✗ Branch 160 not taken.
✓ Branch 161 taken 36 times.
✗ Branch 162 not taken.
✓ Branch 163 taken 180 times.
✓ Branch 164 taken 24 times.
✗ Branch 165 not taken.
✓ Branch 166 taken 72 times.
✓ Branch 167 taken 72 times.
✗ Branch 168 not taken.
✓ Branch 169 taken 180 times.
✓ Branch 170 taken 78 times.
✗ Branch 171 not taken.
✓ Branch 172 taken 264 times.
✓ Branch 173 taken 3 times.
✓ Branch 174 taken 72 times.
✗ Branch 175 not taken.
✓ Branch 176 taken 90 times.
✗ Branch 177 not taken.
✓ Branch 178 taken 99 times.
✗ Branch 179 not taken.
✓ Branch 180 taken 102 times.
✓ Branch 181 taken 3 times.
✓ Branch 182 taken 81 times.
✗ Branch 183 not taken.
✓ Branch 184 taken 1170 times.
✓ Branch 185 taken 35730 times.
✓ Branch 186 taken 6057 times.
✓ Branch 187 taken 30969 times.
✓ Branch 188 taken 27 times.
✓ Branch 189 taken 6033 times.
✓ Branch 190 taken 24 times.
✓ Branch 191 taken 27 times.
✓ Branch 192 taken 24 times.
✗ Branch 193 not taken.
✓ Branch 194 taken 9 times.
✗ Branch 195 not taken.
✓ Branch 196 taken 9 times.
✗ Branch 197 not taken.
✓ Branch 198 taken 18 times.
✗ Branch 199 not taken.
✓ Branch 200 taken 27 times.
✗ Branch 201 not taken.
✓ Branch 202 taken 27 times.
✗ Branch 203 not taken.
✓ Branch 204 taken 18 times.
✗ Branch 205 not taken.
✓ Branch 206 taken 27 times.
✗ Branch 207 not taken.
✓ Branch 208 taken 27 times.
✗ Branch 209 not taken.
✓ Branch 210 taken 9 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 9 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 9 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 18 times.
✗ Branch 217 not taken.
✓ Branch 218 taken 27 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 27 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 9 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 18 times.
✗ Branch 225 not taken.
✓ Branch 226 taken 27 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 27 times.
✗ Branch 229 not taken.
✓ Branch 230 taken 9 times.
✗ Branch 231 not taken.
✓ Branch 232 taken 9 times.
✗ Branch 233 not taken.
✓ Branch 234 taken 18 times.
✗ Branch 235 not taken.
✓ Branch 236 taken 27 times.
✗ Branch 237 not taken.
✓ Branch 238 taken 27 times.
✗ Branch 239 not taken.
✓ Branch 240 taken 9 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 27 times.
✗ Branch 251 not taken.
✓ Branch 252 taken 27 times.
✗ Branch 253 not taken.
✓ Branch 254 taken 9 times.
✗ Branch 255 not taken.
✓ Branch 256 taken 9 times.
✗ Branch 257 not taken.
✓ Branch 258 taken 9 times.
✗ Branch 259 not taken.
✓ Branch 260 taken 18 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 27 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 27 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 9 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 18 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 54 times.
✗ Branch 275 not taken.
✓ Branch 276 taken 54 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 54 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 108 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 162 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 162 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 54 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 108 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 162 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 162 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 54 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 9 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 9 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 9 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 9 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 9 times.
✗ Branch 311 not taken.
✓ Branch 312 taken 9 times.
✗ Branch 313 not taken.
✓ Branch 314 taken 9 times.
✗ Branch 315 not taken.
✓ Branch 316 taken 9 times.
✗ Branch 317 not taken.
✓ Branch 318 taken 9 times.
✗ Branch 319 not taken.
✓ Branch 320 taken 9 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.
 10689785 return cached_data;
32 }
33
34 193300 char *temp_raw() const //things to cleanup and take a look at
35 {
36
3/6
✓ Branch 0 taken 166530 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7176 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 60 times.
✗ Branch 5 not taken.
 406748 return cached_data;
37 }
38
39 3461897 char *raw() const
40 {
41
2/3
✓ Branch 0 taken 2100 times.
✓ Branch 1 taken 81036 times.
✗ Branch 2 not taken.
 7590358 return cached_data;
42 }
43
44 7362332 int length() const
45 {
46
2/2
✓ Branch 0 taken 7189618 times.
✓ Branch 1 taken 172714 times.
 16209961 return is_inlined() ? inlined.len : allocated.len;
47 }
48
49 7053687 void set_length(int length)
50 {
51
2/2
✓ Branch 0 taken 41729 times.
✓ Branch 1 taken 7011958 times.
 7053687 if(length > max_inline_length_){
52 41729 inlined.len = (unsigned char)-1;
53 41729 allocated.len = length;
54 }else{
55 7011958 inlined.len = length;
56 }
57 7053687 }
58
59 1188 void truncate(int newlen)
60 {
61 2376 resize(newlen);
62 2376 }
63
64 2062344 void assign(const char * newstr)
65 {
66
2/2
✓ Branch 0 taken 12379 times.
✓ Branch 1 taken 2049965 times.
 2062344 if (!newstr) newstr = "";
67 2062344 assign(newstr, strlen(newstr));
68 2062344 }
69
70 1377250 void assign(const string &newstr)
71 {
72 1377250 assign(newstr, newstr.length());
73 1377250 }
74
75 3704452 void assign(const char * newstr, int end)
76 {
77 3704452 resize(end);
78 3704452 copy(newstr, length(), cached_data);
79 3704452 }
80
81
82 375904 string& operator=(const char * newstr)
83 {
84 825578 assign(newstr);
85 385628 return *this;
86 }
87
88 443970 string& operator=(const string &newstr)
89 {
90 570220 assign(newstr);
91 476262 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 9552 string& append(const char *other, int start, int end)
103 {
104 4782 int current_end = length();
105 9552 resize(length() + end - start);
106 9552 copy(other + start, end - start, cached_data + current_end);
107 9552 return *this;
108 }
109
110 224909 string& operator+=(const string& other)
111 {
112 89655 int current_end = length();
113 224909 resize(length() + other.length());
114 360163 copy(other.cached_data, other.length(), cached_data + current_end);
115 224909 return *this;
116 }
117
118 688903 string& operator+=(const char *other)
119 {
120 307923 int current_end = length();
121 688903 int otherlen=(int)strlen(other);
122 688903 resize(length() + otherlen);
123 688903 copy(other, otherlen, cached_data + current_end);
124 688903 return *this;
125 }
126
127 2423263 string& operator+=(char c)
128 {
129 2423263 resize(length() + 1);
130 3791863 cached_data[length() - 1] = c;
131 2423263 return *this;
132 }
133
134 string operator+(char right) const
135 {
136 string ret=*this;
137 ret+=right;
138 return ret;
139 }
140
141 61076 string operator+(const char * right) const
142 {
143 61076 string ret=*this;
144
1/2
✓ Branch 0 taken 61076 times.
✗ Branch 1 not taken.
 150259 ret+=right;
145 66659 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 4184446 operator const char*() const
169 {
170 4184446 return data();
171 }
172
173 31741 explicit operator bool() const
174 {
175 31741 return length();
176 }
177
178 4575824 string()
179 4575824 {
180 //todo reduce I know this isn't all needed
181 4575824 allocated.bufferlen = 0;
182 4575824 allocated.str = 0;
183 4575824 allocated.len = 0;
184 4575824 inlined.len = 0;
185 4575824 cached_data = inlined.str;
186 4575824 next_resize = max_inline_length_+1;
187
188 3587752 }
189 1027734 string(const char * newstr) : string()
190 {
191
1/2
✓ Branch 0 taken 478965 times.
✗ Branch 1 not taken.
 1027734 assign(newstr);
192 930266 }
193 232399 string(const char * newstr, int newlen) : string()
194 {
195
1/2
✓ Branch 0 taken 108412 times.
✗ Branch 1 not taken.
 232399 assign(newstr, newlen);
196 232372 }
197 209032 string(const string& old) : string()
198 {
199
1/2
✓ Branch 0 taken 90514 times.
✗ Branch 1 not taken.
 209032 assign(old.data());
200 204004 }
201
202 26502 string(string &&move) : string()
203 {
204
1/2
✓ Branch 0 taken 10608 times.
✗ Branch 1 not taken.
 10608 *this = move;
205 26502 }
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 11202590 ~string()
230 {
231
2/2
✓ Branch 0 taken 10155 times.
✓ Branch 1 taken 2002343 times.
 6607544 if(!is_inlined()){
232 32725 free(allocated.str);
233 }
234 11202590 }
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 7053455 void resize(int new_length)
299 {
300 3115776 const char *old_data = data();
301
8/8
✓ Branch 0 taken 7029852 times.
✓ Branch 1 taken 23603 times.
✓ Branch 2 taken 9294 times.
✓ Branch 3 taken 3104599 times.
✓ Branch 4 taken 1013 times.
✓ Branch 5 taken 8165 times.
✓ Branch 6 taken 12741 times.
✓ Branch 7 taken 3103035 times.
 7063300 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 7053455 set_length(new_length);
323
324 7053455 raw()[new_length] = 0; //always ensure null terminator
325 7053455 }
326
327 12777928 bool is_inlined() const
328 {
329
52/82
✓ Branch 0 taken 1156794 times.
✓ Branch 1 taken 2699911 times.
✓ Branch 2 taken 997838 times.
✓ Branch 3 taken 1236737 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 1624840 times.
✓ Branch 10 taken 35509 times.
✓ Branch 11 taken 874976 times.
✓ Branch 12 taken 150047 times.
✓ Branch 13 taken 178724 times.
✓ Branch 14 taken 1121360 times.
✓ Branch 15 taken 70978 times.
✓ Branch 16 taken 2538431 times.
✓ Branch 17 taken 39017 times.
✓ Branch 18 taken 623555 times.
✓ Branch 19 taken 790 times.
✓ Branch 20 taken 236829 times.
✓ Branch 21 taken 852 times.
✓ Branch 22 taken 229511 times.
✓ Branch 23 taken 925 times.
✓ Branch 24 taken 845714 times.
✓ Branch 25 taken 4816 times.
✓ Branch 26 taken 315153 times.
✓ Branch 27 taken 5541 times.
✓ Branch 28 taken 98385 times.
✓ Branch 29 taken 5413 times.
✓ Branch 30 taken 97221 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 227661 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 35130 times.
✗ Branch 77 not taken.
✗ Branch 78 not taken.
✗ Branch 79 not taken.
✗ Branch 80 not taken.
✗ Branch 81 not taken.
 28065565 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 738 inline string hex(unsigned int value, int width)
358 {
359 char buffer[64];
360 738 sprintf(buffer, "%.*X", width, value);
361
1/2
✓ Branch 0 taken 373 times.
✗ Branch 1 not taken.
 1111 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 269369 inline bool stribegin(const char * str, const char * key)
416 {
417
2/2
✓ Branch 0 taken 929005 times.
✓ Branch 1 taken 26242 times.
 955247 for (int i=0;key[i];i++)
418 {
419
2/2
✓ Branch 0 taken 576176 times.
✓ Branch 1 taken 352829 times.
 929005 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 2421752 inline bool stricmpwithlower(const char *word1, const char *word2)
449 {
450
2/2
✓ Branch 0 taken 3187610 times.
✓ Branch 1 taken 117665 times.
 3305275 while(*word2)
451 {
452
2/2
✓ Branch 0 taken 1519125 times.
✓ Branch 1 taken 1668485 times.
 3187610 if(to_lower(*word1++) != *word2++) return true;
453 }
454 117665 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 29682 inline const char * dequote(char * str)
463 {
464
2/2
✓ Branch 0 taken 17511 times.
✓ Branch 1 taken 12171 times.
 29682 if (*str!='"') return str;
465 27414 char *end = strrchr(str, '"');
466
1/2
✓ Branch 0 taken 27414 times.
✗ Branch 1 not taken.
 27414 if (end)
467 {
468 27414 *end = 0;
469 27414 char *quote = str+1;
470
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 27414 times.
 27846 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
471 11055 return str + 1;
472 }
473 ✗ return nullptr;
474 }
475
476 46012 inline char * strqchr(const char * str, char key)
477 {
478
2/2
✓ Branch 0 taken 407393 times.
✓ Branch 1 taken 34831 times.
 442224 while (*str != '\0')
479 {
480
2/2
✓ Branch 0 taken 11175 times.
✓ Branch 1 taken 396218 times.
 407393 if (*str == key) { return const_cast<char*>(str); }
481
4/4
✓ Branch 0 taken 394310 times.
✓ Branch 1 taken 1908 times.
✓ Branch 2 taken 546 times.
✓ Branch 3 taken 393764 times.
 396218 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 546 times.
✓ Branch 1 taken 1908 times.
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 510 times.
✓ Branch 4 taken 36 times.
✗ Branch 5 not taken.
 2454 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
486 else
487 {
488 1244 char delimiter = *str;
489
490 do
491 {
492 27534 str++;
493
494 // If we want to support backslash escapes, we'll have to add that right here.
495
4/4
✓ Branch 0 taken 25122 times.
✓ Branch 1 taken 2412 times.
✓ Branch 2 taken 25116 times.
✓ Branch 3 taken 6 times.
 27534 } 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 1174 times.
✓ Branch 1 taken 1244 times.
 2418 if (*str == '\0') { return nullptr; }
499 }
500 }
501
502 396212 str++;
503 }
504
505 17463 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 209082 inline char *strip_whitespace(char *str)
519 {
520
2/2
✓ Branch 0 taken 11222 times.
✓ Branch 1 taken 209082 times.
 220304 while(is_space(*str)) str++;
521
2/2
✓ Branch 0 taken 193372 times.
✓ Branch 1 taken 63130 times.
 256502 for(int i = strlen(str) - 1; i >= 0; i--)
522 {
523
2/2
✓ Branch 0 taken 145952 times.
✓ Branch 1 taken 47420 times.
 193372 if(!is_space(str[i]))
524 {
525 145952 str[i + 1] = 0;
526 145952 return str;
527 }
528 }
529 31605 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 148032 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
549 {
550 71502 int count = 0;
551
552
1/2
✓ Branch 0 taken 148086 times.
✗ Branch 1 not taken.
 148086 for (int i = startline; lines[i]; i++)
553 {
554 // The line should already be stripped of any comments at this point
555 148086 int linestartpos = (int)strlen(lines[i]);
556
557
4/4
✓ Branch 0 taken 108438 times.
✓ Branch 1 taken 39648 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 108384 times.
 148086 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 71502 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 71502 times.
✗ Branch 3 not taken.
 148032 out += string(lines[i], linestartpos);
566 148032 return count;
567 }
568 }
569
570 ✗ return count;
571 }
572