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