|
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 #if defined (__GNUG__) |
|
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
|
27 #ifdef HAVE_CONFIG_H |
|
|
28 #include <config.h> |
|
|
29 #endif |
|
|
30 |
|
3503
|
31 #include <iostream> |
|
|
32 #include <strstream> |
|
2980
|
33 |
|
|
34 #include "defun.h" |
|
|
35 #include "error.h" |
|
|
36 #include "input.h" |
|
|
37 #include "oct-obj.h" |
|
|
38 #include "oct-lvalue.h" |
|
|
39 #include "pager.h" |
|
|
40 #include "ov.h" |
|
2982
|
41 #include "pt-arg-list.h" |
|
3770
|
42 #include "pt-bp.h" |
|
2980
|
43 #include "pt-assign.h" |
|
|
44 #include "pt-walk.h" |
|
|
45 #include "utils.h" |
|
|
46 |
|
|
47 // TRUE means print the right hand side of an assignment instead of |
|
|
48 // the left. |
|
|
49 static bool Vprint_rhs_assign_val; |
|
|
50 |
|
|
51 // Simple assignment expressions. |
|
|
52 |
|
|
53 tree_simple_assignment::~tree_simple_assignment (void) |
|
|
54 { |
|
|
55 if (! preserve) |
|
|
56 delete lhs; |
|
|
57 |
|
|
58 delete rhs; |
|
|
59 } |
|
|
60 |
|
|
61 octave_value_list |
|
|
62 tree_simple_assignment::rvalue (int nargout) |
|
|
63 { |
|
|
64 octave_value_list retval; |
|
|
65 |
|
3770
|
66 MAYBE_DO_BREAKPOINT; |
|
|
67 |
|
2980
|
68 if (nargout > 1) |
|
|
69 error ("invalid number of output arguments for expression X = RHS"); |
|
|
70 else |
|
|
71 retval = rvalue (); |
|
|
72 |
|
|
73 return retval; |
|
|
74 } |
|
|
75 |
|
2984
|
76 // XXX FIXME XXX -- this works, but it would look a little better if |
|
|
77 // it were broken up into a couple of separate functions. |
|
|
78 |
|
2980
|
79 octave_value |
|
|
80 tree_simple_assignment::rvalue (void) |
|
|
81 { |
|
3208
|
82 octave_value retval; |
|
2980
|
83 |
|
|
84 if (error_state) |
|
3208
|
85 return retval; |
|
2980
|
86 |
|
|
87 if (rhs) |
|
|
88 { |
|
|
89 octave_value_list tmp = rhs->rvalue (); |
|
|
90 |
|
|
91 if (! (error_state || tmp.empty ())) |
|
|
92 { |
|
3208
|
93 octave_value rhs_val = tmp(0); |
|
2980
|
94 |
|
|
95 if (rhs_val.is_undefined ()) |
|
|
96 { |
|
|
97 error ("value on right hand side of assignment is undefined"); |
|
|
98 eval_error (); |
|
|
99 } |
|
|
100 else |
|
|
101 { |
|
|
102 octave_lvalue ult = lhs->lvalue (); |
|
|
103 |
|
|
104 if (error_state) |
|
|
105 eval_error (); |
|
|
106 else |
|
|
107 { |
|
|
108 ult.assign (etype, rhs_val); |
|
|
109 |
|
3215
|
110 if (! error_state) |
|
|
111 { |
|
3527
|
112 if (etype == octave_value::op_asn_eq) |
|
3215
|
113 retval = rhs_val; |
|
|
114 else |
|
|
115 retval = ult.value (); |
|
2984
|
116 |
|
3215
|
117 if (print_result ()) |
|
3208
|
118 { |
|
3215
|
119 if (Vprint_rhs_assign_val) |
|
|
120 retval.print_with_name (octave_stdout, |
|
|
121 lhs->str_print_code ()); |
|
|
122 else |
|
|
123 { |
|
|
124 // We clear any index here so that we can |
|
|
125 // get the new value of the referenced |
|
|
126 // object below, instead of the indexed |
|
|
127 // value (which should be the same as the |
|
|
128 // right hand side value). |
|
2980
|
129 |
|
3215
|
130 ult.clear_index (); |
|
3208
|
131 |
|
3215
|
132 octave_value lhs_val = ult.value (); |
|
3208
|
133 |
|
3215
|
134 if (! error_state) |
|
|
135 lhs_val.print_with_name (octave_stdout, |
|
|
136 lhs->name ()); |
|
|
137 } |
|
2980
|
138 } |
|
|
139 } |
|
3215
|
140 else |
|
|
141 eval_error (); |
|
2980
|
142 } |
|
|
143 } |
|
|
144 } |
|
|
145 else |
|
|
146 eval_error (); |
|
|
147 } |
|
|
148 |
|
3208
|
149 return retval; |
|
2980
|
150 } |
|
|
151 |
|
|
152 void |
|
|
153 tree_simple_assignment::eval_error (void) |
|
|
154 { |
|
3965
|
155 int l = line (); |
|
|
156 int c = column (); |
|
2980
|
157 |
|
3965
|
158 if (l != -1 && c != -1) |
|
|
159 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
160 l, c); |
|
2980
|
161 } |
|
|
162 |
|
3536
|
163 std::string |
|
2980
|
164 tree_simple_assignment::oper (void) const |
|
|
165 { |
|
|
166 return octave_value::assign_op_as_string (etype); |
|
|
167 } |
|
|
168 |
|
|
169 void |
|
|
170 tree_simple_assignment::accept (tree_walker& tw) |
|
|
171 { |
|
|
172 tw.visit_simple_assignment (*this); |
|
|
173 } |
|
|
174 |
|
|
175 // Multi-valued assignment expressions. |
|
|
176 |
|
|
177 tree_multi_assignment::~tree_multi_assignment (void) |
|
|
178 { |
|
|
179 if (! preserve) |
|
|
180 delete lhs; |
|
|
181 |
|
|
182 delete rhs; |
|
|
183 } |
|
|
184 |
|
|
185 octave_value |
|
|
186 tree_multi_assignment::rvalue (void) |
|
|
187 { |
|
|
188 octave_value retval; |
|
|
189 |
|
|
190 octave_value_list tmp = rvalue (1); |
|
|
191 |
|
|
192 if (! tmp.empty ()) |
|
|
193 retval = tmp(0); |
|
|
194 |
|
|
195 return retval; |
|
|
196 } |
|
|
197 |
|
2984
|
198 // XXX FIXME XXX -- this works, but it would look a little better if |
|
|
199 // it were broken up into a couple of separate functions. |
|
|
200 |
|
2980
|
201 octave_value_list |
|
|
202 tree_multi_assignment::rvalue (int) |
|
|
203 { |
|
3208
|
204 octave_value_list retval; |
|
2980
|
205 |
|
|
206 if (error_state) |
|
3208
|
207 return retval; |
|
2980
|
208 |
|
|
209 if (rhs) |
|
|
210 { |
|
|
211 int n_out = lhs->length (); |
|
|
212 |
|
3208
|
213 octave_value_list rhs_val = rhs->rvalue (n_out); |
|
2980
|
214 |
|
3208
|
215 if (! error_state) |
|
2980
|
216 { |
|
|
217 if (rhs_val.empty ()) |
|
|
218 { |
|
|
219 error ("value on right hand side of assignment is undefined"); |
|
|
220 eval_error (); |
|
|
221 } |
|
|
222 else |
|
|
223 { |
|
|
224 int k = 0; |
|
|
225 |
|
|
226 int n = rhs_val.length (); |
|
|
227 |
|
3208
|
228 retval.resize (n, octave_value ()); |
|
|
229 |
|
2980
|
230 for (Pix p = lhs->first (); p != 0; lhs->next (p)) |
|
|
231 { |
|
|
232 tree_expression *lhs_elt = lhs->operator () (p); |
|
|
233 |
|
|
234 if (lhs_elt) |
|
|
235 { |
|
|
236 octave_lvalue ult = lhs_elt->lvalue (); |
|
|
237 |
|
|
238 if (error_state) |
|
|
239 eval_error (); |
|
3208
|
240 else if (k < n) |
|
2980
|
241 { |
|
3208
|
242 ult.assign (etype, rhs_val(k)); |
|
|
243 |
|
3215
|
244 if (! error_state) |
|
|
245 { |
|
3527
|
246 if (etype == octave_value::op_asn_eq) |
|
3215
|
247 retval(k) = rhs_val(k); |
|
|
248 else |
|
|
249 retval(k) = ult.value (); |
|
|
250 } |
|
3208
|
251 } |
|
|
252 else |
|
|
253 error ("element number %d undefined in return list", |
|
|
254 k+1); |
|
2980
|
255 |
|
3208
|
256 if (error_state) |
|
|
257 eval_error (); |
|
|
258 else if (print_result ()) |
|
|
259 { |
|
|
260 if (Vprint_rhs_assign_val) |
|
|
261 retval(k).print_with_name |
|
|
262 (octave_stdout, lhs_elt->str_print_code ()); |
|
|
263 else |
|
2980
|
264 { |
|
3208
|
265 // We clear any index here so that we can |
|
|
266 // get the new value of the referenced |
|
|
267 // object below, instead of the indexed |
|
|
268 // value (which should be the same as the |
|
|
269 // right hand side value). |
|
2984
|
270 |
|
|
271 ult.clear_index (); |
|
2980
|
272 |
|
|
273 octave_value lhs_val = ult.value (); |
|
|
274 |
|
3208
|
275 if (! error_state) |
|
|
276 lhs_val.print_with_name (octave_stdout, |
|
|
277 lhs_elt->name ()); |
|
2980
|
278 } |
|
|
279 } |
|
|
280 } |
|
3208
|
281 else |
|
|
282 eval_error (); |
|
2980
|
283 |
|
|
284 if (error_state) |
|
|
285 break; |
|
3208
|
286 |
|
|
287 k++; |
|
2980
|
288 } |
|
|
289 } |
|
|
290 } |
|
|
291 } |
|
3208
|
292 else |
|
|
293 eval_error (); |
|
2980
|
294 |
|
3208
|
295 return retval; |
|
2980
|
296 } |
|
|
297 |
|
|
298 void |
|
|
299 tree_multi_assignment::eval_error (void) |
|
|
300 { |
|
3965
|
301 int l = line (); |
|
|
302 int c = column (); |
|
2980
|
303 |
|
3965
|
304 if (l != -1 && c != -1) |
|
|
305 ::error ("evaluating assignment expression near line %d, column %d", |
|
|
306 l, c); |
|
2980
|
307 } |
|
|
308 |
|
3536
|
309 std::string |
|
3208
|
310 tree_multi_assignment::oper (void) const |
|
|
311 { |
|
|
312 return octave_value::assign_op_as_string (etype); |
|
|
313 } |
|
|
314 |
|
2980
|
315 void |
|
|
316 tree_multi_assignment::accept (tree_walker& tw) |
|
|
317 { |
|
|
318 tw.visit_multi_assignment (*this); |
|
|
319 } |
|
|
320 |
|
|
321 static int |
|
|
322 print_rhs_assign_val (void) |
|
|
323 { |
|
|
324 Vprint_rhs_assign_val = check_preference ("print_rhs_assign_val"); |
|
|
325 |
|
|
326 return 0; |
|
|
327 } |
|
|
328 |
|
|
329 void |
|
|
330 symbols_of_pt_assign (void) |
|
|
331 { |
|
3258
|
332 DEFVAR (print_rhs_assign_val, 0.0, print_rhs_assign_val, |
|
3448
|
333 "-*- texinfo -*-\n\ |
|
|
334 @defvr print_rhs_assign_val\n\ |
|
|
335 If the value of this variable is non-zero, Octave will print the value\n\ |
|
|
336 of the right hand side of assignment expressions instead of the value\n\ |
|
|
337 of the left hand side (after the assignment).\n\ |
|
|
338 @end defvr"); |
|
|
339 |
|
2980
|
340 } |
|
|
341 |
|
|
342 /* |
|
|
343 ;;; Local Variables: *** |
|
|
344 ;;; mode: C++ *** |
|
|
345 ;;; End: *** |
|
|
346 */ |
