|
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 |
|
4066
|
23 #if defined (__GNUG__) && ! defined (NO_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 |
|
3933
|
45 #include "SLList.cc" |
|
|
46 |
|
|
47 template class SLNode<string_vector>; |
|
|
48 template class SLList<string_vector>; |
|
|
49 |
|
2980
|
50 // Index expressions. |
|
|
51 |
|
3546
|
52 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
53 tree_argument_list *lst, |
|
3933
|
54 int l, int c, char t) |
|
4131
|
55 : tree_expression (l, c), expr (e), args (), type (), |
|
|
56 arg_nm (), dyn_field () |
|
3933
|
57 { |
|
|
58 append (lst, t); |
|
|
59 } |
|
3215
|
60 |
|
3930
|
61 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
62 const std::string& n, |
|
3944
|
63 int l, int c) |
|
4131
|
64 : tree_expression (l, c), expr (e), args (), type (), |
|
|
65 arg_nm (), dyn_field () |
|
3933
|
66 { |
|
|
67 append (n); |
|
|
68 } |
|
|
69 |
|
4131
|
70 tree_index_expression::tree_index_expression (tree_expression *e, |
|
|
71 tree_expression *df, |
|
|
72 int l, int c) |
|
|
73 : tree_expression (l, c), expr (e), args (), type (), |
|
|
74 arg_nm (), dyn_field () |
|
|
75 { |
|
|
76 append (df); |
|
|
77 } |
|
|
78 |
|
3933
|
79 void |
|
|
80 tree_index_expression::append (tree_argument_list *lst, char t) |
|
|
81 { |
|
|
82 args.append (lst); |
|
|
83 type.append (1, t); |
|
|
84 arg_nm.append (lst ? lst->get_arg_names () : string_vector ()); |
|
4131
|
85 dyn_field.append (static_cast<tree_expression *> (0)); |
|
3933
|
86 } |
|
|
87 |
|
|
88 void |
|
|
89 tree_index_expression::append (const std::string& n) |
|
|
90 { |
|
|
91 args.append (static_cast<tree_argument_list *> (0)); |
|
|
92 type.append ("."); |
|
|
93 arg_nm.append (n); |
|
4131
|
94 dyn_field.append (static_cast<tree_expression *> (0)); |
|
|
95 } |
|
|
96 |
|
|
97 void |
|
|
98 tree_index_expression::append (tree_expression *df) |
|
|
99 { |
|
|
100 args.append (static_cast<tree_argument_list *> (0)); |
|
|
101 type.append ("."); |
|
|
102 arg_nm.append (""); |
|
|
103 dyn_field.append (df); |
|
3933
|
104 } |
|
3930
|
105 |
|
2980
|
106 tree_index_expression::~tree_index_expression (void) |
|
|
107 { |
|
|
108 delete expr; |
|
3933
|
109 |
|
|
110 while (! args.empty ()) |
|
|
111 { |
|
|
112 tree_argument_list *t = args.remove_front (); |
|
|
113 delete t; |
|
|
114 } |
|
2980
|
115 } |
|
|
116 |
|
2991
|
117 // This is useful for printing the name of the variable in an indexed |
|
|
118 // assignment. |
|
|
119 |
|
3536
|
120 std::string |
|
2991
|
121 tree_index_expression::name (void) const |
|
|
122 { |
|
4131
|
123 return expr->name (); |
|
3933
|
124 } |
|
|
125 |
|
|
126 static Cell |
|
|
127 make_subs_cell (tree_argument_list *args, const string_vector& arg_nm) |
|
|
128 { |
|
|
129 Cell retval; |
|
|
130 |
|
|
131 octave_value_list arg_values; |
|
|
132 |
|
|
133 if (args) |
|
|
134 arg_values = args->convert_to_const_vector (); |
|
|
135 |
|
|
136 if (! error_state) |
|
|
137 { |
|
|
138 int n = arg_values.length (); |
|
|
139 |
|
|
140 if (n > 0) |
|
|
141 { |
|
|
142 arg_values.stash_name_tags (arg_nm); |
|
|
143 |
|
|
144 retval.resize (1, n); |
|
|
145 |
|
|
146 for (int i = 0; i < n; i++) |
|
|
147 retval(0,i) = arg_values(i); |
|
|
148 } |
|
|
149 } |
|
|
150 |
|
|
151 return retval; |
|
|
152 } |
|
|
153 |
|
|
154 static inline octave_value_list |
|
|
155 make_value_list (tree_argument_list *args, const string_vector& arg_nm) |
|
|
156 { |
|
|
157 octave_value_list retval; |
|
|
158 |
|
|
159 if (args) |
|
|
160 retval = args->convert_to_const_vector (); |
|
|
161 |
|
|
162 if (! error_state) |
|
|
163 { |
|
|
164 int n = retval.length (); |
|
|
165 |
|
|
166 if (n > 0) |
|
|
167 retval.stash_name_tags (arg_nm); |
|
|
168 } |
|
|
169 |
|
|
170 return retval; |
|
|
171 } |
|
|
172 |
|
4131
|
173 std::string |
|
|
174 tree_index_expression::get_struct_index (Pix p_arg_nm, Pix p_dyn_field) const |
|
|
175 { |
|
|
176 std::string fn = arg_nm(p_arg_nm)(0); |
|
|
177 |
|
|
178 if (fn.empty ()) |
|
|
179 { |
|
|
180 tree_expression *df = dyn_field (p_dyn_field); |
|
|
181 |
|
|
182 if (df) |
|
|
183 { |
|
|
184 octave_value t = df->rvalue (); |
|
|
185 |
|
|
186 if (! error_state) |
|
|
187 fn = t.string_value (); |
|
|
188 } |
|
|
189 else |
|
|
190 panic_impossible (); |
|
|
191 } |
|
|
192 |
|
|
193 return fn; |
|
|
194 } |
|
|
195 |
|
3933
|
196 Octave_map |
|
|
197 tree_index_expression::make_arg_struct (void) const |
|
|
198 { |
|
|
199 int n = args.length (); |
|
|
200 |
|
|
201 octave_value_list subs_list (n, octave_value ()); |
|
|
202 octave_value_list type_list (n, octave_value ()); |
|
|
203 |
|
|
204 Pix p_args = args.first (); |
|
|
205 Pix p_arg_nm = arg_nm.first (); |
|
4131
|
206 Pix p_dyn_field = dyn_field.first (); |
|
3933
|
207 |
|
|
208 Octave_map m; |
|
|
209 |
|
|
210 for (int i = 0; i < n; i++) |
|
|
211 { |
|
|
212 switch (type[i]) |
|
|
213 { |
|
|
214 case '(': |
|
|
215 subs_list(i) = make_subs_cell (args(p_args), arg_nm(p_arg_nm)); |
|
|
216 break; |
|
|
217 |
|
|
218 case '{': |
|
|
219 subs_list(i) = make_subs_cell (args(p_args), arg_nm(p_arg_nm)); |
|
|
220 break; |
|
|
221 |
|
|
222 case '.': |
|
4131
|
223 subs_list(i) = get_struct_index (p_arg_nm, p_dyn_field); |
|
3933
|
224 break; |
|
|
225 |
|
|
226 default: |
|
|
227 panic_impossible (); |
|
|
228 } |
|
|
229 |
|
|
230 if (error_state) |
|
|
231 return m; |
|
|
232 |
|
|
233 args.next (p_args); |
|
|
234 arg_nm.next (p_arg_nm); |
|
4131
|
235 dyn_field.next (p_dyn_field); |
|
3933
|
236 } |
|
|
237 |
|
|
238 m ["subs"] = subs_list; |
|
|
239 m ["type"] = type_list; |
|
|
240 |
|
|
241 return m; |
|
2991
|
242 } |
|
|
243 |
|
2980
|
244 octave_value_list |
|
|
245 tree_index_expression::rvalue (int nargout) |
|
|
246 { |
|
|
247 octave_value_list retval; |
|
|
248 |
|
|
249 if (error_state) |
|
|
250 return retval; |
|
|
251 |
|
|
252 octave_value tmp = expr->rvalue (); |
|
|
253 |
|
|
254 if (! error_state) |
|
|
255 { |
|
3933
|
256 SLList<octave_value_list> idx; |
|
3930
|
257 |
|
3933
|
258 int n = args.length (); |
|
|
259 |
|
|
260 Pix p_args = args.first (); |
|
|
261 Pix p_arg_nm = arg_nm.first (); |
|
4131
|
262 Pix p_dyn_field = dyn_field.first (); |
|
3930
|
263 |
|
3933
|
264 for (int i = 0; i < n; i++) |
|
|
265 { |
|
|
266 switch (type[i]) |
|
|
267 { |
|
|
268 case '(': |
|
|
269 idx.append (make_value_list (args(p_args), arg_nm(p_arg_nm))); |
|
|
270 break; |
|
3930
|
271 |
|
3933
|
272 case '{': |
|
|
273 idx.append (make_value_list (args(p_args), arg_nm(p_arg_nm))); |
|
|
274 break; |
|
2980
|
275 |
|
3933
|
276 case '.': |
|
4131
|
277 idx.append (get_struct_index (p_arg_nm, p_dyn_field)); |
|
3933
|
278 break; |
|
3930
|
279 |
|
3933
|
280 default: |
|
|
281 panic_impossible (); |
|
|
282 } |
|
3930
|
283 |
|
3933
|
284 if (error_state) |
|
|
285 break; |
|
|
286 |
|
|
287 args.next (p_args); |
|
|
288 arg_nm.next (p_arg_nm); |
|
4131
|
289 dyn_field.next (p_dyn_field); |
|
2980
|
290 } |
|
3933
|
291 |
|
|
292 if (! error_state) |
|
|
293 retval = tmp.subsref (type, idx, nargout); |
|
2980
|
294 } |
|
|
295 |
|
|
296 return retval; |
|
|
297 } |
|
|
298 |
|
|
299 octave_value |
|
|
300 tree_index_expression::rvalue (void) |
|
|
301 { |
|
|
302 octave_value retval; |
|
|
303 |
|
|
304 octave_value_list tmp = rvalue (1); |
|
|
305 |
|
|
306 if (! tmp.empty ()) |
|
|
307 retval = tmp(0); |
|
|
308 |
|
|
309 return retval; |
|
|
310 } |
|
|
311 |
|
|
312 octave_lvalue |
|
|
313 tree_index_expression::lvalue (void) |
|
|
314 { |
|
|
315 octave_lvalue retval; |
|
|
316 |
|
3933
|
317 SLList<octave_value_list> idx; |
|
|
318 |
|
|
319 int n = args.length (); |
|
|
320 |
|
|
321 Pix p_args = args.first (); |
|
|
322 Pix p_arg_nm = arg_nm.first (); |
|
4131
|
323 Pix p_dyn_field = dyn_field.first (); |
|
3933
|
324 |
|
|
325 for (int i = 0; i < n; i++) |
|
|
326 { |
|
|
327 switch (type[i]) |
|
|
328 { |
|
|
329 case '(': |
|
|
330 idx.append (make_value_list (args(p_args), arg_nm(p_arg_nm))); |
|
|
331 break; |
|
|
332 |
|
|
333 case '{': |
|
|
334 idx.append (make_value_list (args(p_args), arg_nm(p_arg_nm))); |
|
|
335 break; |
|
|
336 |
|
|
337 case '.': |
|
4131
|
338 idx.append (get_struct_index (p_arg_nm, p_dyn_field)); |
|
3933
|
339 break; |
|
|
340 |
|
|
341 default: |
|
|
342 panic_impossible (); |
|
|
343 } |
|
|
344 |
|
|
345 if (error_state) |
|
|
346 break; |
|
|
347 |
|
|
348 args.next (p_args); |
|
|
349 arg_nm.next (p_arg_nm); |
|
4131
|
350 dyn_field.next (p_dyn_field); |
|
3933
|
351 } |
|
|
352 |
|
2980
|
353 if (! error_state) |
|
|
354 { |
|
3933
|
355 retval = expr->lvalue (); |
|
3930
|
356 |
|
3933
|
357 if (! error_state) |
|
|
358 retval.set_index (type, idx); |
|
2980
|
359 } |
|
|
360 |
|
|
361 return retval; |
|
|
362 } |
|
|
363 |
|
|
364 void |
|
|
365 tree_index_expression::eval_error (void) |
|
|
366 { |
|
3965
|
367 int l = line (); |
|
|
368 int c = column (); |
|
2980
|
369 |
|
3965
|
370 const char *type_str; |
|
3930
|
371 |
|
3965
|
372 if (type[0] == '.') |
|
|
373 type_str = "structure reference operator"; |
|
|
374 else if (args.front ()) |
|
|
375 type_str = "index expression"; |
|
|
376 else |
|
|
377 type_str = "expression"; |
|
3930
|
378 |
|
3965
|
379 if (l != -1 && c != -1) |
|
|
380 ::error ("evaluating %s near line %d, column %d", type_str, l, c); |
|
|
381 else |
|
|
382 ::error ("evaluating %s", type_str); |
|
2980
|
383 } |
|
|
384 |
|
|
385 void |
|
|
386 tree_index_expression::accept (tree_walker& tw) |
|
|
387 { |
|
|
388 tw.visit_index_expression (*this); |
|
|
389 } |
|
|
390 |
|
|
391 /* |
|
|
392 ;;; Local Variables: *** |
|
|
393 ;;; mode: C++ *** |
|
|
394 ;;; End: *** |
|
|
395 */ |
