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