17589970077-2502

Committed 09 Sep 2025 05:00PM UTC coverage: 65.196% (-5.0%) from 70.225%

Build # 17589970077-2502

Build Type

push

github

Committed by

tstack

Commit Message

[format] add fields for source file/line

Knowing the source file/line context in a log
message can help find log messages when using
log2src.

Run Details

56 of 70 new or added lines in 2 files covered. (80.0%)

13954 existing lines in 210 files now uncovered.

45516 of 69814 relevant lines covered (65.2%)

404154.37 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

74.27

/src/base/string_util.cc

/**
 * Copyright (c) 2019, Timothy Stack
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 * * Neither the name of Timothy Stack nor the names of its contributors
 * may be used to endorse or promote products derived from this software
 * without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <algorithm>
#include <iterator>
#include <regex>
#include <sstream>
#include <string_view>

#include "string_util.hh"

#include "config.h"
#include "is_utf8.hh"
#include "lnav_log.hh"
#include "scn/scan.h"

using namespace std::string_view_literals;

void
scrub_to_utf8(char* buffer, size_t length)
{
    size_t index = 0;
    while (index < length) {
        auto start_index = index;
        auto ch_res = ww898::utf::utf8::read([buffer, &index, length]() {
            if (index < length) {
                return buffer[index++];
            }
            return '\x00';
        });
        if (ch_res.isErr()) {
            buffer[start_index] = '?';
        }
    }
}

void
quote_content(auto_buffer& buf, const string_fragment& sf, char quote_char)
{
    for (char ch : sf) {
        if (ch == quote_char) {
            buf.push_back('\\').push_back(ch);
            continue;
        }
        switch (ch) {
            case '\\':
                buf.push_back('\\').push_back('\\');
                break;
            case '\n':
                buf.push_back('\\').push_back('n');
                break;
            case '\t':
                buf.push_back('\\').push_back('t');
                break;
            case '\r':
                buf.push_back('\\').push_back('r');
                break;
            case '\a':
                buf.push_back('\\').push_back('a');
                break;
            case '\b':
                buf.push_back('\\').push_back('b');
                break;
            default:
                buf.push_back(ch);
                break;
        }
    }
}

size_t
unquote_content(char* dst, const char* str, size_t len, char quote_char)
{
    size_t index = 0;

    for (size_t lpc = 0; lpc < len; lpc++, index++) {
        dst[index] = str[lpc];
        if (str[lpc] == quote_char) {
            lpc += 1;
        } else if (str[lpc] == '\\' && (lpc + 1) < len) {
            switch (str[lpc + 1]) {
                case 'n':
                    dst[index] = '\n';
                    break;
                case 'r':
                    dst[index] = '\r';
                    break;
                case 't':
                    dst[index] = '\t';
                    break;
                default:
                    dst[index] = str[lpc + 1];
                    break;
            }
            lpc += 1;
        }
    }
    dst[index] = '\0';

    return index;
}

size_t
unquote(char* dst, const char* str, size_t len)
{
    if (str[0] == 'f' || str[0] == 'r' || str[0] == 'u' || str[0] == 'R'
        || str[0] == 'x' || str[0] == 'X')
    {
        str += 1;
        len -= 1;
    }
    char quote_char = str[0];

    require(str[0] == '\'' || str[0] == '"');

    return unquote_content(dst, &str[1], len - 2, quote_char);
}

size_t
unquote_w3c(char* dst, const char* str, size_t len)
{
    size_t index = 0;

    require(str[0] == '\'' || str[0] == '"');

    for (size_t lpc = 1; lpc < (len - 1); lpc++, index++) {
        dst[index] = str[lpc];
        if (str[lpc] == '"') {
            lpc += 1;
        }
    }
    dst[index] = '\0';

    return index;
}

void
truncate_to(std::string& str, size_t max_char_len)
{
    static const std::string ELLIPSIS = "\u22ef";

    if (str.length() < max_char_len) {
        return;
    }

    auto str_char_len_res = utf8_string_length(str);

    if (str_char_len_res.isErr()) {
        // XXX
        return;
    }

    auto str_char_len = str_char_len_res.unwrap();
    if (str_char_len <= max_char_len) {
        return;
    }

    if (max_char_len < 3) {
        str = ELLIPSIS;
        return;
    }

    auto chars_to_remove = (str_char_len - max_char_len) + 1;
    auto midpoint = str_char_len / 2;
    auto chars_to_keep_at_front = midpoint - (chars_to_remove / 2);
    auto bytes_to_keep_at_front
        = utf8_char_to_byte_index(str, chars_to_keep_at_front);
    auto remove_up_to_bytes = utf8_char_to_byte_index(
        str, chars_to_keep_at_front + chars_to_remove);
    auto bytes_to_remove = remove_up_to_bytes - bytes_to_keep_at_front;
    str.erase(bytes_to_keep_at_front, bytes_to_remove);
    str.insert(bytes_to_keep_at_front, ELLIPSIS);
}

ssize_t
utf8_char_to_byte_index(const std::string& str, ssize_t ch_index)
{
    ssize_t retval = 0;

    while (ch_index > 0) {
        auto ch_len
            = ww898::utf::utf8::char_size([&str, retval]() {
                  return std::make_pair(str[retval], str.length() - retval - 1);
              }).unwrapOr(1);

        retval += ch_len;
        ch_index -= 1;
    }

    return retval;
}

size_t
last_word_str(char* str, size_t len, size_t max_len)
{
    if (len < max_len) {
        return len;
    }

    size_t last_start = 0;

    for (size_t index = 0; index < len; index++) {
        switch (str[index]) {
            case '.':
            case '-':
            case '/':
            case ':':
                last_start = index + 1;
                break;
        }
    }

    if (last_start == 0) {
        return len;
    }

    memmove(&str[0], &str[last_start], len - last_start);
    return len - last_start;
}

size_t
abbreviate_str(char* str, size_t len, size_t max_len)
{
    size_t last_start = 1;

    if (len < max_len) {
        return len;
    }

    for (size_t index = 0; index < len; index++) {
        switch (str[index]) {
            case '.':
            case '-':
            case '/':
            case ':':
                memmove(&str[last_start], &str[index], len - index);
                len -= (index - last_start);
                index = last_start + 1;
                last_start = index + 1;

                if (len < max_len) {
                    return len;
                }
                break;
        }
    }

    return len;
}

void
split_ws(const std::string& str, std::vector<std::string>& toks_out)
{
    auto str_sf = string_fragment::from_str(str);

    while (true) {
        auto split_pair = str_sf.split_when(isspace);
        if (split_pair.first.empty()) {
            if (split_pair.second.empty()) {
                break;
            }
            str_sf = split_pair.second;
            continue;
        }

        toks_out.emplace_back(split_pair.first.to_string());
        str_sf = split_pair.second;
    }
}

std::string
repeat(const std::string& input, size_t num)
{
    std::ostringstream os;
    std::fill_n(std::ostream_iterator<std::string>(os), num, input);
    return os.str();
}

std::string
center_str(const std::string& subject, size_t width)
{
    std::string retval = subject;

    truncate_to(retval, width);

    auto retval_length = utf8_string_length(retval).unwrapOr(retval.length());
    auto total_fill = width - retval_length;
    auto before = total_fill / 2;
    auto after = total_fill - before;

    retval.insert(0, before, ' ');
    retval.append(after, ' ');

    return retval;
}

bool
is_blank(const std::string& str)
{
    return std::all_of(
        str.begin(), str.end(), [](const auto ch) { return isspace(ch); });
}

std::string
scrub_ws(const char* in, ssize_t len)
{
    static constexpr auto TAB_SYMBOL = "\u21e5"sv;
    static constexpr auto LF_SYMBOL = "\u240a"sv;
    static constexpr auto CR_SYMBOL = "\u240d"sv;

    std::string retval;

    if (len > 0) {
        retval.reserve(len);
    }

    for (ssize_t lpc = 0; (len == -1 && in[lpc]) || (len >= 0 && lpc < len);
         lpc++)
    {
        auto ch = in[lpc];

        switch (ch) {
            case '\t':
                retval.append(TAB_SYMBOL);
                break;
            case '\n':
                retval.append(LF_SYMBOL);
                break;
            case '\r':
                retval.append(CR_SYMBOL);
                break;
            default:
                retval.push_back(ch);
                break;
        }
    }

    return retval;
}

static constexpr const char* const SUPERSCRIPT_NUMS[] = {
    "⁰",
    "¹",
    "²",
    "³",
    "⁴",
    "⁵",
    "⁶",
    "⁷",
    "⁸",
    "⁹",
};

std::string
to_superscript(const std::string& in)
{
    std::string retval;
    for (const auto ch : in) {
        if (isdigit(ch)) {
            auto index = ch - '0';

            retval.append(SUPERSCRIPT_NUMS[index]);
        } else {
            retval.push_back(ch);
        }
    }

    return retval;
}

namespace fmt {
auto
formatter<lnav::tainted_string>::format(const lnav::tainted_string& ts,
                                        format_context& ctx)
    -> decltype(ctx.out()) const
{
    auto esc_res = fmt::v10::detail::find_escape(&(*ts.ts_str.begin()),
                                                 &(*ts.ts_str.end()));
    if (esc_res.end == nullptr) {
        return formatter<string_view>::format(ts.ts_str, ctx);
    }

    return format_to(ctx.out(), FMT_STRING("{:?}"), ts.ts_str);
}
}  // namespace fmt

namespace lnav::pcre2pp {

static bool
is_meta(char ch)
{
    switch (ch) {
        case '\\':
        case '^':
        case '$':
        case '.':
        case '[':
        case ']':
        case '(':
        case ')':
        case '*':
        case '+':
        case '?':
        case '{':
        case '}':
            return true;
        default:
            return false;
    }
}

static std::optional<const char*>
char_escape_seq(char ch)
{
    switch (ch) {
        case '\t':
            return "\\t";
        case '\n':
            return "\\n";
        default:
            return std::nullopt;
    }
}

std::string
quote(string_fragment str)
{
    std::string retval;

    while (true) {
        auto cp_pair_opt = str.consume_codepoint();
        if (!cp_pair_opt) {
            break;
        }

        auto cp_pair = cp_pair_opt.value();
        if ((cp_pair.first & ~0xff) == 0) {
            if (is_meta(cp_pair.first)) {
                retval.push_back('\\');
            } else {
                auto esc_seq = char_escape_seq(cp_pair.first);
                if (esc_seq) {
                    retval.append(esc_seq.value());
                    str = cp_pair_opt->second;
                    continue;
                }
            }
        }
        ww898::utf::utf8::write(cp_pair.first,
                                [&retval](char ch) { retval.push_back(ch); });
        str = cp_pair_opt->second;
    }

    return retval;
}

}  // namespace lnav::pcre2pp

1	/**
2	* Copyright (c) 2019, Timothy Stack
3	*
4	* All rights reserved.
5	*
6	* Redistribution and use in source and binary forms, with or without
7	* modification, are permitted provided that the following conditions are met:
8	*
9	* * Redistributions of source code must retain the above copyright notice, this
10	* list of conditions and the following disclaimer.
11	* * Redistributions in binary form must reproduce the above copyright notice,
12	* this list of conditions and the following disclaimer in the documentation
13	* and/or other materials provided with the distribution.
14	* * Neither the name of Timothy Stack nor the names of its contributors
15	* may be used to endorse or promote products derived from this software
16	* without specific prior written permission.
17	*
18	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ''AS IS'' AND ANY
19	* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
20	* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21	* DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
22	* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
23	* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
24	* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
25	* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
27	* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28	*/
29
30	#include <algorithm>
31	#include <iterator>
32	#include <regex>
33	#include <sstream>
34	#include <string_view>
35
36	#include "string_util.hh"
37
38	#include "config.h"
39	#include "is_utf8.hh"
40	#include "lnav_log.hh"
41	#include "scn/scan.h"
42
43	using namespace std::string_view_literals;
44
45	void
46	scrub_to_utf8(char* buffer, size_t length)	7✔
47	{
48	size_t index = 0;	7✔
49	while (index < length) {	103✔
50	auto start_index = index;	96✔
UNCOV 51	auto ch_res = ww898::utf::utf8::read([buffer, &index, length]() {	×
52	if (index < length) {	98✔
53	return buffer[index++];	98✔
54	}
UNCOV 55	return '\x00';	×
56	});	96✔
57	if (ch_res.isErr()) {	96✔
58	buffer[start_index] = '?';	6✔
59	}
60	}	96✔
61	}	7✔
62
63	void
UNCOV 64	quote_content(auto_buffer& buf, const string_fragment& sf, char quote_char)	×
65	{
66	for (char ch : sf) {	×
67	if (ch == quote_char) {	×
68	buf.push_back('\\').push_back(ch);	×
69	continue;	×
70	}
71	switch (ch) {	×
72	case '\\':	×
73	buf.push_back('\\').push_back('\\');	×
74	break;	×
75	case '\n':	×
76	buf.push_back('\\').push_back('n');	×
77	break;	×
78	case '\t':	×
79	buf.push_back('\\').push_back('t');	×
80	break;	×
81	case '\r':	×
82	buf.push_back('\\').push_back('r');	×
83	break;	×
84	case '\a':	×
85	buf.push_back('\\').push_back('a');	×
86	break;	×
UNCOV 87	case '\b':	×
UNCOV 88	buf.push_back('\\').push_back('b');	×
UNCOV 89	break;	×
UNCOV 90	default:	×
UNCOV 91	buf.push_back(ch);	×
UNCOV 92	break;	×
93	}
94	}
95	}
96
97	size_t
98	unquote_content(char* dst, const char* str, size_t len, char quote_char)	174✔
99	{
100	size_t index = 0;	174✔
101
102	for (size_t lpc = 0; lpc < len; lpc++, index++) {	7,395✔
103	dst[index] = str[lpc];	7,221✔
104	if (str[lpc] == quote_char) {	7,221✔
105	lpc += 1;	62✔
106	} else if (str[lpc] == '\\' && (lpc + 1) < len) {	7,159✔
107	switch (str[lpc + 1]) {	111✔
108	case 'n':	6✔
109	dst[index] = '\n';	6✔
110	break;	6✔
UNCOV 111	case 'r':	×
UNCOV 112	dst[index] = '\r';	×
UNCOV 113	break;	×
UNCOV 114	case 't':	×
UNCOV 115	dst[index] = '\t';	×
UNCOV 116	break;	×
117	default:	105✔
118	dst[index] = str[lpc + 1];	105✔
119	break;	105✔
120	}
121	lpc += 1;	111✔
122	}
123	}
124	dst[index] = '\0';	174✔
125
126	return index;	174✔
127	}
128
129	size_t
130	unquote(char* dst, const char* str, size_t len)	171✔
131	{
132	if (str[0] == 'f' \|\| str[0] == 'r' \|\| str[0] == 'u' \|\| str[0] == 'R'	171✔
133	\|\| str[0] == 'x' \|\| str[0] == 'X')	170✔
134	{
135	str += 1;	1✔
136	len -= 1;	1✔
137	}
138	char quote_char = str[0];	171✔
139
140	require(str[0] == '\'' \|\| str[0] == '"');	171✔
141
142	return unquote_content(dst, &str[1], len - 2, quote_char);	171✔
143	}
144
145	size_t
146	unquote_w3c(char* dst, const char* str, size_t len)	7✔
147	{
148	size_t index = 0;	7✔
149
150	require(str[0] == '\'' \|\| str[0] == '"');	7✔
151
152	for (size_t lpc = 1; lpc < (len - 1); lpc++, index++) {	514✔
153	dst[index] = str[lpc];	507✔
154	if (str[lpc] == '"') {	507✔
UNCOV 155	lpc += 1;	×
156	}
157	}
158	dst[index] = '\0';	7✔
159
160	return index;	7✔
161	}
162
163	void
164	truncate_to(std::string& str, size_t max_char_len)	1,263✔
165	{
166	static const std::string ELLIPSIS = "\u22ef";	1,475✔
167
168	if (str.length() < max_char_len) {	1,263✔
169	return;	1,248✔
170	}
171
172	auto str_char_len_res = utf8_string_length(str);	29✔
173
174	if (str_char_len_res.isErr()) {	29✔
175	// XXX
UNCOV 176	return;	×
177	}
178
179	auto str_char_len = str_char_len_res.unwrap();	29✔
180	if (str_char_len <= max_char_len) {	29✔
181	return;	12✔
182	}
183
184	if (max_char_len < 3) {	17✔
185	str = ELLIPSIS;	2✔
186	return;	2✔
187	}
188
189	auto chars_to_remove = (str_char_len - max_char_len) + 1;	15✔
190	auto midpoint = str_char_len / 2;	15✔
191	auto chars_to_keep_at_front = midpoint - (chars_to_remove / 2);	15✔
192	auto bytes_to_keep_at_front
193	= utf8_char_to_byte_index(str, chars_to_keep_at_front);	15✔
194	auto remove_up_to_bytes = utf8_char_to_byte_index(	30✔
195	str, chars_to_keep_at_front + chars_to_remove);	15✔
196	auto bytes_to_remove = remove_up_to_bytes - bytes_to_keep_at_front;	15✔
197	str.erase(bytes_to_keep_at_front, bytes_to_remove);	15✔
198	str.insert(bytes_to_keep_at_front, ELLIPSIS);	15✔
199	}	29✔
200
201	ssize_t
202	utf8_char_to_byte_index(const std::string& str, ssize_t ch_index)	270✔
203	{
204	ssize_t retval = 0;	270✔
205
206	while (ch_index > 0) {	12,081✔
207	auto ch_len
208	= ww898::utf::utf8::char_size([&str, retval]() {	11,811✔
209	return std::make_pair(str[retval], str.length() - retval - 1);	11,811✔
210	}).unwrapOr(1);	11,811✔
211
212	retval += ch_len;	11,811✔
213	ch_index -= 1;	11,811✔
214	}
215
216	return retval;	270✔
217	}
218
219	size_t
220	last_word_str(char* str, size_t len, size_t max_len)	2✔
221	{
222	if (len < max_len) {	2✔
UNCOV 223	return len;	×
224	}
225
226	size_t last_start = 0;	2✔
227
228	for (size_t index = 0; index < len; index++) {	27✔
229	switch (str[index]) {	25✔
230	case '.':	2✔
231	case '-':
232	case '/':
233	case ':':
234	last_start = index + 1;	2✔
235	break;	2✔
236	}
237	}
238
239	if (last_start == 0) {	2✔
240	return len;	1✔
241	}
242
243	memmove(&str[0], &str[last_start], len - last_start);	1✔
244	return len - last_start;	1✔
245	}
246
247	size_t
248	abbreviate_str(char* str, size_t len, size_t max_len)	141✔
249	{
250	size_t last_start = 1;	141✔
251
252	if (len < max_len) {	141✔
253	return len;	1✔
254	}
255
256	for (size_t index = 0; index < len; index++) {	1,632✔
257	switch (str[index]) {	1,603✔
258	case '.':	279✔
259	case '-':
260	case '/':
261	case ':':
262	memmove(&str[last_start], &str[index], len - index);	279✔
263	len -= (index - last_start);	279✔
264	index = last_start + 1;	279✔
265	last_start = index + 1;	279✔
266
267	if (len < max_len) {	279✔
268	return len;	111✔
269	}
270	break;	168✔
271	}
272	}
273
274	return len;	29✔
275	}
276
277	void
278	split_ws(const std::string& str, std::vector<std::string>& toks_out)	677✔
279	{
280	auto str_sf = string_fragment::from_str(str);	677✔
281
282	while (true) {
283	auto split_pair = str_sf.split_when(isspace);	2,674✔
284	if (split_pair.first.empty()) {	2,674✔
285	if (split_pair.second.empty()) {	856✔
286	break;	677✔
287	}
288	str_sf = split_pair.second;	179✔
289	continue;	179✔
290	}
291
292	toks_out.emplace_back(split_pair.first.to_string());	1,818✔
293	str_sf = split_pair.second;	1,818✔
294	}	1,997✔
295	}	677✔
296
297	std::string
298	repeat(const std::string& input, size_t num)	1,118✔
299	{
300	std::ostringstream os;	1,118✔
301	std::fill_n(std::ostream_iterator<std::string>(os), num, input);	1,118✔
302	return os.str();	2,236✔
303	}	1,118✔
304
305	std::string
306	center_str(const std::string& subject, size_t width)	36✔
307	{
308	std::string retval = subject;	36✔
309
310	truncate_to(retval, width);	36✔
311
312	auto retval_length = utf8_string_length(retval).unwrapOr(retval.length());	36✔
313	auto total_fill = width - retval_length;	36✔
314	auto before = total_fill / 2;	36✔
315	auto after = total_fill - before;	36✔
316
317	retval.insert(0, before, ' ');	36✔
318	retval.append(after, ' ');	36✔
319
320	return retval;	36✔
UNCOV 321	}	×
322
323	bool
324	is_blank(const std::string& str)	3,539✔
325	{
326	return std::all_of(	3,539✔
327	str.begin(), str.end(), [](const auto ch) { return isspace(ch); });	7,241✔
328	}
329
330	std::string
331	scrub_ws(const char* in, ssize_t len)	24✔
332	{
333	static constexpr auto TAB_SYMBOL = "\u21e5"sv;
334	static constexpr auto LF_SYMBOL = "\u240a"sv;
335	static constexpr auto CR_SYMBOL = "\u240d"sv;
336
337	std::string retval;	24✔
338
339	if (len > 0) {	24✔
340	retval.reserve(len);	8✔
341	}
342
343	for (ssize_t lpc = 0; (len == -1 && in[lpc]) \|\| (len >= 0 && lpc < len);	623✔
344	lpc++)
345	{
346	auto ch = in[lpc];	599✔
347
348	switch (ch) {	599✔
UNCOV 349	case '\t':	×
UNCOV 350	retval.append(TAB_SYMBOL);	×
UNCOV 351	break;	×
352	case '\n':	14✔
353	retval.append(LF_SYMBOL);	14✔
354	break;	14✔
UNCOV 355	case '\r':	×
UNCOV 356	retval.append(CR_SYMBOL);	×
UNCOV 357	break;	×
358	default:	585✔
359	retval.push_back(ch);	585✔
360	break;	585✔
361	}
362	}
363
364	return retval;	24✔
UNCOV 365	}	×
366
367	static constexpr const char* const SUPERSCRIPT_NUMS[] = {
368	"⁰",
369	"¹",
370	"²",
371	"³",
372	"⁴",
373	"⁵",
374	"⁶",
375	"⁷",
376	"⁸",
377	"⁹",
378	};
379
380	std::string
381	to_superscript(const std::string& in)	283✔
382	{
383	std::string retval;	283✔
384	for (const auto ch : in) {	573✔
385	if (isdigit(ch)) {	290✔
386	auto index = ch - '0';	290✔
387
388	retval.append(SUPERSCRIPT_NUMS[index]);	290✔
389	} else {
UNCOV 390	retval.push_back(ch);	×
391	}
392	}
393
394	return retval;	283✔
UNCOV 395	}	×
396
397	namespace fmt {
398	auto
UNCOV 399	formatter<lnav::tainted_string>::format(const lnav::tainted_string& ts,	×
400	format_context& ctx)
401	-> decltype(ctx.out()) const
402	{
UNCOV 403	auto esc_res = fmt::v10::detail::find_escape(&(*ts.ts_str.begin()),	×
UNCOV 404	&(*ts.ts_str.end()));	×
UNCOV 405	if (esc_res.end == nullptr) {	×
UNCOV 406	return formatter<string_view>::format(ts.ts_str, ctx);	×
407	}
408
UNCOV 409	return format_to(ctx.out(), FMT_STRING("{:?}"), ts.ts_str);	×
410	}
411	} // namespace fmt
412
413	namespace lnav::pcre2pp {
414
415	static bool
416	is_meta(char ch)	3,256,069✔
417	{
418	switch (ch) {	3,256,069✔
419	case '\\':	6,546✔
420	case '^':
421	case '$':
422	case '.':
423	case '[':
424	case ']':
425	case '(':
426	case ')':
427	case '*':
428	case '+':
429	case '?':
430	case '{':
431	case '}':
432	return true;	6,546✔
433	default:	3,249,523✔
434	return false;	3,249,523✔
435	}
436	}
437
438	static std::optional<const char*>
439	char_escape_seq(char ch)	3,249,523✔
440	{
441	switch (ch) {	3,249,523✔
442	case '\t':	×
443	return "\\t";	×
UNCOV 444	case '\n':	×
UNCOV 445	return "\\n";	×
446	default:	3,249,523✔
447	return std::nullopt;	3,249,523✔
448	}
449	}
450
451	std::string
452	quote(string_fragment str)	386,568✔
453	{
454	std::string retval;	386,568✔
455
456	while (true) {
457	auto cp_pair_opt = str.consume_codepoint();	3,642,637✔
458	if (!cp_pair_opt) {	3,642,637✔
459	break;	386,568✔
460	}
461
462	auto cp_pair = cp_pair_opt.value();	3,256,069✔
463	if ((cp_pair.first & ~0xff) == 0) {	3,256,069✔
464	if (is_meta(cp_pair.first)) {	3,256,069✔
465	retval.push_back('\\');	6,546✔
466	} else {
467	auto esc_seq = char_escape_seq(cp_pair.first);	3,249,523✔
468	if (esc_seq) {	3,249,523✔
UNCOV 469	retval.append(esc_seq.value());	×
UNCOV 470	str = cp_pair_opt->second;	×
UNCOV 471	continue;	×
472	}
473	}
474	}
475	ww898::utf::utf8::write(cp_pair.first,	3,256,069✔
476	[&retval](char ch) { retval.push_back(ch); });	6,512,138✔
477	str = cp_pair_opt->second;	3,256,069✔
478	}	3,256,069✔
479
480	return retval;	386,568✔
UNCOV 481	}	×
482
483	} // namespace lnav::pcre2pp

tstack / lnav / 17589970077-2502

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous