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