|
2982
|
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) |
|
2982
|
24 #pragma implementation |
|
|
25 #endif |
|
|
26 |
|
|
27 #ifdef HAVE_CONFIG_H |
|
|
28 #include <config.h> |
|
|
29 #endif |
|
|
30 |
|
3503
|
31 #include <iostream> |
|
2982
|
32 #include <string> |
|
|
33 |
|
|
34 #include "str-vec.h" |
|
|
35 |
|
4234
|
36 #include "defun.h" |
|
2982
|
37 #include "error.h" |
|
|
38 #include "oct-obj.h" |
|
|
39 #include "ov.h" |
|
|
40 #include "ov-usr-fcn.h" |
|
|
41 #include "pt-arg-list.h" |
|
|
42 #include "pt-exp.h" |
|
|
43 #include "pt-pr-code.h" |
|
|
44 #include "pt-walk.h" |
|
|
45 #include "toplev.h" |
|
4234
|
46 #include "unwind-prot.h" |
|
2982
|
47 |
|
|
48 // Argument lists. |
|
|
49 |
|
|
50 tree_argument_list::~tree_argument_list (void) |
|
|
51 { |
|
4219
|
52 while (! empty ()) |
|
2982
|
53 { |
|
4219
|
54 iterator p = begin (); |
|
|
55 delete *p; |
|
|
56 erase (p); |
|
2982
|
57 } |
|
|
58 } |
|
|
59 |
|
4267
|
60 bool |
|
|
61 tree_argument_list::has_magic_end (void) const |
|
|
62 { |
|
|
63 for (const_iterator p = begin (); p != end (); p++) |
|
|
64 { |
|
|
65 tree_expression *elt = *p; |
|
|
66 |
|
|
67 if (elt && elt->has_magic_end ()) |
|
|
68 return true; |
|
|
69 } |
|
|
70 |
|
|
71 return false; |
|
|
72 } |
|
|
73 |
|
4258
|
74 void |
|
|
75 tree_argument_list::append (const element_type& s) |
|
|
76 { |
|
|
77 octave_base_list<tree_expression *>::append (s); |
|
|
78 |
|
4267
|
79 if (! list_includes_magic_end && s && s->has_magic_end ()) |
|
|
80 list_includes_magic_end = true; |
|
4258
|
81 } |
|
|
82 |
|
3977
|
83 int |
|
|
84 tree_argument_list::nargout_count (void) const |
|
|
85 { |
|
|
86 int retval = 0; |
|
|
87 |
|
4219
|
88 for (const_iterator p = begin (); p != end (); p++) |
|
3977
|
89 { |
|
4219
|
90 tree_expression *elt = *p; |
|
3977
|
91 |
|
|
92 // XXX FIXME XXX -- need to be able to determine whether elt is |
|
|
93 // an expression that could evaluate to a cs-list object, and if |
|
|
94 // so, how many elements are in that list. Ugly! |
|
|
95 |
|
|
96 retval++; |
|
|
97 } |
|
|
98 |
|
|
99 return retval; |
|
|
100 } |
|
|
101 |
|
2982
|
102 bool |
|
|
103 tree_argument_list::all_elements_are_constant (void) const |
|
|
104 { |
|
4219
|
105 for (const_iterator p = begin (); p != end (); p++) |
|
2982
|
106 { |
|
4219
|
107 tree_expression *elt = *p; |
|
2982
|
108 |
|
|
109 if (! elt->is_constant ()) |
|
|
110 return false; |
|
|
111 } |
|
|
112 |
|
|
113 return true; |
|
|
114 } |
|
|
115 |
|
4234
|
116 static const octave_value *indexed_object = 0; |
|
|
117 static int index_position = 0; |
|
|
118 |
|
|
119 DEFCONSTFUN (__end__, , , |
|
|
120 "internal function") |
|
|
121 { |
|
|
122 octave_value retval; |
|
|
123 |
|
|
124 if (indexed_object) |
|
|
125 { |
|
4671
|
126 dim_vector dv = indexed_object->dims (); |
|
|
127 |
|
4234
|
128 switch (index_position) |
|
|
129 { |
|
|
130 case -1: |
|
4255
|
131 { |
|
5082
|
132 // We want numel = prod (size ()) here, so don't use |
|
5081
|
133 // index_object->numel () as that may be different (it is |
|
|
134 // the number of nonzero elements for sparse arrays). |
|
|
135 |
|
|
136 int numel = dv.numel (); |
|
4256
|
137 |
|
4671
|
138 if (numel < 0) |
|
|
139 { |
|
|
140 std::string dv_str = dv.str (); |
|
|
141 ::error ("invalid use of end: (index 1, dims %s)", |
|
|
142 dv_str.c_str ()); |
|
|
143 } |
|
4256
|
144 else |
|
4671
|
145 retval = numel; |
|
4256
|
146 } |
|
4234
|
147 break; |
|
|
148 |
|
|
149 default: |
|
4671
|
150 { |
|
|
151 |
|
|
152 if (index_position < dv.length ()) |
|
|
153 retval = dv(index_position); |
|
|
154 else |
|
|
155 { |
|
|
156 std::string dv_str = dv.str (); |
|
|
157 ::error ("invalid use of end: (index %d, dims %s)", |
|
|
158 index_position+1, dv_str.c_str ()); |
|
|
159 } |
|
|
160 } |
|
4234
|
161 break; |
|
|
162 } |
|
|
163 } |
|
|
164 else |
|
4256
|
165 ::error ("invalid use of end"); |
|
4234
|
166 |
|
|
167 return retval; |
|
|
168 } |
|
|
169 |
|
2982
|
170 octave_value_list |
|
4234
|
171 tree_argument_list::convert_to_const_vector (const octave_value *object) |
|
2982
|
172 { |
|
4256
|
173 // END doesn't make sense for functions. Maybe we need a different |
|
|
174 // way of asking an octave_value object this question? |
|
|
175 |
|
4258
|
176 bool stash_object = (list_includes_magic_end |
|
5087
|
177 && object |
|
|
178 && ! (object->is_function () |
|
|
179 || object->is_function_handle ())); |
|
4234
|
180 |
|
4256
|
181 if (stash_object) |
|
|
182 { |
|
|
183 unwind_protect::begin_frame ("convert_to_const_vector"); |
|
4234
|
184 |
|
4256
|
185 unwind_protect_ptr (indexed_object); |
|
|
186 |
|
|
187 indexed_object = object; |
|
|
188 } |
|
4234
|
189 |
|
2982
|
190 int len = length (); |
|
|
191 |
|
|
192 // XXX FIXME XXX -- would be nice to know in advance how largs args |
|
|
193 // needs to be even when we have a list containing an all_va_args |
|
|
194 // token. |
|
|
195 |
|
|
196 octave_value_list args; |
|
3977
|
197 int args_len = len; |
|
|
198 args.resize (args_len); |
|
2982
|
199 |
|
4219
|
200 iterator p = begin (); |
|
2982
|
201 int j = 0; |
|
|
202 for (int k = 0; k < len; k++) |
|
|
203 { |
|
4974
|
204 if (stash_object) |
|
|
205 { |
|
|
206 unwind_protect_int (index_position); |
|
|
207 |
|
|
208 index_position = (len == 1) ? -1 : k; |
|
|
209 } |
|
4234
|
210 |
|
4219
|
211 tree_expression *elt = *p++; |
|
2982
|
212 |
|
|
213 if (elt) |
|
|
214 { |
|
|
215 octave_value tmp = elt->rvalue (); |
|
|
216 |
|
|
217 if (error_state) |
|
|
218 { |
|
3162
|
219 ::error ("evaluating argument list element number %d", k+1); |
|
2982
|
220 args = octave_value_list (); |
|
|
221 break; |
|
|
222 } |
|
|
223 else |
|
|
224 { |
|
|
225 if (tmp.is_all_va_args ()) |
|
|
226 { |
|
|
227 if (curr_function) |
|
|
228 { |
|
|
229 octave_value_list tva; |
|
|
230 tva = curr_function->octave_all_va_args (); |
|
|
231 int n = tva.length (); |
|
3977
|
232 args_len += n - 1; |
|
|
233 args.resize (args_len); |
|
2982
|
234 for (int i = 0; i < n; i++) |
|
|
235 args(j++) = tva(i); |
|
|
236 } |
|
|
237 else |
|
|
238 { |
|
|
239 ::error ("all_va_args is only valid inside functions"); |
|
|
240 args = octave_value_list (); |
|
|
241 break; |
|
|
242 } |
|
|
243 } |
|
3977
|
244 else if (tmp.is_cs_list ()) |
|
|
245 { |
|
|
246 octave_value_list tl = tmp.list_value (); |
|
|
247 int n = tl.length (); |
|
|
248 args_len += n - 1; |
|
|
249 args.resize (args_len); |
|
|
250 for (int i = 0; i < n; i++) |
|
|
251 args(j++) = tl(i); |
|
|
252 } |
|
2982
|
253 else |
|
|
254 args(j++) = tmp; |
|
|
255 } |
|
|
256 } |
|
|
257 else |
|
|
258 { |
|
|
259 args(j++) = octave_value (); |
|
|
260 break; |
|
|
261 } |
|
|
262 } |
|
|
263 |
|
|
264 args.resize (j); |
|
|
265 |
|
4256
|
266 if (stash_object) |
|
|
267 unwind_protect::run_frame ("convert_to_const_vector"); |
|
4234
|
268 |
|
2982
|
269 return args; |
|
|
270 } |
|
|
271 |
|
|
272 string_vector |
|
|
273 tree_argument_list::get_arg_names (void) const |
|
|
274 { |
|
|
275 int len = length (); |
|
|
276 |
|
|
277 string_vector retval (len); |
|
|
278 |
|
|
279 int k = 0; |
|
|
280 |
|
4219
|
281 for (const_iterator p = begin (); p != end (); p++) |
|
2982
|
282 { |
|
4219
|
283 tree_expression *elt = *p; |
|
2982
|
284 |
|
2991
|
285 retval(k++) = elt->str_print_code (); |
|
2982
|
286 } |
|
|
287 |
|
|
288 return retval; |
|
|
289 } |
|
|
290 |
|
|
291 void |
|
|
292 tree_argument_list::accept (tree_walker& tw) |
|
|
293 { |
|
|
294 tw.visit_argument_list (*this); |
|
|
295 } |
|
|
296 |
|
|
297 /* |
|
|
298 ;;; Local Variables: *** |
|
|
299 ;;; mode: C++ *** |
|
|
300 ;;; End: *** |
|
|
301 */ |
