asar coverage - build #268

src/asar/
File: src/asar/math_parse.cpp
Date: 2025-03-01 20:34:29
Lines:
203/215
94.4%
Functions:
10/10
100.0%
Branches:
509/762
66.8%
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 20806 owned_node parse_context::parse_atom() {
54
4/4
✓ Branch 0 taken 3202 times.
✓ Branch 1 taken 7122 times.
✓ Branch 2 taken 3298 times.
✓ Branch 3 taken 7184 times.
 20806 if(*str == '$') {
55
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 3202 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 3298 times.
 6500 if (!is_xdigit(*++str)) asar_throw_error(2, error_type_block, error_id_invalid_hex_value);
56 6500 const char* start = str;
57 6500 int64_t ret = 0; // todo error on overflow?
58
4/4
✓ Branch 0 taken 10396 times.
✓ Branch 1 taken 3202 times.
✓ Branch 2 taken 10774 times.
✓ Branch 3 taken 3298 times.
 27670 while (hextable[0 + *str] >= 0) {
59
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 10774 times.
 21170 ret = (ret << 4) | hextable[0 + *str++];
60 }
61 6500 int len = str - start;
62 6500 int len_bytes = (len+1)/2;
63
2/3
✓ Branch 0 taken 3202 times.
✓ Branch 1 taken 3298 times.
✗ Branch 2 not taken.
 6500 return std::make_unique<math_ast_literal>(ret, len_bytes);
64 }
65
14/14
✓ Branch 0 taken 6036 times.
✓ Branch 1 taken 1086 times.
✓ Branch 2 taken 5860 times.
✓ Branch 3 taken 6264 times.
✓ Branch 4 taken 1099 times.
✓ Branch 5 taken 5857 times.
✓ Branch 6 taken 1265 times.
✓ Branch 7 taken 5857 times.
✓ Branch 8 taken 5912 times.
✓ Branch 9 taken 176 times.
✓ Branch 10 taken 3 times.
✓ Branch 11 taken 5909 times.
✓ Branch 12 taken 1275 times.
✓ Branch 13 taken 5909 times.
 14306 if (is_ualpha(*str) || *str=='.' || *str=='?') {
66 2540 const char * start=str;
67
12/12
✓ Branch 0 taken 1887 times.
✓ Branch 1 taken 8062 times.
✓ Branch 2 taken 622 times.
✓ Branch 3 taken 1265 times.
✓ Branch 4 taken 8684 times.
✓ Branch 5 taken 1265 times.
✓ Branch 6 taken 1897 times.
✓ Branch 7 taken 8120 times.
✓ Branch 8 taken 622 times.
✓ Branch 9 taken 1275 times.
✓ Branch 10 taken 8742 times.
✓ Branch 11 taken 1275 times.
 19966 while (is_ualnum(*str) || *str == '.') str++;
68 2540 int len=(int)(str-start);
69
4/4
✓ Branch 0 taken 39 times.
✓ Branch 1 taken 1265 times.
✓ Branch 2 taken 39 times.
✓ Branch 3 taken 1275 times.
 2618 while (*str==' ') str++;
70
4/4
✓ Branch 0 taken 499 times.
✓ Branch 1 taken 766 times.
✓ Branch 2 taken 505 times.
✓ Branch 3 taken 770 times.
 2540 if (*str=='(') {
71 1004 str++;
72 1004 string func_name;
73
1/2
✓ Branch 0 taken 1004 times.
✗ Branch 1 not taken.
 1004 func_name.assign(start, len);
74 1004 std::vector<owned_node> arguments;
75
4/4
✓ Branch 0 taken 625 times.
✓ Branch 1 taken 499 times.
✓ Branch 2 taken 631 times.
✓ Branch 3 taken 505 times.
 3264 while(*str != ')') {
76
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 625 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 631 times.
 1256 while (*str==' ') str++;
77
4/7
✓ Branch 0 taken 625 times.
✓ Branch 1 taken 631 times.
✓ Branch 2 taken 625 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 631 times.
✗ Branch 6 not taken.
 1256 arguments.emplace_back(parse_binops());
78 // is "invalid number" good here?
79
5/7
✓ Branch 0 taken 469 times.
✓ Branch 1 taken 156 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 944 times.
✓ Branch 4 taken 156 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 475 times.
 1256 if(*str != ',' && *str != ')') asar_throw_error(2, error_type_block, error_id_invalid_number);
80
4/4
✓ Branch 0 taken 156 times.
✓ Branch 1 taken 469 times.
✓ Branch 2 taken 156 times.
✓ Branch 3 taken 475 times.
 1256 if(*str == ',') str++;
81 }
82 1004 str++;
83
2/4
✓ Branch 0 taken 499 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 505 times.
✗ Branch 3 not taken.
 1004 return std::make_unique<math_ast_function_call>(std::move(arguments), std::move(func_name));
84 1004 } else {
85
2/3
✓ Branch 0 taken 766 times.
✓ Branch 1 taken 770 times.
✗ Branch 2 not taken.
 1536 string name_part(start, len);
86
2/2
✓ Branch 0 taken 350 times.
✓ Branch 1 taken 1186 times.
 1536 if(name_part == "...") {
87 // a tiny bit ugly, but whatever
88
4/8
✓ Branch 0 taken 175 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 350 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 350 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 175 times.
✗ Branch 7 not taken.
 350 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 564 times.
✓ Branch 2 taken 27 times.
✓ Branch 3 taken 568 times.
 1186 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 564 times.
✓ Branch 1 taken 568 times.
✗ Branch 2 not taken.
 1132 string name = labelname(&start);
97 1132 str = start;
98
4/4
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 539 times.
✓ Branch 2 taken 25 times.
✓ Branch 3 taken 543 times.
 1132 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/4
✗ Branch 0 not taken.
✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 25 times.
 50 if(*str != ']') asar_throw_error(2, error_type_block, error_id_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/3
✓ Branch 0 taken 539 times.
✓ Branch 1 taken 543 times.
✗ Branch 2 not taken.
 1082 return std::make_unique<math_ast_label>(name);
125 }
126 1536 }
127 }
128
4/4
✓ Branch 0 taken 82 times.
✓ Branch 1 taken 5775 times.
✓ Branch 2 taken 82 times.
✓ Branch 3 taken 5827 times.
 11766 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/4
✗ Branch 0 not taken.
✓ Branch 1 taken 82 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 82 times.
 164 if(*str != ')') asar_throw_error(2, error_type_block, error_id_mismatched_parentheses);
132 164 str++;
133 164 return res;
134 164 }
135
4/4
✓ Branch 0 taken 10 times.
✓ Branch 1 taken 5765 times.
✓ Branch 2 taken 10 times.
✓ Branch 3 taken 5817 times.
 11602 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') asar_throw_error(2, error_type_block, error_id_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 113 times.
✓ Branch 1 taken 5652 times.
✓ Branch 2 taken 113 times.
✓ Branch 3 taken 5704 times.
 11582 if (*str=='\'') {
143
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 113 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 113 times.
 226 if (!str[1]) asar_throw_error(2, error_type_block, error_id_invalid_character);
144 113 int orig_val;
145 226 str++;
146
2/4
✓ Branch 0 taken 113 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 113 times.
✗ Branch 3 not taken.
 226 str += utf8_val(&orig_val, str);
147
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 226 times.
 226 if (orig_val == -1) asar_throw_error(0, error_type_block, error_id_invalid_utf8);
148
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 113 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 113 times.
 226 if (*str != '\'') asar_throw_error(2, error_type_block, error_id_invalid_character);
149
2/4
✓ Branch 0 taken 113 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 113 times.
✗ Branch 3 not taken.
 226 int64_t rval=thetable.get_val(orig_val);
150
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 226 times.
 226 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 ✗ asar_throw_error(2, error_type_block, error_id_undefined_char, u8_str.data());
157 ✗ }
158 226 str++;
159
2/4
✓ Branch 0 taken 113 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 113 times.
✗ Branch 3 not taken.
 226 return std::make_unique<math_ast_literal>(rval, 1);
160 }
161
4/4
✓ Branch 0 taken 5579 times.
✓ Branch 1 taken 73 times.
✓ Branch 2 taken 5625 times.
✓ Branch 3 taken 79 times.
 11356 if (is_digit(*str)) {
162 11204 const char* end = str;
163 11204 bool is_float = false;
164
8/8
✓ Branch 0 taken 5645 times.
✓ Branch 1 taken 12913 times.
✓ Branch 2 taken 7356 times.
✓ Branch 3 taken 5579 times.
✓ Branch 4 taken 7354 times.
✓ Branch 5 taken 11204 times.
✓ Branch 6 taken 7356 times.
✓ Branch 7 taken 5625 times.
 25848 while (is_digit(*end) || *end == '.') {
165
3/3
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 7288 times.
✓ Branch 2 taken 7290 times.
 14644 if(*end == '.') is_float = true;
166 14644 end++;
167 }
168 11204 string number;
169
2/4
✓ Branch 0 taken 5579 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 5625 times.
✗ Branch 3 not taken.
 11204 number.assign(str, (int)(end - str));
170 11204 str = end;
171
2/2
✓ Branch 0 taken 132 times.
✓ Branch 1 taken 11072 times.
 11204 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 5559 times.
 11072 int64_t res = strtoll(number, nullptr, 10);
176
5/5
✓ Branch 0 taken 5507 times.
✓ Branch 1 taken 5559 times.
✓ Branch 2 taken 43 times.
✓ Branch 3 taken 5512 times.
✓ Branch 4 taken 5511 times.
 11072 int len = (res >= 0x10000) ? 3 : (res >= 0x100) ? 2 : 1;
177
2/3
✓ Branch 0 taken 5513 times.
✓ Branch 1 taken 5559 times.
✗ Branch 2 not taken.
 11072 return std::make_unique<math_ast_literal>(res, len);
178 }
179 11204 }
180
4/4
✓ Branch 0 taken 68 times.
✓ Branch 1 taken 5 times.
✓ Branch 2 taken 74 times.
✓ Branch 3 taken 5 times.
 152 if(*str == '"') {
181 142 const char * strpos = str + 1;
182
2/8
✗ Branch 0 not taken.
✓ Branch 1 taken 68 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 74 times.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 142 while (*str!='"' && *str!='\0') str++;
183
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 74 times.
 142 str = strchr(str + 1, '"'); // TODO don't we have string escapes????
184
2/4
✓ Branch 0 taken 68 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 74 times.
✗ Branch 3 not taken.
 142 string tempname(strpos , (int)(str - strpos));
185 142 str++;
186
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 68 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 74 times.
 142 while (*str==' ') str++; //eat space
187
2/3
✓ Branch 0 taken 68 times.
✓ Branch 1 taken 74 times.
✗ Branch 2 not taken.
 142 return std::make_unique<math_ast_literal>(tempname);
188 142 }
189 10 asar_throw_error(2, error_type_block, error_id_invalid_number);
190 }
191
192 20896 owned_node parse_context::parse_unops() {
193
4/4
✓ Branch 0 taken 1290 times.
✓ Branch 1 taken 10369 times.
✓ Branch 2 taken 1290 times.
✓ Branch 3 taken 10527 times.
 23476 while(*str == ' ') str++;
194 // optimize for the common case
195 // TODO how much of an optimization is this really?
196
4/4
✓ Branch 0 taken 3202 times.
✓ Branch 1 taken 7167 times.
✓ Branch 2 taken 3298 times.
✓ Branch 3 taken 7229 times.
 20896 if(*str == '$') return parse_atom();
197
198
4/4
✓ Branch 0 taken 32 times.
✓ Branch 1 taken 7135 times.
✓ Branch 2 taken 32 times.
✓ Branch 3 taken 7197 times.
 14396 if(*str == '-') {
199 64 str++;
200
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);
201
4/4
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 7131 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 7193 times.
 14332 } else if(*str == '~') {
202 8 str++;
203
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);
204
7/7
✓ Branch 0 taken 14 times.
✓ Branch 1 taken 7117 times.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 19 times.
✓ Branch 4 taken 7179 times.
✓ Branch 5 taken 9 times.
✓ Branch 6 taken 5 times.
 14324 } else if(*str == '<' && str[1] == ':') {
205 18 str += 2;
206
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);
207
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 7122 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 7184 times.
 14306 } else if(*str == '+') {
208 ✗ str++;
209 ✗ return parse_unops();
210 }
211 14306 else return parse_atom();
212 }
213
214 20840 owned_node parse_context::parse_binops(int depth) {
215 20840 const char* posneglabel = str;
216
2/3
✓ Branch 0 taken 10338 times.
✓ Branch 1 taken 10502 times.
✗ Branch 2 not taken.
 20840 string posnegname = posneglabelname(&posneglabel, false);
217
4/4
✓ Branch 0 taken 80 times.
✓ Branch 1 taken 20760 times.
✓ Branch 2 taken 34 times.
✓ Branch 3 taken 20806 times.
 20920 if (posnegname.length() > 0 &&
218
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 == ')')) {
219 34 str = posneglabel;
220
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);
221 }
222
223
2/3
✓ Branch 0 taken 10324 times.
✓ Branch 1 taken 10482 times.
✗ Branch 2 not taken.
 20806 recurseblock rec;
224
225
3/3
✓ Branch 0 taken 10319 times.
✓ Branch 1 taken 10482 times.
✓ Branch 2 taken 5 times.
 20806 owned_node left = parse_unops();
226 20796 owned_node right;
227
4/4
✓ Branch 0 taken 1290 times.
✓ Branch 1 taken 10319 times.
✓ Branch 2 taken 1290 times.
✓ Branch 3 taken 10477 times.
 23376 while(*str == ' ') str++;
228
14/14
✓ Branch 0 taken 3337 times.
✓ Branch 1 taken 9536 times.
✓ Branch 2 taken 2771 times.
✓ Branch 3 taken 3913 times.
✓ Branch 4 taken 12303 times.
✓ Branch 5 taken 156 times.
✓ Branch 6 taken 2590 times.
✓ Branch 7 taken 25 times.
✓ Branch 8 taken 2775 times.
✓ Branch 9 taken 572 times.
✓ Branch 10 taken 2619 times.
✓ Branch 11 taken 156 times.
✓ Branch 12 taken 2594 times.
✓ Branch 13 taken 25 times.
 25908 while (*str && *str != ')' && *str != ','&& *str != ']') {
229
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 2590 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2594 times.
 5184 while(*str == ' ') str++;
230 // TODO can we make this macro a bit nicer???
231 #define oper(name, thisdepth, contents) \
232 if (!strncmp(str, name, strlen(name))) \
233 { \
234 if (depth<=thisdepth) \
235 { \
236 str += strlen(name); \
237 right = parse_binops(thisdepth+1); \
238 left = std::make_unique<math_ast_binop>(std::move(left), std::move(right), contents); \
239 continue; \
240 } \
241 else return left; \
242 }
243
9/14
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 2584 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 2594 times.
✓ Branch 4 taken 12 times.
✓ Branch 5 taken 2588 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.
 5184 oper("**", 6, math_binop_type::pow);
244
9/13
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 2566 times.
✓ Branch 2 taken 18 times.
✓ Branch 3 taken 18 times.
✓ Branch 4 taken 2588 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.
 5172 oper("*", 5, math_binop_type::mul);
245
9/13
✓ Branch 0 taken 17 times.
✓ Branch 1 taken 2549 times.
✓ Branch 2 taken 17 times.
✓ Branch 3 taken 17 times.
✓ Branch 4 taken 2570 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.
 5136 oper("/", 5, math_binop_type::div);
246
2/13
✗ Branch 0 not taken.
✓ Branch 1 taken 2549 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 2553 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.
 5102 oper("%", 5, math_binop_type::mod);
247
9/13
✓ Branch 0 taken 985 times.
✓ Branch 1 taken 1564 times.
✓ Branch 2 taken 975 times.
✓ Branch 3 taken 999 times.
✓ Branch 4 taken 2539 times.
✓ Branch 5 taken 979 times.
✓ Branch 6 taken 985 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 979 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 979 times.
✗ Branch 12 not taken.
 5102 oper("+", 4, math_binop_type::add);
248
9/13
✓ Branch 0 taken 263 times.
✓ Branch 1 taken 1301 times.
✓ Branch 2 taken 263 times.
✓ Branch 3 taken 263 times.
✓ Branch 4 taken 1564 times.
✓ Branch 5 taken 263 times.
✓ Branch 6 taken 263 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 263 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 263 times.
✗ Branch 12 not taken.
 3128 oper("-", 4, math_binop_type::sub);
249
9/14
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1298 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 1301 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 1298 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.
 2602 oper("<<", 3, math_binop_type::shift_left);
250
9/14
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 1286 times.
✓ Branch 2 taken 12 times.
✓ Branch 3 taken 1298 times.
✓ Branch 4 taken 24 times.
✓ Branch 5 taken 1286 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.
 2596 oper(">>", 3, math_binop_type::shift_right);
251
252 //these two needed checked early to avoid bitwise from eating a operator
253
10/14
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 1271 times.
✓ Branch 2 taken 9 times.
✓ Branch 3 taken 1292 times.
✓ Branch 4 taken 24 times.
✓ Branch 5 taken 1271 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.
 2572 oper("&&", 0, math_binop_type::logical_and);
254
10/14
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 1262 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1274 times.
✓ Branch 4 taken 15 times.
✓ Branch 5 taken 1262 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.
 2542 oper("||", 0, math_binop_type::logical_or);
255
2/13
✗ Branch 0 not taken.
✓ Branch 1 taken 1262 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1262 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.
 2524 oper("&", 2, math_binop_type::bit_and);
256
9/13
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1259 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 3 times.
✓ Branch 4 taken 1262 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.
 2524 oper("|", 2,math_binop_type::bit_or);
257
2/13
✗ Branch 0 not taken.
✓ Branch 1 taken 1259 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✓ Branch 4 taken 1259 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.
 2518 oper("^", 2, math_binop_type::bit_xor);
258
259
9/14
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1256 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 1259 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 1256 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.
 2518 oper(">=", 1, math_binop_type::comp_ge);
260
9/14
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 1253 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 1256 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 1253 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.
 2512 oper("<=", 1, math_binop_type::comp_le);
261
9/13
✓ Branch 0 taken 69 times.
✓ Branch 1 taken 1184 times.
✓ Branch 2 taken 69 times.
✓ Branch 3 taken 69 times.
✓ Branch 4 taken 1253 times.
✓ Branch 5 taken 69 times.
✓ Branch 6 taken 69 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 69 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 69 times.
✗ Branch 12 not taken.
 2506 oper(">", 1, math_binop_type::comp_gt);
262
9/13
✓ Branch 0 taken 900 times.
✓ Branch 1 taken 284 times.
✓ Branch 2 taken 900 times.
✓ Branch 3 taken 900 times.
✓ Branch 4 taken 1184 times.
✓ Branch 5 taken 900 times.
✓ Branch 6 taken 900 times.
✗ Branch 7 not taken.
✗ Branch 8 not taken.
✓ Branch 9 taken 900 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 900 times.
✗ Branch 12 not taken.
 2368 oper("<", 1, math_binop_type::comp_lt);
263
10/14
✓ Branch 0 taken 252 times.
✓ Branch 1 taken 32 times.
✓ Branch 2 taken 249 times.
✓ Branch 3 taken 287 times.
✓ Branch 4 taken 501 times.
✓ Branch 5 taken 32 times.
✓ Branch 6 taken 498 times.
✓ Branch 7 taken 3 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 249 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 249 times.
✗ Branch 13 not taken.
 568 oper("==", 1, math_binop_type::comp_eq);
264
10/14
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 8 times.
✓ Branch 2 taken 18 times.
✓ Branch 3 taken 38 times.
✓ Branch 4 taken 42 times.
✓ Branch 5 taken 8 times.
✓ Branch 6 taken 36 times.
✓ Branch 7 taken 6 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 10 taken 18 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 18 times.
✗ Branch 13 not taken.
 64 oper("!=", 1, math_binop_type::comp_ne);
265 16 asar_throw_error(2, error_type_block, error_id_unknown_operator);
266 #undef oper
267 }
268 20724 return left;
269 20898 }
270
271 14258 owned_node parse_context::parse() {
272 14258 auto res = parse_binops();
273
2/4
✗ Branch 0 not taken.
✓ Branch 1 taken 7039 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 7193 times.
 14232 if(*str) {
274 ✗ if(*str == ',') asar_throw_error(2, error_type_block, error_id_invalid_input);
275 ✗ else asar_throw_error(2, error_type_block, error_id_mismatched_parentheses);
276 }
277 14232 return res;
278 ✗ }
279
280 48 void createuserfunc(const char * name, const char * arguments, const char * content) {
281
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) {
282 ✗ asar_throw_error(0, error_type_block, error_id_function_redefined, name);
283 }
284
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 string arguments_buf = arguments;
285 // TODO: if we want to be more lenient with spaces in the `function`
286 // command, then we need to handle spaces inside `arguments_buf`
287 24 int numargs;
288
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);
289 48 size_t arg_count = numargs;
290
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{""}) {
291 12 arg_count = 0;
292 }
293 48 std::unordered_map<string, size_t> arg_indices;
294
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++) {
295
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];
296
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)) {
297 ✗ asar_throw_error(0, error_type_block, error_id_duplicate_param_name, argname.data(), name);
298 }
299
2/4
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
 54 if(!confirmname(argname)) {
300 ✗ asar_throw_error(0, error_type_block, error_id_invalid_param_name, argname.data());
301 }
302
2/3
✓ Branch 0 taken 27 times.
✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
 54 arg_indices.emplace(std::move(argname), i);
303 54 }
304
305
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 parse_context ctx{ content, arg_indices };
306
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 auto parsed = ctx.parse();
307 48 math_user_function userfunc = { std::move(parsed), arg_count };
308
2/3
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
 48 user_functions.emplace(name, std::move(userfunc));
309 72 }
310
311 14210 owned_node parse_math_expr(const char * str) {
312 14210 parse_context parse_ctx { str, {}};
313
3/3
✓ Branch 0 taken 7015 times.
✓ Branch 1 taken 7182 times.
✓ Branch 2 taken 13 times.
 28394 return parse_ctx.parse();
314 14210 }
315
316 3114 int64_t getnum(const char * str) {
317
3/3
✓ Branch 0 taken 1525 times.
✓ Branch 1 taken 1582 times.
✓ Branch 2 taken 7 times.
 3114 owned_node parsed = parse_math_expr(str);
318
2/4
✓ Branch 0 taken 1525 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1575 times.
✗ Branch 3 not taken.
 3100 int haslabel = parsed->has_label();
319 3100 foundlabel = haslabel > 0;
320 3100 foundlabel_static = haslabel < 2;
321 3100 forwardlabel = haslabel == 7;
322
4/4
✓ Branch 0 taken 1491 times.
✓ Branch 1 taken 34 times.
✓ Branch 2 taken 1541 times.
✓ Branch 3 taken 34 times.
 6268 math_val rval = parsed->evaluate();
323
1/2
✓ Branch 0 taken 3032 times.
✗ Branch 1 not taken.
 6064 return rval.get_integer();
324 6200 }
325
326 414 int getlen(const char * orgstr, bool optimizebankextraction) {
327
2/3
✓ Branch 0 taken 207 times.
✓ Branch 1 taken 207 times.
✗ Branch 2 not taken.
 414 owned_node parsed = parse_math_expr(orgstr);
328
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);
329 414 return letgen;
330 414 }
331
332 831 void initmathcore()
333 {
334 831 user_functions.clear();
335 831 }
336
337 821 void deinitmathcore()
338 {
339 //not needed
340 821 }
341