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