|
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 |
|
5307
|
19 Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA |
|
|
20 02110-1301, USA. |
|
2980
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #ifdef HAVE_CONFIG_H |
|
|
25 #include <config.h> |
|
|
26 #endif |
|
|
27 |
|
3503
|
28 #include <iostream> |
|
2980
|
29 |
|
|
30 #include "defun.h" |
|
|
31 #include "error.h" |
|
|
32 #include "input.h" |
|
|
33 #include "oct-obj.h" |
|
|
34 #include "oct-lvalue.h" |
|
|
35 #include "pager.h" |
|
|
36 #include "ov.h" |
|
2982
|
37 #include "pt-arg-list.h" |
|
3770
|
38 #include "pt-bp.h" |
|
2980
|
39 #include "pt-assign.h" |
|
|
40 #include "pt-walk.h" |
|
|
41 #include "utils.h" |
|
5794
|
42 #include "variables.h" |
|
2980
|
43 |
|
|
44 // Simple assignment expressions. |
|
|
45 |
|
|
46 tree_simple_assignment::~tree_simple_assignment (void) |
|
|
47 { |
|
|
48 if (! preserve) |
|
|
49 delete lhs; |
|
|
50 |
|
|
51 delete rhs; |
|
|
52 } |
|
|
53 |
|
|
54 octave_value_list |
|
|
55 tree_simple_assignment::rvalue (int nargout) |
|
|
56 { |
|
|
57 octave_value_list retval; |
|
|
58 |
|
3770
|
59 MAYBE_DO_BREAKPOINT; |
|
|
60 |
|
2980
|
61 if (nargout > 1) |
|
|
62 error ("invalid number of output arguments for expression X = RHS"); |
|
|
63 else |
|
|
64 retval = rvalue (); |
|
|
65 |
|
|
66 return retval; |
|
|
67 } |
|
|
68 |
|
5775
|
69 // FIXME -- this works, but it would look a little better if |
|
2984
|
70 // it were broken up into a couple of separate functions. |
|
|
71 |
|
2980
|
72 octave_value |
|
|
73 tree_simple_assignment::rvalue (void) |
|
|
74 { |
|
3208
|
75 octave_value retval; |
|
2980
|
76 |
|
|
77 if (error_state) |
|
3208
|
78 return retval; |
|
2980
|
79 |
|
|
80 if (rhs) |
|
|
81 { |
|
|
82 octave_value_list tmp = rhs->rvalue (); |
|
|
83 |
|
|
84 if (! (error_state || tmp.empty ())) |
|
|
85 { |
|
3208
|
86 octave_value rhs_val = tmp(0); |
|
2980
|
87 |
|
|
88 if (rhs_val.is_undefined ()) |
|
|
89 { |
|
|
90 error ("value on right hand side of assignment is undefined"); |
|
|
91 eval_error (); |
|
|
92 } |
|
5750
|
93 else if (rhs_val.is_cs_list ()) |
|
|
94 { |
|
|
95 error ("invalid assignment of comma-separated list"); |
|
|
96 eval_error (); |
|
|
97 } |
|
2980
|
98 else |
|
|
99 { |
|
|
100 octave_lvalue ult = lhs->lvalue (); |
|
|
101 |
|
|
102 if (error_state) |
|
|
103 eval_error (); |
|
|
104 else |
|
|
105 { |
|
|
106 ult.assign (etype, rhs_val); |
|
|
107 |
|
3215
|
108 if (! error_state) |
|
|
109 { |
|
3527
|
110 if (etype == octave_value::op_asn_eq) |
|
3215
|
111 retval = rhs_val; |
|
|
112 else |
|
|
113 retval = ult.value (); |
|
2984
|
114 |
|
3215
|
115 if (print_result ()) |
|
3208
|
116 { |
|
5841
|
117 // We clear any index here so that we can |
|
|
118 // get the new value of the referenced |
|
|
119 // object below, instead of the indexed |
|
|
120 // value (which should be the same as the |
|
|
121 // right hand side value). |
|
2980
|
122 |
|
5841
|
123 ult.clear_index (); |
|
3208
|
124 |
|
5841
|
125 octave_value lhs_val = ult.value (); |
|
3208
|
126 |
|
5841
|
127 if (! error_state) |
|
|
128 lhs_val.print_with_name (octave_stdout, |
|
|
129 lhs->name ()); |
|
2980
|
130 } |
|
|
131 } |
|
3215
|
132 else |
|
|
133 eval_error (); |
|
2980
|
134 } |
|
|
135 } |
|
|
136 } |
|
|
137 else |
|
|
138 eval_error (); |
|
|
139 } |
|
|
140 |
|
3208
|
141 return retval; |
|
2980
|
142 } |
|
|
143 |
|
|
144 void |
|
|
145 tree_simple_assignment::eval_error (void) |
|
|
146 { |
|
3965
|
147 int l = line (); |
|
|
148 int c = column (); |
|
2980
|
149 |
|
3965
|
150 if (l != -1 && c != -1) |
|
|
151 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
152 l, c); |
|
2980
|
153 } |
|
|
154 |
|
3536
|
155 std::string |
|
2980
|
156 tree_simple_assignment::oper (void) const |
|
|
157 { |
|
|
158 return octave_value::assign_op_as_string (etype); |
|
|
159 } |
|
|
160 |
|
5861
|
161 tree_expression * |
|
|
162 tree_simple_assignment::dup (symbol_table *sym_tab) |
|
|
163 { |
|
|
164 tree_simple_assignment *new_sa |
|
|
165 = new tree_simple_assignment (lhs ? lhs->dup (sym_tab) : 0, |
|
|
166 rhs ? rhs->dup (sym_tab) : 0, |
|
|
167 preserve, etype); |
|
|
168 |
|
|
169 new_sa->copy_base (*this); |
|
|
170 |
|
|
171 return new_sa; |
|
|
172 } |
|
|
173 |
|
2980
|
174 void |
|
|
175 tree_simple_assignment::accept (tree_walker& tw) |
|
|
176 { |
|
|
177 tw.visit_simple_assignment (*this); |
|
|
178 } |
|
|
179 |
|
|
180 // Multi-valued assignment expressions. |
|
|
181 |
|
|
182 tree_multi_assignment::~tree_multi_assignment (void) |
|
|
183 { |
|
|
184 if (! preserve) |
|
|
185 delete lhs; |
|
|
186 |
|
|
187 delete rhs; |
|
|
188 } |
|
|
189 |
|
|
190 octave_value |
|
|
191 tree_multi_assignment::rvalue (void) |
|
|
192 { |
|
|
193 octave_value retval; |
|
|
194 |
|
|
195 octave_value_list tmp = rvalue (1); |
|
|
196 |
|
|
197 if (! tmp.empty ()) |
|
|
198 retval = tmp(0); |
|
|
199 |
|
|
200 return retval; |
|
|
201 } |
|
|
202 |
|
5775
|
203 // FIXME -- this works, but it would look a little better if |
|
2984
|
204 // it were broken up into a couple of separate functions. |
|
|
205 |
|
2980
|
206 octave_value_list |
|
|
207 tree_multi_assignment::rvalue (int) |
|
|
208 { |
|
3208
|
209 octave_value_list retval; |
|
2980
|
210 |
|
|
211 if (error_state) |
|
3208
|
212 return retval; |
|
2980
|
213 |
|
|
214 if (rhs) |
|
|
215 { |
|
5846
|
216 std::list<octave_lvalue> lvalue_list = lhs->lvalue_list (); |
|
3977
|
217 |
|
|
218 if (error_state) |
|
|
219 return retval; |
|
2980
|
220 |
|
5846
|
221 int n_out = 0; |
|
|
222 |
|
|
223 for (std::list<octave_lvalue>::const_iterator p = lvalue_list.begin (); |
|
|
224 p != lvalue_list.end (); |
|
|
225 p++) |
|
|
226 n_out += p->numel (); |
|
|
227 |
|
3208
|
228 octave_value_list rhs_val = rhs->rvalue (n_out); |
|
2980
|
229 |
|
3977
|
230 if (error_state) |
|
|
231 return retval; |
|
2980
|
232 |
|
3977
|
233 if (rhs_val.empty ()) |
|
|
234 { |
|
5846
|
235 if (n_out > 0) |
|
|
236 { |
|
|
237 error ("value on right hand side of assignment is undefined"); |
|
|
238 eval_error (); |
|
|
239 return retval; |
|
|
240 } |
|
3977
|
241 } |
|
|
242 else |
|
|
243 { |
|
5846
|
244 octave_idx_type k = 0; |
|
2980
|
245 |
|
5846
|
246 octave_idx_type n = rhs_val.length (); |
|
2980
|
247 |
|
5265
|
248 if (n == 1) |
|
|
249 { |
|
|
250 octave_value tmp = rhs_val(0); |
|
|
251 |
|
|
252 if (tmp.is_cs_list ()) |
|
|
253 { |
|
5750
|
254 error ("invalid assignment of comma-separated list"); |
|
|
255 eval_error (); |
|
|
256 return retval; |
|
5265
|
257 } |
|
|
258 } |
|
|
259 |
|
3977
|
260 retval.resize (n, octave_value ()); |
|
3208
|
261 |
|
5846
|
262 tree_argument_list::iterator q = lhs->begin (); |
|
|
263 |
|
|
264 for (std::list<octave_lvalue>::iterator p = lvalue_list.begin (); |
|
|
265 p != lvalue_list.end (); |
|
4219
|
266 p++) |
|
3977
|
267 { |
|
5846
|
268 tree_expression *lhs_elt = *q++; |
|
|
269 |
|
|
270 octave_lvalue ult = *p; |
|
|
271 |
|
|
272 octave_idx_type nel = ult.numel (); |
|
3977
|
273 |
|
5846
|
274 if (nel > 1) |
|
3977
|
275 { |
|
5846
|
276 if (k + nel <= n) |
|
|
277 { |
|
|
278 if (etype == octave_value::op_asn_eq) |
|
|
279 { |
|
|
280 octave_value_list ovl (nel, octave_value ()); |
|
|
281 |
|
|
282 for (octave_idx_type j = 0; j < nel; j++) |
|
|
283 ovl(j) = rhs_val(k+j); |
|
|
284 |
|
|
285 ult.assign (etype, octave_value (ovl, true)); |
|
2980
|
286 |
|
5846
|
287 if (! error_state) |
|
|
288 { |
|
|
289 for (octave_idx_type j = 0; j < nel; j++) |
|
|
290 retval(k+j) = rhs_val(k+j); |
|
|
291 |
|
|
292 k += nel; |
|
|
293 } |
|
|
294 } |
|
|
295 else |
|
|
296 { |
|
|
297 std::string op = octave_value::assign_op_as_string (etype); |
|
|
298 error ("operator %s unsupported for comma-separated list assignment", |
|
|
299 op.c_str ()); |
|
|
300 } |
|
5750
|
301 } |
|
5846
|
302 else |
|
|
303 error ("some elements undefined in return list"); |
|
|
304 } |
|
|
305 else |
|
|
306 { |
|
|
307 if (k < n) |
|
3977
|
308 { |
|
|
309 ult.assign (etype, rhs_val(k)); |
|
|
310 |
|
|
311 if (! error_state) |
|
3208
|
312 { |
|
3977
|
313 if (etype == octave_value::op_asn_eq) |
|
|
314 retval(k) = rhs_val(k); |
|
3208
|
315 else |
|
3977
|
316 retval(k) = ult.value (); |
|
5846
|
317 |
|
|
318 k++; |
|
2980
|
319 } |
|
|
320 } |
|
3208
|
321 else |
|
3977
|
322 error ("element number %d undefined in return list", k+1); |
|
5846
|
323 } |
|
2980
|
324 |
|
5846
|
325 if (error_state) |
|
|
326 { |
|
|
327 eval_error (); |
|
|
328 break; |
|
|
329 } |
|
|
330 else if (print_result ()) |
|
|
331 { |
|
|
332 // We clear any index here so that we can get |
|
|
333 // the new value of the referenced object below, |
|
|
334 // instead of the indexed value (which should be |
|
|
335 // the same as the right hand side value). |
|
3977
|
336 |
|
5846
|
337 ult.clear_index (); |
|
3208
|
338 |
|
5846
|
339 octave_value lhs_val = ult.value (); |
|
3977
|
340 |
|
5846
|
341 if (! error_state) |
|
|
342 lhs_val.print_with_name (octave_stdout, |
|
|
343 lhs_elt->name ()); |
|
2980
|
344 } |
|
3977
|
345 |
|
|
346 if (error_state) |
|
|
347 break; |
|
|
348 |
|
2980
|
349 } |
|
|
350 } |
|
|
351 } |
|
3208
|
352 else |
|
|
353 eval_error (); |
|
2980
|
354 |
|
3208
|
355 return retval; |
|
2980
|
356 } |
|
|
357 |
|
|
358 void |
|
|
359 tree_multi_assignment::eval_error (void) |
|
|
360 { |
|
3965
|
361 int l = line (); |
|
|
362 int c = column (); |
|
2980
|
363 |
|
3965
|
364 if (l != -1 && c != -1) |
|
|
365 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
366 l, c); |
|
2980
|
367 } |
|
|
368 |
|
3536
|
369 std::string |
|
3208
|
370 tree_multi_assignment::oper (void) const |
|
|
371 { |
|
|
372 return octave_value::assign_op_as_string (etype); |
|
|
373 } |
|
|
374 |
|
5861
|
375 tree_expression * |
|
|
376 tree_multi_assignment::dup (symbol_table *sym_tab) |
|
|
377 { |
|
|
378 tree_multi_assignment *new_ma |
|
|
379 = new tree_multi_assignment (lhs ? lhs->dup (sym_tab) : 0, |
|
|
380 rhs ? rhs->dup (sym_tab) : 0, |
|
|
381 preserve, etype); |
|
|
382 |
|
|
383 new_ma->copy_base (*this); |
|
|
384 |
|
|
385 return new_ma; |
|
|
386 } |
|
|
387 |
|
2980
|
388 void |
|
|
389 tree_multi_assignment::accept (tree_walker& tw) |
|
|
390 { |
|
|
391 tw.visit_multi_assignment (*this); |
|
|
392 } |
|
|
393 |
|
|
394 /* |
|
|
395 ;;; Local Variables: *** |
|
|
396 ;;; mode: C++ *** |
|
|
397 ;;; End: *** |
|
|
398 */ |
