GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: json_utils.cc Lines: 37 37 100.0 %
Date: 2022-05-22 04:15:48 Branches: 19 20 95.0 %

Line Branch Exec Source
1
#include "json_utils.h"
2
3
namespace node {
4
5
29188
std::string EscapeJsonChars(const std::string& str) {
6
  const std::string control_symbols[0x20] = {
7
      "\\u0000", "\\u0001", "\\u0002", "\\u0003", "\\u0004", "\\u0005",
8
      "\\u0006", "\\u0007", "\\b", "\\t", "\\n", "\\v", "\\f", "\\r",
9
      "\\u000e", "\\u000f", "\\u0010", "\\u0011", "\\u0012", "\\u0013",
10
      "\\u0014", "\\u0015", "\\u0016", "\\u0017", "\\u0018", "\\u0019",
11
      "\\u001a", "\\u001b", "\\u001c", "\\u001d", "\\u001e", "\\u001f"
12
992392
  };
13
14
29188
  std::string ret;
15
29188
  size_t last_pos = 0;
16
29188
  size_t pos = 0;
17
361910
  for (; pos < str.size(); ++pos) {
18
665444
    std::string replace;
19
332722
    char ch = str[pos];
20
332722
    if (ch == '\\') {
21
1
      replace = "\\\\";
22
332721
    } else if (ch == '\"') {
23
5
      replace = "\\\"";
24
    } else {
25
332716
      size_t num = static_cast<size_t>(ch);
26
332716
      if (num < 0x20) replace = control_symbols[num];
27
    }
28
332722
    if (!replace.empty()) {
29
72
      if (pos > last_pos) {
30
40
        ret += str.substr(last_pos, pos - last_pos);
31
      }
32
72
      last_pos = pos + 1;
33
72
      ret += replace;
34
    }
35
  }
36
  // Append any remaining symbols.
37
29188
  if (last_pos < str.size()) {
38
29097
    ret += str.substr(last_pos, pos - last_pos);
39
  }
40
29188
  return ret;
41
}
42
43
2
std::string Reindent(const std::string& str, int indent_depth) {
44
2
  if (indent_depth <= 0) return str;
45
4
  const std::string indent(indent_depth, ' ');
46
4
  std::string out;
47
2
  std::string::size_type pos = 0;
48
  for (;;) {
49
2482
    std::string::size_type prev_pos = pos;
50
2482
    pos = str.find('\n', pos);
51
52
2482
    out.append(indent);
53
54
2482
    if (pos == std::string::npos) {
55
2
      out.append(str, prev_pos, std::string::npos);
56
2
      break;
57
    } else {
58
2480
      pos++;
59
2480
      out.append(str, prev_pos, pos - prev_pos);
60
    }
61
2480
  }
62
63
2
  return out;
64
}
65
66
}  // namespace node