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