asar coverage - build #293

src/asar/
File: src/asar/math_parse.cpp
Date: 2025-03-12 03:01:09
Lines:
209/221
94.6%
Functions:
10/10
100.0%
Branches:
531/817
65.0%
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 21191 owned_node parse_context::parse_atom() {
54
4/4
✓ Branch 0 taken 3208 times.
✓ Branch 1 taken 7304 times.
✓ Branch 2 taken 3304 times.
✓ Branch 3 taken 7375 times.
 21191 if(*str == '$') {
55
2/8
✗ Branch 0 not taken.
✓ Branch 1 taken 3208 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 3304 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 6512 if (!is_xdigit(*++str)) throw_err_block(2, err_invalid_hex_value);
56 6512 const char* start = str;
57 6512 int64_t ret = 0; // todo error on overflow?
58
4/4
✓ Branch 0 taken 10417 times.
✓ Branch 1 taken 3208 times.
✓ Branch 2 taken 10795 times.
✓ Branch 3 taken 3304 times.
 27724 while (hextable[0 + *str] >= 0) {
59
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10795 times.
 21212 ret = (ret << 4) | hextable[0 + *str++];
60 }
61 6512 int len = str - start;
62 6512 int len_bytes = (len+1)/2;
63
2/3
✓ Branch 0 taken 3208 times.
✓ Branch 1 taken 3304 times.
✗ Branch 2 not taken.
 6512 return std::make_unique<math_ast_literal>(ret, len_bytes);
64 }
65
14/14
✓ Branch 0 taken 6195 times.
✓ Branch 1 taken 1109 times.
✓ Branch 2 taken 6012 times.
✓ Branch 3 taken 6436 times.
✓ Branch 4 taken 1125 times.
✓ Branch 5 taken 6009 times.
✓ Branch 6 taken 1295 times.
✓ Branch 7 taken 6009 times.
✓ Branch 8 taken 6070 times.
✓ Branch 9 taken 183 times.
✓ Branch 10 taken 3 times.
✓ Branch 11 taken 6067 times.
✓ Branch 12 taken 1308 times.
✓ Branch 13 taken 6067 times.
 14679 if (is_ualpha(*str) || *str=='.' || *str=='?') {
66 2603 const char * start=str;
67
12/12
✓ Branch 0 taken 1926 times.
✓ Branch 1 taken 8048 times.
✓ Branch 2 taken 631 times.
✓ Branch 3 taken 1295 times.
✓ Branch 4 taken 8679 times.
✓ Branch 5 taken 1295 times.
✓ Branch 6 taken 1939 times.
✓ Branch 7 taken 8115 times.
✓ Branch 8 taken 631 times.
✓ Branch 9 taken 1308 times.
✓ Branch 10 taken 8746 times.
✓ Branch 11 taken 1308 times.
 20028 while (is_ualnum(*str) || *str == '.') str++;
68 2603 int len=(int)(str-start);
69
4/4
✓ Branch 0 taken 39 times.
✓ Branch 1 taken 1295 times.
✓ Branch 2 taken 39 times.
✓ Branch 3 taken 1308 times.
 2681 while (*str==' ') str++;
70
4/4
✓ Branch 0 taken 533 times.
✓ Branch 1 taken 762 times.
✓ Branch 2 taken 542 times.
✓ Branch 3 taken 766 times.
 2603 if (*str=='(') {
71 1075 str++;
72 1075 string func_name;
73
1/2
✓ Branch 0 taken 1075 times.
✗ Branch 1 not taken.
 1075 func_name.assign(start, len);
74 1075 std::vector<owned_node> arguments;
75
4/4
✓ Branch 0 taken 675 times.
✓ Branch 1 taken 533 times.
✓ Branch 2 taken 684 times.
✓ Branch 3 taken 542 times.
 3509 while(*str != ')') {
76
4/4
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 675 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 684 times.
 1365 while (*str==' ') str++;
77
4/7
✓ Branch 0 taken 675 times.
✓ Branch 1 taken 684 times.
✓ Branch 2 taken 675 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 684 times.
✗ Branch 6 not taken.
 1359 arguments.emplace_back(parse_binops());
78 // is "invalid number" good here?
79
5/11
✓ Branch 0 taken 503 times.
✓ Branch 1 taken 172 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 1015 times.
✓ Branch 4 taken 172 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✓ Branch 8 taken 512 times.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
 1359 if(*str != ',' && *str != ')') throw_err_block(2, err_invalid_number);
80
4/4
✓ Branch 0 taken 172 times.
✓ Branch 1 taken 503 times.
✓ Branch 2 taken 172 times.
✓ Branch 3 taken 512 times.
 1359 if(*str == ',') str++;
81 }
82 1075 str++;
83
2/4
✓ Branch 0 taken 533 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 542 times.
✗ Branch 3 not taken.
 1075 return std::make_unique<math_ast_function_call>(std::move(arguments), std::move(func_name));
84 1075 } else {
85
2/3
✓ Branch 0 taken 762 times.
✓ Branch 1 taken 766 times.
✗ Branch 2 not taken.
 1528 string name_part(start, len);
86
2/2
✓ Branch 0 taken 352 times.
✓ Branch 1 taken 1176 times.
 1528 if(name_part == "...") {
87 // a tiny bit ugly, but whatever
88
4/8
✓ Branch 0 taken 176 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 352 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 352 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 176 times.
✗ Branch 7 not taken.
 352 return std::make_unique<math_ast_literal>(math_val::make_identifier(name_part));
89 }
90
4/4
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 559 times.
✓ Branch 2 taken 27 times.
✓ Branch 3 taken 563 times.
 1176 if(!function_arg_names.empty()) {
91
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 auto it = function_arg_names.find(name_part);
92
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 if(it != function_arg_names.end()) {
93
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 return std::make_unique<math_ast_function_argument>(it->second);
94 }
95 }
96
2/3
✓ Branch 0 taken 559 times.
✓ Branch 1 taken 563 times.
✗ Branch 2 not taken.
 1122 string name = labelname(&start);
97 1122 str = start;
98
4/4
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 534 times.
✓ Branch 2 taken 25 times.
✓ Branch 3 taken 538 times.
 1122 if(*str == '[') {
99 // struct array indexing
100 50 str++;
101
2/3
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
 50 auto index = parse_binops();
102
2/6
✗ Branch 0 not taken.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 25 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
 50 if(*str != ']') throw_err_block(2, err_invalid_label_missing_closer);
103 50 str++;
104
2/3
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
 50 string subname = name;
105
4/4
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 1 times.
✓ Branch 2 taken 24 times.
✓ Branch 3 taken 1 times.
 50 if(*str == '.') {
106 // this part used to be in labelname... not sure where it really belongs....
107
10/10
✓ Branch 0 taken 48 times.
✓ Branch 1 taken 96 times.
✓ Branch 2 taken 24 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 216 times.
✓ Branch 5 taken 24 times.
✓ Branch 6 taken 24 times.
✓ Branch 7 taken 24 times.
✓ Branch 8 taken 120 times.
✓ Branch 9 taken 24 times.
 288 while (is_ualnum(*str) || *str == '.') {
108
2/4
✓ Branch 0 taken 120 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 120 times.
✗ Branch 3 not taken.
 240 subname += *(str++);
109 }
110 }
111 // when doing base[index].sub:
112 // result = (base_addr + index*object_size(base)) + sub_offset
113 // = sub_addr + index*object_size(base)
114 // so we build a math node that represents this calculation
115
2/3
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
 50 auto node_sub = std::make_unique<math_ast_label>(subname);
116
2/3
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
 50 auto node_base = std::make_unique<math_ast_label>(name);
117 50 std::vector<owned_node> arg_list;
118
2/3
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
 50 arg_list.emplace_back(std::move(node_base));
119
2/4
✓ Branch 0 taken 25 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 25 times.
✗ Branch 3 not taken.
 50 auto node_objsize = std::make_unique<math_ast_function_call>(std::move(arg_list), "objectsize");
120
2/4
✓ Branch 0 taken 25 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 25 times.
✗ Branch 3 not taken.
 50 auto node_mul = std::make_unique<math_ast_binop>(std::move(node_objsize), std::move(index), math_binop_type::mul);
121
2/4
✓ Branch 0 taken 25 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 25 times.
✗ Branch 3 not taken.
 50 auto node_add = std::make_unique<math_ast_binop>(std::move(node_mul), std::move(node_sub), math_binop_type::add);
122 50 return node_add;
123 50 } else {
124
2/4
✓ Branch 0 taken 534 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 538 times.
✗ Branch 3 not taken.
 1072 return std::make_unique<math_ast_label>(std::move(name));
125 }
126 1528 }
127 }
128
4/4
✓ Branch 0 taken 82 times.
✓ Branch 1 taken 5927 times.
✓ Branch 2 taken 82 times.
✓ Branch 3 taken 5985 times.
 12076 if(*str == '(') {
129 164 str++;
130
2/3
✓ Branch 0 taken 82 times.
✓ Branch 1 taken 82 times.
✗ Branch 2 not taken.
 164 auto res = parse_binops();
131
2/6
✗ Branch 0 not taken.
✓ Branch 1 taken 82 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 82 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
 164 if(*str != ')') throw_err_block(2, err_mismatched_parentheses);
132 164 str++;
133 164 return res;
134 164 }
135
4/4
✓ Branch 0 taken 10 times.
✓ Branch 1 taken 5917 times.
✓ Branch 2 taken 10 times.
✓ Branch 3 taken 5975 times.
 11912 if(*str == '%') {
136
2/8
✗ Branch 0 not taken.
✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 10 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 20 if (str[1] != '0' && str[1] != '1') throw_err_block(2, err_invalid_binary_value);
137 20 const char* start = str+1;
138
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10 times.
 20 uint64_t res = strtoull(str+1, const_cast<char**>(&str), 2);
139 20 int len = str - start;
140
2/4
✓ Branch 0 taken 10 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 10 times.
✗ Branch 3 not taken.
 20 return std::make_unique<math_ast_literal>((int64_t)res, (len+7)/8);
141 }
142
4/4
✓ Branch 0 taken 116 times.
✓ Branch 1 taken 5801 times.
✓ Branch 2 taken 116 times.
✓ Branch 3 taken 5859 times.
 11892 if (*str=='\'') {
143
2/7
✗ Branch 0 not taken.
✓ Branch 1 taken 116 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 116 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 232 if (!str[1]) throw_err_block(2, err_invalid_character);
144 116 int orig_val;
145 232 str++;
146
2/4
✓ Branch 0 taken 116 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 116 times.
✗ Branch 3 not taken.
 232 str += utf8_val(&orig_val, str);
147
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 232 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 232 if (orig_val == -1) throw_err_block(0, err_invalid_utf8);
148
2/6
✗ Branch 0 not taken.
✓ Branch 1 taken 116 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 116 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
 232 if (*str != '\'') throw_err_block(2, err_invalid_character);
149
2/4
✓ Branch 0 taken 116 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 116 times.
✗ Branch 3 not taken.
 232 int64_t rval=thetable.get_val(orig_val);
150
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 232 times.
 232 if (rval == -1)
151 {
152 // RPG Hacker: Should be fine to not check return value of codepoint_to_utf8() here, because
153 // our error cases above already made sure that orig_val contains valid data at this point.
154 ✗ string u8_str;
155 ✗ codepoint_to_utf8(&u8_str, orig_val);
156 ✗ throw_err_block(2, err_undefined_char, u8_str.data());
157 ✗ }
158 232 str++;
159
2/4
✓ Branch 0 taken 116 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 116 times.
✗ Branch 3 not taken.
 232 return std::make_unique<math_ast_literal>(rval, 1);
160 }
161
4/4
✓ Branch 0 taken 5591 times.
✓ Branch 1 taken 210 times.
✓ Branch 2 taken 5637 times.
✓ Branch 3 taken 222 times.
 11660 if (is_digit(*str)) {
162 11228 const char* end = str;
163 11228 bool is_float = false;
164
8/8
✓ Branch 0 taken 5657 times.
✓ Branch 1 taken 12937 times.
✓ Branch 2 taken 7368 times.
✓ Branch 3 taken 5591 times.
✓ Branch 4 taken 7366 times.
✓ Branch 5 taken 11228 times.
✓ Branch 6 taken 7368 times.
✓ Branch 7 taken 5637 times.
 25896 while (is_digit(*end) || *end == '.') {
165
3/3
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 7300 times.
✓ Branch 2 taken 7302 times.
 14668 if(*end == '.') is_float = true;
166 14668 end++;
167 }
168 11228 string number;
169
2/4
✓ Branch 0 taken 5591 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 5637 times.
✗ Branch 3 not taken.
 11228 number.assign(str, (int)(end - str));
170 11228 str = end;
171
2/2
✓ Branch 0 taken 132 times.
✓ Branch 1 taken 11096 times.
 11228 if(is_float) {
172
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 66 times.
 132 double res = std::atof(number);
173
2/3
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 66 times.
✗ Branch 2 not taken.
 132 return std::make_unique<math_ast_literal>(res);
174 } else {
175
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5571 times.
 11096 int64_t res = strtoll(number, nullptr, 10);
176
5/5
✓ Branch 0 taken 5519 times.
✓ Branch 1 taken 5571 times.
✓ Branch 2 taken 43 times.
✓ Branch 3 taken 5524 times.
✓ Branch 4 taken 5523 times.
 11096 int len = (res >= 0x10000) ? 3 : (res >= 0x100) ? 2 : 1;
177
2/3
✓ Branch 0 taken 5525 times.
✓ Branch 1 taken 5571 times.
✗ Branch 2 not taken.
 11096 return std::make_unique<math_ast_literal>(res, len);
178 }
179 11228 }
180
4/4
✓ Branch 0 taken 204 times.
✓ Branch 1 taken 6 times.
✓ Branch 2 taken 216 times.
✓ Branch 3 taken 6 times.
 432 if(*str == '"') {
181 420 const char * strpos = str + 1;
182
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 216 times.
 420 str = strchr(strpos, '"');
183
2/7
✗ Branch 0 not taken.
✓ Branch 1 taken 204 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 216 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 420 if(!str) throw_err_block(2, err_mismatched_quotes);
184
2/4
✓ Branch 0 taken 204 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 216 times.
✗ Branch 3 not taken.
 420 string output(strpos, str - strpos);
185
5/6
✓ Branch 0 taken 210 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 228 times.
✓ Branch 3 taken 204 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 216 times.
 432 while(str && str[1] == '"') {
186 // we hit an escaped quote
187
1/2
✓ Branch 0 taken 12 times.
✗ Branch 1 not taken.
 12 output += '"';
188 12 strpos = str+2;
189
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
 12 str = strchr(strpos, '"');
190
2/7
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 6 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
 12 if(!str) throw_err_block(2, err_mismatched_quotes);
191
2/4
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
 12 output.append(strpos, 0, str - strpos);
192 }
193 420 str++;
194
4/4
✓ Branch 0 taken 36 times.
✓ Branch 1 taken 204 times.
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 216 times.
 492 while (*str==' ') str++; //eat space
195
2/4
✓ Branch 0 taken 204 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 216 times.
✗ Branch 3 not taken.
 420 return std::make_unique<math_ast_literal>(std::move(output));
196 420 }
197 12 throw_err_block(2, err_invalid_number);
198 }
199
200 21281 owned_node parse_context::parse_unops() {
201
4/4
✓ Branch 0 taken 1350 times.
✓ Branch 1 taken 10557 times.
✓ Branch 2 taken 1350 times.
✓ Branch 3 taken 10724 times.
 23981 while(*str == ' ') str++;
202 // optimize for the common case
203 // TODO how much of an optimization is this really?
204
4/4
✓ Branch 0 taken 3208 times.
✓ Branch 1 taken 7349 times.
✓ Branch 2 taken 3304 times.
✓ Branch 3 taken 7420 times.
 21281 if(*str == '$') return parse_atom();
205
206
4/4
✓ Branch 0 taken 32 times.
✓ Branch 1 taken 7317 times.
✓ Branch 2 taken 32 times.
✓ Branch 3 taken 7388 times.
 14769 if(*str == '-') {
207 64 str++;
208
4/7
✓ Branch 0 taken 32 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 32 times.
✓ Branch 3 taken 32 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 32 times.
✗ Branch 6 not taken.
 64 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::neg);
209
4/4
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 7313 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 7384 times.
 14705 } else if(*str == '~') {
210 8 str++;
211
4/7
✓ Branch 0 taken 4 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 4 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 4 times.
✗ Branch 6 not taken.
 8 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bit_not);
212
7/7
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 7298 times.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 21 times.
✓ Branch 4 taken 7369 times.
✓ Branch 5 taken 9 times.
✓ Branch 6 taken 6 times.
 14697 } else if(*str == '<' && str[1] == ':') {
213 18 str += 2;
214
4/7
✓ Branch 0 taken 9 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 9 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 9 times.
✗ Branch 6 not taken.
 18 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bank_extract);
215
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 7304 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 7375 times.
 14679 } else if(*str == '+') {
216 ✗ str++;
217 ✗ return parse_unops();
218 }
219 14679 else return parse_atom();
220 }
221
222 21225 owned_node parse_context::parse_binops(int depth) {
223 21225 const char* posneglabel = str;
224
2/3
✓ Branch 0 taken 10526 times.
✓ Branch 1 taken 10699 times.
✗ Branch 2 not taken.
 21225 string posnegname = posneglabelname(&posneglabel, false);
225
4/4
✓ Branch 0 taken 80 times.
✓ Branch 1 taken 21145 times.
✓ Branch 2 taken 34 times.
✓ Branch 3 taken 21191 times.
 21305 if (posnegname.length() > 0 &&
226
5/6
✓ Branch 0 taken 23 times.
✓ Branch 1 taken 37 times.
✓ Branch 2 taken 20 times.
✓ Branch 3 taken 23 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 23 times.
 80 (*posneglabel == '\0' || *posneglabel == ')')) {
227 34 str = posneglabel;
228
2/3
✓ Branch 0 taken 14 times.
✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
 34 return std::make_unique<math_ast_label>(posnegname);
229 }
230
231
2/3
✓ Branch 0 taken 10512 times.
✓ Branch 1 taken 10679 times.
✗ Branch 2 not taken.
 21191 recurseblock rec;
232
233
3/3
✓ Branch 0 taken 10506 times.
✓ Branch 1 taken 10679 times.
✓ Branch 2 taken 6 times.
 21191 owned_node left = parse_unops();
234 21179 owned_node right;
235
4/4
✓ Branch 0 taken 1296 times.
✓ Branch 1 taken 10506 times.
✓ Branch 2 taken 1296 times.
✓ Branch 3 taken 10673 times.
 23771 while(*str == ' ') str++;
236
14/14
✓ Branch 0 taken 3431 times.
✓ Branch 1 taken 9668 times.
✓ Branch 2 taken 2829 times.
✓ Branch 3 taken 4047 times.
✓ Branch 4 taken 12482 times.
✓ Branch 5 taken 172 times.
✓ Branch 6 taken 2632 times.
✓ Branch 7 taken 25 times.
✓ Branch 8 taken 2833 times.
✓ Branch 9 taken 612 times.
✓ Branch 10 taken 2661 times.
✓ Branch 11 taken 172 times.
✓ Branch 12 taken 2636 times.
✓ Branch 13 taken 25 times.
 26369 while (*str && *str != ')' && *str != ','&& *str != ']') {
237
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 2632 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2636 times.
 5268 while(*str == ' ') str++;
238 // TODO can we make this macro a bit nicer???
239 #define oper(name, thisdepth, contents) \
240 if (!strncmp(str, name, strlen(name))) \
241 { \
242 if (depth<=thisdepth) \
243 { \
244 str += strlen(name); \
245 right = parse_binops(thisdepth+1); \
246 left = std::make_unique<math_ast_binop>(std::move(left), std::move(right), contents); \
247 continue; \
248 } \
249 else return left; \
250 }
251
9/14
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 2626 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 2636 times.
✓ Branch 4 taken 12 times.
✓ Branch 5 taken 2630 times.
✓ Branch 6 taken 12 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 6 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 6 times.
✗ Branch 13 not taken.
 5268 oper("**", 6, math_binop_type::pow);
252
9/13
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 2608 times.
✓ Branch 2 taken 18 times.
✓ Branch 3 taken 18 times.
✓ Branch 4 taken 2630 times.
✓ Branch 5 taken 18 times.
✓ Branch 6 taken 18 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 18 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 18 times.
✗ Branch 12 not taken.
 5256 oper("*", 5, math_binop_type::mul);
253
9/13
✓ Branch 0 taken 17 times.
✓ Branch 1 taken 2591 times.
✓ Branch 2 taken 17 times.
✓ Branch 3 taken 17 times.
✓ Branch 4 taken 2612 times.
✓ Branch 5 taken 17 times.
✓ Branch 6 taken 17 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 17 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 17 times.
✗ Branch 12 not taken.
 5220 oper("/", 5, math_binop_type::div);
254
9/13
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2588 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 3 times.
✓ Branch 4 taken 2595 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 3 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 3 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 3 times.
✗ Branch 12 not taken.
 5186 oper("%", 5, math_binop_type::mod);
255
9/13
✓ Branch 0 taken 991 times.
✓ Branch 1 taken 1597 times.
✓ Branch 2 taken 981 times.
✓ Branch 3 taken 1005 times.
✓ Branch 4 taken 2578 times.
✓ Branch 5 taken 985 times.
✓ Branch 6 taken 991 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 985 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 985 times.
✗ Branch 12 not taken.
 5180 oper("+", 4, math_binop_type::add);
256
9/13
✓ Branch 0 taken 269 times.
✓ Branch 1 taken 1328 times.
✓ Branch 2 taken 269 times.
✓ Branch 3 taken 269 times.
✓ Branch 4 taken 1597 times.
✓ Branch 5 taken 269 times.
✓ Branch 6 taken 269 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 269 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 269 times.
✗ Branch 12 not taken.
 3194 oper("-", 4, math_binop_type::sub);
257
9/14
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1325 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 1328 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 1325 times.
✓ Branch 6 taken 6 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 3 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 3 times.
✗ Branch 13 not taken.
 2656 oper("<<", 3, math_binop_type::shift_left);
258
9/14
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 1313 times.
✓ Branch 2 taken 12 times.
✓ Branch 3 taken 1325 times.
✓ Branch 4 taken 24 times.
✓ Branch 5 taken 1313 times.
✓ Branch 6 taken 24 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 12 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 12 times.
✗ Branch 13 not taken.
 2650 oper(">>", 3, math_binop_type::shift_right);
259
260 //these two needed checked early to avoid bitwise from eating a operator
261
10/14
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 1298 times.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 1319 times.
✓ Branch 4 taken 24 times.
✓ Branch 5 taken 1298 times.
✓ Branch 6 taken 18 times.
✓ Branch 7 taken 6 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 9 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 9 times.
✗ Branch 13 not taken.
 2626 oper("&&", 0, math_binop_type::logical_and);
262
10/14
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 1289 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1301 times.
✓ Branch 4 taken 15 times.
✓ Branch 5 taken 1289 times.
✓ Branch 6 taken 12 times.
✓ Branch 7 taken 3 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 6 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 6 times.
✗ Branch 13 not taken.
 2596 oper("||", 0, math_binop_type::logical_or);
263
2/13
✗ Branch 0 not taken.
✓ Branch 1 taken 1289 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1289 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 2578 oper("&", 2, math_binop_type::bit_and);
264
9/13
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1286 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 3 times.
✓ Branch 4 taken 1289 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 3 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 3 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 3 times.
✗ Branch 12 not taken.
 2578 oper("|", 2,math_binop_type::bit_or);
265
2/13
✗ Branch 0 not taken.
✓ Branch 1 taken 1286 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1286 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✗ Branch 11 not taken.
✗ Branch 12 not taken.
 2572 oper("^", 2, math_binop_type::bit_xor);
266
267
9/14
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 1280 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1286 times.
✓ Branch 4 taken 12 times.
✓ Branch 5 taken 1280 times.
✓ Branch 6 taken 12 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 6 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 6 times.
✗ Branch 13 not taken.
 2572 oper(">=", 1, math_binop_type::comp_ge);
268
9/14
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1277 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 1280 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 1277 times.
✓ Branch 6 taken 6 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 3 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 3 times.
✗ Branch 13 not taken.
 2560 oper("<=", 1, math_binop_type::comp_le);
269
9/13
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 1205 times.
✓ Branch 2 taken 72 times.
✓ Branch 3 taken 72 times.
✓ Branch 4 taken 1277 times.
✓ Branch 5 taken 72 times.
✓ Branch 6 taken 72 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 72 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 72 times.
✗ Branch 12 not taken.
 2554 oper(">", 1, math_binop_type::comp_gt);
270
9/13
✓ Branch 0 taken 906 times.
✓ Branch 1 taken 299 times.
✓ Branch 2 taken 906 times.
✓ Branch 3 taken 906 times.
✓ Branch 4 taken 1205 times.
✓ Branch 5 taken 906 times.
✓ Branch 6 taken 906 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 906 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 906 times.
✗ Branch 12 not taken.
 2410 oper("<", 1, math_binop_type::comp_lt);
271
10/14
✓ Branch 0 taken 261 times.
✓ Branch 1 taken 38 times.
✓ Branch 2 taken 255 times.
✓ Branch 3 taken 305 times.
✓ Branch 4 taken 516 times.
✓ Branch 5 taken 38 times.
✓ Branch 6 taken 510 times.
✓ Branch 7 taken 6 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 255 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 255 times.
✗ Branch 13 not taken.
 598 oper("==", 1, math_binop_type::comp_eq);
272
10/14
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 24 times.
✓ Branch 3 taken 44 times.
✓ Branch 4 taken 54 times.
✓ Branch 5 taken 8 times.
✓ Branch 6 taken 48 times.
✓ Branch 7 taken 6 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 24 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 24 times.
✗ Branch 13 not taken.
 76 oper("!=", 1, math_binop_type::comp_ne);
273
1/2
✓ Branch 0 taken 16 times.
✗ Branch 1 not taken.
 16 throw_err_block(2, err_unknown_operator);
274 #undef oper
275 }
276 21101 return left;
277 21285 }
278
279 14462 owned_node parse_context::parse() {
280 14462 auto res = parse_binops();
281
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 7137 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 7297 times.
 14434 if(*str) {
282 ✗ if(*str == ',') throw_err_block(2, err_invalid_input);
283 ✗ else throw_err_block(2, err_mismatched_parentheses);
284 }
285 14434 return res;
286 ✗ }
287
288 48 void createuserfunc(const char * name, const char * arguments, const char * content) {
289
19/38
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✓ Branch 2 taken 24 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 24 times.
✓ Branch 5 taken 24 times.
✓ Branch 6 taken 24 times.
✓ Branch 7 taken 24 times.
✓ Branch 8 taken 24 times.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✓ Branch 11 taken 48 times.
✓ Branch 12 taken 24 times.
✗ Branch 13 not taken.
✓ Branch 14 taken 24 times.
✓ Branch 15 taken 24 times.
✗ Branch 16 not taken.
✓ Branch 17 taken 24 times.
✓ Branch 18 taken 24 times.
✓ Branch 19 taken 24 times.
✗ Branch 20 not taken.
✗ Branch 21 not taken.
✓ Branch 22 taken 24 times.
✗ Branch 23 not taken.
✓ Branch 24 taken 24 times.
✗ Branch 25 not taken.
✓ Branch 26 taken 24 times.
✗ Branch 27 not taken.
✗ Branch 28 not taken.
✓ Branch 29 taken 24 times.
✗ Branch 30 not taken.
✗ Branch 31 not taken.
✗ Branch 32 not taken.
✗ Branch 33 not taken.
✗ Branch 34 not taken.
✗ Branch 35 not taken.
✗ Branch 36 not taken.
✗ Branch 37 not taken.
 48 if(user_functions.count(name) != 0 || builtin_functions.count(name) != 0) {
290 ✗ throw_err_block(0, err_function_redefined, name);
291 }
292
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 string arguments_buf = arguments;
293 // TODO: if we want to be more lenient with spaces in the `function`
294 // command, then we need to handle spaces inside `arguments_buf`
295 24 int numargs;
296
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 autoptr<char**> spl = split(arguments_buf.raw(), ',', &numargs);
297 48 size_t arg_count = numargs;
298
16/21
✓ Branch 0 taken 30 times.
✓ Branch 1 taken 18 times.
✓ Branch 2 taken 15 times.
✓ Branch 3 taken 15 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 9 times.
✓ Branch 6 taken 15 times.
✓ Branch 7 taken 9 times.
✓ Branch 8 taken 12 times.
✓ Branch 9 taken 27 times.
✓ Branch 10 taken 15 times.
✓ Branch 11 taken 9 times.
✗ Branch 12 not taken.
✓ Branch 13 taken 15 times.
✓ Branch 14 taken 9 times.
✓ Branch 15 taken 6 times.
✓ Branch 16 taken 18 times.
✗ Branch 17 not taken.
✗ Branch 18 not taken.
✗ Branch 19 not taken.
✗ Branch 20 not taken.
 48 if(numargs == 1 && spl[0] == string{""}) {
299 12 arg_count = 0;
300 }
301 48 std::unordered_map<string, size_t> arg_indices;
302
3/3
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 51 times.
✓ Branch 2 taken 24 times.
 102 for(size_t i = 0; i < arg_count; i++) {
303
2/4
✓ Branch 0 taken 27 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
 54 string argname = spl[i];
304
2/4
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
 54 if(arg_indices.count(argname)) {
305 ✗ throw_err_block(0, err_duplicate_param_name, argname.data(), name);
306 }
307
2/4
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
 54 if(!confirmname(argname)) {
308 ✗ throw_err_block(0, err_invalid_param_name, argname.data());
309 }
310
2/3
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
 54 arg_indices.emplace(std::move(argname), i);
311 54 }
312
313
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 parse_context ctx{ content, arg_indices };
314
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 auto parsed = ctx.parse();
315 48 math_user_function userfunc = { std::move(parsed), arg_count };
316
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 user_functions.emplace(name, std::move(userfunc));
317 72 }
318
319 14414 owned_node parse_math_expr(const char * str) {
320 14414 parse_context parse_ctx { str, {}};
321
3/3
✓ Branch 0 taken 7113 times.
✓ Branch 1 taken 7287 times.
✓ Branch 2 taken 14 times.
 28800 return parse_ctx.parse();
322 14414 }
323
324 1292 int64_t getnum(const char * str) {
325
2/3
✓ Branch 0 taken 643 times.
✓ Branch 1 taken 649 times.
✗ Branch 2 not taken.
 1292 owned_node parsed = parse_math_expr(str);
326
2/4
✓ Branch 0 taken 643 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 649 times.
✗ Branch 3 not taken.
 1292 int haslabel = parsed->has_label();
327 1292 foundlabel = haslabel > 0;
328 1292 foundlabel_static = haslabel < 2;
329 1292 forwardlabel = haslabel == 7;
330
4/4
✓ Branch 0 taken 604 times.
✓ Branch 1 taken 39 times.
✓ Branch 2 taken 610 times.
✓ Branch 3 taken 39 times.
 2662 math_val rval = parsed->evaluate();
331
1/2
✓ Branch 0 taken 1214 times.
✗ Branch 1 not taken.
 2428 return rval.get_integer();
332 2584 }
333
334 414 int getlen(const char * orgstr, bool optimizebankextraction) {
335
2/3
✓ Branch 0 taken 207 times.
✓ Branch 1 taken 207 times.
✗ Branch 2 not taken.
 414 owned_node parsed = parse_math_expr(orgstr);
336
2/4
✓ Branch 0 taken 207 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 207 times.
✗ Branch 3 not taken.
 414 int letgen = parsed->get_len(optimizebankextraction);
337 414 return letgen;
338 414 }
339
340 843 void initmathcore()
341 {
342 843 user_functions.clear();
343 843 }
344
345 833 void deinitmathcore()
346 {
347 //not needed
348 833 }
349