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