|
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 |
|
|
140 retval.resize (1, n); |
|
|
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 |
|
|
151 make_value_list (tree_argument_list *args, const string_vector& arg_nm) |
|
|
152 { |
|
|
153 octave_value_list retval; |
|
|
154 |
|
|
155 if (args) |
|
|
156 retval = args->convert_to_const_vector (); |
|
|
157 |
|
|
158 if (! error_state) |
|
|
159 { |
|
|
160 int n = retval.length (); |
|
|
161 |
|
|
162 if (n > 0) |
|
|
163 retval.stash_name_tags (arg_nm); |
|
|
164 } |
|
|
165 |
|
|
166 return retval; |
|
|
167 } |
|
|
168 |
|
4131
|
169 std::string |
|
4219
|
170 tree_index_expression::get_struct_index |
|
|
171 (std::list<string_vector>::const_iterator p_arg_nm, |
|
|
172 std::list<tree_expression *>::const_iterator p_dyn_field) const |
|
4131
|
173 { |
|
4219
|
174 std::string fn = (*p_arg_nm)(0); |
|
4131
|
175 |
|
|
176 if (fn.empty ()) |
|
|
177 { |
|
4219
|
178 tree_expression *df = *p_dyn_field; |
|
4131
|
179 |
|
|
180 if (df) |
|
|
181 { |
|
|
182 octave_value t = df->rvalue (); |
|
|
183 |
|
|
184 if (! error_state) |
|
4143
|
185 { |
|
|
186 fn = t.string_value (); |
|
|
187 |
|
|
188 if (! valid_identifier (fn)) |
|
|
189 ::error ("invalid structure field name"); |
|
|
190 } |
|
4131
|
191 } |
|
|
192 else |
|
|
193 panic_impossible (); |
|
|
194 } |
|
|
195 |
|
|
196 return fn; |
|
|
197 } |
|
|
198 |
|
3933
|
199 Octave_map |
|
|
200 tree_index_expression::make_arg_struct (void) const |
|
|
201 { |
|
4219
|
202 int n = args.size (); |
|
3933
|
203 |
|
|
204 octave_value_list subs_list (n, octave_value ()); |
|
|
205 octave_value_list type_list (n, octave_value ()); |
|
|
206 |
|
4219
|
207 std::list<tree_argument_list *>::const_iterator p_args = args.begin (); |
|
|
208 std::list<string_vector>::const_iterator p_arg_nm = arg_nm.begin (); |
|
|
209 std::list<tree_expression *>::const_iterator p_dyn_field = dyn_field.begin (); |
|
3933
|
210 |
|
|
211 Octave_map m; |
|
|
212 |
|
|
213 for (int i = 0; i < n; i++) |
|
|
214 { |
|
|
215 switch (type[i]) |
|
|
216 { |
|
|
217 case '(': |
|
4219
|
218 subs_list(i) = make_subs_cell (*p_args, *p_arg_nm); |
|
3933
|
219 break; |
|
|
220 |
|
|
221 case '{': |
|
4219
|
222 subs_list(i) = make_subs_cell (*p_args, *p_arg_nm); |
|
3933
|
223 break; |
|
|
224 |
|
|
225 case '.': |
|
4143
|
226 { |
|
|
227 subs_list(i) = get_struct_index (p_arg_nm, p_dyn_field); |
|
|
228 |
|
|
229 if (error_state) |
|
|
230 eval_error (); |
|
|
231 } |
|
3933
|
232 break; |
|
|
233 |
|
|
234 default: |
|
|
235 panic_impossible (); |
|
|
236 } |
|
|
237 |
|
|
238 if (error_state) |
|
|
239 return m; |
|
|
240 |
|
4219
|
241 p_args++; |
|
|
242 p_arg_nm++; |
|
|
243 p_dyn_field++; |
|
3933
|
244 } |
|
|
245 |
|
|
246 m ["subs"] = subs_list; |
|
|
247 m ["type"] = type_list; |
|
|
248 |
|
|
249 return m; |
|
2991
|
250 } |
|
|
251 |
|
2980
|
252 octave_value_list |
|
|
253 tree_index_expression::rvalue (int nargout) |
|
|
254 { |
|
|
255 octave_value_list retval; |
|
|
256 |
|
|
257 if (error_state) |
|
|
258 return retval; |
|
|
259 |
|
|
260 octave_value tmp = expr->rvalue (); |
|
|
261 |
|
|
262 if (! error_state) |
|
|
263 { |
|
4219
|
264 std::list<octave_value_list> idx; |
|
3930
|
265 |
|
4219
|
266 int n = args.size (); |
|
3933
|
267 |
|
4219
|
268 std::list<tree_argument_list *>::iterator p_args = args.begin (); |
|
|
269 std::list<string_vector>::iterator p_arg_nm = arg_nm.begin (); |
|
|
270 std::list<tree_expression *>::iterator p_dyn_field = dyn_field.begin (); |
|
3930
|
271 |
|
3933
|
272 for (int i = 0; i < n; i++) |
|
|
273 { |
|
|
274 switch (type[i]) |
|
|
275 { |
|
|
276 case '(': |
|
4219
|
277 idx.push_back (make_value_list (*p_args, *p_arg_nm)); |
|
3933
|
278 break; |
|
3930
|
279 |
|
3933
|
280 case '{': |
|
4219
|
281 idx.push_back (make_value_list (*p_args, *p_arg_nm)); |
|
3933
|
282 break; |
|
2980
|
283 |
|
3933
|
284 case '.': |
|
4143
|
285 { |
|
4233
|
286 idx.push_back (octave_value (get_struct_index (p_arg_nm, p_dyn_field))); |
|
4143
|
287 |
|
|
288 if (error_state) |
|
|
289 eval_error (); |
|
|
290 } |
|
3933
|
291 break; |
|
3930
|
292 |
|
3933
|
293 default: |
|
|
294 panic_impossible (); |
|
|
295 } |
|
3930
|
296 |
|
3933
|
297 if (error_state) |
|
|
298 break; |
|
|
299 |
|
4219
|
300 p_args++; |
|
|
301 p_arg_nm++; |
|
|
302 p_dyn_field++; |
|
2980
|
303 } |
|
3933
|
304 |
|
|
305 if (! error_state) |
|
|
306 retval = tmp.subsref (type, idx, nargout); |
|
2980
|
307 } |
|
|
308 |
|
|
309 return retval; |
|
|
310 } |
|
|
311 |
|
|
312 octave_value |
|
|
313 tree_index_expression::rvalue (void) |
|
|
314 { |
|
|
315 octave_value retval; |
|
|
316 |
|
|
317 octave_value_list tmp = rvalue (1); |
|
|
318 |
|
|
319 if (! tmp.empty ()) |
|
|
320 retval = tmp(0); |
|
|
321 |
|
|
322 return retval; |
|
|
323 } |
|
|
324 |
|
|
325 octave_lvalue |
|
|
326 tree_index_expression::lvalue (void) |
|
|
327 { |
|
|
328 octave_lvalue retval; |
|
|
329 |
|
4219
|
330 std::list<octave_value_list> idx; |
|
3933
|
331 |
|
4219
|
332 int n = args.size (); |
|
3933
|
333 |
|
4219
|
334 std::list<tree_argument_list *>::iterator p_args = args.begin (); |
|
|
335 std::list<string_vector>::iterator p_arg_nm = arg_nm.begin (); |
|
|
336 std::list<tree_expression *>::iterator p_dyn_field = dyn_field.begin (); |
|
3933
|
337 |
|
|
338 for (int i = 0; i < n; i++) |
|
|
339 { |
|
|
340 switch (type[i]) |
|
|
341 { |
|
|
342 case '(': |
|
4219
|
343 idx.push_back (make_value_list (*p_args, *p_arg_nm)); |
|
3933
|
344 break; |
|
|
345 |
|
|
346 case '{': |
|
4219
|
347 idx.push_back (make_value_list (*p_args, *p_arg_nm)); |
|
3933
|
348 break; |
|
|
349 |
|
|
350 case '.': |
|
4143
|
351 { |
|
4233
|
352 idx.push_back (octave_value (get_struct_index (p_arg_nm, p_dyn_field))); |
|
4143
|
353 |
|
|
354 if (error_state) |
|
|
355 eval_error (); |
|
|
356 } |
|
3933
|
357 break; |
|
|
358 |
|
|
359 default: |
|
|
360 panic_impossible (); |
|
|
361 } |
|
|
362 |
|
|
363 if (error_state) |
|
|
364 break; |
|
|
365 |
|
4219
|
366 p_args++; |
|
|
367 p_arg_nm++; |
|
|
368 p_dyn_field++; |
|
3933
|
369 } |
|
|
370 |
|
2980
|
371 if (! error_state) |
|
|
372 { |
|
3933
|
373 retval = expr->lvalue (); |
|
3930
|
374 |
|
3933
|
375 if (! error_state) |
|
|
376 retval.set_index (type, idx); |
|
2980
|
377 } |
|
|
378 |
|
|
379 return retval; |
|
|
380 } |
|
|
381 |
|
|
382 void |
|
4143
|
383 tree_index_expression::eval_error (void) const |
|
2980
|
384 { |
|
3965
|
385 int l = line (); |
|
|
386 int c = column (); |
|
2980
|
387 |
|
3965
|
388 const char *type_str; |
|
3930
|
389 |
|
3965
|
390 if (type[0] == '.') |
|
|
391 type_str = "structure reference operator"; |
|
|
392 else if (args.front ()) |
|
|
393 type_str = "index expression"; |
|
|
394 else |
|
|
395 type_str = "expression"; |
|
3930
|
396 |
|
3965
|
397 if (l != -1 && c != -1) |
|
|
398 ::error ("evaluating %s near line %d, column %d", type_str, l, c); |
|
|
399 else |
|
|
400 ::error ("evaluating %s", type_str); |
|
2980
|
401 } |
|
|
402 |
|
|
403 void |
|
|
404 tree_index_expression::accept (tree_walker& tw) |
|
|
405 { |
|
|
406 tw.visit_index_expression (*this); |
|
|
407 } |
|
|
408 |
|
|
409 /* |
|
|
410 ;;; Local Variables: *** |
|
|
411 ;;; mode: C++ *** |
|
|
412 ;;; End: *** |
|
|
413 */ |
