asar coverage - build #262

src/asar/
File: src/asar/libstr.h
Date: 2025-02-27 19:01:43
Lines:
198/210
94.3%
Functions:
55/57
96.5%
Branches:
492/705
69.8%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4 #include "libmisc.h"
5 #include <cstdint>
6 #include <cstring>
7 #include <utility>
8 #include <string_view>
9
10 //ty alcaro
11 extern const unsigned char char_props[256];
12 6345969 static inline int to_lower(unsigned char c) { return c|(char_props[c]&0x20); }
13 static inline int to_upper(unsigned char c) { return c&~(char_props[c]&0x20); }
14
15
10/10
✓ Branch 0 taken 75999 times.
✓ Branch 1 taken 29325 times.
✓ Branch 2 taken 75909 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 90 times.
✓ Branch 6 taken 2733 times.
✓ Branch 7 taken 6579 times.
✓ Branch 8 taken 2796 times.
✓ Branch 9 taken 2733 times.
 796767 inline bool is_space(unsigned char c) { return char_props[c] & 0x80; } // C standard says \f \v are space, but this one disagrees
16 // TODO is this opaque table lookup really faster than c >= '0' && c <= '9'?
17 153790 inline bool is_digit(unsigned char c) { return char_props[c] & 0x40; }
18 inline bool is_alpha(unsigned char c) { return char_props[c] & 0x20; }
19 4200 inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
20 5862 inline bool is_upper(unsigned char c) { return char_props[c] & 0x02; }
21 inline bool is_alnum(unsigned char c) { return char_props[c] & 0x60; }
22 44156 inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
23 429095 inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
24
2/2
✓ Branch 0 taken 900 times.
✓ Branch 1 taken 10971 times.
 23836 inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
25
26 2324377 inline char *copy(const char *source, int copy_length, char *dest)
27 {
28 5150500 memcpy(dest, source, copy_length*sizeof(char));
29 2324377 return dest;
30 }
31
32 class string {
33 public:
34 5104660 const char *data() const
35 {
36
233/348
✓ Branch 0 taken 5402 times.
✓ Branch 1 taken 982760 times.
✓ Branch 2 taken 967776 times.
✓ Branch 3 taken 3177 times.
✓ Branch 4 taken 2016 times.
✓ Branch 5 taken 18214 times.
✓ Branch 6 taken 243 times.
✓ Branch 7 taken 4123 times.
✓ Branch 8 taken 888 times.
✓ Branch 9 taken 5334 times.
✓ Branch 10 taken 17052 times.
✓ Branch 11 taken 2592 times.
✓ Branch 12 taken 783 times.
✓ Branch 13 taken 16048 times.
✓ Branch 14 taken 387 times.
✓ Branch 15 taken 777 times.
✓ Branch 16 taken 16224 times.
✓ Branch 17 taken 684 times.
✓ Branch 18 taken 470 times.
✓ Branch 19 taken 11250 times.
✓ Branch 20 taken 288 times.
✓ Branch 21 taken 5569 times.
✓ Branch 22 taken 269 times.
✓ Branch 23 taken 381 times.
✓ Branch 24 taken 471 times.
✓ Branch 25 taken 990 times.
✓ Branch 26 taken 18 times.
✓ Branch 27 taken 2115 times.
✓ Branch 28 taken 896 times.
✓ Branch 29 taken 90 times.
✓ Branch 30 taken 211 times.
✓ Branch 31 taken 706 times.
✓ Branch 32 taken 216 times.
✓ Branch 33 taken 1158 times.
✓ Branch 34 taken 971 times.
✓ Branch 35 taken 1008 times.
✓ Branch 36 taken 1086 times.
✓ Branch 37 taken 254 times.
✓ Branch 38 taken 18 times.
✓ Branch 39 taken 5361 times.
✓ Branch 40 taken 129 times.
✓ Branch 41 taken 6228 times.
✓ Branch 42 taken 1433 times.
✓ Branch 43 taken 36933 times.
✓ Branch 44 taken 27 times.
✓ Branch 45 taken 83094 times.
✓ Branch 46 taken 181 times.
✓ Branch 47 taken 18 times.
✓ Branch 48 taken 84333 times.
✓ Branch 49 taken 189 times.
✓ Branch 50 taken 27 times.
✓ Branch 51 taken 87783 times.
✓ Branch 52 taken 48 times.
✓ Branch 53 taken 855 times.
✓ Branch 54 taken 87000 times.
✓ Branch 55 taken 774 times.
✓ Branch 56 taken 78 times.
✓ Branch 57 taken 127 times.
✓ Branch 58 taken 252 times.
✓ Branch 59 taken 90 times.
✗ Branch 60 not taken.
✓ Branch 61 taken 93 times.
✓ Branch 62 taken 36 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 90 times.
✓ Branch 65 taken 145 times.
✓ Branch 66 taken 9 times.
✓ Branch 67 taken 1239 times.
✓ Branch 68 taken 28 times.
✓ Branch 69 taken 9 times.
✓ Branch 70 taken 67923 times.
✓ Branch 71 taken 15163 times.
✗ Branch 72 not taken.
✓ Branch 73 taken 45 times.
✓ Branch 74 taken 16287 times.
✗ Branch 75 not taken.
✓ Branch 76 taken 45 times.
✓ Branch 77 taken 16296 times.
✓ Branch 78 taken 102 times.
✓ Branch 79 taken 45 times.
✓ Branch 80 taken 596 times.
✓ Branch 81 taken 33 times.
✗ Branch 82 not taken.
✓ Branch 83 taken 451 times.
✓ Branch 84 taken 127 times.
✗ Branch 85 not taken.
✓ Branch 86 taken 15851 times.
✗ Branch 87 not taken.
✗ Branch 88 not taken.
✓ Branch 89 taken 62463 times.
✓ Branch 90 taken 15021 times.
✗ Branch 91 not taken.
✓ Branch 92 taken 36 times.
✓ Branch 93 taken 228 times.
✓ Branch 94 taken 15081 times.
✓ Branch 95 taken 85461 times.
✓ Branch 96 taken 420 times.
✓ Branch 97 taken 85538 times.
✓ Branch 98 taken 9 times.
✓ Branch 99 taken 411 times.
✓ Branch 100 taken 70032 times.
✓ Branch 101 taken 15510 times.
✓ Branch 102 taken 438 times.
✓ Branch 103 taken 162 times.
✓ Branch 104 taken 9 times.
✓ Branch 105 taken 38 times.
✓ Branch 106 taken 162 times.
✓ Branch 107 taken 9 times.
✓ Branch 108 taken 3923 times.
✗ Branch 109 not taken.
✓ Branch 110 taken 9 times.
✓ Branch 111 taken 20 times.
✓ Branch 112 taken 765 times.
✗ Branch 113 not taken.
✓ Branch 114 taken 117 times.
✓ Branch 115 taken 153 times.
✓ Branch 116 taken 54 times.
✓ Branch 117 taken 117 times.
✓ Branch 118 taken 54 times.
✓ Branch 119 taken 153 times.
✓ Branch 120 taken 162 times.
✓ Branch 121 taken 9 times.
✓ Branch 122 taken 153 times.
✓ Branch 123 taken 144 times.
✓ Branch 124 taken 9 times.
✓ Branch 125 taken 153 times.
✗ Branch 126 not taken.
✓ Branch 127 taken 90 times.
✓ Branch 128 taken 144 times.
✗ Branch 129 not taken.
✓ Branch 130 taken 2898 times.
✗ Branch 131 not taken.
✗ Branch 132 not taken.
✓ Branch 133 taken 2880 times.
✓ Branch 134 taken 9 times.
✗ Branch 135 not taken.
✓ Branch 136 taken 6 times.
✓ Branch 137 taken 9 times.
✗ Branch 138 not taken.
✓ Branch 139 taken 6 times.
✗ Branch 140 not taken.
✓ Branch 141 taken 9 times.
✓ Branch 142 taken 10828 times.
✓ Branch 143 taken 36 times.
✓ Branch 144 taken 9 times.
✗ Branch 145 not taken.
✓ Branch 146 taken 10828 times.
✗ Branch 147 not taken.
✓ Branch 148 taken 9 times.
✓ Branch 149 taken 10828 times.
✗ Branch 150 not taken.
✓ Branch 151 taken 9 times.
✓ Branch 152 taken 15613 times.
✗ Branch 153 not taken.
✓ Branch 154 taken 51 times.
✗ Branch 155 not taken.
✓ Branch 156 taken 12 times.
✓ Branch 157 taken 381 times.
✗ Branch 158 not taken.
✓ Branch 159 taken 384 times.
✗ Branch 160 not taken.
✓ Branch 161 taken 9 times.
✓ Branch 162 taken 5024 times.
✗ Branch 163 not taken.
✓ Branch 164 taken 9 times.
✓ Branch 165 taken 5024 times.
✗ Branch 166 not taken.
✓ Branch 167 taken 295 times.
✓ Branch 168 taken 15588 times.
✗ Branch 169 not taken.
✓ Branch 170 taken 253 times.
✓ Branch 171 taken 15687 times.
✗ Branch 172 not taken.
✓ Branch 173 taken 24 times.
✗ Branch 174 not taken.
✓ Branch 175 taken 186 times.
✗ Branch 176 not taken.
✓ Branch 177 taken 180 times.
✓ Branch 178 taken 81 times.
✗ Branch 179 not taken.
✓ Branch 180 taken 72 times.
✓ Branch 181 taken 12 times.
✗ Branch 182 not taken.
✓ Branch 183 taken 180 times.
✓ Branch 184 taken 12 times.
✗ Branch 185 not taken.
✓ Branch 186 taken 21 times.
✗ Branch 187 not taken.
✓ Branch 188 taken 21 times.
✗ Branch 189 not taken.
✓ Branch 190 taken 18 times.
✗ Branch 191 not taken.
✓ Branch 192 taken 27 times.
✗ Branch 193 not taken.
✓ Branch 194 taken 27 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 9 times.
✗ Branch 205 not taken.
✓ Branch 206 taken 9 times.
✗ Branch 207 not taken.
✓ Branch 208 taken 18 times.
✗ Branch 209 not taken.
✓ Branch 210 taken 27 times.
✗ Branch 211 not taken.
✓ Branch 212 taken 27 times.
✗ Branch 213 not taken.
✓ Branch 214 taken 18 times.
✗ Branch 215 not taken.
✓ Branch 216 taken 27 times.
✗ Branch 217 not taken.
✓ Branch 218 taken 27 times.
✗ Branch 219 not taken.
✓ Branch 220 taken 9 times.
✗ Branch 221 not taken.
✓ Branch 222 taken 9 times.
✗ Branch 223 not taken.
✓ Branch 224 taken 9 times.
✗ Branch 225 not taken.
✓ Branch 226 taken 18 times.
✗ Branch 227 not taken.
✓ Branch 228 taken 27 times.
✗ Branch 229 not taken.
✓ Branch 230 taken 27 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 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 27 times.
✗ Branch 261 not taken.
✓ Branch 262 taken 27 times.
✗ Branch 263 not taken.
✓ Branch 264 taken 9 times.
✗ Branch 265 not taken.
✓ Branch 266 taken 9 times.
✗ Branch 267 not taken.
✓ Branch 268 taken 9 times.
✗ Branch 269 not taken.
✓ Branch 270 taken 18 times.
✗ Branch 271 not taken.
✓ Branch 272 taken 27 times.
✗ Branch 273 not taken.
✓ Branch 274 taken 27 times.
✗ Branch 275 not taken.
✓ Branch 276 taken 9 times.
✗ Branch 277 not taken.
✓ Branch 278 taken 18 times.
✗ Branch 279 not taken.
✓ Branch 280 taken 27 times.
✗ Branch 281 not taken.
✓ Branch 282 taken 27 times.
✗ Branch 283 not taken.
✓ Branch 284 taken 54 times.
✗ Branch 285 not taken.
✓ Branch 286 taken 54 times.
✗ Branch 287 not taken.
✓ Branch 288 taken 54 times.
✗ Branch 289 not taken.
✓ Branch 290 taken 108 times.
✗ Branch 291 not taken.
✓ Branch 292 taken 162 times.
✗ Branch 293 not taken.
✓ Branch 294 taken 162 times.
✗ Branch 295 not taken.
✓ Branch 296 taken 54 times.
✗ Branch 297 not taken.
✓ Branch 298 taken 108 times.
✗ Branch 299 not taken.
✓ Branch 300 taken 162 times.
✗ Branch 301 not taken.
✓ Branch 302 taken 162 times.
✗ Branch 303 not taken.
✓ Branch 304 taken 54 times.
✗ Branch 305 not taken.
✓ Branch 306 taken 54 times.
✗ Branch 307 not taken.
✓ Branch 308 taken 54 times.
✗ Branch 309 not taken.
✓ Branch 310 taken 54 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.
✓ Branch 338 taken 9 times.
✗ Branch 339 not taken.
✓ Branch 340 taken 9 times.
✗ 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.
 8284152 return data_ptr;
37 }
38
39 195952 char *temp_raw() const //things to cleanup and take a look at
40 {
41
3/6
✓ Branch 0 taken 168366 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 7176 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 72 times.
✗ Branch 5 not taken.
 411440 return data_ptr;
42 }
43
44 354697 char *raw() const
45 {
46
3/5
✓ Branch 0 taken 2235 times.
✓ Branch 1 taken 81936 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 36 times.
✗ Branch 4 not taken.
 463419 return data_ptr;
47 }
48
49 5949310 int length() const
50 {
51
10/12
✓ Branch 0 taken 1223471 times.
✓ Branch 1 taken 130412 times.
✓ Branch 2 taken 969647 times.
✓ Branch 3 taken 99596 times.
✓ Branch 4 taken 17594 times.
✓ Branch 5 taken 4277 times.
✓ Branch 6 taken 39 times.
✓ Branch 7 taken 963 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 295 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 132 times.
 9568317 return len;
52 }
53
54 7581065 void resize(unsigned int new_length)
55 {
56
2/2
✓ Branch 0 taken 23794 times.
✓ Branch 1 taken 7557271 times.
 7581065 if (new_length > capacity()) {
57 23794 reallocate_capacity(new_length);
58 }
59
60 7581065 len = new_length;
61 7581065 data_ptr[new_length] = 0; //always ensure null terminator
62 7581065 }
63
64 1188 void truncate(int newlen)
65 {
66
1/2
✓ Branch 0 taken 1188 times.
✗ Branch 1 not taken.
 2376 resize(newlen);
67 2376 }
68
69 2534021 void assign(const char * newstr)
70 {
71
2/2
✓ Branch 0 taken 256 times.
✓ Branch 1 taken 2533765 times.
 2534021 if (!newstr) newstr = "";
72 2534021 assign(newstr, strlen(newstr));
73 2534021 }
74
75 1447993 void assign(const string &newstr)
76 {
77 1447993 assign(newstr.data(), newstr.length());
78 1447993 }
79
80 4255220 void assign(const char * newstr, int end)
81 {
82 4255220 resize(end);
83 4255220 copy(newstr, end, data_ptr);
84 4255220 }
85
86
87 380811 string& operator=(const char * newstr)
88 {
89
14/26
✓ Branch 0 taken 947 times.
✓ Branch 1 taken 1530 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 18 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 723 times.
✓ Branch 6 taken 254 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 315 times.
✓ Branch 9 taken 4797 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 2542 times.
✓ Branch 12 taken 9 times.
✗ Branch 13 not taken.
✓ Branch 14 taken 145 times.
✗ Branch 15 not taken.
✓ Branch 16 taken 16204 times.
✗ Branch 17 not taken.
✓ Branch 18 taken 30666 times.
✗ Branch 19 not taken.
✓ Branch 20 taken 272853 times.
✗ Branch 21 not taken.
✗ Branch 22 not taken.
✗ Branch 23 not taken.
✓ Branch 24 taken 85533 times.
✗ Branch 25 not taken.
 834957 assign(newstr);
90 798970 return *this;
91 }
92
93 624495 string& operator=(const string &newstr)
94 {
95
22/28
✓ Branch 0 taken 36273 times.
✓ Branch 1 taken 726 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 49659 times.
✓ Branch 4 taken 288 times.
✓ Branch 5 taken 254 times.
✓ Branch 6 taken 9 times.
✓ Branch 7 taken 288 times.
✓ Branch 8 taken 762 times.
✓ Branch 9 taken 9 times.
✓ Branch 10 taken 45 times.
✓ Branch 11 taken 765 times.
✓ Branch 12 taken 6 times.
✓ Branch 13 taken 18 times.
✓ Branch 14 taken 153 times.
✓ Branch 15 taken 15 times.
✓ Branch 16 taken 18 times.
✓ Branch 17 taken 81 times.
✗ Branch 18 not taken.
✓ Branch 19 taken 18 times.
✓ Branch 20 taken 6 times.
✗ Branch 21 not taken.
✓ Branch 22 taken 18 times.
✗ Branch 23 not taken.
✓ Branch 24 taken 36 times.
✗ Branch 25 not taken.
✓ Branch 26 taken 1083 times.
✗ Branch 27 not taken.
 992610 assign(newstr);
96 978947 return *this;
97 }
98
99 string& append(const string& other, int start, int end)
100 {
101 int current_end = length();
102 resize(length() + end - start);
103 copy(other.data() + start, end - start, data_ptr + current_end);
104 return *this;
105 }
106
107 10128 string& append(const char *other, int start, int end)
108 {
109 5070 int current_end = length();
110 10128 resize(length() + end - start);
111 10128 copy(other + start, end - start, data_ptr + current_end);
112 10128 return *this;
113 }
114
115 227412 string& operator+=(const string& other)
116 {
117 90733 int current_end = length();
118 227412 resize(length() + other.length());
119 227412 copy(other.data(), other.length(), data_ptr + current_end);
120 227412 return *this;
121 }
122
123 639888 string& operator+=(const char *other)
124 {
125 286956 int current_end = length();
126 639888 int otherlen=(int)strlen(other);
127 639888 resize(length() + otherlen);
128 639888 copy(other, otherlen, data_ptr + current_end);
129 639888 return *this;
130 }
131
132 2444513 string& operator+=(char c)
133 {
134 2444513 resize(length() + 1);
135 2444513 data_ptr[length() - 1] = c;
136 2444513 return *this;
137 }
138
139 string operator+(char right) const
140 {
141 string ret=*this;
142 ret+=right;
143 return ret;
144 }
145
146 150679 string operator+(const char * right) const
147 {
148 61684 string ret=*this;
149
1/2
✓ Branch 0 taken 150679 times.
✗ Branch 1 not taken.
 150679 ret+=right;
150 150679 return ret;
151 ✗ }
152
153 3855907 operator const char*() const
154 {
155 3855907 return data();
156 }
157
158 17056 explicit operator bool() const
159 {
160 17056 return length();
161 }
162
163 2391691 string()
164 4762765 {
165 4971310 data_ptr = inlined.data;
166 4971310 len = 0;
167
30/32
✓ Branch 0 taken 32501 times.
✓ Branch 1 taken 1299 times.
✓ Branch 2 taken 74109 times.
✓ Branch 3 taken 9205 times.
✓ Branch 4 taken 2994 times.
✓ Branch 5 taken 2355 times.
✓ Branch 6 taken 29 times.
✓ Branch 7 taken 464 times.
✓ Branch 8 taken 3368 times.
✓ Branch 9 taken 5202 times.
✓ Branch 10 taken 110341 times.
✓ Branch 11 taken 45 times.
✓ Branch 12 taken 77814 times.
✓ Branch 13 taken 1875 times.
✓ Branch 14 taken 2313 times.
✓ Branch 15 taken 3633 times.
✓ Branch 16 taken 15228 times.
✓ Branch 17 taken 90 times.
✓ Branch 18 taken 72 times.
✓ Branch 19 taken 16948 times.
✓ Branch 20 taken 3072 times.
✗ Branch 21 not taken.
✓ Branch 22 taken 42 times.
✓ Branch 23 taken 214 times.
✓ Branch 24 taken 3857 times.
✓ Branch 25 taken 172 times.
✓ Branch 26 taken 98031 times.
✓ Branch 27 taken 25 times.
✓ Branch 28 taken 95940 times.
✓ Branch 29 taken 5024 times.
✓ Branch 30 taken 272781 times.
✗ Branch 31 not taken.
 3859924 inlined.data[0] = '\0';
168 2393723 }
169 1321435 string(const char * newstr) : string()
170 {
171
1/2
✓ Branch 0 taken 1321435 times.
✗ Branch 1 not taken.
 1321435 assign(newstr);
172
45/68
✓ Branch 0 taken 5166 times.
✓ Branch 1 taken 33240 times.
✓ Branch 2 taken 127 times.
✓ Branch 3 taken 18 times.
✓ Branch 4 taken 127 times.
✓ Branch 5 taken 15559 times.
✓ Branch 6 taken 828 times.
✓ Branch 7 taken 127 times.
✓ Branch 8 taken 127 times.
✓ Branch 9 taken 82887 times.
✓ Branch 10 taken 508 times.
✓ Branch 11 taken 127 times.
✓ Branch 12 taken 168366 times.
✓ Branch 13 taken 535 times.
✓ Branch 14 taken 127 times.
✓ Branch 15 taken 85659 times.
✓ Branch 16 taken 208 times.
✓ Branch 17 taken 127 times.
✓ Branch 18 taken 51 times.
✗ Branch 19 not taken.
✓ Branch 20 taken 127 times.
✓ Branch 21 taken 180 times.
✓ Branch 22 taken 5432 times.
✗ Branch 23 not taken.
✓ Branch 24 taken 18 times.
✓ Branch 25 taken 18 times.
✗ Branch 26 not taken.
✓ Branch 27 taken 36 times.
✓ Branch 28 taken 5450 times.
✗ Branch 29 not taken.
✓ Branch 30 taken 9 times.
✓ Branch 31 taken 15368 times.
✗ Branch 32 not taken.
✗ Branch 33 not taken.
✓ Branch 34 taken 63 times.
✗ Branch 35 not taken.
✓ Branch 36 taken 45 times.
✗ Branch 37 not taken.
✓ Branch 38 taken 9 times.
✗ Branch 39 not taken.
✓ Branch 40 taken 45 times.
✗ Branch 41 not taken.
✓ Branch 42 taken 18 times.
✗ Branch 43 not taken.
✓ Branch 44 taken 9 times.
✗ Branch 45 not taken.
✓ Branch 46 taken 81 times.
✗ Branch 47 not taken.
✓ Branch 48 taken 27 times.
✗ Branch 49 not taken.
✓ Branch 50 taken 117 times.
✗ Branch 51 not taken.
✓ Branch 52 taken 45 times.
✗ Branch 53 not taken.
✓ Branch 54 taken 54 times.
✗ Branch 55 not taken.
✓ Branch 56 taken 36 times.
✗ Branch 57 not taken.
✓ Branch 58 taken 15 times.
✗ Branch 59 not taken.
✓ Branch 60 taken 186 times.
✗ Branch 61 not taken.
✓ Branch 62 taken 81 times.
✗ Branch 63 not taken.
✓ Branch 64 taken 12 times.
✗ Branch 65 not taken.
✓ Branch 66 taken 12 times.
✗ Branch 67 not taken.
 1923575 }
173 236158 string(const char * newstr, int newlen) : string()
174 {
175
1/2
✓ Branch 0 taken 236158 times.
✗ Branch 1 not taken.
 236158 assign(newstr, newlen);
176
5/9
✓ Branch 0 taken 877 times.
✓ Branch 1 taken 762 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2133 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 54 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 72 times.
✗ Branch 8 not taken.
 361768 }
177 377629 string(const string& old) : string()
178 {
179
1/2
✓ Branch 0 taken 377629 times.
✗ Branch 1 not taken.
 377629 assign(old.data());
180
21/35
✓ Branch 0 taken 9702 times.
✓ Branch 1 taken 270 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 12301 times.
✓ Branch 4 taken 2169 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 96 times.
✓ Branch 7 taken 525 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 225 times.
✓ Branch 10 taken 87 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 99 times.
✗ Branch 13 not taken.
✓ Branch 14 taken 2247 times.
✗ Branch 15 not taken.
✓ Branch 16 taken 99 times.
✓ Branch 17 taken 6 times.
✗ Branch 18 not taken.
✓ Branch 19 taken 801 times.
✗ Branch 20 not taken.
✓ Branch 21 taken 3 times.
✓ Branch 22 taken 117 times.
✗ Branch 23 not taken.
✓ Branch 24 taken 78 times.
✗ Branch 25 not taken.
✓ Branch 26 taken 1863 times.
✓ Branch 27 taken 45 times.
✗ Branch 28 not taken.
✓ Branch 29 taken 54 times.
✗ Branch 30 not taken.
✓ Branch 31 taken 1935 times.
✗ Branch 32 not taken.
✓ Branch 33 taken 3 times.
✗ Branch 34 not taken.
 501074 }
181
182 96857 string(string &&move) noexcept : string()
183 {
184 46327 *this = move;
185 93392 }
186
187 391939 string& operator=(string&& other) noexcept
188 {
189
2/2
✓ Branch 0 taken 142700 times.
✓ Branch 1 taken 173 times.
 391939 if (other.is_inlined()) {
190 // No resources to steal so just do a normal assignment
191 142700 *this = other;
192 } else {
193
2/2
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 101 times.
 317 if (is_inlined()) {
194 125 data_ptr = other.data_ptr;
195 125 other.data_ptr = 0;
196 } else {
197 // Give our old allocation back so other can free it for us
198 101 std::swap(data_ptr, other.data_ptr);
199 }
200 317 len = other.len;
201 317 allocated = other.allocated;
202 }
203 391939 return *this;
204 }
205
206 12573519 ~string()
207 {
208
2/2
✓ Branch 0 taken 11451 times.
✓ Branch 1 taken 2294696 times.
 7439833 if(!is_inlined()){
209 34613 free(data_ptr);
210 }
211 12573519 }
212
213 //maybe these should return refs to chain. but also good not to encourage chaining
214 5354 void strip_prefix(char c)
215 {
216
2/2
✓ Branch 0 taken 1528 times.
✓ Branch 1 taken 3826 times.
 5354 if(data()[0] == c){
217 1528 std::memmove(data_ptr, data_ptr + 1, length() - 1);
218 1528 resize(length() - 1);
219 }
220 5354 }
221
222 void strip_suffix(char c)
223 {
224 if (data()[length() - 1] == c) {
225 truncate(length() - 1);
226 }
227 }
228
229 string& qreplace(const char * instr, const char * outstr);
230 string& qnormalize();
231
232 // RPG Hacker: My hack shmeck to get around no longer supporting text mode.
233 // Symbol files are currently the only thing that use text mode, anyways, and I don't even know
234 // if the emulators that read them care about line endings.
235 ✗ string& convert_line_endings_to_native()
236 {
237 #if defined(windows)
238 // RPG Hacker: This is quite stinky, but doing the replacement directly will lead to a dead-lock.
239 // \x08 = backspace should never appear inside a string, so I'm abusing it here.
240 ✗ return qreplace("\n", "\x08").qreplace("\x08", "\r\n");
241 #else
242 ✗ return *this;
243 #endif
244 }
245
246 #ifdef SERIALIZER
247 void serialize(serializer & s)
248 {
249 s(str, allocated.bufferlen);
250 resize(strlen(str));
251 }
252 #endif
253 #define SERIALIZER_BANNED
254
255 private:
256 static const int scale_factor = 4; //scale sso
257 static const int inline_capacity = ((sizeof(char *) + sizeof(int) * 2) * scale_factor) - 2;
258
259 // Points to a malloc'd data block or to inlined.data
260 char *data_ptr;
261 unsigned int len;
262 union {
263 struct {
264 // Actual allocated capacity is +1 this value, to cover for the terminating NUL
265 unsigned int capacity;
266 } allocated;
267 struct {
268 char data[inline_capacity + 1];
269 } inlined;
270 };
271
272 void reallocate_capacity(unsigned int new_length);
273
274 3383901 unsigned capacity() const
275 {
276
2/2
✓ Branch 0 taken 3373799 times.
✓ Branch 1 taken 10102 times.
 3394519 return is_inlined() ? inline_capacity : allocated.capacity;
277 }
278
279 5844960 bool is_inlined() const
280 {
281
8/10
✓ Branch 0 taken 23112 times.
✓ Branch 1 taken 2555659 times.
✓ Branch 2 taken 248922 times.
✓ Branch 3 taken 144 times.
✓ Branch 4 taken 53 times.
✓ Branch 5 taken 91 times.
✓ Branch 6 taken 10618 times.
✓ Branch 7 taken 4186546 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
 12869961 return data_ptr == inlined.data;
282 }
283 };
284 #define STR (string)
285
286 #define ASAR_STRCMP_OPERATORS(op) \
287 inline bool operator op(const string& left, const string& right) { \
288 return strcmp(left, right) op 0; \
289 } \
290 inline bool operator op(const string& left, const char* right) { \
291 return strcmp(left, right) op 0; \
292 } \
293 inline bool operator op(const char* left, const string& right) { \
294 return strcmp(left, right) op 0; \
295 }
296
297 379551 ASAR_STRCMP_OPERATORS(==)
298 28440 ASAR_STRCMP_OPERATORS(!=)
299 ASAR_STRCMP_OPERATORS(<)
300 ASAR_STRCMP_OPERATORS(<=)
301 ASAR_STRCMP_OPERATORS(>)
302 ASAR_STRCMP_OPERATORS(>=)
303 #undef ASAR_STRCMP_OPERATORS
304
305 template<>
306 struct std::hash<string> {
307 374112 size_t operator()(const ::string& s) const {
308 374112 return std::hash<std::string_view>()(std::string_view(s.data(), s.length()));
309 }
310 };
311
312 char * readfile(const char * fname, const char * basepath);
313 char * readfilenative(const char * fname);
314 bool readfile(const char * fname, const char * basepath, char ** data, int * len);//if you want an uchar*, cast it
315 char ** split(char * str, char key, int * len= nullptr);
316 char ** qsplit(char * str, char key, int * len= nullptr);
317 char ** qpsplit(char * str, char key, int * len= nullptr);
318 char ** qsplitstr(char * str, const char * key, int * len= nullptr);
319 bool confirmquotes(const char * str);
320 bool confirmqpar(const char * str);
321 char* strqpchr(char* str, char key);
322 char* strqpstr(char* str, const char* key);
323
324 ✗ inline string hex(unsigned int value)
325 {
326 char buffer[64];
327 if(0);
328 ✗ else if (value<=0x000000FF) snprintf(buffer, sizeof(buffer), "%.2X", value);
329 ✗ else if (value<=0x0000FFFF) snprintf(buffer, sizeof(buffer), "%.4X", value);
330 ✗ else if (value<=0x00FFFFFF) snprintf(buffer, sizeof(buffer), "%.6X", value);
331 ✗ else snprintf(buffer, sizeof(buffer), "%.8X", value);
332 ✗ return buffer;
333 }
334
335 6 inline string hex(unsigned int value, int width)
336 {
337 char buffer[64];
338 6 snprintf(buffer, sizeof(buffer), "%.*X", width, value);
339
1/2
✓ Branch 0 taken 3 times.
✗ Branch 1 not taken.
 9 return buffer;
340 }
341
342 21295 inline string dec(int value)
343 {
344 char buffer[64];
345 21295 snprintf(buffer, sizeof(buffer), "%i", value);
346
1/2
✓ Branch 0 taken 8982 times.
✗ Branch 1 not taken.
 30277 return buffer;
347 }
348
349 6498 inline string ftostr(double value)
350 {
351 // randomdude999: With 100 digits of precision, the buffer needs to be approx. 311+100,
352 // but let's be safe here https://stackoverflow.com/questions/7235456
353 char rval[512];
354 // RPG Hacker: Ridiculously high precision, I know, but we're working with doubles
355 // here and can afford it, so no need to waste any precision
356 6498 snprintf(rval, sizeof(rval), "%.100f", value);
357
1/2
✓ Branch 0 taken 6498 times.
✗ Branch 1 not taken.
 6498 if (strchr(rval, '.'))//nuke useless zeroes
358 {
359 6498 char * end=strrchr(rval, '\0')-1;
360
2/2
✓ Branch 0 taken 648756 times.
✓ Branch 1 taken 6498 times.
 655254 while (*end=='0')
361 {
362 648756 *end='\0';
363 648756 end--;
364 }
365
2/2
✓ Branch 0 taken 6480 times.
✓ Branch 1 taken 18 times.
 6498 if (*end=='.') *end='\0';
366 }
367
1/2
✓ Branch 0 taken 3249 times.
✗ Branch 1 not taken.
 9747 return rval;
368 }
369
370 // Same as above, but with variable precision
371 72 inline string ftostrvar(double value, int precision)
372 {
373 36 int clampedprecision = precision;
374
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 36 times.
 36 if (clampedprecision < 0) clampedprecision = 0;
375
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 36 times.
 72 if (clampedprecision > 100) clampedprecision = 100;
376
377 // see above
378 char rval[512];
379 72 snprintf(rval, sizeof(rval), "%.*f", clampedprecision, (double)value);
380
2/2
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 6 times.
 72 if (strchr(rval, '.'))//nuke useless zeroes
381 {
382 66 char * end = strrchr(rval, '\0') - 1;
383
2/2
✓ Branch 0 taken 138 times.
✓ Branch 1 taken 66 times.
 204 while (*end == '0')
384 {
385 138 *end = '\0';
386 138 end--;
387 }
388
2/2
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 48 times.
 66 if (*end == '.') *end = '\0';
389 }
390
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 108 return rval;
391 }
392
393 271391 inline bool stribegin(const char * str, const char * key)
394 {
395
2/2
✓ Branch 0 taken 935947 times.
✓ Branch 1 taken 26218 times.
 962165 for (int i=0;key[i];i++)
396 {
397
2/2
✓ Branch 0 taken 578249 times.
✓ Branch 1 taken 357698 times.
 935947 if (to_lower(str[i])!=to_lower(key[i])) return false;
398 }
399 5623 return true;
400 }
401
402 inline bool striend(const char * str, const char * key)
403 {
404 const char * keyend=strrchr(key, '\0');
405 const char * strend=strrchr(str, '\0');
406 if(keyend-key > strend-str) return false;
407
408 while (key!=keyend)
409 {
410 keyend--;
411 strend--;
412 if (to_lower(*strend)!=to_lower(*keyend)) return false;
413 }
414 return true;
415 }
416
417 inline bool stricmpwithupper(const char *word1, const char *word2)
418 {
419 while(*word2)
420 {
421 if(to_upper(*word1++) != *word2++) return true;
422 }
423 return *word1;
424 }
425
426 2277941 inline bool stricmpwithlower(const char *word1, const char *word2)
427 {
428
2/2
✓ Branch 0 taken 3038846 times.
✓ Branch 1 taken 118358 times.
 3157204 while(*word2)
429 {
430
2/2
✓ Branch 0 taken 1449351 times.
✓ Branch 1 taken 1589495 times.
 3038846 if(to_lower(*word1++) != *word2++) return true;
431 }
432 118358 return *word1;
433 }
434
435 //function: return the string without quotes around it, if any exists
436 //if they don't exist, return it unaltered
437 //it is not guaranteed to return str
438 //it is not guaranteed to not edit str
439 //the input must be freed even though it's garbage, the output must not
440 29841 inline const char * dequote(char * str)
441 {
442
2/2
✓ Branch 0 taken 17514 times.
✓ Branch 1 taken 12327 times.
 29841 if (*str!='"') return str;
443 27573 char *end = strrchr(str, '"');
444
1/2
✓ Branch 0 taken 27573 times.
✗ Branch 1 not taken.
 27573 if (end)
445 {
446 27573 *end = 0;
447 27573 char *quote = str+1;
448
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 27573 times.
 28005 while((quote = strstr(quote, "\"\""))) memmove(quote, quote+1, strlen(quote));
449 11211 return str + 1;
450 }
451 ✗ return nullptr;
452 }
453
454 46786 inline char * strqchr(const char * str, char key)
455 {
456
2/2
✓ Branch 0 taken 414557 times.
✓ Branch 1 taken 35443 times.
 450000 while (*str != '\0')
457 {
458
2/2
✓ Branch 0 taken 11337 times.
✓ Branch 1 taken 403220 times.
 414557 if (*str == key) { return const_cast<char*>(str); }
459
4/4
✓ Branch 0 taken 401258 times.
✓ Branch 1 taken 1962 times.
✓ Branch 2 taken 552 times.
✓ Branch 3 taken 400706 times.
 403220 else if (*str == '"' || *str == '\'')
460 {
461 // Special case hack for ''', which is currently our official way of handling the ' character.
462 // Even though it really stinks.
463
5/6
✓ Branch 0 taken 552 times.
✓ Branch 1 taken 1962 times.
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 516 times.
✓ Branch 4 taken 36 times.
✗ Branch 5 not taken.
 2514 if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
464 else
465 {
466 1274 char delimiter = *str;
467
468 do
469 {
470 28278 str++;
471
472 // If we want to support backslash escapes, we'll have to add that right here.
473
4/4
✓ Branch 0 taken 25806 times.
✓ Branch 1 taken 2472 times.
✓ Branch 2 taken 25800 times.
✓ Branch 3 taken 6 times.
 28278 } while (*str != delimiter && *str != '\0');
474
475 // This feels like a superfluous check, but I can't really find a clean way to avoid it.
476
2/2
✓ Branch 0 taken 1204 times.
✓ Branch 1 taken 1274 times.
 2478 if (*str == '\0') { return nullptr; }
477 }
478 }
479
480 403214 str++;
481 }
482
483 17769 return nullptr;
484 }
485
486 3870 inline string substr(const char * str, int len)
487 {
488 3870 return string(str, len);
489 }
490
491
492 211833 inline char *strip_whitespace(char *str)
493 {
494
2/2
✓ Branch 0 taken 11258 times.
✓ Branch 1 taken 211833 times.
 223091 while(is_space(*str)) str++;
495
2/2
✓ Branch 0 taken 195145 times.
✓ Branch 1 taken 64162 times.
 259307 for(int i = strlen(str) - 1; i >= 0; i--)
496 {
497
2/2
✓ Branch 0 taken 147671 times.
✓ Branch 1 taken 47474 times.
 195145 if(!is_space(str[i]))
498 {
499 147671 str[i + 1] = 0;
500 147671 return str;
501 }
502 }
503 32121 return str;
504 }
505 7134 inline void strip_whitespace(string &str)
506 {
507
1/2
✓ Branch 0 taken 3581 times.
✗ Branch 1 not taken.
 10687 str = string(strip_whitespace(str.temp_raw()));
508 7134 }
509
510 string &itrim(string &str, const char * left, const char * right);
511
512 34464 inline string &lower(string &old)
513 {
514 94 int length = old.length();
515
2/2
✓ Branch 0 taken 967856 times.
✓ Branch 1 taken 34464 times.
 1002320 for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
516 34464 return old;
517 }
518
519
520 // Returns number of connected lines - 1
521 template<typename stringarraytype>
522 150021 inline int getconnectedlines(stringarraytype& lines, int startline, string& out)
523 {
524 72573 int count = 0;
525
526
1/2
✓ Branch 0 taken 150075 times.
✗ Branch 1 not taken.
 150075 for (int i = startline; lines[i]; i++)
527 {
528 // The line should already be stripped of any comments at this point
529 150075 int linestartpos = (int)strlen(lines[i]);
530
531
4/4
✓ Branch 0 taken 109671 times.
✓ Branch 1 taken 40404 times.
✓ Branch 2 taken 54 times.
✓ Branch 3 taken 109617 times.
 150075 if(linestartpos && lines[i][linestartpos - 1] == '\\')
532 {
533 54 count++;
534
2/4
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 out += string(lines[i], linestartpos - 1);
535 27 continue;
536 }
537 else
538 {
539
2/4
✓ Branch 0 taken 150021 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 72573 times.
✗ Branch 3 not taken.
 150021 out += string(lines[i], linestartpos);
540 150021 return count;
541 }
542 }
543
544 ✗ return count;
545 }
546