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