|
2980
|
1 /* |
|
|
2 |
|
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
2980
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
3933
|
28 #include "Cell.h" |
|
2980
|
29 #include "error.h" |
|
3930
|
30 #include "oct-map.h" |
|
2980
|
31 #include "oct-obj.h" |
|
|
32 #include "oct-lvalue.h" |
|
|
33 #include "ov.h" |
|
3930
|
34 #include "pager.h" |
|
2982
|
35 #include "pt-arg-list.h" |
|
3930
|
36 #include "pt-bp.h" |
|
2980
|
37 #include "pt-idx.h" |
|
|
38 #include "pt-walk.h" |
|
3930
|
39 #include "utils.h" |
|
|
40 #include "variables.h" |
|
2980
|
41 |
|
|
42 // Index expressions. |
|
|
43 |
|
3546
|
44 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
45 tree_argument_list *lst, |
|
3933
|
46 int l, int c, char t) |
|
4131
|
47 : tree_expression (l, c), expr (e), args (), type (), |
|
|
48 arg_nm (), dyn_field () |
|
3933
|
49 { |
|
|
50 append (lst, t); |
|
|
51 } |
|
3215
|
52 |
|
3930
|
53 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
54 const std::string& n, |
|
3944
|
55 int l, int c) |
|
4131
|
56 : tree_expression (l, c), expr (e), args (), type (), |
|
|
57 arg_nm (), dyn_field () |
|
3933
|
58 { |
|
|
59 append (n); |
|
|
60 } |
|
|
61 |
|
4131
|
62 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
63 tree_expression *df, |
|
|
64 int l, int c) |
|
|
65 : tree_expression (l, c), expr (e), args (), type (), |
|
|
66 arg_nm (), dyn_field () |
|
|
67 { |
|
|
68 append (df); |
|
|
69 } |
|
|
70 |
|
3933
|
71 void |
|
|
72 tree_index_expression::append (tree_argument_list *lst, char t) |
|
|
73 { |
|
4219
|
74 args.push_back (lst); |
|
3933
|
75 type.append (1, t); |
|
4219
|
76 arg_nm.push_back (lst ? lst->get_arg_names () : string_vector ()); |
|
|
77 dyn_field.push_back (static_cast<tree_expression *> (0)); |
|
3933
|
78 } |
|
|
79 |
|
|
80 void |
|
|
81 tree_index_expression::append (const std::string& n) |
|
|
82 { |
|
4219
|
83 args.push_back (static_cast<tree_argument_list *> (0)); |
|
3933
|
84 type.append ("."); |
|
4219
|
85 arg_nm.push_back (n); |
|
|
86 dyn_field.push_back (static_cast<tree_expression *> (0)); |
|
4131
|
87 } |
|
|
88 |
|
|
89 void |
|
|
90 tree_index_expression::append (tree_expression *df) |
|
|
91 { |
|
4219
|
92 args.push_back (static_cast<tree_argument_list *> (0)); |
|
4131
|
93 type.append ("."); |
|
4219
|
94 arg_nm.push_back (""); |
|
|
95 dyn_field.push_back (df); |
|
3933
|
96 } |
|
3930
|
97 |
|
2980
|
98 tree_index_expression::~tree_index_expression (void) |
|
|
99 { |
|
|
100 delete expr; |
|
3933
|
101 |
|
|
102 while (! args.empty ()) |
|
|
103 { |
|
4219
|
104 std::list<tree_argument_list *>::iterator p = args.begin (); |
|
|
105 delete *p; |
|
|
106 args.erase (p); |
|
3933
|
107 } |
|
2980
|
108 } |
|
|
109 |
|
5099
|
110 bool |
|
|
111 tree_index_expression::has_magic_end (void) const |
|
|
112 { |
|
|
113 for (std::list<tree_argument_list *>::const_iterator p = args.begin (); |
|
|
114 p != args.end (); |
|
|
115 p++) |
|
|
116 { |
|
|
117 tree_argument_list *elt = *p; |
|
|
118 |
|
|
119 if (elt && elt->has_magic_end ()) |
|
|
120 return true; |
|
|
121 } |
|
|
122 |
|
|
123 return false; |
|
|
124 } |
|
|
125 |
|
2991
|
126 // This is useful for printing the name of the variable in an indexed |
|
|
127 // assignment. |
|
|
128 |
|
3536
|
129 std::string |
|
2991
|
130 tree_index_expression::name (void) const |
|
|
131 { |
|
4131
|
132 return expr->name (); |
|
3933
|
133 } |
|
|
134 |
|
|
135 static Cell |
|
|
136 make_subs_cell (tree_argument_list *args, const string_vector& arg_nm) |
|
|
137 { |
|
|
138 Cell retval; |
|
|
139 |
|
|
140 octave_value_list arg_values; |
|
|
141 |
|
|
142 if (args) |
|
|
143 arg_values = args->convert_to_const_vector (); |
|
|
144 |
|
|
145 if (! error_state) |
|
|
146 { |
|
|
147 int n = arg_values.length (); |
|
|
148 |
|
|
149 if (n > 0) |
|
|
150 { |
|
|
151 arg_values.stash_name_tags (arg_nm); |
|
|
152 |
|
4548
|
153 retval.resize (dim_vector (1, n)); |
|
3933
|
154 |
|
|
155 for (int i = 0; i < n; i++) |
|
|
156 retval(0,i) = arg_values(i); |
|
|
157 } |
|
|
158 } |
|
|
159 |
|
|
160 return retval; |
|
|
161 } |
|
|
162 |
|
|
163 static inline octave_value_list |
|
4234
|
164 make_value_list (tree_argument_list *args, const string_vector& arg_nm, |
|
|
165 const octave_value *object) |
|
3933
|
166 { |
|
|
167 octave_value_list retval; |
|
|
168 |
|
|
169 if (args) |
|
4234
|
170 retval = args->convert_to_const_vector (object); |
|
3933
|
171 |
|
|
172 if (! error_state) |
|
|
173 { |
|
|
174 int n = retval.length (); |
|
|
175 |
|
|
176 if (n > 0) |
|
|
177 retval.stash_name_tags (arg_nm); |
|
|
178 } |
|
|
179 |
|
|
180 return retval; |
|
|
181 } |
|
|
182 |
|
4131
|
183 std::string |
|
4219
|
184 tree_index_expression::get_struct_index |
|
|
185 (std::list<string_vector>::const_iterator p_arg_nm, |
|
|
186 std::list<tree_expression *>::const_iterator p_dyn_field) const |
|
4131
|
187 { |
|
4219
|
188 std::string fn = (*p_arg_nm)(0); |
|
4131
|
189 |
|
|
190 if (fn.empty ()) |
|
|
191 { |
|
4219
|
192 tree_expression *df = *p_dyn_field; |
|
4131
|
193 |
|
|
194 if (df) |
|
|
195 { |
|
|
196 octave_value t = df->rvalue (); |
|
|
197 |
|
|
198 if (! error_state) |
|
4143
|
199 { |
|
|
200 fn = t.string_value (); |
|
|
201 |
|
|
202 if (! valid_identifier (fn)) |
|
|
203 ::error ("invalid structure field name"); |
|
|
204 } |
|
4131
|
205 } |
|
|
206 else |
|
|
207 panic_impossible (); |
|
|
208 } |
|
|
209 |
|
|
210 return fn; |
|
|
211 } |
|
|
212 |
|
3933
|
213 Octave_map |
|
|
214 tree_index_expression::make_arg_struct (void) const |
|
|
215 { |
|
4219
|
216 int n = args.size (); |
|
3933
|
217 |
|
4675
|
218 // XXX FIXME XXX -- why not just make these Cell objects? |
|
3933
|
219 octave_value_list subs_list (n, octave_value ()); |
|
|
220 octave_value_list type_list (n, octave_value ()); |
|
|
221 |
|
4219
|
222 std::list<tree_argument_list *>::const_iterator p_args = args.begin (); |
|
|
223 std::list<string_vector>::const_iterator p_arg_nm = arg_nm.begin (); |
|
|
224 std::list<tree_expression *>::const_iterator p_dyn_field = dyn_field.begin (); |
|
3933
|
225 |
|
|
226 Octave_map m; |
|
|
227 |
|
|
228 for (int i = 0; i < n; i++) |
|
|
229 { |
|
|
230 switch (type[i]) |
|
|
231 { |
|
|
232 case '(': |
|
4219
|
233 subs_list(i) = make_subs_cell (*p_args, *p_arg_nm); |
|
3933
|
234 break; |
|
|
235 |
|
|
236 case '{': |
|
4219
|
237 subs_list(i) = make_subs_cell (*p_args, *p_arg_nm); |
|
3933
|
238 break; |
|
|
239 |
|
|
240 case '.': |
|
4143
|
241 { |
|
|
242 subs_list(i) = get_struct_index (p_arg_nm, p_dyn_field); |
|
|
243 |
|
|
244 if (error_state) |
|
|
245 eval_error (); |
|
|
246 } |
|
3933
|
247 break; |
|
|
248 |
|
|
249 default: |
|
|
250 panic_impossible (); |
|
|
251 } |
|
|
252 |
|
|
253 if (error_state) |
|
|
254 return m; |
|
|
255 |
|
4219
|
256 p_args++; |
|
|
257 p_arg_nm++; |
|
|
258 p_dyn_field++; |
|
3933
|
259 } |
|
|
260 |
|
4675
|
261 m.assign ("subs", Cell (subs_list)); |
|
|
262 m.assign ("type", Cell (type_list)); |
|
3933
|
263 |
|
|
264 return m; |
|
2991
|
265 } |
|
|
266 |
|
2980
|
267 octave_value_list |
|
|
268 tree_index_expression::rvalue (int nargout) |
|
|
269 { |
|
|
270 octave_value_list retval; |
|
|
271 |
|
|
272 if (error_state) |
|
|
273 return retval; |
|
|
274 |
|
4432
|
275 octave_value first_expr_val = expr->rvalue (); |
|
|
276 octave_value tmp = first_expr_val; |
|
2980
|
277 |
|
|
278 if (! error_state) |
|
|
279 { |
|
4219
|
280 std::list<octave_value_list> idx; |
|
3930
|
281 |
|
4219
|
282 int n = args.size (); |
|
3933
|
283 |
|
4219
|
284 std::list<tree_argument_list *>::iterator p_args = args.begin (); |
|
|
285 std::list<string_vector>::iterator p_arg_nm = arg_nm.begin (); |
|
|
286 std::list<tree_expression *>::iterator p_dyn_field = dyn_field.begin (); |
|
3930
|
287 |
|
3933
|
288 for (int i = 0; i < n; i++) |
|
|
289 { |
|
4432
|
290 if (i > 0) |
|
|
291 { |
|
|
292 tree_argument_list *al = *p_args; |
|
|
293 |
|
|
294 if (al && al->has_magic_end ()) |
|
|
295 { |
|
|
296 // We have an expression like |
|
|
297 // |
|
|
298 // x{end}.a(end) |
|
|
299 // |
|
|
300 // and we are looking at the argument list that |
|
|
301 // contains the second (or third, etc.) "end" token, |
|
|
302 // so we must evaluate everything up to the point of |
|
|
303 // that argument list so we pass the appropiate |
|
|
304 // value to the built-in __end__ function. |
|
|
305 |
|
|
306 octave_value_list tmp_list |
|
|
307 = first_expr_val.subsref (type, idx, nargout); |
|
|
308 |
|
|
309 tmp = tmp_list(0); |
|
|
310 |
|
|
311 if (error_state) |
|
|
312 break; |
|
|
313 } |
|
|
314 } |
|
|
315 |
|
3933
|
316 switch (type[i]) |
|
|
317 { |
|
|
318 case '(': |
|
4234
|
319 idx.push_back (make_value_list (*p_args, *p_arg_nm, &tmp)); |
|
3933
|
320 break; |
|
3930
|
321 |
|
3933
|
322 case '{': |
|
4234
|
323 idx.push_back (make_value_list (*p_args, *p_arg_nm, &tmp)); |
|
3933
|
324 break; |
|
2980
|
325 |
|
3933
|
326 case '.': |
|
4143
|
327 { |
|
4233
|
328 idx.push_back (octave_value (get_struct_index (p_arg_nm, p_dyn_field))); |
|
4143
|
329 |
|
|
330 if (error_state) |
|
|
331 eval_error (); |
|
|
332 } |
|
3933
|
333 break; |
|
3930
|
334 |
|
3933
|
335 default: |
|
|
336 panic_impossible (); |
|
|
337 } |
|
3930
|
338 |
|
3933
|
339 if (error_state) |
|
|
340 break; |
|
|
341 |
|
4219
|
342 p_args++; |
|
|
343 p_arg_nm++; |
|
|
344 p_dyn_field++; |
|
2980
|
345 } |
|
3933
|
346 |
|
|
347 if (! error_state) |
|
4432
|
348 retval = first_expr_val.subsref (type, idx, nargout); |
|
2980
|
349 } |
|
|
350 |
|
|
351 return retval; |
|
|
352 } |
|
|
353 |
|
|
354 octave_value |
|
|
355 tree_index_expression::rvalue (void) |
|
|
356 { |
|
|
357 octave_value retval; |
|
|
358 |
|
|
359 octave_value_list tmp = rvalue (1); |
|
|
360 |
|
|
361 if (! tmp.empty ()) |
|
|
362 retval = tmp(0); |
|
|
363 |
|
|
364 return retval; |
|
|
365 } |
|
|
366 |
|
|
367 octave_lvalue |
|
|
368 tree_index_expression::lvalue (void) |
|
|
369 { |
|
|
370 octave_lvalue retval; |
|
|
371 |
|
4219
|
372 std::list<octave_value_list> idx; |
|
3933
|
373 |
|
4219
|
374 int n = args.size (); |
|
3933
|
375 |
|
4219
|
376 std::list<tree_argument_list *>::iterator p_args = args.begin (); |
|
|
377 std::list<string_vector>::iterator p_arg_nm = arg_nm.begin (); |
|
|
378 std::list<tree_expression *>::iterator p_dyn_field = dyn_field.begin (); |
|
3933
|
379 |
|
4234
|
380 retval = expr->lvalue (); |
|
3933
|
381 |
|
2980
|
382 if (! error_state) |
|
|
383 { |
|
4432
|
384 // I think it is OK to have a copy here. |
|
|
385 |
|
|
386 const octave_value *tro = retval.object (); |
|
|
387 |
|
|
388 octave_value first_retval_object; |
|
|
389 |
|
|
390 if (tro) |
|
|
391 first_retval_object = *tro; |
|
|
392 |
|
|
393 octave_value tmp = first_retval_object; |
|
4234
|
394 |
|
|
395 for (int i = 0; i < n; i++) |
|
|
396 { |
|
4432
|
397 if (i > 0) |
|
|
398 { |
|
|
399 tree_argument_list *al = *p_args; |
|
|
400 |
|
|
401 if (al && al->has_magic_end ()) |
|
|
402 { |
|
|
403 // We have an expression like |
|
|
404 // |
|
|
405 // x{end}.a(end) |
|
|
406 // |
|
|
407 // and we are looking at the argument list that |
|
|
408 // contains the second (or third, etc.) "end" token, |
|
|
409 // so we must evaluate everything up to the point of |
|
|
410 // that argument list so we pass the appropiate |
|
|
411 // value to the built-in __end__ function. |
|
|
412 |
|
|
413 octave_value_list tmp_list |
|
|
414 = first_retval_object.subsref (type, idx, 1); |
|
|
415 |
|
|
416 tmp = tmp_list(0); |
|
|
417 |
|
|
418 if (error_state) |
|
|
419 break; |
|
|
420 } |
|
|
421 } |
|
|
422 |
|
4234
|
423 switch (type[i]) |
|
|
424 { |
|
|
425 case '(': |
|
4432
|
426 idx.push_back (make_value_list (*p_args, *p_arg_nm, &tmp)); |
|
4234
|
427 break; |
|
|
428 |
|
|
429 case '{': |
|
4432
|
430 idx.push_back (make_value_list (*p_args, *p_arg_nm, &tmp)); |
|
4234
|
431 break; |
|
|
432 |
|
|
433 case '.': |
|
|
434 { |
|
|
435 idx.push_back (octave_value (get_struct_index (p_arg_nm, p_dyn_field))); |
|
|
436 |
|
|
437 if (error_state) |
|
|
438 eval_error (); |
|
|
439 } |
|
|
440 break; |
|
|
441 |
|
|
442 default: |
|
|
443 panic_impossible (); |
|
|
444 } |
|
|
445 |
|
|
446 if (error_state) |
|
|
447 break; |
|
|
448 |
|
|
449 p_args++; |
|
|
450 p_arg_nm++; |
|
|
451 p_dyn_field++; |
|
|
452 } |
|
3930
|
453 |
|
3933
|
454 if (! error_state) |
|
|
455 retval.set_index (type, idx); |
|
2980
|
456 } |
|
|
457 |
|
|
458 return retval; |
|
|
459 } |
|
|
460 |
|
|
461 void |
|
4143
|
462 tree_index_expression::eval_error (void) const |
|
2980
|
463 { |
|
3965
|
464 int l = line (); |
|
|
465 int c = column (); |
|
2980
|
466 |
|
3965
|
467 const char *type_str; |
|
3930
|
468 |
|
3965
|
469 if (type[0] == '.') |
|
|
470 type_str = "structure reference operator"; |
|
|
471 else if (args.front ()) |
|
|
472 type_str = "index expression"; |
|
|
473 else |
|
|
474 type_str = "expression"; |
|
3930
|
475 |
|
3965
|
476 if (l != -1 && c != -1) |
|
|
477 ::error ("evaluating %s near line %d, column %d", type_str, l, c); |
|
|
478 else |
|
|
479 ::error ("evaluating %s", type_str); |
|
2980
|
480 } |
|
|
481 |
|
|
482 void |
|
|
483 tree_index_expression::accept (tree_walker& tw) |
|
|
484 { |
|
|
485 tw.visit_index_expression (*this); |
|
|
486 } |
|
|
487 |
|
|
488 /* |
|
|
489 ;;; Local Variables: *** |
|
|
490 ;;; mode: C++ *** |
|
|
491 ;;; End: *** |
|
|
492 */ |
