libstr.h - asar coverage

libstr.h

Line	Branch	Exec	Source
1			#pragma once
2
3			#include "std-includes.h"
4			#include <cstdint>
5			#include <cstring>
6			#include <utility>
7			#include <string_view>
8			#include <cinttypes>
9
10			//ty alcaro
11			extern const unsigned char char_props[256];
12		1760917	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		220917	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		47326	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		✗	inline bool is_lower(unsigned char c) { return char_props[c] & 0x04; }
20		106	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		16478	inline bool is_ualpha(unsigned char c) { return char_props[c] & 0x28; }
23		122467	inline bool is_ualnum(unsigned char c) { return char_props[c] & 0x68; }
24		7297	inline bool is_xdigit(unsigned char c) { return char_props[c] & 0x01; }
25
26		973441	inline char copy(const char source, int copy_length, char *dest)
27			{
28	2/4 ✗ Branch 2 → 3 not taken. ✓ Branch 2 → 4 taken 485450 times. ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 485450 times.	973441	memcpy(dest, source, copy_length*sizeof(char));
29		973441	return dest;
30			}
31
32			class string {
33			public:
34		4604385	const char *data() const
35			{
36		4604385	return data_ptr;
37			}
38
39		70972	char *temp_raw() const //things to cleanup and take a look at
40			{
41		70972	return data_ptr;
42			}
43
44		872261	char *raw() const
45			{
46		872261	return data_ptr;
47			}
48
49		4555149	int length() const
50			{
51		4555149	return len;
52			}
53
54		1904178	void resize(unsigned int new_length)
55			{
56	4/4 ✓ Branch 3 → 4 taken 1481 times. ✓ Branch 3 → 5 taken 953100 times. ✓ Branch 4 → 5 taken 2055 times. ✓ Branch 4 → 7 taken 947542 times.	1904178	if (new_length > capacity()) {
57		3536	reallocate_capacity(new_length);
58			}
59
60		1904178	len = new_length;
61		1904178	data_ptr[new_length] = 0; //always ensure null terminator
62		1904178	}
63
64		804	void truncate(int newlen)
65			{
66		804	resize(newlen);
67		804	}
68
69		250207	void assign(const char * newstr)
70			{
71	2/2 ✓ Branch 2 → 3 taken 105 times. ✓ Branch 2 → 4 taken 250102 times.	250207	if (!newstr) newstr = "";
72	1/2 ✗ Branch 5 → 6 not taken. ✓ Branch 5 → 7 taken 126747 times.	250207	assign(newstr, strlen(newstr));
73		250207	}
74
75		287823	void assign(const string &newstr)
76			{
77		287823	assign(newstr.data(), newstr.length());
78		287823	}
79
80		854689	void assign(const char * newstr, int end)
81			{
82		854689	resize(end);
83		854689	copy(newstr, end, data_ptr);
84		854689	}
85
86
87		12734	string& operator=(const char * newstr)
88			{
89		12734	assign(newstr);
90		12734	return *this;
91			}
92
93		287823	string& operator=(const string &newstr)
94			{
95		287823	assign(newstr);
96		287823	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		3686	string& append(const char *other, int start, int end)
108			{
109		3686	int current_end = length();
110		3686	resize(length() + end - start);
111		3686	copy(other + start, end - start, data_ptr + current_end);
112		3686	return *this;
113			}
114
115		11181	string& operator+=(const string& other)
116			{
117		11181	int current_end = length();
118		11181	resize(length() + other.length());
119		11181	copy(other.data(), other.length(), data_ptr + current_end);
120		11181	return *this;
121			}
122
123		100633	string& operator+=(const char *other)
124			{
125		100633	int current_end = length();
126	1/2 ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 50569 times.	100633	int otherlen=(int)strlen(other);
127		100633	resize(length() + otherlen);
128		100633	copy(other, otherlen, data_ptr + current_end);
129		100633	return *this;
130			}
131
132		933181	string& operator+=(char c)
133			{
134		933181	resize(length() + 1);
135		933181	data_ptr[length() - 1] = c;
136		933181	return *this;
137			}
138
139			string operator+(char right) const
140			{
141			string ret=*this;
142			ret+=right;
143			return ret;
144			}
145
146		45734	string operator+(const char * right) const
147			{
148		45734	string ret=*this;
149	2/4 ✓ Branch 3 → 4 taken 22766 times. ✗ Branch 3 → 6 not taken. ✓ Branch 4 → 5 taken 22968 times. ✗ Branch 4 → 7 not taken.	45734	ret+=right;
150		45734	return ret;
151		✗	}
152
153		2969767	operator const char*() const
154			{
155		2969767	return data();
156			}
157
158		10308	explicit operator bool() const
159			{
160		10308	return length();
161			}
162
163		987138	string()
164		987138	{
165		987138	data_ptr = inlined.data;
166		987138	len = 0;
167		987138	inlined.data[0] = '\0';
168		987138	}
169		230285	string(const char * newstr) : string()
170			{
171	2/6 string::string(char const): ✓ Branch 3 → 4 taken 113603 times. ✗ Branch 3 → 5 not taken. string::string(char const): ✗ Branch 3 → 4 not taken. ✗ Branch 3 → 5 not taken. ✓ Branch 6 → 7 taken 116682 times. ✗ Branch 6 → 8 not taken.	230285	assign(newstr);
172		230285	}
173		30950	string(const char * newstr, int newlen) : string()
174			{
175	2/6 string::string(char const, int): ✓ Branch 3 → 4 taken 15447 times. ✗ Branch 3 → 5 not taken. string::string(char const, int): ✗ Branch 3 → 4 not taken. ✗ Branch 3 → 5 not taken. ✓ Branch 6 → 7 taken 15503 times. ✗ Branch 6 → 8 not taken.	30950	assign(newstr, newlen);
176		30950	}
177		239705	string(const string& old) : string()
178			{
179	2/6 string::string(string const&): ✓ Branch 5 → 6 taken 119085 times. ✗ Branch 5 → 7 not taken. string::string(string const&): ✗ Branch 5 → 6 not taken. ✗ Branch 5 → 7 not taken. ✓ Branch 10 → 11 taken 120620 times. ✗ Branch 10 → 12 not taken.	239705	assign(old.data(), old.length());
180		239705	}
181
182		25058	string(string &&move) noexcept : string()
183			{
184		25058	*this = move;
185		25058	}
186
187		112914	string& operator=(string&& other) noexcept
188			{
189	4/4 ✓ Branch 3 → 4 taken 56166 times. ✓ Branch 3 → 5 taken 71 times. ✓ Branch 4 → 5 taken 56575 times. ✓ Branch 4 → 8 taken 102 times.	112914	if (other.is_inlined()) {
190			// No resources to steal so just do a normal assignment
191		112741	*this = other;
192			} else {
193	4/4 ✓ Branch 6 → 7 taken 47 times. ✓ Branch 6 → 8 taken 24 times. ✓ Branch 10 → 11 taken 78 times. ✓ Branch 10 → 15 taken 24 times.	173	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		48	std::swap(data_ptr, other.data_ptr);
199			}
200		173	len = other.len;
201		173	allocated = other.allocated;
202			}
203		112914	return *this;
204			}
205
206		937664	~string()
207			{
208	4/6 string::~string(): ✓ Branch 3 → 4 taken 1387 times. ✓ Branch 3 → 5 taken 463207 times. string::~string(): ✗ Branch 3 → 4 not taken. ✗ Branch 3 → 5 not taken. ✓ Branch 4 → 5 taken 1984 times. ✓ Branch 4 → 7 taken 471086 times.	937664	if(!is_inlined()){
209		3371	free(data_ptr);
210			}
211		937664	}
212
213			//maybe these should return refs to chain. but also good not to encourage chaining
214		10	void strip_prefix(char c)
215			{
216	2/4 ✗ Branch 3 → 4 not taken. ✗ Branch 3 → 7 not taken. ✓ Branch 5 → 6 taken 4 times. ✓ Branch 5 → 19 taken 6 times.	10	if(data()[0] == c){
217	2/4 ✗ Branch 11 → 12 not taken. ✓ Branch 11 → 13 taken 4 times. ✗ Branch 13 → 14 not taken. ✓ Branch 13 → 15 taken 4 times.	4	std::memmove(data_ptr, data_ptr + 1, length() - 1);
218		4	resize(length() - 1);
219			}
220		10	}
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			private:
247			static const int scale_factor = 4; //scale sso
248			static const int inline_capacity = ((sizeof(char ) + sizeof(int) 2) * scale_factor) - 2;
249
250			// Points to a malloc'd data block or to inlined.data
251			char *data_ptr;
252			unsigned int len;
253			union {
254			struct {
255			// Actual allocated capacity is +1 this value, to cover for the terminating NUL
256			unsigned int capacity;
257			} allocated;
258			struct {
259			char data[inline_capacity + 1];
260			} inlined;
261			};
262
263			void reallocate_capacity(unsigned int new_length);
264
265		1904178	unsigned capacity() const
266			{
267	4/4 ✓ Branch 3 → 4 taken 953602 times. ✓ Branch 3 → 5 taken 979 times. ✓ Branch 4 → 5 taken 948104 times. ✓ Branch 4 → 6 taken 1493 times.	1904178	return is_inlined() ? inline_capacity : allocated.capacity;
268			}
269
270		2958465	bool is_inlined() const
271			{
272		2958465	return data_ptr == inlined.data;
273			}
274			};
275			#define STR (string)
276
277			#define ASAR_STRCMP_OPERATORS(op) \
278			inline bool operator op(const string& left, const string& right) { \
279			return strcmp(left, right) op 0; \
280			} \
281			inline bool operator op(const string& left, const char* right) { \
282			return strcmp(left, right) op 0; \
283			} \
284			inline bool operator op(const char* left, const string& right) { \
285			return strcmp(left, right) op 0; \
286			}
287
288	6/12 operator==(char const, string const&): ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 15 times. ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 15 times. operator==(string const&, char const): ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 4550 times. ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 4550 times. operator==(string const&, string const&): ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 27142 times. ✗ Branch 8 → 9 not taken. ✓ Branch 8 → 10 taken 27142 times.	62807	ASAR_STRCMP_OPERATORS(==)
289	2/4 ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 5453 times. ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 5453 times.	10872	ASAR_STRCMP_OPERATORS(!=)
290	2/4 ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 2 times. ✗ Branch 8 → 9 not taken. ✓ Branch 8 → 10 taken 2 times.	4	ASAR_STRCMP_OPERATORS(<)
291		✗	ASAR_STRCMP_OPERATORS(<=)
292	2/4 ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 1 time. ✗ Branch 8 → 9 not taken. ✓ Branch 8 → 10 taken 1 time.	2	ASAR_STRCMP_OPERATORS(>)
293	2/4 ✗ Branch 6 → 7 not taken. ✓ Branch 6 → 8 taken 1 time. ✗ Branch 8 → 9 not taken. ✓ Branch 8 → 10 taken 1 time.	2	ASAR_STRCMP_OPERATORS(>=)
294			#undef ASAR_STRCMP_OPERATORS
295
296			template<>
297			struct std::hash<string> {
298		65347	size_t operator()(const ::string& s) const {
299		65347	return std::hash<std::string_view>()(std::string_view(s.data(), s.length()));
300			}
301			};
302
303			char * readfile(const char * fname, const char * basepath);
304			char * readfilenative(const char * fname);
305			bool readfile(const char * fname, const char * basepath, char ** data, int * len);//if you want an uchar*, cast it
306			char ** split(char * str, char key, int * len= nullptr);
307			char ** qsplit(char * str, char key, int * len= nullptr);
308			char ** qpsplit(char * str, char key, int * len= nullptr);
309			char ** qsplitstr(char * str, const char * key, int * len= nullptr);
310			bool confirmquotes(const char * str);
311			bool confirmqpar(const char * str);
312			char* strqpchr(char* str, char key);
313			char* strqpstr(char* str, const char* key);
314		1056	inline const char* strqpchr(const char* str, char key) { return strqpchr(const_cast<char*>(str), key); };
315		114	inline const char* strqpstr(const char* str, const char* key) { return strqpstr(const_cast<char*>(str), key); };
316
317		✗	inline string hex(unsigned int value)
318			{
319		✗	char buffer[64];
320			if(0);
321		✗	else if (value<=0x000000FF) snprintf(buffer, sizeof(buffer), "%.2X", value);
322		✗	else if (value<=0x0000FFFF) snprintf(buffer, sizeof(buffer), "%.4X", value);
323		✗	else if (value<=0x00FFFFFF) snprintf(buffer, sizeof(buffer), "%.6X", value);
324		✗	else snprintf(buffer, sizeof(buffer), "%.8X", value);
325		✗	return buffer;
326			}
327
328		2	inline string hex(unsigned int value, int width)
329			{
330		1	char buffer[64];
331	2/4 ✓ Branch 2 → 3 taken 1 time. ✗ Branch 2 → 7 not taken. ✗ Branch 3 → 4 not taken. ✓ Branch 3 → 5 taken 1 time.	2	snprintf(buffer, sizeof(buffer), "%.*X", width, value);
332	2/6 ✗ Branch 2 → 3 not taken. ✗ Branch 2 → 6 not taken. ✓ Branch 3 → 4 taken 1 time. ✗ Branch 3 → 7 not taken. ✓ Branch 5 → 6 taken 1 time. ✗ Branch 5 → 9 not taken.	4	return buffer;
333			}
334
335		3268	inline string dec(int64_t value)
336			{
337		1683	char buffer[64];
338	2/4 dec(long): ✗ Branch 3 → 4 not taken. ✓ Branch 3 → 5 taken 1683 times. dec(long long): ✓ Branch 2 → 3 taken 1585 times. ✗ Branch 2 → 7 not taken.	3268	snprintf(buffer, sizeof(buffer), "%" PRId64, value);
339	2/6 dec(long): ✗ Branch 2 → 3 not taken. ✗ Branch 2 → 6 not taken. ✓ Branch 5 → 6 taken 1683 times. ✗ Branch 5 → 9 not taken. dec(long long): ✓ Branch 3 → 4 taken 1585 times. ✗ Branch 3 → 7 not taken.	6536	return buffer;
340			}
341
342			// todo this function sucks, replace with std::to_chars
343		258	inline string ftostr(double value)
344			{
345			// randomdude999: With 100 digits of precision, the buffer needs to be approx. 311+100,
346			// but let's be safe here https://stackoverflow.com/questions/7235456
347		129	char rval[512];
348			// RPG Hacker: Ridiculously high precision, I know, but we're working with doubles
349			// here and can afford it, so no need to waste any precision
350	1/2 ✓ Branch 2 → 3 taken 129 times. ✗ Branch 2 → 13 not taken.	258	snprintf(rval, sizeof(rval), "%.100f", value);
351	1/5 ✗ Branch 2 → 3 not taken. ✗ Branch 2 → 8 not taken. ✓ Branch 3 → 4 taken 258 times. ✗ Branch 3 → 9 not taken. ✗ Branch 3 → 15 not taken.	258	if (strchr(rval, '.'))//nuke useless zeroes
352			{
353		258	char * end=strrchr(rval, '\0')-1;
354	4/6 ✗ Branch 5 → 4 not taken. ✗ Branch 5 → 6 not taken. ✓ Branch 6 → 5 taken 12726 times. ✓ Branch 6 → 7 taken 129 times. ✓ Branch 10 → 6 taken 12726 times. ✓ Branch 10 → 11 taken 129 times.	25710	while (*end=='0')
355			{
356		25452	*end='\0';
357		25452	end--;
358			}
359	4/6 ✗ Branch 6 → 7 not taken. ✗ Branch 6 → 8 not taken. ✓ Branch 7 → 8 taken 126 times. ✓ Branch 7 → 9 taken 3 times. ✓ Branch 12 → 13 taken 126 times. ✓ Branch 12 → 15 taken 3 times.	258	if (end=='.') end='\0';
360			}
361	2/6 ✗ Branch 8 → 9 not taken. ✗ Branch 8 → 12 not taken. ✓ Branch 9 → 10 taken 129 times. ✗ Branch 9 → 13 not taken. ✓ Branch 15 → 16 taken 129 times. ✗ Branch 15 → 19 not taken.	516	return rval;
362			}
363
364			// Same as above, but with variable precision
365		20	inline string ftostrvar(double value, int precision)
366			{
367		20	int clampedprecision = precision;
368	1/2 ✗ Branch 2 → 3 not taken. ✓ Branch 2 → 4 taken 20 times.	20	if (clampedprecision < 0) clampedprecision = 0;
369	1/2 ✗ Branch 4 → 5 not taken. ✓ Branch 4 → 6 taken 20 times.	20	if (clampedprecision > 100) clampedprecision = 100;
370
371			// see above
372		10	char rval[512];
373	1/2 ✓ Branch 6 → 7 taken 10 times. ✗ Branch 6 → 17 not taken.	20	snprintf(rval, sizeof(rval), "%.*f", clampedprecision, (double)value);
374	3/5 ✗ Branch 6 → 7 not taken. ✗ Branch 6 → 12 not taken. ✓ Branch 7 → 8 taken 18 times. ✓ Branch 7 → 13 taken 1 time. ✓ Branch 7 → 19 taken 1 time.	20	if (strchr(rval, '.'))//nuke useless zeroes
375			{
376		18	char * end = strrchr(rval, '\0') - 1;
377	4/6 ✗ Branch 9 → 8 not taken. ✗ Branch 9 → 10 not taken. ✓ Branch 10 → 9 taken 23 times. ✓ Branch 10 → 11 taken 9 times. ✓ Branch 14 → 10 taken 23 times. ✓ Branch 14 → 15 taken 9 times.	64	while (*end == '0')
378			{
379		46	*end = '\0';
380		46	end--;
381			}
382	4/6 ✗ Branch 10 → 11 not taken. ✗ Branch 10 → 12 not taken. ✓ Branch 11 → 12 taken 3 times. ✓ Branch 11 → 13 taken 6 times. ✓ Branch 16 → 17 taken 3 times. ✓ Branch 16 → 19 taken 6 times.	18	if (end == '.') end = '\0';
383			}
384	2/6 ✗ Branch 12 → 13 not taken. ✗ Branch 12 → 16 not taken. ✓ Branch 13 → 14 taken 10 times. ✗ Branch 13 → 17 not taken. ✓ Branch 19 → 20 taken 10 times. ✗ Branch 19 → 23 not taken.	40	return rval;
385			}
386
387		107227	inline bool stribegin(const char * str, const char * key)
388			{
389	4/4 ✓ Branch 8 → 3 taken 229427 times. ✓ Branch 8 → 9 taken 7428 times. ✓ Branch 14 → 3 taken 195727 times. ✓ Branch 14 → 15 taken 2444 times.	435026	for (int i=0;key[i];i++)
390			{
391	4/4 ✓ Branch 5 → 6 taken 45974 times. ✓ Branch 5 → 7 taken 183453 times. ✓ Branch 9 → 10 taken 51381 times. ✓ Branch 9 → 11 taken 144346 times.	425154	if (to_lower(str[i])!=to_lower(key[i])) return false;
392			}
393		9872	return true;
394			}
395
396			inline bool striend(const char * str, const char * key)
397			{
398			const char * keyend=strrchr(key, '\0');
399			const char * strend=strrchr(str, '\0');
400			if(keyend-key > strend-str) return false;
401
402			while (key!=keyend)
403			{
404			keyend--;
405			strend--;
406			if (to_lower(strend)!=to_lower(keyend)) return false;
407			}
408			return true;
409			}
410
411			inline bool stricmpwithupper(const char word1, const char word2)
412			{
413			while(*word2)
414			{
415			if(to_upper(word1++) != word2++) return true;
416			}
417			return *word1;
418			}
419
420		27622	inline bool stricmpwithlower(const char word1, const char word2)
421			{
422	4/4 ✓ Branch 7 → 3 taken 16043 times. ✓ Branch 7 → 8 taken 259 times. ✓ Branch 12 → 3 taken 16345 times. ✓ Branch 12 → 13 taken 261 times.	32908	while(*word2)
423			{
424	4/4 ✓ Branch 4 → 5 taken 13422 times. ✓ Branch 4 → 6 taken 2621 times. ✓ Branch 8 → 9 taken 13680 times. ✓ Branch 8 → 10 taken 2665 times.	32388	if(to_lower(word1++) != word2++) return true;
425			}
426		520	return *word1;
427			}
428
429			//function: return the string without quotes around it, if any exists
430			//if they don't exist, return it unaltered
431			//it is not guaranteed to return str
432			//it is not guaranteed to not edit str
433			//the input must be freed even though it's garbage, the output must not
434		11527	inline const char * dequote(char * str)
435			{
436	4/4 ✓ Branch 2 → 3 taken 372 times. ✓ Branch 2 → 4 taken 5378 times. ✓ Branch 3 → 4 taken 396 times. ✓ Branch 3 → 5 taken 5381 times.	11527	if (*str!='"') return str;
437	1/2 ✗ Branch 5 → 6 not taken. ✓ Branch 5 → 7 taken 5381 times.	10759	char *end = strrchr(str, '"');
438	2/4 ✓ Branch 4 → 5 taken 5378 times. ✗ Branch 4 → 11 not taken. ✓ Branch 7 → 8 taken 5381 times. ✗ Branch 7 → 29 not taken.	10759	if (end)
439			{
440			// make sure the closing quote is at the end of the argument
441	2/4 ✗ Branch 5 → 6 not taken. ✓ Branch 5 → 7 taken 5378 times. ✗ Branch 10 → 11 not taken. ✓ Branch 10 → 12 taken 5381 times.	10759	if(end[1] != 0) return nullptr;
442		10759	*end = 0;
443		10759	char *quote = str+1;
444	5/6 ✓ Branch 9 → 8 taken 72 times. ✓ Branch 9 → 10 taken 5378 times. ✗ Branch 24 → 25 not taken. ✓ Branch 24 → 26 taken 5453 times. ✓ Branch 26 → 15 taken 72 times. ✓ Branch 26 → 27 taken 5381 times.	10903	while((quote = strstr(quote, "\"\""))) {
445	3/6 ✗ Branch 15 → 16 not taken. ✓ Branch 15 → 17 taken 72 times. ✗ Branch 18 → 19 not taken. ✓ Branch 18 → 20 taken 72 times. ✗ Branch 20 → 21 not taken. ✓ Branch 20 → 22 taken 72 times.	144	memmove(quote, quote+1, strlen(quote));
446		144	quote++;
447			}
448		10759	return str + 1;
449			}
450		✗	return nullptr;
451			}
452
453		41936	inline char * strqchr(char * str, char key)
454			{
455	4/4 ✓ Branch 18 → 3 taken 122029 times. ✓ Branch 18 → 19 taken 3585 times. ✓ Branch 34 → 3 taken 123205 times. ✓ Branch 34 → 35 taken 3633 times.	252452	while (*str != '\0')
456			{
457	4/4 ✓ Branch 3 → 4 taken 17251 times. ✓ Branch 3 → 5 taken 104778 times. ✓ Branch 4 → 5 taken 17467 times. ✓ Branch 4 → 6 taken 105738 times.	245234	if (*str == key) { return str; }
458	8/8 ✓ Branch 5 → 6 taken 104583 times. ✓ Branch 5 → 7 taken 195 times. ✓ Branch 6 → 7 taken 213 times. ✓ Branch 6 → 17 taken 104370 times. ✓ Branch 7 → 8 taken 105543 times. ✓ Branch 7 → 10 taken 195 times. ✓ Branch 9 → 10 taken 213 times. ✓ Branch 9 → 31 taken 105330 times.	210516	else if (str == '"' \|\| str == '\'')
459			{
460			// Special case hack for ''', which is currently our official way of handling the ' character.
461			// Even though it really stinks.
462	10/12 ✓ Branch 7 → 8 taken 213 times. ✓ Branch 7 → 11 taken 195 times. ✓ Branch 8 → 9 taken 9 times. ✓ Branch 8 → 11 taken 204 times. ✓ Branch 9 → 10 taken 9 times. ✗ Branch 9 → 11 not taken. ✓ Branch 11 → 12 taken 213 times. ✓ Branch 11 → 20 taken 195 times. ✓ Branch 14 → 15 taken 9 times. ✓ Branch 14 → 20 taken 204 times. ✓ Branch 17 → 18 taken 9 times. ✗ Branch 17 → 20 not taken.	816	if (str[0] == '\'' && str[1] == '\'' && str[2] == '\'') { str += 2; }
463			else
464			{
465		798	char delimiter = *str;
466
467			do
468			{
469		3996	str++;
470
471			// If we want to support backslash escapes, we'll have to add that right here.
472	6/8 ✓ Branch 12 → 13 taken 1599 times. ✓ Branch 12 → 15 taken 399 times. ✓ Branch 13 → 14 taken 1599 times. ✗ Branch 13 → 15 not taken. ✓ Branch 24 → 25 taken 1599 times. ✓ Branch 24 → 28 taken 399 times. ✓ Branch 26 → 27 taken 1599 times. ✗ Branch 26 → 28 not taken.	3996	} while (str != delimiter && str != '\0');
473
474			// This feels like a superfluous check, but I can't really find a clean way to avoid it.
475	2/4 ✗ Branch 15 → 16 not taken. ✓ Branch 15 → 17 taken 399 times. ✗ Branch 29 → 30 not taken. ✓ Branch 29 → 31 taken 399 times.	798	if (*str == '\0') { return nullptr; }
476			}
477			}
478
479		210516	str++;
480			}
481
482		7218	return nullptr;
483			}
484
485		41324	inline const char * strqchr(const char * str, char key) {
486		41324	return strqchr(const_cast<char*>(str), key);
487			}
488
489		2580	inline string substr(const char * str, int len)
490			{
491		2580	return string(str, len);
492			}
493
494
495		44748	inline char strip_whitespace(char str)
496			{
497	4/4 ✓ Branch 5 → 3 taken 49 times. ✓ Branch 5 → 6 taken 22232 times. ✓ Branch 7 → 3 taken 56 times. ✓ Branch 7 → 8 taken 22516 times.	44853	while(is_space(*str)) str++;
498	5/6 ✗ Branch 8 → 9 not taken. ✓ Branch 8 → 10 taken 22516 times. ✓ Branch 11 → 7 taken 20983 times. ✓ Branch 11 → 12 taken 1299 times. ✓ Branch 19 → 11 taken 21261 times. ✓ Branch 19 → 20 taken 1313 times.	44856	for(int i = strlen(str) - 1; i >= 0; i--)
499			{
500	4/4 ✓ Branch 8 → 9 taken 20933 times. ✓ Branch 8 → 10 taken 50 times. ✓ Branch 14 → 15 taken 21203 times. ✓ Branch 14 → 18 taken 58 times.	42244	if(!is_space(str[i]))
501			{
502		42136	str[i + 1] = 0;
503		42136	return str;
504			}
505			}
506		2612	return str;
507			}
508		266	inline void strip_whitespace(string &str)
509			{
510	2/4 ✓ Branch 4 → 5 taken 126 times. ✗ Branch 4 → 8 not taken. ✓ Branch 6 → 7 taken 140 times. ✗ Branch 6 → 13 not taken.	266	str = string(strip_whitespace(str.temp_raw()));
511		266	}
512
513		41264	inline void grab_until_space(string& to, const char*& from) {
514			// i tried to use strchr here as an optimization, but it wasn't even faster....
515		41264	const char* params = strqchr(from, ' ');
516	4/4 ✓ Branch 3 → 4 taken 16930 times. ✓ Branch 3 → 6 taken 3570 times. ✓ Branch 4 → 5 taken 17146 times. ✓ Branch 4 → 12 taken 3618 times.	41264	if(params) {
517		34076	to.assign(from, params - from);
518		34076	from = params+1;
519			} else {
520		7188	to.assign(from);
521		7188	from += to.length(); // now from points at a null byte
522			}
523		41264	}
524
525			string &itrim(string &str, const char * left, const char * right);
526
527		110151	inline string &lower(string &old)
528			{
529		110151	int length = old.length();
530	4/4 ✓ Branch 8 → 4 taken 599713 times. ✓ Branch 8 → 9 taken 60338 times. ✓ Branch 15 → 5 taken 247908 times. ✓ Branch 15 → 16 taken 49813 times.	957772	for (int i=0;i<length;i++) old.raw()[i]=(char)to_lower(old.data()[i]);
531		110151	return old;
532			}
533
534

asar coverage - build #