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