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