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