|
529
|
1 // tree-expr.cc -*- C++ -*- |
|
494
|
2 /* |
|
|
3 |
|
1009
|
4 Copyright (C) 1992, 1993, 1994, 1995 John W. Eaton |
|
494
|
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 #ifdef HAVE_CONFIG_H |
|
1192
|
25 #include <config.h> |
|
494
|
26 #endif |
|
|
27 |
|
|
28 #include <sys/types.h> |
|
|
29 #ifdef HAVE_UNISTD_H |
|
|
30 #include <unistd.h> |
|
|
31 #endif |
|
|
32 |
|
|
33 #include <iostream.h> |
|
|
34 #include <strstream.h> |
|
663
|
35 #include <string.h> |
|
494
|
36 #include <limits.h> |
|
|
37 #include <ctype.h> |
|
|
38 #include <stdio.h> |
|
|
39 |
|
|
40 #include "variables.h" |
|
|
41 #include "user-prefs.h" |
|
704
|
42 #include "dynamic-ld.h" |
|
543
|
43 #include "help.h" |
|
494
|
44 #include "error.h" |
|
777
|
45 #include "gripes.h" |
|
494
|
46 #include "pager.h" |
|
584
|
47 #include "tree-base.h" |
|
494
|
48 #include "tree-expr.h" |
|
578
|
49 #include "tree-misc.h" |
|
494
|
50 #include "tree-const.h" |
|
|
51 #include "input.h" |
|
|
52 #include "symtab.h" |
|
|
53 #include "utils.h" |
|
|
54 #include "octave.h" |
|
|
55 #include "octave-hist.h" |
|
|
56 #include "unwind-prot.h" |
|
|
57 #include "parse.h" |
|
|
58 #include "lex.h" |
|
529
|
59 #include "defun.h" |
|
494
|
60 |
|
|
61 // Nonzero means we're returning from a function. |
|
|
62 extern int returning; |
|
|
63 |
|
1060
|
64 // Nonzero means we're breaking out of a loop or function body. |
|
|
65 extern int breaking; |
|
|
66 |
|
494
|
67 // But first, some extra functions used by the tree classes. |
|
|
68 |
|
|
69 // We seem to have no use for this now. Maybe it will be needed at |
|
|
70 // some future date, so here it is. |
|
|
71 #if 0 |
|
578
|
72 // Convert a linked list of trees to a vector of pointers to trees. |
|
|
73 |
|
494
|
74 static tree ** |
|
|
75 list_to_vector (tree *list, int& len) |
|
|
76 { |
|
|
77 len = list->length () + 1; |
|
|
78 |
|
|
79 tree **args = new tree * [len]; |
|
|
80 |
|
|
81 // args[0] may eventually hold something useful, like the function |
|
|
82 // name. |
|
|
83 tree *tmp_list = list; |
|
|
84 for (int k = 1; k < len; k++) |
|
|
85 { |
|
|
86 args[k] = tmp_list; |
|
|
87 tmp_list = tmp_list->next_elem (); |
|
|
88 } |
|
|
89 return args; |
|
|
90 } |
|
|
91 #endif |
|
|
92 |
|
|
93 static int |
|
767
|
94 any_element_less_than (const Matrix& a, double val) |
|
|
95 { |
|
|
96 int nr = a.rows (); |
|
|
97 int nc = a.columns (); |
|
|
98 for (int j = 0; j < nc; j++) |
|
|
99 for (int i = 0; i < nr; i++) |
|
|
100 if (a.elem (i, j) < val) |
|
|
101 return 1; |
|
|
102 return 0; |
|
|
103 } |
|
|
104 |
|
|
105 static int |
|
|
106 any_element_greater_than (const Matrix& a, double val) |
|
|
107 { |
|
|
108 int nr = a.rows (); |
|
|
109 int nc = a.columns (); |
|
|
110 for (int j = 0; j < nc; j++) |
|
|
111 for (int i = 0; i < nr; i++) |
|
|
112 if (a.elem (i, j) > val) |
|
|
113 return 1; |
|
|
114 return 0; |
|
|
115 } |
|
|
116 |
|
749
|
117 static void |
|
1199
|
118 print_constant (tree_constant& tc, char *name, int print_padding = 1) |
|
749
|
119 { |
|
|
120 int pad_after = 0; |
|
|
121 if (user_pref.print_answer_id_name) |
|
|
122 { |
|
1211
|
123 if (print_as_scalar (tc) || print_as_structure (tc)) |
|
749
|
124 { |
|
|
125 ostrstream output_buf; |
|
|
126 output_buf << name << " = " << ends; |
|
|
127 maybe_page_output (output_buf); |
|
|
128 } |
|
|
129 else |
|
|
130 { |
|
|
131 pad_after = 1; |
|
|
132 ostrstream output_buf; |
|
|
133 output_buf << name << " =\n\n" << ends; |
|
|
134 maybe_page_output (output_buf); |
|
|
135 } |
|
|
136 } |
|
|
137 |
|
|
138 tc.eval (1); |
|
|
139 |
|
1199
|
140 if (print_padding && pad_after) |
|
749
|
141 { |
|
|
142 ostrstream output_buf; |
|
|
143 output_buf << "\n" << ends; |
|
|
144 maybe_page_output (output_buf); |
|
|
145 } |
|
|
146 } |
|
|
147 |
|
578
|
148 // Make sure that all arguments have values. |
|
|
149 |
|
494
|
150 static int |
|
506
|
151 all_args_defined (const Octave_object& args) |
|
494
|
152 { |
|
506
|
153 int nargin = args.length (); |
|
|
154 |
|
712
|
155 for (int i = 0; i < nargin; i++) |
|
|
156 if (args(i).is_undefined ()) |
|
|
157 return 0; |
|
|
158 |
|
494
|
159 return 1; |
|
|
160 } |
|
|
161 |
|
578
|
162 // Are any of the arguments `:'? |
|
|
163 |
|
494
|
164 static int |
|
506
|
165 any_arg_is_magic_colon (const Octave_object& args) |
|
494
|
166 { |
|
506
|
167 int nargin = args.length (); |
|
|
168 |
|
712
|
169 for (int i = 0; i < nargin; i++) |
|
|
170 if (args(i).is_magic_colon ()) |
|
494
|
171 return 1; |
|
712
|
172 |
|
494
|
173 return 0; |
|
|
174 } |
|
|
175 |
|
581
|
176 // Expressions. |
|
|
177 |
|
|
178 tree_constant |
|
|
179 tree_expression::eval (int print) |
|
|
180 { |
|
|
181 panic ("invalid evaluation of generic expression"); |
|
|
182 return tree_constant (); |
|
|
183 } |
|
|
184 |
|
578
|
185 // General matrices. This list type is much more work to handle than |
|
|
186 // constant matrices, but it allows us to construct matrices from |
|
|
187 // other matrices, variables, and functions. |
|
494
|
188 |
|
|
189 tree_matrix::~tree_matrix (void) |
|
|
190 { |
|
|
191 delete element; |
|
|
192 delete next; |
|
|
193 } |
|
|
194 |
|
|
195 tree_matrix * |
|
578
|
196 tree_matrix::chain (tree_expression *t, tree_matrix::dir d) |
|
494
|
197 { |
|
|
198 tree_matrix *tmp = new tree_matrix (t, d); |
|
|
199 tmp->next = this; |
|
|
200 return tmp; |
|
|
201 } |
|
|
202 |
|
|
203 tree_matrix * |
|
|
204 tree_matrix::reverse (void) |
|
|
205 { |
|
|
206 tree_matrix *list = this; |
|
|
207 tree_matrix *next; |
|
529
|
208 tree_matrix *prev = 0; |
|
|
209 |
|
|
210 while (list) |
|
494
|
211 { |
|
|
212 next = list->next; |
|
|
213 list->next = prev; |
|
|
214 prev = list; |
|
|
215 list = next; |
|
|
216 } |
|
|
217 return prev; |
|
|
218 } |
|
|
219 |
|
|
220 int |
|
|
221 tree_matrix::length (void) |
|
|
222 { |
|
|
223 tree_matrix *list = this; |
|
|
224 int len = 0; |
|
529
|
225 while (list) |
|
494
|
226 { |
|
|
227 len++; |
|
|
228 list = list->next; |
|
|
229 } |
|
|
230 return len; |
|
|
231 } |
|
|
232 |
|
|
233 tree_return_list * |
|
|
234 tree_matrix::to_return_list (void) |
|
|
235 { |
|
529
|
236 tree_return_list *retval = 0; |
|
578
|
237 |
|
494
|
238 tree_matrix *list; |
|
578
|
239 |
|
529
|
240 for (list = this; list; list = list->next) |
|
494
|
241 { |
|
|
242 tree_expression *elem = list->element; |
|
578
|
243 |
|
|
244 int is_id = elem->is_identifier (); |
|
|
245 |
|
|
246 int is_idx_expr = elem->is_index_expression (); |
|
|
247 |
|
|
248 if (is_id || is_idx_expr) |
|
494
|
249 { |
|
578
|
250 tree_index_expression *idx_expr; |
|
|
251 if (is_id) |
|
|
252 { |
|
|
253 tree_identifier *id = (tree_identifier *) elem; |
|
|
254 idx_expr = new tree_index_expression (id); |
|
|
255 } |
|
494
|
256 else |
|
578
|
257 idx_expr = (tree_index_expression *) elem; |
|
|
258 |
|
494
|
259 if (list == this) |
|
|
260 retval = new tree_return_list (idx_expr); |
|
|
261 else |
|
578
|
262 retval->append (idx_expr); |
|
494
|
263 } |
|
|
264 else |
|
|
265 { |
|
|
266 delete retval; |
|
529
|
267 retval = 0; |
|
494
|
268 break; |
|
|
269 } |
|
|
270 } |
|
|
271 |
|
|
272 return retval; |
|
|
273 } |
|
|
274 |
|
|
275 // Just about as ugly as it gets. |
|
|
276 |
|
|
277 struct const_matrix_list |
|
|
278 { |
|
581
|
279 tree_matrix::dir direction; |
|
494
|
280 tree_constant elem; |
|
|
281 int nr; |
|
|
282 int nc; |
|
|
283 }; |
|
|
284 |
|
|
285 // Less ugly than before, anyway. |
|
|
286 |
|
|
287 tree_constant |
|
|
288 tree_matrix::eval (int print) |
|
|
289 { |
|
|
290 tree_constant retval; |
|
|
291 |
|
|
292 if (error_state) |
|
|
293 return retval; |
|
|
294 |
|
|
295 // Just count the elements without looking at them. |
|
|
296 |
|
|
297 int total_len = length (); |
|
|
298 |
|
|
299 // Easier to deal with this later instead of a tree_matrix structure. |
|
|
300 |
|
|
301 const_matrix_list *list = new const_matrix_list [total_len]; |
|
|
302 |
|
|
303 // Stats we want to keep track of. |
|
|
304 |
|
|
305 int all_strings = 1; |
|
|
306 |
|
|
307 int found_complex = 0; |
|
|
308 |
|
|
309 int row_total = 0; |
|
|
310 int col_total = 0; |
|
|
311 |
|
|
312 int row_height = 0; |
|
|
313 |
|
|
314 int cols_this_row = 0; |
|
|
315 |
|
|
316 int first_row = 1; |
|
|
317 |
|
|
318 int empties_ok = user_pref.empty_list_elements_ok; |
|
|
319 |
|
|
320 tree_matrix *ptr = this; |
|
|
321 |
|
|
322 // Stuff for the result matrix or string. Declared here so that we |
|
|
323 // don't get warnings from gcc about the goto crossing the |
|
|
324 // initialization of these values. |
|
|
325 |
|
|
326 int put_row = 0; |
|
|
327 int put_col = 0; |
|
|
328 |
|
|
329 int prev_nr = 0; |
|
|
330 int prev_nc = 0; |
|
|
331 |
|
|
332 Matrix m; |
|
|
333 ComplexMatrix cm; |
|
|
334 |
|
529
|
335 char *string = 0; |
|
|
336 char *str_ptr = 0; |
|
494
|
337 |
|
|
338 // Eliminate empties and gather stats. |
|
|
339 |
|
|
340 int found_new_row_in_empties = 0; |
|
|
341 |
|
|
342 int len = 0; |
|
|
343 for (int i = 0; i < total_len; i++) |
|
|
344 { |
|
|
345 tree_expression *elem = ptr->element; |
|
529
|
346 if (! elem) |
|
494
|
347 { |
|
|
348 retval = tree_constant (Matrix ()); |
|
|
349 goto done; |
|
|
350 } |
|
|
351 |
|
636
|
352 tree_constant tmp = elem->eval (0); |
|
494
|
353 if (error_state || tmp.is_undefined ()) |
|
|
354 { |
|
|
355 retval = tree_constant (); |
|
|
356 goto done; |
|
|
357 } |
|
|
358 |
|
|
359 int nr = tmp.rows (); |
|
|
360 int nc = tmp.columns (); |
|
|
361 |
|
581
|
362 dir direct = ptr->direction; |
|
494
|
363 |
|
|
364 if (nr == 0 || nc == 0) |
|
|
365 { |
|
|
366 if (empties_ok < 0) |
|
|
367 warning ("empty matrix found in matrix list"); |
|
|
368 else if (empties_ok == 0) |
|
|
369 { |
|
|
370 ::error ("empty matrix found in matrix list"); |
|
|
371 retval = tree_constant (); |
|
|
372 goto done; |
|
|
373 } |
|
|
374 |
|
|
375 if (direct == md_down) |
|
|
376 found_new_row_in_empties = 1; |
|
|
377 |
|
|
378 goto next; |
|
|
379 } |
|
|
380 |
|
|
381 if (found_new_row_in_empties) |
|
|
382 { |
|
|
383 found_new_row_in_empties = 0; |
|
581
|
384 list[len].direction = md_down; |
|
494
|
385 } |
|
|
386 else |
|
581
|
387 list[len].direction = direct; |
|
494
|
388 |
|
|
389 list[len].elem = tmp; |
|
|
390 list[len].nr = nr; |
|
|
391 list[len].nc = nc; |
|
|
392 |
|
610
|
393 if (all_strings && ! tmp.is_string ()) |
|
494
|
394 all_strings = 0; |
|
|
395 |
|
|
396 if (! found_complex && tmp.is_complex_type ()) |
|
|
397 found_complex = 1; |
|
|
398 |
|
|
399 len++; |
|
|
400 |
|
|
401 next: |
|
|
402 |
|
|
403 ptr = ptr->next; |
|
|
404 } |
|
|
405 |
|
|
406 // if (all_strings) |
|
|
407 // cerr << "all strings\n"; |
|
|
408 |
|
|
409 // Compute size of result matrix, and check to see that the dimensions |
|
|
410 // of all the elements will match up properly. |
|
|
411 |
|
|
412 for (i = 0; i < len; i++) |
|
|
413 { |
|
581
|
414 dir direct = list[i].direction; |
|
578
|
415 |
|
494
|
416 int nr = list[i].nr; |
|
|
417 int nc = list[i].nc; |
|
|
418 |
|
|
419 if (i == 0) |
|
|
420 { |
|
|
421 row_total = nr; |
|
|
422 col_total = nc; |
|
|
423 |
|
|
424 row_height = nr; |
|
|
425 cols_this_row = nc; |
|
|
426 } |
|
|
427 else |
|
|
428 { |
|
|
429 switch (direct) |
|
|
430 { |
|
|
431 case md_right: |
|
|
432 { |
|
|
433 if (nr != row_height) |
|
|
434 { |
|
|
435 ::error ("number of rows must match"); |
|
|
436 goto done; |
|
|
437 } |
|
|
438 else |
|
|
439 { |
|
|
440 cols_this_row += nc; |
|
|
441 if (first_row) |
|
|
442 col_total = cols_this_row; |
|
|
443 } |
|
|
444 } |
|
|
445 break; |
|
777
|
446 |
|
494
|
447 case md_down: |
|
|
448 { |
|
|
449 if (cols_this_row != col_total) |
|
|
450 { |
|
|
451 ::error ("number of columns must match"); |
|
|
452 goto done; |
|
|
453 } |
|
|
454 first_row = 0; |
|
|
455 row_total += nr; |
|
|
456 row_height = nr; |
|
|
457 cols_this_row = nc; |
|
|
458 } |
|
|
459 break; |
|
777
|
460 |
|
494
|
461 default: |
|
|
462 panic_impossible (); |
|
|
463 break; |
|
|
464 } |
|
|
465 } |
|
|
466 } |
|
|
467 |
|
|
468 // Don\'t forget to check to see if the last element will fit. |
|
|
469 |
|
|
470 if (cols_this_row != col_total) |
|
|
471 { |
|
|
472 ::error ("number of columns must match"); |
|
|
473 goto done; |
|
|
474 } |
|
|
475 |
|
|
476 // Now, extract the values from the individual elements and insert |
|
|
477 // them in the result matrix. |
|
|
478 |
|
|
479 if (all_strings && row_total == 1 && col_total > 0) |
|
|
480 { |
|
|
481 string = str_ptr = new char [col_total + 1]; |
|
|
482 string[col_total] = '\0'; |
|
|
483 } |
|
|
484 else if (found_complex) |
|
|
485 cm.resize (row_total, col_total, 0.0); |
|
|
486 else |
|
|
487 m.resize (row_total, col_total, 0.0); |
|
|
488 |
|
|
489 for (i = 0; i < len; i++) |
|
|
490 { |
|
|
491 tree_constant tmp = list[i].elem; |
|
|
492 |
|
|
493 int nr = list[i].nr; |
|
|
494 int nc = list[i].nc; |
|
|
495 |
|
|
496 if (nr == 0 || nc == 0) |
|
|
497 continue; |
|
|
498 |
|
|
499 if (i == 0) |
|
|
500 { |
|
|
501 put_row = 0; |
|
|
502 put_col = 0; |
|
|
503 } |
|
|
504 else |
|
|
505 { |
|
581
|
506 switch (list[i].direction) |
|
494
|
507 { |
|
|
508 case md_right: |
|
|
509 put_col += prev_nc; |
|
|
510 break; |
|
777
|
511 |
|
494
|
512 case md_down: |
|
|
513 put_row += prev_nr; |
|
|
514 put_col = 0; |
|
|
515 break; |
|
777
|
516 |
|
494
|
517 default: |
|
|
518 panic_impossible (); |
|
|
519 break; |
|
|
520 } |
|
|
521 } |
|
|
522 |
|
|
523 if (found_complex) |
|
|
524 { |
|
620
|
525 if (tmp.is_real_scalar ()) |
|
494
|
526 { |
|
|
527 cm (put_row, put_col) = tmp.double_value (); |
|
620
|
528 } |
|
636
|
529 else if (tmp.is_real_matrix () || tmp.is_range ()) |
|
620
|
530 { |
|
494
|
531 cm.insert (tmp.matrix_value (), put_row, put_col); |
|
620
|
532 } |
|
|
533 else if (tmp.is_complex_scalar ()) |
|
|
534 { |
|
494
|
535 cm (put_row, put_col) = tmp.complex_value (); |
|
620
|
536 } |
|
|
537 else |
|
|
538 { |
|
663
|
539 ComplexMatrix cm_tmp = tmp.complex_matrix_value (); |
|
|
540 |
|
|
541 if (error_state) |
|
|
542 goto done; |
|
|
543 |
|
|
544 cm.insert (cm_tmp, put_row, put_col); |
|
494
|
545 } |
|
|
546 } |
|
|
547 else |
|
|
548 { |
|
620
|
549 if (tmp.is_real_scalar ()) |
|
494
|
550 { |
|
|
551 m (put_row, put_col) = tmp.double_value (); |
|
620
|
552 } |
|
663
|
553 else if (tmp.is_string () && all_strings && str_ptr) |
|
620
|
554 { |
|
663
|
555 memcpy (str_ptr, tmp.string_value (), nc); |
|
|
556 str_ptr += nc; |
|
620
|
557 } |
|
|
558 else |
|
|
559 { |
|
663
|
560 Matrix m_tmp = tmp.matrix_value (); |
|
|
561 |
|
|
562 if (error_state) |
|
|
563 goto done; |
|
|
564 |
|
|
565 m.insert (m_tmp, put_row, put_col); |
|
494
|
566 } |
|
|
567 } |
|
|
568 |
|
|
569 prev_nr = nr; |
|
|
570 prev_nc = nc; |
|
|
571 } |
|
|
572 |
|
529
|
573 if (all_strings && string) |
|
494
|
574 retval = tree_constant (string); |
|
|
575 else if (found_complex) |
|
|
576 retval = tree_constant (cm); |
|
|
577 else |
|
|
578 retval = tree_constant (m); |
|
|
579 |
|
|
580 done: |
|
|
581 delete [] list; |
|
|
582 |
|
|
583 return retval; |
|
|
584 } |
|
|
585 |
|
581
|
586 void |
|
|
587 tree_matrix::print_code (ostream& os) |
|
|
588 { |
|
|
589 print_code_indent (os); |
|
|
590 |
|
|
591 if (in_parens) |
|
|
592 os << "("; |
|
|
593 |
|
|
594 os << "["; |
|
|
595 |
|
|
596 tree_matrix *list = this; |
|
|
597 |
|
|
598 while (list) |
|
|
599 { |
|
|
600 list->element->print_code (os); |
|
|
601 |
|
|
602 list = list->next; |
|
|
603 |
|
|
604 if (list) |
|
|
605 { |
|
|
606 switch (list->direction) |
|
|
607 { |
|
|
608 case md_right: |
|
|
609 os << ", "; |
|
|
610 break; |
|
777
|
611 |
|
581
|
612 case md_down: |
|
|
613 os << "; "; |
|
|
614 break; |
|
777
|
615 |
|
581
|
616 default: |
|
|
617 break; |
|
|
618 } |
|
|
619 } |
|
|
620 } |
|
|
621 |
|
|
622 os << "]"; |
|
|
623 |
|
|
624 if (in_parens) |
|
|
625 os << ")"; |
|
|
626 } |
|
|
627 |
|
666
|
628 // A base class for objects that can be return multiple values |
|
|
629 |
|
|
630 tree_constant |
|
|
631 tree_multi_val_ret::eval (int print) |
|
|
632 { |
|
|
633 panic ("invalid evaluation of generic expression"); |
|
|
634 return tree_constant (); |
|
|
635 } |
|
|
636 |
|
581
|
637 // A base class for objects that can be evaluated with argument lists. |
|
|
638 |
|
494
|
639 tree_constant |
|
782
|
640 tree_fvc::assign (tree_constant& t, const Octave_object& args) |
|
494
|
641 { |
|
|
642 panic_impossible (); |
|
|
643 return tree_constant (); |
|
|
644 } |
|
|
645 |
|
749
|
646 tree_constant |
|
|
647 tree_fvc::lookup_map_element (SLList<char*>& list) |
|
|
648 { |
|
|
649 static tree_constant retval; |
|
|
650 return retval; |
|
|
651 } |
|
|
652 |
|
578
|
653 // Symbols from the symbol table. |
|
494
|
654 |
|
|
655 char * |
|
|
656 tree_identifier::name (void) const |
|
|
657 { |
|
581
|
658 return sym ? sym->name () : 0; |
|
494
|
659 } |
|
|
660 |
|
|
661 tree_identifier * |
|
|
662 tree_identifier::define (tree_constant *t) |
|
|
663 { |
|
|
664 int status = sym->define (t); |
|
581
|
665 return status ? this : 0; |
|
494
|
666 } |
|
|
667 |
|
|
668 tree_identifier * |
|
|
669 tree_identifier::define (tree_function *t) |
|
|
670 { |
|
|
671 int status = sym->define (t); |
|
581
|
672 return status ? this : 0; |
|
494
|
673 } |
|
|
674 |
|
|
675 void |
|
|
676 tree_identifier::document (char *s) |
|
|
677 { |
|
529
|
678 if (sym && s) |
|
749
|
679 sym->document (strsave (s)); |
|
494
|
680 } |
|
|
681 |
|
|
682 tree_constant |
|
782
|
683 tree_identifier::assign (tree_constant& rhs) |
|
494
|
684 { |
|
749
|
685 tree_constant retval; |
|
494
|
686 |
|
|
687 if (rhs.is_defined ()) |
|
|
688 { |
|
|
689 if (! sym->is_defined ()) |
|
|
690 { |
|
|
691 if (! (sym->is_formal_parameter () |
|
|
692 || sym->is_linked_to_global ())) |
|
|
693 { |
|
|
694 link_to_builtin_variable (sym); |
|
|
695 } |
|
|
696 } |
|
|
697 else if (sym->is_function ()) |
|
|
698 { |
|
|
699 sym->clear (); |
|
|
700 } |
|
|
701 |
|
|
702 tree_constant *tmp = new tree_constant (rhs); |
|
749
|
703 |
|
|
704 if (sym->define (tmp)) |
|
|
705 retval = rhs; |
|
|
706 else |
|
|
707 delete tmp; |
|
494
|
708 } |
|
|
709 |
|
749
|
710 return retval; |
|
494
|
711 } |
|
|
712 |
|
|
713 tree_constant |
|
782
|
714 tree_identifier::assign (tree_constant& rhs, const Octave_object& args) |
|
494
|
715 { |
|
|
716 tree_constant retval; |
|
|
717 |
|
|
718 if (rhs.is_defined ()) |
|
|
719 { |
|
|
720 if (! sym->is_defined ()) |
|
|
721 { |
|
|
722 if (! (sym->is_formal_parameter () |
|
|
723 || sym->is_linked_to_global ())) |
|
|
724 { |
|
|
725 link_to_builtin_variable (sym); |
|
|
726 } |
|
|
727 } |
|
|
728 else if (sym->is_function ()) |
|
|
729 { |
|
|
730 sym->clear (); |
|
|
731 } |
|
|
732 |
|
|
733 if (sym->is_variable () && sym->is_defined ()) |
|
|
734 { |
|
|
735 tree_fvc *tmp = sym->def (); |
|
506
|
736 retval = tmp->assign (rhs, args); |
|
494
|
737 } |
|
|
738 else |
|
|
739 { |
|
|
740 assert (! sym->is_defined ()); |
|
|
741 |
|
|
742 if (! user_pref.resize_on_range_error) |
|
|
743 { |
|
|
744 ::error ("indexed assignment to previously undefined variables"); |
|
|
745 ::error ("is only possible when resize_on_range_error is true"); |
|
749
|
746 } |
|
|
747 else |
|
|
748 { |
|
|
749 tree_constant *tmp = new tree_constant (); |
|
|
750 retval = tmp->assign (rhs, args); |
|
|
751 if (retval.is_defined ()) |
|
|
752 sym->define (tmp); |
|
|
753 } |
|
|
754 } |
|
|
755 } |
|
|
756 |
|
|
757 return retval; |
|
|
758 } |
|
|
759 |
|
|
760 tree_constant |
|
782
|
761 tree_identifier::assign (SLList<char*> list, tree_constant& rhs) |
|
749
|
762 { |
|
|
763 tree_constant retval; |
|
|
764 |
|
|
765 if (rhs.is_defined ()) |
|
|
766 { |
|
|
767 if (sym->is_function ()) |
|
|
768 sym->clear (); |
|
|
769 |
|
|
770 tree_fvc *curr_val = sym->def (); |
|
|
771 |
|
|
772 tree_constant *tmp = 0; |
|
|
773 if (curr_val && curr_val->is_constant ()) |
|
|
774 tmp = (tree_constant *) curr_val; |
|
|
775 else |
|
|
776 { |
|
|
777 tmp = new tree_constant (); |
|
|
778 if (! sym->define (tmp)) |
|
|
779 { |
|
|
780 delete tmp; |
|
|
781 tmp = 0; |
|
494
|
782 } |
|
749
|
783 } |
|
|
784 |
|
|
785 if (tmp) |
|
|
786 retval = tmp->assign_map_element (list, rhs); |
|
|
787 } |
|
|
788 |
|
|
789 return retval; |
|
|
790 } |
|
|
791 |
|
|
792 tree_constant |
|
782
|
793 tree_identifier::assign (SLList<char*> list, tree_constant& rhs, |
|
749
|
794 const Octave_object& args) |
|
|
795 { |
|
|
796 tree_constant retval; |
|
|
797 |
|
|
798 if (rhs.is_defined ()) |
|
|
799 { |
|
|
800 if (sym->is_function ()) |
|
|
801 sym->clear (); |
|
|
802 |
|
|
803 if (sym->is_variable () && sym->is_defined ()) |
|
|
804 { |
|
|
805 tree_fvc *curr_val = sym->def (); |
|
|
806 |
|
|
807 tree_constant *tmp; |
|
|
808 if (curr_val && curr_val->is_constant ()) |
|
|
809 tmp = (tree_constant *) curr_val; |
|
|
810 else |
|
|
811 panic_impossible (); |
|
|
812 |
|
|
813 retval = tmp->assign_map_element (list, rhs, args); |
|
|
814 } |
|
|
815 else |
|
|
816 { |
|
|
817 assert (! sym->is_defined ()); |
|
|
818 |
|
|
819 if (! user_pref.resize_on_range_error) |
|
|
820 { |
|
|
821 ::error ("indexed assignment to previously undefined variables"); |
|
|
822 ::error ("is only possible when resize_on_range_error is true"); |
|
|
823 } |
|
|
824 else |
|
|
825 { |
|
|
826 tree_constant *tmp = new tree_constant (); |
|
|
827 |
|
|
828 retval = tmp->assign_map_element (list, rhs, args); |
|
|
829 |
|
|
830 if (retval.is_defined ()) |
|
|
831 sym->define (tmp); |
|
|
832 } |
|
494
|
833 } |
|
|
834 } |
|
|
835 |
|
|
836 return retval; |
|
|
837 } |
|
|
838 |
|
500
|
839 int |
|
|
840 tree_identifier::is_defined (void) |
|
|
841 { |
|
529
|
842 return (sym && sym->is_defined ()); |
|
500
|
843 } |
|
|
844 |
|
494
|
845 void |
|
578
|
846 tree_identifier::bump_value (tree_expression::type etype) |
|
494
|
847 { |
|
529
|
848 if (sym) |
|
494
|
849 { |
|
922
|
850 if (sym->is_read_only ()) |
|
|
851 { |
|
|
852 ::error ("can't redefined read-only variable `%s'", name ()); |
|
|
853 } |
|
|
854 else |
|
|
855 { |
|
|
856 tree_fvc *tmp = sym->def (); |
|
|
857 if (tmp) |
|
|
858 tmp->bump_value (etype); |
|
|
859 } |
|
494
|
860 } |
|
|
861 } |
|
|
862 |
|
|
863 void |
|
|
864 tree_identifier::eval_undefined_error (void) |
|
|
865 { |
|
749
|
866 char *nm = name (); |
|
494
|
867 int l = line (); |
|
|
868 int c = column (); |
|
|
869 if (l == -1 && c == -1) |
|
581
|
870 ::error ("`%s' undefined", nm); |
|
494
|
871 else |
|
|
872 ::error ("`%s' undefined near line %d column %d", nm, l, c); |
|
|
873 } |
|
|
874 |
|
578
|
875 // Try to find a definition for an identifier. Here's how: |
|
|
876 // |
|
|
877 // * If the identifier is already defined and is a function defined |
|
|
878 // in an function file that has been modified since the last time |
|
|
879 // we parsed it, parse it again. |
|
|
880 // |
|
|
881 // * If the identifier is not defined, try to find a builtin |
|
|
882 // variable or an already compiled function with the same name. |
|
|
883 // |
|
|
884 // * If the identifier is still undefined, try looking for an |
|
|
885 // function file to parse. |
|
|
886 // |
|
|
887 // * On systems that support dynamic linking, we prefer .oct files |
|
|
888 // over .m files. |
|
|
889 |
|
494
|
890 tree_fvc * |
|
749
|
891 tree_identifier::do_lookup (int& script_file_executed, int exec_script) |
|
494
|
892 { |
|
749
|
893 script_file_executed = lookup (sym, exec_script); |
|
494
|
894 |
|
712
|
895 tree_fvc *retval = 0; |
|
494
|
896 |
|
|
897 if (! script_file_executed) |
|
712
|
898 retval = sym->def (); |
|
|
899 |
|
|
900 return retval; |
|
494
|
901 } |
|
|
902 |
|
|
903 void |
|
749
|
904 tree_identifier::link_to_global (void) |
|
|
905 { |
|
|
906 if (sym) |
|
|
907 link_to_global_variable (sym); |
|
|
908 } |
|
|
909 |
|
|
910 void |
|
494
|
911 tree_identifier::mark_as_formal_parameter (void) |
|
|
912 { |
|
529
|
913 if (sym) |
|
494
|
914 sym->mark_as_formal_parameter (); |
|
|
915 } |
|
|
916 |
|
|
917 tree_constant |
|
|
918 tree_identifier::eval (int print) |
|
|
919 { |
|
|
920 tree_constant retval; |
|
|
921 |
|
|
922 if (error_state) |
|
|
923 return retval; |
|
|
924 |
|
|
925 int script_file_executed = 0; |
|
|
926 |
|
712
|
927 tree_fvc *object_to_eval = do_lookup (script_file_executed); |
|
494
|
928 |
|
|
929 if (! script_file_executed) |
|
|
930 { |
|
712
|
931 if (object_to_eval) |
|
494
|
932 { |
|
|
933 int nargout = maybe_do_ans_assign ? 0 : 1; |
|
|
934 |
|
1003
|
935 if (nargout) |
|
|
936 { |
|
|
937 Octave_object tmp_args; |
|
|
938 Octave_object tmp = object_to_eval->eval (0, nargout, tmp_args); |
|
|
939 |
|
|
940 if (tmp.length () > 0) |
|
|
941 retval = tmp(0); |
|
|
942 } |
|
|
943 else |
|
|
944 retval = object_to_eval->eval (0); |
|
494
|
945 } |
|
529
|
946 else |
|
|
947 eval_undefined_error (); |
|
494
|
948 } |
|
|
949 |
|
|
950 if (! error_state && retval.is_defined ()) |
|
|
951 { |
|
712
|
952 if (maybe_do_ans_assign && ! object_to_eval->is_constant ()) |
|
1162
|
953 bind_ans (retval, print); |
|
|
954 else if (print) |
|
|
955 print_constant (retval, name ()); |
|
494
|
956 } |
|
1162
|
957 |
|
494
|
958 return retval; |
|
|
959 } |
|
|
960 |
|
500
|
961 Octave_object |
|
506
|
962 tree_identifier::eval (int print, int nargout, const Octave_object& args) |
|
494
|
963 { |
|
500
|
964 Octave_object retval; |
|
494
|
965 |
|
|
966 if (error_state) |
|
|
967 return retval; |
|
|
968 |
|
|
969 int script_file_executed = 0; |
|
|
970 |
|
712
|
971 tree_fvc *object_to_eval = do_lookup (script_file_executed); |
|
494
|
972 |
|
|
973 if (! script_file_executed) |
|
|
974 { |
|
712
|
975 if (object_to_eval) |
|
494
|
976 { |
|
|
977 if (maybe_do_ans_assign && nargout == 1) |
|
|
978 { |
|
|
979 |
|
|
980 // Don't count the output arguments that we create automatically. |
|
|
981 |
|
|
982 nargout = 0; |
|
|
983 |
|
712
|
984 retval = object_to_eval->eval (0, nargout, args); |
|
494
|
985 |
|
500
|
986 if (retval.length () > 0 && retval(0).is_defined ()) |
|
1162
|
987 bind_ans (retval(0), print); |
|
494
|
988 } |
|
|
989 else |
|
712
|
990 retval = object_to_eval->eval (print, nargout, args); |
|
494
|
991 } |
|
529
|
992 else |
|
|
993 eval_undefined_error (); |
|
494
|
994 } |
|
|
995 |
|
|
996 return retval; |
|
|
997 } |
|
|
998 |
|
581
|
999 void |
|
|
1000 tree_identifier::print_code (ostream& os) |
|
|
1001 { |
|
|
1002 print_code_indent (os); |
|
|
1003 |
|
|
1004 if (in_parens) |
|
|
1005 os << "("; |
|
|
1006 |
|
|
1007 char *nm = name (); |
|
|
1008 os << (nm) ? nm : "(null)"; |
|
|
1009 |
|
|
1010 if (in_parens) |
|
|
1011 os << ")"; |
|
|
1012 } |
|
|
1013 |
|
749
|
1014 // Indirect references to values (structure elements). |
|
|
1015 |
|
|
1016 tree_indirect_ref::~tree_indirect_ref (void) |
|
|
1017 { |
|
|
1018 while (! refs.empty ()) |
|
|
1019 { |
|
|
1020 char *t = refs.remove_front (); |
|
|
1021 delete [] t; |
|
|
1022 } |
|
|
1023 |
|
750
|
1024 if (! preserve_ident) |
|
|
1025 delete id; |
|
749
|
1026 } |
|
|
1027 |
|
|
1028 tree_indirect_ref * |
|
|
1029 tree_indirect_ref::chain (const char *elt) |
|
|
1030 { |
|
|
1031 refs.append (strsave (elt)); |
|
|
1032 return this; |
|
|
1033 } |
|
|
1034 |
|
|
1035 char * |
|
|
1036 tree_indirect_ref::name (void) |
|
|
1037 { |
|
|
1038 char *id_nm = id->name (); |
|
|
1039 if (refs.empty ()) |
|
|
1040 return id_nm; |
|
|
1041 else |
|
|
1042 { |
|
|
1043 static char *nm = 0; |
|
|
1044 delete [] nm; |
|
|
1045 |
|
|
1046 ostrstream tmp; |
|
|
1047 |
|
|
1048 tmp << id_nm; |
|
|
1049 |
|
|
1050 for (Pix p = refs.first (); p != 0; refs.next (p)) |
|
|
1051 { |
|
|
1052 char *elt = refs (p); |
|
|
1053 |
|
|
1054 if (elt) |
|
|
1055 tmp << "." << elt; |
|
|
1056 } |
|
|
1057 |
|
|
1058 tmp << ends; |
|
|
1059 nm = tmp.str (); |
|
|
1060 return nm; |
|
|
1061 } |
|
|
1062 } |
|
|
1063 |
|
|
1064 tree_constant |
|
782
|
1065 tree_indirect_ref::assign (tree_constant& t) |
|
749
|
1066 { |
|
|
1067 tree_constant retval; |
|
|
1068 |
|
|
1069 if (refs.empty ()) |
|
|
1070 retval = id->assign (t); |
|
|
1071 else |
|
|
1072 retval = id->assign (refs, t); |
|
|
1073 |
|
|
1074 return retval; |
|
|
1075 } |
|
|
1076 |
|
|
1077 tree_constant |
|
782
|
1078 tree_indirect_ref::assign (tree_constant& t, const Octave_object& args) |
|
749
|
1079 { |
|
|
1080 tree_constant retval; |
|
|
1081 |
|
|
1082 if (refs.empty ()) |
|
|
1083 retval = id->assign (t, args); |
|
|
1084 else |
|
|
1085 retval = id->assign (refs, t, args); |
|
|
1086 |
|
|
1087 return retval; |
|
|
1088 } |
|
|
1089 |
|
|
1090 tree_constant |
|
|
1091 tree_indirect_ref::eval (int print) |
|
|
1092 { |
|
|
1093 tree_constant retval; |
|
|
1094 |
|
|
1095 if (error_state) |
|
|
1096 return retval; |
|
|
1097 |
|
|
1098 if (refs.empty ()) |
|
|
1099 { |
|
|
1100 retval = id->eval (print); |
|
|
1101 } |
|
|
1102 else |
|
|
1103 { |
|
|
1104 int script_file_executed; |
|
|
1105 |
|
|
1106 tree_fvc *object_to_eval = id->do_lookup (script_file_executed, 0); |
|
|
1107 |
|
|
1108 if (object_to_eval) |
|
|
1109 { |
|
|
1110 retval = object_to_eval->lookup_map_element (refs); |
|
|
1111 |
|
|
1112 if (! error_state && print) |
|
|
1113 print_constant (retval, name ()); |
|
|
1114 } |
|
|
1115 else |
|
|
1116 id->eval_undefined_error (); |
|
|
1117 } |
|
|
1118 |
|
|
1119 return retval; |
|
|
1120 } |
|
|
1121 |
|
|
1122 Octave_object |
|
|
1123 tree_indirect_ref::eval (int print, int nargout, const Octave_object& args) |
|
|
1124 { |
|
|
1125 Octave_object retval; |
|
|
1126 |
|
|
1127 if (error_state) |
|
|
1128 return retval; |
|
|
1129 |
|
|
1130 if (refs.empty ()) |
|
|
1131 { |
|
|
1132 retval = id->eval (print, nargout, args); |
|
|
1133 } |
|
|
1134 else |
|
|
1135 { |
|
|
1136 int script_file_executed; |
|
|
1137 |
|
|
1138 tree_fvc *object_to_eval = id->do_lookup (script_file_executed, 0); |
|
|
1139 |
|
|
1140 if (object_to_eval) |
|
|
1141 { |
|
|
1142 tree_constant tmp = object_to_eval->lookup_map_element (refs); |
|
|
1143 |
|
|
1144 if (! error_state) |
|
|
1145 { |
|
|
1146 retval = tmp.eval (0, nargout, args); |
|
|
1147 |
|
|
1148 if (! error_state && print) |
|
|
1149 { |
|
|
1150 tmp = retval (0); |
|
|
1151 if (tmp.is_defined ()) |
|
|
1152 print_constant (tmp, name ()); |
|
|
1153 } |
|
|
1154 } |
|
|
1155 } |
|
|
1156 else |
|
|
1157 id->eval_undefined_error (); |
|
|
1158 } |
|
|
1159 |
|
|
1160 return retval; |
|
|
1161 } |
|
|
1162 |
|
|
1163 void |
|
|
1164 tree_indirect_ref::print_code (ostream& os) |
|
|
1165 { |
|
|
1166 print_code_indent (os); |
|
|
1167 |
|
|
1168 if (in_parens) |
|
|
1169 os << "("; |
|
|
1170 |
|
|
1171 char *nm = id ? id->name () : "(null)"; |
|
|
1172 os << (nm) ? nm : "(null)"; |
|
|
1173 |
|
|
1174 for (Pix p = refs.first (); p != 0; refs.next (p)) |
|
|
1175 { |
|
|
1176 char *elt = refs (p); |
|
|
1177 |
|
|
1178 if (elt) |
|
|
1179 os << "." << elt; |
|
|
1180 } |
|
|
1181 |
|
|
1182 if (in_parens) |
|
|
1183 os << ")"; |
|
|
1184 } |
|
|
1185 |
|
581
|
1186 // Index expressions. |
|
|
1187 |
|
|
1188 tree_index_expression::~tree_index_expression (void) |
|
|
1189 { |
|
|
1190 delete id; |
|
|
1191 delete list; |
|
|
1192 } |
|
|
1193 |
|
|
1194 tree_constant |
|
|
1195 tree_index_expression::eval (int print) |
|
|
1196 { |
|
|
1197 tree_constant retval; |
|
|
1198 |
|
|
1199 if (error_state) |
|
|
1200 return retval; |
|
|
1201 |
|
|
1202 if (list) |
|
|
1203 { |
|
712
|
1204 // Extract the arguments into a simple vector. Don't pass null args. |
|
|
1205 |
|
581
|
1206 Octave_object args = list->convert_to_const_vector (); |
|
712
|
1207 |
|
581
|
1208 if (error_state) |
|
|
1209 eval_error (); |
|
922
|
1210 else |
|
581
|
1211 { |
|
922
|
1212 int nargin = args.length (); |
|
581
|
1213 |
|
|
1214 if (error_state) |
|
|
1215 eval_error (); |
|
1089
|
1216 else if (nargin > 0) |
|
922
|
1217 { |
|
1089
|
1218 if (all_args_defined (args)) |
|
|
1219 { |
|
|
1220 Octave_object tmp = id->eval (print, 1, args); |
|
|
1221 |
|
|
1222 if (error_state) |
|
|
1223 eval_error (); |
|
|
1224 else if (tmp.length () > 0) |
|
|
1225 retval = tmp(0); |
|
|
1226 } |
|
|
1227 else |
|
|
1228 { |
|
|
1229 ::error ("undefined arguments found in index expression"); |
|
|
1230 eval_error (); |
|
|
1231 } |
|
922
|
1232 } |
|
1089
|
1233 else |
|
|
1234 panic_impossible (); // XXX FIXME XXX -- is this correct? |
|
581
|
1235 } |
|
|
1236 } |
|
|
1237 else |
|
|
1238 { |
|
|
1239 retval = id->eval (print); |
|
749
|
1240 |
|
581
|
1241 if (error_state) |
|
|
1242 eval_error (); |
|
|
1243 } |
|
|
1244 |
|
|
1245 return retval; |
|
|
1246 } |
|
|
1247 |
|
|
1248 Octave_object |
|
|
1249 tree_index_expression::eval (int print, int nargout, const Octave_object& args) |
|
|
1250 { |
|
|
1251 Octave_object retval; |
|
|
1252 |
|
|
1253 if (error_state) |
|
|
1254 return retval; |
|
|
1255 |
|
|
1256 if (list) |
|
|
1257 { |
|
712
|
1258 // Extract the arguments into a simple vector. Don't pass null args. |
|
|
1259 |
|
581
|
1260 Octave_object args = list->convert_to_const_vector (); |
|
712
|
1261 |
|
581
|
1262 if (error_state) |
|
|
1263 eval_error (); |
|
922
|
1264 else |
|
581
|
1265 { |
|
922
|
1266 int nargin = args.length (); |
|
749
|
1267 |
|
581
|
1268 if (error_state) |
|
|
1269 eval_error (); |
|
1089
|
1270 else if (nargin > 0) |
|
922
|
1271 { |
|
1089
|
1272 if (all_args_defined (args)) |
|
|
1273 { |
|
|
1274 retval = id->eval (print, nargout, args); |
|
|
1275 |
|
|
1276 if (error_state) |
|
|
1277 eval_error (); |
|
|
1278 } |
|
|
1279 else |
|
|
1280 { |
|
|
1281 ::error ("undefined arguments found in index expression"); |
|
|
1282 eval_error (); |
|
|
1283 } |
|
922
|
1284 } |
|
1089
|
1285 else |
|
|
1286 panic_impossible (); // XXX FIXME XXX -- is this correct? |
|
581
|
1287 } |
|
|
1288 } |
|
|
1289 else |
|
|
1290 { |
|
|
1291 Octave_object tmp_args; |
|
749
|
1292 |
|
581
|
1293 retval = id->eval (print, nargout, tmp_args); |
|
749
|
1294 |
|
581
|
1295 if (error_state) |
|
|
1296 eval_error (); |
|
|
1297 } |
|
|
1298 |
|
|
1299 return retval; |
|
|
1300 } |
|
|
1301 |
|
|
1302 void |
|
|
1303 tree_index_expression::eval_error (void) |
|
|
1304 { |
|
|
1305 if (error_state > 0) |
|
|
1306 { |
|
|
1307 int l = line (); |
|
|
1308 int c = column (); |
|
|
1309 char *fmt; |
|
|
1310 if (l != -1 && c != -1) |
|
|
1311 { |
|
|
1312 if (list) |
|
|
1313 fmt = "evaluating index expression near line %d, column %d"; |
|
|
1314 else |
|
|
1315 fmt = "evaluating expression near line %d, column %d"; |
|
|
1316 |
|
|
1317 ::error (fmt, l, c); |
|
|
1318 } |
|
|
1319 else |
|
|
1320 { |
|
|
1321 if (list) |
|
|
1322 ::error ("evaluating index expression"); |
|
|
1323 else |
|
|
1324 ::error ("evaluating expression"); |
|
|
1325 } |
|
|
1326 } |
|
|
1327 } |
|
|
1328 |
|
|
1329 void |
|
|
1330 tree_index_expression::print_code (ostream& os) |
|
|
1331 { |
|
|
1332 print_code_indent (os); |
|
|
1333 |
|
|
1334 if (in_parens) |
|
|
1335 os << "("; |
|
|
1336 |
|
|
1337 if (id) |
|
|
1338 id->print_code (os); |
|
|
1339 |
|
|
1340 if (list) |
|
|
1341 { |
|
|
1342 os << " ("; |
|
|
1343 list->print_code (os); |
|
|
1344 os << ")"; |
|
|
1345 } |
|
|
1346 |
|
|
1347 if (in_parens) |
|
|
1348 os << ")"; |
|
|
1349 } |
|
|
1350 |
|
|
1351 // Prefix expressions. |
|
|
1352 |
|
|
1353 tree_constant |
|
|
1354 tree_prefix_expression::eval (int print) |
|
|
1355 { |
|
|
1356 tree_constant retval; |
|
|
1357 |
|
|
1358 if (error_state) |
|
|
1359 return retval; |
|
|
1360 |
|
|
1361 if (id) |
|
|
1362 { |
|
|
1363 id->bump_value (etype); |
|
|
1364 if (error_state) |
|
922
|
1365 eval_error (); |
|
|
1366 else |
|
581
|
1367 { |
|
922
|
1368 retval = id->eval (print); |
|
581
|
1369 if (error_state) |
|
922
|
1370 { |
|
|
1371 retval = tree_constant (); |
|
|
1372 if (error_state) |
|
|
1373 eval_error (); |
|
|
1374 } |
|
581
|
1375 } |
|
|
1376 } |
|
|
1377 return retval; |
|
|
1378 } |
|
|
1379 |
|
|
1380 char * |
|
|
1381 tree_prefix_expression::oper (void) const |
|
|
1382 { |
|
|
1383 static char *op; |
|
|
1384 switch (etype) |
|
|
1385 { |
|
777
|
1386 case tree_expression::increment: |
|
|
1387 op = "++"; |
|
|
1388 break; |
|
|
1389 |
|
|
1390 case tree_expression::decrement: |
|
|
1391 op = "--"; |
|
|
1392 break; |
|
|
1393 |
|
|
1394 default: |
|
|
1395 op = "<unknown>"; |
|
|
1396 break; |
|
581
|
1397 } |
|
|
1398 return op; |
|
|
1399 } |
|
|
1400 |
|
|
1401 void |
|
|
1402 tree_prefix_expression::eval_error (void) |
|
|
1403 { |
|
|
1404 if (error_state > 0) |
|
|
1405 { |
|
|
1406 char *op = oper (); |
|
|
1407 |
|
|
1408 ::error ("evaluating prefix operator `%s' near line %d, column %d", |
|
|
1409 op, line (), column ()); |
|
|
1410 } |
|
|
1411 } |
|
|
1412 |
|
|
1413 void |
|
|
1414 tree_prefix_expression::print_code (ostream& os) |
|
|
1415 { |
|
|
1416 print_code_indent (os); |
|
|
1417 |
|
|
1418 if (in_parens) |
|
|
1419 os << "("; |
|
|
1420 |
|
|
1421 os << oper (); |
|
|
1422 |
|
|
1423 if (id) |
|
|
1424 id->print_code (os); |
|
|
1425 |
|
|
1426 if (in_parens) |
|
|
1427 os << ")"; |
|
|
1428 } |
|
|
1429 |
|
|
1430 // Postfix expressions. |
|
|
1431 |
|
|
1432 tree_constant |
|
|
1433 tree_postfix_expression::eval (int print) |
|
|
1434 { |
|
|
1435 tree_constant retval; |
|
|
1436 |
|
|
1437 if (error_state) |
|
|
1438 return retval; |
|
|
1439 |
|
|
1440 if (id) |
|
|
1441 { |
|
|
1442 retval = id->eval (print); |
|
|
1443 id->bump_value (etype); |
|
|
1444 if (error_state) |
|
|
1445 { |
|
|
1446 retval = tree_constant (); |
|
|
1447 if (error_state) |
|
|
1448 eval_error (); |
|
|
1449 } |
|
|
1450 } |
|
|
1451 return retval; |
|
|
1452 } |
|
|
1453 |
|
|
1454 char * |
|
|
1455 tree_postfix_expression::oper (void) const |
|
|
1456 { |
|
|
1457 static char *op; |
|
|
1458 switch (etype) |
|
|
1459 { |
|
777
|
1460 case tree_expression::increment: |
|
|
1461 op = "++"; |
|
|
1462 break; |
|
|
1463 |
|
|
1464 case tree_expression::decrement: |
|
|
1465 op = "--"; |
|
|
1466 break; |
|
|
1467 |
|
|
1468 default: |
|
|
1469 op = "<unknown>"; |
|
|
1470 break; |
|
581
|
1471 } |
|
|
1472 return op; |
|
|
1473 } |
|
|
1474 |
|
|
1475 void |
|
|
1476 tree_postfix_expression::eval_error (void) |
|
|
1477 { |
|
|
1478 if (error_state > 0) |
|
|
1479 { |
|
|
1480 char *op = oper (); |
|
|
1481 |
|
|
1482 ::error ("evaluating postfix operator `%s' near line %d, column %d", |
|
|
1483 op, line (), column ()); |
|
|
1484 } |
|
|
1485 } |
|
|
1486 |
|
|
1487 void |
|
|
1488 tree_postfix_expression::print_code (ostream& os) |
|
|
1489 { |
|
|
1490 print_code_indent (os); |
|
|
1491 |
|
|
1492 if (in_parens) |
|
|
1493 os << "("; |
|
|
1494 |
|
|
1495 if (id) |
|
|
1496 id->print_code (os); |
|
|
1497 |
|
|
1498 os << oper (); |
|
|
1499 |
|
|
1500 if (in_parens) |
|
|
1501 os << ")"; |
|
|
1502 } |
|
|
1503 |
|
|
1504 // Unary expressions. |
|
|
1505 |
|
|
1506 tree_constant |
|
|
1507 tree_unary_expression::eval (int print) |
|
|
1508 { |
|
|
1509 if (error_state) |
|
|
1510 return tree_constant (); |
|
|
1511 |
|
712
|
1512 tree_constant retval; |
|
581
|
1513 |
|
|
1514 switch (etype) |
|
|
1515 { |
|
|
1516 case tree_expression::not: |
|
|
1517 case tree_expression::uminus: |
|
|
1518 case tree_expression::hermitian: |
|
|
1519 case tree_expression::transpose: |
|
|
1520 if (op) |
|
|
1521 { |
|
636
|
1522 tree_constant u = op->eval (0); |
|
581
|
1523 if (error_state) |
|
|
1524 eval_error (); |
|
|
1525 else if (u.is_defined ()) |
|
|
1526 { |
|
712
|
1527 retval = do_unary_op (u, etype); |
|
581
|
1528 if (error_state) |
|
|
1529 { |
|
712
|
1530 retval = tree_constant (); |
|
581
|
1531 if (error_state) |
|
|
1532 eval_error (); |
|
|
1533 } |
|
|
1534 } |
|
|
1535 } |
|
|
1536 break; |
|
777
|
1537 |
|
581
|
1538 default: |
|
|
1539 ::error ("unary operator %d not implemented", etype); |
|
|
1540 break; |
|
|
1541 } |
|
|
1542 |
|
712
|
1543 return retval; |
|
581
|
1544 } |
|
|
1545 |
|
|
1546 char * |
|
|
1547 tree_unary_expression::oper (void) const |
|
|
1548 { |
|
|
1549 static char *op; |
|
|
1550 switch (etype) |
|
|
1551 { |
|
777
|
1552 case tree_expression::not: |
|
|
1553 op = "!"; |
|
|
1554 break; |
|
|
1555 |
|
|
1556 case tree_expression::uminus: |
|
|
1557 op = "-"; |
|
|
1558 break; |
|
|
1559 |
|
|
1560 case tree_expression::hermitian: |
|
|
1561 op = "'"; |
|
|
1562 break; |
|
|
1563 |
|
|
1564 case tree_expression::transpose: |
|
|
1565 op = ".'"; |
|
|
1566 break; |
|
|
1567 |
|
|
1568 default: |
|
|
1569 op = "<unknown>"; |
|
|
1570 break; |
|
581
|
1571 } |
|
|
1572 return op; |
|
|
1573 } |
|
|
1574 |
|
|
1575 void |
|
|
1576 tree_unary_expression::eval_error (void) |
|
|
1577 { |
|
|
1578 if (error_state > 0) |
|
|
1579 { |
|
|
1580 char *op = oper (); |
|
|
1581 |
|
|
1582 ::error ("evaluating unary operator `%s' near line %d, column %d", |
|
|
1583 op, line (), column ()); |
|
|
1584 } |
|
|
1585 } |
|
|
1586 |
|
|
1587 void |
|
|
1588 tree_unary_expression::print_code (ostream& os) |
|
|
1589 { |
|
|
1590 print_code_indent (os); |
|
|
1591 |
|
|
1592 if (in_parens) |
|
|
1593 os << "("; |
|
|
1594 |
|
|
1595 switch (etype) |
|
|
1596 { |
|
|
1597 case tree_expression::not: |
|
|
1598 case tree_expression::uminus: |
|
|
1599 os << oper (); |
|
|
1600 if (op) |
|
|
1601 op->print_code (os); |
|
|
1602 break; |
|
777
|
1603 |
|
581
|
1604 case tree_expression::hermitian: |
|
|
1605 case tree_expression::transpose: |
|
|
1606 if (op) |
|
|
1607 op->print_code (os); |
|
|
1608 os << oper (); |
|
|
1609 break; |
|
777
|
1610 |
|
581
|
1611 default: |
|
772
|
1612 os << oper (); |
|
|
1613 if (op) |
|
|
1614 op->print_code (os); |
|
581
|
1615 break; |
|
|
1616 } |
|
|
1617 |
|
|
1618 if (in_parens) |
|
|
1619 os << ")"; |
|
|
1620 } |
|
|
1621 |
|
|
1622 // Binary expressions. |
|
|
1623 |
|
|
1624 tree_constant |
|
|
1625 tree_binary_expression::eval (int print) |
|
|
1626 { |
|
|
1627 if (error_state) |
|
|
1628 return tree_constant (); |
|
|
1629 |
|
712
|
1630 tree_constant retval; |
|
|
1631 |
|
581
|
1632 switch (etype) |
|
|
1633 { |
|
|
1634 case tree_expression::add: |
|
|
1635 case tree_expression::subtract: |
|
|
1636 case tree_expression::multiply: |
|
|
1637 case tree_expression::el_mul: |
|
|
1638 case tree_expression::divide: |
|
|
1639 case tree_expression::el_div: |
|
|
1640 case tree_expression::leftdiv: |
|
|
1641 case tree_expression::el_leftdiv: |
|
|
1642 case tree_expression::power: |
|
|
1643 case tree_expression::elem_pow: |
|
|
1644 case tree_expression::cmp_lt: |
|
|
1645 case tree_expression::cmp_le: |
|
|
1646 case tree_expression::cmp_eq: |
|
|
1647 case tree_expression::cmp_ge: |
|
|
1648 case tree_expression::cmp_gt: |
|
|
1649 case tree_expression::cmp_ne: |
|
|
1650 case tree_expression::and: |
|
|
1651 case tree_expression::or: |
|
|
1652 if (op1) |
|
|
1653 { |
|
636
|
1654 tree_constant a = op1->eval (0); |
|
581
|
1655 if (error_state) |
|
|
1656 eval_error (); |
|
|
1657 else if (a.is_defined () && op2) |
|
|
1658 { |
|
636
|
1659 tree_constant b = op2->eval (0); |
|
581
|
1660 if (error_state) |
|
|
1661 eval_error (); |
|
|
1662 else if (b.is_defined ()) |
|
|
1663 { |
|
712
|
1664 retval = do_binary_op (a, b, etype); |
|
581
|
1665 if (error_state) |
|
|
1666 { |
|
712
|
1667 retval = tree_constant (); |
|
581
|
1668 if (error_state) |
|
|
1669 eval_error (); |
|
|
1670 } |
|
|
1671 } |
|
|
1672 } |
|
|
1673 } |
|
|
1674 break; |
|
777
|
1675 |
|
581
|
1676 case tree_expression::and_and: |
|
|
1677 case tree_expression::or_or: |
|
|
1678 { |
|
|
1679 int result = 0; |
|
|
1680 if (op1) |
|
|
1681 { |
|
636
|
1682 tree_constant a = op1->eval (0); |
|
581
|
1683 if (error_state) |
|
|
1684 { |
|
|
1685 eval_error (); |
|
|
1686 break; |
|
|
1687 } |
|
|
1688 |
|
|
1689 int a_true = a.is_true (); |
|
|
1690 if (error_state) |
|
|
1691 { |
|
|
1692 eval_error (); |
|
|
1693 break; |
|
|
1694 } |
|
|
1695 |
|
|
1696 if (a_true) |
|
|
1697 { |
|
|
1698 if (etype == tree_expression::or_or) |
|
|
1699 { |
|
|
1700 result = 1; |
|
|
1701 goto done; |
|
|
1702 } |
|
|
1703 } |
|
|
1704 else |
|
|
1705 { |
|
|
1706 if (etype == tree_expression::and_and) |
|
|
1707 { |
|
|
1708 result = 0; |
|
|
1709 goto done; |
|
|
1710 } |
|
|
1711 } |
|
|
1712 |
|
|
1713 if (op2) |
|
|
1714 { |
|
636
|
1715 tree_constant b = op2->eval (0); |
|
581
|
1716 if (error_state) |
|
|
1717 { |
|
|
1718 eval_error (); |
|
|
1719 break; |
|
|
1720 } |
|
|
1721 |
|
|
1722 result = b.is_true (); |
|
|
1723 if (error_state) |
|
|
1724 { |
|
|
1725 eval_error (); |
|
|
1726 break; |
|
|
1727 } |
|
|
1728 } |
|
|
1729 } |
|
|
1730 done: |
|
712
|
1731 retval = tree_constant ((double) result); |
|
581
|
1732 } |
|
|
1733 break; |
|
777
|
1734 |
|
581
|
1735 default: |
|
|
1736 ::error ("binary operator %d not implemented", etype); |
|
|
1737 break; |
|
|
1738 } |
|
|
1739 |
|
712
|
1740 return retval; |
|
581
|
1741 } |
|
|
1742 |
|
|
1743 char * |
|
|
1744 tree_binary_expression::oper (void) const |
|
|
1745 { |
|
|
1746 static char *op; |
|
|
1747 switch (etype) |
|
|
1748 { |
|
777
|
1749 case tree_expression::add: |
|
|
1750 op = "+"; |
|
|
1751 break; |
|
|
1752 |
|
|
1753 case tree_expression::subtract: |
|
|
1754 op = "-"; |
|
|
1755 break; |
|
|
1756 |
|
|
1757 case tree_expression::multiply: |
|
|
1758 op = "*"; |
|
|
1759 break; |
|
|
1760 |
|
|
1761 case tree_expression::el_mul: |
|
|
1762 op = ".*"; |
|
|
1763 break; |
|
|
1764 |
|
|
1765 case tree_expression::divide: |
|
|
1766 op = "/"; |
|
|
1767 break; |
|
|
1768 |
|
|
1769 case tree_expression::el_div: |
|
|
1770 op = "./"; |
|
|
1771 break; |
|
|
1772 |
|
|
1773 case tree_expression::leftdiv: |
|
|
1774 op = "\\"; |
|
|
1775 break; |
|
|
1776 |
|
|
1777 case tree_expression::el_leftdiv: |
|
|
1778 op = ".\\"; |
|
|
1779 break; |
|
|
1780 |
|
|
1781 case tree_expression::power: |
|
|
1782 op = "^"; |
|
|
1783 break; |
|
|
1784 |
|
|
1785 case tree_expression::elem_pow: |
|
|
1786 op = ".^"; |
|
|
1787 break; |
|
|
1788 |
|
|
1789 case tree_expression::cmp_lt: |
|
|
1790 op = "<"; |
|
|
1791 break; |
|
|
1792 |
|
|
1793 case tree_expression::cmp_le: |
|
|
1794 op = "<="; |
|
|
1795 break; |
|
|
1796 |
|
|
1797 case tree_expression::cmp_eq: |
|
|
1798 op = "=="; |
|
|
1799 break; |
|
|
1800 |
|
|
1801 case tree_expression::cmp_ge: |
|
|
1802 op = ">="; |
|
|
1803 break; |
|
|
1804 |
|
|
1805 case tree_expression::cmp_gt: |
|
|
1806 op = ">"; |
|
|
1807 break; |
|
|
1808 |
|
|
1809 case tree_expression::cmp_ne: |
|
|
1810 op = "!="; |
|
|
1811 break; |
|
|
1812 |
|
|
1813 case tree_expression::and_and: |
|
|
1814 op = "&&"; |
|
|
1815 break; |
|
|
1816 |
|
|
1817 case tree_expression::or_or: |
|
|
1818 op = "||"; |
|
|
1819 break; |
|
|
1820 |
|
|
1821 case tree_expression::and: |
|
|
1822 op = "&"; |
|
|
1823 break; |
|
|
1824 |
|
|
1825 case tree_expression::or: |
|
|
1826 op = "|"; |
|
|
1827 break; |
|
|
1828 |
|
|
1829 default: |
|
|
1830 op = "<unknown>"; |
|
|
1831 break; |
|
581
|
1832 } |
|
|
1833 return op; |
|
|
1834 } |
|
|
1835 |
|
|
1836 void |
|
|
1837 tree_binary_expression::eval_error (void) |
|
|
1838 { |
|
|
1839 if (error_state > 0) |
|
|
1840 { |
|
|
1841 char *op = oper (); |
|
|
1842 |
|
|
1843 ::error ("evaluating binary operator `%s' near line %d, column %d", |
|
|
1844 op, line (), column ()); |
|
|
1845 } |
|
|
1846 } |
|
|
1847 |
|
|
1848 void |
|
|
1849 tree_binary_expression::print_code (ostream& os) |
|
|
1850 { |
|
|
1851 print_code_indent (os); |
|
|
1852 |
|
|
1853 if (in_parens) |
|
|
1854 os << "("; |
|
|
1855 |
|
|
1856 if (op1) |
|
|
1857 op1->print_code (os); |
|
|
1858 |
|
|
1859 os << " " << oper () << " "; |
|
|
1860 |
|
|
1861 if (op2) |
|
|
1862 op2->print_code (os); |
|
|
1863 |
|
|
1864 if (in_parens) |
|
|
1865 os << ")"; |
|
|
1866 } |
|
|
1867 |
|
|
1868 // Simple assignment expressions. |
|
|
1869 |
|
|
1870 tree_simple_assignment_expression::~tree_simple_assignment_expression (void) |
|
|
1871 { |
|
|
1872 if (! preserve) |
|
|
1873 { |
|
|
1874 delete lhs; |
|
|
1875 delete index; |
|
|
1876 } |
|
|
1877 delete rhs; |
|
|
1878 } |
|
|
1879 |
|
|
1880 tree_constant |
|
|
1881 tree_simple_assignment_expression::eval (int print) |
|
|
1882 { |
|
|
1883 assert (etype == tree_expression::assignment); |
|
|
1884 |
|
|
1885 tree_constant retval; |
|
|
1886 |
|
|
1887 if (error_state) |
|
|
1888 return retval; |
|
|
1889 |
|
|
1890 if (rhs) |
|
|
1891 { |
|
636
|
1892 tree_constant rhs_val = rhs->eval (0); |
|
581
|
1893 if (error_state) |
|
|
1894 { |
|
1093
|
1895 eval_error (); |
|
|
1896 } |
|
|
1897 else if (rhs_val.is_undefined ()) |
|
|
1898 { |
|
|
1899 error ("value on right hand side of assignment is undefined"); |
|
|
1900 eval_error (); |
|
581
|
1901 } |
|
|
1902 else if (! index) |
|
|
1903 { |
|
712
|
1904 retval = lhs->assign (rhs_val); |
|
581
|
1905 if (error_state) |
|
|
1906 eval_error (); |
|
|
1907 } |
|
|
1908 else |
|
|
1909 { |
|
|
1910 // Extract the arguments into a simple vector. |
|
712
|
1911 |
|
581
|
1912 Octave_object args = index->convert_to_const_vector (); |
|
|
1913 |
|
|
1914 if (error_state) |
|
|
1915 eval_error (); |
|
922
|
1916 else |
|
581
|
1917 { |
|
922
|
1918 int nargin = args.length (); |
|
|
1919 |
|
581
|
1920 if (error_state) |
|
|
1921 eval_error (); |
|
922
|
1922 else if (nargin > 0) |
|
|
1923 { |
|
|
1924 retval = lhs->assign (rhs_val, args); |
|
|
1925 if (error_state) |
|
|
1926 eval_error (); |
|
|
1927 } |
|
581
|
1928 } |
|
|
1929 } |
|
|
1930 } |
|
|
1931 |
|
1211
|
1932 if (! error_state && print && retval.is_defined ()) |
|
1199
|
1933 print_constant (retval, lhs->name ()); |
|
581
|
1934 |
|
|
1935 return retval; |
|
|
1936 } |
|
|
1937 |
|
|
1938 void |
|
|
1939 tree_simple_assignment_expression::eval_error (void) |
|
|
1940 { |
|
|
1941 if (error_state > 0) |
|
|
1942 { |
|
|
1943 int l = line (); |
|
|
1944 int c = column (); |
|
|
1945 if (l != -1 && c != -1) |
|
|
1946 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
1947 l, c); |
|
|
1948 // else |
|
749
|
1949 // ::error ("evaluating assignment expression"); |
|
581
|
1950 } |
|
|
1951 } |
|
|
1952 |
|
|
1953 void |
|
|
1954 tree_simple_assignment_expression::print_code (ostream& os) |
|
|
1955 { |
|
|
1956 print_code_indent (os); |
|
|
1957 |
|
|
1958 if (in_parens) |
|
|
1959 os << "("; |
|
|
1960 |
|
|
1961 if (! is_ans_assign ()) |
|
|
1962 { |
|
|
1963 if (lhs) |
|
|
1964 lhs->print_code (os); |
|
|
1965 |
|
|
1966 if (index) |
|
|
1967 { |
|
|
1968 os << " ("; |
|
|
1969 index->print_code (os); |
|
|
1970 os << ")"; |
|
|
1971 } |
|
|
1972 |
|
|
1973 os << " = "; |
|
|
1974 } |
|
|
1975 |
|
|
1976 if (rhs) |
|
|
1977 rhs->print_code (os); |
|
|
1978 |
|
|
1979 if (in_parens) |
|
|
1980 os << ")"; |
|
|
1981 } |
|
|
1982 |
|
|
1983 // Multi-valued assignmnt expressions. |
|
|
1984 |
|
|
1985 tree_multi_assignment_expression::~tree_multi_assignment_expression (void) |
|
|
1986 { |
|
|
1987 delete lhs; |
|
|
1988 delete rhs; |
|
|
1989 } |
|
|
1990 |
|
|
1991 tree_constant |
|
|
1992 tree_multi_assignment_expression::eval (int print) |
|
|
1993 { |
|
|
1994 tree_constant retval; |
|
|
1995 |
|
|
1996 if (error_state) |
|
|
1997 return retval; |
|
|
1998 |
|
|
1999 Octave_object tmp_args; |
|
|
2000 Octave_object result = eval (print, 1, tmp_args); |
|
|
2001 |
|
|
2002 if (result.length () > 0) |
|
|
2003 retval = result(0); |
|
|
2004 |
|
|
2005 return retval; |
|
|
2006 } |
|
|
2007 |
|
|
2008 Octave_object |
|
|
2009 tree_multi_assignment_expression::eval (int print, int nargout, |
|
|
2010 const Octave_object& args) |
|
|
2011 { |
|
|
2012 assert (etype == tree_expression::multi_assignment); |
|
|
2013 |
|
|
2014 if (error_state || ! rhs) |
|
|
2015 return Octave_object (); |
|
|
2016 |
|
|
2017 nargout = lhs->length (); |
|
|
2018 Octave_object tmp_args; |
|
|
2019 Octave_object results = rhs->eval (0, nargout, tmp_args); |
|
|
2020 |
|
|
2021 if (error_state) |
|
|
2022 eval_error (); |
|
|
2023 |
|
|
2024 int ma_line = line (); |
|
|
2025 int ma_column = column (); |
|
|
2026 |
|
|
2027 if (results.length () > 0) |
|
|
2028 { |
|
|
2029 int i = 0; |
|
|
2030 int pad_after = 0; |
|
|
2031 int last_was_scalar_type = 0; |
|
|
2032 for (Pix p = lhs->first (); p != 0; lhs->next (p)) |
|
|
2033 { |
|
1155
|
2034 tree_index_expression *lhs_expr = lhs->operator () (p); |
|
581
|
2035 |
|
|
2036 if (i < nargout) |
|
|
2037 { |
|
|
2038 // XXX FIXME? XXX -- this is apparently the way Matlab works, but |
|
|
2039 // maybe we should have the option of skipping the assignment instead. |
|
|
2040 |
|
|
2041 tree_constant *tmp = 0; |
|
|
2042 if (results(i).is_undefined ()) |
|
|
2043 { |
|
1093
|
2044 error ("element number %d undefined in return list", i+1); |
|
|
2045 eval_error (); |
|
|
2046 break; |
|
581
|
2047 } |
|
|
2048 else |
|
|
2049 tmp = new tree_constant (results(i)); |
|
|
2050 |
|
|
2051 tree_simple_assignment_expression tmp_expr |
|
|
2052 (lhs_expr, tmp, 1, 0, ma_line, ma_column); |
|
|
2053 |
|
|
2054 results(i) = tmp_expr.eval (0); // May change |
|
|
2055 |
|
|
2056 if (error_state) |
|
|
2057 break; |
|
|
2058 |
|
|
2059 if (print && pad_after) |
|
|
2060 { |
|
|
2061 ostrstream output_buf; |
|
1199
|
2062 output_buf << "\n" << ends; |
|
581
|
2063 maybe_page_output (output_buf); |
|
|
2064 } |
|
|
2065 |
|
1211
|
2066 if (print) |
|
1199
|
2067 print_constant (results(i), lhs_expr->name (), 0); |
|
581
|
2068 |
|
|
2069 pad_after++; |
|
|
2070 i++; |
|
|
2071 } |
|
|
2072 else |
|
|
2073 { |
|
|
2074 tree_simple_assignment_expression tmp_expr |
|
|
2075 (lhs_expr, 0, 1, 0, ma_line, ma_column); |
|
|
2076 |
|
|
2077 tmp_expr.eval (0); |
|
|
2078 |
|
|
2079 if (error_state) |
|
|
2080 break; |
|
|
2081 |
|
|
2082 if (last_was_scalar_type && i == 1) |
|
|
2083 pad_after = 0; |
|
|
2084 |
|
|
2085 break; |
|
|
2086 } |
|
|
2087 } |
|
|
2088 |
|
|
2089 if (print && pad_after) |
|
|
2090 { |
|
|
2091 ostrstream output_buf; |
|
1199
|
2092 output_buf << "\n" << ends; |
|
581
|
2093 maybe_page_output (output_buf); |
|
|
2094 } |
|
|
2095 } |
|
|
2096 |
|
|
2097 return results; |
|
|
2098 } |
|
|
2099 |
|
|
2100 void |
|
|
2101 tree_multi_assignment_expression::eval_error (void) |
|
|
2102 { |
|
|
2103 if (error_state > 0) |
|
|
2104 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
2105 line (), column ()); |
|
|
2106 } |
|
|
2107 |
|
|
2108 void |
|
|
2109 tree_multi_assignment_expression::print_code (ostream& os) |
|
|
2110 { |
|
|
2111 print_code_indent (os); |
|
|
2112 |
|
|
2113 if (in_parens) |
|
|
2114 os << "("; |
|
|
2115 |
|
|
2116 if (lhs) |
|
|
2117 { |
|
|
2118 int len = lhs->length (); |
|
|
2119 |
|
|
2120 if (len > 1) |
|
|
2121 os << "["; |
|
|
2122 |
|
|
2123 lhs->print_code (os); |
|
|
2124 |
|
|
2125 if (len > 1) |
|
|
2126 os << "]"; |
|
|
2127 } |
|
|
2128 |
|
|
2129 os << " = "; |
|
|
2130 |
|
|
2131 if (rhs) |
|
|
2132 rhs->print_code (os); |
|
|
2133 |
|
|
2134 if (in_parens) |
|
|
2135 os << ")"; |
|
|
2136 } |
|
|
2137 |
|
|
2138 // Colon expressions. |
|
|
2139 |
|
|
2140 tree_colon_expression * |
|
|
2141 tree_colon_expression::chain (tree_expression *t) |
|
|
2142 { |
|
|
2143 tree_colon_expression *retval = 0; |
|
|
2144 if (! op1 || op3) |
|
|
2145 ::error ("invalid colon expression"); |
|
|
2146 else |
|
|
2147 { |
|
|
2148 op3 = op2; // Stupid syntax. |
|
|
2149 op2 = t; |
|
|
2150 |
|
|
2151 retval = this; |
|
|
2152 } |
|
|
2153 return retval; |
|
|
2154 } |
|
|
2155 |
|
|
2156 tree_constant |
|
|
2157 tree_colon_expression::eval (int print) |
|
|
2158 { |
|
|
2159 tree_constant retval; |
|
|
2160 |
|
|
2161 if (error_state || ! op1 || ! op2) |
|
|
2162 return retval; |
|
|
2163 |
|
636
|
2164 tree_constant tmp = op1->eval (0); |
|
581
|
2165 |
|
|
2166 if (tmp.is_undefined ()) |
|
|
2167 { |
|
|
2168 eval_error ("invalid null value in colon expression"); |
|
|
2169 return retval; |
|
|
2170 } |
|
|
2171 |
|
636
|
2172 double base = tmp.double_value (); |
|
|
2173 |
|
|
2174 if (error_state) |
|
581
|
2175 { |
|
1055
|
2176 error ("colon expression elements must be scalars"); |
|
636
|
2177 eval_error ("evaluating colon expression"); |
|
581
|
2178 return retval; |
|
|
2179 } |
|
636
|
2180 |
|
|
2181 tmp = op2->eval (0); |
|
581
|
2182 |
|
|
2183 if (tmp.is_undefined ()) |
|
|
2184 { |
|
|
2185 eval_error ("invalid null value in colon expression"); |
|
|
2186 return retval; |
|
|
2187 } |
|
|
2188 |
|
636
|
2189 double limit = tmp.double_value (); |
|
|
2190 |
|
|
2191 if (error_state) |
|
581
|
2192 { |
|
1055
|
2193 error ("colon expression elements must be scalars"); |
|
636
|
2194 eval_error ("evaluating colon expression"); |
|
581
|
2195 return retval; |
|
|
2196 } |
|
|
2197 |
|
|
2198 double inc = 1.0; |
|
|
2199 if (op3) |
|
|
2200 { |
|
636
|
2201 tmp = op3->eval (0); |
|
581
|
2202 |
|
|
2203 if (tmp.is_undefined ()) |
|
|
2204 { |
|
|
2205 eval_error ("invalid null value in colon expression"); |
|
|
2206 return retval; |
|
|
2207 } |
|
|
2208 |
|
636
|
2209 inc = tmp.double_value (); |
|
|
2210 |
|
|
2211 if (error_state) |
|
581
|
2212 { |
|
1055
|
2213 error ("colon expression elements must be scalars"); |
|
636
|
2214 eval_error ("evaluating colon expression"); |
|
581
|
2215 return retval; |
|
|
2216 } |
|
|
2217 } |
|
|
2218 |
|
|
2219 retval = tree_constant (base, limit, inc); |
|
|
2220 |
|
|
2221 if (error_state) |
|
|
2222 { |
|
|
2223 if (error_state) |
|
|
2224 eval_error ("evaluating colon expression"); |
|
|
2225 return tree_constant (); |
|
|
2226 } |
|
|
2227 |
|
|
2228 return retval; |
|
|
2229 } |
|
|
2230 |
|
|
2231 void |
|
|
2232 tree_colon_expression::eval_error (const char *s) |
|
|
2233 { |
|
|
2234 if (error_state > 0) |
|
|
2235 ::error ("%s near line %d column %d", s, line (), column ()); |
|
|
2236 } |
|
|
2237 |
|
|
2238 void |
|
|
2239 tree_colon_expression::print_code (ostream& os) |
|
|
2240 { |
|
|
2241 print_code_indent (os); |
|
|
2242 |
|
|
2243 if (in_parens) |
|
|
2244 os << "("; |
|
|
2245 |
|
|
2246 if (op1) |
|
|
2247 op1->print_code (os); |
|
|
2248 |
|
|
2249 // Stupid syntax. |
|
|
2250 |
|
|
2251 if (op3) |
|
|
2252 { |
|
|
2253 os << ":"; |
|
|
2254 op3->print_code (os); |
|
|
2255 } |
|
|
2256 |
|
|
2257 if (op2) |
|
|
2258 { |
|
|
2259 os << ":"; |
|
|
2260 op2->print_code (os); |
|
|
2261 } |
|
|
2262 |
|
|
2263 if (in_parens) |
|
|
2264 os << ")"; |
|
|
2265 } |
|
|
2266 |
|
|
2267 // Builtin functions. |
|
|
2268 |
|
|
2269 tree_builtin::tree_builtin (const char *nm) |
|
|
2270 { |
|
|
2271 nargin_max = -1; |
|
|
2272 nargout_max = -1; |
|
|
2273 is_mapper = 0; |
|
|
2274 fcn = 0; |
|
|
2275 if (nm) |
|
|
2276 my_name = strsave (nm); |
|
|
2277 } |
|
|
2278 |
|
|
2279 tree_builtin::tree_builtin (int i_max, int o_max, Mapper_fcn& m_fcn, |
|
|
2280 const char *nm) |
|
|
2281 { |
|
|
2282 nargin_max = i_max; |
|
|
2283 nargout_max = o_max; |
|
|
2284 mapper_fcn = m_fcn; |
|
|
2285 is_mapper = 1; |
|
|
2286 fcn = 0; |
|
704
|
2287 my_name = nm ? strsave (nm) : 0; |
|
581
|
2288 } |
|
|
2289 |
|
|
2290 tree_builtin::tree_builtin (int i_max, int o_max, Octave_builtin_fcn g_fcn, |
|
|
2291 const char *nm) |
|
|
2292 { |
|
|
2293 nargin_max = i_max; |
|
|
2294 nargout_max = o_max; |
|
|
2295 is_mapper = 0; |
|
|
2296 fcn = g_fcn; |
|
704
|
2297 my_name = nm ? strsave (nm) : 0; |
|
581
|
2298 } |
|
|
2299 |
|
|
2300 tree_constant |
|
|
2301 tree_builtin::eval (int print) |
|
|
2302 { |
|
|
2303 tree_constant retval; |
|
|
2304 |
|
|
2305 if (error_state) |
|
|
2306 return retval; |
|
|
2307 |
|
|
2308 if (fcn) |
|
|
2309 { |
|
704
|
2310 eval_fcn: |
|
|
2311 |
|
581
|
2312 Octave_object args; |
|
1029
|
2313 Octave_object tmp = (*fcn) (args, 0); |
|
581
|
2314 if (tmp.length () > 0) |
|
|
2315 retval = tmp(0); |
|
|
2316 } |
|
704
|
2317 else |
|
|
2318 { |
|
|
2319 fcn = load_octave_builtin (my_name); |
|
|
2320 |
|
|
2321 if (fcn) |
|
|
2322 goto eval_fcn; |
|
|
2323 else |
|
749
|
2324 ::error ("unable to load builtin function %s", my_name); |
|
704
|
2325 } |
|
581
|
2326 |
|
|
2327 return retval; |
|
|
2328 } |
|
|
2329 |
|
767
|
2330 static tree_constant |
|
|
2331 apply_mapper_fcn (const tree_constant& arg, Mapper_fcn& m_fcn, int print) |
|
|
2332 { |
|
|
2333 tree_constant retval; |
|
|
2334 |
|
|
2335 if (arg.is_real_type ()) |
|
|
2336 { |
|
|
2337 if (arg.is_scalar_type ()) |
|
|
2338 { |
|
|
2339 double d = arg.double_value (); |
|
|
2340 |
|
|
2341 if (m_fcn.can_return_complex_for_real_arg |
|
|
2342 && (d < m_fcn.lower_limit || d > m_fcn.upper_limit)) |
|
|
2343 { |
|
|
2344 if (m_fcn.c_c_mapper) |
|
|
2345 retval = m_fcn.c_c_mapper (Complex (d)); |
|
|
2346 else |
|
|
2347 error ("%s: unable to handle real arguments", m_fcn.name); |
|
|
2348 } |
|
|
2349 else if (m_fcn.d_d_mapper) |
|
|
2350 retval = m_fcn.d_d_mapper (d); |
|
|
2351 else |
|
|
2352 error ("%s: unable to handle real arguments", m_fcn.name); |
|
|
2353 } |
|
788
|
2354 else |
|
767
|
2355 { |
|
|
2356 Matrix m = arg.matrix_value (); |
|
|
2357 |
|
788
|
2358 if (error_state) |
|
|
2359 return retval; |
|
|
2360 |
|
767
|
2361 if (m_fcn.can_return_complex_for_real_arg |
|
|
2362 && (any_element_less_than (m, m_fcn.lower_limit) |
|
|
2363 || any_element_greater_than (m, m_fcn.upper_limit))) |
|
|
2364 { |
|
|
2365 if (m_fcn.c_c_mapper) |
|
|
2366 retval = map (m_fcn.c_c_mapper, ComplexMatrix (m)); |
|
|
2367 else |
|
|
2368 error ("%s: unable to handle real arguments", m_fcn.name); |
|
|
2369 } |
|
|
2370 else if (m_fcn.d_d_mapper) |
|
|
2371 retval = map (m_fcn.d_d_mapper, m); |
|
|
2372 else |
|
|
2373 error ("%s: unable to handle real arguments", m_fcn.name); |
|
|
2374 } |
|
|
2375 } |
|
|
2376 else if (arg.is_complex_type ()) |
|
|
2377 { |
|
|
2378 if (arg.is_scalar_type ()) |
|
|
2379 { |
|
|
2380 Complex c = arg.complex_value (); |
|
|
2381 |
|
|
2382 if (m_fcn.d_c_mapper) |
|
|
2383 retval = m_fcn.d_c_mapper (c); |
|
|
2384 else if (m_fcn.c_c_mapper) |
|
|
2385 retval = m_fcn.c_c_mapper (c); |
|
|
2386 else |
|
|
2387 error ("%s: unable to handle complex arguments", m_fcn.name); |
|
|
2388 } |
|
788
|
2389 else |
|
767
|
2390 { |
|
|
2391 ComplexMatrix cm = arg.complex_matrix_value (); |
|
|
2392 |
|
788
|
2393 if (error_state) |
|
|
2394 return retval; |
|
|
2395 |
|
767
|
2396 if (m_fcn.d_c_mapper) |
|
|
2397 retval = map (m_fcn.d_c_mapper, cm); |
|
|
2398 else if (m_fcn.c_c_mapper) |
|
|
2399 retval = map (m_fcn.c_c_mapper, cm); |
|
|
2400 else |
|
|
2401 error ("%s: unable to handle complex arguments", m_fcn.name); |
|
|
2402 } |
|
|
2403 } |
|
|
2404 else |
|
|
2405 gripe_wrong_type_arg ("mapper", arg); |
|
|
2406 |
|
|
2407 return retval; |
|
|
2408 } |
|
|
2409 |
|
581
|
2410 Octave_object |
|
|
2411 tree_builtin::eval (int print, int nargout, const Octave_object& args) |
|
|
2412 { |
|
|
2413 Octave_object retval; |
|
|
2414 |
|
|
2415 if (error_state) |
|
|
2416 return retval; |
|
|
2417 |
|
|
2418 int nargin = args.length (); |
|
|
2419 |
|
|
2420 if (fcn) |
|
|
2421 { |
|
704
|
2422 eval_fcn: |
|
|
2423 |
|
581
|
2424 if (any_arg_is_magic_colon (args)) |
|
|
2425 ::error ("invalid use of colon in function argument list"); |
|
|
2426 else |
|
|
2427 retval = (*fcn) (args, nargout); |
|
|
2428 } |
|
|
2429 else if (is_mapper) |
|
|
2430 { |
|
|
2431 if (nargin > nargin_max) |
|
|
2432 ::error ("%s: too many arguments", my_name); |
|
712
|
2433 else if (nargin > 0 && args(0).is_defined ()) |
|
581
|
2434 { |
|
767
|
2435 tree_constant tmp = apply_mapper_fcn (args(0), mapper_fcn, 0); |
|
581
|
2436 retval(0) = tmp; |
|
|
2437 } |
|
|
2438 } |
|
|
2439 else |
|
704
|
2440 { |
|
|
2441 fcn = load_octave_builtin (my_name); |
|
|
2442 |
|
|
2443 if (fcn) |
|
|
2444 goto eval_fcn; |
|
|
2445 else |
|
749
|
2446 ::error ("unable to load builtin function %s", my_name); |
|
704
|
2447 } |
|
581
|
2448 |
|
|
2449 return retval; |
|
|
2450 } |
|
|
2451 |
|
|
2452 int |
|
|
2453 tree_builtin::max_expected_args (void) |
|
|
2454 { |
|
|
2455 int ea = nargin_max; |
|
|
2456 if (nargin_max < 0) |
|
|
2457 ea = INT_MAX; |
|
|
2458 else |
|
|
2459 ea = nargin_max; |
|
|
2460 return ea; |
|
|
2461 } |
|
|
2462 |
|
578
|
2463 // User defined functions. |
|
494
|
2464 |
|
1161
|
2465 void |
|
|
2466 tree_function::install_nargin_and_nargout (void) |
|
|
2467 { |
|
|
2468 nargin_sr = sym_tab->lookup ("nargin", 1, 0); |
|
|
2469 nargout_sr = sym_tab->lookup ("nargout", 1, 0); |
|
|
2470 } |
|
|
2471 |
|
|
2472 void |
|
|
2473 tree_function::bind_nargin_and_nargout (int nargin, int nargout) |
|
|
2474 { |
|
|
2475 tree_constant *tmp; |
|
|
2476 |
|
|
2477 tmp = new tree_constant (nargin); |
|
|
2478 nargin_sr->define (tmp); |
|
|
2479 |
|
|
2480 tmp = new tree_constant (nargout); |
|
|
2481 nargout_sr->define (tmp); |
|
|
2482 } |
|
|
2483 |
|
578
|
2484 #if 0 |
|
494
|
2485 tree_function * |
|
578
|
2486 tree_function::define (tree statement_list *t) |
|
494
|
2487 { |
|
|
2488 cmd_list = t; |
|
|
2489 return this; |
|
|
2490 } |
|
578
|
2491 #endif |
|
494
|
2492 |
|
|
2493 tree_function * |
|
|
2494 tree_function::define_param_list (tree_parameter_list *t) |
|
|
2495 { |
|
|
2496 param_list = t; |
|
508
|
2497 |
|
529
|
2498 if (param_list) |
|
508
|
2499 { |
|
767
|
2500 num_named_args = param_list->length (); |
|
508
|
2501 curr_va_arg_number = num_named_args; |
|
|
2502 } |
|
494
|
2503 |
|
|
2504 return this; |
|
|
2505 } |
|
|
2506 |
|
|
2507 tree_function * |
|
|
2508 tree_function::define_ret_list (tree_parameter_list *t) |
|
|
2509 { |
|
|
2510 ret_list = t; |
|
723
|
2511 |
|
|
2512 if (ret_list && ret_list->takes_varargs ()) |
|
|
2513 vr_list = new tree_va_return_list; |
|
|
2514 |
|
494
|
2515 return this; |
|
|
2516 } |
|
|
2517 |
|
|
2518 void |
|
905
|
2519 tree_function::stash_fcn_file_name (void) |
|
494
|
2520 { |
|
|
2521 delete [] file_name; |
|
907
|
2522 file_name = fcn_name ? fcn_file_in_path (fcn_name) : 0; |
|
494
|
2523 } |
|
|
2524 |
|
|
2525 void |
|
|
2526 tree_function::mark_as_system_fcn_file (void) |
|
|
2527 { |
|
529
|
2528 if (file_name) |
|
494
|
2529 { |
|
|
2530 // We really should stash the whole path to the file we found, when we |
|
|
2531 // looked it up, to avoid possible race conditions... XXX FIXME XXX |
|
|
2532 // |
|
|
2533 // We probably also don't need to get the library directory every |
|
|
2534 // time, but since this function is only called when the function file |
|
|
2535 // is parsed, it probably doesn't matter that much. |
|
|
2536 |
|
|
2537 char *oct_lib = octave_lib_dir (); |
|
|
2538 int len = strlen (oct_lib); |
|
|
2539 |
|
|
2540 char *ff_name = fcn_file_in_path (file_name); |
|
|
2541 |
|
|
2542 if (strncmp (oct_lib, ff_name, len) == 0) |
|
|
2543 system_fcn_file = 1; |
|
|
2544 |
|
|
2545 delete [] ff_name; |
|
|
2546 } |
|
|
2547 else |
|
|
2548 system_fcn_file = 0; |
|
|
2549 } |
|
|
2550 |
|
|
2551 int |
|
|
2552 tree_function::takes_varargs (void) const |
|
|
2553 { |
|
529
|
2554 return (param_list && param_list->takes_varargs ()); |
|
494
|
2555 } |
|
|
2556 |
|
|
2557 tree_constant |
|
|
2558 tree_function::octave_va_arg (void) |
|
|
2559 { |
|
|
2560 tree_constant retval; |
|
|
2561 |
|
508
|
2562 if (curr_va_arg_number < num_args_passed) |
|
767
|
2563 retval = args_passed (curr_va_arg_number++); |
|
494
|
2564 else |
|
767
|
2565 ::error ("va_arg: error getting arg number %d -- only %d provided", |
|
|
2566 curr_va_arg_number + 1, num_args_passed); |
|
494
|
2567 |
|
|
2568 return retval; |
|
|
2569 } |
|
|
2570 |
|
922
|
2571 Octave_object |
|
|
2572 tree_function::octave_all_va_args (void) |
|
|
2573 { |
|
|
2574 Octave_object retval; |
|
|
2575 |
|
|
2576 retval.resize (num_args_passed - num_named_args); |
|
|
2577 |
|
|
2578 int k = 0; |
|
|
2579 for (int i = num_named_args; i < num_args_passed; i++) |
|
|
2580 retval(k++) = args_passed(i); |
|
|
2581 |
|
|
2582 return retval; |
|
|
2583 } |
|
|
2584 |
|
723
|
2585 int |
|
|
2586 tree_function::takes_var_return (void) const |
|
|
2587 { |
|
|
2588 return (ret_list && ret_list->takes_varargs ()); |
|
|
2589 } |
|
|
2590 |
|
|
2591 void |
|
|
2592 tree_function::octave_vr_val (const tree_constant& val) |
|
|
2593 { |
|
|
2594 assert (vr_list); |
|
|
2595 |
|
|
2596 vr_list->append (val); |
|
|
2597 } |
|
|
2598 |
|
494
|
2599 void |
|
|
2600 tree_function::stash_function_name (char *s) |
|
|
2601 { |
|
|
2602 delete [] fcn_name; |
|
|
2603 fcn_name = strsave (s); |
|
|
2604 } |
|
|
2605 |
|
|
2606 tree_constant |
|
|
2607 tree_function::eval (int print) |
|
|
2608 { |
|
|
2609 tree_constant retval; |
|
|
2610 |
|
529
|
2611 if (error_state || ! cmd_list) |
|
494
|
2612 return retval; |
|
|
2613 |
|
565
|
2614 Octave_object tmp_args; |
|
1031
|
2615 Octave_object tmp = eval (print, 0, tmp_args); |
|
500
|
2616 |
|
|
2617 if (! error_state && tmp.length () > 0) |
|
|
2618 retval = tmp(0); |
|
494
|
2619 |
|
|
2620 return retval; |
|
|
2621 } |
|
|
2622 |
|
|
2623 // For unwind protect. |
|
|
2624 |
|
|
2625 static void |
|
|
2626 pop_symbol_table_context (void *table) |
|
|
2627 { |
|
|
2628 symbol_table *tmp = (symbol_table *) table; |
|
|
2629 tmp->pop_context (); |
|
|
2630 } |
|
|
2631 |
|
|
2632 static void |
|
723
|
2633 delete_vr_list (void *list) |
|
|
2634 { |
|
|
2635 tree_va_return_list *tmp = (tree_va_return_list *) list; |
|
|
2636 tmp->clear (); |
|
|
2637 delete tmp; |
|
|
2638 } |
|
|
2639 |
|
|
2640 static void |
|
494
|
2641 clear_symbol_table (void *table) |
|
|
2642 { |
|
|
2643 symbol_table *tmp = (symbol_table *) table; |
|
|
2644 tmp->clear (); |
|
|
2645 } |
|
|
2646 |
|
500
|
2647 Octave_object |
|
506
|
2648 tree_function::eval (int print, int nargout, const Octave_object& args) |
|
494
|
2649 { |
|
500
|
2650 Octave_object retval; |
|
494
|
2651 |
|
|
2652 if (error_state) |
|
|
2653 return retval; |
|
|
2654 |
|
529
|
2655 if (! cmd_list) |
|
494
|
2656 return retval; |
|
|
2657 |
|
506
|
2658 int nargin = args.length (); |
|
|
2659 |
|
494
|
2660 begin_unwind_frame ("func_eval"); |
|
|
2661 |
|
|
2662 unwind_protect_int (call_depth); |
|
|
2663 call_depth++; |
|
|
2664 |
|
|
2665 if (call_depth > 1) |
|
|
2666 { |
|
|
2667 sym_tab->push_context (); |
|
|
2668 add_unwind_protect (pop_symbol_table_context, (void *) sym_tab); |
|
723
|
2669 |
|
|
2670 if (vr_list) |
|
|
2671 { |
|
|
2672 // Push new vr_list. |
|
|
2673 unwind_protect_ptr (vr_list); |
|
|
2674 vr_list = new tree_va_return_list; |
|
|
2675 |
|
|
2676 // Clear and delete the new one before restoring the old one. |
|
|
2677 add_unwind_protect (delete_vr_list, (void *) vr_list); |
|
|
2678 } |
|
494
|
2679 } |
|
|
2680 |
|
723
|
2681 if (vr_list) |
|
|
2682 vr_list->clear (); |
|
|
2683 |
|
494
|
2684 // Force symbols to be undefined again when this function exits. |
|
|
2685 |
|
|
2686 add_unwind_protect (clear_symbol_table, (void *) sym_tab); |
|
|
2687 |
|
|
2688 // Save old and set current symbol table context, for eval_undefined_error(). |
|
|
2689 |
|
|
2690 unwind_protect_ptr (curr_sym_tab); |
|
|
2691 curr_sym_tab = sym_tab; |
|
|
2692 |
|
|
2693 unwind_protect_ptr (curr_function); |
|
|
2694 curr_function = this; |
|
|
2695 |
|
500
|
2696 // unwind_protect_ptr (args_passed); |
|
494
|
2697 args_passed = args; |
|
|
2698 |
|
|
2699 unwind_protect_int (num_args_passed); |
|
|
2700 num_args_passed = nargin; |
|
|
2701 |
|
|
2702 unwind_protect_int (num_named_args); |
|
508
|
2703 unwind_protect_int (curr_va_arg_number); |
|
494
|
2704 |
|
529
|
2705 if (param_list && ! param_list->varargs_only ()) |
|
494
|
2706 { |
|
506
|
2707 param_list->define_from_arg_vector (args); |
|
494
|
2708 if (error_state) |
|
|
2709 goto abort; |
|
|
2710 } |
|
|
2711 |
|
|
2712 // The following code is in a separate scope to avoid warnings from |
|
|
2713 // G++ about `goto abort' crossing the initialization of some |
|
|
2714 // variables. |
|
|
2715 |
|
|
2716 { |
|
1161
|
2717 bind_nargin_and_nargout (nargin, nargout); |
|
494
|
2718 |
|
|
2719 // Evaluate the commands that make up the function. Always turn on |
|
|
2720 // printing for commands inside functions. Maybe this should be |
|
|
2721 // toggled by a user-leval variable? |
|
|
2722 |
|
|
2723 int pf = ! user_pref.silent_functions; |
|
|
2724 tree_constant last_computed_value = cmd_list->eval (pf); |
|
|
2725 |
|
|
2726 if (returning) |
|
|
2727 returning = 0; |
|
|
2728 |
|
1060
|
2729 if (breaking) |
|
|
2730 breaking--; |
|
|
2731 |
|
494
|
2732 if (error_state) |
|
|
2733 { |
|
|
2734 traceback_error (); |
|
|
2735 goto abort; |
|
|
2736 } |
|
|
2737 |
|
|
2738 // Copy return values out. |
|
|
2739 |
|
529
|
2740 if (ret_list) |
|
1093
|
2741 { |
|
|
2742 if (nargout > 0 && user_pref.define_all_return_values) |
|
|
2743 { |
|
|
2744 tree_constant tmp = builtin_any_variable ("default_return_value"); |
|
|
2745 if (tmp.is_defined ()) |
|
|
2746 ret_list->initialize_undefined_elements (tmp); |
|
|
2747 } |
|
|
2748 |
|
|
2749 retval = ret_list->convert_to_const_vector (vr_list); |
|
|
2750 } |
|
494
|
2751 else if (user_pref.return_last_computed_value) |
|
712
|
2752 retval(0) = last_computed_value; |
|
494
|
2753 } |
|
|
2754 |
|
|
2755 abort: |
|
|
2756 run_unwind_frame ("func_eval"); |
|
|
2757 |
|
|
2758 return retval; |
|
|
2759 } |
|
|
2760 |
|
|
2761 int |
|
|
2762 tree_function::max_expected_args (void) |
|
|
2763 { |
|
529
|
2764 if (param_list) |
|
494
|
2765 { |
|
|
2766 if (param_list->takes_varargs ()) |
|
|
2767 return -1; |
|
|
2768 else |
|
723
|
2769 return param_list->length (); |
|
494
|
2770 } |
|
|
2771 else |
|
|
2772 return 1; |
|
|
2773 } |
|
|
2774 |
|
|
2775 void |
|
|
2776 tree_function::traceback_error (void) |
|
|
2777 { |
|
|
2778 if (error_state >= 0) |
|
|
2779 error_state = -1; |
|
|
2780 |
|
529
|
2781 if (fcn_name) |
|
494
|
2782 { |
|
529
|
2783 if (file_name) |
|
494
|
2784 ::error ("called from `%s' in file `%s'", fcn_name, file_name); |
|
|
2785 else |
|
|
2786 ::error ("called from `%s'", fcn_name); |
|
|
2787 } |
|
|
2788 else |
|
|
2789 { |
|
529
|
2790 if (file_name) |
|
494
|
2791 ::error ("called from file `%s'", file_name); |
|
|
2792 else |
|
|
2793 ::error ("called from `?unknown?'"); |
|
|
2794 } |
|
|
2795 } |
|
|
2796 |
|
581
|
2797 void |
|
|
2798 tree_function::print_code (ostream& os) |
|
|
2799 { |
|
|
2800 print_code_reset (); |
|
|
2801 |
|
|
2802 print_code_indent (os); |
|
|
2803 |
|
|
2804 os << "function "; |
|
|
2805 |
|
|
2806 if (ret_list) |
|
|
2807 { |
|
|
2808 int len = ret_list->length (); |
|
|
2809 |
|
|
2810 if (len > 1) |
|
|
2811 os << "["; |
|
|
2812 |
|
|
2813 ret_list->print_code (os); |
|
|
2814 |
|
|
2815 if (len > 1) |
|
|
2816 os << "]"; |
|
|
2817 |
|
|
2818 os << " = "; |
|
|
2819 } |
|
|
2820 |
|
|
2821 os << (fcn_name ? fcn_name : "(null)") << " "; |
|
|
2822 |
|
|
2823 if (param_list) |
|
|
2824 { |
|
|
2825 int len = param_list->length (); |
|
|
2826 if (len > 0) |
|
|
2827 os << "("; |
|
|
2828 |
|
|
2829 param_list->print_code (os); |
|
|
2830 |
|
|
2831 if (len > 0) |
|
|
2832 { |
|
|
2833 os << ")"; |
|
|
2834 print_code_new_line (os); |
|
|
2835 } |
|
|
2836 } |
|
|
2837 else |
|
|
2838 { |
|
|
2839 os << "()"; |
|
|
2840 print_code_new_line (os); |
|
|
2841 } |
|
|
2842 |
|
|
2843 if (cmd_list) |
|
|
2844 { |
|
|
2845 increment_indent_level (); |
|
|
2846 cmd_list->print_code (os); |
|
|
2847 } |
|
|
2848 |
|
|
2849 os << "endfunction"; |
|
|
2850 |
|
|
2851 print_code_new_line (os); |
|
|
2852 } |
|
|
2853 |
|
712
|
2854 DEFUN ("va_arg", Fva_arg, Sva_arg, 0, 1, |
|
529
|
2855 "va_arg (): return next argument in a function that takes a\n\ |
|
581
|
2856 variable number of parameters") |
|
529
|
2857 { |
|
|
2858 Octave_object retval; |
|
|
2859 |
|
|
2860 int nargin = args.length (); |
|
|
2861 |
|
712
|
2862 if (nargin == 0) |
|
529
|
2863 { |
|
|
2864 if (curr_function) |
|
|
2865 { |
|
|
2866 if (curr_function->takes_varargs ()) |
|
|
2867 retval = curr_function->octave_va_arg (); |
|
|
2868 else |
|
|
2869 { |
|
749
|
2870 ::error ("va_arg only valid within function taking variable"); |
|
|
2871 ::error ("number of arguments"); |
|
529
|
2872 } |
|
|
2873 } |
|
|
2874 else |
|
749
|
2875 ::error ("va_arg only valid within function body"); |
|
529
|
2876 } |
|
|
2877 else |
|
|
2878 print_usage ("va_arg"); |
|
|
2879 |
|
|
2880 return retval; |
|
|
2881 } |
|
|
2882 |
|
712
|
2883 DEFUN ("va_start", Fva_start, Sva_start, 0, 0, |
|
529
|
2884 "va_start (): reset the pointer to the list of optional arguments\n\ |
|
|
2885 to the beginning") |
|
|
2886 { |
|
|
2887 Octave_object retval; |
|
|
2888 |
|
|
2889 int nargin = args.length (); |
|
|
2890 |
|
712
|
2891 if (nargin == 0) |
|
529
|
2892 { |
|
|
2893 if (curr_function) |
|
|
2894 { |
|
|
2895 if (curr_function->takes_varargs ()) |
|
|
2896 curr_function->octave_va_start (); |
|
|
2897 else |
|
|
2898 { |
|
749
|
2899 ::error ("va_start only valid within function taking variable"); |
|
|
2900 ::error ("number of arguments"); |
|
529
|
2901 } |
|
|
2902 } |
|
|
2903 else |
|
749
|
2904 ::error ("va_start only valid within function body"); |
|
529
|
2905 } |
|
|
2906 else |
|
|
2907 print_usage ("va_start"); |
|
|
2908 |
|
|
2909 return retval; |
|
|
2910 } |
|
|
2911 |
|
723
|
2912 DEFUN ("vr_val", Fvr_val, Svr_val, 1, 0, |
|
|
2913 "vr_val (X): append X to the list of optional return values for a |
|
|
2914 function that allows a variable number of return values") |
|
|
2915 { |
|
|
2916 Octave_object retval; |
|
|
2917 |
|
|
2918 int nargin = args.length (); |
|
|
2919 |
|
|
2920 if (nargin == 1) |
|
|
2921 { |
|
|
2922 if (curr_function) |
|
|
2923 { |
|
|
2924 if (curr_function->takes_var_return ()) |
|
|
2925 curr_function->octave_vr_val (args(0)); |
|
|
2926 else |
|
|
2927 { |
|
749
|
2928 ::error ("vr_val only valid within function declared to"); |
|
|
2929 ::error ("produce a variable number of values"); |
|
723
|
2930 } |
|
|
2931 } |
|
|
2932 else |
|
749
|
2933 ::error ("vr_val only valid within function body"); |
|
723
|
2934 } |
|
|
2935 else |
|
|
2936 print_usage ("vr_val"); |
|
|
2937 |
|
|
2938 return retval; |
|
|
2939 } |
|
|
2940 |
|
494
|
2941 /* |
|
|
2942 ;;; Local Variables: *** |
|
|
2943 ;;; mode: C++ *** |
|
|
2944 ;;; page-delimiter: "^/\\*" *** |
|
|
2945 ;;; End: *** |
|
|
2946 */ |
