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