|
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 |
|
|
36 #include "error.h" |
|
|
37 #include "oct-obj.h" |
|
|
38 #include "ov.h" |
|
|
39 #include "ov-usr-fcn.h" |
|
|
40 #include "pt-arg-list.h" |
|
|
41 #include "pt-exp.h" |
|
|
42 #include "pt-pr-code.h" |
|
|
43 #include "pt-walk.h" |
|
|
44 #include "toplev.h" |
|
|
45 |
|
|
46 // Argument lists. |
|
|
47 |
|
|
48 tree_argument_list::~tree_argument_list (void) |
|
|
49 { |
|
4212
|
50 while (! lst.empty ()) |
|
2982
|
51 { |
|
4212
|
52 tree_expression *t = lst.remove_front (); |
|
2982
|
53 delete t; |
|
|
54 } |
|
|
55 } |
|
|
56 |
|
3977
|
57 int |
|
|
58 tree_argument_list::nargout_count (void) const |
|
|
59 { |
|
|
60 int retval = 0; |
|
|
61 |
|
4212
|
62 for (Pix p = lst.first (); p != 0; lst.next (p)) |
|
3977
|
63 { |
|
4212
|
64 tree_expression *elt = lst (p); |
|
3977
|
65 |
|
|
66 // XXX FIXME XXX -- need to be able to determine whether elt is |
|
|
67 // an expression that could evaluate to a cs-list object, and if |
|
|
68 // so, how many elements are in that list. Ugly! |
|
|
69 |
|
|
70 retval++; |
|
|
71 } |
|
|
72 |
|
|
73 return retval; |
|
|
74 } |
|
|
75 |
|
2982
|
76 bool |
|
|
77 tree_argument_list::all_elements_are_constant (void) const |
|
|
78 { |
|
4212
|
79 for (Pix p = lst.first (); p != 0; lst.next (p)) |
|
2982
|
80 { |
|
4212
|
81 tree_expression *elt = lst (p); |
|
2982
|
82 |
|
|
83 if (! elt->is_constant ()) |
|
|
84 return false; |
|
|
85 } |
|
|
86 |
|
|
87 return true; |
|
|
88 } |
|
|
89 |
|
|
90 octave_value_list |
|
|
91 tree_argument_list::convert_to_const_vector (void) |
|
|
92 { |
|
|
93 int len = length (); |
|
|
94 |
|
|
95 // XXX FIXME XXX -- would be nice to know in advance how largs args |
|
|
96 // needs to be even when we have a list containing an all_va_args |
|
|
97 // token. |
|
|
98 |
|
|
99 octave_value_list args; |
|
3977
|
100 int args_len = len; |
|
|
101 args.resize (args_len); |
|
2982
|
102 |
|
4212
|
103 Pix p = lst.first (); |
|
2982
|
104 int j = 0; |
|
|
105 for (int k = 0; k < len; k++) |
|
|
106 { |
|
4212
|
107 tree_expression *elt = lst (p); |
|
2982
|
108 |
|
|
109 if (elt) |
|
|
110 { |
|
|
111 octave_value tmp = elt->rvalue (); |
|
|
112 |
|
|
113 if (error_state) |
|
|
114 { |
|
3162
|
115 ::error ("evaluating argument list element number %d", k+1); |
|
2982
|
116 args = octave_value_list (); |
|
|
117 break; |
|
|
118 } |
|
|
119 else |
|
|
120 { |
|
|
121 if (tmp.is_all_va_args ()) |
|
|
122 { |
|
|
123 if (curr_function) |
|
|
124 { |
|
|
125 octave_value_list tva; |
|
|
126 tva = curr_function->octave_all_va_args (); |
|
|
127 int n = tva.length (); |
|
3977
|
128 args_len += n - 1; |
|
|
129 args.resize (args_len); |
|
2982
|
130 for (int i = 0; i < n; i++) |
|
|
131 args(j++) = tva(i); |
|
|
132 } |
|
|
133 else |
|
|
134 { |
|
|
135 ::error ("all_va_args is only valid inside functions"); |
|
|
136 args = octave_value_list (); |
|
|
137 break; |
|
|
138 } |
|
|
139 } |
|
3977
|
140 else if (tmp.is_cs_list ()) |
|
|
141 { |
|
|
142 octave_value_list tl = tmp.list_value (); |
|
|
143 int n = tl.length (); |
|
|
144 args_len += n - 1; |
|
|
145 args.resize (args_len); |
|
|
146 for (int i = 0; i < n; i++) |
|
|
147 args(j++) = tl(i); |
|
|
148 } |
|
2982
|
149 else |
|
|
150 args(j++) = tmp; |
|
|
151 } |
|
|
152 next (p); |
|
|
153 } |
|
|
154 else |
|
|
155 { |
|
|
156 args(j++) = octave_value (); |
|
|
157 break; |
|
|
158 } |
|
|
159 } |
|
|
160 |
|
|
161 args.resize (j); |
|
|
162 |
|
|
163 return args; |
|
|
164 } |
|
|
165 |
|
|
166 string_vector |
|
|
167 tree_argument_list::get_arg_names (void) const |
|
|
168 { |
|
|
169 int len = length (); |
|
|
170 |
|
|
171 string_vector retval (len); |
|
|
172 |
|
|
173 int k = 0; |
|
|
174 |
|
4212
|
175 for (Pix p = lst.first (); p; lst.next (p)) |
|
2982
|
176 { |
|
4212
|
177 tree_expression *elt = lst (p); |
|
2982
|
178 |
|
2991
|
179 retval(k++) = elt->str_print_code (); |
|
2982
|
180 } |
|
|
181 |
|
|
182 return retval; |
|
|
183 } |
|
|
184 |
|
|
185 void |
|
|
186 tree_argument_list::accept (tree_walker& tw) |
|
|
187 { |
|
|
188 tw.visit_argument_list (*this); |
|
|
189 } |
|
|
190 |
|
|
191 /* |
|
|
192 ;;; Local Variables: *** |
|
|
193 ;;; mode: C++ *** |
|
|
194 ;;; End: *** |
|
|
195 */ |
