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