Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Perform non-arithmetic operations on values, for GDB. |
990a07ab | 2 | |
61baf725 | 3 | Copyright (C) 1986-2017 Free Software Foundation, Inc. |
c906108c | 4 | |
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 10 | (at your option) any later version. |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b | 17 | You should have received a copy of the GNU General Public License |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
19 | |
20 | #include "defs.h" | |
21 | #include "symtab.h" | |
22 | #include "gdbtypes.h" | |
23 | #include "value.h" | |
24 | #include "frame.h" | |
25 | #include "inferior.h" | |
26 | #include "gdbcore.h" | |
27 | #include "target.h" | |
28 | #include "demangle.h" | |
29 | #include "language.h" | |
30 | #include "gdbcmd.h" | |
4e052eda | 31 | #include "regcache.h" |
015a42b4 | 32 | #include "cp-abi.h" |
fe898f56 | 33 | #include "block.h" |
04714b91 | 34 | #include "infcall.h" |
de4f826b | 35 | #include "dictionary.h" |
b6429628 | 36 | #include "cp-support.h" |
4ef30785 | 37 | #include "dfp.h" |
e6ca34fc | 38 | #include "tracepoint.h" |
f4c5303c | 39 | #include "observer.h" |
3e3b026f | 40 | #include "objfiles.h" |
233e8b28 | 41 | #include "extension.h" |
26fcd5d7 | 42 | #include "byte-vector.h" |
c906108c | 43 | |
ccce17b0 | 44 | extern unsigned int overload_debug; |
c906108c SS |
45 | /* Local functions. */ |
46 | ||
ad2f7632 DJ |
47 | static int typecmp (int staticp, int varargs, int nargs, |
48 | struct field t1[], struct value *t2[]); | |
c906108c | 49 | |
714f19d5 | 50 | static struct value *search_struct_field (const char *, struct value *, |
8a13d42d | 51 | struct type *, int); |
c906108c | 52 | |
714f19d5 TT |
53 | static struct value *search_struct_method (const char *, struct value **, |
54 | struct value **, | |
6b850546 | 55 | LONGEST, int *, struct type *); |
c906108c | 56 | |
da096638 | 57 | static int find_oload_champ_namespace (struct value **, int, |
ac3eeb49 MS |
58 | const char *, const char *, |
59 | struct symbol ***, | |
7322dca9 SW |
60 | struct badness_vector **, |
61 | const int no_adl); | |
8d577d32 DC |
62 | |
63 | static | |
da096638 | 64 | int find_oload_champ_namespace_loop (struct value **, int, |
ac3eeb49 MS |
65 | const char *, const char *, |
66 | int, struct symbol ***, | |
7322dca9 SW |
67 | struct badness_vector **, int *, |
68 | const int no_adl); | |
ac3eeb49 | 69 | |
9cf95373 | 70 | static int find_oload_champ (struct value **, int, int, |
233e8b28 SC |
71 | struct fn_field *, VEC (xmethod_worker_ptr) *, |
72 | struct symbol **, struct badness_vector **); | |
ac3eeb49 | 73 | |
2bca57ba | 74 | static int oload_method_static_p (struct fn_field *, int); |
8d577d32 DC |
75 | |
76 | enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE }; | |
77 | ||
78 | static enum | |
ac3eeb49 MS |
79 | oload_classification classify_oload_match (struct badness_vector *, |
80 | int, int); | |
8d577d32 | 81 | |
ac3eeb49 MS |
82 | static struct value *value_struct_elt_for_reference (struct type *, |
83 | int, struct type *, | |
c848d642 | 84 | const char *, |
ac3eeb49 MS |
85 | struct type *, |
86 | int, enum noside); | |
79c2c32d | 87 | |
ac3eeb49 | 88 | static struct value *value_namespace_elt (const struct type *, |
c848d642 | 89 | const char *, int , enum noside); |
79c2c32d | 90 | |
ac3eeb49 | 91 | static struct value *value_maybe_namespace_elt (const struct type *, |
c848d642 | 92 | const char *, int, |
ac3eeb49 | 93 | enum noside); |
63d06c5c | 94 | |
a14ed312 | 95 | static CORE_ADDR allocate_space_in_inferior (int); |
c906108c | 96 | |
f23631e4 | 97 | static struct value *cast_into_complex (struct type *, struct value *); |
c906108c | 98 | |
233e8b28 | 99 | static void find_method_list (struct value **, const char *, |
6b850546 | 100 | LONGEST, struct type *, struct fn_field **, int *, |
233e8b28 | 101 | VEC (xmethod_worker_ptr) **, |
6b850546 | 102 | struct type **, LONGEST *); |
7a292a7a | 103 | |
c906108c | 104 | #if 0 |
ac3eeb49 MS |
105 | /* Flag for whether we want to abandon failed expression evals by |
106 | default. */ | |
107 | ||
c906108c SS |
108 | static int auto_abandon = 0; |
109 | #endif | |
110 | ||
111 | int overload_resolution = 0; | |
920d2a44 AC |
112 | static void |
113 | show_overload_resolution (struct ui_file *file, int from_tty, | |
ac3eeb49 MS |
114 | struct cmd_list_element *c, |
115 | const char *value) | |
920d2a44 | 116 | { |
3e43a32a MS |
117 | fprintf_filtered (file, _("Overload resolution in evaluating " |
118 | "C++ functions is %s.\n"), | |
920d2a44 AC |
119 | value); |
120 | } | |
242bfc55 | 121 | |
3e3b026f UW |
122 | /* Find the address of function name NAME in the inferior. If OBJF_P |
123 | is non-NULL, *OBJF_P will be set to the OBJFILE where the function | |
124 | is defined. */ | |
c906108c | 125 | |
f23631e4 | 126 | struct value * |
3e3b026f | 127 | find_function_in_inferior (const char *name, struct objfile **objf_p) |
c906108c | 128 | { |
d12307c1 | 129 | struct block_symbol sym; |
a109c7c1 | 130 | |
2570f2b7 | 131 | sym = lookup_symbol (name, 0, VAR_DOMAIN, 0); |
d12307c1 | 132 | if (sym.symbol != NULL) |
c906108c | 133 | { |
d12307c1 | 134 | if (SYMBOL_CLASS (sym.symbol) != LOC_BLOCK) |
c906108c | 135 | { |
8a3fe4f8 | 136 | error (_("\"%s\" exists in this program but is not a function."), |
c906108c SS |
137 | name); |
138 | } | |
3e3b026f UW |
139 | |
140 | if (objf_p) | |
d12307c1 | 141 | *objf_p = symbol_objfile (sym.symbol); |
3e3b026f | 142 | |
d12307c1 | 143 | return value_of_variable (sym.symbol, sym.block); |
c906108c SS |
144 | } |
145 | else | |
146 | { | |
7c7b6655 TT |
147 | struct bound_minimal_symbol msymbol = |
148 | lookup_bound_minimal_symbol (name); | |
a109c7c1 | 149 | |
7c7b6655 | 150 | if (msymbol.minsym != NULL) |
c906108c | 151 | { |
7c7b6655 | 152 | struct objfile *objfile = msymbol.objfile; |
3e3b026f UW |
153 | struct gdbarch *gdbarch = get_objfile_arch (objfile); |
154 | ||
c906108c | 155 | struct type *type; |
4478b372 | 156 | CORE_ADDR maddr; |
3e3b026f | 157 | type = lookup_pointer_type (builtin_type (gdbarch)->builtin_char); |
c906108c SS |
158 | type = lookup_function_type (type); |
159 | type = lookup_pointer_type (type); | |
77e371c0 | 160 | maddr = BMSYMBOL_VALUE_ADDRESS (msymbol); |
3e3b026f UW |
161 | |
162 | if (objf_p) | |
163 | *objf_p = objfile; | |
164 | ||
4478b372 | 165 | return value_from_pointer (type, maddr); |
c906108c SS |
166 | } |
167 | else | |
168 | { | |
c5aa993b | 169 | if (!target_has_execution) |
3e43a32a MS |
170 | error (_("evaluation of this expression " |
171 | "requires the target program to be active")); | |
c5aa993b | 172 | else |
3e43a32a MS |
173 | error (_("evaluation of this expression requires the " |
174 | "program to have a function \"%s\"."), | |
175 | name); | |
c906108c SS |
176 | } |
177 | } | |
178 | } | |
179 | ||
ac3eeb49 MS |
180 | /* Allocate NBYTES of space in the inferior using the inferior's |
181 | malloc and return a value that is a pointer to the allocated | |
182 | space. */ | |
c906108c | 183 | |
f23631e4 | 184 | struct value * |
fba45db2 | 185 | value_allocate_space_in_inferior (int len) |
c906108c | 186 | { |
3e3b026f UW |
187 | struct objfile *objf; |
188 | struct value *val = find_function_in_inferior ("malloc", &objf); | |
189 | struct gdbarch *gdbarch = get_objfile_arch (objf); | |
f23631e4 | 190 | struct value *blocklen; |
c906108c | 191 | |
3e3b026f | 192 | blocklen = value_from_longest (builtin_type (gdbarch)->builtin_int, len); |
7022349d | 193 | val = call_function_by_hand (val, NULL, 1, &blocklen); |
c906108c SS |
194 | if (value_logical_not (val)) |
195 | { | |
196 | if (!target_has_execution) | |
3e43a32a MS |
197 | error (_("No memory available to program now: " |
198 | "you need to start the target first")); | |
c5aa993b | 199 | else |
8a3fe4f8 | 200 | error (_("No memory available to program: call to malloc failed")); |
c906108c SS |
201 | } |
202 | return val; | |
203 | } | |
204 | ||
205 | static CORE_ADDR | |
fba45db2 | 206 | allocate_space_in_inferior (int len) |
c906108c SS |
207 | { |
208 | return value_as_long (value_allocate_space_in_inferior (len)); | |
209 | } | |
210 | ||
6af87b03 AR |
211 | /* Cast struct value VAL to type TYPE and return as a value. |
212 | Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION | |
694182d2 DJ |
213 | for this to work. Typedef to one of the codes is permitted. |
214 | Returns NULL if the cast is neither an upcast nor a downcast. */ | |
6af87b03 AR |
215 | |
216 | static struct value * | |
217 | value_cast_structs (struct type *type, struct value *v2) | |
218 | { | |
219 | struct type *t1; | |
220 | struct type *t2; | |
221 | struct value *v; | |
222 | ||
223 | gdb_assert (type != NULL && v2 != NULL); | |
224 | ||
225 | t1 = check_typedef (type); | |
226 | t2 = check_typedef (value_type (v2)); | |
227 | ||
228 | /* Check preconditions. */ | |
229 | gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT | |
230 | || TYPE_CODE (t1) == TYPE_CODE_UNION) | |
231 | && !!"Precondition is that type is of STRUCT or UNION kind."); | |
232 | gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT | |
233 | || TYPE_CODE (t2) == TYPE_CODE_UNION) | |
234 | && !!"Precondition is that value is of STRUCT or UNION kind"); | |
235 | ||
191ca0a1 CM |
236 | if (TYPE_NAME (t1) != NULL |
237 | && TYPE_NAME (t2) != NULL | |
238 | && !strcmp (TYPE_NAME (t1), TYPE_NAME (t2))) | |
239 | return NULL; | |
240 | ||
6af87b03 AR |
241 | /* Upcasting: look in the type of the source to see if it contains the |
242 | type of the target as a superclass. If so, we'll need to | |
243 | offset the pointer rather than just change its type. */ | |
244 | if (TYPE_NAME (t1) != NULL) | |
245 | { | |
246 | v = search_struct_field (type_name_no_tag (t1), | |
8a13d42d | 247 | v2, t2, 1); |
6af87b03 AR |
248 | if (v) |
249 | return v; | |
250 | } | |
251 | ||
252 | /* Downcasting: look in the type of the target to see if it contains the | |
253 | type of the source as a superclass. If so, we'll need to | |
9c3c02fd | 254 | offset the pointer rather than just change its type. */ |
6af87b03 AR |
255 | if (TYPE_NAME (t2) != NULL) |
256 | { | |
9c3c02fd | 257 | /* Try downcasting using the run-time type of the value. */ |
6b850546 DT |
258 | int full, using_enc; |
259 | LONGEST top; | |
9c3c02fd TT |
260 | struct type *real_type; |
261 | ||
262 | real_type = value_rtti_type (v2, &full, &top, &using_enc); | |
263 | if (real_type) | |
264 | { | |
265 | v = value_full_object (v2, real_type, full, top, using_enc); | |
266 | v = value_at_lazy (real_type, value_address (v)); | |
9f1f738a | 267 | real_type = value_type (v); |
9c3c02fd TT |
268 | |
269 | /* We might be trying to cast to the outermost enclosing | |
270 | type, in which case search_struct_field won't work. */ | |
271 | if (TYPE_NAME (real_type) != NULL | |
272 | && !strcmp (TYPE_NAME (real_type), TYPE_NAME (t1))) | |
273 | return v; | |
274 | ||
8a13d42d | 275 | v = search_struct_field (type_name_no_tag (t2), v, real_type, 1); |
9c3c02fd TT |
276 | if (v) |
277 | return v; | |
278 | } | |
279 | ||
280 | /* Try downcasting using information from the destination type | |
281 | T2. This wouldn't work properly for classes with virtual | |
282 | bases, but those were handled above. */ | |
6af87b03 | 283 | v = search_struct_field (type_name_no_tag (t2), |
8a13d42d | 284 | value_zero (t1, not_lval), t1, 1); |
6af87b03 AR |
285 | if (v) |
286 | { | |
287 | /* Downcasting is possible (t1 is superclass of v2). */ | |
42ae5230 | 288 | CORE_ADDR addr2 = value_address (v2); |
a109c7c1 | 289 | |
42ae5230 | 290 | addr2 -= value_address (v) + value_embedded_offset (v); |
6af87b03 AR |
291 | return value_at (type, addr2); |
292 | } | |
293 | } | |
694182d2 DJ |
294 | |
295 | return NULL; | |
6af87b03 AR |
296 | } |
297 | ||
fb933624 DJ |
298 | /* Cast one pointer or reference type to another. Both TYPE and |
299 | the type of ARG2 should be pointer types, or else both should be | |
b1af9e97 TT |
300 | reference types. If SUBCLASS_CHECK is non-zero, this will force a |
301 | check to see whether TYPE is a superclass of ARG2's type. If | |
302 | SUBCLASS_CHECK is zero, then the subclass check is done only when | |
303 | ARG2 is itself non-zero. Returns the new pointer or reference. */ | |
fb933624 DJ |
304 | |
305 | struct value * | |
b1af9e97 TT |
306 | value_cast_pointers (struct type *type, struct value *arg2, |
307 | int subclass_check) | |
fb933624 | 308 | { |
d160942f | 309 | struct type *type1 = check_typedef (type); |
fb933624 | 310 | struct type *type2 = check_typedef (value_type (arg2)); |
d160942f | 311 | struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type1)); |
fb933624 DJ |
312 | struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2)); |
313 | ||
314 | if (TYPE_CODE (t1) == TYPE_CODE_STRUCT | |
315 | && TYPE_CODE (t2) == TYPE_CODE_STRUCT | |
b1af9e97 | 316 | && (subclass_check || !value_logical_not (arg2))) |
fb933624 | 317 | { |
6af87b03 | 318 | struct value *v2; |
fb933624 | 319 | |
aa006118 | 320 | if (TYPE_IS_REFERENCE (type2)) |
6af87b03 AR |
321 | v2 = coerce_ref (arg2); |
322 | else | |
323 | v2 = value_ind (arg2); | |
3e43a32a MS |
324 | gdb_assert (TYPE_CODE (check_typedef (value_type (v2))) |
325 | == TYPE_CODE_STRUCT && !!"Why did coercion fail?"); | |
6af87b03 AR |
326 | v2 = value_cast_structs (t1, v2); |
327 | /* At this point we have what we can have, un-dereference if needed. */ | |
328 | if (v2) | |
fb933624 | 329 | { |
6af87b03 | 330 | struct value *v = value_addr (v2); |
a109c7c1 | 331 | |
6af87b03 AR |
332 | deprecated_set_value_type (v, type); |
333 | return v; | |
fb933624 | 334 | } |
8301c89e | 335 | } |
fb933624 DJ |
336 | |
337 | /* No superclass found, just change the pointer type. */ | |
0d5de010 | 338 | arg2 = value_copy (arg2); |
fb933624 | 339 | deprecated_set_value_type (arg2, type); |
4dfea560 | 340 | set_value_enclosing_type (arg2, type); |
fb933624 DJ |
341 | set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */ |
342 | return arg2; | |
343 | } | |
344 | ||
c906108c SS |
345 | /* Cast value ARG2 to type TYPE and return as a value. |
346 | More general than a C cast: accepts any two types of the same length, | |
347 | and if ARG2 is an lvalue it can be cast into anything at all. */ | |
348 | /* In C++, casts may change pointer or object representations. */ | |
349 | ||
f23631e4 AC |
350 | struct value * |
351 | value_cast (struct type *type, struct value *arg2) | |
c906108c | 352 | { |
52f0bd74 AC |
353 | enum type_code code1; |
354 | enum type_code code2; | |
355 | int scalar; | |
c906108c SS |
356 | struct type *type2; |
357 | ||
358 | int convert_to_boolean = 0; | |
c5aa993b | 359 | |
df407dfe | 360 | if (value_type (arg2) == type) |
c906108c SS |
361 | return arg2; |
362 | ||
6af87b03 | 363 | /* Check if we are casting struct reference to struct reference. */ |
aa006118 | 364 | if (TYPE_IS_REFERENCE (check_typedef (type))) |
6af87b03 AR |
365 | { |
366 | /* We dereference type; then we recurse and finally | |
581e13c1 | 367 | we generate value of the given reference. Nothing wrong with |
6af87b03 AR |
368 | that. */ |
369 | struct type *t1 = check_typedef (type); | |
370 | struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1)); | |
aa006118 | 371 | struct value *val = value_cast (dereftype, arg2); |
a109c7c1 | 372 | |
a65cfae5 | 373 | return value_ref (val, TYPE_CODE (t1)); |
6af87b03 AR |
374 | } |
375 | ||
aa006118 | 376 | if (TYPE_IS_REFERENCE (check_typedef (value_type (arg2)))) |
6af87b03 AR |
377 | /* We deref the value and then do the cast. */ |
378 | return value_cast (type, coerce_ref (arg2)); | |
379 | ||
c973d0aa PA |
380 | /* Strip typedefs / resolve stubs in order to get at the type's |
381 | code/length, but remember the original type, to use as the | |
382 | resulting type of the cast, in case it was a typedef. */ | |
383 | struct type *to_type = type; | |
384 | ||
f168693b | 385 | type = check_typedef (type); |
c906108c | 386 | code1 = TYPE_CODE (type); |
994b9211 | 387 | arg2 = coerce_ref (arg2); |
df407dfe | 388 | type2 = check_typedef (value_type (arg2)); |
c906108c | 389 | |
fb933624 DJ |
390 | /* You can't cast to a reference type. See value_cast_pointers |
391 | instead. */ | |
aa006118 | 392 | gdb_assert (!TYPE_IS_REFERENCE (type)); |
fb933624 | 393 | |
ac3eeb49 MS |
394 | /* A cast to an undetermined-length array_type, such as |
395 | (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT, | |
396 | where N is sizeof(OBJECT)/sizeof(TYPE). */ | |
c906108c SS |
397 | if (code1 == TYPE_CODE_ARRAY) |
398 | { | |
399 | struct type *element_type = TYPE_TARGET_TYPE (type); | |
400 | unsigned element_length = TYPE_LENGTH (check_typedef (element_type)); | |
a109c7c1 | 401 | |
d78df370 | 402 | if (element_length > 0 && TYPE_ARRAY_UPPER_BOUND_IS_UNDEFINED (type)) |
c906108c SS |
403 | { |
404 | struct type *range_type = TYPE_INDEX_TYPE (type); | |
405 | int val_length = TYPE_LENGTH (type2); | |
406 | LONGEST low_bound, high_bound, new_length; | |
a109c7c1 | 407 | |
c906108c SS |
408 | if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0) |
409 | low_bound = 0, high_bound = 0; | |
410 | new_length = val_length / element_length; | |
411 | if (val_length % element_length != 0) | |
3e43a32a MS |
412 | warning (_("array element type size does not " |
413 | "divide object size in cast")); | |
ac3eeb49 MS |
414 | /* FIXME-type-allocation: need a way to free this type when |
415 | we are done with it. */ | |
0c9c3474 SA |
416 | range_type = create_static_range_type ((struct type *) NULL, |
417 | TYPE_TARGET_TYPE (range_type), | |
418 | low_bound, | |
419 | new_length + low_bound - 1); | |
ac3eeb49 MS |
420 | deprecated_set_value_type (arg2, |
421 | create_array_type ((struct type *) NULL, | |
422 | element_type, | |
423 | range_type)); | |
c906108c SS |
424 | return arg2; |
425 | } | |
426 | } | |
427 | ||
428 | if (current_language->c_style_arrays | |
3bdf2bbd KW |
429 | && TYPE_CODE (type2) == TYPE_CODE_ARRAY |
430 | && !TYPE_VECTOR (type2)) | |
c906108c SS |
431 | arg2 = value_coerce_array (arg2); |
432 | ||
433 | if (TYPE_CODE (type2) == TYPE_CODE_FUNC) | |
434 | arg2 = value_coerce_function (arg2); | |
435 | ||
df407dfe | 436 | type2 = check_typedef (value_type (arg2)); |
c906108c SS |
437 | code2 = TYPE_CODE (type2); |
438 | ||
439 | if (code1 == TYPE_CODE_COMPLEX) | |
c973d0aa | 440 | return cast_into_complex (to_type, arg2); |
c906108c SS |
441 | if (code1 == TYPE_CODE_BOOL) |
442 | { | |
443 | code1 = TYPE_CODE_INT; | |
444 | convert_to_boolean = 1; | |
445 | } | |
446 | if (code1 == TYPE_CODE_CHAR) | |
447 | code1 = TYPE_CODE_INT; | |
448 | if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR) | |
449 | code2 = TYPE_CODE_INT; | |
450 | ||
451 | scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT | |
4ef30785 TJB |
452 | || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM |
453 | || code2 == TYPE_CODE_RANGE); | |
c906108c | 454 | |
6af87b03 AR |
455 | if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION) |
456 | && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION) | |
c906108c | 457 | && TYPE_NAME (type) != 0) |
694182d2 | 458 | { |
c973d0aa | 459 | struct value *v = value_cast_structs (to_type, arg2); |
a109c7c1 | 460 | |
694182d2 DJ |
461 | if (v) |
462 | return v; | |
463 | } | |
464 | ||
c906108c | 465 | if (code1 == TYPE_CODE_FLT && scalar) |
c973d0aa | 466 | return value_from_double (to_type, value_as_double (arg2)); |
4ef30785 TJB |
467 | else if (code1 == TYPE_CODE_DECFLOAT && scalar) |
468 | { | |
e17a4113 | 469 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
4ef30785 TJB |
470 | int dec_len = TYPE_LENGTH (type); |
471 | gdb_byte dec[16]; | |
472 | ||
473 | if (code2 == TYPE_CODE_FLT) | |
e17a4113 | 474 | decimal_from_floating (arg2, dec, dec_len, byte_order); |
4ef30785 TJB |
475 | else if (code2 == TYPE_CODE_DECFLOAT) |
476 | decimal_convert (value_contents (arg2), TYPE_LENGTH (type2), | |
e17a4113 | 477 | byte_order, dec, dec_len, byte_order); |
4ef30785 TJB |
478 | else |
479 | /* The only option left is an integral type. */ | |
e17a4113 | 480 | decimal_from_integral (arg2, dec, dec_len, byte_order); |
4ef30785 | 481 | |
c973d0aa | 482 | return value_from_decfloat (to_type, dec); |
4ef30785 | 483 | } |
c906108c SS |
484 | else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM |
485 | || code1 == TYPE_CODE_RANGE) | |
0d5de010 DJ |
486 | && (scalar || code2 == TYPE_CODE_PTR |
487 | || code2 == TYPE_CODE_MEMBERPTR)) | |
c906108c SS |
488 | { |
489 | LONGEST longest; | |
c5aa993b | 490 | |
2bf1f4a1 | 491 | /* When we cast pointers to integers, we mustn't use |
76e71323 | 492 | gdbarch_pointer_to_address to find the address the pointer |
2bf1f4a1 JB |
493 | represents, as value_as_long would. GDB should evaluate |
494 | expressions just as the compiler would --- and the compiler | |
495 | sees a cast as a simple reinterpretation of the pointer's | |
496 | bits. */ | |
497 | if (code2 == TYPE_CODE_PTR) | |
e17a4113 UW |
498 | longest = extract_unsigned_integer |
499 | (value_contents (arg2), TYPE_LENGTH (type2), | |
500 | gdbarch_byte_order (get_type_arch (type2))); | |
2bf1f4a1 JB |
501 | else |
502 | longest = value_as_long (arg2); | |
c973d0aa | 503 | return value_from_longest (to_type, convert_to_boolean ? |
716c501e | 504 | (LONGEST) (longest ? 1 : 0) : longest); |
c906108c | 505 | } |
ac3eeb49 MS |
506 | else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT |
507 | || code2 == TYPE_CODE_ENUM | |
508 | || code2 == TYPE_CODE_RANGE)) | |
634acd5f | 509 | { |
4603e466 DT |
510 | /* TYPE_LENGTH (type) is the length of a pointer, but we really |
511 | want the length of an address! -- we are really dealing with | |
512 | addresses (i.e., gdb representations) not pointers (i.e., | |
513 | target representations) here. | |
514 | ||
515 | This allows things like "print *(int *)0x01000234" to work | |
516 | without printing a misleading message -- which would | |
517 | otherwise occur when dealing with a target having two byte | |
518 | pointers and four byte addresses. */ | |
519 | ||
50810684 | 520 | int addr_bit = gdbarch_addr_bit (get_type_arch (type2)); |
634acd5f | 521 | LONGEST longest = value_as_long (arg2); |
a109c7c1 | 522 | |
4603e466 | 523 | if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT) |
634acd5f | 524 | { |
4603e466 DT |
525 | if (longest >= ((LONGEST) 1 << addr_bit) |
526 | || longest <= -((LONGEST) 1 << addr_bit)) | |
8a3fe4f8 | 527 | warning (_("value truncated")); |
634acd5f | 528 | } |
c973d0aa | 529 | return value_from_longest (to_type, longest); |
634acd5f | 530 | } |
0d5de010 DJ |
531 | else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT |
532 | && value_as_long (arg2) == 0) | |
533 | { | |
c973d0aa | 534 | struct value *result = allocate_value (to_type); |
a109c7c1 | 535 | |
c973d0aa | 536 | cplus_make_method_ptr (to_type, value_contents_writeable (result), 0, 0); |
0d5de010 DJ |
537 | return result; |
538 | } | |
539 | else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT | |
540 | && value_as_long (arg2) == 0) | |
541 | { | |
542 | /* The Itanium C++ ABI represents NULL pointers to members as | |
543 | minus one, instead of biasing the normal case. */ | |
c973d0aa | 544 | return value_from_longest (to_type, -1); |
0d5de010 | 545 | } |
8954db33 AB |
546 | else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type) |
547 | && code2 == TYPE_CODE_ARRAY && TYPE_VECTOR (type2) | |
548 | && TYPE_LENGTH (type) != TYPE_LENGTH (type2)) | |
549 | error (_("Cannot convert between vector values of different sizes")); | |
550 | else if (code1 == TYPE_CODE_ARRAY && TYPE_VECTOR (type) && scalar | |
551 | && TYPE_LENGTH (type) != TYPE_LENGTH (type2)) | |
552 | error (_("can only cast scalar to vector of same size")); | |
0ba2eb0f TT |
553 | else if (code1 == TYPE_CODE_VOID) |
554 | { | |
c973d0aa | 555 | return value_zero (to_type, not_lval); |
0ba2eb0f | 556 | } |
c906108c SS |
557 | else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2)) |
558 | { | |
559 | if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR) | |
c973d0aa | 560 | return value_cast_pointers (to_type, arg2, 0); |
fb933624 | 561 | |
0d5de010 | 562 | arg2 = value_copy (arg2); |
c973d0aa PA |
563 | deprecated_set_value_type (arg2, to_type); |
564 | set_value_enclosing_type (arg2, to_type); | |
b44d461b | 565 | set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */ |
c906108c SS |
566 | return arg2; |
567 | } | |
c906108c | 568 | else if (VALUE_LVAL (arg2) == lval_memory) |
c973d0aa | 569 | return value_at_lazy (to_type, value_address (arg2)); |
c906108c SS |
570 | else |
571 | { | |
8a3fe4f8 | 572 | error (_("Invalid cast.")); |
c906108c SS |
573 | return 0; |
574 | } | |
575 | } | |
576 | ||
4e8f195d TT |
577 | /* The C++ reinterpret_cast operator. */ |
578 | ||
579 | struct value * | |
580 | value_reinterpret_cast (struct type *type, struct value *arg) | |
581 | { | |
582 | struct value *result; | |
583 | struct type *real_type = check_typedef (type); | |
584 | struct type *arg_type, *dest_type; | |
585 | int is_ref = 0; | |
586 | enum type_code dest_code, arg_code; | |
587 | ||
588 | /* Do reference, function, and array conversion. */ | |
589 | arg = coerce_array (arg); | |
590 | ||
591 | /* Attempt to preserve the type the user asked for. */ | |
592 | dest_type = type; | |
593 | ||
594 | /* If we are casting to a reference type, transform | |
aa006118 AV |
595 | reinterpret_cast<T&[&]>(V) to *reinterpret_cast<T*>(&V). */ |
596 | if (TYPE_IS_REFERENCE (real_type)) | |
4e8f195d TT |
597 | { |
598 | is_ref = 1; | |
599 | arg = value_addr (arg); | |
600 | dest_type = lookup_pointer_type (TYPE_TARGET_TYPE (dest_type)); | |
601 | real_type = lookup_pointer_type (real_type); | |
602 | } | |
603 | ||
604 | arg_type = value_type (arg); | |
605 | ||
606 | dest_code = TYPE_CODE (real_type); | |
607 | arg_code = TYPE_CODE (arg_type); | |
608 | ||
609 | /* We can convert pointer types, or any pointer type to int, or int | |
610 | type to pointer. */ | |
611 | if ((dest_code == TYPE_CODE_PTR && arg_code == TYPE_CODE_INT) | |
612 | || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_PTR) | |
613 | || (dest_code == TYPE_CODE_METHODPTR && arg_code == TYPE_CODE_INT) | |
614 | || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_METHODPTR) | |
615 | || (dest_code == TYPE_CODE_MEMBERPTR && arg_code == TYPE_CODE_INT) | |
616 | || (dest_code == TYPE_CODE_INT && arg_code == TYPE_CODE_MEMBERPTR) | |
617 | || (dest_code == arg_code | |
618 | && (dest_code == TYPE_CODE_PTR | |
619 | || dest_code == TYPE_CODE_METHODPTR | |
620 | || dest_code == TYPE_CODE_MEMBERPTR))) | |
621 | result = value_cast (dest_type, arg); | |
622 | else | |
623 | error (_("Invalid reinterpret_cast")); | |
624 | ||
625 | if (is_ref) | |
a65cfae5 AV |
626 | result = value_cast (type, value_ref (value_ind (result), |
627 | TYPE_CODE (type))); | |
4e8f195d TT |
628 | |
629 | return result; | |
630 | } | |
631 | ||
632 | /* A helper for value_dynamic_cast. This implements the first of two | |
633 | runtime checks: we iterate over all the base classes of the value's | |
634 | class which are equal to the desired class; if only one of these | |
635 | holds the value, then it is the answer. */ | |
636 | ||
637 | static int | |
638 | dynamic_cast_check_1 (struct type *desired_type, | |
8af8e3bc | 639 | const gdb_byte *valaddr, |
6b850546 | 640 | LONGEST embedded_offset, |
4e8f195d | 641 | CORE_ADDR address, |
8af8e3bc | 642 | struct value *val, |
4e8f195d TT |
643 | struct type *search_type, |
644 | CORE_ADDR arg_addr, | |
645 | struct type *arg_type, | |
646 | struct value **result) | |
647 | { | |
648 | int i, result_count = 0; | |
649 | ||
650 | for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i) | |
651 | { | |
6b850546 DT |
652 | LONGEST offset = baseclass_offset (search_type, i, valaddr, |
653 | embedded_offset, | |
654 | address, val); | |
a109c7c1 | 655 | |
4e8f195d TT |
656 | if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i))) |
657 | { | |
8af8e3bc PA |
658 | if (address + embedded_offset + offset >= arg_addr |
659 | && address + embedded_offset + offset < arg_addr + TYPE_LENGTH (arg_type)) | |
4e8f195d TT |
660 | { |
661 | ++result_count; | |
662 | if (!*result) | |
663 | *result = value_at_lazy (TYPE_BASECLASS (search_type, i), | |
8af8e3bc | 664 | address + embedded_offset + offset); |
4e8f195d TT |
665 | } |
666 | } | |
667 | else | |
668 | result_count += dynamic_cast_check_1 (desired_type, | |
8af8e3bc PA |
669 | valaddr, |
670 | embedded_offset + offset, | |
671 | address, val, | |
4e8f195d TT |
672 | TYPE_BASECLASS (search_type, i), |
673 | arg_addr, | |
674 | arg_type, | |
675 | result); | |
676 | } | |
677 | ||
678 | return result_count; | |
679 | } | |
680 | ||
681 | /* A helper for value_dynamic_cast. This implements the second of two | |
682 | runtime checks: we look for a unique public sibling class of the | |
683 | argument's declared class. */ | |
684 | ||
685 | static int | |
686 | dynamic_cast_check_2 (struct type *desired_type, | |
8af8e3bc | 687 | const gdb_byte *valaddr, |
6b850546 | 688 | LONGEST embedded_offset, |
4e8f195d | 689 | CORE_ADDR address, |
8af8e3bc | 690 | struct value *val, |
4e8f195d TT |
691 | struct type *search_type, |
692 | struct value **result) | |
693 | { | |
694 | int i, result_count = 0; | |
695 | ||
696 | for (i = 0; i < TYPE_N_BASECLASSES (search_type) && result_count < 2; ++i) | |
697 | { | |
6b850546 | 698 | LONGEST offset; |
4e8f195d TT |
699 | |
700 | if (! BASETYPE_VIA_PUBLIC (search_type, i)) | |
701 | continue; | |
702 | ||
8af8e3bc PA |
703 | offset = baseclass_offset (search_type, i, valaddr, embedded_offset, |
704 | address, val); | |
4e8f195d TT |
705 | if (class_types_same_p (desired_type, TYPE_BASECLASS (search_type, i))) |
706 | { | |
707 | ++result_count; | |
708 | if (*result == NULL) | |
709 | *result = value_at_lazy (TYPE_BASECLASS (search_type, i), | |
8af8e3bc | 710 | address + embedded_offset + offset); |
4e8f195d TT |
711 | } |
712 | else | |
713 | result_count += dynamic_cast_check_2 (desired_type, | |
8af8e3bc PA |
714 | valaddr, |
715 | embedded_offset + offset, | |
716 | address, val, | |
4e8f195d TT |
717 | TYPE_BASECLASS (search_type, i), |
718 | result); | |
719 | } | |
720 | ||
721 | return result_count; | |
722 | } | |
723 | ||
724 | /* The C++ dynamic_cast operator. */ | |
725 | ||
726 | struct value * | |
727 | value_dynamic_cast (struct type *type, struct value *arg) | |
728 | { | |
6b850546 DT |
729 | int full, using_enc; |
730 | LONGEST top; | |
4e8f195d TT |
731 | struct type *resolved_type = check_typedef (type); |
732 | struct type *arg_type = check_typedef (value_type (arg)); | |
733 | struct type *class_type, *rtti_type; | |
734 | struct value *result, *tem, *original_arg = arg; | |
735 | CORE_ADDR addr; | |
aa006118 | 736 | int is_ref = TYPE_IS_REFERENCE (resolved_type); |
4e8f195d TT |
737 | |
738 | if (TYPE_CODE (resolved_type) != TYPE_CODE_PTR | |
aa006118 | 739 | && !TYPE_IS_REFERENCE (resolved_type)) |
4e8f195d TT |
740 | error (_("Argument to dynamic_cast must be a pointer or reference type")); |
741 | if (TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_VOID | |
4753d33b | 742 | && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) != TYPE_CODE_STRUCT) |
4e8f195d TT |
743 | error (_("Argument to dynamic_cast must be pointer to class or `void *'")); |
744 | ||
745 | class_type = check_typedef (TYPE_TARGET_TYPE (resolved_type)); | |
746 | if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR) | |
747 | { | |
748 | if (TYPE_CODE (arg_type) != TYPE_CODE_PTR | |
749 | && ! (TYPE_CODE (arg_type) == TYPE_CODE_INT | |
750 | && value_as_long (arg) == 0)) | |
751 | error (_("Argument to dynamic_cast does not have pointer type")); | |
752 | if (TYPE_CODE (arg_type) == TYPE_CODE_PTR) | |
753 | { | |
754 | arg_type = check_typedef (TYPE_TARGET_TYPE (arg_type)); | |
4753d33b | 755 | if (TYPE_CODE (arg_type) != TYPE_CODE_STRUCT) |
3e43a32a MS |
756 | error (_("Argument to dynamic_cast does " |
757 | "not have pointer to class type")); | |
4e8f195d TT |
758 | } |
759 | ||
760 | /* Handle NULL pointers. */ | |
761 | if (value_as_long (arg) == 0) | |
762 | return value_zero (type, not_lval); | |
763 | ||
764 | arg = value_ind (arg); | |
765 | } | |
766 | else | |
767 | { | |
4753d33b | 768 | if (TYPE_CODE (arg_type) != TYPE_CODE_STRUCT) |
4e8f195d TT |
769 | error (_("Argument to dynamic_cast does not have class type")); |
770 | } | |
771 | ||
772 | /* If the classes are the same, just return the argument. */ | |
773 | if (class_types_same_p (class_type, arg_type)) | |
774 | return value_cast (type, arg); | |
775 | ||
776 | /* If the target type is a unique base class of the argument's | |
777 | declared type, just cast it. */ | |
778 | if (is_ancestor (class_type, arg_type)) | |
779 | { | |
780 | if (is_unique_ancestor (class_type, arg)) | |
781 | return value_cast (type, original_arg); | |
782 | error (_("Ambiguous dynamic_cast")); | |
783 | } | |
784 | ||
785 | rtti_type = value_rtti_type (arg, &full, &top, &using_enc); | |
786 | if (! rtti_type) | |
787 | error (_("Couldn't determine value's most derived type for dynamic_cast")); | |
788 | ||
789 | /* Compute the most derived object's address. */ | |
790 | addr = value_address (arg); | |
791 | if (full) | |
792 | { | |
793 | /* Done. */ | |
794 | } | |
795 | else if (using_enc) | |
796 | addr += top; | |
797 | else | |
798 | addr += top + value_embedded_offset (arg); | |
799 | ||
800 | /* dynamic_cast<void *> means to return a pointer to the | |
801 | most-derived object. */ | |
802 | if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR | |
803 | && TYPE_CODE (TYPE_TARGET_TYPE (resolved_type)) == TYPE_CODE_VOID) | |
804 | return value_at_lazy (type, addr); | |
805 | ||
806 | tem = value_at (type, addr); | |
9f1f738a | 807 | type = value_type (tem); |
4e8f195d TT |
808 | |
809 | /* The first dynamic check specified in 5.2.7. */ | |
810 | if (is_public_ancestor (arg_type, TYPE_TARGET_TYPE (resolved_type))) | |
811 | { | |
812 | if (class_types_same_p (rtti_type, TYPE_TARGET_TYPE (resolved_type))) | |
813 | return tem; | |
814 | result = NULL; | |
815 | if (dynamic_cast_check_1 (TYPE_TARGET_TYPE (resolved_type), | |
8af8e3bc PA |
816 | value_contents_for_printing (tem), |
817 | value_embedded_offset (tem), | |
818 | value_address (tem), tem, | |
4e8f195d TT |
819 | rtti_type, addr, |
820 | arg_type, | |
821 | &result) == 1) | |
822 | return value_cast (type, | |
a65cfae5 AV |
823 | is_ref |
824 | ? value_ref (result, TYPE_CODE (resolved_type)) | |
825 | : value_addr (result)); | |
4e8f195d TT |
826 | } |
827 | ||
828 | /* The second dynamic check specified in 5.2.7. */ | |
829 | result = NULL; | |
830 | if (is_public_ancestor (arg_type, rtti_type) | |
831 | && dynamic_cast_check_2 (TYPE_TARGET_TYPE (resolved_type), | |
8af8e3bc PA |
832 | value_contents_for_printing (tem), |
833 | value_embedded_offset (tem), | |
834 | value_address (tem), tem, | |
4e8f195d TT |
835 | rtti_type, &result) == 1) |
836 | return value_cast (type, | |
a65cfae5 AV |
837 | is_ref |
838 | ? value_ref (result, TYPE_CODE (resolved_type)) | |
839 | : value_addr (result)); | |
4e8f195d TT |
840 | |
841 | if (TYPE_CODE (resolved_type) == TYPE_CODE_PTR) | |
842 | return value_zero (type, not_lval); | |
843 | ||
844 | error (_("dynamic_cast failed")); | |
845 | } | |
846 | ||
c906108c SS |
847 | /* Create a value of type TYPE that is zero, and return it. */ |
848 | ||
f23631e4 | 849 | struct value * |
fba45db2 | 850 | value_zero (struct type *type, enum lval_type lv) |
c906108c | 851 | { |
f23631e4 | 852 | struct value *val = allocate_value (type); |
c906108c | 853 | |
bb7da2bf | 854 | VALUE_LVAL (val) = (lv == lval_computed ? not_lval : lv); |
c906108c SS |
855 | return val; |
856 | } | |
857 | ||
18a46dbe | 858 | /* Create a not_lval value of numeric type TYPE that is one, and return it. */ |
301f0ecf DE |
859 | |
860 | struct value * | |
18a46dbe | 861 | value_one (struct type *type) |
301f0ecf DE |
862 | { |
863 | struct type *type1 = check_typedef (type); | |
4e608b4f | 864 | struct value *val; |
301f0ecf DE |
865 | |
866 | if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT) | |
867 | { | |
e17a4113 | 868 | enum bfd_endian byte_order = gdbarch_byte_order (get_type_arch (type)); |
301f0ecf | 869 | gdb_byte v[16]; |
a109c7c1 | 870 | |
e17a4113 | 871 | decimal_from_string (v, TYPE_LENGTH (type), byte_order, "1"); |
301f0ecf DE |
872 | val = value_from_decfloat (type, v); |
873 | } | |
874 | else if (TYPE_CODE (type1) == TYPE_CODE_FLT) | |
875 | { | |
876 | val = value_from_double (type, (DOUBLEST) 1); | |
877 | } | |
878 | else if (is_integral_type (type1)) | |
879 | { | |
880 | val = value_from_longest (type, (LONGEST) 1); | |
881 | } | |
120bd360 KW |
882 | else if (TYPE_CODE (type1) == TYPE_CODE_ARRAY && TYPE_VECTOR (type1)) |
883 | { | |
884 | struct type *eltype = check_typedef (TYPE_TARGET_TYPE (type1)); | |
cfa6f054 KW |
885 | int i; |
886 | LONGEST low_bound, high_bound; | |
120bd360 KW |
887 | struct value *tmp; |
888 | ||
cfa6f054 KW |
889 | if (!get_array_bounds (type1, &low_bound, &high_bound)) |
890 | error (_("Could not determine the vector bounds")); | |
891 | ||
120bd360 | 892 | val = allocate_value (type); |
cfa6f054 | 893 | for (i = 0; i < high_bound - low_bound + 1; i++) |
120bd360 | 894 | { |
18a46dbe | 895 | tmp = value_one (eltype); |
120bd360 KW |
896 | memcpy (value_contents_writeable (val) + i * TYPE_LENGTH (eltype), |
897 | value_contents_all (tmp), TYPE_LENGTH (eltype)); | |
898 | } | |
899 | } | |
301f0ecf DE |
900 | else |
901 | { | |
902 | error (_("Not a numeric type.")); | |
903 | } | |
904 | ||
18a46dbe JK |
905 | /* value_one result is never used for assignments to. */ |
906 | gdb_assert (VALUE_LVAL (val) == not_lval); | |
907 | ||
301f0ecf DE |
908 | return val; |
909 | } | |
910 | ||
80180f79 SA |
911 | /* Helper function for value_at, value_at_lazy, and value_at_lazy_stack. |
912 | The type of the created value may differ from the passed type TYPE. | |
913 | Make sure to retrieve the returned values's new type after this call | |
914 | e.g. in case the type is a variable length array. */ | |
4e5d721f DE |
915 | |
916 | static struct value * | |
917 | get_value_at (struct type *type, CORE_ADDR addr, int lazy) | |
918 | { | |
919 | struct value *val; | |
920 | ||
921 | if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) | |
922 | error (_("Attempt to dereference a generic pointer.")); | |
923 | ||
a3d34bf4 | 924 | val = value_from_contents_and_address (type, NULL, addr); |
4e5d721f | 925 | |
a3d34bf4 PA |
926 | if (!lazy) |
927 | value_fetch_lazy (val); | |
4e5d721f DE |
928 | |
929 | return val; | |
930 | } | |
931 | ||
070ad9f0 | 932 | /* Return a value with type TYPE located at ADDR. |
c906108c SS |
933 | |
934 | Call value_at only if the data needs to be fetched immediately; | |
935 | if we can be 'lazy' and defer the fetch, perhaps indefinately, call | |
936 | value_at_lazy instead. value_at_lazy simply records the address of | |
070ad9f0 | 937 | the data and sets the lazy-evaluation-required flag. The lazy flag |
0fd88904 | 938 | is tested in the value_contents macro, which is used if and when |
80180f79 SA |
939 | the contents are actually required. The type of the created value |
940 | may differ from the passed type TYPE. Make sure to retrieve the | |
941 | returned values's new type after this call e.g. in case the type | |
942 | is a variable length array. | |
c906108c SS |
943 | |
944 | Note: value_at does *NOT* handle embedded offsets; perform such | |
ac3eeb49 | 945 | adjustments before or after calling it. */ |
c906108c | 946 | |
f23631e4 | 947 | struct value * |
00a4c844 | 948 | value_at (struct type *type, CORE_ADDR addr) |
c906108c | 949 | { |
4e5d721f | 950 | return get_value_at (type, addr, 0); |
c906108c SS |
951 | } |
952 | ||
80180f79 SA |
953 | /* Return a lazy value with type TYPE located at ADDR (cf. value_at). |
954 | The type of the created value may differ from the passed type TYPE. | |
955 | Make sure to retrieve the returned values's new type after this call | |
956 | e.g. in case the type is a variable length array. */ | |
c906108c | 957 | |
f23631e4 | 958 | struct value * |
00a4c844 | 959 | value_at_lazy (struct type *type, CORE_ADDR addr) |
c906108c | 960 | { |
4e5d721f | 961 | return get_value_at (type, addr, 1); |
c906108c SS |
962 | } |
963 | ||
e6ca34fc | 964 | void |
23f945bf | 965 | read_value_memory (struct value *val, LONGEST bit_offset, |
e6ca34fc PA |
966 | int stack, CORE_ADDR memaddr, |
967 | gdb_byte *buffer, size_t length) | |
968 | { | |
3ae385af SM |
969 | ULONGEST xfered_total = 0; |
970 | struct gdbarch *arch = get_value_arch (val); | |
971 | int unit_size = gdbarch_addressable_memory_unit_size (arch); | |
6d7e9d3b YQ |
972 | enum target_object object; |
973 | ||
974 | object = stack ? TARGET_OBJECT_STACK_MEMORY : TARGET_OBJECT_MEMORY; | |
5a2eb0ef | 975 | |
3ae385af | 976 | while (xfered_total < length) |
5a2eb0ef YQ |
977 | { |
978 | enum target_xfer_status status; | |
3ae385af | 979 | ULONGEST xfered_partial; |
5a2eb0ef YQ |
980 | |
981 | status = target_xfer_partial (current_target.beneath, | |
6d7e9d3b | 982 | object, NULL, |
3ae385af SM |
983 | buffer + xfered_total * unit_size, NULL, |
984 | memaddr + xfered_total, | |
985 | length - xfered_total, | |
986 | &xfered_partial); | |
5a2eb0ef YQ |
987 | |
988 | if (status == TARGET_XFER_OK) | |
989 | /* nothing */; | |
bc113b4e | 990 | else if (status == TARGET_XFER_UNAVAILABLE) |
23f945bf AA |
991 | mark_value_bits_unavailable (val, (xfered_total * HOST_CHAR_BIT |
992 | + bit_offset), | |
993 | xfered_partial * HOST_CHAR_BIT); | |
5a2eb0ef | 994 | else if (status == TARGET_XFER_EOF) |
3ae385af | 995 | memory_error (TARGET_XFER_E_IO, memaddr + xfered_total); |
e6ca34fc | 996 | else |
3ae385af | 997 | memory_error (status, memaddr + xfered_total); |
e6ca34fc | 998 | |
3ae385af | 999 | xfered_total += xfered_partial; |
5a2eb0ef | 1000 | QUIT; |
e6ca34fc PA |
1001 | } |
1002 | } | |
c906108c SS |
1003 | |
1004 | /* Store the contents of FROMVAL into the location of TOVAL. | |
1005 | Return a new value with the location of TOVAL and contents of FROMVAL. */ | |
1006 | ||
f23631e4 AC |
1007 | struct value * |
1008 | value_assign (struct value *toval, struct value *fromval) | |
c906108c | 1009 | { |
52f0bd74 | 1010 | struct type *type; |
f23631e4 | 1011 | struct value *val; |
cb741690 | 1012 | struct frame_id old_frame; |
c906108c | 1013 | |
88e3b34b | 1014 | if (!deprecated_value_modifiable (toval)) |
8a3fe4f8 | 1015 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
c906108c | 1016 | |
994b9211 | 1017 | toval = coerce_ref (toval); |
c906108c | 1018 | |
df407dfe | 1019 | type = value_type (toval); |
c906108c | 1020 | if (VALUE_LVAL (toval) != lval_internalvar) |
3cbaedff | 1021 | fromval = value_cast (type, fromval); |
c906108c | 1022 | else |
63092375 DJ |
1023 | { |
1024 | /* Coerce arrays and functions to pointers, except for arrays | |
1025 | which only live in GDB's storage. */ | |
1026 | if (!value_must_coerce_to_target (fromval)) | |
1027 | fromval = coerce_array (fromval); | |
1028 | } | |
1029 | ||
f168693b | 1030 | type = check_typedef (type); |
c906108c | 1031 | |
ac3eeb49 MS |
1032 | /* Since modifying a register can trash the frame chain, and |
1033 | modifying memory can trash the frame cache, we save the old frame | |
1034 | and then restore the new frame afterwards. */ | |
206415a3 | 1035 | old_frame = get_frame_id (deprecated_safe_get_selected_frame ()); |
cb741690 | 1036 | |
c906108c SS |
1037 | switch (VALUE_LVAL (toval)) |
1038 | { | |
1039 | case lval_internalvar: | |
1040 | set_internalvar (VALUE_INTERNALVAR (toval), fromval); | |
4aac0db7 UW |
1041 | return value_of_internalvar (get_type_arch (type), |
1042 | VALUE_INTERNALVAR (toval)); | |
c906108c SS |
1043 | |
1044 | case lval_internalvar_component: | |
d9e98382 | 1045 | { |
6b850546 | 1046 | LONGEST offset = value_offset (toval); |
d9e98382 SDJ |
1047 | |
1048 | /* Are we dealing with a bitfield? | |
1049 | ||
1050 | It is important to mention that `value_parent (toval)' is | |
1051 | non-NULL iff `value_bitsize (toval)' is non-zero. */ | |
1052 | if (value_bitsize (toval)) | |
1053 | { | |
1054 | /* VALUE_INTERNALVAR below refers to the parent value, while | |
1055 | the offset is relative to this parent value. */ | |
1056 | gdb_assert (value_parent (value_parent (toval)) == NULL); | |
1057 | offset += value_offset (value_parent (toval)); | |
1058 | } | |
1059 | ||
1060 | set_internalvar_component (VALUE_INTERNALVAR (toval), | |
1061 | offset, | |
1062 | value_bitpos (toval), | |
1063 | value_bitsize (toval), | |
1064 | fromval); | |
1065 | } | |
c906108c SS |
1066 | break; |
1067 | ||
1068 | case lval_memory: | |
1069 | { | |
fc1a4b47 | 1070 | const gdb_byte *dest_buffer; |
c5aa993b JM |
1071 | CORE_ADDR changed_addr; |
1072 | int changed_len; | |
10c42a71 | 1073 | gdb_byte buffer[sizeof (LONGEST)]; |
c906108c | 1074 | |
df407dfe | 1075 | if (value_bitsize (toval)) |
c5aa993b | 1076 | { |
2d88202a | 1077 | struct value *parent = value_parent (toval); |
2d88202a | 1078 | |
a109c7c1 | 1079 | changed_addr = value_address (parent) + value_offset (toval); |
df407dfe AC |
1080 | changed_len = (value_bitpos (toval) |
1081 | + value_bitsize (toval) | |
c5aa993b JM |
1082 | + HOST_CHAR_BIT - 1) |
1083 | / HOST_CHAR_BIT; | |
c906108c | 1084 | |
4ea48cc1 DJ |
1085 | /* If we can read-modify-write exactly the size of the |
1086 | containing type (e.g. short or int) then do so. This | |
1087 | is safer for volatile bitfields mapped to hardware | |
1088 | registers. */ | |
1089 | if (changed_len < TYPE_LENGTH (type) | |
1090 | && TYPE_LENGTH (type) <= (int) sizeof (LONGEST) | |
2d88202a | 1091 | && ((LONGEST) changed_addr % TYPE_LENGTH (type)) == 0) |
4ea48cc1 DJ |
1092 | changed_len = TYPE_LENGTH (type); |
1093 | ||
c906108c | 1094 | if (changed_len > (int) sizeof (LONGEST)) |
3e43a32a MS |
1095 | error (_("Can't handle bitfields which " |
1096 | "don't fit in a %d bit word."), | |
baa6f10b | 1097 | (int) sizeof (LONGEST) * HOST_CHAR_BIT); |
c906108c | 1098 | |
2d88202a | 1099 | read_memory (changed_addr, buffer, changed_len); |
50810684 | 1100 | modify_field (type, buffer, value_as_long (fromval), |
df407dfe | 1101 | value_bitpos (toval), value_bitsize (toval)); |
c906108c SS |
1102 | dest_buffer = buffer; |
1103 | } | |
c906108c SS |
1104 | else |
1105 | { | |
42ae5230 | 1106 | changed_addr = value_address (toval); |
3ae385af | 1107 | changed_len = type_length_units (type); |
0fd88904 | 1108 | dest_buffer = value_contents (fromval); |
c906108c SS |
1109 | } |
1110 | ||
972daa01 | 1111 | write_memory_with_notification (changed_addr, dest_buffer, changed_len); |
c906108c SS |
1112 | } |
1113 | break; | |
1114 | ||
492254e9 | 1115 | case lval_register: |
c906108c | 1116 | { |
c906108c | 1117 | struct frame_info *frame; |
d80b854b | 1118 | struct gdbarch *gdbarch; |
ff2e87ac | 1119 | int value_reg; |
c906108c | 1120 | |
41b56feb KB |
1121 | /* Figure out which frame this is in currently. |
1122 | ||
1123 | We use VALUE_FRAME_ID for obtaining the value's frame id instead of | |
1124 | VALUE_NEXT_FRAME_ID due to requiring a frame which may be passed to | |
1125 | put_frame_register_bytes() below. That function will (eventually) | |
1126 | perform the necessary unwind operation by first obtaining the next | |
1127 | frame. */ | |
0c16dd26 | 1128 | frame = frame_find_by_id (VALUE_FRAME_ID (toval)); |
41b56feb | 1129 | |
0c16dd26 | 1130 | value_reg = VALUE_REGNUM (toval); |
c906108c SS |
1131 | |
1132 | if (!frame) | |
8a3fe4f8 | 1133 | error (_("Value being assigned to is no longer active.")); |
d80b854b UW |
1134 | |
1135 | gdbarch = get_frame_arch (frame); | |
3e871532 LM |
1136 | |
1137 | if (value_bitsize (toval)) | |
492254e9 | 1138 | { |
3e871532 | 1139 | struct value *parent = value_parent (toval); |
6b850546 | 1140 | LONGEST offset = value_offset (parent) + value_offset (toval); |
3e871532 LM |
1141 | int changed_len; |
1142 | gdb_byte buffer[sizeof (LONGEST)]; | |
1143 | int optim, unavail; | |
1144 | ||
1145 | changed_len = (value_bitpos (toval) | |
1146 | + value_bitsize (toval) | |
1147 | + HOST_CHAR_BIT - 1) | |
1148 | / HOST_CHAR_BIT; | |
1149 | ||
1150 | if (changed_len > (int) sizeof (LONGEST)) | |
1151 | error (_("Can't handle bitfields which " | |
1152 | "don't fit in a %d bit word."), | |
1153 | (int) sizeof (LONGEST) * HOST_CHAR_BIT); | |
1154 | ||
1155 | if (!get_frame_register_bytes (frame, value_reg, offset, | |
1156 | changed_len, buffer, | |
1157 | &optim, &unavail)) | |
1158 | { | |
1159 | if (optim) | |
1160 | throw_error (OPTIMIZED_OUT_ERROR, | |
1161 | _("value has been optimized out")); | |
1162 | if (unavail) | |
1163 | throw_error (NOT_AVAILABLE_ERROR, | |
1164 | _("value is not available")); | |
1165 | } | |
1166 | ||
1167 | modify_field (type, buffer, value_as_long (fromval), | |
1168 | value_bitpos (toval), value_bitsize (toval)); | |
1169 | ||
1170 | put_frame_register_bytes (frame, value_reg, offset, | |
1171 | changed_len, buffer); | |
492254e9 | 1172 | } |
c906108c | 1173 | else |
492254e9 | 1174 | { |
3e871532 LM |
1175 | if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval), |
1176 | type)) | |
00fa51f6 | 1177 | { |
3e871532 LM |
1178 | /* If TOVAL is a special machine register requiring |
1179 | conversion of program values to a special raw | |
1180 | format. */ | |
1181 | gdbarch_value_to_register (gdbarch, frame, | |
1182 | VALUE_REGNUM (toval), type, | |
1183 | value_contents (fromval)); | |
00fa51f6 | 1184 | } |
c906108c | 1185 | else |
00fa51f6 UW |
1186 | { |
1187 | put_frame_register_bytes (frame, value_reg, | |
1188 | value_offset (toval), | |
1189 | TYPE_LENGTH (type), | |
1190 | value_contents (fromval)); | |
1191 | } | |
ff2e87ac | 1192 | } |
00fa51f6 | 1193 | |
162078c8 | 1194 | observer_notify_register_changed (frame, value_reg); |
ff2e87ac | 1195 | break; |
c906108c | 1196 | } |
5f5233d4 PA |
1197 | |
1198 | case lval_computed: | |
1199 | { | |
c8f2448a | 1200 | const struct lval_funcs *funcs = value_computed_funcs (toval); |
5f5233d4 | 1201 | |
ac71a68c JK |
1202 | if (funcs->write != NULL) |
1203 | { | |
1204 | funcs->write (toval, fromval); | |
1205 | break; | |
1206 | } | |
5f5233d4 | 1207 | } |
ac71a68c | 1208 | /* Fall through. */ |
5f5233d4 | 1209 | |
c906108c | 1210 | default: |
8a3fe4f8 | 1211 | error (_("Left operand of assignment is not an lvalue.")); |
c906108c SS |
1212 | } |
1213 | ||
cb741690 DJ |
1214 | /* Assigning to the stack pointer, frame pointer, and other |
1215 | (architecture and calling convention specific) registers may | |
d649a38e | 1216 | cause the frame cache and regcache to be out of date. Assigning to memory |
cb741690 DJ |
1217 | also can. We just do this on all assignments to registers or |
1218 | memory, for simplicity's sake; I doubt the slowdown matters. */ | |
1219 | switch (VALUE_LVAL (toval)) | |
1220 | { | |
1221 | case lval_memory: | |
1222 | case lval_register: | |
0e03807e | 1223 | case lval_computed: |
cb741690 | 1224 | |
d649a38e | 1225 | observer_notify_target_changed (¤t_target); |
cb741690 | 1226 | |
ac3eeb49 MS |
1227 | /* Having destroyed the frame cache, restore the selected |
1228 | frame. */ | |
cb741690 DJ |
1229 | |
1230 | /* FIXME: cagney/2002-11-02: There has to be a better way of | |
1231 | doing this. Instead of constantly saving/restoring the | |
1232 | frame. Why not create a get_selected_frame() function that, | |
1233 | having saved the selected frame's ID can automatically | |
1234 | re-find the previously selected frame automatically. */ | |
1235 | ||
1236 | { | |
1237 | struct frame_info *fi = frame_find_by_id (old_frame); | |
a109c7c1 | 1238 | |
cb741690 DJ |
1239 | if (fi != NULL) |
1240 | select_frame (fi); | |
1241 | } | |
1242 | ||
1243 | break; | |
1244 | default: | |
1245 | break; | |
1246 | } | |
1247 | ||
ac3eeb49 MS |
1248 | /* If the field does not entirely fill a LONGEST, then zero the sign |
1249 | bits. If the field is signed, and is negative, then sign | |
1250 | extend. */ | |
df407dfe AC |
1251 | if ((value_bitsize (toval) > 0) |
1252 | && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST))) | |
c906108c SS |
1253 | { |
1254 | LONGEST fieldval = value_as_long (fromval); | |
df407dfe | 1255 | LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1; |
c906108c SS |
1256 | |
1257 | fieldval &= valmask; | |
ac3eeb49 MS |
1258 | if (!TYPE_UNSIGNED (type) |
1259 | && (fieldval & (valmask ^ (valmask >> 1)))) | |
c906108c SS |
1260 | fieldval |= ~valmask; |
1261 | ||
1262 | fromval = value_from_longest (type, fieldval); | |
1263 | } | |
1264 | ||
4aac0db7 UW |
1265 | /* The return value is a copy of TOVAL so it shares its location |
1266 | information, but its contents are updated from FROMVAL. This | |
1267 | implies the returned value is not lazy, even if TOVAL was. */ | |
c906108c | 1268 | val = value_copy (toval); |
4aac0db7 | 1269 | set_value_lazy (val, 0); |
0fd88904 | 1270 | memcpy (value_contents_raw (val), value_contents (fromval), |
c906108c | 1271 | TYPE_LENGTH (type)); |
4aac0db7 UW |
1272 | |
1273 | /* We copy over the enclosing type and pointed-to offset from FROMVAL | |
1274 | in the case of pointer types. For object types, the enclosing type | |
1275 | and embedded offset must *not* be copied: the target object refered | |
1276 | to by TOVAL retains its original dynamic type after assignment. */ | |
1277 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
1278 | { | |
1279 | set_value_enclosing_type (val, value_enclosing_type (fromval)); | |
1280 | set_value_pointed_to_offset (val, value_pointed_to_offset (fromval)); | |
1281 | } | |
c5aa993b | 1282 | |
c906108c SS |
1283 | return val; |
1284 | } | |
1285 | ||
1286 | /* Extend a value VAL to COUNT repetitions of its type. */ | |
1287 | ||
f23631e4 AC |
1288 | struct value * |
1289 | value_repeat (struct value *arg1, int count) | |
c906108c | 1290 | { |
f23631e4 | 1291 | struct value *val; |
c906108c SS |
1292 | |
1293 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 1294 | error (_("Only values in memory can be extended with '@'.")); |
c906108c | 1295 | if (count < 1) |
8a3fe4f8 | 1296 | error (_("Invalid number %d of repetitions."), count); |
c906108c | 1297 | |
4754a64e | 1298 | val = allocate_repeat_value (value_enclosing_type (arg1), count); |
c906108c | 1299 | |
c906108c | 1300 | VALUE_LVAL (val) = lval_memory; |
42ae5230 | 1301 | set_value_address (val, value_address (arg1)); |
c906108c | 1302 | |
24e6bcee PA |
1303 | read_value_memory (val, 0, value_stack (val), value_address (val), |
1304 | value_contents_all_raw (val), | |
3ae385af | 1305 | type_length_units (value_enclosing_type (val))); |
24e6bcee | 1306 | |
c906108c SS |
1307 | return val; |
1308 | } | |
1309 | ||
f23631e4 | 1310 | struct value * |
9df2fbc4 | 1311 | value_of_variable (struct symbol *var, const struct block *b) |
c906108c | 1312 | { |
63e43d3a | 1313 | struct frame_info *frame = NULL; |
c906108c | 1314 | |
63e43d3a | 1315 | if (symbol_read_needs_frame (var)) |
61212c0f | 1316 | frame = get_selected_frame (_("No frame selected.")); |
c906108c | 1317 | |
63e43d3a | 1318 | return read_var_value (var, b, frame); |
c906108c SS |
1319 | } |
1320 | ||
61212c0f | 1321 | struct value * |
270140bd | 1322 | address_of_variable (struct symbol *var, const struct block *b) |
61212c0f UW |
1323 | { |
1324 | struct type *type = SYMBOL_TYPE (var); | |
1325 | struct value *val; | |
1326 | ||
1327 | /* Evaluate it first; if the result is a memory address, we're fine. | |
581e13c1 | 1328 | Lazy evaluation pays off here. */ |
61212c0f UW |
1329 | |
1330 | val = value_of_variable (var, b); | |
9f1f738a | 1331 | type = value_type (val); |
61212c0f UW |
1332 | |
1333 | if ((VALUE_LVAL (val) == lval_memory && value_lazy (val)) | |
1334 | || TYPE_CODE (type) == TYPE_CODE_FUNC) | |
1335 | { | |
42ae5230 | 1336 | CORE_ADDR addr = value_address (val); |
a109c7c1 | 1337 | |
61212c0f UW |
1338 | return value_from_pointer (lookup_pointer_type (type), addr); |
1339 | } | |
1340 | ||
1341 | /* Not a memory address; check what the problem was. */ | |
1342 | switch (VALUE_LVAL (val)) | |
1343 | { | |
1344 | case lval_register: | |
1345 | { | |
1346 | struct frame_info *frame; | |
1347 | const char *regname; | |
1348 | ||
41b56feb | 1349 | frame = frame_find_by_id (VALUE_NEXT_FRAME_ID (val)); |
61212c0f UW |
1350 | gdb_assert (frame); |
1351 | ||
1352 | regname = gdbarch_register_name (get_frame_arch (frame), | |
1353 | VALUE_REGNUM (val)); | |
1354 | gdb_assert (regname && *regname); | |
1355 | ||
1356 | error (_("Address requested for identifier " | |
1357 | "\"%s\" which is in register $%s"), | |
1358 | SYMBOL_PRINT_NAME (var), regname); | |
1359 | break; | |
1360 | } | |
1361 | ||
1362 | default: | |
1363 | error (_("Can't take address of \"%s\" which isn't an lvalue."), | |
1364 | SYMBOL_PRINT_NAME (var)); | |
1365 | break; | |
1366 | } | |
1367 | ||
1368 | return val; | |
1369 | } | |
1370 | ||
63092375 DJ |
1371 | /* Return one if VAL does not live in target memory, but should in order |
1372 | to operate on it. Otherwise return zero. */ | |
1373 | ||
1374 | int | |
1375 | value_must_coerce_to_target (struct value *val) | |
1376 | { | |
1377 | struct type *valtype; | |
1378 | ||
1379 | /* The only lval kinds which do not live in target memory. */ | |
1380 | if (VALUE_LVAL (val) != not_lval | |
e81e7f5e SC |
1381 | && VALUE_LVAL (val) != lval_internalvar |
1382 | && VALUE_LVAL (val) != lval_xcallable) | |
63092375 DJ |
1383 | return 0; |
1384 | ||
1385 | valtype = check_typedef (value_type (val)); | |
1386 | ||
1387 | switch (TYPE_CODE (valtype)) | |
1388 | { | |
1389 | case TYPE_CODE_ARRAY: | |
3cbaedff | 1390 | return TYPE_VECTOR (valtype) ? 0 : 1; |
63092375 DJ |
1391 | case TYPE_CODE_STRING: |
1392 | return 1; | |
1393 | default: | |
1394 | return 0; | |
1395 | } | |
1396 | } | |
1397 | ||
3e43a32a MS |
1398 | /* Make sure that VAL lives in target memory if it's supposed to. For |
1399 | instance, strings are constructed as character arrays in GDB's | |
1400 | storage, and this function copies them to the target. */ | |
63092375 DJ |
1401 | |
1402 | struct value * | |
1403 | value_coerce_to_target (struct value *val) | |
1404 | { | |
1405 | LONGEST length; | |
1406 | CORE_ADDR addr; | |
1407 | ||
1408 | if (!value_must_coerce_to_target (val)) | |
1409 | return val; | |
1410 | ||
1411 | length = TYPE_LENGTH (check_typedef (value_type (val))); | |
1412 | addr = allocate_space_in_inferior (length); | |
1413 | write_memory (addr, value_contents (val), length); | |
1414 | return value_at_lazy (value_type (val), addr); | |
1415 | } | |
1416 | ||
ac3eeb49 MS |
1417 | /* Given a value which is an array, return a value which is a pointer |
1418 | to its first element, regardless of whether or not the array has a | |
1419 | nonzero lower bound. | |
c906108c | 1420 | |
ac3eeb49 MS |
1421 | FIXME: A previous comment here indicated that this routine should |
1422 | be substracting the array's lower bound. It's not clear to me that | |
1423 | this is correct. Given an array subscripting operation, it would | |
1424 | certainly work to do the adjustment here, essentially computing: | |
c906108c SS |
1425 | |
1426 | (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0]) | |
1427 | ||
ac3eeb49 MS |
1428 | However I believe a more appropriate and logical place to account |
1429 | for the lower bound is to do so in value_subscript, essentially | |
1430 | computing: | |
c906108c SS |
1431 | |
1432 | (&array[0] + ((index - lowerbound) * sizeof array[0])) | |
1433 | ||
ac3eeb49 MS |
1434 | As further evidence consider what would happen with operations |
1435 | other than array subscripting, where the caller would get back a | |
1436 | value that had an address somewhere before the actual first element | |
1437 | of the array, and the information about the lower bound would be | |
581e13c1 | 1438 | lost because of the coercion to pointer type. */ |
c906108c | 1439 | |
f23631e4 AC |
1440 | struct value * |
1441 | value_coerce_array (struct value *arg1) | |
c906108c | 1442 | { |
df407dfe | 1443 | struct type *type = check_typedef (value_type (arg1)); |
c906108c | 1444 | |
63092375 DJ |
1445 | /* If the user tries to do something requiring a pointer with an |
1446 | array that has not yet been pushed to the target, then this would | |
1447 | be a good time to do so. */ | |
1448 | arg1 = value_coerce_to_target (arg1); | |
1449 | ||
c906108c | 1450 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 1451 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1452 | |
4478b372 | 1453 | return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
42ae5230 | 1454 | value_address (arg1)); |
c906108c SS |
1455 | } |
1456 | ||
1457 | /* Given a value which is a function, return a value which is a pointer | |
1458 | to it. */ | |
1459 | ||
f23631e4 AC |
1460 | struct value * |
1461 | value_coerce_function (struct value *arg1) | |
c906108c | 1462 | { |
f23631e4 | 1463 | struct value *retval; |
c906108c SS |
1464 | |
1465 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 1466 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1467 | |
df407dfe | 1468 | retval = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
42ae5230 | 1469 | value_address (arg1)); |
c906108c | 1470 | return retval; |
c5aa993b | 1471 | } |
c906108c | 1472 | |
ac3eeb49 MS |
1473 | /* Return a pointer value for the object for which ARG1 is the |
1474 | contents. */ | |
c906108c | 1475 | |
f23631e4 AC |
1476 | struct value * |
1477 | value_addr (struct value *arg1) | |
c906108c | 1478 | { |
f23631e4 | 1479 | struct value *arg2; |
df407dfe | 1480 | struct type *type = check_typedef (value_type (arg1)); |
a109c7c1 | 1481 | |
aa006118 | 1482 | if (TYPE_IS_REFERENCE (type)) |
c906108c | 1483 | { |
3326303b MG |
1484 | if (value_bits_synthetic_pointer (arg1, value_embedded_offset (arg1), |
1485 | TARGET_CHAR_BIT * TYPE_LENGTH (type))) | |
1486 | arg1 = coerce_ref (arg1); | |
1487 | else | |
1488 | { | |
1489 | /* Copy the value, but change the type from (T&) to (T*). We | |
1490 | keep the same location information, which is efficient, and | |
1491 | allows &(&X) to get the location containing the reference. | |
1492 | Do the same to its enclosing type for consistency. */ | |
1493 | struct type *type_ptr | |
1494 | = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
1495 | struct type *enclosing_type | |
1496 | = check_typedef (value_enclosing_type (arg1)); | |
1497 | struct type *enclosing_type_ptr | |
1498 | = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type)); | |
1499 | ||
1500 | arg2 = value_copy (arg1); | |
1501 | deprecated_set_value_type (arg2, type_ptr); | |
1502 | set_value_enclosing_type (arg2, enclosing_type_ptr); | |
a22df60a | 1503 | |
3326303b MG |
1504 | return arg2; |
1505 | } | |
c906108c SS |
1506 | } |
1507 | if (TYPE_CODE (type) == TYPE_CODE_FUNC) | |
1508 | return value_coerce_function (arg1); | |
1509 | ||
63092375 DJ |
1510 | /* If this is an array that has not yet been pushed to the target, |
1511 | then this would be a good time to force it to memory. */ | |
1512 | arg1 = value_coerce_to_target (arg1); | |
1513 | ||
c906108c | 1514 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 1515 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1516 | |
581e13c1 | 1517 | /* Get target memory address. */ |
df407dfe | 1518 | arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
42ae5230 | 1519 | (value_address (arg1) |
13c3b5f5 | 1520 | + value_embedded_offset (arg1))); |
c906108c SS |
1521 | |
1522 | /* This may be a pointer to a base subobject; so remember the | |
ac3eeb49 | 1523 | full derived object's type ... */ |
4dfea560 DE |
1524 | set_value_enclosing_type (arg2, |
1525 | lookup_pointer_type (value_enclosing_type (arg1))); | |
ac3eeb49 MS |
1526 | /* ... and also the relative position of the subobject in the full |
1527 | object. */ | |
b44d461b | 1528 | set_value_pointed_to_offset (arg2, value_embedded_offset (arg1)); |
c906108c SS |
1529 | return arg2; |
1530 | } | |
1531 | ||
ac3eeb49 MS |
1532 | /* Return a reference value for the object for which ARG1 is the |
1533 | contents. */ | |
fb933624 DJ |
1534 | |
1535 | struct value * | |
a65cfae5 | 1536 | value_ref (struct value *arg1, enum type_code refcode) |
fb933624 DJ |
1537 | { |
1538 | struct value *arg2; | |
fb933624 | 1539 | struct type *type = check_typedef (value_type (arg1)); |
a109c7c1 | 1540 | |
a65cfae5 AV |
1541 | gdb_assert (refcode == TYPE_CODE_REF || refcode == TYPE_CODE_RVALUE_REF); |
1542 | ||
1543 | if ((TYPE_CODE (type) == TYPE_CODE_REF | |
1544 | || TYPE_CODE (type) == TYPE_CODE_RVALUE_REF) | |
1545 | && TYPE_CODE (type) == refcode) | |
fb933624 DJ |
1546 | return arg1; |
1547 | ||
1548 | arg2 = value_addr (arg1); | |
a65cfae5 | 1549 | deprecated_set_value_type (arg2, lookup_reference_type (type, refcode)); |
fb933624 DJ |
1550 | return arg2; |
1551 | } | |
1552 | ||
ac3eeb49 MS |
1553 | /* Given a value of a pointer type, apply the C unary * operator to |
1554 | it. */ | |
c906108c | 1555 | |
f23631e4 AC |
1556 | struct value * |
1557 | value_ind (struct value *arg1) | |
c906108c SS |
1558 | { |
1559 | struct type *base_type; | |
f23631e4 | 1560 | struct value *arg2; |
c906108c | 1561 | |
994b9211 | 1562 | arg1 = coerce_array (arg1); |
c906108c | 1563 | |
df407dfe | 1564 | base_type = check_typedef (value_type (arg1)); |
c906108c | 1565 | |
8cf6f0b1 TT |
1566 | if (VALUE_LVAL (arg1) == lval_computed) |
1567 | { | |
c8f2448a | 1568 | const struct lval_funcs *funcs = value_computed_funcs (arg1); |
8cf6f0b1 TT |
1569 | |
1570 | if (funcs->indirect) | |
1571 | { | |
1572 | struct value *result = funcs->indirect (arg1); | |
1573 | ||
1574 | if (result) | |
1575 | return result; | |
1576 | } | |
1577 | } | |
1578 | ||
22fe0fbb | 1579 | if (TYPE_CODE (base_type) == TYPE_CODE_PTR) |
c906108c SS |
1580 | { |
1581 | struct type *enc_type; | |
a109c7c1 | 1582 | |
ac3eeb49 MS |
1583 | /* We may be pointing to something embedded in a larger object. |
1584 | Get the real type of the enclosing object. */ | |
4754a64e | 1585 | enc_type = check_typedef (value_enclosing_type (arg1)); |
c906108c | 1586 | enc_type = TYPE_TARGET_TYPE (enc_type); |
0d5de010 DJ |
1587 | |
1588 | if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC | |
1589 | || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD) | |
1590 | /* For functions, go through find_function_addr, which knows | |
1591 | how to handle function descriptors. */ | |
ac3eeb49 MS |
1592 | arg2 = value_at_lazy (enc_type, |
1593 | find_function_addr (arg1, NULL)); | |
0d5de010 | 1594 | else |
581e13c1 | 1595 | /* Retrieve the enclosing object pointed to. */ |
ac3eeb49 MS |
1596 | arg2 = value_at_lazy (enc_type, |
1597 | (value_as_address (arg1) | |
1598 | - value_pointed_to_offset (arg1))); | |
0d5de010 | 1599 | |
9f1f738a | 1600 | enc_type = value_type (arg2); |
dfcee124 | 1601 | return readjust_indirect_value_type (arg2, enc_type, base_type, arg1); |
c906108c SS |
1602 | } |
1603 | ||
8a3fe4f8 | 1604 | error (_("Attempt to take contents of a non-pointer value.")); |
ac3eeb49 | 1605 | return 0; /* For lint -- never reached. */ |
c906108c SS |
1606 | } |
1607 | \f | |
39d37385 PA |
1608 | /* Create a value for an array by allocating space in GDB, copying the |
1609 | data into that space, and then setting up an array value. | |
c906108c | 1610 | |
ac3eeb49 MS |
1611 | The array bounds are set from LOWBOUND and HIGHBOUND, and the array |
1612 | is populated from the values passed in ELEMVEC. | |
c906108c SS |
1613 | |
1614 | The element type of the array is inherited from the type of the | |
1615 | first element, and all elements must have the same size (though we | |
ac3eeb49 | 1616 | don't currently enforce any restriction on their types). */ |
c906108c | 1617 | |
f23631e4 AC |
1618 | struct value * |
1619 | value_array (int lowbound, int highbound, struct value **elemvec) | |
c906108c SS |
1620 | { |
1621 | int nelem; | |
1622 | int idx; | |
6b850546 | 1623 | ULONGEST typelength; |
f23631e4 | 1624 | struct value *val; |
c906108c | 1625 | struct type *arraytype; |
c906108c | 1626 | |
ac3eeb49 MS |
1627 | /* Validate that the bounds are reasonable and that each of the |
1628 | elements have the same size. */ | |
c906108c SS |
1629 | |
1630 | nelem = highbound - lowbound + 1; | |
1631 | if (nelem <= 0) | |
1632 | { | |
8a3fe4f8 | 1633 | error (_("bad array bounds (%d, %d)"), lowbound, highbound); |
c906108c | 1634 | } |
3ae385af | 1635 | typelength = type_length_units (value_enclosing_type (elemvec[0])); |
c906108c SS |
1636 | for (idx = 1; idx < nelem; idx++) |
1637 | { | |
3ae385af SM |
1638 | if (type_length_units (value_enclosing_type (elemvec[idx])) |
1639 | != typelength) | |
c906108c | 1640 | { |
8a3fe4f8 | 1641 | error (_("array elements must all be the same size")); |
c906108c SS |
1642 | } |
1643 | } | |
1644 | ||
e3506a9f UW |
1645 | arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]), |
1646 | lowbound, highbound); | |
c906108c SS |
1647 | |
1648 | if (!current_language->c_style_arrays) | |
1649 | { | |
1650 | val = allocate_value (arraytype); | |
1651 | for (idx = 0; idx < nelem; idx++) | |
39d37385 PA |
1652 | value_contents_copy (val, idx * typelength, elemvec[idx], 0, |
1653 | typelength); | |
c906108c SS |
1654 | return val; |
1655 | } | |
1656 | ||
63092375 DJ |
1657 | /* Allocate space to store the array, and then initialize it by |
1658 | copying in each element. */ | |
c906108c | 1659 | |
63092375 | 1660 | val = allocate_value (arraytype); |
c906108c | 1661 | for (idx = 0; idx < nelem; idx++) |
39d37385 | 1662 | value_contents_copy (val, idx * typelength, elemvec[idx], 0, typelength); |
63092375 | 1663 | return val; |
c906108c SS |
1664 | } |
1665 | ||
6c7a06a3 | 1666 | struct value * |
e3a3797e | 1667 | value_cstring (const char *ptr, ssize_t len, struct type *char_type) |
6c7a06a3 TT |
1668 | { |
1669 | struct value *val; | |
1670 | int lowbound = current_language->string_lower_bound; | |
63375b74 | 1671 | ssize_t highbound = len / TYPE_LENGTH (char_type); |
6c7a06a3 | 1672 | struct type *stringtype |
e3506a9f | 1673 | = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1); |
6c7a06a3 TT |
1674 | |
1675 | val = allocate_value (stringtype); | |
1676 | memcpy (value_contents_raw (val), ptr, len); | |
1677 | return val; | |
1678 | } | |
1679 | ||
ac3eeb49 MS |
1680 | /* Create a value for a string constant by allocating space in the |
1681 | inferior, copying the data into that space, and returning the | |
1682 | address with type TYPE_CODE_STRING. PTR points to the string | |
1683 | constant data; LEN is number of characters. | |
1684 | ||
1685 | Note that string types are like array of char types with a lower | |
1686 | bound of zero and an upper bound of LEN - 1. Also note that the | |
1687 | string may contain embedded null bytes. */ | |
c906108c | 1688 | |
f23631e4 | 1689 | struct value * |
7cc3f8e2 | 1690 | value_string (const char *ptr, ssize_t len, struct type *char_type) |
c906108c | 1691 | { |
f23631e4 | 1692 | struct value *val; |
c906108c | 1693 | int lowbound = current_language->string_lower_bound; |
63375b74 | 1694 | ssize_t highbound = len / TYPE_LENGTH (char_type); |
c906108c | 1695 | struct type *stringtype |
e3506a9f | 1696 | = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1); |
c906108c | 1697 | |
3b7538c0 UW |
1698 | val = allocate_value (stringtype); |
1699 | memcpy (value_contents_raw (val), ptr, len); | |
1700 | return val; | |
c906108c SS |
1701 | } |
1702 | ||
c906108c | 1703 | \f |
ac3eeb49 MS |
1704 | /* See if we can pass arguments in T2 to a function which takes |
1705 | arguments of types T1. T1 is a list of NARGS arguments, and T2 is | |
1706 | a NULL-terminated vector. If some arguments need coercion of some | |
1707 | sort, then the coerced values are written into T2. Return value is | |
1708 | 0 if the arguments could be matched, or the position at which they | |
1709 | differ if not. | |
c906108c | 1710 | |
ac3eeb49 MS |
1711 | STATICP is nonzero if the T1 argument list came from a static |
1712 | member function. T2 will still include the ``this'' pointer, but | |
1713 | it will be skipped. | |
c906108c SS |
1714 | |
1715 | For non-static member functions, we ignore the first argument, | |
ac3eeb49 MS |
1716 | which is the type of the instance variable. This is because we |
1717 | want to handle calls with objects from derived classes. This is | |
1718 | not entirely correct: we should actually check to make sure that a | |
c906108c SS |
1719 | requested operation is type secure, shouldn't we? FIXME. */ |
1720 | ||
1721 | static int | |
ad2f7632 DJ |
1722 | typecmp (int staticp, int varargs, int nargs, |
1723 | struct field t1[], struct value *t2[]) | |
c906108c SS |
1724 | { |
1725 | int i; | |
1726 | ||
1727 | if (t2 == 0) | |
ac3eeb49 MS |
1728 | internal_error (__FILE__, __LINE__, |
1729 | _("typecmp: no argument list")); | |
ad2f7632 | 1730 | |
ac3eeb49 MS |
1731 | /* Skip ``this'' argument if applicable. T2 will always include |
1732 | THIS. */ | |
4a1970e4 | 1733 | if (staticp) |
ad2f7632 DJ |
1734 | t2 ++; |
1735 | ||
1736 | for (i = 0; | |
1737 | (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID; | |
1738 | i++) | |
c906108c | 1739 | { |
c5aa993b | 1740 | struct type *tt1, *tt2; |
ad2f7632 | 1741 | |
c5aa993b JM |
1742 | if (!t2[i]) |
1743 | return i + 1; | |
ad2f7632 DJ |
1744 | |
1745 | tt1 = check_typedef (t1[i].type); | |
df407dfe | 1746 | tt2 = check_typedef (value_type (t2[i])); |
ad2f7632 | 1747 | |
aa006118 | 1748 | if (TYPE_IS_REFERENCE (tt1) |
8301c89e | 1749 | /* We should be doing hairy argument matching, as below. */ |
3e43a32a MS |
1750 | && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) |
1751 | == TYPE_CODE (tt2))) | |
c906108c SS |
1752 | { |
1753 | if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY) | |
1754 | t2[i] = value_coerce_array (t2[i]); | |
1755 | else | |
a65cfae5 | 1756 | t2[i] = value_ref (t2[i], TYPE_CODE (tt1)); |
c906108c SS |
1757 | continue; |
1758 | } | |
1759 | ||
802db21b DB |
1760 | /* djb - 20000715 - Until the new type structure is in the |
1761 | place, and we can attempt things like implicit conversions, | |
1762 | we need to do this so you can take something like a map<const | |
1763 | char *>, and properly access map["hello"], because the | |
1764 | argument to [] will be a reference to a pointer to a char, | |
ac3eeb49 | 1765 | and the argument will be a pointer to a char. */ |
aa006118 | 1766 | while (TYPE_IS_REFERENCE (tt1) || TYPE_CODE (tt1) == TYPE_CODE_PTR) |
802db21b DB |
1767 | { |
1768 | tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) ); | |
1769 | } | |
ac3eeb49 MS |
1770 | while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY |
1771 | || TYPE_CODE(tt2) == TYPE_CODE_PTR | |
aa006118 | 1772 | || TYPE_IS_REFERENCE (tt2)) |
c906108c | 1773 | { |
ac3eeb49 | 1774 | tt2 = check_typedef (TYPE_TARGET_TYPE(tt2)); |
c906108c | 1775 | } |
c5aa993b JM |
1776 | if (TYPE_CODE (tt1) == TYPE_CODE (tt2)) |
1777 | continue; | |
ac3eeb49 MS |
1778 | /* Array to pointer is a `trivial conversion' according to the |
1779 | ARM. */ | |
c906108c | 1780 | |
ac3eeb49 MS |
1781 | /* We should be doing much hairier argument matching (see |
1782 | section 13.2 of the ARM), but as a quick kludge, just check | |
1783 | for the same type code. */ | |
df407dfe | 1784 | if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i]))) |
c5aa993b | 1785 | return i + 1; |
c906108c | 1786 | } |
ad2f7632 | 1787 | if (varargs || t2[i] == NULL) |
c5aa993b | 1788 | return 0; |
ad2f7632 | 1789 | return i + 1; |
c906108c SS |
1790 | } |
1791 | ||
b1af9e97 TT |
1792 | /* Helper class for do_search_struct_field that updates *RESULT_PTR |
1793 | and *LAST_BOFFSET, and possibly throws an exception if the field | |
1794 | search has yielded ambiguous results. */ | |
c906108c | 1795 | |
b1af9e97 TT |
1796 | static void |
1797 | update_search_result (struct value **result_ptr, struct value *v, | |
6b850546 | 1798 | LONGEST *last_boffset, LONGEST boffset, |
b1af9e97 TT |
1799 | const char *name, struct type *type) |
1800 | { | |
1801 | if (v != NULL) | |
1802 | { | |
1803 | if (*result_ptr != NULL | |
1804 | /* The result is not ambiguous if all the classes that are | |
1805 | found occupy the same space. */ | |
1806 | && *last_boffset != boffset) | |
1807 | error (_("base class '%s' is ambiguous in type '%s'"), | |
1808 | name, TYPE_SAFE_NAME (type)); | |
1809 | *result_ptr = v; | |
1810 | *last_boffset = boffset; | |
1811 | } | |
1812 | } | |
c906108c | 1813 | |
b1af9e97 TT |
1814 | /* A helper for search_struct_field. This does all the work; most |
1815 | arguments are as passed to search_struct_field. The result is | |
1816 | stored in *RESULT_PTR, which must be initialized to NULL. | |
1817 | OUTERMOST_TYPE is the type of the initial type passed to | |
1818 | search_struct_field; this is used for error reporting when the | |
1819 | lookup is ambiguous. */ | |
1820 | ||
1821 | static void | |
6b850546 | 1822 | do_search_struct_field (const char *name, struct value *arg1, LONGEST offset, |
b1af9e97 TT |
1823 | struct type *type, int looking_for_baseclass, |
1824 | struct value **result_ptr, | |
6b850546 | 1825 | LONGEST *last_boffset, |
b1af9e97 | 1826 | struct type *outermost_type) |
c906108c SS |
1827 | { |
1828 | int i; | |
edf3d5f3 | 1829 | int nbases; |
c906108c | 1830 | |
f168693b | 1831 | type = check_typedef (type); |
edf3d5f3 | 1832 | nbases = TYPE_N_BASECLASSES (type); |
c906108c | 1833 | |
c5aa993b | 1834 | if (!looking_for_baseclass) |
c906108c SS |
1835 | for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--) |
1836 | { | |
0d5cff50 | 1837 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
c906108c | 1838 | |
db577aea | 1839 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c | 1840 | { |
f23631e4 | 1841 | struct value *v; |
a109c7c1 | 1842 | |
d6a843b5 | 1843 | if (field_is_static (&TYPE_FIELD (type, i))) |
686d4def | 1844 | v = value_static_field (type, i); |
c906108c | 1845 | else |
b1af9e97 TT |
1846 | v = value_primitive_field (arg1, offset, i, type); |
1847 | *result_ptr = v; | |
1848 | return; | |
c906108c SS |
1849 | } |
1850 | ||
1851 | if (t_field_name | |
47c6ee49 | 1852 | && t_field_name[0] == '\0') |
c906108c SS |
1853 | { |
1854 | struct type *field_type = TYPE_FIELD_TYPE (type, i); | |
a109c7c1 | 1855 | |
c906108c SS |
1856 | if (TYPE_CODE (field_type) == TYPE_CODE_UNION |
1857 | || TYPE_CODE (field_type) == TYPE_CODE_STRUCT) | |
1858 | { | |
ac3eeb49 MS |
1859 | /* Look for a match through the fields of an anonymous |
1860 | union, or anonymous struct. C++ provides anonymous | |
1861 | unions. | |
c906108c | 1862 | |
1b831c93 AC |
1863 | In the GNU Chill (now deleted from GDB) |
1864 | implementation of variant record types, each | |
1865 | <alternative field> has an (anonymous) union type, | |
1866 | each member of the union represents a <variant | |
1867 | alternative>. Each <variant alternative> is | |
1868 | represented as a struct, with a member for each | |
1869 | <variant field>. */ | |
c5aa993b | 1870 | |
b1af9e97 | 1871 | struct value *v = NULL; |
6b850546 | 1872 | LONGEST new_offset = offset; |
c906108c | 1873 | |
db034ac5 AC |
1874 | /* This is pretty gross. In G++, the offset in an |
1875 | anonymous union is relative to the beginning of the | |
1b831c93 AC |
1876 | enclosing struct. In the GNU Chill (now deleted |
1877 | from GDB) implementation of variant records, the | |
1878 | bitpos is zero in an anonymous union field, so we | |
ac3eeb49 | 1879 | have to add the offset of the union here. */ |
c906108c SS |
1880 | if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT |
1881 | || (TYPE_NFIELDS (field_type) > 0 | |
1882 | && TYPE_FIELD_BITPOS (field_type, 0) == 0)) | |
1883 | new_offset += TYPE_FIELD_BITPOS (type, i) / 8; | |
1884 | ||
b1af9e97 TT |
1885 | do_search_struct_field (name, arg1, new_offset, |
1886 | field_type, | |
1887 | looking_for_baseclass, &v, | |
1888 | last_boffset, | |
1889 | outermost_type); | |
c906108c | 1890 | if (v) |
b1af9e97 TT |
1891 | { |
1892 | *result_ptr = v; | |
1893 | return; | |
1894 | } | |
c906108c SS |
1895 | } |
1896 | } | |
1897 | } | |
1898 | ||
c5aa993b | 1899 | for (i = 0; i < nbases; i++) |
c906108c | 1900 | { |
b1af9e97 | 1901 | struct value *v = NULL; |
c906108c | 1902 | struct type *basetype = check_typedef (TYPE_BASECLASS (type, i)); |
ac3eeb49 MS |
1903 | /* If we are looking for baseclasses, this is what we get when |
1904 | we hit them. But it could happen that the base part's member | |
1905 | name is not yet filled in. */ | |
c906108c SS |
1906 | int found_baseclass = (looking_for_baseclass |
1907 | && TYPE_BASECLASS_NAME (type, i) != NULL | |
ac3eeb49 MS |
1908 | && (strcmp_iw (name, |
1909 | TYPE_BASECLASS_NAME (type, | |
1910 | i)) == 0)); | |
6b850546 | 1911 | LONGEST boffset = value_embedded_offset (arg1) + offset; |
c906108c SS |
1912 | |
1913 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
1914 | { | |
3e3d7139 | 1915 | struct value *v2; |
c906108c SS |
1916 | |
1917 | boffset = baseclass_offset (type, i, | |
8af8e3bc PA |
1918 | value_contents_for_printing (arg1), |
1919 | value_embedded_offset (arg1) + offset, | |
1920 | value_address (arg1), | |
1921 | arg1); | |
c906108c | 1922 | |
ac3eeb49 | 1923 | /* The virtual base class pointer might have been clobbered |
581e13c1 | 1924 | by the user program. Make sure that it still points to a |
ac3eeb49 | 1925 | valid memory location. */ |
c906108c | 1926 | |
1a334831 TT |
1927 | boffset += value_embedded_offset (arg1) + offset; |
1928 | if (boffset < 0 | |
1929 | || boffset >= TYPE_LENGTH (value_enclosing_type (arg1))) | |
c906108c SS |
1930 | { |
1931 | CORE_ADDR base_addr; | |
c5aa993b | 1932 | |
42ae5230 | 1933 | base_addr = value_address (arg1) + boffset; |
08039c9e | 1934 | v2 = value_at_lazy (basetype, base_addr); |
ac3eeb49 MS |
1935 | if (target_read_memory (base_addr, |
1936 | value_contents_raw (v2), | |
acc900c2 | 1937 | TYPE_LENGTH (value_type (v2))) != 0) |
8a3fe4f8 | 1938 | error (_("virtual baseclass botch")); |
c906108c SS |
1939 | } |
1940 | else | |
1941 | { | |
1a334831 TT |
1942 | v2 = value_copy (arg1); |
1943 | deprecated_set_value_type (v2, basetype); | |
1944 | set_value_embedded_offset (v2, boffset); | |
c906108c SS |
1945 | } |
1946 | ||
1947 | if (found_baseclass) | |
b1af9e97 TT |
1948 | v = v2; |
1949 | else | |
1950 | { | |
1951 | do_search_struct_field (name, v2, 0, | |
1952 | TYPE_BASECLASS (type, i), | |
1953 | looking_for_baseclass, | |
1954 | result_ptr, last_boffset, | |
1955 | outermost_type); | |
1956 | } | |
c906108c SS |
1957 | } |
1958 | else if (found_baseclass) | |
1959 | v = value_primitive_field (arg1, offset, i, type); | |
1960 | else | |
b1af9e97 TT |
1961 | { |
1962 | do_search_struct_field (name, arg1, | |
1963 | offset + TYPE_BASECLASS_BITPOS (type, | |
1964 | i) / 8, | |
1965 | basetype, looking_for_baseclass, | |
1966 | result_ptr, last_boffset, | |
1967 | outermost_type); | |
1968 | } | |
1969 | ||
1970 | update_search_result (result_ptr, v, last_boffset, | |
1971 | boffset, name, outermost_type); | |
c906108c | 1972 | } |
b1af9e97 TT |
1973 | } |
1974 | ||
1975 | /* Helper function used by value_struct_elt to recurse through | |
8a13d42d SM |
1976 | baseclasses. Look for a field NAME in ARG1. Search in it assuming |
1977 | it has (class) type TYPE. If found, return value, else return NULL. | |
b1af9e97 TT |
1978 | |
1979 | If LOOKING_FOR_BASECLASS, then instead of looking for struct | |
1980 | fields, look for a baseclass named NAME. */ | |
1981 | ||
1982 | static struct value * | |
8a13d42d | 1983 | search_struct_field (const char *name, struct value *arg1, |
b1af9e97 TT |
1984 | struct type *type, int looking_for_baseclass) |
1985 | { | |
1986 | struct value *result = NULL; | |
6b850546 | 1987 | LONGEST boffset = 0; |
b1af9e97 | 1988 | |
8a13d42d | 1989 | do_search_struct_field (name, arg1, 0, type, looking_for_baseclass, |
b1af9e97 TT |
1990 | &result, &boffset, type); |
1991 | return result; | |
c906108c SS |
1992 | } |
1993 | ||
ac3eeb49 | 1994 | /* Helper function used by value_struct_elt to recurse through |
581e13c1 | 1995 | baseclasses. Look for a field NAME in ARG1. Adjust the address of |
ac3eeb49 MS |
1996 | ARG1 by OFFSET bytes, and search in it assuming it has (class) type |
1997 | TYPE. | |
1998 | ||
1999 | If found, return value, else if name matched and args not return | |
2000 | (value) -1, else return NULL. */ | |
c906108c | 2001 | |
f23631e4 | 2002 | static struct value * |
714f19d5 | 2003 | search_struct_method (const char *name, struct value **arg1p, |
6b850546 | 2004 | struct value **args, LONGEST offset, |
aa1ee363 | 2005 | int *static_memfuncp, struct type *type) |
c906108c SS |
2006 | { |
2007 | int i; | |
f23631e4 | 2008 | struct value *v; |
c906108c SS |
2009 | int name_matched = 0; |
2010 | char dem_opname[64]; | |
2011 | ||
f168693b | 2012 | type = check_typedef (type); |
c906108c SS |
2013 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) |
2014 | { | |
0d5cff50 | 2015 | const char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i); |
a109c7c1 | 2016 | |
581e13c1 | 2017 | /* FIXME! May need to check for ARM demangling here. */ |
61012eef GB |
2018 | if (startswith (t_field_name, "__") || |
2019 | startswith (t_field_name, "op") || | |
2020 | startswith (t_field_name, "type")) | |
c906108c | 2021 | { |
c5aa993b JM |
2022 | if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI)) |
2023 | t_field_name = dem_opname; | |
2024 | else if (cplus_demangle_opname (t_field_name, dem_opname, 0)) | |
c906108c | 2025 | t_field_name = dem_opname; |
c906108c | 2026 | } |
db577aea | 2027 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2028 | { |
2029 | int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1; | |
2030 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
c906108c | 2031 | |
a109c7c1 | 2032 | name_matched = 1; |
de17c821 | 2033 | check_stub_method_group (type, i); |
c906108c | 2034 | if (j > 0 && args == 0) |
3e43a32a MS |
2035 | error (_("cannot resolve overloaded method " |
2036 | "`%s': no arguments supplied"), name); | |
acf5ed49 | 2037 | else if (j == 0 && args == 0) |
c906108c | 2038 | { |
acf5ed49 DJ |
2039 | v = value_fn_field (arg1p, f, j, type, offset); |
2040 | if (v != NULL) | |
2041 | return v; | |
c906108c | 2042 | } |
acf5ed49 DJ |
2043 | else |
2044 | while (j >= 0) | |
2045 | { | |
acf5ed49 | 2046 | if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j), |
ad2f7632 DJ |
2047 | TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)), |
2048 | TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)), | |
acf5ed49 DJ |
2049 | TYPE_FN_FIELD_ARGS (f, j), args)) |
2050 | { | |
2051 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) | |
ac3eeb49 MS |
2052 | return value_virtual_fn_field (arg1p, f, j, |
2053 | type, offset); | |
2054 | if (TYPE_FN_FIELD_STATIC_P (f, j) | |
2055 | && static_memfuncp) | |
acf5ed49 DJ |
2056 | *static_memfuncp = 1; |
2057 | v = value_fn_field (arg1p, f, j, type, offset); | |
2058 | if (v != NULL) | |
2059 | return v; | |
2060 | } | |
2061 | j--; | |
2062 | } | |
c906108c SS |
2063 | } |
2064 | } | |
2065 | ||
2066 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
2067 | { | |
6b850546 DT |
2068 | LONGEST base_offset; |
2069 | LONGEST this_offset; | |
c906108c SS |
2070 | |
2071 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2072 | { | |
086280be | 2073 | struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i)); |
8af8e3bc | 2074 | struct value *base_val; |
086280be UW |
2075 | const gdb_byte *base_valaddr; |
2076 | ||
2077 | /* The virtual base class pointer might have been | |
581e13c1 | 2078 | clobbered by the user program. Make sure that it |
8301c89e | 2079 | still points to a valid memory location. */ |
086280be UW |
2080 | |
2081 | if (offset < 0 || offset >= TYPE_LENGTH (type)) | |
c5aa993b | 2082 | { |
6c18f3e0 SP |
2083 | CORE_ADDR address; |
2084 | ||
26fcd5d7 | 2085 | gdb::byte_vector tmp (TYPE_LENGTH (baseclass)); |
6c18f3e0 | 2086 | address = value_address (*arg1p); |
a109c7c1 | 2087 | |
8af8e3bc | 2088 | if (target_read_memory (address + offset, |
26fcd5d7 | 2089 | tmp.data (), TYPE_LENGTH (baseclass)) != 0) |
086280be | 2090 | error (_("virtual baseclass botch")); |
8af8e3bc PA |
2091 | |
2092 | base_val = value_from_contents_and_address (baseclass, | |
26fcd5d7 | 2093 | tmp.data (), |
8af8e3bc PA |
2094 | address + offset); |
2095 | base_valaddr = value_contents_for_printing (base_val); | |
2096 | this_offset = 0; | |
c5aa993b JM |
2097 | } |
2098 | else | |
8af8e3bc PA |
2099 | { |
2100 | base_val = *arg1p; | |
2101 | base_valaddr = value_contents_for_printing (*arg1p); | |
2102 | this_offset = offset; | |
2103 | } | |
c5aa993b | 2104 | |
086280be | 2105 | base_offset = baseclass_offset (type, i, base_valaddr, |
8af8e3bc PA |
2106 | this_offset, value_address (base_val), |
2107 | base_val); | |
c5aa993b | 2108 | } |
c906108c SS |
2109 | else |
2110 | { | |
2111 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2112 | } |
c906108c SS |
2113 | v = search_struct_method (name, arg1p, args, base_offset + offset, |
2114 | static_memfuncp, TYPE_BASECLASS (type, i)); | |
f23631e4 | 2115 | if (v == (struct value *) - 1) |
c906108c SS |
2116 | { |
2117 | name_matched = 1; | |
2118 | } | |
2119 | else if (v) | |
2120 | { | |
ac3eeb49 MS |
2121 | /* FIXME-bothner: Why is this commented out? Why is it here? */ |
2122 | /* *arg1p = arg1_tmp; */ | |
c906108c | 2123 | return v; |
c5aa993b | 2124 | } |
c906108c | 2125 | } |
c5aa993b | 2126 | if (name_matched) |
f23631e4 | 2127 | return (struct value *) - 1; |
c5aa993b JM |
2128 | else |
2129 | return NULL; | |
c906108c SS |
2130 | } |
2131 | ||
2132 | /* Given *ARGP, a value of type (pointer to a)* structure/union, | |
ac3eeb49 MS |
2133 | extract the component named NAME from the ultimate target |
2134 | structure/union and return it as a value with its appropriate type. | |
c906108c SS |
2135 | ERR is used in the error message if *ARGP's type is wrong. |
2136 | ||
2137 | C++: ARGS is a list of argument types to aid in the selection of | |
581e13c1 | 2138 | an appropriate method. Also, handle derived types. |
c906108c SS |
2139 | |
2140 | STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location | |
2141 | where the truthvalue of whether the function that was resolved was | |
2142 | a static member function or not is stored. | |
2143 | ||
ac3eeb49 MS |
2144 | ERR is an error message to be printed in case the field is not |
2145 | found. */ | |
c906108c | 2146 | |
f23631e4 AC |
2147 | struct value * |
2148 | value_struct_elt (struct value **argp, struct value **args, | |
714f19d5 | 2149 | const char *name, int *static_memfuncp, const char *err) |
c906108c | 2150 | { |
52f0bd74 | 2151 | struct type *t; |
f23631e4 | 2152 | struct value *v; |
c906108c | 2153 | |
994b9211 | 2154 | *argp = coerce_array (*argp); |
c906108c | 2155 | |
df407dfe | 2156 | t = check_typedef (value_type (*argp)); |
c906108c SS |
2157 | |
2158 | /* Follow pointers until we get to a non-pointer. */ | |
2159 | ||
aa006118 | 2160 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
c906108c SS |
2161 | { |
2162 | *argp = value_ind (*argp); | |
2163 | /* Don't coerce fn pointer to fn and then back again! */ | |
b846d303 | 2164 | if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC) |
994b9211 | 2165 | *argp = coerce_array (*argp); |
df407dfe | 2166 | t = check_typedef (value_type (*argp)); |
c906108c SS |
2167 | } |
2168 | ||
c5aa993b | 2169 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c | 2170 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
3e43a32a MS |
2171 | error (_("Attempt to extract a component of a value that is not a %s."), |
2172 | err); | |
c906108c SS |
2173 | |
2174 | /* Assume it's not, unless we see that it is. */ | |
2175 | if (static_memfuncp) | |
c5aa993b | 2176 | *static_memfuncp = 0; |
c906108c SS |
2177 | |
2178 | if (!args) | |
2179 | { | |
2180 | /* if there are no arguments ...do this... */ | |
2181 | ||
ac3eeb49 MS |
2182 | /* Try as a field first, because if we succeed, there is less |
2183 | work to be done. */ | |
8a13d42d | 2184 | v = search_struct_field (name, *argp, t, 0); |
c906108c SS |
2185 | if (v) |
2186 | return v; | |
2187 | ||
2188 | /* C++: If it was not found as a data field, then try to | |
7b83ea04 | 2189 | return it as a pointer to a method. */ |
ac3eeb49 MS |
2190 | v = search_struct_method (name, argp, args, 0, |
2191 | static_memfuncp, t); | |
c906108c | 2192 | |
f23631e4 | 2193 | if (v == (struct value *) - 1) |
55b39184 | 2194 | error (_("Cannot take address of method %s."), name); |
c906108c SS |
2195 | else if (v == 0) |
2196 | { | |
2197 | if (TYPE_NFN_FIELDS (t)) | |
8a3fe4f8 | 2198 | error (_("There is no member or method named %s."), name); |
c906108c | 2199 | else |
8a3fe4f8 | 2200 | error (_("There is no member named %s."), name); |
c906108c SS |
2201 | } |
2202 | return v; | |
2203 | } | |
2204 | ||
8301c89e DE |
2205 | v = search_struct_method (name, argp, args, 0, |
2206 | static_memfuncp, t); | |
7168a814 | 2207 | |
f23631e4 | 2208 | if (v == (struct value *) - 1) |
c906108c | 2209 | { |
3e43a32a MS |
2210 | error (_("One of the arguments you tried to pass to %s could not " |
2211 | "be converted to what the function wants."), name); | |
c906108c SS |
2212 | } |
2213 | else if (v == 0) | |
2214 | { | |
ac3eeb49 MS |
2215 | /* See if user tried to invoke data as function. If so, hand it |
2216 | back. If it's not callable (i.e., a pointer to function), | |
7b83ea04 | 2217 | gdb should give an error. */ |
8a13d42d | 2218 | v = search_struct_field (name, *argp, t, 0); |
fa8de41e TT |
2219 | /* If we found an ordinary field, then it is not a method call. |
2220 | So, treat it as if it were a static member function. */ | |
2221 | if (v && static_memfuncp) | |
2222 | *static_memfuncp = 1; | |
c906108c SS |
2223 | } |
2224 | ||
2225 | if (!v) | |
79afc5ef SW |
2226 | throw_error (NOT_FOUND_ERROR, |
2227 | _("Structure has no component named %s."), name); | |
c906108c SS |
2228 | return v; |
2229 | } | |
2230 | ||
b5b08fb4 SC |
2231 | /* Given *ARGP, a value of type structure or union, or a pointer/reference |
2232 | to a structure or union, extract and return its component (field) of | |
2233 | type FTYPE at the specified BITPOS. | |
2234 | Throw an exception on error. */ | |
2235 | ||
2236 | struct value * | |
2237 | value_struct_elt_bitpos (struct value **argp, int bitpos, struct type *ftype, | |
2238 | const char *err) | |
2239 | { | |
2240 | struct type *t; | |
b5b08fb4 | 2241 | int i; |
b5b08fb4 SC |
2242 | |
2243 | *argp = coerce_array (*argp); | |
2244 | ||
2245 | t = check_typedef (value_type (*argp)); | |
2246 | ||
aa006118 | 2247 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
b5b08fb4 SC |
2248 | { |
2249 | *argp = value_ind (*argp); | |
2250 | if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC) | |
2251 | *argp = coerce_array (*argp); | |
2252 | t = check_typedef (value_type (*argp)); | |
2253 | } | |
2254 | ||
2255 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT | |
2256 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
2257 | error (_("Attempt to extract a component of a value that is not a %s."), | |
2258 | err); | |
2259 | ||
2260 | for (i = TYPE_N_BASECLASSES (t); i < TYPE_NFIELDS (t); i++) | |
2261 | { | |
2262 | if (!field_is_static (&TYPE_FIELD (t, i)) | |
2263 | && bitpos == TYPE_FIELD_BITPOS (t, i) | |
2264 | && types_equal (ftype, TYPE_FIELD_TYPE (t, i))) | |
2265 | return value_primitive_field (*argp, 0, i, t); | |
2266 | } | |
2267 | ||
2268 | error (_("No field with matching bitpos and type.")); | |
2269 | ||
2270 | /* Never hit. */ | |
2271 | return NULL; | |
2272 | } | |
2273 | ||
ac3eeb49 | 2274 | /* Search through the methods of an object (and its bases) to find a |
233e8b28 SC |
2275 | specified method. Return the pointer to the fn_field list FN_LIST of |
2276 | overloaded instances defined in the source language. If available | |
2277 | and matching, a vector of matching xmethods defined in extension | |
2278 | languages are also returned in XM_WORKER_VEC | |
ac3eeb49 MS |
2279 | |
2280 | Helper function for value_find_oload_list. | |
2281 | ARGP is a pointer to a pointer to a value (the object). | |
2282 | METHOD is a string containing the method name. | |
2283 | OFFSET is the offset within the value. | |
2284 | TYPE is the assumed type of the object. | |
233e8b28 SC |
2285 | FN_LIST is the pointer to matching overloaded instances defined in |
2286 | source language. Since this is a recursive function, *FN_LIST | |
2287 | should be set to NULL when calling this function. | |
2288 | NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to | |
2289 | 0 when calling this function. | |
2290 | XM_WORKER_VEC is the vector of matching xmethod workers. *XM_WORKER_VEC | |
2291 | should also be set to NULL when calling this function. | |
ac3eeb49 MS |
2292 | BASETYPE is set to the actual type of the subobject where the |
2293 | method is found. | |
581e13c1 | 2294 | BOFFSET is the offset of the base subobject where the method is found. */ |
c906108c | 2295 | |
233e8b28 | 2296 | static void |
714f19d5 | 2297 | find_method_list (struct value **argp, const char *method, |
6b850546 | 2298 | LONGEST offset, struct type *type, |
233e8b28 SC |
2299 | struct fn_field **fn_list, int *num_fns, |
2300 | VEC (xmethod_worker_ptr) **xm_worker_vec, | |
6b850546 | 2301 | struct type **basetype, LONGEST *boffset) |
c906108c SS |
2302 | { |
2303 | int i; | |
233e8b28 SC |
2304 | struct fn_field *f = NULL; |
2305 | VEC (xmethod_worker_ptr) *worker_vec = NULL, *new_vec = NULL; | |
c906108c | 2306 | |
233e8b28 | 2307 | gdb_assert (fn_list != NULL && xm_worker_vec != NULL); |
f168693b | 2308 | type = check_typedef (type); |
c906108c | 2309 | |
233e8b28 SC |
2310 | /* First check in object itself. |
2311 | This function is called recursively to search through base classes. | |
2312 | If there is a source method match found at some stage, then we need not | |
2313 | look for source methods in consequent recursive calls. */ | |
2314 | if ((*fn_list) == NULL) | |
c906108c | 2315 | { |
233e8b28 | 2316 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) |
c5aa993b | 2317 | { |
233e8b28 SC |
2318 | /* pai: FIXME What about operators and type conversions? */ |
2319 | const char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i); | |
2320 | ||
2321 | if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0)) | |
2322 | { | |
2323 | int len = TYPE_FN_FIELDLIST_LENGTH (type, i); | |
2324 | f = TYPE_FN_FIELDLIST1 (type, i); | |
2325 | *fn_list = f; | |
4a1970e4 | 2326 | |
233e8b28 SC |
2327 | *num_fns = len; |
2328 | *basetype = type; | |
2329 | *boffset = offset; | |
4a1970e4 | 2330 | |
233e8b28 SC |
2331 | /* Resolve any stub methods. */ |
2332 | check_stub_method_group (type, i); | |
4a1970e4 | 2333 | |
233e8b28 SC |
2334 | break; |
2335 | } | |
c5aa993b JM |
2336 | } |
2337 | } | |
2338 | ||
233e8b28 SC |
2339 | /* Unlike source methods, xmethods can be accumulated over successive |
2340 | recursive calls. In other words, an xmethod named 'm' in a class | |
2341 | will not hide an xmethod named 'm' in its base class(es). We want | |
2342 | it to be this way because xmethods are after all convenience functions | |
2343 | and hence there is no point restricting them with something like method | |
2344 | hiding. Moreover, if hiding is done for xmethods as well, then we will | |
2345 | have to provide a mechanism to un-hide (like the 'using' construct). */ | |
2346 | worker_vec = get_matching_xmethod_workers (type, method); | |
2347 | new_vec = VEC_merge (xmethod_worker_ptr, *xm_worker_vec, worker_vec); | |
2348 | ||
2349 | VEC_free (xmethod_worker_ptr, *xm_worker_vec); | |
2350 | VEC_free (xmethod_worker_ptr, worker_vec); | |
2351 | *xm_worker_vec = new_vec; | |
2352 | ||
2353 | /* If source methods are not found in current class, look for them in the | |
2354 | base classes. We also have to go through the base classes to gather | |
2355 | extension methods. */ | |
c906108c SS |
2356 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) |
2357 | { | |
6b850546 | 2358 | LONGEST base_offset; |
a109c7c1 | 2359 | |
c906108c SS |
2360 | if (BASETYPE_VIA_VIRTUAL (type, i)) |
2361 | { | |
086280be | 2362 | base_offset = baseclass_offset (type, i, |
8af8e3bc PA |
2363 | value_contents_for_printing (*argp), |
2364 | value_offset (*argp) + offset, | |
2365 | value_address (*argp), *argp); | |
c5aa993b | 2366 | } |
ac3eeb49 MS |
2367 | else /* Non-virtual base, simply use bit position from debug |
2368 | info. */ | |
c906108c SS |
2369 | { |
2370 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2371 | } |
233e8b28 SC |
2372 | |
2373 | find_method_list (argp, method, base_offset + offset, | |
2374 | TYPE_BASECLASS (type, i), fn_list, num_fns, | |
2375 | xm_worker_vec, basetype, boffset); | |
c906108c | 2376 | } |
c906108c SS |
2377 | } |
2378 | ||
233e8b28 SC |
2379 | /* Return the list of overloaded methods of a specified name. The methods |
2380 | could be those GDB finds in the binary, or xmethod. Methods found in | |
2381 | the binary are returned in FN_LIST, and xmethods are returned in | |
2382 | XM_WORKER_VEC. | |
ac3eeb49 MS |
2383 | |
2384 | ARGP is a pointer to a pointer to a value (the object). | |
2385 | METHOD is the method name. | |
2386 | OFFSET is the offset within the value contents. | |
233e8b28 SC |
2387 | FN_LIST is the pointer to matching overloaded instances defined in |
2388 | source language. | |
ac3eeb49 | 2389 | NUM_FNS is the number of overloaded instances. |
233e8b28 SC |
2390 | XM_WORKER_VEC is the vector of matching xmethod workers defined in |
2391 | extension languages. | |
ac3eeb49 MS |
2392 | BASETYPE is set to the type of the base subobject that defines the |
2393 | method. | |
581e13c1 | 2394 | BOFFSET is the offset of the base subobject which defines the method. */ |
c906108c | 2395 | |
233e8b28 | 2396 | static void |
714f19d5 | 2397 | value_find_oload_method_list (struct value **argp, const char *method, |
6b850546 | 2398 | LONGEST offset, struct fn_field **fn_list, |
233e8b28 SC |
2399 | int *num_fns, |
2400 | VEC (xmethod_worker_ptr) **xm_worker_vec, | |
6b850546 | 2401 | struct type **basetype, LONGEST *boffset) |
c906108c | 2402 | { |
c5aa993b | 2403 | struct type *t; |
c906108c | 2404 | |
df407dfe | 2405 | t = check_typedef (value_type (*argp)); |
c906108c | 2406 | |
ac3eeb49 | 2407 | /* Code snarfed from value_struct_elt. */ |
aa006118 | 2408 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
c906108c SS |
2409 | { |
2410 | *argp = value_ind (*argp); | |
2411 | /* Don't coerce fn pointer to fn and then back again! */ | |
b846d303 | 2412 | if (TYPE_CODE (check_typedef (value_type (*argp))) != TYPE_CODE_FUNC) |
994b9211 | 2413 | *argp = coerce_array (*argp); |
df407dfe | 2414 | t = check_typedef (value_type (*argp)); |
c906108c | 2415 | } |
c5aa993b | 2416 | |
c5aa993b JM |
2417 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
2418 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
3e43a32a MS |
2419 | error (_("Attempt to extract a component of a " |
2420 | "value that is not a struct or union")); | |
c5aa993b | 2421 | |
233e8b28 SC |
2422 | gdb_assert (fn_list != NULL && xm_worker_vec != NULL); |
2423 | ||
2424 | /* Clear the lists. */ | |
2425 | *fn_list = NULL; | |
2426 | *num_fns = 0; | |
2427 | *xm_worker_vec = NULL; | |
2428 | ||
2429 | find_method_list (argp, method, 0, t, fn_list, num_fns, xm_worker_vec, | |
2430 | basetype, boffset); | |
c906108c SS |
2431 | } |
2432 | ||
da096638 | 2433 | /* Given an array of arguments (ARGS) (which includes an |
c906108c | 2434 | entry for "this" in the case of C++ methods), the number of |
28c64fc2 SCR |
2435 | arguments NARGS, the NAME of a function, and whether it's a method or |
2436 | not (METHOD), find the best function that matches on the argument types | |
2437 | according to the overload resolution rules. | |
c906108c | 2438 | |
4c3376c8 SW |
2439 | METHOD can be one of three values: |
2440 | NON_METHOD for non-member functions. | |
2441 | METHOD: for member functions. | |
2442 | BOTH: used for overload resolution of operators where the | |
2443 | candidates are expected to be either member or non member | |
581e13c1 | 2444 | functions. In this case the first argument ARGTYPES |
4c3376c8 SW |
2445 | (representing 'this') is expected to be a reference to the |
2446 | target object, and will be dereferenced when attempting the | |
2447 | non-member search. | |
2448 | ||
c906108c SS |
2449 | In the case of class methods, the parameter OBJ is an object value |
2450 | in which to search for overloaded methods. | |
2451 | ||
2452 | In the case of non-method functions, the parameter FSYM is a symbol | |
2453 | corresponding to one of the overloaded functions. | |
2454 | ||
2455 | Return value is an integer: 0 -> good match, 10 -> debugger applied | |
2456 | non-standard coercions, 100 -> incompatible. | |
2457 | ||
2458 | If a method is being searched for, VALP will hold the value. | |
ac3eeb49 MS |
2459 | If a non-method is being searched for, SYMP will hold the symbol |
2460 | for it. | |
c906108c SS |
2461 | |
2462 | If a method is being searched for, and it is a static method, | |
2463 | then STATICP will point to a non-zero value. | |
2464 | ||
7322dca9 SW |
2465 | If NO_ADL argument dependent lookup is disabled. This is used to prevent |
2466 | ADL overload candidates when performing overload resolution for a fully | |
2467 | qualified name. | |
2468 | ||
e66d4446 SC |
2469 | If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be |
2470 | read while picking the best overload match (it may be all zeroes and thus | |
2471 | not have a vtable pointer), in which case skip virtual function lookup. | |
2472 | This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine | |
2473 | the result type. | |
2474 | ||
c906108c SS |
2475 | Note: This function does *not* check the value of |
2476 | overload_resolution. Caller must check it to see whether overload | |
581e13c1 | 2477 | resolution is permitted. */ |
c906108c SS |
2478 | |
2479 | int | |
da096638 | 2480 | find_overload_match (struct value **args, int nargs, |
4c3376c8 | 2481 | const char *name, enum oload_search_type method, |
28c64fc2 | 2482 | struct value **objp, struct symbol *fsym, |
ac3eeb49 | 2483 | struct value **valp, struct symbol **symp, |
e66d4446 SC |
2484 | int *staticp, const int no_adl, |
2485 | const enum noside noside) | |
c906108c | 2486 | { |
7f8c9282 | 2487 | struct value *obj = (objp ? *objp : NULL); |
da096638 | 2488 | struct type *obj_type = obj ? value_type (obj) : NULL; |
ac3eeb49 | 2489 | /* Index of best overloaded function. */ |
4c3376c8 SW |
2490 | int func_oload_champ = -1; |
2491 | int method_oload_champ = -1; | |
233e8b28 SC |
2492 | int src_method_oload_champ = -1; |
2493 | int ext_method_oload_champ = -1; | |
4c3376c8 | 2494 | |
ac3eeb49 | 2495 | /* The measure for the current best match. */ |
4c3376c8 SW |
2496 | struct badness_vector *method_badness = NULL; |
2497 | struct badness_vector *func_badness = NULL; | |
233e8b28 SC |
2498 | struct badness_vector *ext_method_badness = NULL; |
2499 | struct badness_vector *src_method_badness = NULL; | |
4c3376c8 | 2500 | |
f23631e4 | 2501 | struct value *temp = obj; |
ac3eeb49 MS |
2502 | /* For methods, the list of overloaded methods. */ |
2503 | struct fn_field *fns_ptr = NULL; | |
2504 | /* For non-methods, the list of overloaded function symbols. */ | |
2505 | struct symbol **oload_syms = NULL; | |
233e8b28 SC |
2506 | /* For xmethods, the VEC of xmethod workers. */ |
2507 | VEC (xmethod_worker_ptr) *xm_worker_vec = NULL; | |
ac3eeb49 MS |
2508 | /* Number of overloaded instances being considered. */ |
2509 | int num_fns = 0; | |
c5aa993b | 2510 | struct type *basetype = NULL; |
6b850546 | 2511 | LONGEST boffset; |
7322dca9 SW |
2512 | |
2513 | struct cleanup *all_cleanups = make_cleanup (null_cleanup, NULL); | |
c906108c | 2514 | |
8d577d32 | 2515 | const char *obj_type_name = NULL; |
7322dca9 | 2516 | const char *func_name = NULL; |
8d577d32 | 2517 | enum oload_classification match_quality; |
4c3376c8 | 2518 | enum oload_classification method_match_quality = INCOMPATIBLE; |
233e8b28 SC |
2519 | enum oload_classification src_method_match_quality = INCOMPATIBLE; |
2520 | enum oload_classification ext_method_match_quality = INCOMPATIBLE; | |
4c3376c8 | 2521 | enum oload_classification func_match_quality = INCOMPATIBLE; |
c906108c | 2522 | |
ac3eeb49 | 2523 | /* Get the list of overloaded methods or functions. */ |
4c3376c8 | 2524 | if (method == METHOD || method == BOTH) |
c906108c | 2525 | { |
a2ca50ae | 2526 | gdb_assert (obj); |
94af9270 KS |
2527 | |
2528 | /* OBJ may be a pointer value rather than the object itself. */ | |
2529 | obj = coerce_ref (obj); | |
2530 | while (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_PTR) | |
2531 | obj = coerce_ref (value_ind (obj)); | |
df407dfe | 2532 | obj_type_name = TYPE_NAME (value_type (obj)); |
94af9270 KS |
2533 | |
2534 | /* First check whether this is a data member, e.g. a pointer to | |
2535 | a function. */ | |
2536 | if (TYPE_CODE (check_typedef (value_type (obj))) == TYPE_CODE_STRUCT) | |
2537 | { | |
8a13d42d | 2538 | *valp = search_struct_field (name, obj, |
94af9270 KS |
2539 | check_typedef (value_type (obj)), 0); |
2540 | if (*valp) | |
2541 | { | |
2542 | *staticp = 1; | |
f748fb40 | 2543 | do_cleanups (all_cleanups); |
94af9270 KS |
2544 | return 0; |
2545 | } | |
2546 | } | |
c906108c | 2547 | |
4c3376c8 | 2548 | /* Retrieve the list of methods with the name NAME. */ |
233e8b28 SC |
2549 | value_find_oload_method_list (&temp, name, 0, &fns_ptr, &num_fns, |
2550 | &xm_worker_vec, &basetype, &boffset); | |
4c3376c8 SW |
2551 | /* If this is a method only search, and no methods were found |
2552 | the search has faild. */ | |
233e8b28 | 2553 | if (method == METHOD && (!fns_ptr || !num_fns) && !xm_worker_vec) |
8a3fe4f8 | 2554 | error (_("Couldn't find method %s%s%s"), |
c5aa993b JM |
2555 | obj_type_name, |
2556 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2557 | name); | |
4a1970e4 | 2558 | /* If we are dealing with stub method types, they should have |
ac3eeb49 MS |
2559 | been resolved by find_method_list via |
2560 | value_find_oload_method_list above. */ | |
4c3376c8 SW |
2561 | if (fns_ptr) |
2562 | { | |
4bfb94b8 | 2563 | gdb_assert (TYPE_SELF_TYPE (fns_ptr[0].type) != NULL); |
4c3376c8 | 2564 | |
233e8b28 SC |
2565 | src_method_oload_champ = find_oload_champ (args, nargs, |
2566 | num_fns, fns_ptr, NULL, | |
2567 | NULL, &src_method_badness); | |
2568 | ||
2569 | src_method_match_quality = classify_oload_match | |
2570 | (src_method_badness, nargs, | |
2571 | oload_method_static_p (fns_ptr, src_method_oload_champ)); | |
2572 | ||
2573 | make_cleanup (xfree, src_method_badness); | |
2574 | } | |
4c3376c8 | 2575 | |
233e8b28 SC |
2576 | if (VEC_length (xmethod_worker_ptr, xm_worker_vec) > 0) |
2577 | { | |
2578 | ext_method_oload_champ = find_oload_champ (args, nargs, | |
2579 | 0, NULL, xm_worker_vec, | |
2580 | NULL, &ext_method_badness); | |
2581 | ext_method_match_quality = classify_oload_match (ext_method_badness, | |
2582 | nargs, 0); | |
2583 | make_cleanup (xfree, ext_method_badness); | |
2584 | make_cleanup (free_xmethod_worker_vec, xm_worker_vec); | |
4c3376c8 SW |
2585 | } |
2586 | ||
233e8b28 SC |
2587 | if (src_method_oload_champ >= 0 && ext_method_oload_champ >= 0) |
2588 | { | |
2589 | switch (compare_badness (ext_method_badness, src_method_badness)) | |
2590 | { | |
2591 | case 0: /* Src method and xmethod are equally good. */ | |
233e8b28 SC |
2592 | /* If src method and xmethod are equally good, then |
2593 | xmethod should be the winner. Hence, fall through to the | |
2594 | case where a xmethod is better than the source | |
2595 | method, except when the xmethod match quality is | |
2596 | non-standard. */ | |
2597 | /* FALLTHROUGH */ | |
2598 | case 1: /* Src method and ext method are incompatible. */ | |
2599 | /* If ext method match is not standard, then let source method | |
2600 | win. Otherwise, fallthrough to let xmethod win. */ | |
2601 | if (ext_method_match_quality != STANDARD) | |
2602 | { | |
2603 | method_oload_champ = src_method_oload_champ; | |
2604 | method_badness = src_method_badness; | |
2605 | ext_method_oload_champ = -1; | |
2606 | method_match_quality = src_method_match_quality; | |
2607 | break; | |
2608 | } | |
2609 | /* FALLTHROUGH */ | |
2610 | case 2: /* Ext method is champion. */ | |
2611 | method_oload_champ = ext_method_oload_champ; | |
2612 | method_badness = ext_method_badness; | |
2613 | src_method_oload_champ = -1; | |
2614 | method_match_quality = ext_method_match_quality; | |
2615 | break; | |
2616 | case 3: /* Src method is champion. */ | |
2617 | method_oload_champ = src_method_oload_champ; | |
2618 | method_badness = src_method_badness; | |
2619 | ext_method_oload_champ = -1; | |
2620 | method_match_quality = src_method_match_quality; | |
2621 | break; | |
2622 | default: | |
2623 | gdb_assert_not_reached ("Unexpected overload comparison " | |
2624 | "result"); | |
2625 | break; | |
2626 | } | |
2627 | } | |
2628 | else if (src_method_oload_champ >= 0) | |
2629 | { | |
2630 | method_oload_champ = src_method_oload_champ; | |
2631 | method_badness = src_method_badness; | |
2632 | method_match_quality = src_method_match_quality; | |
2633 | } | |
2634 | else if (ext_method_oload_champ >= 0) | |
2635 | { | |
2636 | method_oload_champ = ext_method_oload_champ; | |
2637 | method_badness = ext_method_badness; | |
2638 | method_match_quality = ext_method_match_quality; | |
2639 | } | |
c906108c | 2640 | } |
4c3376c8 SW |
2641 | |
2642 | if (method == NON_METHOD || method == BOTH) | |
c906108c | 2643 | { |
7322dca9 | 2644 | const char *qualified_name = NULL; |
c906108c | 2645 | |
b021a221 MS |
2646 | /* If the overload match is being search for both as a method |
2647 | and non member function, the first argument must now be | |
2648 | dereferenced. */ | |
4c3376c8 | 2649 | if (method == BOTH) |
2b214ea6 | 2650 | args[0] = value_ind (args[0]); |
4c3376c8 | 2651 | |
7322dca9 SW |
2652 | if (fsym) |
2653 | { | |
2654 | qualified_name = SYMBOL_NATURAL_NAME (fsym); | |
2655 | ||
2656 | /* If we have a function with a C++ name, try to extract just | |
2657 | the function part. Do not try this for non-functions (e.g. | |
2658 | function pointers). */ | |
2659 | if (qualified_name | |
3e43a32a MS |
2660 | && TYPE_CODE (check_typedef (SYMBOL_TYPE (fsym))) |
2661 | == TYPE_CODE_FUNC) | |
7322dca9 SW |
2662 | { |
2663 | char *temp; | |
2664 | ||
2665 | temp = cp_func_name (qualified_name); | |
2666 | ||
2667 | /* If cp_func_name did not remove anything, the name of the | |
2668 | symbol did not include scope or argument types - it was | |
2669 | probably a C-style function. */ | |
2670 | if (temp) | |
2671 | { | |
2672 | make_cleanup (xfree, temp); | |
2673 | if (strcmp (temp, qualified_name) == 0) | |
2674 | func_name = NULL; | |
2675 | else | |
2676 | func_name = temp; | |
2677 | } | |
2678 | } | |
2679 | } | |
2680 | else | |
94af9270 | 2681 | { |
7322dca9 SW |
2682 | func_name = name; |
2683 | qualified_name = name; | |
94af9270 | 2684 | } |
d9639e13 | 2685 | |
94af9270 KS |
2686 | /* If there was no C++ name, this must be a C-style function or |
2687 | not a function at all. Just return the same symbol. Do the | |
2688 | same if cp_func_name fails for some reason. */ | |
8d577d32 | 2689 | if (func_name == NULL) |
7b83ea04 | 2690 | { |
917317f4 | 2691 | *symp = fsym; |
5fe41fbf | 2692 | do_cleanups (all_cleanups); |
7b83ea04 AC |
2693 | return 0; |
2694 | } | |
917317f4 | 2695 | |
da096638 | 2696 | func_oload_champ = find_oload_champ_namespace (args, nargs, |
4c3376c8 SW |
2697 | func_name, |
2698 | qualified_name, | |
2699 | &oload_syms, | |
2700 | &func_badness, | |
2701 | no_adl); | |
8d577d32 | 2702 | |
4c3376c8 SW |
2703 | if (func_oload_champ >= 0) |
2704 | func_match_quality = classify_oload_match (func_badness, nargs, 0); | |
2705 | ||
2706 | make_cleanup (xfree, oload_syms); | |
2707 | make_cleanup (xfree, func_badness); | |
8d577d32 DC |
2708 | } |
2709 | ||
7322dca9 | 2710 | /* Did we find a match ? */ |
4c3376c8 | 2711 | if (method_oload_champ == -1 && func_oload_champ == -1) |
79afc5ef SW |
2712 | throw_error (NOT_FOUND_ERROR, |
2713 | _("No symbol \"%s\" in current context."), | |
2714 | name); | |
8d577d32 | 2715 | |
4c3376c8 SW |
2716 | /* If we have found both a method match and a function |
2717 | match, find out which one is better, and calculate match | |
2718 | quality. */ | |
2719 | if (method_oload_champ >= 0 && func_oload_champ >= 0) | |
2720 | { | |
2721 | switch (compare_badness (func_badness, method_badness)) | |
2722 | { | |
2723 | case 0: /* Top two contenders are equally good. */ | |
b021a221 MS |
2724 | /* FIXME: GDB does not support the general ambiguous case. |
2725 | All candidates should be collected and presented the | |
2726 | user. */ | |
4c3376c8 SW |
2727 | error (_("Ambiguous overload resolution")); |
2728 | break; | |
2729 | case 1: /* Incomparable top contenders. */ | |
2730 | /* This is an error incompatible candidates | |
2731 | should not have been proposed. */ | |
3e43a32a MS |
2732 | error (_("Internal error: incompatible " |
2733 | "overload candidates proposed")); | |
4c3376c8 SW |
2734 | break; |
2735 | case 2: /* Function champion. */ | |
2736 | method_oload_champ = -1; | |
2737 | match_quality = func_match_quality; | |
2738 | break; | |
2739 | case 3: /* Method champion. */ | |
2740 | func_oload_champ = -1; | |
2741 | match_quality = method_match_quality; | |
2742 | break; | |
2743 | default: | |
2744 | error (_("Internal error: unexpected overload comparison result")); | |
2745 | break; | |
2746 | } | |
2747 | } | |
2748 | else | |
2749 | { | |
2750 | /* We have either a method match or a function match. */ | |
2751 | if (method_oload_champ >= 0) | |
2752 | match_quality = method_match_quality; | |
2753 | else | |
2754 | match_quality = func_match_quality; | |
2755 | } | |
8d577d32 DC |
2756 | |
2757 | if (match_quality == INCOMPATIBLE) | |
2758 | { | |
4c3376c8 | 2759 | if (method == METHOD) |
8a3fe4f8 | 2760 | error (_("Cannot resolve method %s%s%s to any overloaded instance"), |
8d577d32 DC |
2761 | obj_type_name, |
2762 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2763 | name); | |
2764 | else | |
8a3fe4f8 | 2765 | error (_("Cannot resolve function %s to any overloaded instance"), |
8d577d32 DC |
2766 | func_name); |
2767 | } | |
2768 | else if (match_quality == NON_STANDARD) | |
2769 | { | |
4c3376c8 | 2770 | if (method == METHOD) |
3e43a32a MS |
2771 | warning (_("Using non-standard conversion to match " |
2772 | "method %s%s%s to supplied arguments"), | |
8d577d32 DC |
2773 | obj_type_name, |
2774 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2775 | name); | |
2776 | else | |
3e43a32a MS |
2777 | warning (_("Using non-standard conversion to match " |
2778 | "function %s to supplied arguments"), | |
8d577d32 DC |
2779 | func_name); |
2780 | } | |
2781 | ||
4c3376c8 | 2782 | if (staticp != NULL) |
2bca57ba | 2783 | *staticp = oload_method_static_p (fns_ptr, method_oload_champ); |
4c3376c8 SW |
2784 | |
2785 | if (method_oload_champ >= 0) | |
8d577d32 | 2786 | { |
233e8b28 SC |
2787 | if (src_method_oload_champ >= 0) |
2788 | { | |
e66d4446 SC |
2789 | if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, method_oload_champ) |
2790 | && noside != EVAL_AVOID_SIDE_EFFECTS) | |
2791 | { | |
2792 | *valp = value_virtual_fn_field (&temp, fns_ptr, | |
2793 | method_oload_champ, basetype, | |
2794 | boffset); | |
2795 | } | |
233e8b28 SC |
2796 | else |
2797 | *valp = value_fn_field (&temp, fns_ptr, method_oload_champ, | |
2798 | basetype, boffset); | |
2799 | } | |
8d577d32 | 2800 | else |
233e8b28 SC |
2801 | { |
2802 | *valp = value_of_xmethod (clone_xmethod_worker | |
2803 | (VEC_index (xmethod_worker_ptr, xm_worker_vec, | |
2804 | ext_method_oload_champ))); | |
2805 | } | |
8d577d32 DC |
2806 | } |
2807 | else | |
4c3376c8 | 2808 | *symp = oload_syms[func_oload_champ]; |
8d577d32 DC |
2809 | |
2810 | if (objp) | |
2811 | { | |
a4295225 | 2812 | struct type *temp_type = check_typedef (value_type (temp)); |
da096638 | 2813 | struct type *objtype = check_typedef (obj_type); |
a109c7c1 | 2814 | |
a4295225 | 2815 | if (TYPE_CODE (temp_type) != TYPE_CODE_PTR |
da096638 | 2816 | && (TYPE_CODE (objtype) == TYPE_CODE_PTR |
aa006118 | 2817 | || TYPE_IS_REFERENCE (objtype))) |
8d577d32 DC |
2818 | { |
2819 | temp = value_addr (temp); | |
2820 | } | |
2821 | *objp = temp; | |
2822 | } | |
7322dca9 SW |
2823 | |
2824 | do_cleanups (all_cleanups); | |
8d577d32 DC |
2825 | |
2826 | switch (match_quality) | |
2827 | { | |
2828 | case INCOMPATIBLE: | |
2829 | return 100; | |
2830 | case NON_STANDARD: | |
2831 | return 10; | |
2832 | default: /* STANDARD */ | |
2833 | return 0; | |
2834 | } | |
2835 | } | |
2836 | ||
2837 | /* Find the best overload match, searching for FUNC_NAME in namespaces | |
2838 | contained in QUALIFIED_NAME until it either finds a good match or | |
2839 | runs out of namespaces. It stores the overloaded functions in | |
2840 | *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The | |
2841 | calling function is responsible for freeing *OLOAD_SYMS and | |
7322dca9 SW |
2842 | *OLOAD_CHAMP_BV. If NO_ADL, argument dependent lookup is not |
2843 | performned. */ | |
8d577d32 DC |
2844 | |
2845 | static int | |
da096638 | 2846 | find_oload_champ_namespace (struct value **args, int nargs, |
8d577d32 DC |
2847 | const char *func_name, |
2848 | const char *qualified_name, | |
2849 | struct symbol ***oload_syms, | |
7322dca9 SW |
2850 | struct badness_vector **oload_champ_bv, |
2851 | const int no_adl) | |
8d577d32 DC |
2852 | { |
2853 | int oload_champ; | |
2854 | ||
da096638 | 2855 | find_oload_champ_namespace_loop (args, nargs, |
8d577d32 DC |
2856 | func_name, |
2857 | qualified_name, 0, | |
2858 | oload_syms, oload_champ_bv, | |
7322dca9 SW |
2859 | &oload_champ, |
2860 | no_adl); | |
8d577d32 DC |
2861 | |
2862 | return oload_champ; | |
2863 | } | |
2864 | ||
2865 | /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is | |
2866 | how deep we've looked for namespaces, and the champ is stored in | |
2867 | OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0 | |
7322dca9 SW |
2868 | if it isn't. Other arguments are the same as in |
2869 | find_oload_champ_namespace | |
8d577d32 DC |
2870 | |
2871 | It is the caller's responsibility to free *OLOAD_SYMS and | |
2872 | *OLOAD_CHAMP_BV. */ | |
2873 | ||
2874 | static int | |
da096638 | 2875 | find_oload_champ_namespace_loop (struct value **args, int nargs, |
8d577d32 DC |
2876 | const char *func_name, |
2877 | const char *qualified_name, | |
2878 | int namespace_len, | |
2879 | struct symbol ***oload_syms, | |
2880 | struct badness_vector **oload_champ_bv, | |
7322dca9 SW |
2881 | int *oload_champ, |
2882 | const int no_adl) | |
8d577d32 DC |
2883 | { |
2884 | int next_namespace_len = namespace_len; | |
2885 | int searched_deeper = 0; | |
2886 | int num_fns = 0; | |
2887 | struct cleanup *old_cleanups; | |
2888 | int new_oload_champ; | |
2889 | struct symbol **new_oload_syms; | |
2890 | struct badness_vector *new_oload_champ_bv; | |
2891 | char *new_namespace; | |
2892 | ||
2893 | if (next_namespace_len != 0) | |
2894 | { | |
2895 | gdb_assert (qualified_name[next_namespace_len] == ':'); | |
2896 | next_namespace_len += 2; | |
c906108c | 2897 | } |
ac3eeb49 MS |
2898 | next_namespace_len += |
2899 | cp_find_first_component (qualified_name + next_namespace_len); | |
8d577d32 DC |
2900 | |
2901 | /* Initialize these to values that can safely be xfree'd. */ | |
2902 | *oload_syms = NULL; | |
2903 | *oload_champ_bv = NULL; | |
c5aa993b | 2904 | |
581e13c1 | 2905 | /* First, see if we have a deeper namespace we can search in. |
ac3eeb49 | 2906 | If we get a good match there, use it. */ |
8d577d32 DC |
2907 | |
2908 | if (qualified_name[next_namespace_len] == ':') | |
2909 | { | |
2910 | searched_deeper = 1; | |
2911 | ||
da096638 | 2912 | if (find_oload_champ_namespace_loop (args, nargs, |
8d577d32 DC |
2913 | func_name, qualified_name, |
2914 | next_namespace_len, | |
2915 | oload_syms, oload_champ_bv, | |
7322dca9 | 2916 | oload_champ, no_adl)) |
8d577d32 DC |
2917 | { |
2918 | return 1; | |
2919 | } | |
2920 | }; | |
2921 | ||
2922 | /* If we reach here, either we're in the deepest namespace or we | |
2923 | didn't find a good match in a deeper namespace. But, in the | |
2924 | latter case, we still have a bad match in a deeper namespace; | |
2925 | note that we might not find any match at all in the current | |
2926 | namespace. (There's always a match in the deepest namespace, | |
2927 | because this overload mechanism only gets called if there's a | |
2928 | function symbol to start off with.) */ | |
2929 | ||
2930 | old_cleanups = make_cleanup (xfree, *oload_syms); | |
ec322823 | 2931 | make_cleanup (xfree, *oload_champ_bv); |
224c3ddb | 2932 | new_namespace = (char *) alloca (namespace_len + 1); |
8d577d32 DC |
2933 | strncpy (new_namespace, qualified_name, namespace_len); |
2934 | new_namespace[namespace_len] = '\0'; | |
2935 | new_oload_syms = make_symbol_overload_list (func_name, | |
2936 | new_namespace); | |
7322dca9 SW |
2937 | |
2938 | /* If we have reached the deepest level perform argument | |
2939 | determined lookup. */ | |
2940 | if (!searched_deeper && !no_adl) | |
da096638 KS |
2941 | { |
2942 | int ix; | |
2943 | struct type **arg_types; | |
2944 | ||
2945 | /* Prepare list of argument types for overload resolution. */ | |
2946 | arg_types = (struct type **) | |
2947 | alloca (nargs * (sizeof (struct type *))); | |
2948 | for (ix = 0; ix < nargs; ix++) | |
2949 | arg_types[ix] = value_type (args[ix]); | |
2950 | make_symbol_overload_list_adl (arg_types, nargs, func_name); | |
2951 | } | |
7322dca9 | 2952 | |
8d577d32 DC |
2953 | while (new_oload_syms[num_fns]) |
2954 | ++num_fns; | |
2955 | ||
9cf95373 | 2956 | new_oload_champ = find_oload_champ (args, nargs, num_fns, |
233e8b28 | 2957 | NULL, NULL, new_oload_syms, |
8d577d32 DC |
2958 | &new_oload_champ_bv); |
2959 | ||
2960 | /* Case 1: We found a good match. Free earlier matches (if any), | |
2961 | and return it. Case 2: We didn't find a good match, but we're | |
2962 | not the deepest function. Then go with the bad match that the | |
2963 | deeper function found. Case 3: We found a bad match, and we're | |
2964 | the deepest function. Then return what we found, even though | |
2965 | it's a bad match. */ | |
2966 | ||
2967 | if (new_oload_champ != -1 | |
2968 | && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD) | |
2969 | { | |
2970 | *oload_syms = new_oload_syms; | |
2971 | *oload_champ = new_oload_champ; | |
2972 | *oload_champ_bv = new_oload_champ_bv; | |
2973 | do_cleanups (old_cleanups); | |
2974 | return 1; | |
2975 | } | |
2976 | else if (searched_deeper) | |
2977 | { | |
2978 | xfree (new_oload_syms); | |
2979 | xfree (new_oload_champ_bv); | |
2980 | discard_cleanups (old_cleanups); | |
2981 | return 0; | |
2982 | } | |
2983 | else | |
2984 | { | |
8d577d32 DC |
2985 | *oload_syms = new_oload_syms; |
2986 | *oload_champ = new_oload_champ; | |
2987 | *oload_champ_bv = new_oload_champ_bv; | |
2a7d6a25 | 2988 | do_cleanups (old_cleanups); |
8d577d32 DC |
2989 | return 0; |
2990 | } | |
2991 | } | |
2992 | ||
da096638 | 2993 | /* Look for a function to take NARGS args of ARGS. Find |
8d577d32 | 2994 | the best match from among the overloaded methods or functions |
233e8b28 SC |
2995 | given by FNS_PTR or OLOAD_SYMS or XM_WORKER_VEC, respectively. |
2996 | One, and only one of FNS_PTR, OLOAD_SYMS and XM_WORKER_VEC can be | |
2997 | non-NULL. | |
2998 | ||
2999 | If XM_WORKER_VEC is NULL, then the length of the arrays FNS_PTR | |
3000 | or OLOAD_SYMS (whichever is non-NULL) is specified in NUM_FNS. | |
3001 | ||
8d577d32 DC |
3002 | Return the index of the best match; store an indication of the |
3003 | quality of the match in OLOAD_CHAMP_BV. | |
3004 | ||
3005 | It is the caller's responsibility to free *OLOAD_CHAMP_BV. */ | |
3006 | ||
3007 | static int | |
9cf95373 | 3008 | find_oload_champ (struct value **args, int nargs, |
8d577d32 | 3009 | int num_fns, struct fn_field *fns_ptr, |
233e8b28 | 3010 | VEC (xmethod_worker_ptr) *xm_worker_vec, |
8d577d32 DC |
3011 | struct symbol **oload_syms, |
3012 | struct badness_vector **oload_champ_bv) | |
3013 | { | |
3014 | int ix; | |
233e8b28 | 3015 | int fn_count; |
ac3eeb49 MS |
3016 | /* A measure of how good an overloaded instance is. */ |
3017 | struct badness_vector *bv; | |
3018 | /* Index of best overloaded function. */ | |
3019 | int oload_champ = -1; | |
3020 | /* Current ambiguity state for overload resolution. */ | |
3021 | int oload_ambiguous = 0; | |
3022 | /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */ | |
8d577d32 | 3023 | |
9cf95373 | 3024 | /* A champion can be found among methods alone, or among functions |
233e8b28 SC |
3025 | alone, or in xmethods alone, but not in more than one of these |
3026 | groups. */ | |
3027 | gdb_assert ((fns_ptr != NULL) + (oload_syms != NULL) + (xm_worker_vec != NULL) | |
3028 | == 1); | |
9cf95373 | 3029 | |
8d577d32 | 3030 | *oload_champ_bv = NULL; |
c906108c | 3031 | |
233e8b28 SC |
3032 | fn_count = (xm_worker_vec != NULL |
3033 | ? VEC_length (xmethod_worker_ptr, xm_worker_vec) | |
3034 | : num_fns); | |
ac3eeb49 | 3035 | /* Consider each candidate in turn. */ |
233e8b28 | 3036 | for (ix = 0; ix < fn_count; ix++) |
c906108c | 3037 | { |
8d577d32 | 3038 | int jj; |
233e8b28 | 3039 | int static_offset = 0; |
8d577d32 DC |
3040 | int nparms; |
3041 | struct type **parm_types; | |
233e8b28 | 3042 | struct xmethod_worker *worker = NULL; |
8d577d32 | 3043 | |
233e8b28 | 3044 | if (xm_worker_vec != NULL) |
db577aea | 3045 | { |
233e8b28 SC |
3046 | worker = VEC_index (xmethod_worker_ptr, xm_worker_vec, ix); |
3047 | parm_types = get_xmethod_arg_types (worker, &nparms); | |
db577aea AC |
3048 | } |
3049 | else | |
3050 | { | |
233e8b28 SC |
3051 | if (fns_ptr != NULL) |
3052 | { | |
3053 | nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix)); | |
3054 | static_offset = oload_method_static_p (fns_ptr, ix); | |
3055 | } | |
3056 | else | |
3057 | nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix])); | |
3058 | ||
8d749320 | 3059 | parm_types = XNEWVEC (struct type *, nparms); |
233e8b28 SC |
3060 | for (jj = 0; jj < nparms; jj++) |
3061 | parm_types[jj] = (fns_ptr != NULL | |
3062 | ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type) | |
3063 | : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), | |
8301c89e | 3064 | jj)); |
db577aea | 3065 | } |
c906108c | 3066 | |
ac3eeb49 MS |
3067 | /* Compare parameter types to supplied argument types. Skip |
3068 | THIS for static methods. */ | |
3069 | bv = rank_function (parm_types, nparms, | |
da096638 | 3070 | args + static_offset, |
4a1970e4 | 3071 | nargs - static_offset); |
c5aa993b | 3072 | |
8d577d32 | 3073 | if (!*oload_champ_bv) |
c5aa993b | 3074 | { |
8d577d32 | 3075 | *oload_champ_bv = bv; |
c5aa993b | 3076 | oload_champ = 0; |
c5aa993b | 3077 | } |
ac3eeb49 MS |
3078 | else /* See whether current candidate is better or worse than |
3079 | previous best. */ | |
8d577d32 | 3080 | switch (compare_badness (bv, *oload_champ_bv)) |
c5aa993b | 3081 | { |
ac3eeb49 MS |
3082 | case 0: /* Top two contenders are equally good. */ |
3083 | oload_ambiguous = 1; | |
c5aa993b | 3084 | break; |
ac3eeb49 MS |
3085 | case 1: /* Incomparable top contenders. */ |
3086 | oload_ambiguous = 2; | |
c5aa993b | 3087 | break; |
ac3eeb49 MS |
3088 | case 2: /* New champion, record details. */ |
3089 | *oload_champ_bv = bv; | |
c5aa993b JM |
3090 | oload_ambiguous = 0; |
3091 | oload_champ = ix; | |
c5aa993b JM |
3092 | break; |
3093 | case 3: | |
3094 | default: | |
3095 | break; | |
3096 | } | |
b8c9b27d | 3097 | xfree (parm_types); |
6b1ba9a0 ND |
3098 | if (overload_debug) |
3099 | { | |
233e8b28 | 3100 | if (fns_ptr != NULL) |
ac3eeb49 | 3101 | fprintf_filtered (gdb_stderr, |
3e43a32a | 3102 | "Overloaded method instance %s, # of parms %d\n", |
ac3eeb49 | 3103 | fns_ptr[ix].physname, nparms); |
233e8b28 SC |
3104 | else if (xm_worker_vec != NULL) |
3105 | fprintf_filtered (gdb_stderr, | |
3106 | "Xmethod worker, # of parms %d\n", | |
3107 | nparms); | |
6b1ba9a0 | 3108 | else |
ac3eeb49 | 3109 | fprintf_filtered (gdb_stderr, |
3e43a32a MS |
3110 | "Overloaded function instance " |
3111 | "%s # of parms %d\n", | |
ac3eeb49 MS |
3112 | SYMBOL_DEMANGLED_NAME (oload_syms[ix]), |
3113 | nparms); | |
4a1970e4 | 3114 | for (jj = 0; jj < nargs - static_offset; jj++) |
ac3eeb49 MS |
3115 | fprintf_filtered (gdb_stderr, |
3116 | "...Badness @ %d : %d\n", | |
6403aeea | 3117 | jj, bv->rank[jj].rank); |
3e43a32a MS |
3118 | fprintf_filtered (gdb_stderr, "Overload resolution " |
3119 | "champion is %d, ambiguous? %d\n", | |
ac3eeb49 | 3120 | oload_champ, oload_ambiguous); |
6b1ba9a0 | 3121 | } |
c906108c SS |
3122 | } |
3123 | ||
8d577d32 DC |
3124 | return oload_champ; |
3125 | } | |
6b1ba9a0 | 3126 | |
8d577d32 DC |
3127 | /* Return 1 if we're looking at a static method, 0 if we're looking at |
3128 | a non-static method or a function that isn't a method. */ | |
c906108c | 3129 | |
8d577d32 | 3130 | static int |
2bca57ba | 3131 | oload_method_static_p (struct fn_field *fns_ptr, int index) |
8d577d32 | 3132 | { |
2bca57ba | 3133 | if (fns_ptr && index >= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index)) |
8d577d32 | 3134 | return 1; |
c906108c | 3135 | else |
8d577d32 DC |
3136 | return 0; |
3137 | } | |
c906108c | 3138 | |
8d577d32 DC |
3139 | /* Check how good an overload match OLOAD_CHAMP_BV represents. */ |
3140 | ||
3141 | static enum oload_classification | |
3142 | classify_oload_match (struct badness_vector *oload_champ_bv, | |
3143 | int nargs, | |
3144 | int static_offset) | |
3145 | { | |
3146 | int ix; | |
da096638 | 3147 | enum oload_classification worst = STANDARD; |
8d577d32 DC |
3148 | |
3149 | for (ix = 1; ix <= nargs - static_offset; ix++) | |
7f8c9282 | 3150 | { |
6403aeea SW |
3151 | /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS |
3152 | or worse return INCOMPATIBLE. */ | |
3153 | if (compare_ranks (oload_champ_bv->rank[ix], | |
3154 | INCOMPATIBLE_TYPE_BADNESS) <= 0) | |
ac3eeb49 | 3155 | return INCOMPATIBLE; /* Truly mismatched types. */ |
6403aeea SW |
3156 | /* Otherwise If this conversion is as bad as |
3157 | NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */ | |
3158 | else if (compare_ranks (oload_champ_bv->rank[ix], | |
3159 | NS_POINTER_CONVERSION_BADNESS) <= 0) | |
da096638 | 3160 | worst = NON_STANDARD; /* Non-standard type conversions |
ac3eeb49 | 3161 | needed. */ |
7f8c9282 | 3162 | } |
02f0d45d | 3163 | |
da096638 KS |
3164 | /* If no INCOMPATIBLE classification was found, return the worst one |
3165 | that was found (if any). */ | |
3166 | return worst; | |
c906108c SS |
3167 | } |
3168 | ||
ac3eeb49 MS |
3169 | /* C++: return 1 is NAME is a legitimate name for the destructor of |
3170 | type TYPE. If TYPE does not have a destructor, or if NAME is | |
d8228535 JK |
3171 | inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet |
3172 | have CHECK_TYPEDEF applied, this function will apply it itself. */ | |
3173 | ||
c906108c | 3174 | int |
d8228535 | 3175 | destructor_name_p (const char *name, struct type *type) |
c906108c | 3176 | { |
c906108c SS |
3177 | if (name[0] == '~') |
3178 | { | |
d8228535 JK |
3179 | const char *dname = type_name_no_tag_or_error (type); |
3180 | const char *cp = strchr (dname, '<'); | |
c906108c SS |
3181 | unsigned int len; |
3182 | ||
3183 | /* Do not compare the template part for template classes. */ | |
3184 | if (cp == NULL) | |
3185 | len = strlen (dname); | |
3186 | else | |
3187 | len = cp - dname; | |
bf896cb0 | 3188 | if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0) |
8a3fe4f8 | 3189 | error (_("name of destructor must equal name of class")); |
c906108c SS |
3190 | else |
3191 | return 1; | |
3192 | } | |
3193 | return 0; | |
3194 | } | |
3195 | ||
3d567982 TT |
3196 | /* Find an enum constant named NAME in TYPE. TYPE must be an "enum |
3197 | class". If the name is found, return a value representing it; | |
3198 | otherwise throw an exception. */ | |
3199 | ||
3200 | static struct value * | |
3201 | enum_constant_from_type (struct type *type, const char *name) | |
3202 | { | |
3203 | int i; | |
3204 | int name_len = strlen (name); | |
3205 | ||
3206 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_ENUM | |
3207 | && TYPE_DECLARED_CLASS (type)); | |
3208 | ||
3209 | for (i = TYPE_N_BASECLASSES (type); i < TYPE_NFIELDS (type); ++i) | |
3210 | { | |
3211 | const char *fname = TYPE_FIELD_NAME (type, i); | |
3212 | int len; | |
3213 | ||
3214 | if (TYPE_FIELD_LOC_KIND (type, i) != FIELD_LOC_KIND_ENUMVAL | |
3215 | || fname == NULL) | |
3216 | continue; | |
3217 | ||
3218 | /* Look for the trailing "::NAME", since enum class constant | |
3219 | names are qualified here. */ | |
3220 | len = strlen (fname); | |
3221 | if (len + 2 >= name_len | |
3222 | && fname[len - name_len - 2] == ':' | |
3223 | && fname[len - name_len - 1] == ':' | |
3224 | && strcmp (&fname[len - name_len], name) == 0) | |
3225 | return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, i)); | |
3226 | } | |
3227 | ||
3228 | error (_("no constant named \"%s\" in enum \"%s\""), | |
3229 | name, TYPE_TAG_NAME (type)); | |
3230 | } | |
3231 | ||
79c2c32d | 3232 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
0d5de010 DJ |
3233 | return the appropriate member (or the address of the member, if |
3234 | WANT_ADDRESS). This function is used to resolve user expressions | |
3235 | of the form "DOMAIN::NAME". For more details on what happens, see | |
3236 | the comment before value_struct_elt_for_reference. */ | |
79c2c32d DC |
3237 | |
3238 | struct value * | |
c848d642 | 3239 | value_aggregate_elt (struct type *curtype, const char *name, |
072bba3b | 3240 | struct type *expect_type, int want_address, |
79c2c32d DC |
3241 | enum noside noside) |
3242 | { | |
3243 | switch (TYPE_CODE (curtype)) | |
3244 | { | |
3245 | case TYPE_CODE_STRUCT: | |
3246 | case TYPE_CODE_UNION: | |
ac3eeb49 | 3247 | return value_struct_elt_for_reference (curtype, 0, curtype, |
072bba3b | 3248 | name, expect_type, |
0d5de010 | 3249 | want_address, noside); |
79c2c32d | 3250 | case TYPE_CODE_NAMESPACE: |
ac3eeb49 MS |
3251 | return value_namespace_elt (curtype, name, |
3252 | want_address, noside); | |
3d567982 TT |
3253 | |
3254 | case TYPE_CODE_ENUM: | |
3255 | return enum_constant_from_type (curtype, name); | |
3256 | ||
79c2c32d DC |
3257 | default: |
3258 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 3259 | _("non-aggregate type in value_aggregate_elt")); |
79c2c32d DC |
3260 | } |
3261 | } | |
3262 | ||
072bba3b | 3263 | /* Compares the two method/function types T1 and T2 for "equality" |
b021a221 | 3264 | with respect to the methods' parameters. If the types of the |
072bba3b KS |
3265 | two parameter lists are the same, returns 1; 0 otherwise. This |
3266 | comparison may ignore any artificial parameters in T1 if | |
3267 | SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip | |
3268 | the first artificial parameter in T1, assumed to be a 'this' pointer. | |
3269 | ||
3270 | The type T2 is expected to have come from make_params (in eval.c). */ | |
3271 | ||
3272 | static int | |
3273 | compare_parameters (struct type *t1, struct type *t2, int skip_artificial) | |
3274 | { | |
3275 | int start = 0; | |
3276 | ||
80b23b6a | 3277 | if (TYPE_NFIELDS (t1) > 0 && TYPE_FIELD_ARTIFICIAL (t1, 0)) |
072bba3b KS |
3278 | ++start; |
3279 | ||
3280 | /* If skipping artificial fields, find the first real field | |
581e13c1 | 3281 | in T1. */ |
072bba3b KS |
3282 | if (skip_artificial) |
3283 | { | |
3284 | while (start < TYPE_NFIELDS (t1) | |
3285 | && TYPE_FIELD_ARTIFICIAL (t1, start)) | |
3286 | ++start; | |
3287 | } | |
3288 | ||
581e13c1 | 3289 | /* Now compare parameters. */ |
072bba3b KS |
3290 | |
3291 | /* Special case: a method taking void. T1 will contain no | |
3292 | non-artificial fields, and T2 will contain TYPE_CODE_VOID. */ | |
3293 | if ((TYPE_NFIELDS (t1) - start) == 0 && TYPE_NFIELDS (t2) == 1 | |
3294 | && TYPE_CODE (TYPE_FIELD_TYPE (t2, 0)) == TYPE_CODE_VOID) | |
3295 | return 1; | |
3296 | ||
3297 | if ((TYPE_NFIELDS (t1) - start) == TYPE_NFIELDS (t2)) | |
3298 | { | |
3299 | int i; | |
a109c7c1 | 3300 | |
072bba3b KS |
3301 | for (i = 0; i < TYPE_NFIELDS (t2); ++i) |
3302 | { | |
6403aeea | 3303 | if (compare_ranks (rank_one_type (TYPE_FIELD_TYPE (t1, start + i), |
da096638 | 3304 | TYPE_FIELD_TYPE (t2, i), NULL), |
6403aeea | 3305 | EXACT_MATCH_BADNESS) != 0) |
072bba3b KS |
3306 | return 0; |
3307 | } | |
3308 | ||
3309 | return 1; | |
3310 | } | |
3311 | ||
3312 | return 0; | |
3313 | } | |
3314 | ||
c906108c | 3315 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
ac3eeb49 MS |
3316 | return the address of this member as a "pointer to member" type. |
3317 | If INTYPE is non-null, then it will be the type of the member we | |
3318 | are looking for. This will help us resolve "pointers to member | |
3319 | functions". This function is used to resolve user expressions of | |
3320 | the form "DOMAIN::NAME". */ | |
c906108c | 3321 | |
63d06c5c | 3322 | static struct value * |
fba45db2 | 3323 | value_struct_elt_for_reference (struct type *domain, int offset, |
c848d642 | 3324 | struct type *curtype, const char *name, |
ac3eeb49 MS |
3325 | struct type *intype, |
3326 | int want_address, | |
63d06c5c | 3327 | enum noside noside) |
c906108c | 3328 | { |
52f0bd74 AC |
3329 | struct type *t = curtype; |
3330 | int i; | |
0d5de010 | 3331 | struct value *v, *result; |
c906108c | 3332 | |
c5aa993b | 3333 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c | 3334 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
3e43a32a MS |
3335 | error (_("Internal error: non-aggregate type " |
3336 | "to value_struct_elt_for_reference")); | |
c906108c SS |
3337 | |
3338 | for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--) | |
3339 | { | |
0d5cff50 | 3340 | const char *t_field_name = TYPE_FIELD_NAME (t, i); |
c5aa993b | 3341 | |
6314a349 | 3342 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c | 3343 | { |
d6a843b5 | 3344 | if (field_is_static (&TYPE_FIELD (t, i))) |
c906108c SS |
3345 | { |
3346 | v = value_static_field (t, i); | |
0d5de010 DJ |
3347 | if (want_address) |
3348 | v = value_addr (v); | |
c906108c SS |
3349 | return v; |
3350 | } | |
3351 | if (TYPE_FIELD_PACKED (t, i)) | |
8a3fe4f8 | 3352 | error (_("pointers to bitfield members not allowed")); |
c5aa993b | 3353 | |
0d5de010 DJ |
3354 | if (want_address) |
3355 | return value_from_longest | |
3356 | (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain), | |
3357 | offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3)); | |
f7e3ecae | 3358 | else if (noside != EVAL_NORMAL) |
0d5de010 DJ |
3359 | return allocate_value (TYPE_FIELD_TYPE (t, i)); |
3360 | else | |
f7e3ecae KS |
3361 | { |
3362 | /* Try to evaluate NAME as a qualified name with implicit | |
3363 | this pointer. In this case, attempt to return the | |
3364 | equivalent to `this->*(&TYPE::NAME)'. */ | |
3365 | v = value_of_this_silent (current_language); | |
3366 | if (v != NULL) | |
3367 | { | |
3368 | struct value *ptr; | |
3369 | long mem_offset; | |
3370 | struct type *type, *tmp; | |
3371 | ||
3372 | ptr = value_aggregate_elt (domain, name, NULL, 1, noside); | |
3373 | type = check_typedef (value_type (ptr)); | |
3374 | gdb_assert (type != NULL | |
3375 | && TYPE_CODE (type) == TYPE_CODE_MEMBERPTR); | |
4bfb94b8 | 3376 | tmp = lookup_pointer_type (TYPE_SELF_TYPE (type)); |
f7e3ecae KS |
3377 | v = value_cast_pointers (tmp, v, 1); |
3378 | mem_offset = value_as_long (ptr); | |
3379 | tmp = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
3380 | result = value_from_pointer (tmp, | |
3381 | value_as_long (v) + mem_offset); | |
3382 | return value_ind (result); | |
3383 | } | |
3384 | ||
3385 | error (_("Cannot reference non-static field \"%s\""), name); | |
3386 | } | |
c906108c SS |
3387 | } |
3388 | } | |
3389 | ||
ac3eeb49 MS |
3390 | /* C++: If it was not found as a data field, then try to return it |
3391 | as a pointer to a method. */ | |
c906108c | 3392 | |
c906108c SS |
3393 | /* Perform all necessary dereferencing. */ |
3394 | while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR) | |
3395 | intype = TYPE_TARGET_TYPE (intype); | |
3396 | ||
3397 | for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i) | |
3398 | { | |
0d5cff50 | 3399 | const char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i); |
c906108c SS |
3400 | char dem_opname[64]; |
3401 | ||
61012eef GB |
3402 | if (startswith (t_field_name, "__") |
3403 | || startswith (t_field_name, "op") | |
3404 | || startswith (t_field_name, "type")) | |
c906108c | 3405 | { |
ac3eeb49 MS |
3406 | if (cplus_demangle_opname (t_field_name, |
3407 | dem_opname, DMGL_ANSI)) | |
c5aa993b | 3408 | t_field_name = dem_opname; |
ac3eeb49 MS |
3409 | else if (cplus_demangle_opname (t_field_name, |
3410 | dem_opname, 0)) | |
c906108c | 3411 | t_field_name = dem_opname; |
c906108c | 3412 | } |
6314a349 | 3413 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c | 3414 | { |
072bba3b KS |
3415 | int j; |
3416 | int len = TYPE_FN_FIELDLIST_LENGTH (t, i); | |
c906108c | 3417 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i); |
c5aa993b | 3418 | |
de17c821 DJ |
3419 | check_stub_method_group (t, i); |
3420 | ||
c906108c SS |
3421 | if (intype) |
3422 | { | |
072bba3b KS |
3423 | for (j = 0; j < len; ++j) |
3424 | { | |
3693fdb3 PA |
3425 | if (TYPE_CONST (intype) != TYPE_FN_FIELD_CONST (f, j)) |
3426 | continue; | |
3427 | if (TYPE_VOLATILE (intype) != TYPE_FN_FIELD_VOLATILE (f, j)) | |
3428 | continue; | |
3429 | ||
072bba3b | 3430 | if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0) |
3e43a32a MS |
3431 | || compare_parameters (TYPE_FN_FIELD_TYPE (f, j), |
3432 | intype, 1)) | |
072bba3b KS |
3433 | break; |
3434 | } | |
3435 | ||
3436 | if (j == len) | |
3e43a32a MS |
3437 | error (_("no member function matches " |
3438 | "that type instantiation")); | |
7f79b1c5 | 3439 | } |
c906108c | 3440 | else |
072bba3b KS |
3441 | { |
3442 | int ii; | |
7f79b1c5 DJ |
3443 | |
3444 | j = -1; | |
53832f31 | 3445 | for (ii = 0; ii < len; ++ii) |
072bba3b | 3446 | { |
7f79b1c5 DJ |
3447 | /* Skip artificial methods. This is necessary if, |
3448 | for example, the user wants to "print | |
3449 | subclass::subclass" with only one user-defined | |
53832f31 TT |
3450 | constructor. There is no ambiguity in this case. |
3451 | We are careful here to allow artificial methods | |
3452 | if they are the unique result. */ | |
072bba3b | 3453 | if (TYPE_FN_FIELD_ARTIFICIAL (f, ii)) |
53832f31 TT |
3454 | { |
3455 | if (j == -1) | |
3456 | j = ii; | |
3457 | continue; | |
3458 | } | |
072bba3b | 3459 | |
7f79b1c5 DJ |
3460 | /* Desired method is ambiguous if more than one |
3461 | method is defined. */ | |
53832f31 | 3462 | if (j != -1 && !TYPE_FN_FIELD_ARTIFICIAL (f, j)) |
3e43a32a MS |
3463 | error (_("non-unique member `%s' requires " |
3464 | "type instantiation"), name); | |
072bba3b | 3465 | |
7f79b1c5 DJ |
3466 | j = ii; |
3467 | } | |
53832f31 TT |
3468 | |
3469 | if (j == -1) | |
3470 | error (_("no matching member function")); | |
072bba3b | 3471 | } |
c5aa993b | 3472 | |
0d5de010 DJ |
3473 | if (TYPE_FN_FIELD_STATIC_P (f, j)) |
3474 | { | |
ac3eeb49 MS |
3475 | struct symbol *s = |
3476 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
d12307c1 | 3477 | 0, VAR_DOMAIN, 0).symbol; |
a109c7c1 | 3478 | |
0d5de010 DJ |
3479 | if (s == NULL) |
3480 | return NULL; | |
3481 | ||
3482 | if (want_address) | |
63e43d3a | 3483 | return value_addr (read_var_value (s, 0, 0)); |
0d5de010 | 3484 | else |
63e43d3a | 3485 | return read_var_value (s, 0, 0); |
0d5de010 DJ |
3486 | } |
3487 | ||
c906108c SS |
3488 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) |
3489 | { | |
0d5de010 DJ |
3490 | if (want_address) |
3491 | { | |
3492 | result = allocate_value | |
3493 | (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); | |
ad4820ab UW |
3494 | cplus_make_method_ptr (value_type (result), |
3495 | value_contents_writeable (result), | |
0d5de010 DJ |
3496 | TYPE_FN_FIELD_VOFFSET (f, j), 1); |
3497 | } | |
3498 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
3499 | return allocate_value (TYPE_FN_FIELD_TYPE (f, j)); | |
3500 | else | |
3501 | error (_("Cannot reference virtual member function \"%s\""), | |
3502 | name); | |
c906108c SS |
3503 | } |
3504 | else | |
3505 | { | |
ac3eeb49 MS |
3506 | struct symbol *s = |
3507 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
d12307c1 | 3508 | 0, VAR_DOMAIN, 0).symbol; |
a109c7c1 | 3509 | |
c906108c | 3510 | if (s == NULL) |
0d5de010 DJ |
3511 | return NULL; |
3512 | ||
63e43d3a | 3513 | v = read_var_value (s, 0, 0); |
0d5de010 DJ |
3514 | if (!want_address) |
3515 | result = v; | |
c906108c SS |
3516 | else |
3517 | { | |
0d5de010 | 3518 | result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); |
ad4820ab UW |
3519 | cplus_make_method_ptr (value_type (result), |
3520 | value_contents_writeable (result), | |
42ae5230 | 3521 | value_address (v), 0); |
c906108c | 3522 | } |
c906108c | 3523 | } |
0d5de010 | 3524 | return result; |
c906108c SS |
3525 | } |
3526 | } | |
3527 | for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--) | |
3528 | { | |
f23631e4 | 3529 | struct value *v; |
c906108c SS |
3530 | int base_offset; |
3531 | ||
3532 | if (BASETYPE_VIA_VIRTUAL (t, i)) | |
3533 | base_offset = 0; | |
3534 | else | |
3535 | base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8; | |
3536 | v = value_struct_elt_for_reference (domain, | |
3537 | offset + base_offset, | |
3538 | TYPE_BASECLASS (t, i), | |
ac3eeb49 MS |
3539 | name, intype, |
3540 | want_address, noside); | |
c906108c SS |
3541 | if (v) |
3542 | return v; | |
3543 | } | |
63d06c5c DC |
3544 | |
3545 | /* As a last chance, pretend that CURTYPE is a namespace, and look | |
3546 | it up that way; this (frequently) works for types nested inside | |
3547 | classes. */ | |
3548 | ||
ac3eeb49 MS |
3549 | return value_maybe_namespace_elt (curtype, name, |
3550 | want_address, noside); | |
c906108c SS |
3551 | } |
3552 | ||
79c2c32d DC |
3553 | /* C++: Return the member NAME of the namespace given by the type |
3554 | CURTYPE. */ | |
3555 | ||
3556 | static struct value * | |
3557 | value_namespace_elt (const struct type *curtype, | |
c848d642 | 3558 | const char *name, int want_address, |
79c2c32d | 3559 | enum noside noside) |
63d06c5c DC |
3560 | { |
3561 | struct value *retval = value_maybe_namespace_elt (curtype, name, | |
ac3eeb49 MS |
3562 | want_address, |
3563 | noside); | |
63d06c5c DC |
3564 | |
3565 | if (retval == NULL) | |
ac3eeb49 MS |
3566 | error (_("No symbol \"%s\" in namespace \"%s\"."), |
3567 | name, TYPE_TAG_NAME (curtype)); | |
63d06c5c DC |
3568 | |
3569 | return retval; | |
3570 | } | |
3571 | ||
3572 | /* A helper function used by value_namespace_elt and | |
3573 | value_struct_elt_for_reference. It looks up NAME inside the | |
3574 | context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE | |
3575 | is a class and NAME refers to a type in CURTYPE itself (as opposed | |
3576 | to, say, some base class of CURTYPE). */ | |
3577 | ||
3578 | static struct value * | |
3579 | value_maybe_namespace_elt (const struct type *curtype, | |
c848d642 | 3580 | const char *name, int want_address, |
63d06c5c | 3581 | enum noside noside) |
79c2c32d DC |
3582 | { |
3583 | const char *namespace_name = TYPE_TAG_NAME (curtype); | |
d12307c1 | 3584 | struct block_symbol sym; |
0d5de010 | 3585 | struct value *result; |
79c2c32d | 3586 | |
13387711 | 3587 | sym = cp_lookup_symbol_namespace (namespace_name, name, |
41f62f39 JK |
3588 | get_selected_block (0), VAR_DOMAIN); |
3589 | ||
d12307c1 | 3590 | if (sym.symbol == NULL) |
63d06c5c | 3591 | return NULL; |
79c2c32d | 3592 | else if ((noside == EVAL_AVOID_SIDE_EFFECTS) |
d12307c1 PMR |
3593 | && (SYMBOL_CLASS (sym.symbol) == LOC_TYPEDEF)) |
3594 | result = allocate_value (SYMBOL_TYPE (sym.symbol)); | |
79c2c32d | 3595 | else |
d12307c1 | 3596 | result = value_of_variable (sym.symbol, sym.block); |
0d5de010 | 3597 | |
ae6a105d | 3598 | if (want_address) |
0d5de010 DJ |
3599 | result = value_addr (result); |
3600 | ||
3601 | return result; | |
79c2c32d DC |
3602 | } |
3603 | ||
dfcee124 | 3604 | /* Given a pointer or a reference value V, find its real (RTTI) type. |
ac3eeb49 | 3605 | |
c906108c | 3606 | Other parameters FULL, TOP, USING_ENC as with value_rtti_type() |
ac3eeb49 | 3607 | and refer to the values computed for the object pointed to. */ |
c906108c SS |
3608 | |
3609 | struct type * | |
dfcee124 | 3610 | value_rtti_indirect_type (struct value *v, int *full, |
6b850546 | 3611 | LONGEST *top, int *using_enc) |
c906108c | 3612 | { |
f7e5394d | 3613 | struct value *target = NULL; |
dfcee124 AG |
3614 | struct type *type, *real_type, *target_type; |
3615 | ||
3616 | type = value_type (v); | |
3617 | type = check_typedef (type); | |
aa006118 | 3618 | if (TYPE_IS_REFERENCE (type)) |
dfcee124 AG |
3619 | target = coerce_ref (v); |
3620 | else if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
f7e5394d | 3621 | { |
f7e5394d | 3622 | |
492d29ea | 3623 | TRY |
f7e5394d SM |
3624 | { |
3625 | target = value_ind (v); | |
3626 | } | |
492d29ea | 3627 | CATCH (except, RETURN_MASK_ERROR) |
f7e5394d SM |
3628 | { |
3629 | if (except.error == MEMORY_ERROR) | |
3630 | { | |
3631 | /* value_ind threw a memory error. The pointer is NULL or | |
3632 | contains an uninitialized value: we can't determine any | |
3633 | type. */ | |
3634 | return NULL; | |
3635 | } | |
3636 | throw_exception (except); | |
3637 | } | |
492d29ea | 3638 | END_CATCH |
f7e5394d | 3639 | } |
dfcee124 AG |
3640 | else |
3641 | return NULL; | |
c906108c | 3642 | |
dfcee124 AG |
3643 | real_type = value_rtti_type (target, full, top, using_enc); |
3644 | ||
3645 | if (real_type) | |
3646 | { | |
3647 | /* Copy qualifiers to the referenced object. */ | |
3648 | target_type = value_type (target); | |
3649 | real_type = make_cv_type (TYPE_CONST (target_type), | |
3650 | TYPE_VOLATILE (target_type), real_type, NULL); | |
aa006118 AV |
3651 | if (TYPE_IS_REFERENCE (type)) |
3652 | real_type = lookup_reference_type (real_type, TYPE_CODE (type)); | |
dfcee124 AG |
3653 | else if (TYPE_CODE (type) == TYPE_CODE_PTR) |
3654 | real_type = lookup_pointer_type (real_type); | |
3655 | else | |
3656 | internal_error (__FILE__, __LINE__, _("Unexpected value type.")); | |
3657 | ||
3658 | /* Copy qualifiers to the pointer/reference. */ | |
3659 | real_type = make_cv_type (TYPE_CONST (type), TYPE_VOLATILE (type), | |
3660 | real_type, NULL); | |
3661 | } | |
c906108c | 3662 | |
dfcee124 | 3663 | return real_type; |
c906108c SS |
3664 | } |
3665 | ||
3666 | /* Given a value pointed to by ARGP, check its real run-time type, and | |
3667 | if that is different from the enclosing type, create a new value | |
3668 | using the real run-time type as the enclosing type (and of the same | |
3669 | type as ARGP) and return it, with the embedded offset adjusted to | |
ac3eeb49 MS |
3670 | be the correct offset to the enclosed object. RTYPE is the type, |
3671 | and XFULL, XTOP, and XUSING_ENC are the other parameters, computed | |
3672 | by value_rtti_type(). If these are available, they can be supplied | |
3673 | and a second call to value_rtti_type() is avoided. (Pass RTYPE == | |
3674 | NULL if they're not available. */ | |
c906108c | 3675 | |
f23631e4 | 3676 | struct value * |
ac3eeb49 MS |
3677 | value_full_object (struct value *argp, |
3678 | struct type *rtype, | |
3679 | int xfull, int xtop, | |
fba45db2 | 3680 | int xusing_enc) |
c906108c | 3681 | { |
c5aa993b | 3682 | struct type *real_type; |
c906108c | 3683 | int full = 0; |
6b850546 | 3684 | LONGEST top = -1; |
c906108c | 3685 | int using_enc = 0; |
f23631e4 | 3686 | struct value *new_val; |
c906108c SS |
3687 | |
3688 | if (rtype) | |
3689 | { | |
3690 | real_type = rtype; | |
3691 | full = xfull; | |
3692 | top = xtop; | |
3693 | using_enc = xusing_enc; | |
3694 | } | |
3695 | else | |
3696 | real_type = value_rtti_type (argp, &full, &top, &using_enc); | |
3697 | ||
ac3eeb49 | 3698 | /* If no RTTI data, or if object is already complete, do nothing. */ |
4754a64e | 3699 | if (!real_type || real_type == value_enclosing_type (argp)) |
c906108c SS |
3700 | return argp; |
3701 | ||
a7860e76 TT |
3702 | /* In a destructor we might see a real type that is a superclass of |
3703 | the object's type. In this case it is better to leave the object | |
3704 | as-is. */ | |
3705 | if (full | |
3706 | && TYPE_LENGTH (real_type) < TYPE_LENGTH (value_enclosing_type (argp))) | |
3707 | return argp; | |
3708 | ||
c906108c | 3709 | /* If we have the full object, but for some reason the enclosing |
ac3eeb49 MS |
3710 | type is wrong, set it. */ |
3711 | /* pai: FIXME -- sounds iffy */ | |
c906108c SS |
3712 | if (full) |
3713 | { | |
4dfea560 DE |
3714 | argp = value_copy (argp); |
3715 | set_value_enclosing_type (argp, real_type); | |
c906108c SS |
3716 | return argp; |
3717 | } | |
3718 | ||
581e13c1 | 3719 | /* Check if object is in memory. */ |
c906108c SS |
3720 | if (VALUE_LVAL (argp) != lval_memory) |
3721 | { | |
3e43a32a MS |
3722 | warning (_("Couldn't retrieve complete object of RTTI " |
3723 | "type %s; object may be in register(s)."), | |
ac3eeb49 | 3724 | TYPE_NAME (real_type)); |
c5aa993b | 3725 | |
c906108c SS |
3726 | return argp; |
3727 | } | |
c5aa993b | 3728 | |
ac3eeb49 MS |
3729 | /* All other cases -- retrieve the complete object. */ |
3730 | /* Go back by the computed top_offset from the beginning of the | |
3731 | object, adjusting for the embedded offset of argp if that's what | |
3732 | value_rtti_type used for its computation. */ | |
42ae5230 | 3733 | new_val = value_at_lazy (real_type, value_address (argp) - top + |
13c3b5f5 | 3734 | (using_enc ? 0 : value_embedded_offset (argp))); |
04624583 | 3735 | deprecated_set_value_type (new_val, value_type (argp)); |
13c3b5f5 AC |
3736 | set_value_embedded_offset (new_val, (using_enc |
3737 | ? top + value_embedded_offset (argp) | |
3738 | : top)); | |
c906108c SS |
3739 | return new_val; |
3740 | } | |
3741 | ||
389e51db | 3742 | |
85bc8cb7 JK |
3743 | /* Return the value of the local variable, if one exists. Throw error |
3744 | otherwise, such as if the request is made in an inappropriate context. */ | |
c906108c | 3745 | |
f23631e4 | 3746 | struct value * |
85bc8cb7 | 3747 | value_of_this (const struct language_defn *lang) |
c906108c | 3748 | { |
63e43d3a | 3749 | struct block_symbol sym; |
3977b71f | 3750 | const struct block *b; |
206415a3 | 3751 | struct frame_info *frame; |
c906108c | 3752 | |
66a17cb6 | 3753 | if (!lang->la_name_of_this) |
85bc8cb7 | 3754 | error (_("no `this' in current language")); |
aee28ec6 | 3755 | |
85bc8cb7 | 3756 | frame = get_selected_frame (_("no frame selected")); |
c906108c | 3757 | |
66a17cb6 | 3758 | b = get_frame_block (frame, NULL); |
c906108c | 3759 | |
63e43d3a PMR |
3760 | sym = lookup_language_this (lang, b); |
3761 | if (sym.symbol == NULL) | |
85bc8cb7 JK |
3762 | error (_("current stack frame does not contain a variable named `%s'"), |
3763 | lang->la_name_of_this); | |
3764 | ||
63e43d3a | 3765 | return read_var_value (sym.symbol, sym.block, frame); |
85bc8cb7 JK |
3766 | } |
3767 | ||
3768 | /* Return the value of the local variable, if one exists. Return NULL | |
3769 | otherwise. Never throw error. */ | |
3770 | ||
3771 | struct value * | |
3772 | value_of_this_silent (const struct language_defn *lang) | |
3773 | { | |
3774 | struct value *ret = NULL; | |
85bc8cb7 | 3775 | |
492d29ea | 3776 | TRY |
c906108c | 3777 | { |
85bc8cb7 | 3778 | ret = value_of_this (lang); |
c906108c | 3779 | } |
492d29ea PA |
3780 | CATCH (except, RETURN_MASK_ERROR) |
3781 | { | |
3782 | } | |
3783 | END_CATCH | |
c906108c | 3784 | |
d069f99d AF |
3785 | return ret; |
3786 | } | |
3787 | ||
ac3eeb49 MS |
3788 | /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH |
3789 | elements long, starting at LOWBOUND. The result has the same lower | |
3790 | bound as the original ARRAY. */ | |
c906108c | 3791 | |
f23631e4 AC |
3792 | struct value * |
3793 | value_slice (struct value *array, int lowbound, int length) | |
c906108c SS |
3794 | { |
3795 | struct type *slice_range_type, *slice_type, *range_type; | |
7a67d0fe | 3796 | LONGEST lowerbound, upperbound; |
f23631e4 | 3797 | struct value *slice; |
c906108c | 3798 | struct type *array_type; |
ac3eeb49 | 3799 | |
df407dfe | 3800 | array_type = check_typedef (value_type (array)); |
c906108c | 3801 | if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY |
6b1755ce | 3802 | && TYPE_CODE (array_type) != TYPE_CODE_STRING) |
8a3fe4f8 | 3803 | error (_("cannot take slice of non-array")); |
ac3eeb49 | 3804 | |
c906108c SS |
3805 | range_type = TYPE_INDEX_TYPE (array_type); |
3806 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
8a3fe4f8 | 3807 | error (_("slice from bad array or bitstring")); |
ac3eeb49 | 3808 | |
c906108c | 3809 | if (lowbound < lowerbound || length < 0 |
db034ac5 | 3810 | || lowbound + length - 1 > upperbound) |
8a3fe4f8 | 3811 | error (_("slice out of range")); |
ac3eeb49 | 3812 | |
c906108c SS |
3813 | /* FIXME-type-allocation: need a way to free this type when we are |
3814 | done with it. */ | |
0c9c3474 SA |
3815 | slice_range_type = create_static_range_type ((struct type *) NULL, |
3816 | TYPE_TARGET_TYPE (range_type), | |
3817 | lowbound, | |
3818 | lowbound + length - 1); | |
ac3eeb49 | 3819 | |
a7c88acd JB |
3820 | { |
3821 | struct type *element_type = TYPE_TARGET_TYPE (array_type); | |
3822 | LONGEST offset | |
3823 | = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type)); | |
ac3eeb49 | 3824 | |
a7c88acd JB |
3825 | slice_type = create_array_type ((struct type *) NULL, |
3826 | element_type, | |
3827 | slice_range_type); | |
3828 | TYPE_CODE (slice_type) = TYPE_CODE (array_type); | |
ac3eeb49 | 3829 | |
a7c88acd JB |
3830 | if (VALUE_LVAL (array) == lval_memory && value_lazy (array)) |
3831 | slice = allocate_value_lazy (slice_type); | |
3832 | else | |
3833 | { | |
3834 | slice = allocate_value (slice_type); | |
3835 | value_contents_copy (slice, 0, array, offset, | |
3ae385af | 3836 | type_length_units (slice_type)); |
a7c88acd JB |
3837 | } |
3838 | ||
3839 | set_value_component_location (slice, array); | |
a7c88acd JB |
3840 | set_value_offset (slice, value_offset (array) + offset); |
3841 | } | |
ac3eeb49 | 3842 | |
c906108c SS |
3843 | return slice; |
3844 | } | |
3845 | ||
ac3eeb49 MS |
3846 | /* Create a value for a FORTRAN complex number. Currently most of the |
3847 | time values are coerced to COMPLEX*16 (i.e. a complex number | |
070ad9f0 DB |
3848 | composed of 2 doubles. This really should be a smarter routine |
3849 | that figures out precision inteligently as opposed to assuming | |
ac3eeb49 | 3850 | doubles. FIXME: fmb */ |
c906108c | 3851 | |
f23631e4 | 3852 | struct value * |
ac3eeb49 MS |
3853 | value_literal_complex (struct value *arg1, |
3854 | struct value *arg2, | |
3855 | struct type *type) | |
c906108c | 3856 | { |
f23631e4 | 3857 | struct value *val; |
c906108c SS |
3858 | struct type *real_type = TYPE_TARGET_TYPE (type); |
3859 | ||
3860 | val = allocate_value (type); | |
3861 | arg1 = value_cast (real_type, arg1); | |
3862 | arg2 = value_cast (real_type, arg2); | |
3863 | ||
990a07ab | 3864 | memcpy (value_contents_raw (val), |
0fd88904 | 3865 | value_contents (arg1), TYPE_LENGTH (real_type)); |
990a07ab | 3866 | memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type), |
0fd88904 | 3867 | value_contents (arg2), TYPE_LENGTH (real_type)); |
c906108c SS |
3868 | return val; |
3869 | } | |
3870 | ||
ac3eeb49 | 3871 | /* Cast a value into the appropriate complex data type. */ |
c906108c | 3872 | |
f23631e4 AC |
3873 | static struct value * |
3874 | cast_into_complex (struct type *type, struct value *val) | |
c906108c SS |
3875 | { |
3876 | struct type *real_type = TYPE_TARGET_TYPE (type); | |
ac3eeb49 | 3877 | |
df407dfe | 3878 | if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX) |
c906108c | 3879 | { |
df407dfe | 3880 | struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val)); |
f23631e4 AC |
3881 | struct value *re_val = allocate_value (val_real_type); |
3882 | struct value *im_val = allocate_value (val_real_type); | |
c906108c | 3883 | |
990a07ab | 3884 | memcpy (value_contents_raw (re_val), |
0fd88904 | 3885 | value_contents (val), TYPE_LENGTH (val_real_type)); |
990a07ab | 3886 | memcpy (value_contents_raw (im_val), |
0fd88904 | 3887 | value_contents (val) + TYPE_LENGTH (val_real_type), |
c5aa993b | 3888 | TYPE_LENGTH (val_real_type)); |
c906108c SS |
3889 | |
3890 | return value_literal_complex (re_val, im_val, type); | |
3891 | } | |
df407dfe AC |
3892 | else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT |
3893 | || TYPE_CODE (value_type (val)) == TYPE_CODE_INT) | |
ac3eeb49 MS |
3894 | return value_literal_complex (val, |
3895 | value_zero (real_type, not_lval), | |
3896 | type); | |
c906108c | 3897 | else |
8a3fe4f8 | 3898 | error (_("cannot cast non-number to complex")); |
c906108c SS |
3899 | } |
3900 | ||
3901 | void | |
fba45db2 | 3902 | _initialize_valops (void) |
c906108c | 3903 | { |
5bf193a2 AC |
3904 | add_setshow_boolean_cmd ("overload-resolution", class_support, |
3905 | &overload_resolution, _("\ | |
3906 | Set overload resolution in evaluating C++ functions."), _("\ | |
ac3eeb49 MS |
3907 | Show overload resolution in evaluating C++ functions."), |
3908 | NULL, NULL, | |
920d2a44 | 3909 | show_overload_resolution, |
5bf193a2 | 3910 | &setlist, &showlist); |
c906108c | 3911 | overload_resolution = 1; |
c906108c | 3912 | } |