]>
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 | ||
13221aec AB |
47 | static int typecmp (bool staticp, bool varargs, int nargs, |
48 | struct field t1[], const gdb::array_view<value *> t2); | |
c906108c | 49 | |
714f19d5 | 50 | static struct value *search_struct_field (const char *, struct value *, |
8a13d42d | 51 | struct type *, int); |
c906108c | 52 | |
714f19d5 | 53 | static struct value *search_struct_method (const char *, struct value **, |
158cc4fe | 54 | gdb::optional<gdb::array_view<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 | |
ca89bdf8 AB |
1200 | /* Figure out which frame this register value is in. The value |
1201 | holds the frame_id for the next frame, that is the frame this | |
1202 | register value was unwound from. | |
1203 | ||
1204 | Below we will call put_frame_register_bytes which requires that | |
1205 | we pass it the actual frame in which the register value is | |
1206 | valid, i.e. not the next frame. */ | |
1207 | frame = frame_find_by_id (VALUE_NEXT_FRAME_ID (toval)); | |
1208 | frame = get_prev_frame_always (frame); | |
41b56feb | 1209 | |
0c16dd26 | 1210 | value_reg = VALUE_REGNUM (toval); |
c906108c SS |
1211 | |
1212 | if (!frame) | |
8a3fe4f8 | 1213 | error (_("Value being assigned to is no longer active.")); |
d80b854b UW |
1214 | |
1215 | gdbarch = get_frame_arch (frame); | |
3e871532 LM |
1216 | |
1217 | if (value_bitsize (toval)) | |
492254e9 | 1218 | { |
3e871532 | 1219 | struct value *parent = value_parent (toval); |
6b850546 | 1220 | LONGEST offset = value_offset (parent) + value_offset (toval); |
bdec2917 | 1221 | size_t changed_len; |
3e871532 LM |
1222 | gdb_byte buffer[sizeof (LONGEST)]; |
1223 | int optim, unavail; | |
1224 | ||
1225 | changed_len = (value_bitpos (toval) | |
1226 | + value_bitsize (toval) | |
1227 | + HOST_CHAR_BIT - 1) | |
1228 | / HOST_CHAR_BIT; | |
1229 | ||
bdec2917 | 1230 | if (changed_len > sizeof (LONGEST)) |
3e871532 LM |
1231 | error (_("Can't handle bitfields which " |
1232 | "don't fit in a %d bit word."), | |
1233 | (int) sizeof (LONGEST) * HOST_CHAR_BIT); | |
1234 | ||
1235 | if (!get_frame_register_bytes (frame, value_reg, offset, | |
bdec2917 | 1236 | {buffer, changed_len}, |
3e871532 LM |
1237 | &optim, &unavail)) |
1238 | { | |
1239 | if (optim) | |
1240 | throw_error (OPTIMIZED_OUT_ERROR, | |
1241 | _("value has been optimized out")); | |
1242 | if (unavail) | |
1243 | throw_error (NOT_AVAILABLE_ERROR, | |
1244 | _("value is not available")); | |
1245 | } | |
1246 | ||
1247 | modify_field (type, buffer, value_as_long (fromval), | |
1248 | value_bitpos (toval), value_bitsize (toval)); | |
1249 | ||
1250 | put_frame_register_bytes (frame, value_reg, offset, | |
bdec2917 | 1251 | {buffer, changed_len}); |
492254e9 | 1252 | } |
c906108c | 1253 | else |
492254e9 | 1254 | { |
3e871532 LM |
1255 | if (gdbarch_convert_register_p (gdbarch, VALUE_REGNUM (toval), |
1256 | type)) | |
00fa51f6 | 1257 | { |
3e871532 LM |
1258 | /* If TOVAL is a special machine register requiring |
1259 | conversion of program values to a special raw | |
1260 | format. */ | |
1261 | gdbarch_value_to_register (gdbarch, frame, | |
1262 | VALUE_REGNUM (toval), type, | |
1263 | value_contents (fromval)); | |
00fa51f6 | 1264 | } |
c906108c | 1265 | else |
00fa51f6 | 1266 | { |
d5d24e12 LM |
1267 | gdb::array_view<const gdb_byte> contents |
1268 | = gdb::make_array_view (value_contents (fromval), | |
1269 | TYPE_LENGTH (type)); | |
00fa51f6 UW |
1270 | put_frame_register_bytes (frame, value_reg, |
1271 | value_offset (toval), | |
d5d24e12 | 1272 | contents); |
00fa51f6 | 1273 | } |
ff2e87ac | 1274 | } |
00fa51f6 | 1275 | |
76727919 | 1276 | gdb::observers::register_changed.notify (frame, value_reg); |
ff2e87ac | 1277 | break; |
c906108c | 1278 | } |
5f5233d4 PA |
1279 | |
1280 | case lval_computed: | |
1281 | { | |
c8f2448a | 1282 | const struct lval_funcs *funcs = value_computed_funcs (toval); |
5f5233d4 | 1283 | |
ac71a68c JK |
1284 | if (funcs->write != NULL) |
1285 | { | |
1286 | funcs->write (toval, fromval); | |
1287 | break; | |
1288 | } | |
5f5233d4 | 1289 | } |
ac71a68c | 1290 | /* Fall through. */ |
5f5233d4 | 1291 | |
c906108c | 1292 | default: |
8a3fe4f8 | 1293 | error (_("Left operand of assignment is not an lvalue.")); |
c906108c SS |
1294 | } |
1295 | ||
cb741690 DJ |
1296 | /* Assigning to the stack pointer, frame pointer, and other |
1297 | (architecture and calling convention specific) registers may | |
d649a38e | 1298 | cause the frame cache and regcache to be out of date. Assigning to memory |
cb741690 DJ |
1299 | also can. We just do this on all assignments to registers or |
1300 | memory, for simplicity's sake; I doubt the slowdown matters. */ | |
1301 | switch (VALUE_LVAL (toval)) | |
1302 | { | |
1303 | case lval_memory: | |
1304 | case lval_register: | |
0e03807e | 1305 | case lval_computed: |
cb741690 | 1306 | |
328d42d8 SM |
1307 | gdb::observers::target_changed.notify |
1308 | (current_inferior ()->top_target ()); | |
cb741690 | 1309 | |
ac3eeb49 MS |
1310 | /* Having destroyed the frame cache, restore the selected |
1311 | frame. */ | |
cb741690 DJ |
1312 | |
1313 | /* FIXME: cagney/2002-11-02: There has to be a better way of | |
1314 | doing this. Instead of constantly saving/restoring the | |
1315 | frame. Why not create a get_selected_frame() function that, | |
1316 | having saved the selected frame's ID can automatically | |
1317 | re-find the previously selected frame automatically. */ | |
1318 | ||
1319 | { | |
1320 | struct frame_info *fi = frame_find_by_id (old_frame); | |
a109c7c1 | 1321 | |
cb741690 DJ |
1322 | if (fi != NULL) |
1323 | select_frame (fi); | |
1324 | } | |
1325 | ||
1326 | break; | |
1327 | default: | |
1328 | break; | |
1329 | } | |
1330 | ||
ac3eeb49 MS |
1331 | /* If the field does not entirely fill a LONGEST, then zero the sign |
1332 | bits. If the field is signed, and is negative, then sign | |
1333 | extend. */ | |
df407dfe AC |
1334 | if ((value_bitsize (toval) > 0) |
1335 | && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST))) | |
c906108c SS |
1336 | { |
1337 | LONGEST fieldval = value_as_long (fromval); | |
df407dfe | 1338 | LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1; |
c906108c SS |
1339 | |
1340 | fieldval &= valmask; | |
c6d940a9 | 1341 | if (!type->is_unsigned () |
ac3eeb49 | 1342 | && (fieldval & (valmask ^ (valmask >> 1)))) |
c906108c SS |
1343 | fieldval |= ~valmask; |
1344 | ||
1345 | fromval = value_from_longest (type, fieldval); | |
1346 | } | |
1347 | ||
4aac0db7 UW |
1348 | /* The return value is a copy of TOVAL so it shares its location |
1349 | information, but its contents are updated from FROMVAL. This | |
1350 | implies the returned value is not lazy, even if TOVAL was. */ | |
c906108c | 1351 | val = value_copy (toval); |
4aac0db7 | 1352 | set_value_lazy (val, 0); |
0fd88904 | 1353 | memcpy (value_contents_raw (val), value_contents (fromval), |
c906108c | 1354 | TYPE_LENGTH (type)); |
4aac0db7 UW |
1355 | |
1356 | /* We copy over the enclosing type and pointed-to offset from FROMVAL | |
1357 | in the case of pointer types. For object types, the enclosing type | |
1358 | and embedded offset must *not* be copied: the target object refered | |
1359 | to by TOVAL retains its original dynamic type after assignment. */ | |
78134374 | 1360 | if (type->code () == TYPE_CODE_PTR) |
4aac0db7 UW |
1361 | { |
1362 | set_value_enclosing_type (val, value_enclosing_type (fromval)); | |
1363 | set_value_pointed_to_offset (val, value_pointed_to_offset (fromval)); | |
1364 | } | |
c5aa993b | 1365 | |
c906108c SS |
1366 | return val; |
1367 | } | |
1368 | ||
1c236ddd | 1369 | /* Extend a value ARG1 to COUNT repetitions of its type. */ |
c906108c | 1370 | |
f23631e4 AC |
1371 | struct value * |
1372 | value_repeat (struct value *arg1, int count) | |
c906108c | 1373 | { |
f23631e4 | 1374 | struct value *val; |
c906108c SS |
1375 | |
1376 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 1377 | error (_("Only values in memory can be extended with '@'.")); |
c906108c | 1378 | if (count < 1) |
8a3fe4f8 | 1379 | error (_("Invalid number %d of repetitions."), count); |
c906108c | 1380 | |
4754a64e | 1381 | val = allocate_repeat_value (value_enclosing_type (arg1), count); |
c906108c | 1382 | |
c906108c | 1383 | VALUE_LVAL (val) = lval_memory; |
42ae5230 | 1384 | set_value_address (val, value_address (arg1)); |
c906108c | 1385 | |
24e6bcee PA |
1386 | read_value_memory (val, 0, value_stack (val), value_address (val), |
1387 | value_contents_all_raw (val), | |
3ae385af | 1388 | type_length_units (value_enclosing_type (val))); |
24e6bcee | 1389 | |
c906108c SS |
1390 | return val; |
1391 | } | |
1392 | ||
f23631e4 | 1393 | struct value * |
9df2fbc4 | 1394 | value_of_variable (struct symbol *var, const struct block *b) |
c906108c | 1395 | { |
63e43d3a | 1396 | struct frame_info *frame = NULL; |
c906108c | 1397 | |
63e43d3a | 1398 | if (symbol_read_needs_frame (var)) |
61212c0f | 1399 | frame = get_selected_frame (_("No frame selected.")); |
c906108c | 1400 | |
63e43d3a | 1401 | return read_var_value (var, b, frame); |
c906108c SS |
1402 | } |
1403 | ||
61212c0f | 1404 | struct value * |
270140bd | 1405 | address_of_variable (struct symbol *var, const struct block *b) |
61212c0f UW |
1406 | { |
1407 | struct type *type = SYMBOL_TYPE (var); | |
1408 | struct value *val; | |
1409 | ||
1410 | /* Evaluate it first; if the result is a memory address, we're fine. | |
581e13c1 | 1411 | Lazy evaluation pays off here. */ |
61212c0f UW |
1412 | |
1413 | val = value_of_variable (var, b); | |
9f1f738a | 1414 | type = value_type (val); |
61212c0f UW |
1415 | |
1416 | if ((VALUE_LVAL (val) == lval_memory && value_lazy (val)) | |
78134374 | 1417 | || type->code () == TYPE_CODE_FUNC) |
61212c0f | 1418 | { |
42ae5230 | 1419 | CORE_ADDR addr = value_address (val); |
a109c7c1 | 1420 | |
61212c0f UW |
1421 | return value_from_pointer (lookup_pointer_type (type), addr); |
1422 | } | |
1423 | ||
1424 | /* Not a memory address; check what the problem was. */ | |
1425 | switch (VALUE_LVAL (val)) | |
1426 | { | |
1427 | case lval_register: | |
1428 | { | |
1429 | struct frame_info *frame; | |
1430 | const char *regname; | |
1431 | ||
41b56feb | 1432 | frame = frame_find_by_id (VALUE_NEXT_FRAME_ID (val)); |
61212c0f UW |
1433 | gdb_assert (frame); |
1434 | ||
1435 | regname = gdbarch_register_name (get_frame_arch (frame), | |
1436 | VALUE_REGNUM (val)); | |
1437 | gdb_assert (regname && *regname); | |
1438 | ||
1439 | error (_("Address requested for identifier " | |
1440 | "\"%s\" which is in register $%s"), | |
987012b8 | 1441 | var->print_name (), regname); |
61212c0f UW |
1442 | break; |
1443 | } | |
1444 | ||
1445 | default: | |
1446 | error (_("Can't take address of \"%s\" which isn't an lvalue."), | |
987012b8 | 1447 | var->print_name ()); |
61212c0f UW |
1448 | break; |
1449 | } | |
1450 | ||
1451 | return val; | |
1452 | } | |
1453 | ||
00db9531 | 1454 | /* See value.h. */ |
63092375 | 1455 | |
00db9531 | 1456 | bool |
63092375 DJ |
1457 | value_must_coerce_to_target (struct value *val) |
1458 | { | |
1459 | struct type *valtype; | |
1460 | ||
1461 | /* The only lval kinds which do not live in target memory. */ | |
1462 | if (VALUE_LVAL (val) != not_lval | |
e81e7f5e SC |
1463 | && VALUE_LVAL (val) != lval_internalvar |
1464 | && VALUE_LVAL (val) != lval_xcallable) | |
00db9531 | 1465 | return false; |
63092375 DJ |
1466 | |
1467 | valtype = check_typedef (value_type (val)); | |
1468 | ||
78134374 | 1469 | switch (valtype->code ()) |
63092375 DJ |
1470 | { |
1471 | case TYPE_CODE_ARRAY: | |
bd63c870 | 1472 | return valtype->is_vector () ? 0 : 1; |
63092375 | 1473 | case TYPE_CODE_STRING: |
00db9531 | 1474 | return true; |
63092375 | 1475 | default: |
00db9531 | 1476 | return false; |
63092375 DJ |
1477 | } |
1478 | } | |
1479 | ||
3e43a32a MS |
1480 | /* Make sure that VAL lives in target memory if it's supposed to. For |
1481 | instance, strings are constructed as character arrays in GDB's | |
1482 | storage, and this function copies them to the target. */ | |
63092375 DJ |
1483 | |
1484 | struct value * | |
1485 | value_coerce_to_target (struct value *val) | |
1486 | { | |
1487 | LONGEST length; | |
1488 | CORE_ADDR addr; | |
1489 | ||
1490 | if (!value_must_coerce_to_target (val)) | |
1491 | return val; | |
1492 | ||
1493 | length = TYPE_LENGTH (check_typedef (value_type (val))); | |
1494 | addr = allocate_space_in_inferior (length); | |
1495 | write_memory (addr, value_contents (val), length); | |
1496 | return value_at_lazy (value_type (val), addr); | |
1497 | } | |
1498 | ||
ac3eeb49 MS |
1499 | /* Given a value which is an array, return a value which is a pointer |
1500 | to its first element, regardless of whether or not the array has a | |
1501 | nonzero lower bound. | |
c906108c | 1502 | |
ac3eeb49 MS |
1503 | FIXME: A previous comment here indicated that this routine should |
1504 | be substracting the array's lower bound. It's not clear to me that | |
1505 | this is correct. Given an array subscripting operation, it would | |
1506 | certainly work to do the adjustment here, essentially computing: | |
c906108c SS |
1507 | |
1508 | (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0]) | |
1509 | ||
ac3eeb49 MS |
1510 | However I believe a more appropriate and logical place to account |
1511 | for the lower bound is to do so in value_subscript, essentially | |
1512 | computing: | |
c906108c SS |
1513 | |
1514 | (&array[0] + ((index - lowerbound) * sizeof array[0])) | |
1515 | ||
ac3eeb49 MS |
1516 | As further evidence consider what would happen with operations |
1517 | other than array subscripting, where the caller would get back a | |
1518 | value that had an address somewhere before the actual first element | |
1519 | of the array, and the information about the lower bound would be | |
581e13c1 | 1520 | lost because of the coercion to pointer type. */ |
c906108c | 1521 | |
f23631e4 AC |
1522 | struct value * |
1523 | value_coerce_array (struct value *arg1) | |
c906108c | 1524 | { |
df407dfe | 1525 | struct type *type = check_typedef (value_type (arg1)); |
c906108c | 1526 | |
63092375 DJ |
1527 | /* If the user tries to do something requiring a pointer with an |
1528 | array that has not yet been pushed to the target, then this would | |
1529 | be a good time to do so. */ | |
1530 | arg1 = value_coerce_to_target (arg1); | |
1531 | ||
c906108c | 1532 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 1533 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1534 | |
4478b372 | 1535 | return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
42ae5230 | 1536 | value_address (arg1)); |
c906108c SS |
1537 | } |
1538 | ||
1539 | /* Given a value which is a function, return a value which is a pointer | |
1540 | to it. */ | |
1541 | ||
f23631e4 AC |
1542 | struct value * |
1543 | value_coerce_function (struct value *arg1) | |
c906108c | 1544 | { |
f23631e4 | 1545 | struct value *retval; |
c906108c SS |
1546 | |
1547 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 1548 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1549 | |
df407dfe | 1550 | retval = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
42ae5230 | 1551 | value_address (arg1)); |
c906108c | 1552 | return retval; |
c5aa993b | 1553 | } |
c906108c | 1554 | |
ac3eeb49 MS |
1555 | /* Return a pointer value for the object for which ARG1 is the |
1556 | contents. */ | |
c906108c | 1557 | |
f23631e4 AC |
1558 | struct value * |
1559 | value_addr (struct value *arg1) | |
c906108c | 1560 | { |
f23631e4 | 1561 | struct value *arg2; |
df407dfe | 1562 | struct type *type = check_typedef (value_type (arg1)); |
a109c7c1 | 1563 | |
aa006118 | 1564 | if (TYPE_IS_REFERENCE (type)) |
c906108c | 1565 | { |
3326303b MG |
1566 | if (value_bits_synthetic_pointer (arg1, value_embedded_offset (arg1), |
1567 | TARGET_CHAR_BIT * TYPE_LENGTH (type))) | |
1568 | arg1 = coerce_ref (arg1); | |
1569 | else | |
1570 | { | |
1571 | /* Copy the value, but change the type from (T&) to (T*). We | |
1572 | keep the same location information, which is efficient, and | |
1573 | allows &(&X) to get the location containing the reference. | |
1574 | Do the same to its enclosing type for consistency. */ | |
1575 | struct type *type_ptr | |
1576 | = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
1577 | struct type *enclosing_type | |
1578 | = check_typedef (value_enclosing_type (arg1)); | |
1579 | struct type *enclosing_type_ptr | |
1580 | = lookup_pointer_type (TYPE_TARGET_TYPE (enclosing_type)); | |
1581 | ||
1582 | arg2 = value_copy (arg1); | |
1583 | deprecated_set_value_type (arg2, type_ptr); | |
1584 | set_value_enclosing_type (arg2, enclosing_type_ptr); | |
a22df60a | 1585 | |
3326303b MG |
1586 | return arg2; |
1587 | } | |
c906108c | 1588 | } |
78134374 | 1589 | if (type->code () == TYPE_CODE_FUNC) |
c906108c SS |
1590 | return value_coerce_function (arg1); |
1591 | ||
63092375 DJ |
1592 | /* If this is an array that has not yet been pushed to the target, |
1593 | then this would be a good time to force it to memory. */ | |
1594 | arg1 = value_coerce_to_target (arg1); | |
1595 | ||
c906108c | 1596 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 1597 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1598 | |
581e13c1 | 1599 | /* Get target memory address. */ |
df407dfe | 1600 | arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
42ae5230 | 1601 | (value_address (arg1) |
13c3b5f5 | 1602 | + value_embedded_offset (arg1))); |
c906108c SS |
1603 | |
1604 | /* This may be a pointer to a base subobject; so remember the | |
ac3eeb49 | 1605 | full derived object's type ... */ |
4dfea560 DE |
1606 | set_value_enclosing_type (arg2, |
1607 | lookup_pointer_type (value_enclosing_type (arg1))); | |
ac3eeb49 MS |
1608 | /* ... and also the relative position of the subobject in the full |
1609 | object. */ | |
b44d461b | 1610 | set_value_pointed_to_offset (arg2, value_embedded_offset (arg1)); |
c906108c SS |
1611 | return arg2; |
1612 | } | |
1613 | ||
ac3eeb49 MS |
1614 | /* Return a reference value for the object for which ARG1 is the |
1615 | contents. */ | |
fb933624 DJ |
1616 | |
1617 | struct value * | |
a65cfae5 | 1618 | value_ref (struct value *arg1, enum type_code refcode) |
fb933624 DJ |
1619 | { |
1620 | struct value *arg2; | |
fb933624 | 1621 | struct type *type = check_typedef (value_type (arg1)); |
a109c7c1 | 1622 | |
a65cfae5 AV |
1623 | gdb_assert (refcode == TYPE_CODE_REF || refcode == TYPE_CODE_RVALUE_REF); |
1624 | ||
78134374 SM |
1625 | if ((type->code () == TYPE_CODE_REF |
1626 | || type->code () == TYPE_CODE_RVALUE_REF) | |
1627 | && type->code () == refcode) | |
fb933624 DJ |
1628 | return arg1; |
1629 | ||
1630 | arg2 = value_addr (arg1); | |
a65cfae5 | 1631 | deprecated_set_value_type (arg2, lookup_reference_type (type, refcode)); |
fb933624 DJ |
1632 | return arg2; |
1633 | } | |
1634 | ||
ac3eeb49 MS |
1635 | /* Given a value of a pointer type, apply the C unary * operator to |
1636 | it. */ | |
c906108c | 1637 | |
f23631e4 AC |
1638 | struct value * |
1639 | value_ind (struct value *arg1) | |
c906108c SS |
1640 | { |
1641 | struct type *base_type; | |
f23631e4 | 1642 | struct value *arg2; |
c906108c | 1643 | |
994b9211 | 1644 | arg1 = coerce_array (arg1); |
c906108c | 1645 | |
df407dfe | 1646 | base_type = check_typedef (value_type (arg1)); |
c906108c | 1647 | |
8cf6f0b1 TT |
1648 | if (VALUE_LVAL (arg1) == lval_computed) |
1649 | { | |
c8f2448a | 1650 | const struct lval_funcs *funcs = value_computed_funcs (arg1); |
8cf6f0b1 TT |
1651 | |
1652 | if (funcs->indirect) | |
1653 | { | |
1654 | struct value *result = funcs->indirect (arg1); | |
1655 | ||
1656 | if (result) | |
1657 | return result; | |
1658 | } | |
1659 | } | |
1660 | ||
78134374 | 1661 | if (base_type->code () == TYPE_CODE_PTR) |
c906108c SS |
1662 | { |
1663 | struct type *enc_type; | |
a109c7c1 | 1664 | |
ac3eeb49 | 1665 | /* We may be pointing to something embedded in a larger object. |
dda83cd7 | 1666 | Get the real type of the enclosing object. */ |
4754a64e | 1667 | enc_type = check_typedef (value_enclosing_type (arg1)); |
c906108c | 1668 | enc_type = TYPE_TARGET_TYPE (enc_type); |
0d5de010 | 1669 | |
e79eb02f | 1670 | CORE_ADDR base_addr; |
78134374 SM |
1671 | if (check_typedef (enc_type)->code () == TYPE_CODE_FUNC |
1672 | || check_typedef (enc_type)->code () == TYPE_CODE_METHOD) | |
e79eb02f AB |
1673 | { |
1674 | /* For functions, go through find_function_addr, which knows | |
1675 | how to handle function descriptors. */ | |
1676 | base_addr = find_function_addr (arg1, NULL); | |
1677 | } | |
0d5de010 | 1678 | else |
e79eb02f AB |
1679 | { |
1680 | /* Retrieve the enclosing object pointed to. */ | |
1681 | base_addr = (value_as_address (arg1) | |
1682 | - value_pointed_to_offset (arg1)); | |
1683 | } | |
1684 | arg2 = value_at_lazy (enc_type, base_addr); | |
9f1f738a | 1685 | enc_type = value_type (arg2); |
e79eb02f AB |
1686 | return readjust_indirect_value_type (arg2, enc_type, base_type, |
1687 | arg1, base_addr); | |
c906108c SS |
1688 | } |
1689 | ||
8a3fe4f8 | 1690 | error (_("Attempt to take contents of a non-pointer value.")); |
c906108c SS |
1691 | } |
1692 | \f | |
39d37385 PA |
1693 | /* Create a value for an array by allocating space in GDB, copying the |
1694 | data into that space, and then setting up an array value. | |
c906108c | 1695 | |
ac3eeb49 MS |
1696 | The array bounds are set from LOWBOUND and HIGHBOUND, and the array |
1697 | is populated from the values passed in ELEMVEC. | |
c906108c SS |
1698 | |
1699 | The element type of the array is inherited from the type of the | |
1700 | first element, and all elements must have the same size (though we | |
ac3eeb49 | 1701 | don't currently enforce any restriction on their types). */ |
c906108c | 1702 | |
f23631e4 AC |
1703 | struct value * |
1704 | value_array (int lowbound, int highbound, struct value **elemvec) | |
c906108c SS |
1705 | { |
1706 | int nelem; | |
1707 | int idx; | |
6b850546 | 1708 | ULONGEST typelength; |
f23631e4 | 1709 | struct value *val; |
c906108c | 1710 | struct type *arraytype; |
c906108c | 1711 | |
ac3eeb49 MS |
1712 | /* Validate that the bounds are reasonable and that each of the |
1713 | elements have the same size. */ | |
c906108c SS |
1714 | |
1715 | nelem = highbound - lowbound + 1; | |
1716 | if (nelem <= 0) | |
1717 | { | |
8a3fe4f8 | 1718 | error (_("bad array bounds (%d, %d)"), lowbound, highbound); |
c906108c | 1719 | } |
3ae385af | 1720 | typelength = type_length_units (value_enclosing_type (elemvec[0])); |
c906108c SS |
1721 | for (idx = 1; idx < nelem; idx++) |
1722 | { | |
3ae385af SM |
1723 | if (type_length_units (value_enclosing_type (elemvec[idx])) |
1724 | != typelength) | |
c906108c | 1725 | { |
8a3fe4f8 | 1726 | error (_("array elements must all be the same size")); |
c906108c SS |
1727 | } |
1728 | } | |
1729 | ||
e3506a9f UW |
1730 | arraytype = lookup_array_range_type (value_enclosing_type (elemvec[0]), |
1731 | lowbound, highbound); | |
c906108c | 1732 | |
67bd3fd5 | 1733 | if (!current_language->c_style_arrays_p ()) |
c906108c SS |
1734 | { |
1735 | val = allocate_value (arraytype); | |
1736 | for (idx = 0; idx < nelem; idx++) | |
39d37385 PA |
1737 | value_contents_copy (val, idx * typelength, elemvec[idx], 0, |
1738 | typelength); | |
c906108c SS |
1739 | return val; |
1740 | } | |
1741 | ||
63092375 DJ |
1742 | /* Allocate space to store the array, and then initialize it by |
1743 | copying in each element. */ | |
c906108c | 1744 | |
63092375 | 1745 | val = allocate_value (arraytype); |
c906108c | 1746 | for (idx = 0; idx < nelem; idx++) |
39d37385 | 1747 | value_contents_copy (val, idx * typelength, elemvec[idx], 0, typelength); |
63092375 | 1748 | return val; |
c906108c SS |
1749 | } |
1750 | ||
6c7a06a3 | 1751 | struct value * |
e3a3797e | 1752 | value_cstring (const char *ptr, ssize_t len, struct type *char_type) |
6c7a06a3 TT |
1753 | { |
1754 | struct value *val; | |
22c12a6c | 1755 | int lowbound = current_language->string_lower_bound (); |
63375b74 | 1756 | ssize_t highbound = len / TYPE_LENGTH (char_type); |
6c7a06a3 | 1757 | struct type *stringtype |
e3506a9f | 1758 | = lookup_array_range_type (char_type, lowbound, highbound + lowbound - 1); |
6c7a06a3 TT |
1759 | |
1760 | val = allocate_value (stringtype); | |
1761 | memcpy (value_contents_raw (val), ptr, len); | |
1762 | return val; | |
1763 | } | |
1764 | ||
ac3eeb49 MS |
1765 | /* Create a value for a string constant by allocating space in the |
1766 | inferior, copying the data into that space, and returning the | |
1767 | address with type TYPE_CODE_STRING. PTR points to the string | |
1768 | constant data; LEN is number of characters. | |
1769 | ||
1770 | Note that string types are like array of char types with a lower | |
1771 | bound of zero and an upper bound of LEN - 1. Also note that the | |
1772 | string may contain embedded null bytes. */ | |
c906108c | 1773 | |
f23631e4 | 1774 | struct value * |
7cc3f8e2 | 1775 | value_string (const char *ptr, ssize_t len, struct type *char_type) |
c906108c | 1776 | { |
f23631e4 | 1777 | struct value *val; |
22c12a6c | 1778 | int lowbound = current_language->string_lower_bound (); |
63375b74 | 1779 | ssize_t highbound = len / TYPE_LENGTH (char_type); |
c906108c | 1780 | struct type *stringtype |
e3506a9f | 1781 | = lookup_string_range_type (char_type, lowbound, highbound + lowbound - 1); |
c906108c | 1782 | |
3b7538c0 UW |
1783 | val = allocate_value (stringtype); |
1784 | memcpy (value_contents_raw (val), ptr, len); | |
1785 | return val; | |
c906108c SS |
1786 | } |
1787 | ||
c906108c | 1788 | \f |
13221aec AB |
1789 | /* See if we can pass arguments in T2 to a function which takes arguments |
1790 | of types T1. T1 is a list of NARGS arguments, and T2 is an array_view | |
1791 | of the values we're trying to pass. If some arguments need coercion of | |
1792 | some sort, then the coerced values are written into T2. Return value is | |
ac3eeb49 MS |
1793 | 0 if the arguments could be matched, or the position at which they |
1794 | differ if not. | |
c906108c | 1795 | |
ac3eeb49 | 1796 | STATICP is nonzero if the T1 argument list came from a static |
13221aec | 1797 | member function. T2 must still include the ``this'' pointer, but |
ac3eeb49 | 1798 | it will be skipped. |
c906108c SS |
1799 | |
1800 | For non-static member functions, we ignore the first argument, | |
ac3eeb49 MS |
1801 | which is the type of the instance variable. This is because we |
1802 | want to handle calls with objects from derived classes. This is | |
1803 | not entirely correct: we should actually check to make sure that a | |
c906108c SS |
1804 | requested operation is type secure, shouldn't we? FIXME. */ |
1805 | ||
1806 | static int | |
13221aec AB |
1807 | typecmp (bool staticp, bool varargs, int nargs, |
1808 | struct field t1[], gdb::array_view<value *> t2) | |
c906108c SS |
1809 | { |
1810 | int i; | |
1811 | ||
ac3eeb49 MS |
1812 | /* Skip ``this'' argument if applicable. T2 will always include |
1813 | THIS. */ | |
4a1970e4 | 1814 | if (staticp) |
13221aec | 1815 | t2 = t2.slice (1); |
ad2f7632 DJ |
1816 | |
1817 | for (i = 0; | |
5d14b6e5 | 1818 | (i < nargs) && t1[i].type ()->code () != TYPE_CODE_VOID; |
ad2f7632 | 1819 | i++) |
c906108c | 1820 | { |
c5aa993b | 1821 | struct type *tt1, *tt2; |
ad2f7632 | 1822 | |
13221aec | 1823 | if (i == t2.size ()) |
c5aa993b | 1824 | return i + 1; |
ad2f7632 | 1825 | |
5d14b6e5 | 1826 | tt1 = check_typedef (t1[i].type ()); |
df407dfe | 1827 | tt2 = check_typedef (value_type (t2[i])); |
ad2f7632 | 1828 | |
aa006118 | 1829 | if (TYPE_IS_REFERENCE (tt1) |
8301c89e | 1830 | /* We should be doing hairy argument matching, as below. */ |
78134374 SM |
1831 | && (check_typedef (TYPE_TARGET_TYPE (tt1))->code () |
1832 | == tt2->code ())) | |
c906108c | 1833 | { |
78134374 | 1834 | if (tt2->code () == TYPE_CODE_ARRAY) |
c906108c SS |
1835 | t2[i] = value_coerce_array (t2[i]); |
1836 | else | |
78134374 | 1837 | t2[i] = value_ref (t2[i], tt1->code ()); |
c906108c SS |
1838 | continue; |
1839 | } | |
1840 | ||
802db21b DB |
1841 | /* djb - 20000715 - Until the new type structure is in the |
1842 | place, and we can attempt things like implicit conversions, | |
1843 | we need to do this so you can take something like a map<const | |
1844 | char *>, and properly access map["hello"], because the | |
1845 | argument to [] will be a reference to a pointer to a char, | |
ac3eeb49 | 1846 | and the argument will be a pointer to a char. */ |
78134374 | 1847 | while (TYPE_IS_REFERENCE (tt1) || tt1->code () == TYPE_CODE_PTR) |
802db21b | 1848 | { |
78134374 | 1849 | tt1 = check_typedef ( TYPE_TARGET_TYPE (tt1) ); |
802db21b | 1850 | } |
78134374 SM |
1851 | while (tt2->code () == TYPE_CODE_ARRAY |
1852 | || tt2->code () == TYPE_CODE_PTR | |
aa006118 | 1853 | || TYPE_IS_REFERENCE (tt2)) |
c906108c | 1854 | { |
78134374 | 1855 | tt2 = check_typedef (TYPE_TARGET_TYPE (tt2)); |
c906108c | 1856 | } |
78134374 | 1857 | if (tt1->code () == tt2->code ()) |
c5aa993b | 1858 | continue; |
ac3eeb49 MS |
1859 | /* Array to pointer is a `trivial conversion' according to the |
1860 | ARM. */ | |
c906108c | 1861 | |
ac3eeb49 | 1862 | /* We should be doing much hairier argument matching (see |
dda83cd7 SM |
1863 | section 13.2 of the ARM), but as a quick kludge, just check |
1864 | for the same type code. */ | |
5d14b6e5 | 1865 | if (t1[i].type ()->code () != value_type (t2[i])->code ()) |
c5aa993b | 1866 | return i + 1; |
c906108c | 1867 | } |
13221aec | 1868 | if (varargs || i == t2.size ()) |
c5aa993b | 1869 | return 0; |
ad2f7632 | 1870 | return i + 1; |
c906108c SS |
1871 | } |
1872 | ||
87a37e5e PA |
1873 | /* Helper class for search_struct_field that keeps track of found |
1874 | results and possibly throws an exception if the search yields | |
1875 | ambiguous results. See search_struct_field for description of | |
1876 | LOOKING_FOR_BASECLASS. */ | |
c906108c | 1877 | |
87a37e5e PA |
1878 | struct struct_field_searcher |
1879 | { | |
1880 | /* A found field. */ | |
1881 | struct found_field | |
1882 | { | |
1883 | /* Path to the structure where the field was found. */ | |
1884 | std::vector<struct type *> path; | |
1885 | ||
1886 | /* The field found. */ | |
1887 | struct value *field_value; | |
1888 | }; | |
1889 | ||
1890 | /* See corresponding fields for description of parameters. */ | |
1891 | struct_field_searcher (const char *name, | |
1892 | struct type *outermost_type, | |
1893 | bool looking_for_baseclass) | |
1894 | : m_name (name), | |
1895 | m_looking_for_baseclass (looking_for_baseclass), | |
1896 | m_outermost_type (outermost_type) | |
1897 | { | |
1898 | } | |
1899 | ||
1900 | /* The search entry point. If LOOKING_FOR_BASECLASS is true and the | |
1901 | base class search yields ambiguous results, this throws an | |
1902 | exception. If LOOKING_FOR_BASECLASS is false, the found fields | |
1903 | are accumulated and the caller (search_struct_field) takes care | |
1904 | of throwing an error if the field search yields ambiguous | |
1905 | results. The latter is done that way so that the error message | |
1906 | can include a list of all the found candidates. */ | |
1907 | void search (struct value *arg, LONGEST offset, struct type *type); | |
1908 | ||
1909 | const std::vector<found_field> &fields () | |
1910 | { | |
1911 | return m_fields; | |
1912 | } | |
1913 | ||
1914 | struct value *baseclass () | |
1915 | { | |
1916 | return m_baseclass; | |
1917 | } | |
1918 | ||
1919 | private: | |
1920 | /* Update results to include V, a found field/baseclass. */ | |
1921 | void update_result (struct value *v, LONGEST boffset); | |
1922 | ||
1923 | /* The name of the field/baseclass we're searching for. */ | |
1924 | const char *m_name; | |
1925 | ||
1926 | /* Whether we're looking for a baseclass, or a field. */ | |
1927 | const bool m_looking_for_baseclass; | |
1928 | ||
1929 | /* The offset of the baseclass containing the field/baseclass we | |
1930 | last recorded. */ | |
1931 | LONGEST m_last_boffset = 0; | |
1932 | ||
1933 | /* If looking for a baseclass, then the result is stored here. */ | |
1934 | struct value *m_baseclass = nullptr; | |
1935 | ||
1936 | /* When looking for fields, the found candidates are stored | |
1937 | here. */ | |
1938 | std::vector<found_field> m_fields; | |
1939 | ||
1940 | /* The type of the initial type passed to search_struct_field; this | |
1941 | is used for error reporting when the lookup is ambiguous. */ | |
1942 | struct type *m_outermost_type; | |
1943 | ||
1944 | /* The full path to the struct being inspected. E.g. for field 'x' | |
1945 | defined in class B inherited by class A, we have A and B pushed | |
1946 | on the path. */ | |
1947 | std::vector <struct type *> m_struct_path; | |
1948 | }; | |
1949 | ||
1950 | void | |
1951 | struct_field_searcher::update_result (struct value *v, LONGEST boffset) | |
b1af9e97 TT |
1952 | { |
1953 | if (v != NULL) | |
1954 | { | |
87a37e5e PA |
1955 | if (m_looking_for_baseclass) |
1956 | { | |
1957 | if (m_baseclass != nullptr | |
1958 | /* The result is not ambiguous if all the classes that are | |
1959 | found occupy the same space. */ | |
1960 | && m_last_boffset != boffset) | |
1961 | error (_("base class '%s' is ambiguous in type '%s'"), | |
1962 | m_name, TYPE_SAFE_NAME (m_outermost_type)); | |
1963 | ||
1964 | m_baseclass = v; | |
1965 | m_last_boffset = boffset; | |
1966 | } | |
1967 | else | |
1968 | { | |
1969 | /* The field is not ambiguous if it occupies the same | |
1970 | space. */ | |
1971 | if (m_fields.empty () || m_last_boffset != boffset) | |
1972 | m_fields.push_back ({m_struct_path, v}); | |
1973 | } | |
b1af9e97 TT |
1974 | } |
1975 | } | |
c906108c | 1976 | |
b1af9e97 | 1977 | /* A helper for search_struct_field. This does all the work; most |
87a37e5e | 1978 | arguments are as passed to search_struct_field. */ |
b1af9e97 | 1979 | |
87a37e5e PA |
1980 | void |
1981 | struct_field_searcher::search (struct value *arg1, LONGEST offset, | |
1982 | struct type *type) | |
c906108c SS |
1983 | { |
1984 | int i; | |
edf3d5f3 | 1985 | int nbases; |
c906108c | 1986 | |
87a37e5e PA |
1987 | m_struct_path.push_back (type); |
1988 | SCOPE_EXIT { m_struct_path.pop_back (); }; | |
1989 | ||
f168693b | 1990 | type = check_typedef (type); |
edf3d5f3 | 1991 | nbases = TYPE_N_BASECLASSES (type); |
c906108c | 1992 | |
87a37e5e | 1993 | if (!m_looking_for_baseclass) |
1f704f76 | 1994 | for (i = type->num_fields () - 1; i >= nbases; i--) |
c906108c | 1995 | { |
0d5cff50 | 1996 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
c906108c | 1997 | |
87a37e5e | 1998 | if (t_field_name && (strcmp_iw (t_field_name, m_name) == 0)) |
c906108c | 1999 | { |
f23631e4 | 2000 | struct value *v; |
a109c7c1 | 2001 | |
ceacbf6e | 2002 | if (field_is_static (&type->field (i))) |
686d4def | 2003 | v = value_static_field (type, i); |
c906108c | 2004 | else |
b1af9e97 | 2005 | v = value_primitive_field (arg1, offset, i, type); |
87a37e5e PA |
2006 | |
2007 | update_result (v, offset); | |
b1af9e97 | 2008 | return; |
c906108c SS |
2009 | } |
2010 | ||
2011 | if (t_field_name | |
47c6ee49 | 2012 | && t_field_name[0] == '\0') |
c906108c | 2013 | { |
940da03e | 2014 | struct type *field_type = type->field (i).type (); |
a109c7c1 | 2015 | |
78134374 SM |
2016 | if (field_type->code () == TYPE_CODE_UNION |
2017 | || field_type->code () == TYPE_CODE_STRUCT) | |
c906108c | 2018 | { |
ac3eeb49 MS |
2019 | /* Look for a match through the fields of an anonymous |
2020 | union, or anonymous struct. C++ provides anonymous | |
2021 | unions. | |
c906108c | 2022 | |
1b831c93 AC |
2023 | In the GNU Chill (now deleted from GDB) |
2024 | implementation of variant record types, each | |
2025 | <alternative field> has an (anonymous) union type, | |
2026 | each member of the union represents a <variant | |
2027 | alternative>. Each <variant alternative> is | |
2028 | represented as a struct, with a member for each | |
2029 | <variant field>. */ | |
c5aa993b | 2030 | |
6b850546 | 2031 | LONGEST new_offset = offset; |
c906108c | 2032 | |
db034ac5 AC |
2033 | /* This is pretty gross. In G++, the offset in an |
2034 | anonymous union is relative to the beginning of the | |
1b831c93 AC |
2035 | enclosing struct. In the GNU Chill (now deleted |
2036 | from GDB) implementation of variant records, the | |
2037 | bitpos is zero in an anonymous union field, so we | |
ac3eeb49 | 2038 | have to add the offset of the union here. */ |
78134374 | 2039 | if (field_type->code () == TYPE_CODE_STRUCT |
1f704f76 | 2040 | || (field_type->num_fields () > 0 |
c906108c SS |
2041 | && TYPE_FIELD_BITPOS (field_type, 0) == 0)) |
2042 | new_offset += TYPE_FIELD_BITPOS (type, i) / 8; | |
2043 | ||
87a37e5e | 2044 | search (arg1, new_offset, field_type); |
c906108c SS |
2045 | } |
2046 | } | |
2047 | } | |
2048 | ||
c5aa993b | 2049 | for (i = 0; i < nbases; i++) |
c906108c | 2050 | { |
b1af9e97 | 2051 | struct value *v = NULL; |
c906108c | 2052 | struct type *basetype = check_typedef (TYPE_BASECLASS (type, i)); |
ac3eeb49 | 2053 | /* If we are looking for baseclasses, this is what we get when |
dda83cd7 SM |
2054 | we hit them. But it could happen that the base part's member |
2055 | name is not yet filled in. */ | |
87a37e5e | 2056 | int found_baseclass = (m_looking_for_baseclass |
c906108c | 2057 | && TYPE_BASECLASS_NAME (type, i) != NULL |
87a37e5e PA |
2058 | && (strcmp_iw (m_name, |
2059 | TYPE_BASECLASS_NAME (type, | |
ac3eeb49 | 2060 | i)) == 0)); |
6b850546 | 2061 | LONGEST boffset = value_embedded_offset (arg1) + offset; |
c906108c SS |
2062 | |
2063 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2064 | { | |
3e3d7139 | 2065 | struct value *v2; |
c906108c SS |
2066 | |
2067 | boffset = baseclass_offset (type, i, | |
8af8e3bc PA |
2068 | value_contents_for_printing (arg1), |
2069 | value_embedded_offset (arg1) + offset, | |
2070 | value_address (arg1), | |
2071 | arg1); | |
c906108c | 2072 | |
ac3eeb49 | 2073 | /* The virtual base class pointer might have been clobbered |
581e13c1 | 2074 | by the user program. Make sure that it still points to a |
ac3eeb49 | 2075 | valid memory location. */ |
c906108c | 2076 | |
1a334831 TT |
2077 | boffset += value_embedded_offset (arg1) + offset; |
2078 | if (boffset < 0 | |
2079 | || boffset >= TYPE_LENGTH (value_enclosing_type (arg1))) | |
c906108c SS |
2080 | { |
2081 | CORE_ADDR base_addr; | |
c5aa993b | 2082 | |
42ae5230 | 2083 | base_addr = value_address (arg1) + boffset; |
08039c9e | 2084 | v2 = value_at_lazy (basetype, base_addr); |
ac3eeb49 MS |
2085 | if (target_read_memory (base_addr, |
2086 | value_contents_raw (v2), | |
acc900c2 | 2087 | TYPE_LENGTH (value_type (v2))) != 0) |
8a3fe4f8 | 2088 | error (_("virtual baseclass botch")); |
c906108c SS |
2089 | } |
2090 | else | |
2091 | { | |
1a334831 TT |
2092 | v2 = value_copy (arg1); |
2093 | deprecated_set_value_type (v2, basetype); | |
2094 | set_value_embedded_offset (v2, boffset); | |
c906108c SS |
2095 | } |
2096 | ||
2097 | if (found_baseclass) | |
b1af9e97 TT |
2098 | v = v2; |
2099 | else | |
87a37e5e | 2100 | search (v2, 0, TYPE_BASECLASS (type, i)); |
c906108c SS |
2101 | } |
2102 | else if (found_baseclass) | |
2103 | v = value_primitive_field (arg1, offset, i, type); | |
2104 | else | |
b1af9e97 | 2105 | { |
87a37e5e PA |
2106 | search (arg1, offset + TYPE_BASECLASS_BITPOS (type, i) / 8, |
2107 | basetype); | |
b1af9e97 TT |
2108 | } |
2109 | ||
87a37e5e | 2110 | update_result (v, boffset); |
c906108c | 2111 | } |
b1af9e97 TT |
2112 | } |
2113 | ||
2114 | /* Helper function used by value_struct_elt to recurse through | |
8a13d42d SM |
2115 | baseclasses. Look for a field NAME in ARG1. Search in it assuming |
2116 | it has (class) type TYPE. If found, return value, else return NULL. | |
b1af9e97 TT |
2117 | |
2118 | If LOOKING_FOR_BASECLASS, then instead of looking for struct | |
2119 | fields, look for a baseclass named NAME. */ | |
2120 | ||
2121 | static struct value * | |
8a13d42d | 2122 | search_struct_field (const char *name, struct value *arg1, |
b1af9e97 TT |
2123 | struct type *type, int looking_for_baseclass) |
2124 | { | |
87a37e5e | 2125 | struct_field_searcher searcher (name, type, looking_for_baseclass); |
b1af9e97 | 2126 | |
87a37e5e PA |
2127 | searcher.search (arg1, 0, type); |
2128 | ||
2129 | if (!looking_for_baseclass) | |
2130 | { | |
2131 | const auto &fields = searcher.fields (); | |
2132 | ||
2133 | if (fields.empty ()) | |
2134 | return nullptr; | |
2135 | else if (fields.size () == 1) | |
2136 | return fields[0].field_value; | |
2137 | else | |
2138 | { | |
2139 | std::string candidates; | |
2140 | ||
2141 | for (auto &&candidate : fields) | |
2142 | { | |
2143 | gdb_assert (!candidate.path.empty ()); | |
2144 | ||
2145 | struct type *field_type = value_type (candidate.field_value); | |
2146 | struct type *struct_type = candidate.path.back (); | |
2147 | ||
2148 | std::string path; | |
2149 | bool first = true; | |
2150 | for (struct type *t : candidate.path) | |
2151 | { | |
2152 | if (first) | |
2153 | first = false; | |
2154 | else | |
2155 | path += " -> "; | |
2156 | path += t->name (); | |
2157 | } | |
2158 | ||
2159 | candidates += string_printf ("\n '%s %s::%s' (%s)", | |
2160 | TYPE_SAFE_NAME (field_type), | |
2161 | TYPE_SAFE_NAME (struct_type), | |
2162 | name, | |
2163 | path.c_str ()); | |
2164 | } | |
2165 | ||
2166 | error (_("Request for member '%s' is ambiguous in type '%s'." | |
2167 | " Candidates are:%s"), | |
2168 | name, TYPE_SAFE_NAME (type), | |
2169 | candidates.c_str ()); | |
2170 | } | |
2171 | } | |
2172 | else | |
2173 | return searcher.baseclass (); | |
c906108c SS |
2174 | } |
2175 | ||
ac3eeb49 | 2176 | /* Helper function used by value_struct_elt to recurse through |
581e13c1 | 2177 | baseclasses. Look for a field NAME in ARG1. Adjust the address of |
ac3eeb49 MS |
2178 | ARG1 by OFFSET bytes, and search in it assuming it has (class) type |
2179 | TYPE. | |
2180 | ||
158cc4fe AB |
2181 | ARGS is an optional array of argument values used to help finding NAME. |
2182 | The contents of ARGS can be adjusted if type coercion is required in | |
2183 | order to find a matching NAME. | |
79bd4d34 | 2184 | |
ac3eeb49 MS |
2185 | If found, return value, else if name matched and args not return |
2186 | (value) -1, else return NULL. */ | |
c906108c | 2187 | |
f23631e4 | 2188 | static struct value * |
714f19d5 | 2189 | search_struct_method (const char *name, struct value **arg1p, |
158cc4fe AB |
2190 | gdb::optional<gdb::array_view<value *>> args, |
2191 | LONGEST offset, int *static_memfuncp, | |
2192 | struct type *type) | |
c906108c SS |
2193 | { |
2194 | int i; | |
f23631e4 | 2195 | struct value *v; |
c906108c | 2196 | int name_matched = 0; |
c906108c | 2197 | |
f168693b | 2198 | type = check_typedef (type); |
c906108c SS |
2199 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) |
2200 | { | |
0d5cff50 | 2201 | const char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i); |
a109c7c1 | 2202 | |
db577aea | 2203 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2204 | { |
2205 | int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1; | |
2206 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
c906108c | 2207 | |
a109c7c1 | 2208 | name_matched = 1; |
de17c821 | 2209 | check_stub_method_group (type, i); |
158cc4fe | 2210 | if (j > 0 && !args.has_value ()) |
3e43a32a MS |
2211 | error (_("cannot resolve overloaded method " |
2212 | "`%s': no arguments supplied"), name); | |
158cc4fe | 2213 | else if (j == 0 && !args.has_value ()) |
c906108c | 2214 | { |
acf5ed49 DJ |
2215 | v = value_fn_field (arg1p, f, j, type, offset); |
2216 | if (v != NULL) | |
2217 | return v; | |
c906108c | 2218 | } |
acf5ed49 DJ |
2219 | else |
2220 | while (j >= 0) | |
2221 | { | |
158cc4fe | 2222 | gdb_assert (args.has_value ()); |
acf5ed49 | 2223 | if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j), |
a409645d | 2224 | TYPE_FN_FIELD_TYPE (f, j)->has_varargs (), |
1f704f76 | 2225 | TYPE_FN_FIELD_TYPE (f, j)->num_fields (), |
13221aec | 2226 | TYPE_FN_FIELD_ARGS (f, j), *args)) |
acf5ed49 DJ |
2227 | { |
2228 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) | |
ac3eeb49 MS |
2229 | return value_virtual_fn_field (arg1p, f, j, |
2230 | type, offset); | |
2231 | if (TYPE_FN_FIELD_STATIC_P (f, j) | |
2232 | && static_memfuncp) | |
acf5ed49 DJ |
2233 | *static_memfuncp = 1; |
2234 | v = value_fn_field (arg1p, f, j, type, offset); | |
2235 | if (v != NULL) | |
2236 | return v; | |
2237 | } | |
2238 | j--; | |
2239 | } | |
c906108c SS |
2240 | } |
2241 | } | |
2242 | ||
2243 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
2244 | { | |
6b850546 DT |
2245 | LONGEST base_offset; |
2246 | LONGEST this_offset; | |
c906108c SS |
2247 | |
2248 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2249 | { | |
086280be | 2250 | struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i)); |
8af8e3bc | 2251 | struct value *base_val; |
086280be UW |
2252 | const gdb_byte *base_valaddr; |
2253 | ||
2254 | /* The virtual base class pointer might have been | |
581e13c1 | 2255 | clobbered by the user program. Make sure that it |
8301c89e | 2256 | still points to a valid memory location. */ |
086280be UW |
2257 | |
2258 | if (offset < 0 || offset >= TYPE_LENGTH (type)) | |
c5aa993b | 2259 | { |
6c18f3e0 SP |
2260 | CORE_ADDR address; |
2261 | ||
26fcd5d7 | 2262 | gdb::byte_vector tmp (TYPE_LENGTH (baseclass)); |
6c18f3e0 | 2263 | address = value_address (*arg1p); |
a109c7c1 | 2264 | |
8af8e3bc | 2265 | if (target_read_memory (address + offset, |
26fcd5d7 | 2266 | tmp.data (), TYPE_LENGTH (baseclass)) != 0) |
086280be | 2267 | error (_("virtual baseclass botch")); |
8af8e3bc PA |
2268 | |
2269 | base_val = value_from_contents_and_address (baseclass, | |
26fcd5d7 | 2270 | tmp.data (), |
8af8e3bc PA |
2271 | address + offset); |
2272 | base_valaddr = value_contents_for_printing (base_val); | |
2273 | this_offset = 0; | |
c5aa993b JM |
2274 | } |
2275 | else | |
8af8e3bc PA |
2276 | { |
2277 | base_val = *arg1p; | |
2278 | base_valaddr = value_contents_for_printing (*arg1p); | |
2279 | this_offset = offset; | |
2280 | } | |
c5aa993b | 2281 | |
086280be | 2282 | base_offset = baseclass_offset (type, i, base_valaddr, |
8af8e3bc PA |
2283 | this_offset, value_address (base_val), |
2284 | base_val); | |
c5aa993b | 2285 | } |
c906108c SS |
2286 | else |
2287 | { | |
2288 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2289 | } |
c906108c SS |
2290 | v = search_struct_method (name, arg1p, args, base_offset + offset, |
2291 | static_memfuncp, TYPE_BASECLASS (type, i)); | |
f23631e4 | 2292 | if (v == (struct value *) - 1) |
c906108c SS |
2293 | { |
2294 | name_matched = 1; | |
2295 | } | |
2296 | else if (v) | |
2297 | { | |
ac3eeb49 MS |
2298 | /* FIXME-bothner: Why is this commented out? Why is it here? */ |
2299 | /* *arg1p = arg1_tmp; */ | |
c906108c | 2300 | return v; |
c5aa993b | 2301 | } |
c906108c | 2302 | } |
c5aa993b | 2303 | if (name_matched) |
f23631e4 | 2304 | return (struct value *) - 1; |
c5aa993b JM |
2305 | else |
2306 | return NULL; | |
c906108c SS |
2307 | } |
2308 | ||
2309 | /* Given *ARGP, a value of type (pointer to a)* structure/union, | |
ac3eeb49 MS |
2310 | extract the component named NAME from the ultimate target |
2311 | structure/union and return it as a value with its appropriate type. | |
c906108c SS |
2312 | ERR is used in the error message if *ARGP's type is wrong. |
2313 | ||
2314 | C++: ARGS is a list of argument types to aid in the selection of | |
13221aec | 2315 | an appropriate method. Also, handle derived types. |
c906108c SS |
2316 | |
2317 | STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location | |
2318 | where the truthvalue of whether the function that was resolved was | |
2319 | a static member function or not is stored. | |
2320 | ||
ac3eeb49 MS |
2321 | ERR is an error message to be printed in case the field is not |
2322 | found. */ | |
c906108c | 2323 | |
f23631e4 | 2324 | struct value * |
158cc4fe AB |
2325 | value_struct_elt (struct value **argp, |
2326 | gdb::optional<gdb::array_view<value *>> args, | |
714f19d5 | 2327 | const char *name, int *static_memfuncp, const char *err) |
c906108c | 2328 | { |
52f0bd74 | 2329 | struct type *t; |
f23631e4 | 2330 | struct value *v; |
c906108c | 2331 | |
994b9211 | 2332 | *argp = coerce_array (*argp); |
c906108c | 2333 | |
df407dfe | 2334 | t = check_typedef (value_type (*argp)); |
c906108c SS |
2335 | |
2336 | /* Follow pointers until we get to a non-pointer. */ | |
2337 | ||
78134374 | 2338 | while (t->code () == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
c906108c SS |
2339 | { |
2340 | *argp = value_ind (*argp); | |
2341 | /* Don't coerce fn pointer to fn and then back again! */ | |
78134374 | 2342 | if (check_typedef (value_type (*argp))->code () != TYPE_CODE_FUNC) |
994b9211 | 2343 | *argp = coerce_array (*argp); |
df407dfe | 2344 | t = check_typedef (value_type (*argp)); |
c906108c SS |
2345 | } |
2346 | ||
78134374 SM |
2347 | if (t->code () != TYPE_CODE_STRUCT |
2348 | && t->code () != TYPE_CODE_UNION) | |
3e43a32a MS |
2349 | error (_("Attempt to extract a component of a value that is not a %s."), |
2350 | err); | |
c906108c SS |
2351 | |
2352 | /* Assume it's not, unless we see that it is. */ | |
2353 | if (static_memfuncp) | |
c5aa993b | 2354 | *static_memfuncp = 0; |
c906108c | 2355 | |
158cc4fe | 2356 | if (!args.has_value ()) |
c906108c SS |
2357 | { |
2358 | /* if there are no arguments ...do this... */ | |
2359 | ||
ac3eeb49 | 2360 | /* Try as a field first, because if we succeed, there is less |
dda83cd7 | 2361 | work to be done. */ |
8a13d42d | 2362 | v = search_struct_field (name, *argp, t, 0); |
c906108c SS |
2363 | if (v) |
2364 | return v; | |
2365 | ||
2366 | /* C++: If it was not found as a data field, then try to | |
dda83cd7 | 2367 | return it as a pointer to a method. */ |
13221aec | 2368 | v = search_struct_method (name, argp, args, 0, |
ac3eeb49 | 2369 | static_memfuncp, t); |
c906108c | 2370 | |
f23631e4 | 2371 | if (v == (struct value *) - 1) |
55b39184 | 2372 | error (_("Cannot take address of method %s."), name); |
c906108c SS |
2373 | else if (v == 0) |
2374 | { | |
2375 | if (TYPE_NFN_FIELDS (t)) | |
8a3fe4f8 | 2376 | error (_("There is no member or method named %s."), name); |
c906108c | 2377 | else |
8a3fe4f8 | 2378 | error (_("There is no member named %s."), name); |
c906108c SS |
2379 | } |
2380 | return v; | |
2381 | } | |
2382 | ||
13221aec | 2383 | v = search_struct_method (name, argp, args, 0, |
8301c89e | 2384 | static_memfuncp, t); |
13221aec | 2385 | |
f23631e4 | 2386 | if (v == (struct value *) - 1) |
c906108c | 2387 | { |
3e43a32a MS |
2388 | error (_("One of the arguments you tried to pass to %s could not " |
2389 | "be converted to what the function wants."), name); | |
c906108c SS |
2390 | } |
2391 | else if (v == 0) | |
2392 | { | |
ac3eeb49 | 2393 | /* See if user tried to invoke data as function. If so, hand it |
dda83cd7 SM |
2394 | back. If it's not callable (i.e., a pointer to function), |
2395 | gdb should give an error. */ | |
8a13d42d | 2396 | v = search_struct_field (name, *argp, t, 0); |
fa8de41e TT |
2397 | /* If we found an ordinary field, then it is not a method call. |
2398 | So, treat it as if it were a static member function. */ | |
2399 | if (v && static_memfuncp) | |
2400 | *static_memfuncp = 1; | |
c906108c SS |
2401 | } |
2402 | ||
2403 | if (!v) | |
79afc5ef | 2404 | throw_error (NOT_FOUND_ERROR, |
dda83cd7 | 2405 | _("Structure has no component named %s."), name); |
c906108c SS |
2406 | return v; |
2407 | } | |
2408 | ||
b5b08fb4 SC |
2409 | /* Given *ARGP, a value of type structure or union, or a pointer/reference |
2410 | to a structure or union, extract and return its component (field) of | |
2411 | type FTYPE at the specified BITPOS. | |
2412 | Throw an exception on error. */ | |
2413 | ||
2414 | struct value * | |
2415 | value_struct_elt_bitpos (struct value **argp, int bitpos, struct type *ftype, | |
2416 | const char *err) | |
2417 | { | |
2418 | struct type *t; | |
b5b08fb4 | 2419 | int i; |
b5b08fb4 SC |
2420 | |
2421 | *argp = coerce_array (*argp); | |
2422 | ||
2423 | t = check_typedef (value_type (*argp)); | |
2424 | ||
78134374 | 2425 | while (t->code () == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
b5b08fb4 SC |
2426 | { |
2427 | *argp = value_ind (*argp); | |
78134374 | 2428 | if (check_typedef (value_type (*argp))->code () != TYPE_CODE_FUNC) |
b5b08fb4 SC |
2429 | *argp = coerce_array (*argp); |
2430 | t = check_typedef (value_type (*argp)); | |
2431 | } | |
2432 | ||
78134374 SM |
2433 | if (t->code () != TYPE_CODE_STRUCT |
2434 | && t->code () != TYPE_CODE_UNION) | |
b5b08fb4 SC |
2435 | error (_("Attempt to extract a component of a value that is not a %s."), |
2436 | err); | |
2437 | ||
1f704f76 | 2438 | for (i = TYPE_N_BASECLASSES (t); i < t->num_fields (); i++) |
b5b08fb4 | 2439 | { |
ceacbf6e | 2440 | if (!field_is_static (&t->field (i)) |
b5b08fb4 | 2441 | && bitpos == TYPE_FIELD_BITPOS (t, i) |
940da03e | 2442 | && types_equal (ftype, t->field (i).type ())) |
b5b08fb4 SC |
2443 | return value_primitive_field (*argp, 0, i, t); |
2444 | } | |
2445 | ||
2446 | error (_("No field with matching bitpos and type.")); | |
2447 | ||
2448 | /* Never hit. */ | |
2449 | return NULL; | |
2450 | } | |
2451 | ||
ac3eeb49 | 2452 | /* Search through the methods of an object (and its bases) to find a |
38139a96 | 2453 | specified method. Return a reference to the fn_field list METHODS of |
233e8b28 SC |
2454 | overloaded instances defined in the source language. If available |
2455 | and matching, a vector of matching xmethods defined in extension | |
38139a96 | 2456 | languages are also returned in XMETHODS. |
ac3eeb49 MS |
2457 | |
2458 | Helper function for value_find_oload_list. | |
2459 | ARGP is a pointer to a pointer to a value (the object). | |
2460 | METHOD is a string containing the method name. | |
2461 | OFFSET is the offset within the value. | |
2462 | TYPE is the assumed type of the object. | |
38139a96 PA |
2463 | METHODS is a pointer to the matching overloaded instances defined |
2464 | in the source language. Since this is a recursive function, | |
2465 | *METHODS should be set to NULL when calling this function. | |
233e8b28 SC |
2466 | NUM_FNS is the number of overloaded instances. *NUM_FNS should be set to |
2467 | 0 when calling this function. | |
38139a96 | 2468 | XMETHODS is the vector of matching xmethod workers. *XMETHODS |
233e8b28 | 2469 | should also be set to NULL when calling this function. |
ac3eeb49 MS |
2470 | BASETYPE is set to the actual type of the subobject where the |
2471 | method is found. | |
581e13c1 | 2472 | BOFFSET is the offset of the base subobject where the method is found. */ |
c906108c | 2473 | |
233e8b28 | 2474 | static void |
714f19d5 | 2475 | find_method_list (struct value **argp, const char *method, |
6b850546 | 2476 | LONGEST offset, struct type *type, |
38139a96 PA |
2477 | gdb::array_view<fn_field> *methods, |
2478 | std::vector<xmethod_worker_up> *xmethods, | |
6b850546 | 2479 | struct type **basetype, LONGEST *boffset) |
c906108c SS |
2480 | { |
2481 | int i; | |
233e8b28 | 2482 | struct fn_field *f = NULL; |
c906108c | 2483 | |
38139a96 | 2484 | gdb_assert (methods != NULL && xmethods != NULL); |
f168693b | 2485 | type = check_typedef (type); |
c906108c | 2486 | |
233e8b28 SC |
2487 | /* First check in object itself. |
2488 | This function is called recursively to search through base classes. | |
2489 | If there is a source method match found at some stage, then we need not | |
2490 | look for source methods in consequent recursive calls. */ | |
38139a96 | 2491 | if (methods->empty ()) |
c906108c | 2492 | { |
233e8b28 | 2493 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) |
c5aa993b | 2494 | { |
233e8b28 SC |
2495 | /* pai: FIXME What about operators and type conversions? */ |
2496 | const char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i); | |
2497 | ||
2498 | if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0)) | |
2499 | { | |
2500 | int len = TYPE_FN_FIELDLIST_LENGTH (type, i); | |
2501 | f = TYPE_FN_FIELDLIST1 (type, i); | |
38139a96 | 2502 | *methods = gdb::make_array_view (f, len); |
4a1970e4 | 2503 | |
233e8b28 SC |
2504 | *basetype = type; |
2505 | *boffset = offset; | |
4a1970e4 | 2506 | |
233e8b28 SC |
2507 | /* Resolve any stub methods. */ |
2508 | check_stub_method_group (type, i); | |
4a1970e4 | 2509 | |
233e8b28 SC |
2510 | break; |
2511 | } | |
c5aa993b JM |
2512 | } |
2513 | } | |
2514 | ||
233e8b28 SC |
2515 | /* Unlike source methods, xmethods can be accumulated over successive |
2516 | recursive calls. In other words, an xmethod named 'm' in a class | |
2517 | will not hide an xmethod named 'm' in its base class(es). We want | |
2518 | it to be this way because xmethods are after all convenience functions | |
2519 | and hence there is no point restricting them with something like method | |
2520 | hiding. Moreover, if hiding is done for xmethods as well, then we will | |
2521 | have to provide a mechanism to un-hide (like the 'using' construct). */ | |
38139a96 | 2522 | get_matching_xmethod_workers (type, method, xmethods); |
233e8b28 SC |
2523 | |
2524 | /* If source methods are not found in current class, look for them in the | |
2525 | base classes. We also have to go through the base classes to gather | |
2526 | extension methods. */ | |
c906108c SS |
2527 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) |
2528 | { | |
6b850546 | 2529 | LONGEST base_offset; |
a109c7c1 | 2530 | |
c906108c SS |
2531 | if (BASETYPE_VIA_VIRTUAL (type, i)) |
2532 | { | |
086280be | 2533 | base_offset = baseclass_offset (type, i, |
8af8e3bc PA |
2534 | value_contents_for_printing (*argp), |
2535 | value_offset (*argp) + offset, | |
2536 | value_address (*argp), *argp); | |
c5aa993b | 2537 | } |
ac3eeb49 MS |
2538 | else /* Non-virtual base, simply use bit position from debug |
2539 | info. */ | |
c906108c SS |
2540 | { |
2541 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2542 | } |
233e8b28 SC |
2543 | |
2544 | find_method_list (argp, method, base_offset + offset, | |
38139a96 PA |
2545 | TYPE_BASECLASS (type, i), methods, |
2546 | xmethods, basetype, boffset); | |
c906108c | 2547 | } |
c906108c SS |
2548 | } |
2549 | ||
233e8b28 SC |
2550 | /* Return the list of overloaded methods of a specified name. The methods |
2551 | could be those GDB finds in the binary, or xmethod. Methods found in | |
38139a96 PA |
2552 | the binary are returned in METHODS, and xmethods are returned in |
2553 | XMETHODS. | |
ac3eeb49 MS |
2554 | |
2555 | ARGP is a pointer to a pointer to a value (the object). | |
2556 | METHOD is the method name. | |
2557 | OFFSET is the offset within the value contents. | |
38139a96 PA |
2558 | METHODS is the list of matching overloaded instances defined in |
2559 | the source language. | |
2560 | XMETHODS is the vector of matching xmethod workers defined in | |
233e8b28 | 2561 | extension languages. |
ac3eeb49 MS |
2562 | BASETYPE is set to the type of the base subobject that defines the |
2563 | method. | |
581e13c1 | 2564 | BOFFSET is the offset of the base subobject which defines the method. */ |
c906108c | 2565 | |
233e8b28 | 2566 | static void |
714f19d5 | 2567 | value_find_oload_method_list (struct value **argp, const char *method, |
85cca2bc | 2568 | LONGEST offset, |
38139a96 PA |
2569 | gdb::array_view<fn_field> *methods, |
2570 | std::vector<xmethod_worker_up> *xmethods, | |
6b850546 | 2571 | struct type **basetype, LONGEST *boffset) |
c906108c | 2572 | { |
c5aa993b | 2573 | struct type *t; |
c906108c | 2574 | |
df407dfe | 2575 | t = check_typedef (value_type (*argp)); |
c906108c | 2576 | |
ac3eeb49 | 2577 | /* Code snarfed from value_struct_elt. */ |
78134374 | 2578 | while (t->code () == TYPE_CODE_PTR || TYPE_IS_REFERENCE (t)) |
c906108c SS |
2579 | { |
2580 | *argp = value_ind (*argp); | |
2581 | /* Don't coerce fn pointer to fn and then back again! */ | |
78134374 | 2582 | if (check_typedef (value_type (*argp))->code () != TYPE_CODE_FUNC) |
994b9211 | 2583 | *argp = coerce_array (*argp); |
df407dfe | 2584 | t = check_typedef (value_type (*argp)); |
c906108c | 2585 | } |
c5aa993b | 2586 | |
78134374 SM |
2587 | if (t->code () != TYPE_CODE_STRUCT |
2588 | && t->code () != TYPE_CODE_UNION) | |
3e43a32a MS |
2589 | error (_("Attempt to extract a component of a " |
2590 | "value that is not a struct or union")); | |
c5aa993b | 2591 | |
38139a96 | 2592 | gdb_assert (methods != NULL && xmethods != NULL); |
233e8b28 SC |
2593 | |
2594 | /* Clear the lists. */ | |
38139a96 PA |
2595 | *methods = {}; |
2596 | xmethods->clear (); | |
233e8b28 | 2597 | |
38139a96 | 2598 | find_method_list (argp, method, 0, t, methods, xmethods, |
233e8b28 | 2599 | basetype, boffset); |
c906108c SS |
2600 | } |
2601 | ||
6b1747cd PA |
2602 | /* Given an array of arguments (ARGS) (which includes an entry for |
2603 | "this" in the case of C++ methods), the NAME of a function, and | |
2604 | whether it's a method or not (METHOD), find the best function that | |
2605 | matches on the argument types according to the overload resolution | |
2606 | rules. | |
c906108c | 2607 | |
4c3376c8 SW |
2608 | METHOD can be one of three values: |
2609 | NON_METHOD for non-member functions. | |
2610 | METHOD: for member functions. | |
2611 | BOTH: used for overload resolution of operators where the | |
2612 | candidates are expected to be either member or non member | |
581e13c1 | 2613 | functions. In this case the first argument ARGTYPES |
4c3376c8 SW |
2614 | (representing 'this') is expected to be a reference to the |
2615 | target object, and will be dereferenced when attempting the | |
2616 | non-member search. | |
2617 | ||
c906108c SS |
2618 | In the case of class methods, the parameter OBJ is an object value |
2619 | in which to search for overloaded methods. | |
2620 | ||
2621 | In the case of non-method functions, the parameter FSYM is a symbol | |
2622 | corresponding to one of the overloaded functions. | |
2623 | ||
2624 | Return value is an integer: 0 -> good match, 10 -> debugger applied | |
2625 | non-standard coercions, 100 -> incompatible. | |
2626 | ||
2627 | If a method is being searched for, VALP will hold the value. | |
ac3eeb49 MS |
2628 | If a non-method is being searched for, SYMP will hold the symbol |
2629 | for it. | |
c906108c SS |
2630 | |
2631 | If a method is being searched for, and it is a static method, | |
2632 | then STATICP will point to a non-zero value. | |
2633 | ||
7322dca9 SW |
2634 | If NO_ADL argument dependent lookup is disabled. This is used to prevent |
2635 | ADL overload candidates when performing overload resolution for a fully | |
2636 | qualified name. | |
2637 | ||
e66d4446 SC |
2638 | If NOSIDE is EVAL_AVOID_SIDE_EFFECTS, then OBJP's memory cannot be |
2639 | read while picking the best overload match (it may be all zeroes and thus | |
2640 | not have a vtable pointer), in which case skip virtual function lookup. | |
2641 | This is ok as typically EVAL_AVOID_SIDE_EFFECTS is only used to determine | |
2642 | the result type. | |
2643 | ||
c906108c SS |
2644 | Note: This function does *not* check the value of |
2645 | overload_resolution. Caller must check it to see whether overload | |
581e13c1 | 2646 | resolution is permitted. */ |
c906108c SS |
2647 | |
2648 | int | |
6b1747cd | 2649 | find_overload_match (gdb::array_view<value *> args, |
4c3376c8 | 2650 | const char *name, enum oload_search_type method, |
28c64fc2 | 2651 | struct value **objp, struct symbol *fsym, |
ac3eeb49 | 2652 | struct value **valp, struct symbol **symp, |
e66d4446 SC |
2653 | int *staticp, const int no_adl, |
2654 | const enum noside noside) | |
c906108c | 2655 | { |
7f8c9282 | 2656 | struct value *obj = (objp ? *objp : NULL); |
da096638 | 2657 | struct type *obj_type = obj ? value_type (obj) : NULL; |
ac3eeb49 | 2658 | /* Index of best overloaded function. */ |
4c3376c8 SW |
2659 | int func_oload_champ = -1; |
2660 | int method_oload_champ = -1; | |
233e8b28 SC |
2661 | int src_method_oload_champ = -1; |
2662 | int ext_method_oload_champ = -1; | |
4c3376c8 | 2663 | |
ac3eeb49 | 2664 | /* The measure for the current best match. */ |
82ceee50 PA |
2665 | badness_vector method_badness; |
2666 | badness_vector func_badness; | |
2667 | badness_vector ext_method_badness; | |
2668 | badness_vector src_method_badness; | |
4c3376c8 | 2669 | |
f23631e4 | 2670 | struct value *temp = obj; |
ac3eeb49 | 2671 | /* For methods, the list of overloaded methods. */ |
38139a96 | 2672 | gdb::array_view<fn_field> methods; |
ac3eeb49 | 2673 | /* For non-methods, the list of overloaded function symbols. */ |
38139a96 | 2674 | std::vector<symbol *> functions; |
ba18742c | 2675 | /* For xmethods, the vector of xmethod workers. */ |
38139a96 | 2676 | std::vector<xmethod_worker_up> xmethods; |
c5aa993b | 2677 | struct type *basetype = NULL; |
6b850546 | 2678 | LONGEST boffset; |
7322dca9 | 2679 | |
8d577d32 | 2680 | const char *obj_type_name = NULL; |
7322dca9 | 2681 | const char *func_name = NULL; |
06d3e5b0 | 2682 | gdb::unique_xmalloc_ptr<char> temp_func; |
8d577d32 | 2683 | enum oload_classification match_quality; |
4c3376c8 | 2684 | enum oload_classification method_match_quality = INCOMPATIBLE; |
233e8b28 SC |
2685 | enum oload_classification src_method_match_quality = INCOMPATIBLE; |
2686 | enum oload_classification ext_method_match_quality = INCOMPATIBLE; | |
4c3376c8 | 2687 | enum oload_classification func_match_quality = INCOMPATIBLE; |
c906108c | 2688 | |
ac3eeb49 | 2689 | /* Get the list of overloaded methods or functions. */ |
4c3376c8 | 2690 | if (method == METHOD || method == BOTH) |
c906108c | 2691 | { |
a2ca50ae | 2692 | gdb_assert (obj); |
94af9270 KS |
2693 | |
2694 | /* OBJ may be a pointer value rather than the object itself. */ | |
2695 | obj = coerce_ref (obj); | |
78134374 | 2696 | while (check_typedef (value_type (obj))->code () == TYPE_CODE_PTR) |
94af9270 | 2697 | obj = coerce_ref (value_ind (obj)); |
7d93a1e0 | 2698 | obj_type_name = value_type (obj)->name (); |
94af9270 KS |
2699 | |
2700 | /* First check whether this is a data member, e.g. a pointer to | |
2701 | a function. */ | |
78134374 | 2702 | if (check_typedef (value_type (obj))->code () == TYPE_CODE_STRUCT) |
94af9270 | 2703 | { |
8a13d42d | 2704 | *valp = search_struct_field (name, obj, |
94af9270 KS |
2705 | check_typedef (value_type (obj)), 0); |
2706 | if (*valp) | |
2707 | { | |
2708 | *staticp = 1; | |
2709 | return 0; | |
2710 | } | |
2711 | } | |
c906108c | 2712 | |
4c3376c8 | 2713 | /* Retrieve the list of methods with the name NAME. */ |
38139a96 PA |
2714 | value_find_oload_method_list (&temp, name, 0, &methods, |
2715 | &xmethods, &basetype, &boffset); | |
4c3376c8 | 2716 | /* If this is a method only search, and no methods were found |
dda83cd7 | 2717 | the search has failed. */ |
38139a96 | 2718 | if (method == METHOD && methods.empty () && xmethods.empty ()) |
8a3fe4f8 | 2719 | error (_("Couldn't find method %s%s%s"), |
c5aa993b JM |
2720 | obj_type_name, |
2721 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2722 | name); | |
4a1970e4 | 2723 | /* If we are dealing with stub method types, they should have |
ac3eeb49 MS |
2724 | been resolved by find_method_list via |
2725 | value_find_oload_method_list above. */ | |
38139a96 | 2726 | if (!methods.empty ()) |
4c3376c8 | 2727 | { |
38139a96 | 2728 | gdb_assert (TYPE_SELF_TYPE (methods[0].type) != NULL); |
4c3376c8 | 2729 | |
85cca2bc PA |
2730 | src_method_oload_champ |
2731 | = find_oload_champ (args, | |
38139a96 PA |
2732 | methods.size (), |
2733 | methods.data (), NULL, NULL, | |
85cca2bc | 2734 | &src_method_badness); |
233e8b28 SC |
2735 | |
2736 | src_method_match_quality = classify_oload_match | |
6b1747cd | 2737 | (src_method_badness, args.size (), |
38139a96 | 2738 | oload_method_static_p (methods.data (), src_method_oload_champ)); |
233e8b28 | 2739 | } |
4c3376c8 | 2740 | |
38139a96 | 2741 | if (!xmethods.empty ()) |
233e8b28 | 2742 | { |
85cca2bc PA |
2743 | ext_method_oload_champ |
2744 | = find_oload_champ (args, | |
38139a96 PA |
2745 | xmethods.size (), |
2746 | NULL, xmethods.data (), NULL, | |
85cca2bc | 2747 | &ext_method_badness); |
233e8b28 | 2748 | ext_method_match_quality = classify_oload_match (ext_method_badness, |
6b1747cd | 2749 | args.size (), 0); |
4c3376c8 SW |
2750 | } |
2751 | ||
233e8b28 SC |
2752 | if (src_method_oload_champ >= 0 && ext_method_oload_champ >= 0) |
2753 | { | |
2754 | switch (compare_badness (ext_method_badness, src_method_badness)) | |
2755 | { | |
2756 | case 0: /* Src method and xmethod are equally good. */ | |
233e8b28 SC |
2757 | /* If src method and xmethod are equally good, then |
2758 | xmethod should be the winner. Hence, fall through to the | |
2759 | case where a xmethod is better than the source | |
2760 | method, except when the xmethod match quality is | |
2761 | non-standard. */ | |
2762 | /* FALLTHROUGH */ | |
2763 | case 1: /* Src method and ext method are incompatible. */ | |
2764 | /* If ext method match is not standard, then let source method | |
2765 | win. Otherwise, fallthrough to let xmethod win. */ | |
2766 | if (ext_method_match_quality != STANDARD) | |
2767 | { | |
2768 | method_oload_champ = src_method_oload_champ; | |
2769 | method_badness = src_method_badness; | |
2770 | ext_method_oload_champ = -1; | |
2771 | method_match_quality = src_method_match_quality; | |
2772 | break; | |
2773 | } | |
2774 | /* FALLTHROUGH */ | |
2775 | case 2: /* Ext method is champion. */ | |
2776 | method_oload_champ = ext_method_oload_champ; | |
2777 | method_badness = ext_method_badness; | |
2778 | src_method_oload_champ = -1; | |
2779 | method_match_quality = ext_method_match_quality; | |
2780 | break; | |
2781 | case 3: /* Src method is champion. */ | |
2782 | method_oload_champ = src_method_oload_champ; | |
2783 | method_badness = src_method_badness; | |
2784 | ext_method_oload_champ = -1; | |
2785 | method_match_quality = src_method_match_quality; | |
2786 | break; | |
2787 | default: | |
2788 | gdb_assert_not_reached ("Unexpected overload comparison " | |
2789 | "result"); | |
2790 | break; | |
2791 | } | |
2792 | } | |
2793 | else if (src_method_oload_champ >= 0) | |
2794 | { | |
2795 | method_oload_champ = src_method_oload_champ; | |
2796 | method_badness = src_method_badness; | |
2797 | method_match_quality = src_method_match_quality; | |
2798 | } | |
2799 | else if (ext_method_oload_champ >= 0) | |
2800 | { | |
2801 | method_oload_champ = ext_method_oload_champ; | |
2802 | method_badness = ext_method_badness; | |
2803 | method_match_quality = ext_method_match_quality; | |
2804 | } | |
c906108c | 2805 | } |
4c3376c8 SW |
2806 | |
2807 | if (method == NON_METHOD || method == BOTH) | |
c906108c | 2808 | { |
7322dca9 | 2809 | const char *qualified_name = NULL; |
c906108c | 2810 | |
b021a221 | 2811 | /* If the overload match is being search for both as a method |
dda83cd7 SM |
2812 | and non member function, the first argument must now be |
2813 | dereferenced. */ | |
4c3376c8 | 2814 | if (method == BOTH) |
2b214ea6 | 2815 | args[0] = value_ind (args[0]); |
4c3376c8 | 2816 | |
7322dca9 | 2817 | if (fsym) |
dda83cd7 SM |
2818 | { |
2819 | qualified_name = fsym->natural_name (); | |
7322dca9 | 2820 | |
dda83cd7 | 2821 | /* If we have a function with a C++ name, try to extract just |
7322dca9 SW |
2822 | the function part. Do not try this for non-functions (e.g. |
2823 | function pointers). */ | |
dda83cd7 SM |
2824 | if (qualified_name |
2825 | && (check_typedef (SYMBOL_TYPE (fsym))->code () | |
78134374 | 2826 | == TYPE_CODE_FUNC)) |
dda83cd7 | 2827 | { |
b926417a | 2828 | temp_func = cp_func_name (qualified_name); |
7322dca9 SW |
2829 | |
2830 | /* If cp_func_name did not remove anything, the name of the | |
dda83cd7 SM |
2831 | symbol did not include scope or argument types - it was |
2832 | probably a C-style function. */ | |
06d3e5b0 | 2833 | if (temp_func != nullptr) |
7322dca9 | 2834 | { |
06d3e5b0 | 2835 | if (strcmp (temp_func.get (), qualified_name) == 0) |
7322dca9 SW |
2836 | func_name = NULL; |
2837 | else | |
06d3e5b0 | 2838 | func_name = temp_func.get (); |
7322dca9 | 2839 | } |
dda83cd7 SM |
2840 | } |
2841 | } | |
7322dca9 | 2842 | else |
94af9270 | 2843 | { |
7322dca9 SW |
2844 | func_name = name; |
2845 | qualified_name = name; | |
94af9270 | 2846 | } |
d9639e13 | 2847 | |
94af9270 KS |
2848 | /* If there was no C++ name, this must be a C-style function or |
2849 | not a function at all. Just return the same symbol. Do the | |
2850 | same if cp_func_name fails for some reason. */ | |
8d577d32 | 2851 | if (func_name == NULL) |
dda83cd7 | 2852 | { |
917317f4 | 2853 | *symp = fsym; |
dda83cd7 SM |
2854 | return 0; |
2855 | } | |
917317f4 | 2856 | |
6b1747cd | 2857 | func_oload_champ = find_oload_champ_namespace (args, |
dda83cd7 SM |
2858 | func_name, |
2859 | qualified_name, | |
2860 | &functions, | |
2861 | &func_badness, | |
2862 | no_adl); | |
8d577d32 | 2863 | |
4c3376c8 | 2864 | if (func_oload_champ >= 0) |
6b1747cd PA |
2865 | func_match_quality = classify_oload_match (func_badness, |
2866 | args.size (), 0); | |
8d577d32 DC |
2867 | } |
2868 | ||
7322dca9 | 2869 | /* Did we find a match ? */ |
4c3376c8 | 2870 | if (method_oload_champ == -1 && func_oload_champ == -1) |
79afc5ef | 2871 | throw_error (NOT_FOUND_ERROR, |
dda83cd7 SM |
2872 | _("No symbol \"%s\" in current context."), |
2873 | name); | |
8d577d32 | 2874 | |
4c3376c8 SW |
2875 | /* If we have found both a method match and a function |
2876 | match, find out which one is better, and calculate match | |
2877 | quality. */ | |
2878 | if (method_oload_champ >= 0 && func_oload_champ >= 0) | |
2879 | { | |
2880 | switch (compare_badness (func_badness, method_badness)) | |
dda83cd7 | 2881 | { |
4c3376c8 | 2882 | case 0: /* Top two contenders are equally good. */ |
b021a221 MS |
2883 | /* FIXME: GDB does not support the general ambiguous case. |
2884 | All candidates should be collected and presented the | |
2885 | user. */ | |
4c3376c8 SW |
2886 | error (_("Ambiguous overload resolution")); |
2887 | break; | |
2888 | case 1: /* Incomparable top contenders. */ | |
2889 | /* This is an error incompatible candidates | |
2890 | should not have been proposed. */ | |
3e43a32a MS |
2891 | error (_("Internal error: incompatible " |
2892 | "overload candidates proposed")); | |
4c3376c8 SW |
2893 | break; |
2894 | case 2: /* Function champion. */ | |
2895 | method_oload_champ = -1; | |
2896 | match_quality = func_match_quality; | |
2897 | break; | |
2898 | case 3: /* Method champion. */ | |
2899 | func_oload_champ = -1; | |
2900 | match_quality = method_match_quality; | |
2901 | break; | |
2902 | default: | |
2903 | error (_("Internal error: unexpected overload comparison result")); | |
2904 | break; | |
dda83cd7 | 2905 | } |
4c3376c8 SW |
2906 | } |
2907 | else | |
2908 | { | |
2909 | /* We have either a method match or a function match. */ | |
2910 | if (method_oload_champ >= 0) | |
2911 | match_quality = method_match_quality; | |
2912 | else | |
2913 | match_quality = func_match_quality; | |
2914 | } | |
8d577d32 DC |
2915 | |
2916 | if (match_quality == INCOMPATIBLE) | |
2917 | { | |
4c3376c8 | 2918 | if (method == METHOD) |
8a3fe4f8 | 2919 | error (_("Cannot resolve method %s%s%s to any overloaded instance"), |
8d577d32 DC |
2920 | obj_type_name, |
2921 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2922 | name); | |
2923 | else | |
8a3fe4f8 | 2924 | error (_("Cannot resolve function %s to any overloaded instance"), |
8d577d32 DC |
2925 | func_name); |
2926 | } | |
2927 | else if (match_quality == NON_STANDARD) | |
2928 | { | |
4c3376c8 | 2929 | if (method == METHOD) |
3e43a32a MS |
2930 | warning (_("Using non-standard conversion to match " |
2931 | "method %s%s%s to supplied arguments"), | |
8d577d32 DC |
2932 | obj_type_name, |
2933 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2934 | name); | |
2935 | else | |
3e43a32a MS |
2936 | warning (_("Using non-standard conversion to match " |
2937 | "function %s to supplied arguments"), | |
8d577d32 DC |
2938 | func_name); |
2939 | } | |
2940 | ||
4c3376c8 | 2941 | if (staticp != NULL) |
38139a96 | 2942 | *staticp = oload_method_static_p (methods.data (), method_oload_champ); |
4c3376c8 SW |
2943 | |
2944 | if (method_oload_champ >= 0) | |
8d577d32 | 2945 | { |
233e8b28 SC |
2946 | if (src_method_oload_champ >= 0) |
2947 | { | |
38139a96 | 2948 | if (TYPE_FN_FIELD_VIRTUAL_P (methods, method_oload_champ) |
e66d4446 SC |
2949 | && noside != EVAL_AVOID_SIDE_EFFECTS) |
2950 | { | |
38139a96 | 2951 | *valp = value_virtual_fn_field (&temp, methods.data (), |
e66d4446 SC |
2952 | method_oload_champ, basetype, |
2953 | boffset); | |
2954 | } | |
233e8b28 | 2955 | else |
38139a96 | 2956 | *valp = value_fn_field (&temp, methods.data (), |
85cca2bc | 2957 | method_oload_champ, basetype, boffset); |
233e8b28 | 2958 | } |
8d577d32 | 2959 | else |
ba18742c | 2960 | *valp = value_from_xmethod |
38139a96 | 2961 | (std::move (xmethods[ext_method_oload_champ])); |
8d577d32 DC |
2962 | } |
2963 | else | |
38139a96 | 2964 | *symp = functions[func_oload_champ]; |
8d577d32 DC |
2965 | |
2966 | if (objp) | |
2967 | { | |
a4295225 | 2968 | struct type *temp_type = check_typedef (value_type (temp)); |
da096638 | 2969 | struct type *objtype = check_typedef (obj_type); |
a109c7c1 | 2970 | |
78134374 SM |
2971 | if (temp_type->code () != TYPE_CODE_PTR |
2972 | && (objtype->code () == TYPE_CODE_PTR | |
aa006118 | 2973 | || TYPE_IS_REFERENCE (objtype))) |
8d577d32 DC |
2974 | { |
2975 | temp = value_addr (temp); | |
2976 | } | |
2977 | *objp = temp; | |
2978 | } | |
7322dca9 | 2979 | |
8d577d32 DC |
2980 | switch (match_quality) |
2981 | { | |
2982 | case INCOMPATIBLE: | |
2983 | return 100; | |
2984 | case NON_STANDARD: | |
2985 | return 10; | |
2986 | default: /* STANDARD */ | |
2987 | return 0; | |
2988 | } | |
2989 | } | |
2990 | ||
2991 | /* Find the best overload match, searching for FUNC_NAME in namespaces | |
2992 | contained in QUALIFIED_NAME until it either finds a good match or | |
2993 | runs out of namespaces. It stores the overloaded functions in | |
82ceee50 | 2994 | *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. If NO_ADL, |
30baf67b | 2995 | argument dependent lookup is not performed. */ |
8d577d32 DC |
2996 | |
2997 | static int | |
6b1747cd | 2998 | find_oload_champ_namespace (gdb::array_view<value *> args, |
8d577d32 DC |
2999 | const char *func_name, |
3000 | const char *qualified_name, | |
0891c3cc | 3001 | std::vector<symbol *> *oload_syms, |
82ceee50 | 3002 | badness_vector *oload_champ_bv, |
7322dca9 | 3003 | const int no_adl) |
8d577d32 DC |
3004 | { |
3005 | int oload_champ; | |
3006 | ||
6b1747cd | 3007 | find_oload_champ_namespace_loop (args, |
8d577d32 DC |
3008 | func_name, |
3009 | qualified_name, 0, | |
3010 | oload_syms, oload_champ_bv, | |
7322dca9 SW |
3011 | &oload_champ, |
3012 | no_adl); | |
8d577d32 DC |
3013 | |
3014 | return oload_champ; | |
3015 | } | |
3016 | ||
3017 | /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is | |
3018 | how deep we've looked for namespaces, and the champ is stored in | |
3019 | OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0 | |
7322dca9 | 3020 | if it isn't. Other arguments are the same as in |
82ceee50 | 3021 | find_oload_champ_namespace. */ |
8d577d32 DC |
3022 | |
3023 | static int | |
6b1747cd | 3024 | find_oload_champ_namespace_loop (gdb::array_view<value *> args, |
8d577d32 DC |
3025 | const char *func_name, |
3026 | const char *qualified_name, | |
3027 | int namespace_len, | |
0891c3cc | 3028 | std::vector<symbol *> *oload_syms, |
82ceee50 | 3029 | badness_vector *oload_champ_bv, |
7322dca9 SW |
3030 | int *oload_champ, |
3031 | const int no_adl) | |
8d577d32 DC |
3032 | { |
3033 | int next_namespace_len = namespace_len; | |
3034 | int searched_deeper = 0; | |
8d577d32 | 3035 | int new_oload_champ; |
8d577d32 DC |
3036 | char *new_namespace; |
3037 | ||
3038 | if (next_namespace_len != 0) | |
3039 | { | |
3040 | gdb_assert (qualified_name[next_namespace_len] == ':'); | |
3041 | next_namespace_len += 2; | |
c906108c | 3042 | } |
ac3eeb49 MS |
3043 | next_namespace_len += |
3044 | cp_find_first_component (qualified_name + next_namespace_len); | |
8d577d32 | 3045 | |
581e13c1 | 3046 | /* First, see if we have a deeper namespace we can search in. |
ac3eeb49 | 3047 | If we get a good match there, use it. */ |
8d577d32 DC |
3048 | |
3049 | if (qualified_name[next_namespace_len] == ':') | |
3050 | { | |
3051 | searched_deeper = 1; | |
3052 | ||
6b1747cd | 3053 | if (find_oload_champ_namespace_loop (args, |
8d577d32 DC |
3054 | func_name, qualified_name, |
3055 | next_namespace_len, | |
3056 | oload_syms, oload_champ_bv, | |
7322dca9 | 3057 | oload_champ, no_adl)) |
8d577d32 DC |
3058 | { |
3059 | return 1; | |
3060 | } | |
3061 | }; | |
3062 | ||
3063 | /* If we reach here, either we're in the deepest namespace or we | |
3064 | didn't find a good match in a deeper namespace. But, in the | |
3065 | latter case, we still have a bad match in a deeper namespace; | |
3066 | note that we might not find any match at all in the current | |
3067 | namespace. (There's always a match in the deepest namespace, | |
3068 | because this overload mechanism only gets called if there's a | |
3069 | function symbol to start off with.) */ | |
3070 | ||
224c3ddb | 3071 | new_namespace = (char *) alloca (namespace_len + 1); |
8d577d32 DC |
3072 | strncpy (new_namespace, qualified_name, namespace_len); |
3073 | new_namespace[namespace_len] = '\0'; | |
0891c3cc PA |
3074 | |
3075 | std::vector<symbol *> new_oload_syms | |
3076 | = make_symbol_overload_list (func_name, new_namespace); | |
7322dca9 SW |
3077 | |
3078 | /* If we have reached the deepest level perform argument | |
3079 | determined lookup. */ | |
3080 | if (!searched_deeper && !no_adl) | |
da096638 KS |
3081 | { |
3082 | int ix; | |
3083 | struct type **arg_types; | |
3084 | ||
3085 | /* Prepare list of argument types for overload resolution. */ | |
3086 | arg_types = (struct type **) | |
6b1747cd PA |
3087 | alloca (args.size () * (sizeof (struct type *))); |
3088 | for (ix = 0; ix < args.size (); ix++) | |
da096638 | 3089 | arg_types[ix] = value_type (args[ix]); |
0891c3cc PA |
3090 | add_symbol_overload_list_adl ({arg_types, args.size ()}, func_name, |
3091 | &new_oload_syms); | |
da096638 | 3092 | } |
7322dca9 | 3093 | |
82ceee50 | 3094 | badness_vector new_oload_champ_bv; |
85cca2bc PA |
3095 | new_oload_champ = find_oload_champ (args, |
3096 | new_oload_syms.size (), | |
0891c3cc | 3097 | NULL, NULL, new_oload_syms.data (), |
8d577d32 DC |
3098 | &new_oload_champ_bv); |
3099 | ||
3100 | /* Case 1: We found a good match. Free earlier matches (if any), | |
3101 | and return it. Case 2: We didn't find a good match, but we're | |
3102 | not the deepest function. Then go with the bad match that the | |
3103 | deeper function found. Case 3: We found a bad match, and we're | |
3104 | the deepest function. Then return what we found, even though | |
3105 | it's a bad match. */ | |
3106 | ||
3107 | if (new_oload_champ != -1 | |
6b1747cd | 3108 | && classify_oload_match (new_oload_champ_bv, args.size (), 0) == STANDARD) |
8d577d32 | 3109 | { |
0891c3cc | 3110 | *oload_syms = std::move (new_oload_syms); |
8d577d32 | 3111 | *oload_champ = new_oload_champ; |
82ceee50 | 3112 | *oload_champ_bv = std::move (new_oload_champ_bv); |
8d577d32 DC |
3113 | return 1; |
3114 | } | |
3115 | else if (searched_deeper) | |
3116 | { | |
8d577d32 DC |
3117 | return 0; |
3118 | } | |
3119 | else | |
3120 | { | |
0891c3cc | 3121 | *oload_syms = std::move (new_oload_syms); |
8d577d32 | 3122 | *oload_champ = new_oload_champ; |
82ceee50 | 3123 | *oload_champ_bv = std::move (new_oload_champ_bv); |
8d577d32 DC |
3124 | return 0; |
3125 | } | |
3126 | } | |
3127 | ||
6b1747cd | 3128 | /* Look for a function to take ARGS. Find the best match from among |
38139a96 PA |
3129 | the overloaded methods or functions given by METHODS or FUNCTIONS |
3130 | or XMETHODS, respectively. One, and only one of METHODS, FUNCTIONS | |
3131 | and XMETHODS can be non-NULL. | |
233e8b28 | 3132 | |
38139a96 PA |
3133 | NUM_FNS is the length of the array pointed at by METHODS, FUNCTIONS |
3134 | or XMETHODS, whichever is non-NULL. | |
233e8b28 | 3135 | |
8d577d32 | 3136 | Return the index of the best match; store an indication of the |
82ceee50 | 3137 | quality of the match in OLOAD_CHAMP_BV. */ |
8d577d32 DC |
3138 | |
3139 | static int | |
6b1747cd | 3140 | find_oload_champ (gdb::array_view<value *> args, |
85cca2bc | 3141 | size_t num_fns, |
38139a96 PA |
3142 | fn_field *methods, |
3143 | xmethod_worker_up *xmethods, | |
3144 | symbol **functions, | |
82ceee50 | 3145 | badness_vector *oload_champ_bv) |
8d577d32 | 3146 | { |
ac3eeb49 | 3147 | /* A measure of how good an overloaded instance is. */ |
82ceee50 | 3148 | badness_vector bv; |
ac3eeb49 MS |
3149 | /* Index of best overloaded function. */ |
3150 | int oload_champ = -1; | |
3151 | /* Current ambiguity state for overload resolution. */ | |
3152 | int oload_ambiguous = 0; | |
3153 | /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */ | |
8d577d32 | 3154 | |
9cf95373 | 3155 | /* A champion can be found among methods alone, or among functions |
233e8b28 SC |
3156 | alone, or in xmethods alone, but not in more than one of these |
3157 | groups. */ | |
38139a96 | 3158 | gdb_assert ((methods != NULL) + (functions != NULL) + (xmethods != NULL) |
233e8b28 | 3159 | == 1); |
9cf95373 | 3160 | |
ac3eeb49 | 3161 | /* Consider each candidate in turn. */ |
85cca2bc | 3162 | for (size_t ix = 0; ix < num_fns; ix++) |
c906108c | 3163 | { |
8d577d32 | 3164 | int jj; |
233e8b28 | 3165 | int static_offset = 0; |
6b1747cd | 3166 | std::vector<type *> parm_types; |
8d577d32 | 3167 | |
38139a96 PA |
3168 | if (xmethods != NULL) |
3169 | parm_types = xmethods[ix]->get_arg_types (); | |
db577aea AC |
3170 | else |
3171 | { | |
6b1747cd PA |
3172 | size_t nparms; |
3173 | ||
38139a96 | 3174 | if (methods != NULL) |
233e8b28 | 3175 | { |
1f704f76 | 3176 | nparms = TYPE_FN_FIELD_TYPE (methods, ix)->num_fields (); |
38139a96 | 3177 | static_offset = oload_method_static_p (methods, ix); |
233e8b28 SC |
3178 | } |
3179 | else | |
1f704f76 | 3180 | nparms = SYMBOL_TYPE (functions[ix])->num_fields (); |
233e8b28 | 3181 | |
6b1747cd | 3182 | parm_types.reserve (nparms); |
233e8b28 | 3183 | for (jj = 0; jj < nparms; jj++) |
6b1747cd | 3184 | { |
38139a96 | 3185 | type *t = (methods != NULL |
5d14b6e5 | 3186 | ? (TYPE_FN_FIELD_ARGS (methods, ix)[jj].type ()) |
940da03e | 3187 | : SYMBOL_TYPE (functions[ix])->field (jj).type ()); |
6b1747cd PA |
3188 | parm_types.push_back (t); |
3189 | } | |
db577aea | 3190 | } |
c906108c | 3191 | |
ac3eeb49 | 3192 | /* Compare parameter types to supplied argument types. Skip |
dda83cd7 | 3193 | THIS for static methods. */ |
6b1747cd PA |
3194 | bv = rank_function (parm_types, |
3195 | args.slice (static_offset)); | |
c5aa993b | 3196 | |
e9194a1a TBA |
3197 | if (overload_debug) |
3198 | { | |
3199 | if (methods != NULL) | |
3200 | fprintf_filtered (gdb_stderr, | |
3201 | "Overloaded method instance %s, # of parms %d\n", | |
3202 | methods[ix].physname, (int) parm_types.size ()); | |
3203 | else if (xmethods != NULL) | |
3204 | fprintf_filtered (gdb_stderr, | |
3205 | "Xmethod worker, # of parms %d\n", | |
3206 | (int) parm_types.size ()); | |
3207 | else | |
3208 | fprintf_filtered (gdb_stderr, | |
3209 | "Overloaded function instance " | |
3210 | "%s # of parms %d\n", | |
3211 | functions[ix]->demangled_name (), | |
3212 | (int) parm_types.size ()); | |
a992a3b0 TBA |
3213 | |
3214 | fprintf_filtered (gdb_stderr, | |
3215 | "...Badness of length : {%d, %d}\n", | |
3216 | bv[0].rank, bv[0].subrank); | |
3217 | ||
3218 | for (jj = 1; jj < bv.size (); jj++) | |
e9194a1a | 3219 | fprintf_filtered (gdb_stderr, |
a992a3b0 TBA |
3220 | "...Badness of arg %d : {%d, %d}\n", |
3221 | jj, bv[jj].rank, bv[jj].subrank); | |
e9194a1a TBA |
3222 | } |
3223 | ||
82ceee50 | 3224 | if (oload_champ_bv->empty ()) |
c5aa993b | 3225 | { |
82ceee50 | 3226 | *oload_champ_bv = std::move (bv); |
c5aa993b | 3227 | oload_champ = 0; |
c5aa993b | 3228 | } |
ac3eeb49 MS |
3229 | else /* See whether current candidate is better or worse than |
3230 | previous best. */ | |
8d577d32 | 3231 | switch (compare_badness (bv, *oload_champ_bv)) |
c5aa993b | 3232 | { |
ac3eeb49 MS |
3233 | case 0: /* Top two contenders are equally good. */ |
3234 | oload_ambiguous = 1; | |
c5aa993b | 3235 | break; |
ac3eeb49 MS |
3236 | case 1: /* Incomparable top contenders. */ |
3237 | oload_ambiguous = 2; | |
c5aa993b | 3238 | break; |
ac3eeb49 | 3239 | case 2: /* New champion, record details. */ |
82ceee50 | 3240 | *oload_champ_bv = std::move (bv); |
c5aa993b JM |
3241 | oload_ambiguous = 0; |
3242 | oload_champ = ix; | |
c5aa993b JM |
3243 | break; |
3244 | case 3: | |
3245 | default: | |
3246 | break; | |
3247 | } | |
6b1ba9a0 | 3248 | if (overload_debug) |
e9194a1a TBA |
3249 | fprintf_filtered (gdb_stderr, "Overload resolution " |
3250 | "champion is %d, ambiguous? %d\n", | |
3251 | oload_champ, oload_ambiguous); | |
c906108c SS |
3252 | } |
3253 | ||
8d577d32 DC |
3254 | return oload_champ; |
3255 | } | |
6b1ba9a0 | 3256 | |
8d577d32 DC |
3257 | /* Return 1 if we're looking at a static method, 0 if we're looking at |
3258 | a non-static method or a function that isn't a method. */ | |
c906108c | 3259 | |
8d577d32 | 3260 | static int |
2bca57ba | 3261 | oload_method_static_p (struct fn_field *fns_ptr, int index) |
8d577d32 | 3262 | { |
2bca57ba | 3263 | if (fns_ptr && index >= 0 && TYPE_FN_FIELD_STATIC_P (fns_ptr, index)) |
8d577d32 | 3264 | return 1; |
c906108c | 3265 | else |
8d577d32 DC |
3266 | return 0; |
3267 | } | |
c906108c | 3268 | |
8d577d32 DC |
3269 | /* Check how good an overload match OLOAD_CHAMP_BV represents. */ |
3270 | ||
3271 | static enum oload_classification | |
82ceee50 | 3272 | classify_oload_match (const badness_vector &oload_champ_bv, |
8d577d32 DC |
3273 | int nargs, |
3274 | int static_offset) | |
3275 | { | |
3276 | int ix; | |
da096638 | 3277 | enum oload_classification worst = STANDARD; |
8d577d32 DC |
3278 | |
3279 | for (ix = 1; ix <= nargs - static_offset; ix++) | |
7f8c9282 | 3280 | { |
6403aeea | 3281 | /* If this conversion is as bad as INCOMPATIBLE_TYPE_BADNESS |
dda83cd7 | 3282 | or worse return INCOMPATIBLE. */ |
82ceee50 | 3283 | if (compare_ranks (oload_champ_bv[ix], |
dda83cd7 | 3284 | INCOMPATIBLE_TYPE_BADNESS) <= 0) |
ac3eeb49 | 3285 | return INCOMPATIBLE; /* Truly mismatched types. */ |
6403aeea | 3286 | /* Otherwise If this conversion is as bad as |
dda83cd7 | 3287 | NS_POINTER_CONVERSION_BADNESS or worse return NON_STANDARD. */ |
82ceee50 | 3288 | else if (compare_ranks (oload_champ_bv[ix], |
dda83cd7 | 3289 | NS_POINTER_CONVERSION_BADNESS) <= 0) |
da096638 | 3290 | worst = NON_STANDARD; /* Non-standard type conversions |
ac3eeb49 | 3291 | needed. */ |
7f8c9282 | 3292 | } |
02f0d45d | 3293 | |
da096638 KS |
3294 | /* If no INCOMPATIBLE classification was found, return the worst one |
3295 | that was found (if any). */ | |
3296 | return worst; | |
c906108c SS |
3297 | } |
3298 | ||
ac3eeb49 MS |
3299 | /* C++: return 1 is NAME is a legitimate name for the destructor of |
3300 | type TYPE. If TYPE does not have a destructor, or if NAME is | |
d8228535 JK |
3301 | inappropriate for TYPE, an error is signaled. Parameter TYPE should not yet |
3302 | have CHECK_TYPEDEF applied, this function will apply it itself. */ | |
3303 | ||
c906108c | 3304 | int |
d8228535 | 3305 | destructor_name_p (const char *name, struct type *type) |
c906108c | 3306 | { |
c906108c SS |
3307 | if (name[0] == '~') |
3308 | { | |
a737d952 | 3309 | const char *dname = type_name_or_error (type); |
d8228535 | 3310 | const char *cp = strchr (dname, '<'); |
c906108c SS |
3311 | unsigned int len; |
3312 | ||
3313 | /* Do not compare the template part for template classes. */ | |
3314 | if (cp == NULL) | |
3315 | len = strlen (dname); | |
3316 | else | |
3317 | len = cp - dname; | |
bf896cb0 | 3318 | if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0) |
8a3fe4f8 | 3319 | error (_("name of destructor must equal name of class")); |
c906108c SS |
3320 | else |
3321 | return 1; | |
3322 | } | |
3323 | return 0; | |
3324 | } | |
3325 | ||
3d567982 TT |
3326 | /* Find an enum constant named NAME in TYPE. TYPE must be an "enum |
3327 | class". If the name is found, return a value representing it; | |
3328 | otherwise throw an exception. */ | |
3329 | ||
3330 | static struct value * | |
3331 | enum_constant_from_type (struct type *type, const char *name) | |
3332 | { | |
3333 | int i; | |
3334 | int name_len = strlen (name); | |
3335 | ||
78134374 | 3336 | gdb_assert (type->code () == TYPE_CODE_ENUM |
3bc440a2 | 3337 | && type->is_declared_class ()); |
3d567982 | 3338 | |
1f704f76 | 3339 | for (i = TYPE_N_BASECLASSES (type); i < type->num_fields (); ++i) |
3d567982 TT |
3340 | { |
3341 | const char *fname = TYPE_FIELD_NAME (type, i); | |
3342 | int len; | |
3343 | ||
3344 | if (TYPE_FIELD_LOC_KIND (type, i) != FIELD_LOC_KIND_ENUMVAL | |
3345 | || fname == NULL) | |
3346 | continue; | |
3347 | ||
3348 | /* Look for the trailing "::NAME", since enum class constant | |
3349 | names are qualified here. */ | |
3350 | len = strlen (fname); | |
3351 | if (len + 2 >= name_len | |
3352 | && fname[len - name_len - 2] == ':' | |
3353 | && fname[len - name_len - 1] == ':' | |
3354 | && strcmp (&fname[len - name_len], name) == 0) | |
3355 | return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, i)); | |
3356 | } | |
3357 | ||
3358 | error (_("no constant named \"%s\" in enum \"%s\""), | |
7d93a1e0 | 3359 | name, type->name ()); |
3d567982 TT |
3360 | } |
3361 | ||
79c2c32d | 3362 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
0d5de010 DJ |
3363 | return the appropriate member (or the address of the member, if |
3364 | WANT_ADDRESS). This function is used to resolve user expressions | |
3365 | of the form "DOMAIN::NAME". For more details on what happens, see | |
3366 | the comment before value_struct_elt_for_reference. */ | |
79c2c32d DC |
3367 | |
3368 | struct value * | |
c848d642 | 3369 | value_aggregate_elt (struct type *curtype, const char *name, |
072bba3b | 3370 | struct type *expect_type, int want_address, |
79c2c32d DC |
3371 | enum noside noside) |
3372 | { | |
78134374 | 3373 | switch (curtype->code ()) |
79c2c32d DC |
3374 | { |
3375 | case TYPE_CODE_STRUCT: | |
3376 | case TYPE_CODE_UNION: | |
ac3eeb49 | 3377 | return value_struct_elt_for_reference (curtype, 0, curtype, |
072bba3b | 3378 | name, expect_type, |
0d5de010 | 3379 | want_address, noside); |
79c2c32d | 3380 | case TYPE_CODE_NAMESPACE: |
ac3eeb49 MS |
3381 | return value_namespace_elt (curtype, name, |
3382 | want_address, noside); | |
3d567982 TT |
3383 | |
3384 | case TYPE_CODE_ENUM: | |
3385 | return enum_constant_from_type (curtype, name); | |
3386 | ||
79c2c32d DC |
3387 | default: |
3388 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 3389 | _("non-aggregate type in value_aggregate_elt")); |
79c2c32d DC |
3390 | } |
3391 | } | |
3392 | ||
072bba3b | 3393 | /* Compares the two method/function types T1 and T2 for "equality" |
b021a221 | 3394 | with respect to the methods' parameters. If the types of the |
072bba3b KS |
3395 | two parameter lists are the same, returns 1; 0 otherwise. This |
3396 | comparison may ignore any artificial parameters in T1 if | |
3397 | SKIP_ARTIFICIAL is non-zero. This function will ALWAYS skip | |
3398 | the first artificial parameter in T1, assumed to be a 'this' pointer. | |
3399 | ||
3400 | The type T2 is expected to have come from make_params (in eval.c). */ | |
3401 | ||
3402 | static int | |
3403 | compare_parameters (struct type *t1, struct type *t2, int skip_artificial) | |
3404 | { | |
3405 | int start = 0; | |
3406 | ||
1f704f76 | 3407 | if (t1->num_fields () > 0 && TYPE_FIELD_ARTIFICIAL (t1, 0)) |
072bba3b KS |
3408 | ++start; |
3409 | ||
3410 | /* If skipping artificial fields, find the first real field | |
581e13c1 | 3411 | in T1. */ |
072bba3b KS |
3412 | if (skip_artificial) |
3413 | { | |
1f704f76 | 3414 | while (start < t1->num_fields () |
072bba3b KS |
3415 | && TYPE_FIELD_ARTIFICIAL (t1, start)) |
3416 | ++start; | |
3417 | } | |
3418 | ||
581e13c1 | 3419 | /* Now compare parameters. */ |
072bba3b KS |
3420 | |
3421 | /* Special case: a method taking void. T1 will contain no | |
3422 | non-artificial fields, and T2 will contain TYPE_CODE_VOID. */ | |
1f704f76 | 3423 | if ((t1->num_fields () - start) == 0 && t2->num_fields () == 1 |
940da03e | 3424 | && t2->field (0).type ()->code () == TYPE_CODE_VOID) |
072bba3b KS |
3425 | return 1; |
3426 | ||
1f704f76 | 3427 | if ((t1->num_fields () - start) == t2->num_fields ()) |
072bba3b KS |
3428 | { |
3429 | int i; | |
a109c7c1 | 3430 | |
1f704f76 | 3431 | for (i = 0; i < t2->num_fields (); ++i) |
072bba3b | 3432 | { |
940da03e SM |
3433 | if (compare_ranks (rank_one_type (t1->field (start + i).type (), |
3434 | t2->field (i).type (), NULL), | |
dda83cd7 | 3435 | EXACT_MATCH_BADNESS) != 0) |
072bba3b KS |
3436 | return 0; |
3437 | } | |
3438 | ||
3439 | return 1; | |
3440 | } | |
3441 | ||
3442 | return 0; | |
3443 | } | |
3444 | ||
9f6b697b WP |
3445 | /* C++: Given an aggregate type VT, and a class type CLS, search |
3446 | recursively for CLS using value V; If found, store the offset | |
3447 | which is either fetched from the virtual base pointer if CLS | |
3448 | is virtual or accumulated offset of its parent classes if | |
3449 | CLS is non-virtual in *BOFFS, set ISVIRT to indicate if CLS | |
3450 | is virtual, and return true. If not found, return false. */ | |
3451 | ||
3452 | static bool | |
3453 | get_baseclass_offset (struct type *vt, struct type *cls, | |
3454 | struct value *v, int *boffs, bool *isvirt) | |
3455 | { | |
3456 | for (int i = 0; i < TYPE_N_BASECLASSES (vt); i++) | |
3457 | { | |
940da03e | 3458 | struct type *t = vt->field (i).type (); |
9f6b697b | 3459 | if (types_equal (t, cls)) |
dda83cd7 SM |
3460 | { |
3461 | if (BASETYPE_VIA_VIRTUAL (vt, i)) | |
3462 | { | |
9f6b697b WP |
3463 | const gdb_byte *adr = value_contents_for_printing (v); |
3464 | *boffs = baseclass_offset (vt, i, adr, value_offset (v), | |
3465 | value_as_long (v), v); | |
3466 | *isvirt = true; | |
dda83cd7 SM |
3467 | } |
3468 | else | |
9f6b697b | 3469 | *isvirt = false; |
dda83cd7 SM |
3470 | return true; |
3471 | } | |
9f6b697b WP |
3472 | |
3473 | if (get_baseclass_offset (check_typedef (t), cls, v, boffs, isvirt)) | |
dda83cd7 | 3474 | { |
9f6b697b WP |
3475 | if (*isvirt == false) /* Add non-virtual base offset. */ |
3476 | { | |
3477 | const gdb_byte *adr = value_contents_for_printing (v); | |
3478 | *boffs += baseclass_offset (vt, i, adr, value_offset (v), | |
3479 | value_as_long (v), v); | |
3480 | } | |
3481 | return true; | |
3482 | } | |
3483 | } | |
3484 | ||
3485 | return false; | |
3486 | } | |
3487 | ||
c906108c | 3488 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
ac3eeb49 MS |
3489 | return the address of this member as a "pointer to member" type. |
3490 | If INTYPE is non-null, then it will be the type of the member we | |
3491 | are looking for. This will help us resolve "pointers to member | |
3492 | functions". This function is used to resolve user expressions of | |
3493 | the form "DOMAIN::NAME". */ | |
c906108c | 3494 | |
63d06c5c | 3495 | static struct value * |
fba45db2 | 3496 | value_struct_elt_for_reference (struct type *domain, int offset, |
c848d642 | 3497 | struct type *curtype, const char *name, |
ac3eeb49 MS |
3498 | struct type *intype, |
3499 | int want_address, | |
63d06c5c | 3500 | enum noside noside) |
c906108c | 3501 | { |
bf2977b5 | 3502 | struct type *t = check_typedef (curtype); |
52f0bd74 | 3503 | int i; |
b926417a | 3504 | struct value *result; |
c906108c | 3505 | |
78134374 SM |
3506 | if (t->code () != TYPE_CODE_STRUCT |
3507 | && t->code () != TYPE_CODE_UNION) | |
3e43a32a MS |
3508 | error (_("Internal error: non-aggregate type " |
3509 | "to value_struct_elt_for_reference")); | |
c906108c | 3510 | |
1f704f76 | 3511 | for (i = t->num_fields () - 1; i >= TYPE_N_BASECLASSES (t); i--) |
c906108c | 3512 | { |
0d5cff50 | 3513 | const char *t_field_name = TYPE_FIELD_NAME (t, i); |
c5aa993b | 3514 | |
6314a349 | 3515 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c | 3516 | { |
ceacbf6e | 3517 | if (field_is_static (&t->field (i))) |
c906108c | 3518 | { |
b926417a | 3519 | struct value *v = value_static_field (t, i); |
0d5de010 DJ |
3520 | if (want_address) |
3521 | v = value_addr (v); | |
c906108c SS |
3522 | return v; |
3523 | } | |
3524 | if (TYPE_FIELD_PACKED (t, i)) | |
8a3fe4f8 | 3525 | error (_("pointers to bitfield members not allowed")); |
c5aa993b | 3526 | |
0d5de010 DJ |
3527 | if (want_address) |
3528 | return value_from_longest | |
940da03e | 3529 | (lookup_memberptr_type (t->field (i).type (), domain), |
0d5de010 | 3530 | offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3)); |
f7e3ecae | 3531 | else if (noside != EVAL_NORMAL) |
940da03e | 3532 | return allocate_value (t->field (i).type ()); |
0d5de010 | 3533 | else |
f7e3ecae KS |
3534 | { |
3535 | /* Try to evaluate NAME as a qualified name with implicit | |
3536 | this pointer. In this case, attempt to return the | |
3537 | equivalent to `this->*(&TYPE::NAME)'. */ | |
b926417a | 3538 | struct value *v = value_of_this_silent (current_language); |
f7e3ecae KS |
3539 | if (v != NULL) |
3540 | { | |
9f6b697b | 3541 | struct value *ptr, *this_v = v; |
f7e3ecae KS |
3542 | long mem_offset; |
3543 | struct type *type, *tmp; | |
3544 | ||
3545 | ptr = value_aggregate_elt (domain, name, NULL, 1, noside); | |
3546 | type = check_typedef (value_type (ptr)); | |
3547 | gdb_assert (type != NULL | |
78134374 | 3548 | && type->code () == TYPE_CODE_MEMBERPTR); |
4bfb94b8 | 3549 | tmp = lookup_pointer_type (TYPE_SELF_TYPE (type)); |
f7e3ecae KS |
3550 | v = value_cast_pointers (tmp, v, 1); |
3551 | mem_offset = value_as_long (ptr); | |
9f6b697b WP |
3552 | if (domain != curtype) |
3553 | { | |
3554 | /* Find class offset of type CURTYPE from either its | |
3555 | parent type DOMAIN or the type of implied this. */ | |
3556 | int boff = 0; | |
3557 | bool isvirt = false; | |
3558 | if (get_baseclass_offset (domain, curtype, v, &boff, | |
3559 | &isvirt)) | |
dda83cd7 | 3560 | mem_offset += boff; |
9f6b697b | 3561 | else |
dda83cd7 SM |
3562 | { |
3563 | struct type *p = check_typedef (value_type (this_v)); | |
3564 | p = check_typedef (TYPE_TARGET_TYPE (p)); | |
3565 | if (get_baseclass_offset (p, curtype, this_v, | |
9f6b697b | 3566 | &boff, &isvirt)) |
dda83cd7 SM |
3567 | mem_offset += boff; |
3568 | } | |
9f6b697b | 3569 | } |
f7e3ecae KS |
3570 | tmp = lookup_pointer_type (TYPE_TARGET_TYPE (type)); |
3571 | result = value_from_pointer (tmp, | |
3572 | value_as_long (v) + mem_offset); | |
3573 | return value_ind (result); | |
3574 | } | |
3575 | ||
3576 | error (_("Cannot reference non-static field \"%s\""), name); | |
3577 | } | |
c906108c SS |
3578 | } |
3579 | } | |
3580 | ||
ac3eeb49 MS |
3581 | /* C++: If it was not found as a data field, then try to return it |
3582 | as a pointer to a method. */ | |
c906108c | 3583 | |
c906108c | 3584 | /* Perform all necessary dereferencing. */ |
78134374 | 3585 | while (intype && intype->code () == TYPE_CODE_PTR) |
c906108c SS |
3586 | intype = TYPE_TARGET_TYPE (intype); |
3587 | ||
3588 | for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i) | |
3589 | { | |
0d5cff50 | 3590 | const char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i); |
c906108c | 3591 | |
6314a349 | 3592 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c | 3593 | { |
072bba3b KS |
3594 | int j; |
3595 | int len = TYPE_FN_FIELDLIST_LENGTH (t, i); | |
c906108c | 3596 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i); |
c5aa993b | 3597 | |
de17c821 DJ |
3598 | check_stub_method_group (t, i); |
3599 | ||
c906108c SS |
3600 | if (intype) |
3601 | { | |
072bba3b KS |
3602 | for (j = 0; j < len; ++j) |
3603 | { | |
3693fdb3 PA |
3604 | if (TYPE_CONST (intype) != TYPE_FN_FIELD_CONST (f, j)) |
3605 | continue; | |
3606 | if (TYPE_VOLATILE (intype) != TYPE_FN_FIELD_VOLATILE (f, j)) | |
3607 | continue; | |
3608 | ||
072bba3b | 3609 | if (compare_parameters (TYPE_FN_FIELD_TYPE (f, j), intype, 0) |
3e43a32a MS |
3610 | || compare_parameters (TYPE_FN_FIELD_TYPE (f, j), |
3611 | intype, 1)) | |
072bba3b KS |
3612 | break; |
3613 | } | |
3614 | ||
3615 | if (j == len) | |
3e43a32a MS |
3616 | error (_("no member function matches " |
3617 | "that type instantiation")); | |
7f79b1c5 | 3618 | } |
c906108c | 3619 | else |
072bba3b KS |
3620 | { |
3621 | int ii; | |
7f79b1c5 DJ |
3622 | |
3623 | j = -1; | |
53832f31 | 3624 | for (ii = 0; ii < len; ++ii) |
072bba3b | 3625 | { |
7f79b1c5 DJ |
3626 | /* Skip artificial methods. This is necessary if, |
3627 | for example, the user wants to "print | |
3628 | subclass::subclass" with only one user-defined | |
53832f31 TT |
3629 | constructor. There is no ambiguity in this case. |
3630 | We are careful here to allow artificial methods | |
3631 | if they are the unique result. */ | |
072bba3b | 3632 | if (TYPE_FN_FIELD_ARTIFICIAL (f, ii)) |
53832f31 TT |
3633 | { |
3634 | if (j == -1) | |
3635 | j = ii; | |
3636 | continue; | |
3637 | } | |
072bba3b | 3638 | |
7f79b1c5 DJ |
3639 | /* Desired method is ambiguous if more than one |
3640 | method is defined. */ | |
53832f31 | 3641 | if (j != -1 && !TYPE_FN_FIELD_ARTIFICIAL (f, j)) |
3e43a32a MS |
3642 | error (_("non-unique member `%s' requires " |
3643 | "type instantiation"), name); | |
072bba3b | 3644 | |
7f79b1c5 DJ |
3645 | j = ii; |
3646 | } | |
53832f31 TT |
3647 | |
3648 | if (j == -1) | |
3649 | error (_("no matching member function")); | |
072bba3b | 3650 | } |
c5aa993b | 3651 | |
0d5de010 DJ |
3652 | if (TYPE_FN_FIELD_STATIC_P (f, j)) |
3653 | { | |
ac3eeb49 MS |
3654 | struct symbol *s = |
3655 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
d12307c1 | 3656 | 0, VAR_DOMAIN, 0).symbol; |
a109c7c1 | 3657 | |
0d5de010 DJ |
3658 | if (s == NULL) |
3659 | return NULL; | |
3660 | ||
3661 | if (want_address) | |
63e43d3a | 3662 | return value_addr (read_var_value (s, 0, 0)); |
0d5de010 | 3663 | else |
63e43d3a | 3664 | return read_var_value (s, 0, 0); |
0d5de010 DJ |
3665 | } |
3666 | ||
c906108c SS |
3667 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) |
3668 | { | |
0d5de010 DJ |
3669 | if (want_address) |
3670 | { | |
3671 | result = allocate_value | |
3672 | (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); | |
ad4820ab UW |
3673 | cplus_make_method_ptr (value_type (result), |
3674 | value_contents_writeable (result), | |
0d5de010 DJ |
3675 | TYPE_FN_FIELD_VOFFSET (f, j), 1); |
3676 | } | |
3677 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
3678 | return allocate_value (TYPE_FN_FIELD_TYPE (f, j)); | |
3679 | else | |
3680 | error (_("Cannot reference virtual member function \"%s\""), | |
3681 | name); | |
c906108c SS |
3682 | } |
3683 | else | |
3684 | { | |
ac3eeb49 MS |
3685 | struct symbol *s = |
3686 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
d12307c1 | 3687 | 0, VAR_DOMAIN, 0).symbol; |
a109c7c1 | 3688 | |
c906108c | 3689 | if (s == NULL) |
0d5de010 DJ |
3690 | return NULL; |
3691 | ||
b926417a | 3692 | struct value *v = read_var_value (s, 0, 0); |
0d5de010 DJ |
3693 | if (!want_address) |
3694 | result = v; | |
c906108c SS |
3695 | else |
3696 | { | |
0d5de010 | 3697 | result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); |
ad4820ab UW |
3698 | cplus_make_method_ptr (value_type (result), |
3699 | value_contents_writeable (result), | |
42ae5230 | 3700 | value_address (v), 0); |
c906108c | 3701 | } |
c906108c | 3702 | } |
0d5de010 | 3703 | return result; |
c906108c SS |
3704 | } |
3705 | } | |
3706 | for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--) | |
3707 | { | |
f23631e4 | 3708 | struct value *v; |
c906108c SS |
3709 | int base_offset; |
3710 | ||
3711 | if (BASETYPE_VIA_VIRTUAL (t, i)) | |
3712 | base_offset = 0; | |
3713 | else | |
3714 | base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8; | |
3715 | v = value_struct_elt_for_reference (domain, | |
3716 | offset + base_offset, | |
3717 | TYPE_BASECLASS (t, i), | |
ac3eeb49 MS |
3718 | name, intype, |
3719 | want_address, noside); | |
c906108c SS |
3720 | if (v) |
3721 | return v; | |
3722 | } | |
63d06c5c DC |
3723 | |
3724 | /* As a last chance, pretend that CURTYPE is a namespace, and look | |
3725 | it up that way; this (frequently) works for types nested inside | |
3726 | classes. */ | |
3727 | ||
ac3eeb49 MS |
3728 | return value_maybe_namespace_elt (curtype, name, |
3729 | want_address, noside); | |
c906108c SS |
3730 | } |
3731 | ||
79c2c32d DC |
3732 | /* C++: Return the member NAME of the namespace given by the type |
3733 | CURTYPE. */ | |
3734 | ||
3735 | static struct value * | |
3736 | value_namespace_elt (const struct type *curtype, | |
c848d642 | 3737 | const char *name, int want_address, |
79c2c32d | 3738 | enum noside noside) |
63d06c5c DC |
3739 | { |
3740 | struct value *retval = value_maybe_namespace_elt (curtype, name, | |
ac3eeb49 MS |
3741 | want_address, |
3742 | noside); | |
63d06c5c DC |
3743 | |
3744 | if (retval == NULL) | |
ac3eeb49 | 3745 | error (_("No symbol \"%s\" in namespace \"%s\"."), |
7d93a1e0 | 3746 | name, curtype->name ()); |
63d06c5c DC |
3747 | |
3748 | return retval; | |
3749 | } | |
3750 | ||
3751 | /* A helper function used by value_namespace_elt and | |
3752 | value_struct_elt_for_reference. It looks up NAME inside the | |
3753 | context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE | |
3754 | is a class and NAME refers to a type in CURTYPE itself (as opposed | |
3755 | to, say, some base class of CURTYPE). */ | |
3756 | ||
3757 | static struct value * | |
3758 | value_maybe_namespace_elt (const struct type *curtype, | |
c848d642 | 3759 | const char *name, int want_address, |
63d06c5c | 3760 | enum noside noside) |
79c2c32d | 3761 | { |
7d93a1e0 | 3762 | const char *namespace_name = curtype->name (); |
d12307c1 | 3763 | struct block_symbol sym; |
0d5de010 | 3764 | struct value *result; |
79c2c32d | 3765 | |
13387711 | 3766 | sym = cp_lookup_symbol_namespace (namespace_name, name, |
41f62f39 JK |
3767 | get_selected_block (0), VAR_DOMAIN); |
3768 | ||
d12307c1 | 3769 | if (sym.symbol == NULL) |
63d06c5c | 3770 | return NULL; |
79c2c32d | 3771 | else if ((noside == EVAL_AVOID_SIDE_EFFECTS) |
d12307c1 PMR |
3772 | && (SYMBOL_CLASS (sym.symbol) == LOC_TYPEDEF)) |
3773 | result = allocate_value (SYMBOL_TYPE (sym.symbol)); | |
79c2c32d | 3774 | else |
d12307c1 | 3775 | result = value_of_variable (sym.symbol, sym.block); |
0d5de010 | 3776 | |
ae6a105d | 3777 | if (want_address) |
0d5de010 DJ |
3778 | result = value_addr (result); |
3779 | ||
3780 | return result; | |
79c2c32d DC |
3781 | } |
3782 | ||
dfcee124 | 3783 | /* Given a pointer or a reference value V, find its real (RTTI) type. |
ac3eeb49 | 3784 | |
c906108c | 3785 | Other parameters FULL, TOP, USING_ENC as with value_rtti_type() |
ac3eeb49 | 3786 | and refer to the values computed for the object pointed to. */ |
c906108c SS |
3787 | |
3788 | struct type * | |
dfcee124 | 3789 | value_rtti_indirect_type (struct value *v, int *full, |
6b850546 | 3790 | LONGEST *top, int *using_enc) |
c906108c | 3791 | { |
f7e5394d | 3792 | struct value *target = NULL; |
dfcee124 AG |
3793 | struct type *type, *real_type, *target_type; |
3794 | ||
3795 | type = value_type (v); | |
3796 | type = check_typedef (type); | |
aa006118 | 3797 | if (TYPE_IS_REFERENCE (type)) |
dfcee124 | 3798 | target = coerce_ref (v); |
78134374 | 3799 | else if (type->code () == TYPE_CODE_PTR) |
f7e5394d | 3800 | { |
f7e5394d | 3801 | |
a70b8144 | 3802 | try |
dda83cd7 | 3803 | { |
f7e5394d | 3804 | target = value_ind (v); |
dda83cd7 | 3805 | } |
230d2906 | 3806 | catch (const gdb_exception_error &except) |
f7e5394d SM |
3807 | { |
3808 | if (except.error == MEMORY_ERROR) | |
3809 | { | |
3810 | /* value_ind threw a memory error. The pointer is NULL or | |
dda83cd7 SM |
3811 | contains an uninitialized value: we can't determine any |
3812 | type. */ | |
f7e5394d SM |
3813 | return NULL; |
3814 | } | |
eedc3f4f | 3815 | throw; |
f7e5394d SM |
3816 | } |
3817 | } | |
dfcee124 AG |
3818 | else |
3819 | return NULL; | |
c906108c | 3820 | |
dfcee124 AG |
3821 | real_type = value_rtti_type (target, full, top, using_enc); |
3822 | ||
3823 | if (real_type) | |
3824 | { | |
3825 | /* Copy qualifiers to the referenced object. */ | |
3826 | target_type = value_type (target); | |
3827 | real_type = make_cv_type (TYPE_CONST (target_type), | |
3828 | TYPE_VOLATILE (target_type), real_type, NULL); | |
aa006118 | 3829 | if (TYPE_IS_REFERENCE (type)) |
dda83cd7 | 3830 | real_type = lookup_reference_type (real_type, type->code ()); |
78134374 | 3831 | else if (type->code () == TYPE_CODE_PTR) |
dda83cd7 | 3832 | real_type = lookup_pointer_type (real_type); |
dfcee124 | 3833 | else |
dda83cd7 | 3834 | internal_error (__FILE__, __LINE__, _("Unexpected value type.")); |
dfcee124 AG |
3835 | |
3836 | /* Copy qualifiers to the pointer/reference. */ | |
3837 | real_type = make_cv_type (TYPE_CONST (type), TYPE_VOLATILE (type), | |
3838 | real_type, NULL); | |
3839 | } | |
c906108c | 3840 | |
dfcee124 | 3841 | return real_type; |
c906108c SS |
3842 | } |
3843 | ||
3844 | /* Given a value pointed to by ARGP, check its real run-time type, and | |
3845 | if that is different from the enclosing type, create a new value | |
3846 | using the real run-time type as the enclosing type (and of the same | |
3847 | type as ARGP) and return it, with the embedded offset adjusted to | |
ac3eeb49 MS |
3848 | be the correct offset to the enclosed object. RTYPE is the type, |
3849 | and XFULL, XTOP, and XUSING_ENC are the other parameters, computed | |
3850 | by value_rtti_type(). If these are available, they can be supplied | |
3851 | and a second call to value_rtti_type() is avoided. (Pass RTYPE == | |
3852 | NULL if they're not available. */ | |
c906108c | 3853 | |
f23631e4 | 3854 | struct value * |
ac3eeb49 MS |
3855 | value_full_object (struct value *argp, |
3856 | struct type *rtype, | |
3857 | int xfull, int xtop, | |
fba45db2 | 3858 | int xusing_enc) |
c906108c | 3859 | { |
c5aa993b | 3860 | struct type *real_type; |
c906108c | 3861 | int full = 0; |
6b850546 | 3862 | LONGEST top = -1; |
c906108c | 3863 | int using_enc = 0; |
f23631e4 | 3864 | struct value *new_val; |
c906108c SS |
3865 | |
3866 | if (rtype) | |
3867 | { | |
3868 | real_type = rtype; | |
3869 | full = xfull; | |
3870 | top = xtop; | |
3871 | using_enc = xusing_enc; | |
3872 | } | |
3873 | else | |
3874 | real_type = value_rtti_type (argp, &full, &top, &using_enc); | |
3875 | ||
ac3eeb49 | 3876 | /* If no RTTI data, or if object is already complete, do nothing. */ |
4754a64e | 3877 | if (!real_type || real_type == value_enclosing_type (argp)) |
c906108c SS |
3878 | return argp; |
3879 | ||
a7860e76 TT |
3880 | /* In a destructor we might see a real type that is a superclass of |
3881 | the object's type. In this case it is better to leave the object | |
3882 | as-is. */ | |
3883 | if (full | |
3884 | && TYPE_LENGTH (real_type) < TYPE_LENGTH (value_enclosing_type (argp))) | |
3885 | return argp; | |
3886 | ||
c906108c | 3887 | /* If we have the full object, but for some reason the enclosing |
ac3eeb49 MS |
3888 | type is wrong, set it. */ |
3889 | /* pai: FIXME -- sounds iffy */ | |
c906108c SS |
3890 | if (full) |
3891 | { | |
4dfea560 DE |
3892 | argp = value_copy (argp); |
3893 | set_value_enclosing_type (argp, real_type); | |
c906108c SS |
3894 | return argp; |
3895 | } | |
3896 | ||
581e13c1 | 3897 | /* Check if object is in memory. */ |
c906108c SS |
3898 | if (VALUE_LVAL (argp) != lval_memory) |
3899 | { | |
3e43a32a MS |
3900 | warning (_("Couldn't retrieve complete object of RTTI " |
3901 | "type %s; object may be in register(s)."), | |
7d93a1e0 | 3902 | real_type->name ()); |
c5aa993b | 3903 | |
c906108c SS |
3904 | return argp; |
3905 | } | |
c5aa993b | 3906 | |
ac3eeb49 MS |
3907 | /* All other cases -- retrieve the complete object. */ |
3908 | /* Go back by the computed top_offset from the beginning of the | |
3909 | object, adjusting for the embedded offset of argp if that's what | |
3910 | value_rtti_type used for its computation. */ | |
42ae5230 | 3911 | new_val = value_at_lazy (real_type, value_address (argp) - top + |
13c3b5f5 | 3912 | (using_enc ? 0 : value_embedded_offset (argp))); |
04624583 | 3913 | deprecated_set_value_type (new_val, value_type (argp)); |
13c3b5f5 AC |
3914 | set_value_embedded_offset (new_val, (using_enc |
3915 | ? top + value_embedded_offset (argp) | |
3916 | : top)); | |
c906108c SS |
3917 | return new_val; |
3918 | } | |
3919 | ||
389e51db | 3920 | |
85bc8cb7 JK |
3921 | /* Return the value of the local variable, if one exists. Throw error |
3922 | otherwise, such as if the request is made in an inappropriate context. */ | |
c906108c | 3923 | |
f23631e4 | 3924 | struct value * |
85bc8cb7 | 3925 | value_of_this (const struct language_defn *lang) |
c906108c | 3926 | { |
63e43d3a | 3927 | struct block_symbol sym; |
3977b71f | 3928 | const struct block *b; |
206415a3 | 3929 | struct frame_info *frame; |
c906108c | 3930 | |
5bae7c4e | 3931 | if (lang->name_of_this () == NULL) |
85bc8cb7 | 3932 | error (_("no `this' in current language")); |
aee28ec6 | 3933 | |
85bc8cb7 | 3934 | frame = get_selected_frame (_("no frame selected")); |
c906108c | 3935 | |
66a17cb6 | 3936 | b = get_frame_block (frame, NULL); |
c906108c | 3937 | |
63e43d3a PMR |
3938 | sym = lookup_language_this (lang, b); |
3939 | if (sym.symbol == NULL) | |
85bc8cb7 | 3940 | error (_("current stack frame does not contain a variable named `%s'"), |
5bae7c4e | 3941 | lang->name_of_this ()); |
85bc8cb7 | 3942 | |
63e43d3a | 3943 | return read_var_value (sym.symbol, sym.block, frame); |
85bc8cb7 JK |
3944 | } |
3945 | ||
3946 | /* Return the value of the local variable, if one exists. Return NULL | |
3947 | otherwise. Never throw error. */ | |
3948 | ||
3949 | struct value * | |
3950 | value_of_this_silent (const struct language_defn *lang) | |
3951 | { | |
3952 | struct value *ret = NULL; | |
85bc8cb7 | 3953 | |
a70b8144 | 3954 | try |
c906108c | 3955 | { |
85bc8cb7 | 3956 | ret = value_of_this (lang); |
c906108c | 3957 | } |
230d2906 | 3958 | catch (const gdb_exception_error &except) |
492d29ea PA |
3959 | { |
3960 | } | |
c906108c | 3961 | |
d069f99d AF |
3962 | return ret; |
3963 | } | |
3964 | ||
ac3eeb49 MS |
3965 | /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH |
3966 | elements long, starting at LOWBOUND. The result has the same lower | |
3967 | bound as the original ARRAY. */ | |
c906108c | 3968 | |
f23631e4 AC |
3969 | struct value * |
3970 | value_slice (struct value *array, int lowbound, int length) | |
c906108c SS |
3971 | { |
3972 | struct type *slice_range_type, *slice_type, *range_type; | |
7a67d0fe | 3973 | LONGEST lowerbound, upperbound; |
f23631e4 | 3974 | struct value *slice; |
c906108c | 3975 | struct type *array_type; |
ac3eeb49 | 3976 | |
df407dfe | 3977 | array_type = check_typedef (value_type (array)); |
78134374 SM |
3978 | if (array_type->code () != TYPE_CODE_ARRAY |
3979 | && array_type->code () != TYPE_CODE_STRING) | |
8a3fe4f8 | 3980 | error (_("cannot take slice of non-array")); |
ac3eeb49 | 3981 | |
a7067863 AB |
3982 | if (type_not_allocated (array_type)) |
3983 | error (_("array not allocated")); | |
3984 | if (type_not_associated (array_type)) | |
3985 | error (_("array not associated")); | |
3986 | ||
3d967001 | 3987 | range_type = array_type->index_type (); |
1f8d2881 | 3988 | if (!get_discrete_bounds (range_type, &lowerbound, &upperbound)) |
8a3fe4f8 | 3989 | error (_("slice from bad array or bitstring")); |
ac3eeb49 | 3990 | |
c906108c | 3991 | if (lowbound < lowerbound || length < 0 |
db034ac5 | 3992 | || lowbound + length - 1 > upperbound) |
8a3fe4f8 | 3993 | error (_("slice out of range")); |
ac3eeb49 | 3994 | |
c906108c SS |
3995 | /* FIXME-type-allocation: need a way to free this type when we are |
3996 | done with it. */ | |
cafb3438 | 3997 | slice_range_type = create_static_range_type (NULL, |
0c9c3474 SA |
3998 | TYPE_TARGET_TYPE (range_type), |
3999 | lowbound, | |
4000 | lowbound + length - 1); | |
ac3eeb49 | 4001 | |
a7c88acd JB |
4002 | { |
4003 | struct type *element_type = TYPE_TARGET_TYPE (array_type); | |
4004 | LONGEST offset | |
4005 | = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type)); | |
ac3eeb49 | 4006 | |
cafb3438 | 4007 | slice_type = create_array_type (NULL, |
a7c88acd JB |
4008 | element_type, |
4009 | slice_range_type); | |
78134374 | 4010 | slice_type->set_code (array_type->code ()); |
ac3eeb49 | 4011 | |
a7c88acd JB |
4012 | if (VALUE_LVAL (array) == lval_memory && value_lazy (array)) |
4013 | slice = allocate_value_lazy (slice_type); | |
4014 | else | |
4015 | { | |
4016 | slice = allocate_value (slice_type); | |
4017 | value_contents_copy (slice, 0, array, offset, | |
3ae385af | 4018 | type_length_units (slice_type)); |
a7c88acd JB |
4019 | } |
4020 | ||
4021 | set_value_component_location (slice, array); | |
a7c88acd JB |
4022 | set_value_offset (slice, value_offset (array) + offset); |
4023 | } | |
ac3eeb49 | 4024 | |
c906108c SS |
4025 | return slice; |
4026 | } | |
4027 | ||
6b4a335b | 4028 | /* See value.h. */ |
c906108c | 4029 | |
f23631e4 | 4030 | struct value * |
6b4a335b | 4031 | value_literal_complex (struct value *arg1, |
ac3eeb49 MS |
4032 | struct value *arg2, |
4033 | struct type *type) | |
c906108c | 4034 | { |
f23631e4 | 4035 | struct value *val; |
c906108c SS |
4036 | struct type *real_type = TYPE_TARGET_TYPE (type); |
4037 | ||
4038 | val = allocate_value (type); | |
4039 | arg1 = value_cast (real_type, arg1); | |
4040 | arg2 = value_cast (real_type, arg2); | |
4041 | ||
990a07ab | 4042 | memcpy (value_contents_raw (val), |
0fd88904 | 4043 | value_contents (arg1), TYPE_LENGTH (real_type)); |
990a07ab | 4044 | memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type), |
0fd88904 | 4045 | value_contents (arg2), TYPE_LENGTH (real_type)); |
c906108c SS |
4046 | return val; |
4047 | } | |
4048 | ||
4c99290d TT |
4049 | /* See value.h. */ |
4050 | ||
4051 | struct value * | |
4052 | value_real_part (struct value *value) | |
4053 | { | |
4054 | struct type *type = check_typedef (value_type (value)); | |
4055 | struct type *ttype = TYPE_TARGET_TYPE (type); | |
4056 | ||
78134374 | 4057 | gdb_assert (type->code () == TYPE_CODE_COMPLEX); |
4c99290d TT |
4058 | return value_from_component (value, ttype, 0); |
4059 | } | |
4060 | ||
4061 | /* See value.h. */ | |
4062 | ||
4063 | struct value * | |
4064 | value_imaginary_part (struct value *value) | |
4065 | { | |
4066 | struct type *type = check_typedef (value_type (value)); | |
4067 | struct type *ttype = TYPE_TARGET_TYPE (type); | |
4068 | ||
78134374 | 4069 | gdb_assert (type->code () == TYPE_CODE_COMPLEX); |
4c99290d TT |
4070 | return value_from_component (value, ttype, |
4071 | TYPE_LENGTH (check_typedef (ttype))); | |
4072 | } | |
4073 | ||
ac3eeb49 | 4074 | /* Cast a value into the appropriate complex data type. */ |
c906108c | 4075 | |
f23631e4 AC |
4076 | static struct value * |
4077 | cast_into_complex (struct type *type, struct value *val) | |
c906108c SS |
4078 | { |
4079 | struct type *real_type = TYPE_TARGET_TYPE (type); | |
ac3eeb49 | 4080 | |
78134374 | 4081 | if (value_type (val)->code () == TYPE_CODE_COMPLEX) |
c906108c | 4082 | { |
df407dfe | 4083 | struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val)); |
f23631e4 AC |
4084 | struct value *re_val = allocate_value (val_real_type); |
4085 | struct value *im_val = allocate_value (val_real_type); | |
c906108c | 4086 | |
990a07ab | 4087 | memcpy (value_contents_raw (re_val), |
0fd88904 | 4088 | value_contents (val), TYPE_LENGTH (val_real_type)); |
990a07ab | 4089 | memcpy (value_contents_raw (im_val), |
0fd88904 | 4090 | value_contents (val) + TYPE_LENGTH (val_real_type), |
c5aa993b | 4091 | TYPE_LENGTH (val_real_type)); |
c906108c SS |
4092 | |
4093 | return value_literal_complex (re_val, im_val, type); | |
4094 | } | |
78134374 SM |
4095 | else if (value_type (val)->code () == TYPE_CODE_FLT |
4096 | || value_type (val)->code () == TYPE_CODE_INT) | |
ac3eeb49 MS |
4097 | return value_literal_complex (val, |
4098 | value_zero (real_type, not_lval), | |
4099 | type); | |
c906108c | 4100 | else |
8a3fe4f8 | 4101 | error (_("cannot cast non-number to complex")); |
c906108c SS |
4102 | } |
4103 | ||
6c265988 | 4104 | void _initialize_valops (); |
c906108c | 4105 | void |
6c265988 | 4106 | _initialize_valops () |
c906108c | 4107 | { |
5bf193a2 AC |
4108 | add_setshow_boolean_cmd ("overload-resolution", class_support, |
4109 | &overload_resolution, _("\ | |
4110 | Set overload resolution in evaluating C++ functions."), _("\ | |
ac3eeb49 MS |
4111 | Show overload resolution in evaluating C++ functions."), |
4112 | NULL, NULL, | |
920d2a44 | 4113 | show_overload_resolution, |
5bf193a2 | 4114 | &setlist, &showlist); |
c906108c | 4115 | overload_resolution = 1; |
c906108c | 4116 | } |