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