529
|
1 // tree-expr.h -*- C++ -*- |
494
|
2 /* |
|
3 |
|
4 Copyright (C) 1992, 1993, 1994 John W. Eaton |
|
5 |
|
6 This file is part of Octave. |
|
7 |
|
8 Octave is free software; you can redistribute it and/or modify it |
|
9 under the terms of the GNU General Public License as published by the |
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
11 later version. |
|
12 |
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
16 for more details. |
|
17 |
|
18 You should have received a copy of the GNU General Public License |
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
20 Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. |
|
21 |
|
22 */ |
|
23 |
|
24 #if !defined (octave_tree_expr_h) |
|
25 #define octave_tree_expr_h 1 |
|
26 |
|
27 #if defined (__GNUG__) |
|
28 #pragma interface |
|
29 #endif |
|
30 |
529
|
31 #include <time.h> |
494
|
32 #include <stdio.h> |
581
|
33 #include <iostream.h> |
494
|
34 |
748
|
35 #include "SLList.h" |
|
36 |
529
|
37 #include "variables.h" |
|
38 #include "mappers.h" |
494
|
39 #include "error.h" |
500
|
40 #include "oct-obj.h" |
494
|
41 |
|
42 class tree_constant; |
578
|
43 class tree_statement_list; |
|
44 class tree_argument_list; |
|
45 class tree_parameter_list; |
|
46 class tree_return_list; |
723
|
47 class tree_va_return_list; |
494
|
48 class symbol_record; |
|
49 class symbol_table; |
|
50 |
|
51 class tree_matrix; |
|
52 class tree_builtin; |
|
53 class tree_identifier; |
748
|
54 class tree_indirect_ref; |
494
|
55 class tree_function; |
|
56 class tree_expression; |
|
57 class tree_prefix_expression; |
|
58 class tree_postfix_expression; |
|
59 class tree_unary_expression; |
|
60 class tree_binary_expression; |
|
61 class tree_assignment_expression; |
|
62 class tree_simple_assignment_expression; |
|
63 class tree_multi_assignment_expression; |
|
64 class tree_colon_expression; |
|
65 class tree_index_expression; |
578
|
66 |
|
67 #include "tree-base.h" |
494
|
68 |
578
|
69 // A base class for expressions. |
|
70 |
494
|
71 class |
|
72 tree_expression : public tree |
|
73 { |
|
74 public: |
581
|
75 int in_parens; |
|
76 |
578
|
77 enum type |
|
78 { |
|
79 unknown, |
|
80 assignment, |
|
81 simple_assignment, |
|
82 multi_assignment, |
|
83 add, |
|
84 subtract, |
|
85 multiply, |
|
86 el_mul, |
|
87 divide, |
|
88 el_div, |
|
89 leftdiv, |
|
90 el_leftdiv, |
|
91 power, |
|
92 elem_pow, |
|
93 cmp_lt, |
|
94 cmp_le, |
|
95 cmp_eq, |
|
96 cmp_ge, |
|
97 cmp_gt, |
|
98 cmp_ne, |
|
99 and_and, |
|
100 or_or, |
|
101 and, |
|
102 or, |
|
103 not, |
|
104 unot, |
|
105 uminus, |
|
106 hermitian, |
|
107 transpose, |
|
108 colon, |
|
109 index, |
|
110 increment, |
|
111 decrement, |
|
112 }; |
494
|
113 |
578
|
114 tree_expression (int l = -1, int c = -1) : tree (l, c) |
581
|
115 { |
|
116 in_parens = 0; |
|
117 etype = unknown; |
|
118 } |
494
|
119 |
578
|
120 ~tree_expression (void) { } |
494
|
121 |
666
|
122 virtual int is_multi_val_ret_expression (void) const |
|
123 { return 0; } |
|
124 |
494
|
125 virtual int is_identifier (void) const |
|
126 { return 0; } |
|
127 |
748
|
128 virtual int is_indirect_ref (void) const |
|
129 { return 0; } |
|
130 |
494
|
131 virtual int is_index_expression (void) const |
|
132 { return 0; } |
|
133 |
|
134 virtual int is_assignment_expression (void) const |
|
135 { return 0; } |
|
136 |
|
137 virtual int is_prefix_expression (void) const |
|
138 { return 0; } |
|
139 |
|
140 virtual void mark_for_possible_ans_assign (void) |
|
141 { panic_impossible (); } |
|
142 |
578
|
143 virtual tree_constant eval (int print) = 0; |
|
144 |
494
|
145 protected: |
578
|
146 type etype; |
494
|
147 }; |
|
148 |
578
|
149 // General matrices. This allows us to construct matrices from |
|
150 // other matrices, variables, and functions. |
|
151 |
494
|
152 class |
|
153 tree_matrix : public tree_expression |
|
154 { |
|
155 public: |
578
|
156 enum dir |
|
157 { |
|
158 md_none, |
|
159 md_right, |
|
160 md_down, |
|
161 }; |
|
162 |
|
163 tree_matrix (void) |
|
164 { |
581
|
165 direction = tree_matrix::md_none; |
578
|
166 element = 0; |
|
167 next = 0; |
|
168 } |
|
169 |
|
170 tree_matrix (tree_expression *e, tree_matrix::dir d) |
|
171 { |
581
|
172 direction = d; |
578
|
173 element = e; |
|
174 next = 0; |
|
175 } |
494
|
176 |
|
177 ~tree_matrix (void); |
|
178 |
578
|
179 tree_matrix *chain (tree_expression *e, tree_matrix::dir d); |
494
|
180 tree_matrix *reverse (void); |
|
181 int length (void); |
|
182 |
|
183 tree_return_list *to_return_list (void); |
|
184 |
|
185 tree_constant eval (int print); |
|
186 |
581
|
187 void print_code (ostream& os); |
|
188 |
494
|
189 private: |
581
|
190 tree_matrix::dir direction; // Direction from the previous element. |
494
|
191 tree_expression *element; |
|
192 tree_matrix *next; |
|
193 }; |
|
194 |
666
|
195 // A base class for objects that can be return multiple values |
|
196 |
|
197 class |
|
198 tree_multi_val_ret : public tree_expression |
|
199 { |
|
200 public: |
|
201 tree_multi_val_ret (int l = -1, int c = -1) : tree_expression (l, c) { } |
|
202 |
|
203 int is_multi_val_ret_expression (void) const |
|
204 { return 1; } |
|
205 |
|
206 tree_constant eval (int print); |
|
207 |
|
208 virtual Octave_object eval (int print, int nargout, |
|
209 const Octave_object& args) = 0; |
|
210 }; |
|
211 |
578
|
212 // A base class for objects that can be evaluated with argument lists. |
494
|
213 |
|
214 class |
666
|
215 tree_fvc : public tree_multi_val_ret |
494
|
216 { |
|
217 public: |
666
|
218 tree_fvc (int l = -1, int c = -1) : tree_multi_val_ret (l, c) { } |
578
|
219 |
494
|
220 virtual int is_constant (void) const |
|
221 { return 0; } |
|
222 |
506
|
223 virtual tree_constant assign (tree_constant& t, const Octave_object& args); |
494
|
224 |
|
225 virtual char *name (void) const |
529
|
226 { panic_impossible (); return 0; } |
494
|
227 |
578
|
228 virtual void bump_value (tree_expression::type) |
494
|
229 { panic_impossible (); } |
|
230 |
748
|
231 virtual tree_constant lookup_map_element (SLList<char*>& list); |
|
232 |
494
|
233 virtual int max_expected_args (void) |
|
234 { panic_impossible (); return 0; } |
|
235 |
|
236 virtual char *fcn_file_name (void) |
529
|
237 { return 0; } |
494
|
238 |
|
239 virtual time_t time_parsed (void) |
|
240 { panic_impossible (); return 0; } |
|
241 |
|
242 virtual int is_system_fcn_file (void) const |
|
243 { return 0; } |
|
244 |
|
245 virtual int save (ostream& os, int mark_as_global = 0, |
|
246 int precision = 17) |
|
247 { panic_impossible (); return 0; } |
|
248 }; |
|
249 |
578
|
250 // Symbols from the symbol table. |
529
|
251 |
494
|
252 class |
|
253 tree_identifier : public tree_fvc |
|
254 { |
|
255 friend class tree_index_expression; |
|
256 |
|
257 public: |
581
|
258 tree_identifier (int l = -1, int c = -1) : tree_fvc (l, c) |
578
|
259 { |
|
260 sym = 0; |
|
261 maybe_do_ans_assign = 0; |
|
262 } |
494
|
263 |
581
|
264 tree_identifier (symbol_record *s, int l = -1, int c = -1) : tree_fvc (l, c) |
578
|
265 { |
|
266 sym = s; |
|
267 maybe_do_ans_assign = 0; |
|
268 } |
494
|
269 |
578
|
270 ~tree_identifier (void) { } |
|
271 |
|
272 int is_identifier (void) const |
|
273 { return 1; } |
494
|
274 |
|
275 char *name (void) const; |
|
276 |
|
277 tree_identifier *define (tree_constant *t); |
|
278 tree_identifier *define (tree_function *t); |
|
279 |
|
280 void document (char *s); |
|
281 |
|
282 tree_constant assign (tree_constant& t); |
506
|
283 tree_constant assign (tree_constant& t, const Octave_object& args); |
500
|
284 |
748
|
285 tree_constant assign (SLList<char*> list, tree_constant& t); |
|
286 tree_constant assign (SLList<char*> list, tree_constant& t, |
|
287 const Octave_object& args); |
|
288 |
500
|
289 int is_defined (void); |
494
|
290 |
578
|
291 void bump_value (tree_expression::type); |
494
|
292 |
748
|
293 tree_fvc *do_lookup (int& script_file_executed, int exec_script = 1); |
494
|
294 |
748
|
295 void link_to_global (void); |
578
|
296 |
494
|
297 void mark_as_formal_parameter (void); |
|
298 |
578
|
299 void mark_for_possible_ans_assign (void) |
|
300 { maybe_do_ans_assign = 1; } |
494
|
301 |
|
302 tree_constant eval (int print); |
|
303 |
506
|
304 Octave_object eval (int print, int nargout, const Octave_object& args); |
494
|
305 |
|
306 void eval_undefined_error (void); |
|
307 |
581
|
308 void print_code (ostream& os); |
|
309 |
494
|
310 private: |
|
311 symbol_record *sym; |
|
312 int maybe_do_ans_assign; |
|
313 }; |
|
314 |
748
|
315 // Indirect references to values (structure references). |
|
316 |
|
317 class |
|
318 tree_indirect_ref : public tree_fvc |
|
319 { |
|
320 public: |
|
321 tree_indirect_ref (int l = -1, int c = -1) : tree_fvc (l, c) |
|
322 { id = 0; } |
|
323 |
|
324 tree_indirect_ref (tree_identifier *i, int l = -1, int c = -1) |
|
325 : tree_fvc (l, c) |
|
326 { id = i; } |
|
327 |
|
328 ~tree_indirect_ref (void); |
|
329 |
|
330 tree_indirect_ref *chain (const char *s); |
|
331 |
|
332 int is_indirect_ref (void) const |
|
333 { return 1; } |
|
334 |
|
335 int is_identifier_only (void) const |
|
336 { return (id && refs.empty ()); } |
|
337 |
|
338 tree_identifier *ident (void) |
|
339 { return id; } |
|
340 |
|
341 char *name (void); |
|
342 |
|
343 tree_constant assign (tree_constant& t); |
|
344 tree_constant assign (tree_constant& t, const Octave_object& args); |
|
345 |
|
346 void mark_for_possible_ans_assign (void) |
|
347 { id->mark_for_possible_ans_assign (); } |
|
348 |
|
349 tree_constant eval (int print); |
|
350 |
|
351 Octave_object eval (int print, int nargout, const Octave_object& args); |
|
352 |
|
353 void print_code (ostream& os); |
|
354 |
|
355 private: |
|
356 tree_identifier *id; |
|
357 SLList<char*> refs; |
|
358 }; |
|
359 |
578
|
360 // Index expressions. |
|
361 |
|
362 class |
666
|
363 tree_index_expression : public tree_multi_val_ret |
578
|
364 { |
748
|
365 public: |
666
|
366 tree_index_expression (int l = -1, int c = -1) : tree_multi_val_ret (l, c) |
578
|
367 { |
|
368 id = 0; |
|
369 list = 0; |
|
370 } |
|
371 |
|
372 tree_index_expression (tree_identifier *i, int l = -1, int c = -1) |
666
|
373 : tree_multi_val_ret (l, c) |
578
|
374 { |
748
|
375 id = new tree_indirect_ref (i); |
|
376 list = 0; |
|
377 } |
|
378 |
|
379 tree_index_expression (tree_identifier *i, tree_argument_list *lst, |
|
380 int l = -1, int c = -1) |
|
381 : tree_multi_val_ret (l, c) |
|
382 { |
|
383 id = new tree_indirect_ref (i); |
|
384 list = lst; |
|
385 } |
|
386 |
|
387 tree_index_expression (tree_indirect_ref *i, int l = -1, int c = -1) |
|
388 : tree_multi_val_ret (l, c) |
|
389 { |
578
|
390 id = i; |
|
391 list = 0; |
|
392 } |
|
393 |
748
|
394 tree_index_expression (tree_indirect_ref *i, tree_argument_list *lst, |
578
|
395 int l = -1, int c = -1) |
666
|
396 : tree_multi_val_ret (l, c) |
578
|
397 { |
|
398 id = i; |
|
399 list = lst; |
|
400 } |
|
401 |
|
402 ~tree_index_expression (void); |
|
403 |
|
404 int is_index_expression (void) const |
|
405 { return 1; } |
|
406 |
748
|
407 tree_indirect_ref *ident (void) |
578
|
408 { return id; } |
|
409 |
748
|
410 char *name (void) |
|
411 { return id->name (); } |
|
412 |
578
|
413 tree_argument_list *arg_list (void) |
|
414 { return list; } |
|
415 |
|
416 void mark_for_possible_ans_assign (void) |
|
417 { |
|
418 if (id) |
|
419 id->mark_for_possible_ans_assign (); |
|
420 } |
|
421 |
|
422 tree_constant eval (int print); |
|
423 |
|
424 Octave_object eval (int print, int nargout, const Octave_object& args); |
|
425 |
|
426 void eval_error (void); |
|
427 |
581
|
428 void print_code (ostream& os); |
|
429 |
578
|
430 private: |
748
|
431 tree_indirect_ref *id; |
578
|
432 tree_argument_list *list; |
|
433 }; |
|
434 |
|
435 // Prefix expressions. |
|
436 |
|
437 class |
|
438 tree_prefix_expression : public tree_expression |
|
439 { |
|
440 public: |
|
441 tree_prefix_expression (int l = -1, int c = -1) : tree_expression (l, c) |
|
442 { |
|
443 id = 0; |
|
444 etype = unknown; |
|
445 } |
|
446 |
|
447 tree_prefix_expression (tree_identifier *t, tree_expression::type et, |
|
448 int l = -1, int c = -1) |
|
449 : tree_expression (l, c) |
|
450 { |
|
451 id = t; |
|
452 etype = et; |
|
453 } |
|
454 |
|
455 ~tree_prefix_expression (void) |
|
456 { delete id; } |
|
457 |
|
458 tree_constant eval (int print); |
|
459 |
|
460 void eval_error (void); |
|
461 |
|
462 int is_prefix_expression (void) const |
|
463 { return 1; } |
|
464 |
581
|
465 char *oper (void) const; |
|
466 |
|
467 void print_code (ostream& os); |
|
468 |
578
|
469 private: |
|
470 tree_identifier *id; |
|
471 }; |
|
472 |
|
473 // Postfix expressions. |
|
474 |
|
475 class |
|
476 tree_postfix_expression : public tree_expression |
|
477 { |
|
478 public: |
|
479 tree_postfix_expression (int l = -1, int c = -1) : tree_expression (l, c) |
|
480 { |
|
481 id = 0; |
|
482 etype = unknown; |
|
483 } |
|
484 |
|
485 tree_postfix_expression (tree_identifier *t, tree_expression::type et, |
|
486 int l = -1, int c = -1) |
|
487 : tree_expression (l, c) |
|
488 { |
|
489 id = t; |
|
490 etype = et; |
|
491 } |
|
492 |
|
493 ~tree_postfix_expression (void) |
|
494 { delete id; } |
|
495 |
|
496 tree_constant eval (int print); |
|
497 |
|
498 void eval_error (void); |
|
499 |
581
|
500 char *oper (void) const; |
|
501 |
|
502 void print_code (ostream& os); |
|
503 |
578
|
504 private: |
|
505 tree_identifier *id; |
|
506 }; |
|
507 |
|
508 // Unary expressions. |
|
509 |
|
510 class |
|
511 tree_unary_expression : public tree_expression |
|
512 { |
|
513 public: |
|
514 tree_unary_expression (int l = -1, int c = -1) : tree_expression (l, c) |
|
515 { |
|
516 etype = tree_expression::unknown; |
|
517 op = 0; |
|
518 } |
|
519 |
|
520 tree_unary_expression (tree_expression *a, tree_expression::type t, |
|
521 int l = -1, int c = -1) |
|
522 : tree_expression (l, c) |
|
523 { |
|
524 etype = t; |
|
525 op = a; |
|
526 } |
|
527 |
|
528 ~tree_unary_expression (void) |
|
529 { delete op; } |
|
530 |
|
531 tree_constant eval (int print); |
|
532 |
|
533 void eval_error (void); |
|
534 |
581
|
535 char *oper (void) const; |
|
536 |
|
537 void print_code (ostream& os); |
|
538 |
578
|
539 private: |
|
540 tree_expression *op; |
|
541 }; |
|
542 |
|
543 // Binary expressions. |
|
544 |
|
545 class |
|
546 tree_binary_expression : public tree_expression |
|
547 { |
|
548 public: |
|
549 tree_binary_expression (int l = -1, int c = -1) : tree_expression (l, c) |
|
550 { |
|
551 etype = tree_expression::unknown; |
|
552 op1 = 0; |
|
553 op2 = 0; |
|
554 } |
|
555 |
|
556 tree_binary_expression (tree_expression *a, tree_expression *b, |
|
557 tree_expression::type t, int l = -1, int c = -1) |
|
558 : tree_expression (l, c) |
|
559 { |
|
560 etype = t; |
|
561 op1 = a; |
|
562 op2 = b; |
|
563 } |
|
564 |
|
565 ~tree_binary_expression (void) |
|
566 { |
|
567 delete op1; |
|
568 delete op2; |
|
569 } |
|
570 |
|
571 tree_constant eval (int print); |
|
572 |
|
573 void eval_error (void); |
|
574 |
581
|
575 char *oper (void) const; |
|
576 |
|
577 void print_code (ostream& os); |
|
578 |
578
|
579 private: |
|
580 tree_expression *op1; |
|
581 tree_expression *op2; |
|
582 }; |
|
583 |
|
584 // Simple assignment expressions. |
|
585 |
|
586 class |
666
|
587 tree_simple_assignment_expression : public tree_expression |
578
|
588 { |
748
|
589 private: |
581
|
590 void init (int plhs, int ans_assign) |
|
591 { |
|
592 etype = tree_expression::assignment; |
|
593 lhs = 0; |
|
594 index = 0; |
|
595 rhs = 0; |
|
596 preserve = plhs; |
|
597 ans_ass = ans_assign; |
|
598 } |
|
599 |
748
|
600 public: |
581
|
601 tree_simple_assignment_expression (int plhs = 0, int ans_assign = 0, |
|
602 int l = -1, int c = -1) |
666
|
603 : tree_expression (l, c) |
581
|
604 { init (plhs, ans_assign); } |
578
|
605 |
|
606 tree_simple_assignment_expression (tree_identifier *i, |
|
607 tree_expression *r, |
581
|
608 int plhs = 0, int ans_assign = 0, |
|
609 int l = -1, int c = -1) |
666
|
610 : tree_expression (l, c) |
578
|
611 { |
581
|
612 init (plhs, ans_assign); |
748
|
613 lhs = new tree_indirect_ref (i); |
|
614 rhs = r; |
|
615 } |
|
616 |
|
617 tree_simple_assignment_expression (tree_indirect_ref *i, |
|
618 tree_expression *r, |
|
619 int plhs = 0, int ans_assign = 0, |
|
620 int l = -1, int c = -1) |
|
621 : tree_expression (l, c) |
|
622 { |
|
623 init (plhs, ans_assign); |
578
|
624 lhs = i; |
|
625 rhs = r; |
|
626 } |
|
627 |
|
628 tree_simple_assignment_expression (tree_index_expression *idx_expr, |
|
629 tree_expression *r, |
581
|
630 int plhs = 0, int ans_assign = 0, |
|
631 int l = -1, int c = -1) |
666
|
632 : tree_expression (l, c) |
578
|
633 { |
581
|
634 init (plhs, ans_assign); |
578
|
635 lhs = idx_expr->ident (); |
|
636 index = idx_expr->arg_list (); |
|
637 rhs = r; |
|
638 } |
|
639 |
|
640 ~tree_simple_assignment_expression (void); |
|
641 |
748
|
642 int left_hand_side_is_identifier_only (void) |
|
643 { return lhs->is_identifier_only (); } |
|
644 |
|
645 tree_identifier *left_hand_side_id (void) |
|
646 { return lhs->ident (); } |
578
|
647 |
581
|
648 int is_ans_assign (void) |
|
649 { return ans_ass; } |
|
650 |
578
|
651 tree_constant eval (int print); |
|
652 |
666
|
653 int is_assignment_expression (void) const |
|
654 { return 1; } |
|
655 |
578
|
656 void eval_error (void); |
|
657 |
581
|
658 void print_code (ostream& os); |
|
659 |
578
|
660 private: |
748
|
661 tree_indirect_ref *lhs; |
578
|
662 tree_argument_list *index; |
|
663 tree_expression *rhs; |
|
664 int preserve; |
581
|
665 int ans_ass; |
578
|
666 }; |
|
667 |
|
668 // Multi-valued assignment expressions. |
|
669 |
|
670 class |
666
|
671 tree_multi_assignment_expression : public tree_multi_val_ret |
578
|
672 { |
|
673 public: |
|
674 tree_multi_assignment_expression (int l = -1, int c = -1) |
666
|
675 : tree_multi_val_ret (l, c) |
578
|
676 { |
|
677 etype = tree_expression::multi_assignment; |
|
678 lhs = 0; |
|
679 rhs = 0; |
|
680 } |
|
681 |
|
682 tree_multi_assignment_expression (tree_return_list *lst, |
666
|
683 tree_multi_val_ret *r, |
578
|
684 int l = -1, int c = -1) |
666
|
685 : tree_multi_val_ret (l, c) |
578
|
686 { |
|
687 etype = tree_expression::multi_assignment; |
|
688 lhs = lst; |
|
689 rhs = r; |
|
690 } |
|
691 |
|
692 ~tree_multi_assignment_expression (void); |
|
693 |
|
694 tree_constant eval (int print); |
|
695 |
|
696 Octave_object eval (int print, int nargout, const Octave_object& args); |
|
697 |
666
|
698 int is_assignment_expression (void) const |
|
699 { return 1; } |
|
700 |
578
|
701 void eval_error (void); |
|
702 |
581
|
703 void print_code (ostream& os); |
|
704 |
578
|
705 private: |
|
706 tree_return_list *lhs; |
666
|
707 tree_multi_val_ret *rhs; |
578
|
708 }; |
|
709 |
|
710 // Colon expressions. |
|
711 |
|
712 class |
|
713 tree_colon_expression : public tree_expression |
|
714 { |
|
715 public: |
|
716 tree_colon_expression (int l = -1, int c = -1) : tree_expression (l, c) |
|
717 { |
|
718 etype = tree_expression::colon; |
|
719 op1 = 0; |
|
720 op2 = 0; |
|
721 op3 = 0; |
|
722 } |
|
723 |
|
724 tree_colon_expression (tree_expression *a, tree_expression *b, |
|
725 int l = -1, int c = -1) |
|
726 : tree_expression (l, c) |
|
727 { |
|
728 etype = tree_expression::colon; |
|
729 op1 = a; |
|
730 op2 = b; |
|
731 op3 = 0; |
|
732 } |
|
733 |
|
734 ~tree_colon_expression (void) |
|
735 { |
|
736 delete op1; |
|
737 delete op2; |
|
738 delete op3; |
|
739 } |
|
740 |
|
741 tree_colon_expression *chain (tree_expression *t); |
|
742 |
|
743 tree_constant eval (int print); |
|
744 |
|
745 void eval_error (const char *s); |
|
746 |
581
|
747 void print_code (ostream& os); |
|
748 |
578
|
749 private: |
|
750 tree_expression *op1; |
|
751 tree_expression *op2; |
|
752 tree_expression *op3; |
|
753 }; |
|
754 |
|
755 // Builtin functions. |
|
756 |
|
757 class |
|
758 tree_builtin : public tree_fvc |
|
759 { |
|
760 public: |
|
761 tree_builtin (const char *nm = 0); |
|
762 |
|
763 tree_builtin (int i_max, int o_max, Mapper_fcn& m_fcn, |
|
764 const char *nm = 0); |
|
765 |
|
766 tree_builtin (int i_max, int o_max, Octave_builtin_fcn f, |
|
767 const char *nm = 0); |
|
768 |
|
769 ~tree_builtin (void) { } |
|
770 |
|
771 // int is_builtin (void) const; |
|
772 |
|
773 int is_mapper_function (void) const |
|
774 { return is_mapper; } |
|
775 |
|
776 tree_constant eval (int print); |
|
777 |
|
778 Octave_object eval (int print, int nargout, const Octave_object& args); |
|
779 |
|
780 char *name (void) const |
|
781 { return my_name; } |
|
782 |
|
783 int max_expected_args (void); |
|
784 |
581
|
785 void print_code (ostream& os) |
|
786 { |
|
787 os << my_name << " can't be printed because it is a builtin function\n"; |
|
788 } |
|
789 |
578
|
790 private: |
|
791 int nargin_max; |
|
792 int nargout_max; |
|
793 int is_mapper; |
|
794 Mapper_fcn mapper_fcn; |
|
795 Octave_builtin_fcn fcn; |
|
796 char *my_name; |
|
797 }; |
|
798 |
|
799 // User defined functions. |
|
800 |
494
|
801 class |
|
802 tree_function : public tree_fvc |
|
803 { |
748
|
804 private: |
578
|
805 void init (void) |
|
806 { |
|
807 call_depth = 0; |
|
808 param_list = 0; |
|
809 ret_list = 0; |
|
810 sym_tab = 0; |
|
811 cmd_list = 0; |
|
812 file_name = 0; |
|
813 fcn_name = 0; |
|
814 t_parsed = 0; |
|
815 system_fcn_file = 0; |
|
816 num_named_args = 0; |
|
817 num_args_passed = 0; |
|
818 curr_va_arg_number = 0; |
723
|
819 vr_list = 0; |
578
|
820 } |
494
|
821 |
748
|
822 public: |
578
|
823 tree_function (int l = -1, int c = -1) : tree_fvc (l, c) |
|
824 { init (); } |
494
|
825 |
578
|
826 tree_function (tree_statement_list *cl, symbol_table *st, |
|
827 int l = -1, int c = -1) |
|
828 : tree_fvc (l, c) |
|
829 { |
|
830 init (); |
|
831 sym_tab = st; |
|
832 cmd_list = cl; |
|
833 } |
|
834 |
|
835 ~tree_function (void) { } |
|
836 |
|
837 // tree_function *define (tree_statement_list *t); |
494
|
838 tree_function *define_param_list (tree_parameter_list *t); |
|
839 tree_function *define_ret_list (tree_parameter_list *t); |
|
840 |
|
841 void stash_fcn_file_name (char * s); |
578
|
842 |
|
843 void stash_fcn_file_time (time_t t) |
|
844 { t_parsed = t; } |
494
|
845 |
578
|
846 char *fcn_file_name (void) |
|
847 { return file_name; } |
|
848 |
|
849 time_t time_parsed (void) |
|
850 { return t_parsed; } |
494
|
851 |
|
852 void mark_as_system_fcn_file (void); |
578
|
853 |
|
854 int is_system_fcn_file (void) const |
|
855 { return system_fcn_file; } |
494
|
856 |
|
857 int takes_varargs (void) const; |
578
|
858 |
|
859 void octave_va_start (void) |
|
860 { curr_va_arg_number = num_named_args; } |
|
861 |
494
|
862 tree_constant octave_va_arg (void); |
|
863 |
723
|
864 int takes_var_return (void) const; |
|
865 |
|
866 void octave_vr_val (const tree_constant& val); |
|
867 |
494
|
868 void stash_function_name (char *s); |
578
|
869 |
|
870 char *function_name (void) |
|
871 { return fcn_name; } |
494
|
872 |
|
873 tree_constant eval (int print); |
|
874 |
506
|
875 Octave_object eval (int print, int nargout, const Octave_object& args); |
494
|
876 |
|
877 int max_expected_args (void); |
|
878 |
|
879 void traceback_error (void); |
|
880 |
581
|
881 void print_code (ostream& os); |
|
882 |
494
|
883 private: |
|
884 int call_depth; |
|
885 tree_parameter_list *param_list; |
|
886 tree_parameter_list *ret_list; |
|
887 symbol_table *sym_tab; |
578
|
888 tree_statement_list *cmd_list; |
494
|
889 char *file_name; |
|
890 char *fcn_name; |
|
891 time_t t_parsed; |
|
892 int system_fcn_file; |
|
893 int num_named_args; |
500
|
894 Octave_object args_passed; |
494
|
895 int num_args_passed; |
508
|
896 int curr_va_arg_number; |
723
|
897 tree_va_return_list *vr_list; |
494
|
898 }; |
|
899 |
|
900 #endif |
|
901 |
|
902 /* |
|
903 ;;; Local Variables: *** |
|
904 ;;; mode: C++ *** |
|
905 ;;; page-delimiter: "^/\\*" *** |
|
906 ;;; End: *** |
|
907 */ |