asar coverage - build #264

src/asar/
File: src/asar/asar_math.cpp
Date: 2025-02-28 06:49:25
Lines:
211/226
93.4%
Functions:
11/11
100.0%
Branches:
310/486
63.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 21718 owned_node parse_context::parse_atom() {
54
2/2
✓ Branch 0 taken 7165 times.
✓ Branch 1 taken 14553 times.
 21718 if(*str == '$') {
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 7165 times.
 7165 if (!is_xdigit(*++str)) asar_throw_error(2, error_type_block, error_id_invalid_hex_value);
56 7165 const char* start = str;
57 7165 int64_t ret = 0; // todo error on overflow?
58
2/2
✓ Branch 0 taken 22926 times.
✓ Branch 1 taken 7165 times.
 30091 while (hextable[0 + *str] >= 0) {
59
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 11654 times.
 22926 ret = (ret << 4) | hextable[0 + *str++];
60 }
61 7165 int len = str - start;
62 7165 int len_bytes = (len+1)/2;
63
1/2
✓ Branch 0 taken 7165 times.
✗ Branch 1 not taken.
 7165 return std::make_unique<math_ast_literal>(ret, len_bytes);
64 }
65
8/8
✓ Branch 0 taken 12145 times.
✓ Branch 1 taken 2408 times.
✓ Branch 2 taken 11793 times.
✓ Branch 3 taken 352 times.
✓ Branch 4 taken 6 times.
✓ Branch 5 taken 11787 times.
✓ Branch 6 taken 2766 times.
✓ Branch 7 taken 11787 times.
 14553 if (is_ualpha(*str) || *str=='.' || *str=='?') {
66 2766 const char * start=str;
67
6/6
✓ Branch 0 taken 4054 times.
✓ Branch 1 taken 17988 times.
✓ Branch 2 taken 1288 times.
✓ Branch 3 taken 2766 times.
✓ Branch 4 taken 19276 times.
✓ Branch 5 taken 2766 times.
 22042 while (is_ualnum(*str) || *str == '.') str++;
68 2766 int len=(int)(str-start);
69
2/2
✓ Branch 0 taken 82 times.
✓ Branch 1 taken 2766 times.
 2848 while (*str==' ') str++;
70
2/2
✓ Branch 0 taken 998 times.
✓ Branch 1 taken 1768 times.
 2766 if (*str=='(') {
71 998 str++;
72 998 string func_name;
73
1/2
✓ Branch 0 taken 998 times.
✗ Branch 1 not taken.
 998 func_name.assign(start, len);
74 998 std::vector<owned_node> arguments;
75
2/2
✓ Branch 0 taken 1274 times.
✓ Branch 1 taken 998 times.
 3270 while(*str != ')') {
76
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1274 times.
 1274 while (*str==' ') str++;
77
2/4
✓ Branch 0 taken 1274 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1274 times.
✗ Branch 3 not taken.
 1274 arguments.emplace_back(parse_binops());
78 // is "invalid number" good here?
79
3/4
✓ Branch 0 taken 962 times.
✓ Branch 1 taken 312 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 962 times.
 1274 if(*str != ',' && *str != ')') asar_throw_error(2, error_type_block, error_id_invalid_number);
80
2/2
✓ Branch 0 taken 312 times.
✓ Branch 1 taken 962 times.
 1274 if(*str == ',') str++;
81 }
82 998 str++;
83
1/2
✓ Branch 0 taken 998 times.
✗ Branch 1 not taken.
 998 return std::make_unique<math_ast_function_call>(std::move(arguments), std::move(func_name));
84 998 } else {
85
1/2
✓ Branch 0 taken 1768 times.
✗ Branch 1 not taken.
 1768 string name_part(start, len);
86
2/2
✓ Branch 0 taken 350 times.
✓ Branch 1 taken 1418 times.
 1768 if(name_part == "...") {
87 // a tiny bit ugly, but whatever
88 // ...TODO also not having a constructor for identifier is ugly too
89
2/4
✓ Branch 0 taken 350 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 350 times.
✗ Branch 3 not taken.
 350 math_val value = name_part;
90 350 value.m_type = math_val_type::identifier;
91
1/2
✓ Branch 0 taken 350 times.
✗ Branch 1 not taken.
 350 return std::make_unique<math_ast_literal>(value);
92 350 }
93
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 1364 times.
 1418 if(!function_arg_names.empty()) {
94
1/2
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
 54 auto it = function_arg_names.find(name_part);
95
1/2
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
 54 if(it != function_arg_names.end()) {
96
1/2
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
 54 return std::make_unique<math_ast_function_argument>(it->second);
97 }
98 }
99
1/2
✓ Branch 0 taken 1364 times.
✗ Branch 1 not taken.
 1364 string name = labelname(&start);
100 1364 str = start;
101
2/2
✓ Branch 0 taken 58 times.
✓ Branch 1 taken 1306 times.
 1364 if(*str == '[') {
102 // struct array indexing
103 58 str++;
104
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto index = parse_binops();
105
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 58 times.
 58 if(*str != ']') asar_throw_error(2, error_type_block, error_id_invalid_label_missing_closer);
106 58 str++;
107
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 string subname = name;
108
2/2
✓ Branch 0 taken 56 times.
✓ Branch 1 taken 2 times.
 58 if(*str == '.') {
109 // this part used to be in labelname... not sure where it really belongs....
110
6/6
✓ Branch 0 taken 112 times.
✓ Branch 1 taken 224 times.
✓ Branch 2 taken 56 times.
✓ Branch 3 taken 56 times.
✓ Branch 4 taken 280 times.
✓ Branch 5 taken 56 times.
 336 while (is_ualnum(*str) || *str == '.') {
111
1/2
✓ Branch 0 taken 280 times.
✗ Branch 1 not taken.
 280 subname += *(str++);
112 }
113 }
114 // when doing base[index].sub:
115 // result = (base_addr + index*object_size(base)) + sub_offset
116 // = sub_addr + index*object_size(base)
117 // so we build a math node that represents this calculation
118
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto node_sub = std::make_unique<math_ast_label>(subname);
119
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto node_base = std::make_unique<math_ast_label>(name);
120 58 std::vector<owned_node> arg_list;
121
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 arg_list.emplace_back(std::move(node_base));
122
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto node_objsize = std::make_unique<math_ast_function_call>(std::move(arg_list), "objectsize");
123
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto node_mul = std::make_unique<math_ast_binop>(std::move(node_objsize), std::move(index), math_binop_type::mul);
124
1/2
✓ Branch 0 taken 58 times.
✗ Branch 1 not taken.
 58 auto node_add = std::make_unique<math_ast_binop>(std::move(node_mul), std::move(node_sub), math_binop_type::add);
125 58 return node_add;
126 58 } else {
127
1/2
✓ Branch 0 taken 1306 times.
✗ Branch 1 not taken.
 1306 return std::make_unique<math_ast_label>(name);
128 }
129 1768 }
130 }
131
2/2
✓ Branch 0 taken 164 times.
✓ Branch 1 taken 11623 times.
 11787 if(*str == '(') {
132 164 str++;
133
1/2
✓ Branch 0 taken 164 times.
✗ Branch 1 not taken.
 164 auto res = parse_binops();
134
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 164 times.
 164 if(*str != ')') asar_throw_error(2, error_type_block, error_id_mismatched_parentheses);
135 164 str++;
136 164 return res;
137 164 }
138
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 11599 times.
 11623 if(*str == '%') {
139
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 24 if (str[1] != '0' && str[1] != '1') asar_throw_error(2, error_type_block, error_id_invalid_binary_value);
140 24 const char* start = str+1;
141
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 24 uint64_t res = strtoull(str+1, const_cast<char**>(&str), 2);
142 24 int len = str - start;
143
1/2
✓ Branch 0 taken 24 times.
✗ Branch 1 not taken.
 24 return std::make_unique<math_ast_literal>((int64_t)res, (len+7)/8);
144 }
145
2/2
✓ Branch 0 taken 226 times.
✓ Branch 1 taken 11373 times.
 11599 if (*str=='\'') {
146
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 226 times.
 226 if (!str[1]) asar_throw_error(2, error_type_block, error_id_invalid_character);
147 113 int orig_val;
148 226 str++;
149
1/2
✓ Branch 0 taken 226 times.
✗ Branch 1 not taken.
 226 str += utf8_val(&orig_val, str);
150
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);
151
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 226 times.
 226 if (*str != '\'') asar_throw_error(2, error_type_block, error_id_invalid_character);
152
1/2
✓ Branch 0 taken 226 times.
✗ Branch 1 not taken.
 226 int64_t rval=thetable.get_val(orig_val);
153
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 226 times.
 226 if (rval == -1)
154 {
155 // RPG Hacker: Should be fine to not check return value of codepoint_to_utf8() here, because
156 // our error cases above already made sure that orig_val contains valid data at this point.
157 ✗ string u8_str;
158 ✗ codepoint_to_utf8(&u8_str, orig_val);
159 ✗ asar_throw_error(2, error_type_block, error_id_undefined_char, u8_str.data());
160 ✗ }
161 226 str++;
162
1/2
✓ Branch 0 taken 226 times.
✗ Branch 1 not taken.
 226 return std::make_unique<math_ast_literal>(rval, 1);
163 }
164
2/2
✓ Branch 0 taken 11221 times.
✓ Branch 1 taken 152 times.
 11373 if (is_digit(*str)) {
165 11221 const char* end = str;
166 11221 bool is_float = false;
167
6/6
✓ Branch 0 taken 11353 times.
✓ Branch 1 taken 14555 times.
✓ Branch 2 taken 132 times.
✓ Branch 3 taken 11221 times.
✓ Branch 4 taken 14687 times.
✓ Branch 5 taken 11221 times.
 25908 while (is_digit(*end) || *end == '.') {
168
2/2
✓ Branch 0 taken 132 times.
✓ Branch 1 taken 14555 times.
 14687 if(*end == '.') is_float = true;
169 14687 end++;
170 }
171 11221 string number;
172
1/2
✓ Branch 0 taken 11221 times.
✗ Branch 1 not taken.
 11221 number.assign(str, (int)(end - str));
173 11221 str = end;
174
2/2
✓ Branch 0 taken 132 times.
✓ Branch 1 taken 11089 times.
 11221 if(is_float) {
175
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 66 times.
 132 double res = std::atof(number);
176
1/2
✓ Branch 0 taken 132 times.
✗ Branch 1 not taken.
 132 return std::make_unique<math_ast_literal>(res);
177 } else {
178
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5568 times.
 11089 int64_t res = strtoll(number, nullptr, 10);
179
4/4
✓ Branch 0 taken 11075 times.
✓ Branch 1 taken 14 times.
✓ Branch 2 taken 85 times.
✓ Branch 3 taken 10990 times.
 11089 int len = (res >= 0x10000) ? 3 : (res >= 0x100) ? 2 : 1;
180
1/2
✓ Branch 0 taken 11089 times.
✗ Branch 1 not taken.
 11089 return std::make_unique<math_ast_literal>(res, len);
181 }
182 11221 }
183
2/2
✓ Branch 0 taken 142 times.
✓ Branch 1 taken 10 times.
 152 if(*str == '"') {
184 142 const char * strpos = str + 1;
185
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 142 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 142 while (*str!='"' && *str!='\0') str++;
186
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 74 times.
 142 str = strchr(str + 1, '"'); // TODO don't we have string escapes????
187
1/2
✓ Branch 0 taken 142 times.
✗ Branch 1 not taken.
 142 string tempname(strpos , (int)(str - strpos));
188 142 str++;
189
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 142 times.
 142 while (*str==' ') str++; //eat space
190
1/2
✓ Branch 0 taken 142 times.
✗ Branch 1 not taken.
 142 return std::make_unique<math_ast_literal>(tempname);
191 142 }
192 10 asar_throw_error(2, error_type_block, error_id_invalid_number);
193 }
194
195 21814 owned_node parse_context::parse_unops() {
196
2/2
✓ Branch 0 taken 2580 times.
✓ Branch 1 taken 21814 times.
 24394 while(*str == ' ') str++;
197 // optimize for the common case
198 // TODO how much of an optimization is this really?
199
2/2
✓ Branch 0 taken 7165 times.
✓ Branch 1 taken 14649 times.
 21814 if(*str == '$') return parse_atom();
200
201
2/2
✓ Branch 0 taken 64 times.
✓ Branch 1 taken 14585 times.
 14649 if(*str == '-') {
202 64 str++;
203
2/4
✓ Branch 0 taken 64 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 64 times.
✗ Branch 3 not taken.
 64 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::neg);
204
2/2
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 14577 times.
 14585 } else if(*str == '~') {
205 8 str++;
206
2/4
✓ Branch 0 taken 8 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
 8 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bit_not);
207
4/4
✓ Branch 0 taken 34 times.
✓ Branch 1 taken 14543 times.
✓ Branch 2 taken 24 times.
✓ Branch 3 taken 10 times.
 14577 } else if(*str == '<' && str[1] == ':') {
208 24 str += 2;
209
2/4
✓ Branch 0 taken 24 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 24 times.
✗ Branch 3 not taken.
 24 return std::make_unique<math_ast_unop>(parse_unops(), math_unop_type::bank_extract);
210
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 14553 times.
 14553 } else if(*str == '+') {
211 ✗ str++;
212 ✗ return parse_unops();
213 }
214 14553 else return parse_atom();
215 }
216
217 21754 owned_node parse_context::parse_binops(int depth) {
218 21754 const char* posneglabel = str;
219
1/2
✓ Branch 0 taken 21754 times.
✗ Branch 1 not taken.
 21754 string posnegname = posneglabelname(&posneglabel, false);
220
4/4
✓ Branch 0 taken 82 times.
✓ Branch 1 taken 21672 times.
✓ Branch 2 taken 36 times.
✓ Branch 3 taken 21718 times.
 21836 if (posnegname.length() > 0 &&
221
3/4
✓ Branch 0 taken 46 times.
✓ Branch 1 taken 36 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 46 times.
 82 (*posneglabel == '\0' || *posneglabel == ')')) {
222 36 str = posneglabel;
223
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 return std::make_unique<math_ast_label>(posnegname);
224 }
225
226
1/2
✓ Branch 0 taken 21718 times.
✗ Branch 1 not taken.
 21718 recurseblock rec;
227
228
2/2
✓ Branch 0 taken 21708 times.
✓ Branch 1 taken 10 times.
 21718 owned_node left = parse_unops();
229 21708 owned_node right;
230
2/2
✓ Branch 0 taken 2580 times.
✓ Branch 1 taken 21708 times.
 24288 while(*str == ' ') str++;
231
8/8
✓ Branch 0 taken 6710 times.
✓ Branch 1 taken 20110 times.
✓ Branch 2 taken 5554 times.
✓ Branch 3 taken 1156 times.
✓ Branch 4 taken 5242 times.
✓ Branch 5 taken 312 times.
✓ Branch 6 taken 5184 times.
✓ Branch 7 taken 58 times.
 26820 while (*str && *str != ')' && *str != ','&& *str != ']') {
232
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5184 times.
 5184 while(*str == ' ') str++;
233 // TODO can we make this macro a bit nicer???
234 #define oper(name, thisdepth, contents) \
235 if (!strncmp(str, name, strlen(name))) \
236 { \
237 if (depth<=thisdepth) \
238 { \
239 str += strlen(name); \
240 right = parse_binops(thisdepth+1); \
241 left = std::make_unique<math_ast_binop>(std::move(left), std::move(right), contents); \
242 continue; \
243 } \
244 else return left; \
245 }
246
7/10
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 5178 times.
✓ Branch 2 taken 12 times.
✓ Branch 3 taken 2588 times.
✓ Branch 4 taken 12 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 12 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 6 times.
✗ Branch 9 not taken.
 5184 oper("**", 6, math_binop_type::pow);
247
5/8
✓ Branch 0 taken 36 times.
✓ Branch 1 taken 5136 times.
✓ Branch 2 taken 36 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 36 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 36 times.
✗ Branch 7 not taken.
 5172 oper("*", 5, math_binop_type::mul);
248
5/8
✓ Branch 0 taken 38 times.
✓ Branch 1 taken 5098 times.
✓ Branch 2 taken 38 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 38 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 38 times.
✗ Branch 7 not taken.
 5136 oper("/", 5, math_binop_type::div);
249
1/8
✗ Branch 0 not taken.
✓ Branch 1 taken 5098 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 5098 oper("%", 5, math_binop_type::mod);
250
6/8
✓ Branch 0 taken 1968 times.
✓ Branch 1 taken 3130 times.
✓ Branch 2 taken 1948 times.
✓ Branch 3 taken 20 times.
✓ Branch 4 taken 1948 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 1948 times.
✗ Branch 7 not taken.
 5098 oper("+", 4, math_binop_type::add);
251
5/8
✓ Branch 0 taken 526 times.
✓ Branch 1 taken 2604 times.
✓ Branch 2 taken 526 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 526 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 526 times.
✗ Branch 7 not taken.
 3130 oper("-", 4, math_binop_type::sub);
252
7/10
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2601 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1299 times.
✓ Branch 4 taken 6 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 6 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 3 times.
✗ Branch 9 not taken.
 2604 oper("<<", 3, math_binop_type::shift_left);
253
7/10
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 2583 times.
✓ Branch 2 taken 30 times.
✓ Branch 3 taken 1284 times.
✓ Branch 4 taken 30 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 30 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 15 times.
✗ Branch 9 not taken.
 2598 oper(">>", 3, math_binop_type::shift_right);
254
255 //these two needed checked early to avoid bitwise from eating a operator
256
8/10
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 2553 times.
✓ Branch 2 taken 24 times.
✓ Branch 3 taken 1275 times.
✓ Branch 4 taken 18 times.
✓ Branch 5 taken 6 times.
✓ Branch 6 taken 18 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 9 times.
✗ Branch 9 not taken.
 2568 oper("&&", 0, math_binop_type::logical_and);
257
8/10
✓ Branch 0 taken 9 times.
✓ Branch 1 taken 2529 times.
✓ Branch 2 taken 15 times.
✓ Branch 3 taken 1263 times.
✓ Branch 4 taken 12 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 12 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 6 times.
✗ Branch 9 not taken.
 2538 oper("||", 0, math_binop_type::logical_or);
258
1/8
✗ Branch 0 not taken.
✓ Branch 1 taken 2520 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 2520 oper("&", 2, math_binop_type::bit_and);
259
5/8
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 2512 times.
✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 8 times.
✗ Branch 7 not taken.
 2520 oper("|", 2,math_binop_type::bit_or);
260
1/8
✗ Branch 0 not taken.
✓ Branch 1 taken 2512 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✗ Branch 7 not taken.
 2512 oper("^", 2, math_binop_type::bit_xor);
261
262
7/10
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2509 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1253 times.
✓ Branch 4 taken 6 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 6 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 3 times.
✗ Branch 9 not taken.
 2512 oper(">=", 1, math_binop_type::comp_ge);
263
7/10
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 2503 times.
✓ Branch 2 taken 6 times.
✓ Branch 3 taken 1250 times.
✓ Branch 4 taken 6 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 6 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 3 times.
✗ Branch 9 not taken.
 2506 oper("<=", 1, math_binop_type::comp_le);
264
5/8
✓ Branch 0 taken 138 times.
✓ Branch 1 taken 2362 times.
✓ Branch 2 taken 138 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 138 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 138 times.
✗ Branch 7 not taken.
 2500 oper(">", 1, math_binop_type::comp_gt);
265
5/8
✓ Branch 0 taken 1800 times.
✓ Branch 1 taken 562 times.
✓ Branch 2 taken 1800 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 1800 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 1800 times.
✗ Branch 7 not taken.
 2362 oper("<", 1, math_binop_type::comp_lt);
266
8/10
✓ Branch 0 taken 249 times.
✓ Branch 1 taken 313 times.
✓ Branch 2 taken 495 times.
✓ Branch 3 taken 35 times.
✓ Branch 4 taken 492 times.
✓ Branch 5 taken 3 times.
✓ Branch 6 taken 492 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 246 times.
✗ Branch 9 not taken.
 562 oper("==", 1, math_binop_type::comp_eq);
267
8/10
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 40 times.
✓ Branch 2 taken 42 times.
✓ Branch 3 taken 14 times.
✓ Branch 4 taken 36 times.
✓ Branch 5 taken 6 times.
✓ Branch 6 taken 36 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 18 times.
✗ Branch 9 not taken.
 64 oper("!=", 1, math_binop_type::comp_ne);
268 16 asar_throw_error(2, error_type_block, error_id_unknown_operator);
269 #undef oper
270 }
271 21636 return left;
272 21812 }
273
274 15146 owned_node parse_context::parse() {
275 15146 auto res = parse_binops();
276
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 15120 times.
 15120 if(*str) {
277 ✗ if(*str == ',') asar_throw_error(2, error_type_block, error_id_invalid_input);
278 ✗ else asar_throw_error(2, error_type_block, error_id_mismatched_parentheses);
279 }
280 15120 return res;
281 ✗ }
282
283 36 void createuserfunc(const char * name, const char * arguments, const char * content) {
284
12/30
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 36 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 36 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 36 times.
✗ Branch 7 not taken.
✓ Branch 8 taken 36 times.
✗ Branch 9 not taken.
✗ Branch 10 not taken.
✓ Branch 11 taken 36 times.
✓ Branch 12 taken 36 times.
✗ Branch 13 not taken.
✓ Branch 14 taken 36 times.
✗ Branch 15 not taken.
✓ Branch 16 taken 18 times.
✓ Branch 17 taken 18 times.
✓ Branch 18 taken 18 times.
✗ Branch 19 not taken.
✗ Branch 20 not taken.
✓ Branch 21 taken 18 times.
✗ Branch 22 not taken.
✗ Branch 23 not taken.
✗ Branch 24 not taken.
✗ Branch 25 not taken.
✗ Branch 26 not taken.
✗ Branch 27 not taken.
✗ Branch 28 not taken.
✗ Branch 29 not taken.
 36 if(user_functions.count(name) != 0 || builtin_functions.count(name) != 0) {
285 ✗ asar_throw_error(0, error_type_block, error_id_function_redefined, name);
286 }
287
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 string arguments_buf = arguments;
288 // TODO: if we want to be more lenient with spaces in the `function`
289 // command, then we need to handle spaces inside `arguments_buf`
290 18 int numargs;
291
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 autoptr<char**> spl = split(arguments_buf.raw(), ',', &numargs);
292 36 size_t arg_count = numargs;
293
9/16
✓ Branch 0 taken 18 times.
✓ Branch 1 taken 18 times.
✓ Branch 2 taken 18 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 18 times.
✓ Branch 6 taken 18 times.
✓ Branch 7 taken 18 times.
✓ Branch 8 taken 9 times.
✓ Branch 9 taken 27 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 18 times.
✗ Branch 12 not taken.
✗ Branch 13 not taken.
✗ Branch 14 not taken.
✗ Branch 15 not taken.
 36 if(numargs == 1 && spl[0] == string{""}) {
294 ✗ arg_count = 0;
295 }
296 36 std::unordered_map<string, size_t> arg_indices;
297
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 36 times.
 90 for(size_t i = 0; i < arg_count; i++) {
298
1/2
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
 54 string argname = spl[i];
299
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)) {
300 ✗ asar_throw_error(0, error_type_block, error_id_duplicate_param_name, argname.data(), name);
301 }
302
2/4
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 54 times.
 54 if(!confirmname(argname)) {
303 ✗ asar_throw_error(0, error_type_block, error_id_invalid_param_name, argname.data());
304 }
305
1/2
✓ Branch 0 taken 54 times.
✗ Branch 1 not taken.
 54 arg_indices.emplace(std::move(argname), i);
306 54 }
307
308
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 parse_context ctx{ content, arg_indices };
309
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 auto parsed = ctx.parse();
310 36 math_user_function userfunc = { std::move(parsed), arg_count };
311
1/2
✓ Branch 0 taken 36 times.
✗ Branch 1 not taken.
 36 user_functions.emplace(name, std::move(userfunc));
312 54 }
313
314 11906 double math(const char * str)
315 {
316 11906 parse_context parse_ctx { str, {}};
317
2/2
✓ Branch 0 taken 11886 times.
✓ Branch 1 taken 20 times.
 11906 owned_node parsed = parse_ctx.parse();
318
1/2
✓ Branch 0 taken 11886 times.
✗ Branch 1 not taken.
 11886 int haslabel = parsed->has_label();
319 11886 foundlabel = haslabel > 0;
320 11886 foundlabel_static = haslabel < 2;
321 11886 forwardlabel=false; // TODO
322 11886 math_eval_context ctx;
323
2/2
✓ Branch 0 taken 11814 times.
✓ Branch 1 taken 72 times.
 11886 math_val rval = parsed->evaluate(ctx);
324
1/2
✓ Branch 0 taken 11814 times.
✗ Branch 1 not taken.
 23628 return rval.get_double();
325 12050 }
326
327 9961 int64_t getnum(const char* instr)
328 {
329 9961 double num = math(instr);
330
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 9871 times.
 9871 if(num < (double)INT64_MIN) {
331 ✗ return INT64_MIN;
332
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 9871 times.
 9871 } else if(num > (double)INT64_MAX) {
333 ✗ return INT64_MAX;
334 }
335 9871 return (int64_t)num;
336 }
337
338 // RPG Hacker: Same function as above, but doesn't truncate our number via int conversion
339 1940 double getnumdouble(const char * instr)
340 {
341 1940 return math(instr);
342 }
343
344 3204 int getlen(const char * orgstr, bool optimizebankextraction) {
345 3204 parse_context parse_ctx { orgstr, {}};
346
2/2
✓ Branch 0 taken 3198 times.
✓ Branch 1 taken 6 times.
 3204 owned_node parsed = parse_ctx.parse();
347
1/2
✓ Branch 0 taken 3198 times.
✗ Branch 1 not taken.
 3198 int letgen = parsed->get_len(optimizebankextraction);
348 3198 return letgen;
349 3204 }
350
351 825 void initmathcore()
352 {
353 825 user_functions.clear();
354 825 }
355
356 815 void deinitmathcore()
357 {
358 //not needed
359 815 }
360