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