Mercurial > hg-old > index.cgi
annotate lwasm/expr.c @ 188:bb2665c7005c
Added --extract and --replace to lwar
author | lost |
---|---|
date | Sun, 22 Mar 2009 06:51:48 +0000 |
parents | bf69160da467 |
children | 29ba546ceea0 |
rev | line source |
---|---|
13
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
1 /* |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
2 expr.c |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
3 Copyright © 2008 William Astle |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
4 |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
5 This file is part of LWASM. |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
6 |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
7 LWASM is free software: you can redistribute it and/or modify it under the |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
8 terms of the GNU General Public License as published by the Free Software |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
9 Foundation, either version 3 of the License, or (at your option) any later |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
10 version. |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
11 |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
12 This program is distributed in the hope that it will be useful, but WITHOUT |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
15 more details. |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
16 |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
17 You should have received a copy of the GNU General Public License along with |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
18 this program. If not, see <http://www.gnu.org/licenses/>. |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
19 */ |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
20 |
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
21 /* |
18 | 22 This file contains the actual expression evaluator |
13
05d4115b4860
Started work on new expression evaluator system and major code re-work for next release
lost
parents:
diff
changeset
|
23 */ |
14 | 24 |
25 #define __expr_c_seen__ | |
15 | 26 |
18 | 27 #include <ctype.h> |
15 | 28 #include <stdlib.h> |
18 | 29 #include <string.h> |
15 | 30 |
14 | 31 #include "expr.h" |
17 | 32 #include "util.h" |
40
d2cee0c335e7
adjusted symbol rules to accept symbols starting with @ but not @<digit>
lost
parents:
39
diff
changeset
|
33 #include "lwasm.h" |
39 | 34 |
17 | 35 lwasm_expr_stack_t *lwasm_expr_stack_create(void) |
36 { | |
37 lwasm_expr_stack_t *s; | |
38 | |
39 s = lwasm_alloc(sizeof(lwasm_expr_stack_t)); | |
40 s -> head = NULL; | |
41 s -> tail = NULL; | |
42 return s; | |
43 } | |
15 | 44 |
17 | 45 void lwasm_expr_stack_free(lwasm_expr_stack_t *s) |
46 { | |
47 while (s -> head) | |
48 { | |
49 s -> tail = s -> head; | |
50 s -> head = s -> head -> next; | |
51 lwasm_expr_term_free(s -> tail -> term); | |
52 lwasm_free(s -> tail); | |
53 } | |
54 lwasm_free(s); | |
55 } | |
14 | 56 |
17 | 57 void lwasm_expr_term_free(lwasm_expr_term_t *t) |
58 { | |
59 if (t) | |
60 { | |
44 | 61 if (t -> term_type == LWASM_TERM_SYM) |
17 | 62 lwasm_free(t -> symbol); |
63 lwasm_free(t); | |
64 } | |
65 } | |
66 | |
67 lwasm_expr_term_t *lwasm_expr_term_create_oper(int oper) | |
68 { | |
69 lwasm_expr_term_t *t; | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
70 |
39 | 71 debug_message(10, "Creating operator term: %d", oper); |
17 | 72 |
73 t = lwasm_alloc(sizeof(lwasm_expr_term_t)); | |
74 t -> term_type = LWASM_TERM_OPER; | |
75 t -> value = oper; | |
76 return t; | |
77 } | |
15 | 78 |
17 | 79 lwasm_expr_term_t *lwasm_expr_term_create_int(int val) |
14 | 80 { |
17 | 81 lwasm_expr_term_t *t; |
39 | 82 debug_message(10, "Creating integer term: %d", val); |
17 | 83 |
84 t = lwasm_alloc(sizeof(lwasm_expr_term_t)); | |
85 t -> term_type = LWASM_TERM_INT; | |
86 t -> value = val; | |
87 return t; | |
88 } | |
89 | |
91
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
90 lwasm_expr_term_t *lwasm_expr_term_create_secbase(void) |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
91 { |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
92 lwasm_expr_term_t *t; |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
93 debug_message(10, "Creating section base term"); |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
94 |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
95 t = lwasm_alloc(sizeof(lwasm_expr_term_t)); |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
96 t -> term_type = LWASM_TERM_SECBASE; |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
97 return t; |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
98 } |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
99 |
17 | 100 lwasm_expr_term_t *lwasm_expr_term_create_sym(char *sym) |
101 { | |
102 lwasm_expr_term_t *t; | |
14 | 103 |
39 | 104 debug_message(10, "Creating symbol term: %s", sym); |
105 | |
17 | 106 t = lwasm_alloc(sizeof(lwasm_expr_term_t)); |
107 t -> term_type = LWASM_TERM_SYM; | |
108 t -> symbol = lwasm_strdup(sym); | |
109 return t; | |
110 } | |
15 | 111 |
17 | 112 lwasm_expr_term_t *lwasm_expr_term_dup(lwasm_expr_term_t *t) |
113 { | |
114 switch (t -> term_type) | |
15 | 115 { |
17 | 116 case LWASM_TERM_INT: |
117 return lwasm_expr_term_create_int(t -> value); | |
118 | |
119 case LWASM_TERM_OPER: | |
120 return lwasm_expr_term_create_oper(t -> value); | |
121 | |
122 case LWASM_TERM_SYM: | |
123 return lwasm_expr_term_create_sym(t -> symbol); | |
91
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
124 |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
125 case LWASM_TERM_SECBASE: |
718998b673ee
Added incomplete references to object output and added support for section base terms in expression handler
lost
parents:
76
diff
changeset
|
126 return lwasm_expr_term_create_secbase(); |
17 | 127 |
128 default: | |
39 | 129 debug_message(0, "lwasm_expr_term_dup(): invalid term type %d", t -> term_type); |
17 | 130 exit(1); |
131 } | |
132 // can't get here | |
133 } | |
134 | |
135 void lwasm_expr_stack_push(lwasm_expr_stack_t *s, lwasm_expr_term_t *t) | |
136 { | |
137 lwasm_expr_stack_node_t *n; | |
138 | |
139 if (!s) | |
140 { | |
39 | 141 debug_message(0, "lwasm_expr_stack_push(): invalid stack pointer"); |
17 | 142 exit(1); |
15 | 143 } |
144 | |
17 | 145 n = lwasm_alloc(sizeof(lwasm_expr_stack_node_t)); |
146 n -> next = NULL; | |
147 n -> prev = s -> tail; | |
148 n -> term = lwasm_expr_term_dup(t); | |
149 | |
150 if (s -> head) | |
151 { | |
152 s -> tail -> next = n; | |
153 s -> tail = n; | |
154 } | |
155 else | |
15 | 156 { |
17 | 157 s -> head = n; |
158 s -> tail = n; | |
159 } | |
160 } | |
161 | |
162 lwasm_expr_term_t *lwasm_expr_stack_pop(lwasm_expr_stack_t *s) | |
163 { | |
164 lwasm_expr_term_t *t; | |
165 lwasm_expr_stack_node_t *n; | |
166 | |
167 if (!(s -> tail)) | |
168 return NULL; | |
169 | |
170 n = s -> tail; | |
171 s -> tail = n -> prev; | |
172 if (!(n -> prev)) | |
173 { | |
174 s -> head = NULL; | |
15 | 175 } |
14 | 176 |
17 | 177 t = n -> term; |
178 n -> term = NULL; | |
179 | |
180 lwasm_free(n); | |
181 | |
182 return t; | |
14 | 183 } |
18 | 184 |
185 // the following two functions are co-routines which actually parse | |
186 // an infix expression onto the expression stack, each returns -1 | |
187 // if an error is encountered | |
188 | |
189 /* | |
190 parse a term and push it onto the stack | |
191 | |
192 this function handles unary prefix operators (-, +, .not., .com.) | |
193 as well as () | |
194 */ | |
195 int lwasm_expr_parse_term(lwasm_expr_stack_t *s, const char **p) | |
196 { | |
197 lwasm_expr_term_t *t; | |
39 | 198 debug_message(2, "Expression string %s", *p); |
199 | |
18 | 200 eval_next: |
61 | 201 if (!**p || isspace(**p) || **p == ')' || **p == ']') |
202 return -1; | |
18 | 203 if (**p == '(') |
204 { | |
39 | 205 debug_message(3, "Starting paren"); |
18 | 206 (*p)++; |
207 lwasm_expr_parse_expr(s, p, 0); | |
208 if (**p != ')') | |
209 return -1; | |
210 (*p)++; | |
211 return 0; | |
212 } | |
213 | |
214 if (**p == '+') | |
215 { | |
39 | 216 debug_message(3, "Unary +"); |
18 | 217 (*p)++; |
218 goto eval_next; | |
219 } | |
220 | |
221 if (**p == '-') | |
222 { | |
223 // parse expression following "-" | |
224 (*p)++; | |
225 if (lwasm_expr_parse_expr(s, p, 200) < 0) | |
226 return -1; | |
227 t = lwasm_expr_term_create_oper(LWASM_OPER_NEG); | |
228 lwasm_expr_stack_push(s, t); | |
229 lwasm_expr_term_free(t); | |
230 return 0; | |
231 } | |
232 | |
23 | 233 if (**p == '^') |
234 { | |
235 // parse expression following "^" | |
236 (*p)++; | |
237 if (lwasm_expr_parse_expr(s, p, 200) < 0) | |
238 return -1; | |
239 t = lwasm_expr_term_create_oper(LWASM_OPER_COM); | |
240 lwasm_expr_stack_push(s, t); | |
241 lwasm_expr_term_free(t); | |
242 return 0; | |
243 } | |
244 | |
18 | 245 /* |
246 we have an actual term here so evaluate it | |
247 | |
248 it could be one of the following: | |
249 | |
250 1. a decimal constant | |
251 2. a hexadecimal constant | |
252 3. an octal constant | |
253 4. a binary constant | |
254 5. a symbol reference | |
255 6. the "current" instruction address (*) | |
256 7. the "current" data address (.) | |
257 8. a "back reference" (<) | |
258 9. a "forward reference" (>) | |
259 | |
260 items 6 through 9 are stored as symbol references | |
261 | |
262 (a . followed by a . or a alpha char or number is a symbol) | |
263 */ | |
264 if (**p == '*' | |
265 || ( | |
266 **p == '.' | |
267 && (*p)[1] != '.' | |
268 && !((*p)[1] >= 'A' && (*p)[1] <= 'Z') | |
269 && !((*p)[1] >= 'a' && (*p)[1] <= 'z') | |
270 && !((*p)[1] >= '0' && (*p)[1] <= '9') | |
271 ) | |
272 || **p == '<' | |
273 || **p == '>') | |
274 { | |
275 char tstr[2]; | |
276 tstr[0] = **p; | |
277 tstr[1] = '\0'; | |
278 t = lwasm_expr_term_create_sym(tstr); | |
279 lwasm_expr_stack_push(s, t); | |
280 lwasm_expr_term_free(t); | |
281 (*p)++; | |
282 return 0; | |
283 } | |
284 | |
285 /* | |
286 - a symbol will be a string of characters introduced by a letter, ".", | |
287 "_" but NOT a number | |
288 - a decimal constant will consist of only digits, optionally prefixed | |
289 with "&" | |
290 - a binary constant will consist of only 0s and 1s either prefixed with % | |
291 or suffixed with "B" | |
292 - a hex constant will consist of 0-9A-F either prefixed with $ or | |
293 suffixed with "H"; a hex number starting with A-F must be prefixed | |
294 with $ or start with 0 and end with H | |
295 - an octal constant will consist of 0-7 either prefixed with @ or | |
296 suffixed with "O" or "Q" | |
297 - an ascii constant will be a single character prefixed with a ' | |
298 - a double ascii constant will be two characters prefixed with a " | |
299 | |
300 */ | |
301 if (**p == '"') | |
302 { | |
303 // double ascii constant | |
304 int val; | |
305 (*p)++; | |
306 if (!**p) | |
307 return -1; | |
308 if (!*((*p)+1)) | |
309 return -1; | |
310 val = **p << 8 | *((*p) + 1); | |
311 (*p) += 2; | |
312 t = lwasm_expr_term_create_int(val); | |
313 lwasm_expr_stack_push(s, t); | |
314 lwasm_expr_term_free(t); | |
315 return 0; | |
316 } | |
317 else if (**p == '\'') | |
318 { | |
319 // single ascii constant | |
320 int val; | |
321 (*p)++; | |
61 | 322 debug_message(3, "Single ascii character constant '%c'", **p); |
18 | 323 if (!**p) |
324 return -1; | |
325 val = **p; | |
326 (*p)++; | |
327 t = lwasm_expr_term_create_int(val); | |
328 lwasm_expr_stack_push(s, t); | |
329 lwasm_expr_term_free(t); | |
61 | 330 return 0; |
18 | 331 } |
332 else if (**p == '&') | |
333 { | |
334 // decimal constant | |
335 int val = 0; | |
336 | |
337 (*p)++; | |
47
804d7465e0f9
Implemented ORG and fixed problems with constants using $, &, or @ to specify base
lost
parents:
44
diff
changeset
|
338 while (**p && strchr("0123456789", **p)) |
18 | 339 { |
340 val = val * 10 + (**p - '0'); | |
341 (*p)++; | |
342 } | |
343 t = lwasm_expr_term_create_int(val); | |
344 lwasm_expr_stack_push(s, t); | |
345 lwasm_expr_term_free(t); | |
346 return 0; | |
347 } | |
348 else if (**p == '%') | |
349 { | |
350 // binary constant | |
351 int val = 0; | |
352 | |
353 (*p)++; | |
354 while (**p == '0' || **p == '1') | |
355 { | |
356 val = val * 2 + (**p - '0'); | |
357 (*p)++; | |
358 } | |
359 t = lwasm_expr_term_create_int(val); | |
360 lwasm_expr_stack_push(s, t); | |
361 lwasm_expr_term_free(t); | |
362 return 0; | |
363 } | |
364 else if (**p == '$') | |
365 { | |
366 // hexadecimal constant | |
367 int val = 0, val2; | |
368 | |
369 (*p)++; | |
47
804d7465e0f9
Implemented ORG and fixed problems with constants using $, &, or @ to specify base
lost
parents:
44
diff
changeset
|
370 debug_message(3, "Found prefix hex constant: %s", *p); |
804d7465e0f9
Implemented ORG and fixed problems with constants using $, &, or @ to specify base
lost
parents:
44
diff
changeset
|
371 while (**p && strchr("0123456789ABCDEFabcdef", **p)) |
18 | 372 { |
373 val2 = toupper(**p) - '0'; | |
374 if (val2 > 9) | |
375 val2 -= 7; | |
47
804d7465e0f9
Implemented ORG and fixed problems with constants using $, &, or @ to specify base
lost
parents:
44
diff
changeset
|
376 debug_message(3, "Got char: %c (%d)", **p, val2); |
18 | 377 val = val * 16 + val2; |
378 (*p)++; | |
379 } | |
380 t = lwasm_expr_term_create_int(val); | |
381 lwasm_expr_stack_push(s, t); | |
382 lwasm_expr_term_free(t); | |
383 return 0; | |
384 } | |
170
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
385 else if (**p == '0' && tolower(*(*p + 1)) == 'x') |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
386 { |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
387 // "C" style hexadecimal constant |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
388 int val = 0, val2; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
389 |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
390 (*p)+=2; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
391 debug_message(3, "Found \"C\" style prefix hex constant: %s", *p); |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
392 while (**p && strchr("0123456789ABCDEFabcdef", **p)) |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
393 { |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
394 val2 = toupper(**p) - '0'; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
395 if (val2 > 9) |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
396 val2 -= 7; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
397 debug_message(3, "Got char: %c (%d)", **p, val2); |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
398 val = val * 16 + val2; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
399 (*p)++; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
400 } |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
401 t = lwasm_expr_term_create_int(val); |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
402 lwasm_expr_stack_push(s, t); |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
403 lwasm_expr_term_free(t); |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
404 return 0; |
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
405 } |
40
d2cee0c335e7
adjusted symbol rules to accept symbols starting with @ but not @<digit>
lost
parents:
39
diff
changeset
|
406 // an @ followed by a digit is an octal number |
d2cee0c335e7
adjusted symbol rules to accept symbols starting with @ but not @<digit>
lost
parents:
39
diff
changeset
|
407 // but if it's followed by anything else, it is a symbol |
d2cee0c335e7
adjusted symbol rules to accept symbols starting with @ but not @<digit>
lost
parents:
39
diff
changeset
|
408 else if (**p == '@' && isdigit(*(*p + 1))) |
18 | 409 { |
410 // octal constant | |
411 int val = 0; | |
412 | |
413 (*p)++; | |
47
804d7465e0f9
Implemented ORG and fixed problems with constants using $, &, or @ to specify base
lost
parents:
44
diff
changeset
|
414 while (**p && strchr("01234567", **p)) |
18 | 415 { |
416 val = val * 8 + (**p - '0'); | |
417 (*p)++; | |
418 } | |
419 t = lwasm_expr_term_create_int(val); | |
420 lwasm_expr_stack_push(s, t); | |
421 lwasm_expr_term_free(t); | |
422 return 0; | |
423 } | |
170
bf69160da467
Added ability to use 0x and 0X as prefixes for hexadecimal numbers
lost
parents:
151
diff
changeset
|
424 |
18 | 425 // symbol or bare decimal or suffix identified constant here |
426 // all numbers will start with a digit at this point | |
427 if (**p < '0' || **p > '9') | |
428 { | |
429 int l = 0; | |
430 char *sb; | |
431 | |
432 // evaluate a symbol here | |
41 | 433 static const char *symchars = "_.$@?abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"; |
434 while ((*p)[l] && strchr(symchars, (*p)[l])) | |
18 | 435 l++; |
436 | |
437 if (l == 0) | |
438 return -1; | |
439 | |
440 sb = lwasm_alloc(l + 1); | |
441 sb[l] = '\0'; | |
442 memcpy(sb, *p, l); | |
443 t = lwasm_expr_term_create_sym(sb); | |
444 lwasm_expr_stack_push(s, t); | |
445 lwasm_expr_term_free(t); | |
41 | 446 (*p) += l; |
447 debug_message(3, "Symbol: '%s'; (%s)", sb, *p); | |
18 | 448 lwasm_free(sb); |
449 return 0; | |
450 } | |
451 | |
452 if (!**p) | |
453 return -1; | |
454 | |
455 // evaluate a suffix based constant | |
456 { | |
457 int decval = 0, binval = 0, hexval = 0, octval = 0; | |
458 int valtype = 15; // 1 = bin, 2 = oct, 4 = dec, 8 = hex | |
459 int bindone = 0; | |
460 int val; | |
461 int dval; | |
462 | |
463 while (1) | |
464 { | |
465 if (!**p || !strchr("0123456789ABCDEFabcdefqhoQHO", **p)) | |
466 { | |
467 // we can legally have bin or decimal here | |
468 if (bindone) | |
469 { | |
470 // we just finished a binary value | |
471 val = binval; | |
472 break; | |
473 } | |
474 else if (valtype & 4) | |
475 { | |
476 // otherwise we must be decimal (if we're still allowed one) | |
477 val = decval; | |
39 | 478 debug_message(3, "End of decimal value"); |
18 | 479 break; |
480 } | |
481 else | |
482 { | |
483 // bad value | |
484 return -1; | |
485 } | |
486 } | |
487 | |
488 dval = toupper(**p); | |
489 (*p)++; | |
490 | |
491 if (bindone) | |
492 { | |
493 // any characters past "B" means it is not binary | |
494 bindone = 0; | |
495 valtype &= 14; | |
496 } | |
497 | |
498 switch (dval) | |
499 { | |
500 case 'Q': | |
501 case 'O': | |
502 if (valtype & 2) | |
503 { | |
504 val = octval; | |
505 valtype = -1; | |
506 break; | |
507 } | |
508 else | |
509 { | |
510 // not a valid octal value | |
511 return -1; | |
512 } | |
513 /* can't get here */ | |
514 | |
515 case 'H': | |
516 if (valtype & 8) | |
517 { | |
518 val = hexval; | |
519 valtype = -1; | |
520 break; | |
521 } | |
522 else | |
523 { | |
524 // not a valid hex number | |
525 return -1; | |
526 } | |
527 /* can't get here */ | |
528 | |
529 case 'B': | |
530 // this is a bit of a sticky one since B is a legit hex | |
531 // digit so this may or may not be the end of the number | |
532 // so we fall through to the digit case | |
533 | |
534 if (valtype & 1) | |
535 { | |
536 // could still be binary | |
537 bindone = 1; | |
538 valtype = 9; // hex and binary | |
539 } | |
540 /* fall through intentional */ | |
541 | |
542 default: | |
543 // digit | |
544 dval -= '0'; | |
545 if (dval > 9) | |
546 dval -= 7; | |
39 | 547 debug_message(3, "Got digit: %d", dval); |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
548 // if (dval > 1) |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
549 // valtype &= 14; |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
550 // if (dval > 7) |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
551 // valtype &= 12; |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
552 // if (dval > 9) |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
553 // valtype &= 8; |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
554 |
18 | 555 if (valtype & 8) |
556 { | |
557 hexval = hexval * 16 + dval; | |
558 } | |
559 if (valtype & 4) | |
560 { | |
561 if (dval > 9) | |
562 valtype &= 11; | |
563 else | |
564 decval = decval * 10 + dval; | |
565 } | |
566 if (valtype & 2) | |
567 { | |
568 if (dval > 7) | |
569 valtype &= 13; | |
570 else | |
571 octval = octval * 8 + dval; | |
572 } | |
573 if (valtype & 1) | |
574 { | |
575 if (dval > 1) | |
576 valtype &= 14; | |
577 else | |
578 binval = binval * 2 + dval; | |
579 } | |
580 } | |
581 // break out if we have a return value | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
582 if (valtype == -1) |
18 | 583 break; |
584 // return if no more valid possibilities! | |
585 if (valtype == 0) | |
586 return -1; | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
587 val = decval; // in case we fall through |
18 | 588 } |
589 | |
590 // we get here when we have a value to return | |
591 t = lwasm_expr_term_create_int(val); | |
592 lwasm_expr_stack_push(s, t); | |
593 lwasm_expr_term_free(t); | |
594 return 0; | |
595 } | |
596 /* can't get here */ | |
597 } | |
598 | |
599 // parse an expression and push the result onto the stack | |
600 // if an operator of lower precedence than the value of "prec" is found, | |
601 int lwasm_expr_parse_expr(lwasm_expr_stack_t *s, const char **p, int prec) | |
602 { | |
603 static const struct operinfo | |
604 { | |
605 int opernum; | |
606 char *operstr; | |
607 int operprec; | |
608 } operators[] = | |
609 { | |
610 { LWASM_OPER_PLUS, "+", 100 }, | |
611 { LWASM_OPER_MINUS, "-", 100 }, | |
612 { LWASM_OPER_TIMES, "*", 150 }, | |
613 { LWASM_OPER_DIVIDE, "/", 150 }, | |
614 { LWASM_OPER_MOD, "%", 150 }, | |
615 { LWASM_OPER_INTDIV, "\\", 150 }, | |
616 | |
617 { LWASM_OPER_NONE, "", 0 } | |
618 }; | |
619 int opern, i; | |
620 lwasm_expr_term_t *operterm; | |
621 | |
622 // return if we are at the end of the expression or a subexpression | |
61 | 623 if (!**p || isspace(**p) || **p == ')' || **p == ',' || **p == ']') |
18 | 624 return 0; |
625 | |
626 if (lwasm_expr_parse_term(s, p) < 0) | |
627 return -1; | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
628 |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
629 eval_next: |
61 | 630 if (!**p || isspace(**p) || **p == ')' || **p == ',' || **p == ']') |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
631 return 0; |
18 | 632 |
633 // expecting an operator here | |
634 for (opern = 0; operators[opern].opernum != LWASM_OPER_NONE; opern++) | |
635 { | |
636 for (i = 0; (*p)[i] && operators[opern].operstr[i] && (*p[i] == operators[opern].operstr[i]); i++) | |
637 /* do nothing */ ; | |
638 if (operators[opern].operstr[i] == '\0') | |
639 break; | |
640 } | |
641 if (operators[opern].opernum == LWASM_OPER_NONE) | |
642 { | |
643 // unrecognized operator | |
644 return -1; | |
645 } | |
646 | |
647 // the operator number in question is in opern; i is the length of the | |
648 // operator string | |
649 | |
650 // logic: | |
651 // if the precedence of this operation is <= to the "prec" flag, | |
652 // we simply return without advancing the input pointer; the operator | |
653 // will be evaluated again in the enclosing function call | |
654 if (operators[opern].operprec <= prec) | |
655 return 0; | |
656 | |
657 // logic: | |
658 // we have a higher precedence operator here so we will advance the | |
659 // input pointer to the next term and let the expression evaluator | |
660 // loose on it after which time we will push our operator onto the | |
661 // stack and then go on with the expression evaluation | |
662 (*p) += i; // advance input pointer | |
663 | |
664 // evaluate next expression(s) of higher precedence | |
665 if (lwasm_expr_parse_expr(s, p, operators[opern].operprec) < 0) | |
666 return -1; | |
667 | |
668 operterm = lwasm_expr_term_create_oper(operators[opern].opernum); | |
669 lwasm_expr_stack_push(s, operterm); | |
670 lwasm_expr_term_free(operterm); | |
671 | |
672 // return if we are at the end of the expression or a subexpression | |
673 if (!**p || isspace(**p) || **p == ')') | |
674 return 0; | |
675 | |
676 // continue evaluating | |
677 goto eval_next; | |
678 } | |
679 | |
680 /* | |
681 actually evaluate an expression | |
682 | |
683 This happens in two stages. The first stage merely parses the expression into | |
684 a lwasm_expr_stack_t * which is then evaluated as much as possible before the | |
685 result is returned. | |
686 | |
687 Returns NULL on a parse error or otherwise invalid expression. *outp will | |
688 contain the pointer to the next character after the expression if and only | |
689 if there is no error. In the case of an error, *outp is undefined. | |
690 */ | |
76 | 691 lwasm_expr_stack_t *lwasm_expr_eval(const char *inp, const char **outp, lwasm_expr_stack_t *(*sfunc)(char *sym, void *state), void *state) |
18 | 692 { |
693 lwasm_expr_stack_t *s; | |
694 const char *p; | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
695 int rval; |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
696 |
18 | 697 // actually parse the expression |
698 p = inp; | |
699 s = lwasm_expr_stack_create(); | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
700 |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
701 rval = lwasm_expr_parse_expr(s, &p, 0); |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
702 if (rval < 0) |
18 | 703 goto cleanup_error; |
704 | |
705 // save end of expression | |
706 if (outp) | |
707 (*outp) = p; | |
708 | |
709 // return potentially partial expression | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
710 if (lwasm_expr_reval(s, sfunc, state) < 0) |
18 | 711 goto cleanup_error; |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
712 |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
713 if (lwasm_expr_is_constant(s)) |
39 | 714 debug_message(3, "Constant expression evaluates to: %d", lwasm_expr_get_value(s)); |
18 | 715 |
716 return s; | |
717 | |
718 cleanup_error: | |
719 lwasm_expr_stack_free(s); | |
720 return NULL; | |
721 } | |
722 | |
723 /* | |
724 take an expression stack s and scan for operations that can be completed | |
725 | |
726 return -1 on error, 0 on no error | |
727 | |
728 possible errors are: division by zero or unknown operator | |
729 | |
730 theory of operation: | |
731 | |
732 scan the stack for an operator which has two constants preceding it (binary) | |
733 or 1 constant preceding it (unary) and if found, perform the calculation | |
734 and replace the operator and its operands with the result | |
735 | |
736 repeat the scan until no futher simplications are found or if there are no | |
737 further operators or only a single term remains | |
738 | |
739 */ | |
76 | 740 int lwasm_expr_reval(lwasm_expr_stack_t *s, lwasm_expr_stack_t *(*sfunc)(char *sym, void *state), void *state) |
18 | 741 { |
76 | 742 lwasm_expr_stack_node_t *n, *n2; |
743 lwasm_expr_stack_t *ss; | |
744 int c; | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
745 |
76 | 746 next_iter_sym: |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
747 // resolve symbols |
76 | 748 // symbols that do not resolve to an expression are left alone |
749 for (c = 0, n = s -> head; n; n = n -> next) | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
750 { |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
751 if (n -> term -> term_type == LWASM_TERM_SYM) |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
752 { |
76 | 753 ss = sfunc(n -> term -> symbol, state); |
754 if (ss) | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
755 { |
76 | 756 c++; |
757 // splice in the result stack | |
758 if (n -> prev) | |
759 { | |
760 n -> prev -> next = ss -> head; | |
761 } | |
762 else | |
763 { | |
764 s -> head = ss -> head; | |
765 } | |
766 ss -> head -> prev = n -> prev; | |
767 ss -> tail -> next = n -> next; | |
768 if (n -> next) | |
769 { | |
770 n -> next -> prev = ss -> tail; | |
771 } | |
772 else | |
773 { | |
774 s -> tail = ss -> tail; | |
775 } | |
776 lwasm_expr_term_free(n -> term); | |
777 lwasm_free(n); | |
778 n = ss -> tail; | |
779 | |
780 ss -> head = NULL; | |
781 ss -> tail = NULL; | |
782 lwasm_expr_stack_free(ss); | |
37
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
783 } |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
784 } |
538e15927776
Added symbol handling to expression subsystem; adpated instruction handlers to the new scheme; misc fixes
lost
parents:
23
diff
changeset
|
785 } |
76 | 786 if (c) |
787 goto next_iter_sym; | |
18 | 788 |
789 next_iter: | |
790 // a single term | |
791 if (s -> head == s -> tail) | |
792 return 0; | |
793 | |
794 // search for an operator | |
795 for (n = s -> head; n; n = n -> next) | |
796 { | |
797 if (n -> term -> term_type == LWASM_TERM_OPER) | |
798 { | |
799 if (n -> term -> value == LWASM_OPER_NEG | |
800 || n -> term -> value == LWASM_OPER_COM | |
801 ) | |
802 { | |
803 // unary operator | |
804 if (n -> prev && n -> prev -> term -> term_type == LWASM_TERM_INT) | |
805 { | |
806 // a unary operator we can resolve | |
807 // we do the op then remove the term "n" is pointing at | |
808 if (n -> term -> value == LWASM_OPER_NEG) | |
809 { | |
810 n -> prev -> term -> value = -(n -> prev -> term -> value); | |
811 } | |
812 else if (n -> term -> value == LWASM_OPER_COM) | |
813 { | |
814 n -> prev -> term -> value = ~(n -> prev -> term -> value); | |
815 } | |
816 n -> prev -> next = n -> next; | |
817 if (n -> next) | |
818 n -> next -> prev = n -> prev; | |
819 else | |
820 s -> tail = n -> prev; | |
821 | |
822 lwasm_expr_term_free(n -> term); | |
823 lwasm_free(n); | |
824 break; | |
825 } | |
826 } | |
827 else | |
828 { | |
829 // binary operator | |
830 if (n -> prev && n -> prev -> prev && n -> prev -> term -> term_type == LWASM_TERM_INT && n -> prev -> prev -> term -> term_type == LWASM_TERM_INT) | |
831 { | |
832 // a binary operator we can resolve | |
833 switch (n -> term -> value) | |
834 { | |
835 case LWASM_OPER_PLUS: | |
836 n -> prev -> prev -> term -> value += n -> prev -> term -> value; | |
837 break; | |
838 | |
839 case LWASM_OPER_MINUS: | |
840 n -> prev -> prev -> term -> value -= n -> prev -> term -> value; | |
841 break; | |
842 | |
843 case LWASM_OPER_TIMES: | |
844 n -> prev -> prev -> term -> value *= n -> prev -> term -> value; | |
845 break; | |
846 | |
847 case LWASM_OPER_DIVIDE: | |
848 if (n -> prev -> term -> value == 0) | |
849 return -1; | |
850 n -> prev -> prev -> term -> value /= n -> prev -> term -> value; | |
851 break; | |
852 | |
853 case LWASM_OPER_MOD: | |
854 if (n -> prev -> term -> value == 0) | |
855 return -1; | |
856 n -> prev -> prev -> term -> value %= n -> prev -> term -> value; | |
857 break; | |
858 | |
859 case LWASM_OPER_INTDIV: | |
860 if (n -> prev -> term -> value == 0) | |
861 return -1; | |
862 n -> prev -> prev -> term -> value /= n -> prev -> term -> value; | |
863 break; | |
864 | |
865 case LWASM_OPER_BWAND: | |
866 n -> prev -> prev -> term -> value &= n -> prev -> term -> value; | |
867 break; | |
868 | |
869 case LWASM_OPER_BWOR: | |
870 n -> prev -> prev -> term -> value |= n -> prev -> term -> value; | |
871 break; | |
872 | |
873 case LWASM_OPER_BWXOR: | |
874 n -> prev -> prev -> term -> value ^= n -> prev -> term -> value; | |
875 break; | |
876 | |
877 case LWASM_OPER_AND: | |
878 n -> prev -> prev -> term -> value = (n -> prev -> term -> value && n -> prev -> prev -> term -> value) ? 1 : 0; | |
879 break; | |
880 | |
881 case LWASM_OPER_OR: | |
882 n -> prev -> prev -> term -> value = (n -> prev -> term -> value || n -> prev -> prev -> term -> value) ? 1 : 0; | |
883 break; | |
884 | |
885 default: | |
886 // return error if unknown operator! | |
887 return -1; | |
888 } | |
889 | |
890 // now remove the two unneeded entries from the stack | |
891 n -> prev -> prev -> next = n -> next; | |
892 if (n -> next) | |
893 n -> next -> prev = n -> prev -> prev; | |
894 else | |
895 s -> tail = n -> prev -> prev; | |
896 | |
897 lwasm_expr_term_free(n -> term); | |
898 lwasm_expr_term_free(n -> prev -> term); | |
899 lwasm_free(n -> prev); | |
900 lwasm_free(n); | |
901 break; | |
902 } | |
903 } | |
904 } | |
905 } | |
906 // note for the terminally confused about dynamic memory and pointers: | |
907 // n will not be NULL even after the lwasm_free calls above so | |
908 // this test will still work (n will be a dangling pointer) | |
909 // (n will only be NULL if we didn't find any operators to simplify) | |
910 if (n) | |
911 goto next_iter; | |
912 | |
913 return 0; | |
914 } |