asar coverage - build #

src/asar/
Coverage:
low: ≥ 0%
medium: ≥ 75.0%
high: ≥ 90.0%
Lines:
215 of 228, 0 excluded
94.3%
Functions:
10 of 10, 0 excluded
100.0%
Branches:
618 of 1105, 0 excluded
55.9%
math_parse.cpp
Line Branch Exec Source
1 #include "asar.h"
2 #include "assembleblock.h"
3 #include "asar_math.h"
4 #include "table.h"
5 #include "unicode.h"
6 #include <cmath>
7
8 #include "math_ast.h"
9
10
11 bool foundlabel;
12 // WARNING: this flag is only correctly set in pass 0, as forward labels are
13 // always non-static but we don't know when we hit forward-labels past pass 0
14 bool foundlabel_static;
15 // only set in pass 0
16 bool forwardlabel;
17
18
19 std::unordered_map<string, math_user_function> user_functions;
20
21 // we don't need this struct to be exported
22 namespace {
23 // data necessary for parsing an expression, which might be an user function declaration
24 struct parse_context {
25 const char*& str;
26 // this map is empty unless declaring a function,
27 // in which case it maps argument name to argument index
28 const std::unordered_map<string, size_t> function_arg_names;
29 // these are methods to allow easier access to `str`
30 owned_node parse_atom();
31 owned_node parse_unops();
32 owned_node parse_binops(int depth = 0);
33 owned_node parse();
34 };
35 }
36
37
38 static const long hextable[] = {
39 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
40 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
41 -1,-1, 0,1,2,3,4,5,6,7,8,9,-1,-1,-1,-1,-1,-1,-1,10,11,12,13,14,15,-1,
42 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
43 -1,-1,10,11,12,13,14,15,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
44 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
45 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
46 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
47 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
48 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
49 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1
50 };
51
52 // "atom" = literal, parenthesized expression, or label reference
53 20685 owned_node parse_context::parse_atom() {
54
4/4
✓ Branch 2 → 3 taken 3197 times.
✓ Branch 2 → 15 taken 7075 times.
✓ Branch 5 → 6 taken 3284 times.
✓ Branch 5 → 54 taken 7129 times.
 20685 if(*str == '$') {
55
2/9
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 3197 times.
✗ Branch 5 → 6 not taken.
✗ Branch 5 → 262 not taken.
✗ Branch 5 → 263 not taken.
✗ Branch 13 → 14 not taken.
✓ Branch 13 → 17 taken 3284 times.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 644 not taken.
 6481 if (!is_xdigit(*++str)) throw_err_block(2, err_invalid_hex_value);
56 6481 const char* start = str;
57 6481 int64_t ret = 0; // todo error on overflow?
58
4/4
✓ Branch 10 → 9 taken 10397 times.
✓ Branch 10 → 11 taken 3197 times.
✓ Branch 41 → 21 taken 10733 times.
✓ Branch 41 → 42 taken 3284 times.
 27611 while (hextable[0 + *str] >= 0) {
59
1/2
✗ Branch 21 → 22 not taken.
✓ Branch 21 → 23 taken 10733 times.
 21130 ret = (ret << 4) | hextable[0 + *str++];
60 }
61 6481 int len = str - start;
62 6481 int len_bytes = (len+1)/2;
63
2/5
✓ Branch 11 → 12 taken 3197 times.
✗ Branch 11 → 261 not taken.
✗ Branch 11 → 262 not taken.
✓ Branch 47 → 48 taken 3284 times.
✗ Branch 47 → 642 not taken.
 6481 return std::make_unique<math_ast_literal>(ret, len_bytes);
64 }
65
16/16
✓ Branch 16 → 17 taken 6003 times.
✓ Branch 16 → 19 taken 1072 times.
✓ Branch 17 → 18 taken 5820 times.
✓ Branch 17 → 19 taken 183 times.
✓ Branch 18 → 19 taken 7 times.
✓ Branch 18 → 20 taken 5813 times.
✓ Branch 21 → 22 taken 1262 times.
✓ Branch 21 → 153 taken 5813 times.
✓ Branch 58 → 59 taken 6050 times.
✓ Branch 58 → 67 taken 1079 times.
✓ Branch 62 → 63 taken 5867 times.
✓ Branch 62 → 67 taken 183 times.
✓ Branch 66 → 67 taken 7 times.
✓ Branch 66 → 68 taken 5860 times.
✓ Branch 69 → 70 taken 1269 times.
✓ Branch 69 → 375 taken 5860 times.
 14204 if (is_ualpha(*str) || *str=='.' || *str=='?') {
66 2531 const char * start=str;
67
16/16
✓ Branch 25 → 26 taken 1901 times.
✓ Branch 25 → 28 taken 8024 times.
✓ Branch 26 → 27 taken 1269 times.
✓ Branch 26 → 28 taken 632 times.
✓ Branch 27 → 28 taken 7 times.
✓ Branch 27 → 29 taken 1262 times.
✓ Branch 30 → 23 taken 8663 times.
✓ Branch 30 → 31 taken 1262 times.
✓ Branch 83 → 84 taken 1908 times.
✓ Branch 83 → 92 taken 8055 times.
✓ Branch 87 → 88 taken 1276 times.
✓ Branch 87 → 92 taken 632 times.
✓ Branch 91 → 92 taken 7 times.
✓ Branch 91 → 93 taken 1269 times.
✓ Branch 94 → 74 taken 8694 times.
✓ Branch 94 → 95 taken 1269 times.
 19888 while (is_ualnum(*str) || *str == '.' || *str == '?') str++;
68 2531 int len=(int)(str-start);
69
4/4
✓ Branch 33 → 32 taken 40 times.
✓ Branch 33 → 34 taken 1262 times.
✓ Branch 106 → 98 taken 40 times.
✓ Branch 106 → 107 taken 1269 times.
 2611 while (*str==' ') str++;
70
4/4
✓ Branch 34 → 35 taken 475 times.
✓ Branch 34 → 81 taken 787 times.
✓ Branch 110 → 111 taken 480 times.
✓ Branch 110 → 206 taken 789 times.
 2531 if (*str=='(') {
71 955 str++;
72 955 string func_name;
73
2/5
✓ Branch 36 → 37 taken 475 times.
✗ Branch 36 → 270 not taken.
✗ Branch 36 → 271 not taken.
✓ Branch 117 → 118 taken 480 times.
✗ Branch 117 → 657 not taken.
 955 func_name.assign(start, len);
74 955 std::vector<owned_node> arguments;
75
4/4
✓ Branch 53 → 39 taken 597 times.
✓ Branch 53 → 54 taken 475 times.
✓ Branch 161 → 121 taken 602 times.
✓ Branch 161 → 162 taken 480 times.
 3109 while(*str != ')') {
76
4/4
✓ Branch 41 → 40 taken 1 time.
✓ Branch 41 → 42 taken 597 times.
✓ Branch 130 → 122 taken 1 time.
✓ Branch 130 → 131 taken 602 times.
 1201 while (*str==' ') str++;
77
4/10
✓ Branch 42 → 43 taken 597 times.
✗ Branch 42 → 265 not taken.
✗ Branch 42 → 266 not taken.
✓ Branch 43 → 44 taken 597 times.
✗ Branch 43 → 263 not taken.
✗ Branch 43 → 264 not taken.
✓ Branch 132 → 133 taken 602 times.
✗ Branch 132 → 649 not taken.
✓ Branch 134 → 135 taken 602 times.
✗ Branch 134 → 647 not taken.
 1199 arguments.emplace_back(parse_binops());
78 // is "invalid number" good here?
79
6/13
✓ Branch 45 → 46 taken 455 times.
✓ Branch 45 → 50 taken 142 times.
✗ Branch 46 → 47 not taken.
✓ Branch 46 → 50 taken 455 times.
✗ Branch 47 → 48 not taken.
✗ Branch 47 → 268 not taken.
✗ Branch 47 → 269 not taken.
✓ Branch 140 → 141 taken 460 times.
✓ Branch 140 → 148 taken 142 times.
✗ Branch 144 → 145 not taken.
✓ Branch 144 → 148 taken 460 times.
✗ Branch 145 → 146 not taken.
✗ Branch 145 → 655 not taken.
 1199 if(*str != ',' && *str != ')') throw_err_block(2, err_invalid_number);
80
4/4
✓ Branch 50 → 51 taken 142 times.
✓ Branch 50 → 53 taken 455 times.
✓ Branch 151 → 152 taken 142 times.
✓ Branch 151 → 158 taken 460 times.
 1199 if(*str == ',') str++;
81 }
82 955 str++;
83 // ternary is basically just a function called "?"
84
4/4
✓ Branch 55 → 56 taken 4 times.
✓ Branch 55 → 72 taken 471 times.
✓ Branch 167 → 168 taken 4 times.
✓ Branch 167 → 192 taken 476 times.
 955 if(func_name == "?") {
85
2/4
✗ Branch 57 → 58 not taken.
✓ Branch 57 → 62 taken 4 times.
✗ Branch 169 → 170 not taken.
✓ Branch 169 → 174 taken 4 times.
 8 if(arguments.size() != 3) {
86 ✗ throw_err_block(2, err_argument_count, 3, (int)arguments.size());
87 }
88
2/5
✓ Branch 68 → 69 taken 4 times.
✗ Branch 68 → 266 not taken.
✗ Branch 68 → 267 not taken.
✓ Branch 187 → 188 taken 4 times.
✗ Branch 187 → 651 not taken.
 28 return std::make_unique<math_ast_ternary_cond>(
89 8 std::move(arguments[0]),
90 8 std::move(arguments[1]),
91 16 std::move(arguments[2]));
92 }
93
2/5
✓ Branch 74 → 75 taken 471 times.
✗ Branch 74 → 267 not taken.
✗ Branch 74 → 268 not taken.
✓ Branch 197 → 198 taken 476 times.
✗ Branch 197 → 653 not taken.
 947 return std::make_unique<math_ast_function_call>(std::move(arguments), std::move(func_name));
94 955 } else {
95
2/5
✓ Branch 81 → 82 taken 787 times.
✗ Branch 81 → 304 not taken.
✗ Branch 81 → 305 not taken.
✓ Branch 207 → 208 taken 789 times.
✗ Branch 207 → 709 not taken.
 1576 string name_part(start, len);
96
4/4
✓ Branch 83 → 84 taken 176 times.
✓ Branch 83 → 92 taken 611 times.
✓ Branch 209 → 210 taken 176 times.
✓ Branch 209 → 225 taken 613 times.
 1576 if(name_part == "...") {
97 // a tiny bit ugly, but whatever
98
6/15
✓ Branch 84 → 85 taken 176 times.
✗ Branch 84 → 277 not taken.
✗ Branch 84 → 278 not taken.
✓ Branch 85 → 86 taken 176 times.
✗ Branch 85 → 275 not taken.
✗ Branch 85 → 276 not taken.
✓ Branch 86 → 87 taken 176 times.
✗ Branch 86 → 273 not taken.
✗ Branch 86 → 274 not taken.
✓ Branch 213 → 214 taken 176 times.
✗ Branch 213 → 666 not taken.
✓ Branch 214 → 215 taken 176 times.
✗ Branch 214 → 664 not taken.
✓ Branch 216 → 217 taken 176 times.
✗ Branch 216 → 662 not taken.
 352 return std::make_unique<math_ast_literal>(math_val::make_identifier(name_part));
99 }
100
4/4
✓ Branch 93 → 94 taken 27 times.
✓ Branch 93 → 104 taken 584 times.
✓ Branch 231 → 232 taken 27 times.
✓ Branch 231 → 264 taken 586 times.
 1224 if(!function_arg_names.empty()) {
101
2/5
✓ Branch 94 → 95 taken 27 times.
✗ Branch 94 → 281 not taken.
✗ Branch 94 → 282 not taken.
✓ Branch 238 → 239 taken 27 times.
✗ Branch 238 → 674 not taken.
 54 auto it = function_arg_names.find(name_part);
102
2/4
✓ Branch 97 → 98 taken 27 times.
✗ Branch 97 → 103 not taken.
✓ Branch 249 → 250 taken 27 times.
✗ Branch 249 → 261 not taken.
 54 if(it != function_arg_names.end()) {
103
2/5
✓ Branch 99 → 100 taken 27 times.
✗ Branch 99 → 280 not taken.
✗ Branch 99 → 281 not taken.
✓ Branch 255 → 256 taken 27 times.
✗ Branch 255 → 672 not taken.
 54 return std::make_unique<math_ast_function_argument>(it->second);
104 }
105 }
106
2/5
✓ Branch 104 → 105 taken 584 times.
✗ Branch 104 → 302 not taken.
✗ Branch 104 → 303 not taken.
✓ Branch 265 → 266 taken 586 times.
✗ Branch 265 → 707 not taken.
 1170 string name = labelname(&start);
107 1170 str = start;
108
4/4
✓ Branch 105 → 106 taken 25 times.
✓ Branch 105 → 144 taken 559 times.
✓ Branch 271 → 272 taken 25 times.
✓ Branch 271 → 362 taken 561 times.
 1170 if(*str == '[') {
109 // struct array indexing
110 50 str++;
111
2/5
✓ Branch 106 → 107 taken 25 times.
✗ Branch 106 → 298 not taken.
✗ Branch 106 → 299 not taken.
✓ Branch 277 → 278 taken 25 times.
✗ Branch 277 → 694 not taken.
 50 auto index = parse_binops();
112
2/9
✗ Branch 107 → 108 not taken.
✓ Branch 107 → 111 taken 25 times.
✗ Branch 108 → 109 not taken.
✗ Branch 108 → 296 not taken.
✗ Branch 108 → 297 not taken.
✗ Branch 281 → 282 not taken.
✓ Branch 281 → 285 taken 25 times.
✗ Branch 282 → 283 not taken.
✗ Branch 282 → 692 not taken.
 50 if(*str != ']') throw_err_block(2, err_invalid_label_missing_closer);
113 50 str++;
114
2/5
✓ Branch 111 → 112 taken 25 times.
✗ Branch 111 → 296 not taken.
✗ Branch 111 → 297 not taken.
✓ Branch 290 → 291 taken 25 times.
✗ Branch 290 → 692 not taken.
 50 string subname = name;
115
4/4
✓ Branch 112 → 113 taken 24 times.
✓ Branch 112 → 121 taken 1 time.
✓ Branch 294 → 295 taken 24 times.
✓ Branch 294 → 314 taken 1 time.
 50 if(*str == '.') {
116 // this part used to be in labelname... not sure where it really belongs....
117
12/12
✓ Branch 116 → 117 taken 48 times.
✓ Branch 116 → 118 taken 96 times.
✓ Branch 117 → 118 taken 24 times.
✓ Branch 117 → 119 taken 24 times.
✓ Branch 120 → 114 taken 120 times.
✓ Branch 120 → 121 taken 24 times.
✓ Branch 306 → 307 taken 48 times.
✓ Branch 306 → 311 taken 96 times.
✓ Branch 310 → 311 taken 24 times.
✓ Branch 310 → 312 taken 24 times.
✓ Branch 313 → 296 taken 120 times.
✓ Branch 313 → 314 taken 24 times.
 288 while (is_ualnum(*str) || *str == '.') {
118
2/5
✓ Branch 114 → 115 taken 120 times.
✗ Branch 114 → 294 not taken.
✗ Branch 114 → 295 not taken.
✓ Branch 301 → 302 taken 120 times.
✗ Branch 301 → 690 not taken.
 240 subname += *(str++);
119 }
120 }
121 // when doing base[index].sub:
122 // result = (base_addr + index*object_size(base)) + sub_offset
123 // = sub_addr + index*object_size(base)
124 // so we build a math node that represents this calculation
125
2/5
✓ Branch 121 → 122 taken 25 times.
✗ Branch 121 → 294 not taken.
✗ Branch 121 → 295 not taken.
✓ Branch 315 → 316 taken 25 times.
✗ Branch 315 → 690 not taken.
 50 auto node_sub = std::make_unique<math_ast_label>(subname);
126
2/5
✓ Branch 122 → 123 taken 25 times.
✗ Branch 122 → 292 not taken.
✗ Branch 122 → 293 not taken.
✓ Branch 317 → 318 taken 25 times.
✗ Branch 317 → 688 not taken.
 50 auto node_base = std::make_unique<math_ast_label>(name);
127 50 std::vector<owned_node> arg_list;
128
2/5
✓ Branch 125 → 126 taken 25 times.
✗ Branch 125 → 288 not taken.
✗ Branch 125 → 289 not taken.
✓ Branch 322 → 323 taken 25 times.
✗ Branch 322 → 684 not taken.
 50 arg_list.emplace_back(std::move(node_base));
129
2/5
✓ Branch 127 → 128 taken 25 times.
✗ Branch 127 → 288 not taken.
✗ Branch 127 → 289 not taken.
✓ Branch 326 → 327 taken 25 times.
✗ Branch 326 → 684 not taken.
 50 auto node_objsize = std::make_unique<math_ast_function_call>(std::move(arg_list), "objectsize");
130
2/5
✓ Branch 130 → 131 taken 25 times.
✗ Branch 130 → 282 not taken.
✗ Branch 130 → 283 not taken.
✓ Branch 334 → 335 taken 25 times.
✗ Branch 334 → 676 not taken.
 50 auto node_mul = std::make_unique<math_ast_binop>(std::move(node_objsize), std::move(index), math_binop_type::mul);
131
2/5
✓ Branch 133 → 134 taken 25 times.
✗ Branch 133 → 283 not taken.
✗ Branch 133 → 284 not taken.
✓ Branch 343 → 344 taken 25 times.
✗ Branch 343 → 678 not taken.
 50 auto node_add = std::make_unique<math_ast_binop>(std::move(node_mul), std::move(node_sub), math_binop_type::add);
132 50 return node_add;
133 50 } else {
134
2/5
✓ Branch 145 → 146 taken 559 times.
✗ Branch 145 → 299 not taken.
✗ Branch 145 → 300 not taken.
✓ Branch 365 → 366 taken 561 times.
✗ Branch 365 → 703 not taken.
 1120 return std::make_unique<math_ast_label>(std::move(name));
135 }
136 1576 }
137 }
138
4/4
✓ Branch 153 → 154 taken 76 times.
✓ Branch 153 → 162 taken 5737 times.
✓ Branch 378 → 379 taken 76 times.
✓ Branch 378 → 399 taken 5784 times.
 11673 if(*str == '(') {
139 152 str++;
140
2/5
✓ Branch 154 → 155 taken 76 times.
✗ Branch 154 → 308 not taken.
✗ Branch 154 → 309 not taken.
✓ Branch 384 → 385 taken 76 times.
✗ Branch 384 → 716 not taken.
 152 auto res = parse_binops();
141
2/9
✗ Branch 155 → 156 not taken.
✓ Branch 155 → 159 taken 76 times.
✗ Branch 156 → 157 not taken.
✗ Branch 156 → 306 not taken.
✗ Branch 156 → 307 not taken.
✗ Branch 388 → 389 not taken.
✓ Branch 388 → 392 taken 76 times.
✗ Branch 389 → 390 not taken.
✗ Branch 389 → 714 not taken.
 152 if(*str != ')') throw_err_block(2, err_mismatched_parentheses);
142 152 str++;
143 152 return res;
144 152 }
145
4/4
✓ Branch 162 → 163 taken 10 times.
✓ Branch 162 → 173 taken 5727 times.
✓ Branch 402 → 403 taken 10 times.
✓ Branch 402 → 441 taken 5774 times.
 11521 if(*str == '%') {
146
2/8
✗ Branch 163 → 164 not taken.
✓ Branch 163 → 168 taken 10 times.
✗ Branch 164 → 165 not taken.
✗ Branch 164 → 168 not taken.
✗ Branch 407 → 408 not taken.
✓ Branch 407 → 416 taken 10 times.
✗ Branch 412 → 413 not taken.
✗ Branch 412 → 416 not taken.
 20 if (str[1] != '0' && str[1] != '1') throw_err_block(2, err_invalid_binary_value);
147 20 const char* start = str+1;
148
1/2
✗ Branch 423 → 424 not taken.
✓ Branch 423 → 425 taken 10 times.
 20 uint64_t res = strtoull(str+1, const_cast<char**>(&str), 2);
149 20 int len = str - start;
150
2/5
✓ Branch 169 → 170 taken 10 times.
✗ Branch 169 → 309 not taken.
✗ Branch 169 → 310 not taken.
✓ Branch 434 → 435 taken 10 times.
✗ Branch 434 → 718 not taken.
 20 return std::make_unique<math_ast_literal>((int64_t)res, (len+7)/8);
151 }
152
4/4
✓ Branch 173 → 174 taken 112 times.
✓ Branch 173 → 199 taken 5615 times.
✓ Branch 444 → 445 taken 112 times.
✓ Branch 444 → 503 taken 5662 times.
 11501 if (*str=='\'') {
153
2/9
✗ Branch 174 → 175 not taken.
✓ Branch 174 → 178 taken 112 times.
✗ Branch 175 → 176 not taken.
✗ Branch 175 → 317 not taken.
✗ Branch 175 → 318 not taken.
✗ Branch 449 → 450 not taken.
✓ Branch 449 → 453 taken 112 times.
✗ Branch 450 → 451 not taken.
✗ Branch 450 → 732 not taken.
 224 if (!str[1]) throw_err_block(2, err_invalid_character);
154 112 int orig_val;
155 224 str++;
156
2/5
✓ Branch 178 → 179 taken 112 times.
✗ Branch 178 → 317 not taken.
✗ Branch 178 → 318 not taken.
✓ Branch 460 → 461 taken 112 times.
✗ Branch 460 → 732 not taken.
 224 str += utf8_val(&orig_val, str);
157
2/9
✗ Branch 179 → 180 not taken.
✓ Branch 179 → 183 taken 112 times.
✗ Branch 180 → 181 not taken.
✗ Branch 180 → 317 not taken.
✗ Branch 180 → 318 not taken.
✗ Branch 466 → 467 not taken.
✓ Branch 466 → 470 taken 112 times.
✗ Branch 467 → 468 not taken.
✗ Branch 467 → 732 not taken.
 224 if (orig_val == -1) throw_err_block(0, err_invalid_utf8);
158
2/9
✗ Branch 183 → 184 not taken.
✓ Branch 183 → 187 taken 112 times.
✗ Branch 184 → 185 not taken.
✗ Branch 184 → 317 not taken.
✗ Branch 184 → 318 not taken.
✗ Branch 473 → 474 not taken.
✓ Branch 473 → 477 taken 112 times.
✗ Branch 474 → 475 not taken.
✗ Branch 474 → 732 not taken.
 224 if (*str != '\'') throw_err_block(2, err_invalid_character);
159
2/5
✓ Branch 187 → 188 taken 112 times.
✗ Branch 187 → 317 not taken.
✗ Branch 187 → 318 not taken.
✓ Branch 479 → 480 taken 112 times.
✗ Branch 479 → 732 not taken.
 224 int64_t rval=thetable.get_val(orig_val);
160
2/4
✗ Branch 188 → 189 not taken.
✓ Branch 188 → 195 taken 112 times.
✗ Branch 480 → 481 not taken.
✓ Branch 480 → 488 taken 112 times.
 224 if (rval == -1)
161 {
162 // RPG Hacker: Should be fine to not check return value of codepoint_to_utf8() here, because
163 // our error cases above already made sure that orig_val contains valid data at this point.
164 ✗ string u8_str;
165 ✗ codepoint_to_utf8(&u8_str, orig_val);
166 ✗ throw_err_block(2, err_undefined_char, u8_str.data());
167 ✗ }
168 224 str++;
169
2/5
✓ Branch 195 → 196 taken 112 times.
✗ Branch 195 → 315 not taken.
✗ Branch 195 → 316 not taken.
✓ Branch 495 → 496 taken 112 times.
✗ Branch 495 → 728 not taken.
 224 return std::make_unique<math_ast_literal>(rval, 1);
170 }
171
4/5
✓ Branch 200 → 201 taken 5451 times.
✗ Branch 200 → 233 not taken.
✓ Branch 200 → 234 taken 164 times.
✓ Branch 507 → 508 taken 5492 times.
✓ Branch 507 → 567 taken 170 times.
 11277 if (is_digit(*str)) {
172 10943 const char* end = str;
173 10943 bool is_float = false;
174
12/12
✓ Branch 206 → 207 taken 5491 times.
✓ Branch 206 → 208 taken 7052 times.
✓ Branch 207 → 208 taken 40 times.
✓ Branch 207 → 209 taken 5451 times.
✓ Branch 210 → 202 taken 7092 times.
✓ Branch 210 → 211 taken 5451 times.
✓ Branch 518 → 519 taken 5532 times.
✓ Branch 518 → 521 taken 7115 times.
✓ Branch 520 → 521 taken 40 times.
✓ Branch 520 → 522 taken 5492 times.
✓ Branch 523 → 511 taken 7155 times.
✓ Branch 523 → 524 taken 5492 times.
 25190 while (is_digit(*end) || *end == '.') {
175
4/4
✓ Branch 202 → 203 taken 40 times.
✓ Branch 202 → 204 taken 7052 times.
✓ Branch 512 → 513 taken 40 times.
✓ Branch 512 → 514 taken 7115 times.
 14247 if(*end == '.') is_float = true;
176 14247 end++;
177 }
178 10943 string number;
179
2/5
✓ Branch 212 → 213 taken 5451 times.
✗ Branch 212 → 322 not taken.
✗ Branch 212 → 323 not taken.
✓ Branch 530 → 531 taken 5492 times.
✗ Branch 530 → 744 not taken.
 10943 number.assign(str, (int)(end - str));
180 10943 str = end;
181
4/5
✓ Branch 213 → 214 taken 40 times.
✗ Branch 213 → 219 not taken.
✓ Branch 213 → 220 taken 5411 times.
✓ Branch 533 → 534 taken 40 times.
✓ Branch 533 → 545 taken 5452 times.
 10943 if(is_float) {
182
1/2
✗ Branch 536 → 537 not taken.
✓ Branch 536 → 538 taken 40 times.
 80 double res = std::atof(number);
183
2/6
✗ Branch 215 → 216 not taken.
✗ Branch 215 → 318 not taken.
✓ Branch 216 → 217 taken 40 times.
✗ Branch 216 → 319 not taken.
✓ Branch 539 → 540 taken 40 times.
✗ Branch 539 → 735 not taken.
 80 return std::make_unique<math_ast_literal>(res);
184 } else {
185
1/2
✗ Branch 547 → 548 not taken.
✓ Branch 547 → 549 taken 5452 times.
 10863 int64_t res = strtoll(number, nullptr, 10);
186
8/11
✗ Branch 221 → 222 not taken.
✗ Branch 221 → 226 not taken.
✓ Branch 222 → 223 taken 5405 times.
✗ Branch 222 → 224 not taken.
✓ Branch 222 → 227 taken 6 times.
✓ Branch 223 → 224 taken 37 times.
✓ Branch 223 → 225 taken 5368 times.
✓ Branch 551 → 552 taken 5446 times.
✓ Branch 551 → 556 taken 6 times.
✓ Branch 552 → 553 taken 42 times.
✓ Branch 552 → 554 taken 5404 times.
 10863 int len = (res >= 0x10000) ? 3 : (res >= 0x100) ? 2 : 1;
187
2/6
✗ Branch 227 → 228 not taken.
✗ Branch 227 → 320 not taken.
✓ Branch 228 → 229 taken 5411 times.
✗ Branch 228 → 321 not taken.
✓ Branch 558 → 559 taken 5452 times.
✗ Branch 558 → 739 not taken.
 10863 return std::make_unique<math_ast_literal>(res, len);
188 }
189 10943 }
190
4/6
✗ Branch 233 → 234 not taken.
✗ Branch 233 → 257 not taken.
✓ Branch 234 → 235 taken 158 times.
✓ Branch 234 → 258 taken 6 times.
✓ Branch 570 → 571 taken 164 times.
✓ Branch 570 → 638 taken 6 times.
 334 if(*str == '"') {
191 322 const char * strpos = str + 1;
192
1/2
✗ Branch 575 → 576 not taken.
✓ Branch 575 → 577 taken 164 times.
 322 str = strchr(strpos, '"');
193
2/11
✗ Branch 234 → 235 not taken.
✗ Branch 234 → 238 not taken.
✗ Branch 235 → 236 not taken.
✓ Branch 235 → 239 taken 158 times.
✗ Branch 235 → 328 not taken.
✗ Branch 236 → 237 not taken.
✗ Branch 236 → 329 not taken.
✗ Branch 580 → 581 not taken.
✓ Branch 580 → 584 taken 164 times.
✗ Branch 581 → 582 not taken.
✗ Branch 581 → 752 not taken.
 322 if(!str) throw_err_block(2, err_mismatched_quotes);
194
2/6
✗ Branch 238 → 239 not taken.
✗ Branch 238 → 328 not taken.
✓ Branch 239 → 240 taken 158 times.
✗ Branch 239 → 329 not taken.
✓ Branch 587 → 588 taken 164 times.
✗ Branch 587 → 752 not taken.
 322 string output(strpos, str - strpos);
195
6/11
✗ Branch 246 → 247 not taken.
✗ Branch 246 → 248 not taken.
✗ Branch 247 → 240 not taken.
✓ Branch 247 → 248 taken 162 times.
✗ Branch 247 → 249 not taken.
✓ Branch 248 → 241 taken 4 times.
✓ Branch 248 → 249 taken 158 times.
✓ Branch 608 → 609 taken 168 times.
✗ Branch 608 → 614 not taken.
✓ Branch 613 → 589 taken 4 times.
✓ Branch 613 → 614 taken 164 times.
 330 while(str && str[1] == '"') {
196 // we hit an escaped quote
197
2/6
✗ Branch 240 → 241 not taken.
✗ Branch 240 → 326 not taken.
✓ Branch 241 → 242 taken 4 times.
✗ Branch 241 → 327 not taken.
✓ Branch 589 → 590 taken 4 times.
✗ Branch 589 → 750 not taken.
 8 output += '"';
198 8 strpos = str+2;
199
1/2
✗ Branch 594 → 595 not taken.
✓ Branch 594 → 596 taken 4 times.
 8 str = strchr(strpos, '"');
200
2/11
✗ Branch 241 → 242 not taken.
✗ Branch 241 → 245 not taken.
✗ Branch 242 → 243 not taken.
✓ Branch 242 → 246 taken 4 times.
✗ Branch 242 → 326 not taken.
✗ Branch 243 → 244 not taken.
✗ Branch 243 → 327 not taken.
✗ Branch 599 → 600 not taken.
✓ Branch 599 → 603 taken 4 times.
✗ Branch 600 → 601 not taken.
✗ Branch 600 → 750 not taken.
 8 if(!str) throw_err_block(2, err_mismatched_quotes);
201
2/6
✗ Branch 245 → 246 not taken.
✗ Branch 245 → 326 not taken.
✓ Branch 246 → 247 taken 4 times.
✗ Branch 246 → 327 not taken.
✓ Branch 605 → 606 taken 4 times.
✗ Branch 605 → 750 not taken.
 8 output.append(strpos, 0, str - strpos);
202 }
203 322 str++;
204
4/6
✗ Branch 250 → 249 not taken.
✗ Branch 250 → 251 not taken.
✓ Branch 251 → 250 taken 12 times.
✓ Branch 251 → 252 taken 158 times.
✓ Branch 627 → 619 taken 12 times.
✓ Branch 627 → 628 taken 164 times.
 346 while (*str==' ') str++; //eat space
205
2/6
✗ Branch 252 → 253 not taken.
✗ Branch 252 → 325 not taken.
✓ Branch 253 → 254 taken 158 times.
✗ Branch 253 → 326 not taken.
✓ Branch 631 → 632 taken 164 times.
✗ Branch 631 → 748 not taken.
 322 return std::make_unique<math_ast_literal>(std::move(output));
206 322 }
207 12 throw_err_block(2, err_invalid_number);
208 }
209
210 20751 owned_node parse_context::parse_unops() {
211
4/4
✓ Branch 4 → 3 taken 1259 times.
✓ Branch 4 → 5 taken 10305 times.
✓ Branch 11 → 3 taken 1259 times.
✓ Branch 11 → 12 taken 10446 times.
 23269 while(*str == ' ') str++;
212 // optimize for the common case
213 // TODO how much of an optimization is this really?
214
4/4
✓ Branch 5 → 6 taken 3197 times.
✓ Branch 5 → 7 taken 7108 times.
✓ Branch 15 → 16 taken 3284 times.
✓ Branch 15 → 18 taken 7162 times.
 20751 if(*str == '$') return parse_atom();
215
216
4/4
✓ Branch 7 → 8 taken 20 times.
✓ Branch 7 → 14 taken 7088 times.
✓ Branch 21 → 22 taken 20 times.
✓ Branch 21 → 40 taken 7142 times.
 14270 if(*str == '-') {
217 40 str++;
218
4/8
✓ Branch 8 → 9 taken 20 times.
✗ Branch 8 → 35 not taken.
✓ Branch 9 → 10 taken 20 times.
✗ Branch 9 → 33 not taken.
✓ Branch 30 → 31 taken 20 times.
✗ Branch 30 → 105 not taken.
✓ Branch 32 → 33 taken 20 times.
✗ Branch 32 → 103 not taken.
 40 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::neg);
219
4/4
✓ Branch 14 → 15 taken 4 times.
✓ Branch 14 → 21 taken 7084 times.
✓ Branch 43 → 44 taken 4 times.
✓ Branch 43 → 62 taken 7138 times.
 14230 } else if(*str == '~') {
220 8 str++;
221
4/8
✓ Branch 15 → 16 taken 4 times.
✗ Branch 15 → 40 not taken.
✓ Branch 16 → 17 taken 4 times.
✗ Branch 16 → 38 not taken.
✓ Branch 52 → 53 taken 4 times.
✗ Branch 52 → 113 not taken.
✓ Branch 54 → 55 taken 4 times.
✗ Branch 54 → 111 not taken.
 8 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bit_not);
222
8/8
✓ Branch 21 → 22 taken 15 times.
✓ Branch 21 → 29 taken 7069 times.
✓ Branch 22 → 23 taken 9 times.
✓ Branch 22 → 29 taken 6 times.
✓ Branch 65 → 66 taken 15 times.
✓ Branch 65 → 90 taken 7123 times.
✓ Branch 70 → 71 taken 9 times.
✓ Branch 70 → 90 taken 6 times.
 14222 } else if(*str == '<' && str[1] == ':') {
223 18 str += 2;
224
4/8
✓ Branch 23 → 24 taken 9 times.
✗ Branch 23 → 45 not taken.
✓ Branch 24 → 25 taken 9 times.
✗ Branch 24 → 43 not taken.
✓ Branch 80 → 81 taken 9 times.
✗ Branch 80 → 121 not taken.
✓ Branch 82 → 83 taken 9 times.
✗ Branch 82 → 119 not taken.
 18 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bank_extract);
225
2/4
✗ Branch 29 → 30 not taken.
✓ Branch 29 → 31 taken 7075 times.
✗ Branch 93 → 94 not taken.
✓ Branch 93 → 100 taken 7129 times.
 14204 } else if(*str == '+') {
226 ✗ str++;
227 ✗ return parse_unops();
228 }
229 14204 else return parse_atom();
230 }
231
232 20721 owned_node parse_context::parse_binops(int depth) {
233 20721 const char* posneglabel = str;
234
4/4
✓ Branch 2 → 3 taken 10286 times.
✓ Branch 2 → 332 taken 1 time.
✓ Branch 6 → 7 taken 10433 times.
✓ Branch 6 → 803 taken 1 time.
 20721 string posnegname = posneglabelname(&posneglabel, false);
235
8/8
✓ Branch 4 → 5 taken 31 times.
✓ Branch 4 → 8 taken 10255 times.
✓ Branch 8 → 9 taken 37 times.
✓ Branch 8 → 14 taken 10396 times.
✓ Branch 9 → 10 taken 14 times.
✓ Branch 9 → 14 taken 10272 times.
✓ Branch 15 → 16 taken 20 times.
✓ Branch 15 → 24 taken 10413 times.
 20787 if (posnegname.length() > 0 &&
236
6/8
✓ Branch 5 → 6 taken 17 times.
✓ Branch 5 → 7 taken 14 times.
✗ Branch 6 → 7 not taken.
✓ Branch 6 → 8 taken 17 times.
✓ Branch 10 → 11 taken 17 times.
✓ Branch 10 → 13 taken 20 times.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 14 taken 17 times.
 68 (*posneglabel == '\0' || *posneglabel == ')')) {
237 34 str = posneglabel;
238
2/4
✓ Branch 10 → 11 taken 14 times.
✗ Branch 10 → 266 not taken.
✓ Branch 19 → 20 taken 20 times.
✗ Branch 19 → 679 not taken.
 34 return std::make_unique<math_ast_label>(posnegname);
239 }
240
241
2/4
✓ Branch 14 → 15 taken 10272 times.
✗ Branch 14 → 330 not taken.
✓ Branch 25 → 26 taken 10413 times.
✗ Branch 25 → 801 not taken.
 20685 recurseblock rec;
242
243
4/4
✓ Branch 15 → 16 taken 10266 times.
✓ Branch 15 → 328 taken 6 times.
✓ Branch 27 → 28 taken 10407 times.
✓ Branch 27 → 799 taken 6 times.
 20685 owned_node left = parse_unops();
244 20673 owned_node right;
245
4/4
✓ Branch 18 → 17 taken 1225 times.
✓ Branch 18 → 19 taken 10266 times.
✓ Branch 38 → 30 taken 1225 times.
✓ Branch 38 → 39 taken 10407 times.
 23123 while(*str == ' ') str++;
246
16/16
✓ Branch 255 → 256 taken 3238 times.
✓ Branch 255 → 259 taken 9525 times.
✓ Branch 256 → 257 taken 2695 times.
✓ Branch 256 → 259 taken 543 times.
✓ Branch 257 → 258 taken 2553 times.
✓ Branch 257 → 259 taken 142 times.
✓ Branch 258 → 20 taken 2528 times.
✓ Branch 258 → 259 taken 25 times.
✓ Branch 655 → 656 taken 3247 times.
✓ Branch 655 → 668 taken 9660 times.
✓ Branch 659 → 660 taken 2698 times.
✓ Branch 659 → 668 taken 549 times.
✓ Branch 663 → 664 taken 2556 times.
✓ Branch 663 → 668 taken 142 times.
✓ Branch 667 → 40 taken 2531 times.
✓ Branch 667 → 668 taken 25 times.
 25670 while (*str && *str != ')' && *str != ','&& *str != ']') {
247
2/4
✗ Branch 22 → 21 not taken.
✓ Branch 22 → 23 taken 2528 times.
✗ Branch 49 → 41 not taken.
✓ Branch 49 → 50 taken 2531 times.
 5059 while(*str == ' ') str++;
248 // TODO can we make this macro a bit nicer???
249 #define oper(name, thisdepth, contents) \
250 if (!strncmp(str, name, strlen(name))) \
251 { \
252 if (depth<=thisdepth) \
253 { \
254 str += strlen(name); \
255 right = parse_binops(thisdepth+1); \
256 left = std::make_unique<math_ast_binop>(std::move(left), std::move(right), contents); \
257 continue; \
258 } \
259 else return left; \
260 }
261
11/18
✓ Branch 23 → 24 taken 6 times.
✓ Branch 23 → 35 taken 2522 times.
✓ Branch 24 → 25 taken 6 times.
✗ Branch 24 → 34 not taken.
✓ Branch 25 → 26 taken 6 times.
✗ Branch 25 → 267 not taken.
✓ Branch 30 → 31 taken 6 times.
✗ Branch 30 → 268 not taken.
✗ Branch 52 → 53 not taken.
✓ Branch 52 → 54 taken 2531 times.
✓ Branch 54 → 55 taken 6 times.
✓ Branch 54 → 82 taken 2525 times.
✓ Branch 55 → 56 taken 6 times.
✗ Branch 55 → 81 not taken.
✓ Branch 62 → 63 taken 6 times.
✗ Branch 62 → 681 not taken.
✓ Branch 74 → 75 taken 6 times.
✗ Branch 74 → 683 not taken.
 5059 oper("**", 6, math_binop_type::pow);
262
10/16
✓ Branch 35 → 36 taken 18 times.
✓ Branch 35 → 47 taken 2504 times.
✓ Branch 36 → 37 taken 18 times.
✗ Branch 36 → 46 not taken.
✓ Branch 37 → 38 taken 18 times.
✗ Branch 37 → 270 not taken.
✓ Branch 42 → 43 taken 18 times.
✗ Branch 42 → 271 not taken.
✓ Branch 85 → 86 taken 18 times.
✓ Branch 85 → 113 taken 2507 times.
✓ Branch 86 → 87 taken 18 times.
✗ Branch 86 → 112 not taken.
✓ Branch 93 → 94 taken 18 times.
✗ Branch 93 → 687 not taken.
✓ Branch 105 → 106 taken 18 times.
✗ Branch 105 → 689 not taken.
 5047 oper("*", 5, math_binop_type::mul);
263
10/16
✓ Branch 47 → 48 taken 14 times.
✓ Branch 47 → 59 taken 2490 times.
✓ Branch 48 → 49 taken 14 times.
✗ Branch 48 → 58 not taken.
✓ Branch 49 → 50 taken 14 times.
✗ Branch 49 → 273 not taken.
✓ Branch 54 → 55 taken 14 times.
✗ Branch 54 → 274 not taken.
✓ Branch 116 → 117 taken 14 times.
✓ Branch 116 → 144 taken 2493 times.
✓ Branch 117 → 118 taken 14 times.
✗ Branch 117 → 143 not taken.
✓ Branch 124 → 125 taken 14 times.
✗ Branch 124 → 693 not taken.
✓ Branch 136 → 137 taken 14 times.
✗ Branch 136 → 695 not taken.
 5011 oper("/", 5, math_binop_type::div);
264
10/16
✓ Branch 59 → 60 taken 1 time.
✓ Branch 59 → 71 taken 2489 times.
✓ Branch 60 → 61 taken 1 time.
✗ Branch 60 → 70 not taken.
✓ Branch 61 → 62 taken 1 time.
✗ Branch 61 → 276 not taken.
✓ Branch 66 → 67 taken 1 time.
✗ Branch 66 → 277 not taken.
✓ Branch 147 → 148 taken 1 time.
✓ Branch 147 → 175 taken 2492 times.
✓ Branch 148 → 149 taken 1 time.
✗ Branch 148 → 174 not taken.
✓ Branch 155 → 156 taken 1 time.
✗ Branch 155 → 699 not taken.
✓ Branch 167 → 168 taken 1 time.
✗ Branch 167 → 701 not taken.
 4983 oper("%", 5, math_binop_type::mod);
265
12/16
✓ Branch 71 → 72 taken 981 times.
✓ Branch 71 → 83 taken 1508 times.
✓ Branch 72 → 73 taken 971 times.
✓ Branch 72 → 82 taken 10 times.
✓ Branch 73 → 74 taken 971 times.
✗ Branch 73 → 279 not taken.
✓ Branch 78 → 79 taken 971 times.
✗ Branch 78 → 280 not taken.
✓ Branch 178 → 179 taken 984 times.
✓ Branch 178 → 206 taken 1508 times.
✓ Branch 179 → 180 taken 974 times.
✓ Branch 179 → 205 taken 10 times.
✓ Branch 186 → 187 taken 974 times.
✗ Branch 186 → 705 not taken.
✓ Branch 198 → 199 taken 974 times.
✗ Branch 198 → 707 not taken.
 4981 oper("+", 4, math_binop_type::add);
266
10/16
✓ Branch 83 → 84 taken 267 times.
✓ Branch 83 → 95 taken 1241 times.
✓ Branch 84 → 85 taken 267 times.
✗ Branch 84 → 94 not taken.
✓ Branch 85 → 86 taken 267 times.
✗ Branch 85 → 282 not taken.
✓ Branch 90 → 91 taken 267 times.
✗ Branch 90 → 283 not taken.
✓ Branch 209 → 210 taken 267 times.
✓ Branch 209 → 237 taken 1241 times.
✓ Branch 210 → 211 taken 267 times.
✗ Branch 210 → 236 not taken.
✓ Branch 217 → 218 taken 267 times.
✗ Branch 217 → 711 not taken.
✓ Branch 229 → 230 taken 267 times.
✗ Branch 229 → 713 not taken.
 3016 oper("-", 4, math_binop_type::sub);
267
11/18
✓ Branch 95 → 96 taken 1 time.
✓ Branch 95 → 107 taken 1240 times.
✓ Branch 96 → 97 taken 1 time.
✗ Branch 96 → 106 not taken.
✓ Branch 97 → 98 taken 1 time.
✗ Branch 97 → 285 not taken.
✓ Branch 102 → 103 taken 1 time.
✗ Branch 102 → 286 not taken.
✗ Branch 239 → 240 not taken.
✓ Branch 239 → 241 taken 1241 times.
✓ Branch 241 → 242 taken 1 time.
✓ Branch 241 → 269 taken 1240 times.
✓ Branch 242 → 243 taken 1 time.
✗ Branch 242 → 268 not taken.
✓ Branch 249 → 250 taken 1 time.
✗ Branch 249 → 717 not taken.
✓ Branch 261 → 262 taken 1 time.
✗ Branch 261 → 719 not taken.
 2482 oper("<<", 3, math_binop_type::shift_left);
268
11/18
✓ Branch 107 → 108 taken 10 times.
✓ Branch 107 → 119 taken 1230 times.
✓ Branch 108 → 109 taken 10 times.
✗ Branch 108 → 118 not taken.
✓ Branch 109 → 110 taken 10 times.
✗ Branch 109 → 288 not taken.
✓ Branch 114 → 115 taken 10 times.
✗ Branch 114 → 289 not taken.
✗ Branch 271 → 272 not taken.
✓ Branch 271 → 273 taken 1240 times.
✓ Branch 273 → 274 taken 10 times.
✓ Branch 273 → 301 taken 1230 times.
✓ Branch 274 → 275 taken 10 times.
✗ Branch 274 → 300 not taken.
✓ Branch 281 → 282 taken 10 times.
✗ Branch 281 → 723 not taken.
✓ Branch 293 → 294 taken 10 times.
✗ Branch 293 → 725 not taken.
 2480 oper(">>", 3, math_binop_type::shift_right);
269
270 //these two needed checked early to avoid bitwise from eating a operator
271
13/18
✓ Branch 119 → 120 taken 13 times.
✓ Branch 119 → 131 taken 1217 times.
✓ Branch 120 → 121 taken 7 times.
✓ Branch 120 → 130 taken 6 times.
✓ Branch 121 → 122 taken 7 times.
✗ Branch 121 → 291 not taken.
✓ Branch 126 → 127 taken 7 times.
✗ Branch 126 → 292 not taken.
✗ Branch 303 → 304 not taken.
✓ Branch 303 → 305 taken 1230 times.
✓ Branch 305 → 306 taken 13 times.
✓ Branch 305 → 333 taken 1217 times.
✓ Branch 306 → 307 taken 7 times.
✓ Branch 306 → 332 taken 6 times.
✓ Branch 313 → 314 taken 7 times.
✗ Branch 313 → 729 not taken.
✓ Branch 325 → 326 taken 7 times.
✗ Branch 325 → 731 not taken.
 2460 oper("&&", 0, math_binop_type::logical_and);
272
13/18
✓ Branch 131 → 132 taken 7 times.
✓ Branch 131 → 143 taken 1210 times.
✓ Branch 132 → 133 taken 4 times.
✓ Branch 132 → 142 taken 3 times.
✓ Branch 133 → 134 taken 4 times.
✗ Branch 133 → 294 not taken.
✓ Branch 138 → 139 taken 4 times.
✗ Branch 138 → 295 not taken.
✗ Branch 335 → 336 not taken.
✓ Branch 335 → 337 taken 1217 times.
✓ Branch 337 → 338 taken 7 times.
✓ Branch 337 → 365 taken 1210 times.
✓ Branch 338 → 339 taken 4 times.
✓ Branch 338 → 364 taken 3 times.
✓ Branch 345 → 346 taken 4 times.
✗ Branch 345 → 735 not taken.
✓ Branch 357 → 358 taken 4 times.
✗ Branch 357 → 737 not taken.
 2434 oper("||", 0, math_binop_type::logical_or);
273
2/16
✗ Branch 143 → 144 not taken.
✓ Branch 143 → 155 taken 1210 times.
✗ Branch 144 → 145 not taken.
✗ Branch 144 → 154 not taken.
✗ Branch 145 → 146 not taken.
✗ Branch 145 → 297 not taken.
✗ Branch 150 → 151 not taken.
✗ Branch 150 → 298 not taken.
✗ Branch 368 → 369 not taken.
✓ Branch 368 → 396 taken 1210 times.
✗ Branch 369 → 370 not taken.
✗ Branch 369 → 395 not taken.
✗ Branch 376 → 377 not taken.
✗ Branch 376 → 741 not taken.
✗ Branch 388 → 389 not taken.
✗ Branch 388 → 743 not taken.
 2420 oper("&", 2, math_binop_type::bit_and);
274
10/16
✓ Branch 155 → 156 taken 3 times.
✓ Branch 155 → 167 taken 1207 times.
✓ Branch 156 → 157 taken 3 times.
✗ Branch 156 → 166 not taken.
✓ Branch 157 → 158 taken 3 times.
✗ Branch 157 → 300 not taken.
✓ Branch 162 → 163 taken 3 times.
✗ Branch 162 → 301 not taken.
✓ Branch 399 → 400 taken 3 times.
✓ Branch 399 → 427 taken 1207 times.
✓ Branch 400 → 401 taken 3 times.
✗ Branch 400 → 426 not taken.
✓ Branch 407 → 408 taken 3 times.
✗ Branch 407 → 747 not taken.
✓ Branch 419 → 420 taken 3 times.
✗ Branch 419 → 749 not taken.
 2420 oper("|", 2,math_binop_type::bit_or);
275
2/16
✗ Branch 167 → 168 not taken.
✓ Branch 167 → 179 taken 1207 times.
✗ Branch 168 → 169 not taken.
✗ Branch 168 → 178 not taken.
✗ Branch 169 → 170 not taken.
✗ Branch 169 → 303 not taken.
✗ Branch 174 → 175 not taken.
✗ Branch 174 → 304 not taken.
✗ Branch 430 → 431 not taken.
✓ Branch 430 → 458 taken 1207 times.
✗ Branch 431 → 432 not taken.
✗ Branch 431 → 457 not taken.
✗ Branch 438 → 439 not taken.
✗ Branch 438 → 753 not taken.
✗ Branch 450 → 451 not taken.
✗ Branch 450 → 755 not taken.
 2414 oper("^", 2, math_binop_type::bit_xor);
276
277
11/18
✓ Branch 179 → 180 taken 4 times.
✓ Branch 179 → 191 taken 1203 times.
✓ Branch 180 → 181 taken 4 times.
✗ Branch 180 → 190 not taken.
✓ Branch 181 → 182 taken 4 times.
✗ Branch 181 → 306 not taken.
✓ Branch 186 → 187 taken 4 times.
✗ Branch 186 → 307 not taken.
✗ Branch 460 → 461 not taken.
✓ Branch 460 → 462 taken 1207 times.
✓ Branch 462 → 463 taken 4 times.
✓ Branch 462 → 490 taken 1203 times.
✓ Branch 463 → 464 taken 4 times.
✗ Branch 463 → 489 not taken.
✓ Branch 470 → 471 taken 4 times.
✗ Branch 470 → 759 not taken.
✓ Branch 482 → 483 taken 4 times.
✗ Branch 482 → 761 not taken.
 2414 oper(">=", 1, math_binop_type::comp_ge);
278
11/18
✓ Branch 191 → 192 taken 1 time.
✓ Branch 191 → 203 taken 1202 times.
✓ Branch 192 → 193 taken 1 time.
✗ Branch 192 → 202 not taken.
✓ Branch 193 → 194 taken 1 time.
✗ Branch 193 → 309 not taken.
✓ Branch 198 → 199 taken 1 time.
✗ Branch 198 → 310 not taken.
✗ Branch 492 → 493 not taken.
✓ Branch 492 → 494 taken 1203 times.
✓ Branch 494 → 495 taken 1 time.
✓ Branch 494 → 522 taken 1202 times.
✓ Branch 495 → 496 taken 1 time.
✗ Branch 495 → 521 not taken.
✓ Branch 502 → 503 taken 1 time.
✗ Branch 502 → 765 not taken.
✓ Branch 514 → 515 taken 1 time.
✗ Branch 514 → 767 not taken.
 2406 oper("<=", 1, math_binop_type::comp_le);
279
10/16
✓ Branch 203 → 204 taken 70 times.
✓ Branch 203 → 215 taken 1132 times.
✓ Branch 204 → 205 taken 70 times.
✗ Branch 204 → 214 not taken.
✓ Branch 205 → 206 taken 70 times.
✗ Branch 205 → 312 not taken.
✓ Branch 210 → 211 taken 70 times.
✗ Branch 210 → 313 not taken.
✓ Branch 525 → 526 taken 70 times.
✓ Branch 525 → 553 taken 1132 times.
✓ Branch 526 → 527 taken 70 times.
✗ Branch 526 → 552 not taken.
✓ Branch 533 → 534 taken 70 times.
✗ Branch 533 → 771 not taken.
✓ Branch 545 → 546 taken 70 times.
✗ Branch 545 → 773 not taken.
 2404 oper(">", 1, math_binop_type::comp_gt);
280
10/16
✓ Branch 215 → 216 taken 898 times.
✓ Branch 215 → 227 taken 234 times.
✓ Branch 216 → 217 taken 898 times.
✗ Branch 216 → 226 not taken.
✓ Branch 217 → 218 taken 898 times.
✗ Branch 217 → 315 not taken.
✓ Branch 222 → 223 taken 898 times.
✗ Branch 222 → 316 not taken.
✓ Branch 556 → 557 taken 898 times.
✓ Branch 556 → 584 taken 234 times.
✓ Branch 557 → 558 taken 898 times.
✗ Branch 557 → 583 not taken.
✓ Branch 564 → 565 taken 898 times.
✗ Branch 564 → 777 not taken.
✓ Branch 576 → 577 taken 898 times.
✗ Branch 576 → 779 not taken.
 2264 oper("<", 1, math_binop_type::comp_lt);
281
13/18
✓ Branch 227 → 228 taken 209 times.
✓ Branch 227 → 239 taken 25 times.
✓ Branch 228 → 229 taken 207 times.
✓ Branch 228 → 238 taken 2 times.
✓ Branch 229 → 230 taken 207 times.
✗ Branch 229 → 318 not taken.
✓ Branch 234 → 235 taken 207 times.
✗ Branch 234 → 319 not taken.
✗ Branch 586 → 587 not taken.
✓ Branch 586 → 588 taken 234 times.
✓ Branch 588 → 589 taken 209 times.
✓ Branch 588 → 616 taken 25 times.
✓ Branch 589 → 590 taken 207 times.
✓ Branch 589 → 615 taken 2 times.
✓ Branch 596 → 597 taken 207 times.
✗ Branch 596 → 783 not taken.
✓ Branch 608 → 609 taken 207 times.
✗ Branch 608 → 785 not taken.
 468 oper("==", 1, math_binop_type::comp_eq);
282
13/18
✓ Branch 239 → 240 taken 17 times.
✓ Branch 239 → 251 taken 8 times.
✓ Branch 240 → 241 taken 15 times.
✓ Branch 240 → 250 taken 2 times.
✓ Branch 241 → 242 taken 15 times.
✗ Branch 241 → 321 not taken.
✓ Branch 246 → 247 taken 15 times.
✗ Branch 246 → 322 not taken.
✗ Branch 618 → 619 not taken.
✓ Branch 618 → 620 taken 25 times.
✓ Branch 620 → 621 taken 17 times.
✓ Branch 620 → 648 taken 8 times.
✓ Branch 621 → 622 taken 15 times.
✓ Branch 621 → 647 taken 2 times.
✓ Branch 628 → 629 taken 15 times.
✗ Branch 628 → 789 not taken.
✓ Branch 640 → 641 taken 15 times.
✗ Branch 640 → 791 not taken.
 50 oper("!=", 1, math_binop_type::comp_ne);
283
2/4
✓ Branch 251 → 252 taken 8 times.
✗ Branch 251 → 324 not taken.
✓ Branch 648 → 649 taken 8 times.
✗ Branch 648 → 795 not taken.
 16 throw_err_block(2, err_unknown_operator);
284 #undef oper
285 }
286 20611 return left;
287 20779 }
288
289 14323 owned_node parse_context::parse() {
290 14323 auto res = parse_binops();
291
2/4
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 11 taken 7077 times.
✗ Branch 7 → 8 not taken.
✓ Branch 7 → 18 taken 7216 times.
 14293 if(*str) {
292 ✗ if(*str == ',') throw_err_block(2, err_invalid_input);
293 ✗ else throw_err_block(2, err_mismatched_parentheses);
294 }
295 14293 return res;
296 ✗ }
297
298 48 void createuserfunc(const char * name, const char * arguments, const char * content) {
299
17/47
✓ Branch 2 → 3 taken 24 times.
✗ Branch 2 → 70 not taken.
✓ Branch 3 → 4 taken 48 times.
✗ Branch 3 → 70 not taken.
✗ Branch 3 → 109 not taken.
✓ Branch 4 → 5 taken 24 times.
✗ Branch 4 → 8 not taken.
✓ Branch 5 → 6 taken 48 times.
✗ Branch 5 → 70 not taken.
✗ Branch 5 → 109 not taken.
✓ Branch 6 → 7 taken 48 times.
✗ Branch 6 → 13 not taken.
✗ Branch 6 → 70 not taken.
✗ Branch 7 → 8 not taken.
✓ Branch 7 → 9 taken 24 times.
✓ Branch 9 → 10 taken 24 times.
✗ Branch 9 → 109 not taken.
✓ Branch 10 → 11 taken 24 times.
✗ Branch 10 → 12 not taken.
✓ Branch 11 → 12 taken 24 times.
✗ Branch 11 → 109 not taken.
✓ Branch 12 → 13 taken 24 times.
✓ Branch 12 → 14 taken 24 times.
✗ Branch 14 → 15 not taken.
✓ Branch 14 → 18 taken 24 times.
✓ Branch 15 → 16 taken 24 times.
✗ Branch 15 → 17 not taken.
✓ Branch 17 → 18 taken 24 times.
✗ Branch 17 → 19 not taken.
✓ Branch 19 → 20 taken 24 times.
✗ Branch 19 → 21 not taken.
✓ Branch 21 → 22 taken 24 times.
✗ Branch 21 → 23 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 27 taken 24 times.
✗ Branch 70 → 71 not taken.
✗ Branch 70 → 72 not taken.
✗ Branch 74 → 75 not taken.
✗ Branch 74 → 76 not taken.
✗ Branch 109 → 110 not taken.
✗ Branch 109 → 111 not taken.
✗ Branch 112 → 113 not taken.
✗ Branch 112 → 114 not taken.
✗ Branch 115 → 116 not taken.
✗ Branch 115 → 117 not taken.
✗ Branch 118 → 119 not taken.
✗ Branch 118 → 120 not taken.
 48 if(user_functions.count(name) != 0 || builtin_functions.count(name) != 0) {
300 ✗ throw_err_block(0, err_function_redefined, name);
301 }
302
2/5
✓ Branch 18 → 19 taken 24 times.
✗ Branch 18 → 98 not taken.
✗ Branch 18 → 100 not taken.
✓ Branch 28 → 29 taken 24 times.
✗ Branch 28 → 145 not taken.
 48 string arguments_buf = arguments;
303 // TODO: if we want to be more lenient with spaces in the `function`
304 // command, then we need to handle spaces inside `arguments_buf`
305 24 int numargs;
306
2/5
✓ Branch 20 → 21 taken 24 times.
✗ Branch 20 → 96 not taken.
✗ Branch 20 → 98 not taken.
✓ Branch 32 → 33 taken 24 times.
✗ Branch 32 → 143 not taken.
 48 autoptr<char**> spl = split(arguments_buf.raw(), ',', &numargs);
307 48 size_t arg_count = numargs;
308
20/28
✓ Branch 22 → 23 taken 15 times.
✓ Branch 22 → 28 taken 9 times.
✓ Branch 23 → 24 taken 15 times.
✗ Branch 23 → 78 not taken.
✓ Branch 26 → 27 taken 6 times.
✓ Branch 26 → 28 taken 9 times.
✓ Branch 29 → 30 taken 15 times.
✓ Branch 29 → 31 taken 9 times.
✓ Branch 31 → 32 taken 6 times.
✓ Branch 31 → 33 taken 18 times.
✓ Branch 34 → 35 taken 15 times.
✓ Branch 34 → 43 taken 9 times.
✓ Branch 36 → 37 taken 15 times.
✗ Branch 36 → 121 not taken.
✓ Branch 41 → 42 taken 6 times.
✓ Branch 41 → 43 taken 9 times.
✓ Branch 44 → 45 taken 15 times.
✓ Branch 44 → 46 taken 9 times.
✓ Branch 46 → 47 taken 15 times.
✓ Branch 46 → 48 taken 9 times.
✓ Branch 48 → 49 taken 6 times.
✓ Branch 48 → 50 taken 18 times.
✗ Branch 78 → 79 not taken.
✗ Branch 78 → 80 not taken.
✗ Branch 121 → 122 not taken.
✗ Branch 121 → 123 not taken.
✗ Branch 124 → 125 not taken.
✗ Branch 124 → 126 not taken.
 48 if(numargs == 1 && spl[0] == string{""}) {
309 12 arg_count = 0;
310 }
311 48 std::unordered_map<string, size_t> arg_indices;
312
4/4
✓ Branch 54 → 35 taken 27 times.
✓ Branch 54 → 55 taken 24 times.
✓ Branch 78 → 54 taken 27 times.
✓ Branch 78 → 79 taken 24 times.
 102 for(size_t i = 0; i < arg_count; i++) {
313
2/5
✓ Branch 36 → 37 taken 27 times.
✗ Branch 36 → 84 not taken.
✗ Branch 36 → 85 not taken.
✓ Branch 58 → 59 taken 27 times.
✗ Branch 58 → 129 not taken.
 54 string argname = spl[i];
314
4/9
✓ Branch 37 → 38 taken 27 times.
✗ Branch 37 → 82 not taken.
✗ Branch 37 → 83 not taken.
✗ Branch 38 → 39 not taken.
✓ Branch 38 → 43 taken 27 times.
✓ Branch 59 → 60 taken 27 times.
✗ Branch 59 → 127 not taken.
✗ Branch 60 → 61 not taken.
✓ Branch 60 → 65 taken 27 times.
 54 if(arg_indices.count(argname)) {
315 ✗ throw_err_block(0, err_duplicate_param_name, argname.data(), name);
316 }
317
4/9
✓ Branch 44 → 45 taken 27 times.
✗ Branch 44 → 82 not taken.
✗ Branch 44 → 83 not taken.
✗ Branch 45 → 46 not taken.
✓ Branch 45 → 50 taken 27 times.
✓ Branch 66 → 67 taken 27 times.
✗ Branch 66 → 127 not taken.
✗ Branch 67 → 68 not taken.
✓ Branch 67 → 72 taken 27 times.
 54 if(!confirmname(argname)) {
318 ✗ throw_err_block(0, err_invalid_param_name, argname.data());
319 }
320
2/4
✓ Branch 51 → 52 taken 27 times.
✗ Branch 51 → 82 not taken.
✓ Branch 74 → 75 taken 27 times.
✗ Branch 74 → 127 not taken.
 54 arg_indices.emplace(std::move(argname), i);
321 54 }
322
323
2/5
✓ Branch 55 → 56 taken 24 times.
✗ Branch 55 → 92 not taken.
✗ Branch 55 → 94 not taken.
✓ Branch 81 → 82 taken 24 times.
✗ Branch 81 → 139 not taken.
 48 parse_context ctx{ content, arg_indices };
324
2/5
✓ Branch 56 → 57 taken 24 times.
✗ Branch 56 → 90 not taken.
✗ Branch 56 → 92 not taken.
✓ Branch 83 → 84 taken 24 times.
✗ Branch 83 → 137 not taken.
 48 auto parsed = ctx.parse();
325 48 math_user_function userfunc = { std::move(parsed), arg_count };
326
2/5
✓ Branch 62 → 63 taken 24 times.
✗ Branch 62 → 86 not taken.
✗ Branch 62 → 87 not taken.
✓ Branch 94 → 95 taken 24 times.
✗ Branch 94 → 133 not taken.
 48 user_functions.emplace(name, std::move(userfunc));
327 72 }
328
329 14275 owned_node parse_math_expr(const char * str) {
330 14275 parse_context parse_ctx { str, {}};
331
4/4
✓ Branch 3 → 4 taken 7053 times.
✓ Branch 3 → 8 taken 15 times.
✓ Branch 5 → 6 taken 7192 times.
✓ Branch 5 → 10 taken 15 times.
 28520 return parse_ctx.parse();
332 14275 }
333
334 956 int64_t getnum(const char * str) {
335
2/4
✓ Branch 2 → 3 taken 478 times.
✗ Branch 2 → 22 not taken.
✓ Branch 3 → 4 taken 478 times.
✗ Branch 3 → 37 not taken.
 956 owned_node parsed = parse_math_expr(str);
336
2/4
✓ Branch 4 → 5 taken 478 times.
✗ Branch 4 → 20 not taken.
✓ Branch 11 → 12 taken 478 times.
✗ Branch 11 → 35 not taken.
 956 int haslabel = parsed->has_label();
337 956 foundlabel = haslabel > 0;
338 956 foundlabel_static = haslabel < 2;
339 956 forwardlabel = haslabel == 7;
340
2/4
✓ Branch 7 → 8 taken 478 times.
✗ Branch 7 → 15 not taken.
✓ Branch 19 → 20 taken 478 times.
✗ Branch 19 → 29 not taken.
 1912 math_val rval = parsed->evaluate();
341
2/4
✓ Branch 9 → 10 taken 478 times.
✗ Branch 9 → 18 not taken.
✓ Branch 22 → 23 taken 478 times.
✗ Branch 22 → 33 not taken.
 1912 return rval.get_integer();
342 1912 }
343
344 414 int getlen(const char * orgstr, bool optimizebankextraction) {
345
2/4
✓ Branch 2 → 3 taken 207 times.
✗ Branch 2 → 10 not taken.
✓ Branch 3 → 4 taken 207 times.
✗ Branch 3 → 17 not taken.
 414 owned_node parsed = parse_math_expr(orgstr);
346
2/4
✓ Branch 4 → 5 taken 207 times.
✗ Branch 4 → 8 not taken.
✓ Branch 11 → 12 taken 207 times.
✗ Branch 11 → 15 not taken.
 414 int letgen = parsed->get_len(optimizebankextraction);
347 414 return letgen;
348 414 }
349
350 850 void initmathcore()
351 {
352 850 user_functions.clear();
353 850 }
354
355 840 void deinitmathcore()
356 {
357 //not needed
358 840 }
359