|
577
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
577
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
577
|
20 |
|
|
21 */ |
|
|
22 |
|
1297
|
23 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
577
|
27 #ifdef HAVE_CONFIG_H |
|
1192
|
28 #include <config.h> |
|
577
|
29 #endif |
|
|
30 |
|
1350
|
31 #include <iostream.h> |
|
|
32 |
|
|
33 #ifdef HAVE_UNISTD_H |
|
2442
|
34 #ifdef HAVE_SYS_TYPES_H |
|
577
|
35 #include <sys/types.h> |
|
2442
|
36 #endif |
|
577
|
37 #include <unistd.h> |
|
|
38 #endif |
|
|
39 |
|
|
40 #include "error.h" |
|
2530
|
41 #include "input.h" |
|
1352
|
42 #include "oct-obj.h" |
|
2878
|
43 #include "ov.h" |
|
1742
|
44 #include "pager.h" |
|
|
45 #include "pt-cmd.h" |
|
2878
|
46 #include "pt-const.h" |
|
1742
|
47 #include "pt-exp.h" |
|
|
48 #include "pt-fcn.h" |
|
|
49 #include "pt-fvc.h" |
|
|
50 #include "pt-misc.h" |
|
|
51 #include "pt-mvr.h" |
|
2878
|
52 #include "pt-pr-code.h" |
|
2124
|
53 #include "pt-walk.h" |
|
2878
|
54 #include "toplev.h" |
|
2204
|
55 #include "variables.h" |
|
577
|
56 |
|
1058
|
57 // Nonzero means we're breaking out of a loop or function body. |
|
577
|
58 extern int breaking; |
|
|
59 |
|
|
60 // Nonzero means we're jumping to the end of a loop. |
|
|
61 extern int continuing; |
|
|
62 |
|
|
63 // Nonzero means we're returning from a function. |
|
|
64 extern int returning; |
|
|
65 |
|
|
66 // A list of commands to be executed. |
|
|
67 |
|
|
68 tree_statement::~tree_statement (void) |
|
|
69 { |
|
2124
|
70 delete cmd; |
|
|
71 delete expr; |
|
577
|
72 } |
|
|
73 |
|
1742
|
74 int |
|
|
75 tree_statement::line (void) |
|
|
76 { |
|
2124
|
77 return cmd ? cmd->line () : (expr ? expr->line () : -1); |
|
1742
|
78 } |
|
|
79 |
|
|
80 int |
|
|
81 tree_statement::column (void) |
|
|
82 { |
|
2124
|
83 return cmd ? cmd->column () : (expr ? expr->column () : -1); |
|
1742
|
84 } |
|
|
85 |
|
581
|
86 void |
|
1827
|
87 tree_statement::maybe_echo_code (bool in_function_body) |
|
1588
|
88 { |
|
|
89 if (in_function_body |
|
2204
|
90 && (Vecho_executing_commands & ECHO_FUNCTIONS)) |
|
2124
|
91 { |
|
2530
|
92 tree_print_code tpc (octave_stdout, Vps4); |
|
2124
|
93 |
|
|
94 accept (tpc); |
|
|
95 } |
|
1588
|
96 } |
|
|
97 |
|
|
98 void |
|
2124
|
99 tree_statement::accept (tree_walker& tw) |
|
581
|
100 { |
|
2124
|
101 tw.visit_statement (*this); |
|
581
|
102 } |
|
|
103 |
|
2086
|
104 octave_value |
|
1827
|
105 tree_statement_list::eval (bool print) |
|
577
|
106 { |
|
1827
|
107 bool pf; |
|
2086
|
108 octave_value retval; |
|
577
|
109 |
|
|
110 if (error_state) |
|
|
111 return retval; |
|
|
112 |
|
|
113 for (Pix p = first (); p != 0; next (p)) |
|
|
114 { |
|
|
115 tree_statement *elt = this->operator () (p); |
|
|
116 |
|
1827
|
117 if (! print) |
|
|
118 pf = false; |
|
577
|
119 else |
|
|
120 pf = elt->print_flag; |
|
|
121 |
|
2124
|
122 tree_command *cmd = elt->command (); |
|
|
123 tree_expression *expr = elt->expression (); |
|
577
|
124 |
|
|
125 if (cmd || expr) |
|
|
126 { |
|
1588
|
127 elt->maybe_echo_code (function_body); |
|
|
128 |
|
577
|
129 if (cmd) |
|
|
130 cmd->eval (); |
|
|
131 else |
|
|
132 retval = expr->eval (pf); |
|
|
133 |
|
|
134 if (error_state) |
|
2086
|
135 return octave_value (); |
|
577
|
136 |
|
|
137 if (breaking || continuing) |
|
|
138 break; |
|
|
139 |
|
|
140 if (returning) |
|
|
141 break; |
|
|
142 } |
|
|
143 else |
|
2086
|
144 retval = octave_value (); |
|
577
|
145 } |
|
|
146 return retval; |
|
|
147 } |
|
|
148 |
|
2086
|
149 octave_value_list |
|
1827
|
150 tree_statement_list::eval (bool print, int nargout) |
|
672
|
151 { |
|
2086
|
152 octave_value_list retval; |
|
672
|
153 |
|
|
154 if (nargout > 1) |
|
|
155 { |
|
1827
|
156 bool pf; |
|
672
|
157 |
|
|
158 if (error_state) |
|
|
159 return retval; |
|
|
160 |
|
|
161 for (Pix p = first (); p != 0; next (p)) |
|
|
162 { |
|
|
163 tree_statement *elt = this->operator () (p); |
|
|
164 |
|
1827
|
165 if (! print) |
|
|
166 pf = false; |
|
672
|
167 else |
|
|
168 pf = elt->print_flag; |
|
|
169 |
|
2124
|
170 tree_command *cmd = elt->command (); |
|
|
171 tree_expression *expr = elt->expression (); |
|
672
|
172 |
|
|
173 if (cmd || expr) |
|
|
174 { |
|
1588
|
175 elt->maybe_echo_code (function_body); |
|
|
176 |
|
672
|
177 if (cmd) |
|
|
178 cmd->eval (); |
|
|
179 else |
|
|
180 { |
|
|
181 if (expr->is_multi_val_ret_expression ()) |
|
|
182 { |
|
2086
|
183 octave_value_list args; |
|
2800
|
184 tree_multi_val_ret *t; |
|
|
185 t = static_cast<tree_multi_val_ret *> (expr); |
|
672
|
186 retval = t->eval (pf, nargout, args); |
|
|
187 } |
|
|
188 else |
|
|
189 retval = expr->eval (pf); |
|
|
190 } |
|
|
191 |
|
|
192 if (error_state) |
|
2086
|
193 return octave_value (); |
|
672
|
194 |
|
|
195 if (breaking || continuing) |
|
|
196 break; |
|
|
197 |
|
|
198 if (returning) |
|
|
199 break; |
|
|
200 } |
|
|
201 else |
|
2086
|
202 retval = octave_value_list (); |
|
672
|
203 } |
|
|
204 return retval; |
|
|
205 } |
|
|
206 else |
|
|
207 retval = eval (print); |
|
|
208 |
|
|
209 return retval; |
|
|
210 } |
|
|
211 |
|
581
|
212 void |
|
2124
|
213 tree_statement_list::accept (tree_walker& tw) |
|
581
|
214 { |
|
2124
|
215 tw.visit_statement_list (*this); |
|
581
|
216 } |
|
|
217 |
|
2878
|
218 tree_argument_list::~tree_argument_list (void) |
|
|
219 { |
|
|
220 while (! empty ()) |
|
|
221 { |
|
|
222 tree_expression *t = remove_front (); |
|
|
223 delete t; |
|
|
224 } |
|
|
225 } |
|
|
226 |
|
2086
|
227 octave_value_list |
|
577
|
228 tree_argument_list::convert_to_const_vector (void) |
|
|
229 { |
|
712
|
230 int len = length (); |
|
577
|
231 |
|
1358
|
232 // XXX FIXME XXX -- would be nice to know in advance how largs args |
|
|
233 // needs to be even when we have a list containing an all_va_args |
|
|
234 // token. |
|
922
|
235 |
|
2086
|
236 octave_value_list args; |
|
577
|
237 args.resize (len); |
|
|
238 |
|
|
239 Pix p = first (); |
|
922
|
240 int j = 0; |
|
712
|
241 for (int k = 0; k < len; k++) |
|
577
|
242 { |
|
|
243 tree_expression *elt = this->operator () (p); |
|
|
244 if (elt) |
|
|
245 { |
|
2859
|
246 octave_value tmp = elt->eval (); |
|
577
|
247 if (error_state) |
|
|
248 { |
|
|
249 ::error ("evaluating argument list element number %d", k); |
|
2086
|
250 args = octave_value_list (); |
|
577
|
251 break; |
|
|
252 } |
|
922
|
253 else |
|
|
254 { |
|
|
255 if (tmp.is_all_va_args ()) |
|
|
256 { |
|
|
257 if (curr_function) |
|
|
258 { |
|
2086
|
259 octave_value_list tva; |
|
922
|
260 tva = curr_function->octave_all_va_args (); |
|
|
261 int n = tva.length (); |
|
|
262 for (int i = 0; i < n; i++) |
|
|
263 args(j++) = tva(i); |
|
|
264 } |
|
|
265 else |
|
|
266 { |
|
|
267 ::error ("all_va_args is only valid inside functions"); |
|
2086
|
268 args = octave_value_list (); |
|
922
|
269 break; |
|
|
270 } |
|
|
271 } |
|
|
272 else |
|
|
273 args(j++) = tmp; |
|
|
274 } |
|
577
|
275 next (p); |
|
|
276 } |
|
|
277 else |
|
|
278 { |
|
2086
|
279 args(j++) = octave_value (); |
|
577
|
280 break; |
|
|
281 } |
|
|
282 } |
|
712
|
283 |
|
927
|
284 args.resize (j); |
|
|
285 |
|
577
|
286 return args; |
|
|
287 } |
|
|
288 |
|
581
|
289 void |
|
2124
|
290 tree_argument_list::accept (tree_walker& tw) |
|
581
|
291 { |
|
2124
|
292 tw.visit_argument_list (*this); |
|
581
|
293 } |
|
|
294 |
|
577
|
295 // Parameter lists. |
|
|
296 |
|
1742
|
297 tree_parameter_list::~tree_parameter_list (void) |
|
|
298 { |
|
|
299 while (! empty ()) |
|
|
300 { |
|
|
301 tree_identifier *t = remove_front (); |
|
|
302 delete t; |
|
|
303 } |
|
|
304 } |
|
|
305 |
|
577
|
306 void |
|
|
307 tree_parameter_list::mark_as_formal_parameters (void) |
|
|
308 { |
|
|
309 for (Pix p = first (); p != 0; next (p)) |
|
|
310 { |
|
|
311 tree_identifier *elt = this->operator () (p); |
|
|
312 elt->mark_as_formal_parameter (); |
|
|
313 } |
|
|
314 } |
|
|
315 |
|
|
316 void |
|
2086
|
317 tree_parameter_list::initialize_undefined_elements (octave_value& val) |
|
1093
|
318 { |
|
|
319 for (Pix p = first (); p != 0; next (p)) |
|
|
320 { |
|
|
321 tree_identifier *elt = this->operator () (p); |
|
|
322 if (! elt->is_defined ()) |
|
2371
|
323 { |
|
|
324 octave_variable_reference tmp (elt); |
|
2878
|
325 tmp.assign (octave_value::asn_eq, val); |
|
2371
|
326 } |
|
1093
|
327 } |
|
|
328 } |
|
|
329 |
|
|
330 void |
|
2086
|
331 tree_parameter_list::define_from_arg_vector (const octave_value_list& args) |
|
577
|
332 { |
|
712
|
333 int nargin = args.length (); |
|
|
334 |
|
|
335 if (nargin <= 0) |
|
577
|
336 return; |
|
|
337 |
|
712
|
338 int expected_nargin = length (); |
|
577
|
339 |
|
|
340 Pix p = first (); |
|
|
341 |
|
712
|
342 for (int i = 0; i < expected_nargin; i++) |
|
577
|
343 { |
|
|
344 tree_identifier *elt = this->operator () (p); |
|
|
345 |
|
2371
|
346 tree_constant *tmp = 0; |
|
577
|
347 |
|
|
348 if (i < nargin) |
|
|
349 { |
|
620
|
350 if (args(i).is_defined () && args(i).is_magic_colon ()) |
|
577
|
351 { |
|
|
352 ::error ("invalid use of colon in function argument list"); |
|
|
353 return; |
|
|
354 } |
|
2371
|
355 tmp = new tree_constant (args (i)); |
|
577
|
356 } |
|
|
357 |
|
|
358 elt->define (tmp); |
|
|
359 |
|
|
360 next (p); |
|
|
361 } |
|
|
362 } |
|
|
363 |
|
2086
|
364 octave_value_list |
|
723
|
365 tree_parameter_list::convert_to_const_vector (tree_va_return_list *vr_list) |
|
577
|
366 { |
|
|
367 int nout = length (); |
|
|
368 |
|
723
|
369 if (vr_list) |
|
|
370 nout += vr_list->length (); |
|
|
371 |
|
2086
|
372 octave_value_list retval; |
|
577
|
373 retval.resize (nout); |
|
|
374 |
|
|
375 int i = 0; |
|
|
376 |
|
|
377 for (Pix p = first (); p != 0; next (p)) |
|
|
378 { |
|
|
379 tree_identifier *elt = this->operator () (p); |
|
|
380 |
|
|
381 if (elt->is_defined ()) |
|
2859
|
382 retval(i) = elt->eval (); |
|
577
|
383 |
|
|
384 i++; |
|
|
385 } |
|
|
386 |
|
723
|
387 if (vr_list) |
|
|
388 { |
|
1321
|
389 for (Pix p = vr_list->first (); p != 0; vr_list->next (p)) |
|
723
|
390 { |
|
|
391 retval(i) = vr_list->operator () (p); |
|
|
392 i++; |
|
|
393 } |
|
|
394 } |
|
|
395 |
|
577
|
396 return retval; |
|
|
397 } |
|
|
398 |
|
1827
|
399 bool |
|
577
|
400 tree_parameter_list::is_defined (void) |
|
|
401 { |
|
1827
|
402 bool status = true; |
|
577
|
403 |
|
|
404 for (Pix p = first (); p != 0; next (p)) |
|
|
405 { |
|
|
406 tree_identifier *elt = this->operator () (p); |
|
|
407 |
|
|
408 if (! elt->is_defined ()) |
|
|
409 { |
|
1827
|
410 status = false; |
|
577
|
411 break; |
|
|
412 } |
|
|
413 } |
|
|
414 |
|
|
415 return status; |
|
|
416 } |
|
|
417 |
|
|
418 void |
|
2124
|
419 tree_parameter_list::accept (tree_walker& tw) |
|
581
|
420 { |
|
2124
|
421 tw.visit_parameter_list (*this); |
|
581
|
422 } |
|
|
423 |
|
|
424 // Return lists. |
|
|
425 |
|
1742
|
426 tree_return_list::~tree_return_list (void) |
|
|
427 { |
|
|
428 while (! empty ()) |
|
|
429 { |
|
|
430 tree_index_expression *t = remove_front (); |
|
|
431 delete t; |
|
|
432 } |
|
|
433 } |
|
|
434 |
|
581
|
435 void |
|
2124
|
436 tree_return_list::accept (tree_walker& tw) |
|
581
|
437 { |
|
2124
|
438 tw.visit_return_list (*this); |
|
581
|
439 } |
|
|
440 |
|
2846
|
441 // Declarations (global, static, etc.). |
|
581
|
442 |
|
2846
|
443 tree_decl_elt::~tree_decl_elt (void) |
|
1742
|
444 { |
|
2124
|
445 delete id; |
|
|
446 delete ass_expr; |
|
1742
|
447 } |
|
|
448 |
|
581
|
449 void |
|
2846
|
450 tree_decl_elt::accept (tree_walker& tw) |
|
577
|
451 { |
|
2846
|
452 tw.visit_decl_elt (*this); |
|
|
453 } |
|
|
454 |
|
|
455 // Initializer lists for declaration statements. |
|
|
456 |
|
|
457 void |
|
|
458 tree_decl_init_list::eval (tree_decl_elt::eval_fcn f, bool skip_init) |
|
|
459 { |
|
|
460 for (Pix p = first (); p != 0; next (p)) |
|
577
|
461 { |
|
2846
|
462 f (*(this->operator () (p)), skip_init); |
|
2124
|
463 |
|
2846
|
464 if (error_state) |
|
|
465 break; |
|
577
|
466 } |
|
|
467 } |
|
|
468 |
|
|
469 void |
|
2846
|
470 tree_decl_init_list::accept (tree_walker& tw) |
|
577
|
471 { |
|
2846
|
472 tw.visit_decl_init_list (*this); |
|
581
|
473 } |
|
|
474 |
|
|
475 // If. |
|
|
476 |
|
1742
|
477 tree_if_clause::~tree_if_clause (void) |
|
|
478 { |
|
|
479 delete expr; |
|
|
480 delete list; |
|
|
481 } |
|
|
482 |
|
577
|
483 int |
|
|
484 tree_if_clause::eval (void) |
|
|
485 { |
|
1491
|
486 if (is_else_clause () || expr->is_logically_true ("if")) |
|
577
|
487 { |
|
|
488 if (list) |
|
1827
|
489 list->eval (true); |
|
577
|
490 |
|
|
491 return 1; |
|
|
492 } |
|
|
493 |
|
|
494 return 0; |
|
|
495 } |
|
|
496 |
|
|
497 void |
|
2124
|
498 tree_if_clause::accept (tree_walker& tw) |
|
581
|
499 { |
|
2124
|
500 tw.visit_if_clause (*this); |
|
581
|
501 } |
|
|
502 |
|
|
503 // List of if commands. |
|
|
504 |
|
|
505 void |
|
577
|
506 tree_if_command_list::eval (void) |
|
|
507 { |
|
|
508 for (Pix p = first (); p != 0; next (p)) |
|
|
509 { |
|
|
510 tree_if_clause *t = this->operator () (p); |
|
|
511 |
|
|
512 if (t->eval () || error_state) |
|
|
513 break; |
|
|
514 } |
|
|
515 } |
|
|
516 |
|
581
|
517 void |
|
2124
|
518 tree_if_command_list::accept (tree_walker& tw) |
|
581
|
519 { |
|
2124
|
520 tw.visit_if_command_list (*this); |
|
581
|
521 } |
|
|
522 |
|
2764
|
523 // Switch. |
|
|
524 |
|
|
525 tree_switch_case::~tree_switch_case (void) |
|
|
526 { |
|
|
527 delete label; |
|
|
528 delete list; |
|
|
529 } |
|
|
530 |
|
|
531 bool |
|
|
532 tree_switch_case::label_matches (const octave_value& val) |
|
|
533 { |
|
|
534 bool retval = false; |
|
|
535 |
|
2859
|
536 octave_value label_value = label->eval (); |
|
2764
|
537 |
|
|
538 if (! error_state) |
|
|
539 { |
|
|
540 if (label_value.is_defined ()) |
|
|
541 { |
|
|
542 octave_value tmp = do_binary_op (octave_value::eq, |
|
|
543 val, label_value); |
|
|
544 |
|
|
545 if (! error_state) |
|
|
546 { |
|
|
547 if (tmp.is_defined ()) |
|
|
548 retval = tmp.is_true (); |
|
|
549 else |
|
|
550 eval_error (); |
|
|
551 } |
|
|
552 else |
|
|
553 eval_error (); |
|
|
554 } |
|
|
555 else |
|
|
556 eval_error (); |
|
|
557 } |
|
|
558 else |
|
|
559 eval_error (); |
|
|
560 |
|
|
561 return retval; |
|
|
562 } |
|
|
563 |
|
|
564 int |
|
|
565 tree_switch_case::eval (const octave_value& val) |
|
|
566 { |
|
|
567 int retval = 0; |
|
|
568 |
|
|
569 if (is_default_case () || label_matches (val)) |
|
|
570 { |
|
|
571 if (list) |
|
|
572 list->eval (true); |
|
|
573 |
|
|
574 retval = 1; |
|
|
575 } |
|
|
576 |
|
|
577 return retval; |
|
|
578 } |
|
|
579 |
|
|
580 void |
|
|
581 tree_switch_case::eval_error (void) |
|
|
582 { |
|
|
583 ::error ("evaluating switch case label"); |
|
|
584 } |
|
|
585 |
|
|
586 void |
|
|
587 tree_switch_case::accept (tree_walker& tw) |
|
|
588 { |
|
|
589 tw.visit_switch_case (*this); |
|
|
590 } |
|
|
591 |
|
|
592 // List of switch cases. |
|
|
593 |
|
|
594 void |
|
|
595 tree_switch_case_list::eval (const octave_value& val) |
|
|
596 { |
|
|
597 for (Pix p = first (); p != 0; next (p)) |
|
|
598 { |
|
|
599 tree_switch_case *t = this->operator () (p); |
|
|
600 |
|
|
601 if (t->eval (val) || error_state) |
|
|
602 break; |
|
|
603 } |
|
|
604 } |
|
|
605 |
|
|
606 void |
|
|
607 tree_switch_case_list::accept (tree_walker& tw) |
|
|
608 { |
|
|
609 tw.visit_switch_case_list (*this); |
|
|
610 } |
|
|
611 |
|
577
|
612 /* |
|
|
613 ;;; Local Variables: *** |
|
|
614 ;;; mode: C++ *** |
|
|
615 ;;; End: *** |
|
|
616 */ |
