Commit | Line | Data |
---|---|---|
c906108c | 1 | /* Perform non-arithmetic operations on values, for GDB. |
990a07ab | 2 | |
9b254dd1 DJ |
3 | Copyright (C) 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, |
4 | 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, | |
5 | 2008 Free Software Foundation, Inc. | |
c906108c | 6 | |
c5aa993b | 7 | This file is part of GDB. |
c906108c | 8 | |
c5aa993b JM |
9 | This program is free software; you can redistribute it and/or modify |
10 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 11 | the Free Software Foundation; either version 3 of the License, or |
c5aa993b | 12 | (at your option) any later version. |
c906108c | 13 | |
c5aa993b JM |
14 | This program is distributed in the hope that it will be useful, |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
c906108c | 18 | |
c5aa993b | 19 | You should have received a copy of the GNU General Public License |
a9762ec7 | 20 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
c906108c SS |
21 | |
22 | #include "defs.h" | |
23 | #include "symtab.h" | |
24 | #include "gdbtypes.h" | |
25 | #include "value.h" | |
26 | #include "frame.h" | |
27 | #include "inferior.h" | |
28 | #include "gdbcore.h" | |
29 | #include "target.h" | |
30 | #include "demangle.h" | |
31 | #include "language.h" | |
32 | #include "gdbcmd.h" | |
4e052eda | 33 | #include "regcache.h" |
015a42b4 | 34 | #include "cp-abi.h" |
fe898f56 | 35 | #include "block.h" |
04714b91 | 36 | #include "infcall.h" |
de4f826b | 37 | #include "dictionary.h" |
b6429628 | 38 | #include "cp-support.h" |
4ef30785 | 39 | #include "dfp.h" |
c906108c SS |
40 | |
41 | #include <errno.h> | |
42 | #include "gdb_string.h" | |
4a1970e4 | 43 | #include "gdb_assert.h" |
79c2c32d | 44 | #include "cp-support.h" |
f4c5303c | 45 | #include "observer.h" |
c906108c | 46 | |
070ad9f0 | 47 | extern int overload_debug; |
c906108c SS |
48 | /* Local functions. */ |
49 | ||
ad2f7632 DJ |
50 | static int typecmp (int staticp, int varargs, int nargs, |
51 | struct field t1[], struct value *t2[]); | |
c906108c | 52 | |
ac3eeb49 MS |
53 | static struct value *search_struct_field (char *, struct value *, |
54 | int, struct type *, int); | |
c906108c | 55 | |
f23631e4 AC |
56 | static struct value *search_struct_method (char *, struct value **, |
57 | struct value **, | |
a14ed312 | 58 | int, int *, struct type *); |
c906108c | 59 | |
ac3eeb49 MS |
60 | static int find_oload_champ_namespace (struct type **, int, |
61 | const char *, const char *, | |
62 | struct symbol ***, | |
63 | struct badness_vector **); | |
8d577d32 DC |
64 | |
65 | static | |
ac3eeb49 MS |
66 | int find_oload_champ_namespace_loop (struct type **, int, |
67 | const char *, const char *, | |
68 | int, struct symbol ***, | |
69 | struct badness_vector **, int *); | |
70 | ||
71 | static int find_oload_champ (struct type **, int, int, int, | |
72 | struct fn_field *, struct symbol **, | |
73 | struct badness_vector **); | |
74 | ||
75 | static int oload_method_static (int, struct fn_field *, int); | |
8d577d32 DC |
76 | |
77 | enum oload_classification { STANDARD, NON_STANDARD, INCOMPATIBLE }; | |
78 | ||
79 | static enum | |
ac3eeb49 MS |
80 | oload_classification classify_oload_match (struct badness_vector *, |
81 | int, int); | |
8d577d32 | 82 | |
ac3eeb49 MS |
83 | static struct value *value_struct_elt_for_reference (struct type *, |
84 | int, struct type *, | |
85 | char *, | |
86 | struct type *, | |
87 | int, enum noside); | |
79c2c32d | 88 | |
ac3eeb49 MS |
89 | static struct value *value_namespace_elt (const struct type *, |
90 | char *, int , enum noside); | |
79c2c32d | 91 | |
ac3eeb49 MS |
92 | static struct value *value_maybe_namespace_elt (const struct type *, |
93 | char *, int, | |
94 | enum noside); | |
63d06c5c | 95 | |
a14ed312 | 96 | static CORE_ADDR allocate_space_in_inferior (int); |
c906108c | 97 | |
f23631e4 | 98 | static struct value *cast_into_complex (struct type *, struct value *); |
c906108c | 99 | |
ac3eeb49 MS |
100 | static struct fn_field *find_method_list (struct value **, char *, |
101 | int, struct type *, int *, | |
102 | struct type **, int *); | |
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 AC |
118 | { |
119 | fprintf_filtered (file, _("\ | |
120 | Overload resolution in evaluating C++ functions is %s.\n"), | |
121 | value); | |
122 | } | |
242bfc55 | 123 | |
c906108c SS |
124 | /* Find the address of function name NAME in the inferior. */ |
125 | ||
f23631e4 | 126 | struct value * |
3bada2a2 | 127 | find_function_in_inferior (const char *name) |
c906108c | 128 | { |
52f0bd74 | 129 | struct symbol *sym; |
176620f1 | 130 | sym = lookup_symbol (name, 0, VAR_DOMAIN, 0, NULL); |
c906108c SS |
131 | if (sym != NULL) |
132 | { | |
133 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
134 | { | |
8a3fe4f8 | 135 | error (_("\"%s\" exists in this program but is not a function."), |
c906108c SS |
136 | name); |
137 | } | |
138 | return value_of_variable (sym, NULL); | |
139 | } | |
140 | else | |
141 | { | |
ac3eeb49 MS |
142 | struct minimal_symbol *msymbol = |
143 | lookup_minimal_symbol (name, NULL, NULL); | |
c906108c SS |
144 | if (msymbol != NULL) |
145 | { | |
146 | struct type *type; | |
4478b372 | 147 | CORE_ADDR maddr; |
c906108c SS |
148 | type = lookup_pointer_type (builtin_type_char); |
149 | type = lookup_function_type (type); | |
150 | type = lookup_pointer_type (type); | |
4478b372 JB |
151 | maddr = SYMBOL_VALUE_ADDRESS (msymbol); |
152 | return value_from_pointer (type, maddr); | |
c906108c SS |
153 | } |
154 | else | |
155 | { | |
c5aa993b | 156 | if (!target_has_execution) |
8a3fe4f8 | 157 | error (_("evaluation of this expression requires the target program to be active")); |
c5aa993b | 158 | else |
8a3fe4f8 | 159 | error (_("evaluation of this expression requires the program to have a function \"%s\"."), name); |
c906108c SS |
160 | } |
161 | } | |
162 | } | |
163 | ||
ac3eeb49 MS |
164 | /* Allocate NBYTES of space in the inferior using the inferior's |
165 | malloc and return a value that is a pointer to the allocated | |
166 | space. */ | |
c906108c | 167 | |
f23631e4 | 168 | struct value * |
fba45db2 | 169 | value_allocate_space_in_inferior (int len) |
c906108c | 170 | { |
f23631e4 | 171 | struct value *blocklen; |
ac3eeb49 MS |
172 | struct value *val = |
173 | find_function_in_inferior (gdbarch_name_of_malloc (current_gdbarch)); | |
c906108c SS |
174 | |
175 | blocklen = value_from_longest (builtin_type_int, (LONGEST) len); | |
176 | val = call_function_by_hand (val, 1, &blocklen); | |
177 | if (value_logical_not (val)) | |
178 | { | |
179 | if (!target_has_execution) | |
8a3fe4f8 | 180 | error (_("No memory available to program now: you need to start the target first")); |
c5aa993b | 181 | else |
8a3fe4f8 | 182 | error (_("No memory available to program: call to malloc failed")); |
c906108c SS |
183 | } |
184 | return val; | |
185 | } | |
186 | ||
187 | static CORE_ADDR | |
fba45db2 | 188 | allocate_space_in_inferior (int len) |
c906108c SS |
189 | { |
190 | return value_as_long (value_allocate_space_in_inferior (len)); | |
191 | } | |
192 | ||
6af87b03 AR |
193 | /* Cast struct value VAL to type TYPE and return as a value. |
194 | Both type and val must be of TYPE_CODE_STRUCT or TYPE_CODE_UNION | |
195 | for this to work. Typedef to one of the codes is permitted. */ | |
196 | ||
197 | static struct value * | |
198 | value_cast_structs (struct type *type, struct value *v2) | |
199 | { | |
200 | struct type *t1; | |
201 | struct type *t2; | |
202 | struct value *v; | |
203 | ||
204 | gdb_assert (type != NULL && v2 != NULL); | |
205 | ||
206 | t1 = check_typedef (type); | |
207 | t2 = check_typedef (value_type (v2)); | |
208 | ||
209 | /* Check preconditions. */ | |
210 | gdb_assert ((TYPE_CODE (t1) == TYPE_CODE_STRUCT | |
211 | || TYPE_CODE (t1) == TYPE_CODE_UNION) | |
212 | && !!"Precondition is that type is of STRUCT or UNION kind."); | |
213 | gdb_assert ((TYPE_CODE (t2) == TYPE_CODE_STRUCT | |
214 | || TYPE_CODE (t2) == TYPE_CODE_UNION) | |
215 | && !!"Precondition is that value is of STRUCT or UNION kind"); | |
216 | ||
217 | /* Upcasting: look in the type of the source to see if it contains the | |
218 | type of the target as a superclass. If so, we'll need to | |
219 | offset the pointer rather than just change its type. */ | |
220 | if (TYPE_NAME (t1) != NULL) | |
221 | { | |
222 | v = search_struct_field (type_name_no_tag (t1), | |
223 | v2, 0, t2, 1); | |
224 | if (v) | |
225 | return v; | |
226 | } | |
227 | ||
228 | /* Downcasting: look in the type of the target to see if it contains the | |
229 | type of the source as a superclass. If so, we'll need to | |
230 | offset the pointer rather than just change its type. | |
231 | FIXME: This fails silently with virtual inheritance. */ | |
232 | if (TYPE_NAME (t2) != NULL) | |
233 | { | |
234 | v = search_struct_field (type_name_no_tag (t2), | |
235 | value_zero (t1, not_lval), 0, t1, 1); | |
236 | if (v) | |
237 | { | |
238 | /* Downcasting is possible (t1 is superclass of v2). */ | |
239 | CORE_ADDR addr2 = VALUE_ADDRESS (v2); | |
240 | addr2 -= (VALUE_ADDRESS (v) | |
241 | + value_offset (v) | |
242 | + value_embedded_offset (v)); | |
243 | return value_at (type, addr2); | |
244 | } | |
245 | } | |
246 | return v2; | |
247 | } | |
248 | ||
fb933624 DJ |
249 | /* Cast one pointer or reference type to another. Both TYPE and |
250 | the type of ARG2 should be pointer types, or else both should be | |
251 | reference types. Returns the new pointer or reference. */ | |
252 | ||
253 | struct value * | |
254 | value_cast_pointers (struct type *type, struct value *arg2) | |
255 | { | |
6af87b03 | 256 | struct type *type1 = check_typedef (type); |
fb933624 DJ |
257 | struct type *type2 = check_typedef (value_type (arg2)); |
258 | struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type)); | |
259 | struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2)); | |
260 | ||
261 | if (TYPE_CODE (t1) == TYPE_CODE_STRUCT | |
262 | && TYPE_CODE (t2) == TYPE_CODE_STRUCT | |
263 | && !value_logical_not (arg2)) | |
264 | { | |
6af87b03 | 265 | struct value *v2; |
fb933624 | 266 | |
6af87b03 AR |
267 | if (TYPE_CODE (type2) == TYPE_CODE_REF) |
268 | v2 = coerce_ref (arg2); | |
269 | else | |
270 | v2 = value_ind (arg2); | |
271 | gdb_assert (TYPE_CODE (value_type (v2)) == TYPE_CODE_STRUCT | |
272 | && !!"Why did coercion fail?"); | |
273 | v2 = value_cast_structs (t1, v2); | |
274 | /* At this point we have what we can have, un-dereference if needed. */ | |
275 | if (v2) | |
fb933624 | 276 | { |
6af87b03 AR |
277 | struct value *v = value_addr (v2); |
278 | deprecated_set_value_type (v, type); | |
279 | return v; | |
fb933624 | 280 | } |
6af87b03 | 281 | } |
fb933624 DJ |
282 | |
283 | /* No superclass found, just change the pointer type. */ | |
0d5de010 | 284 | arg2 = value_copy (arg2); |
fb933624 DJ |
285 | deprecated_set_value_type (arg2, type); |
286 | arg2 = value_change_enclosing_type (arg2, type); | |
287 | set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */ | |
288 | return arg2; | |
289 | } | |
290 | ||
c906108c SS |
291 | /* Cast value ARG2 to type TYPE and return as a value. |
292 | More general than a C cast: accepts any two types of the same length, | |
293 | and if ARG2 is an lvalue it can be cast into anything at all. */ | |
294 | /* In C++, casts may change pointer or object representations. */ | |
295 | ||
f23631e4 AC |
296 | struct value * |
297 | value_cast (struct type *type, struct value *arg2) | |
c906108c | 298 | { |
52f0bd74 AC |
299 | enum type_code code1; |
300 | enum type_code code2; | |
301 | int scalar; | |
c906108c SS |
302 | struct type *type2; |
303 | ||
304 | int convert_to_boolean = 0; | |
c5aa993b | 305 | |
df407dfe | 306 | if (value_type (arg2) == type) |
c906108c SS |
307 | return arg2; |
308 | ||
6af87b03 AR |
309 | code1 = TYPE_CODE (check_typedef (type)); |
310 | ||
311 | /* Check if we are casting struct reference to struct reference. */ | |
312 | if (code1 == TYPE_CODE_REF) | |
313 | { | |
314 | /* We dereference type; then we recurse and finally | |
315 | we generate value of the given reference. Nothing wrong with | |
316 | that. */ | |
317 | struct type *t1 = check_typedef (type); | |
318 | struct type *dereftype = check_typedef (TYPE_TARGET_TYPE (t1)); | |
319 | struct value *val = value_cast (dereftype, arg2); | |
320 | return value_ref (val); | |
321 | } | |
322 | ||
323 | code2 = TYPE_CODE (check_typedef (value_type (arg2))); | |
324 | ||
325 | if (code2 == TYPE_CODE_REF) | |
326 | /* We deref the value and then do the cast. */ | |
327 | return value_cast (type, coerce_ref (arg2)); | |
328 | ||
c906108c SS |
329 | CHECK_TYPEDEF (type); |
330 | code1 = TYPE_CODE (type); | |
994b9211 | 331 | arg2 = coerce_ref (arg2); |
df407dfe | 332 | type2 = check_typedef (value_type (arg2)); |
c906108c | 333 | |
fb933624 DJ |
334 | /* You can't cast to a reference type. See value_cast_pointers |
335 | instead. */ | |
336 | gdb_assert (code1 != TYPE_CODE_REF); | |
337 | ||
ac3eeb49 MS |
338 | /* A cast to an undetermined-length array_type, such as |
339 | (TYPE [])OBJECT, is treated like a cast to (TYPE [N])OBJECT, | |
340 | where N is sizeof(OBJECT)/sizeof(TYPE). */ | |
c906108c SS |
341 | if (code1 == TYPE_CODE_ARRAY) |
342 | { | |
343 | struct type *element_type = TYPE_TARGET_TYPE (type); | |
344 | unsigned element_length = TYPE_LENGTH (check_typedef (element_type)); | |
345 | if (element_length > 0 | |
c5aa993b | 346 | && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED) |
c906108c SS |
347 | { |
348 | struct type *range_type = TYPE_INDEX_TYPE (type); | |
349 | int val_length = TYPE_LENGTH (type2); | |
350 | LONGEST low_bound, high_bound, new_length; | |
351 | if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0) | |
352 | low_bound = 0, high_bound = 0; | |
353 | new_length = val_length / element_length; | |
354 | if (val_length % element_length != 0) | |
8a3fe4f8 | 355 | warning (_("array element type size does not divide object size in cast")); |
ac3eeb49 MS |
356 | /* FIXME-type-allocation: need a way to free this type when |
357 | we are done with it. */ | |
c906108c SS |
358 | range_type = create_range_type ((struct type *) NULL, |
359 | TYPE_TARGET_TYPE (range_type), | |
360 | low_bound, | |
361 | new_length + low_bound - 1); | |
ac3eeb49 MS |
362 | deprecated_set_value_type (arg2, |
363 | create_array_type ((struct type *) NULL, | |
364 | element_type, | |
365 | range_type)); | |
c906108c SS |
366 | return arg2; |
367 | } | |
368 | } | |
369 | ||
370 | if (current_language->c_style_arrays | |
371 | && TYPE_CODE (type2) == TYPE_CODE_ARRAY) | |
372 | arg2 = value_coerce_array (arg2); | |
373 | ||
374 | if (TYPE_CODE (type2) == TYPE_CODE_FUNC) | |
375 | arg2 = value_coerce_function (arg2); | |
376 | ||
df407dfe | 377 | type2 = check_typedef (value_type (arg2)); |
c906108c SS |
378 | code2 = TYPE_CODE (type2); |
379 | ||
380 | if (code1 == TYPE_CODE_COMPLEX) | |
381 | return cast_into_complex (type, arg2); | |
382 | if (code1 == TYPE_CODE_BOOL) | |
383 | { | |
384 | code1 = TYPE_CODE_INT; | |
385 | convert_to_boolean = 1; | |
386 | } | |
387 | if (code1 == TYPE_CODE_CHAR) | |
388 | code1 = TYPE_CODE_INT; | |
389 | if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR) | |
390 | code2 = TYPE_CODE_INT; | |
391 | ||
392 | scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT | |
4ef30785 TJB |
393 | || code2 == TYPE_CODE_DECFLOAT || code2 == TYPE_CODE_ENUM |
394 | || code2 == TYPE_CODE_RANGE); | |
c906108c | 395 | |
6af87b03 AR |
396 | if ((code1 == TYPE_CODE_STRUCT || code1 == TYPE_CODE_UNION) |
397 | && (code2 == TYPE_CODE_STRUCT || code2 == TYPE_CODE_UNION) | |
c906108c | 398 | && TYPE_NAME (type) != 0) |
6af87b03 | 399 | return value_cast_structs (type, arg2); |
c906108c SS |
400 | if (code1 == TYPE_CODE_FLT && scalar) |
401 | return value_from_double (type, value_as_double (arg2)); | |
4ef30785 TJB |
402 | else if (code1 == TYPE_CODE_DECFLOAT && scalar) |
403 | { | |
404 | int dec_len = TYPE_LENGTH (type); | |
405 | gdb_byte dec[16]; | |
406 | ||
407 | if (code2 == TYPE_CODE_FLT) | |
408 | decimal_from_floating (arg2, dec, dec_len); | |
409 | else if (code2 == TYPE_CODE_DECFLOAT) | |
410 | decimal_convert (value_contents (arg2), TYPE_LENGTH (type2), | |
411 | dec, dec_len); | |
412 | else | |
413 | /* The only option left is an integral type. */ | |
414 | decimal_from_integral (arg2, dec, dec_len); | |
415 | ||
416 | return value_from_decfloat (type, dec); | |
417 | } | |
c906108c SS |
418 | else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM |
419 | || code1 == TYPE_CODE_RANGE) | |
0d5de010 DJ |
420 | && (scalar || code2 == TYPE_CODE_PTR |
421 | || code2 == TYPE_CODE_MEMBERPTR)) | |
c906108c SS |
422 | { |
423 | LONGEST longest; | |
c5aa993b | 424 | |
2bf1f4a1 | 425 | /* When we cast pointers to integers, we mustn't use |
76e71323 | 426 | gdbarch_pointer_to_address to find the address the pointer |
2bf1f4a1 JB |
427 | represents, as value_as_long would. GDB should evaluate |
428 | expressions just as the compiler would --- and the compiler | |
429 | sees a cast as a simple reinterpretation of the pointer's | |
430 | bits. */ | |
431 | if (code2 == TYPE_CODE_PTR) | |
0fd88904 | 432 | longest = extract_unsigned_integer (value_contents (arg2), |
2bf1f4a1 JB |
433 | TYPE_LENGTH (type2)); |
434 | else | |
435 | longest = value_as_long (arg2); | |
802db21b | 436 | return value_from_longest (type, convert_to_boolean ? |
716c501e | 437 | (LONGEST) (longest ? 1 : 0) : longest); |
c906108c | 438 | } |
ac3eeb49 MS |
439 | else if (code1 == TYPE_CODE_PTR && (code2 == TYPE_CODE_INT |
440 | || code2 == TYPE_CODE_ENUM | |
441 | || code2 == TYPE_CODE_RANGE)) | |
634acd5f | 442 | { |
4603e466 DT |
443 | /* TYPE_LENGTH (type) is the length of a pointer, but we really |
444 | want the length of an address! -- we are really dealing with | |
445 | addresses (i.e., gdb representations) not pointers (i.e., | |
446 | target representations) here. | |
447 | ||
448 | This allows things like "print *(int *)0x01000234" to work | |
449 | without printing a misleading message -- which would | |
450 | otherwise occur when dealing with a target having two byte | |
451 | pointers and four byte addresses. */ | |
452 | ||
17a912b6 | 453 | int addr_bit = gdbarch_addr_bit (current_gdbarch); |
4603e466 | 454 | |
634acd5f | 455 | LONGEST longest = value_as_long (arg2); |
4603e466 | 456 | if (addr_bit < sizeof (LONGEST) * HOST_CHAR_BIT) |
634acd5f | 457 | { |
4603e466 DT |
458 | if (longest >= ((LONGEST) 1 << addr_bit) |
459 | || longest <= -((LONGEST) 1 << addr_bit)) | |
8a3fe4f8 | 460 | warning (_("value truncated")); |
634acd5f AC |
461 | } |
462 | return value_from_longest (type, longest); | |
463 | } | |
0d5de010 DJ |
464 | else if (code1 == TYPE_CODE_METHODPTR && code2 == TYPE_CODE_INT |
465 | && value_as_long (arg2) == 0) | |
466 | { | |
467 | struct value *result = allocate_value (type); | |
468 | cplus_make_method_ptr (value_contents_writeable (result), 0, 0); | |
469 | return result; | |
470 | } | |
471 | else if (code1 == TYPE_CODE_MEMBERPTR && code2 == TYPE_CODE_INT | |
472 | && value_as_long (arg2) == 0) | |
473 | { | |
474 | /* The Itanium C++ ABI represents NULL pointers to members as | |
475 | minus one, instead of biasing the normal case. */ | |
476 | return value_from_longest (type, -1); | |
477 | } | |
c906108c SS |
478 | else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2)) |
479 | { | |
480 | if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR) | |
fb933624 DJ |
481 | return value_cast_pointers (type, arg2); |
482 | ||
0d5de010 | 483 | arg2 = value_copy (arg2); |
04624583 | 484 | deprecated_set_value_type (arg2, type); |
2b127877 | 485 | arg2 = value_change_enclosing_type (arg2, type); |
b44d461b | 486 | set_value_pointed_to_offset (arg2, 0); /* pai: chk_val */ |
c906108c SS |
487 | return arg2; |
488 | } | |
c906108c | 489 | else if (VALUE_LVAL (arg2) == lval_memory) |
ac3eeb49 MS |
490 | return value_at_lazy (type, |
491 | VALUE_ADDRESS (arg2) + value_offset (arg2)); | |
c906108c SS |
492 | else if (code1 == TYPE_CODE_VOID) |
493 | { | |
494 | return value_zero (builtin_type_void, not_lval); | |
495 | } | |
496 | else | |
497 | { | |
8a3fe4f8 | 498 | error (_("Invalid cast.")); |
c906108c SS |
499 | return 0; |
500 | } | |
501 | } | |
502 | ||
503 | /* Create a value of type TYPE that is zero, and return it. */ | |
504 | ||
f23631e4 | 505 | struct value * |
fba45db2 | 506 | value_zero (struct type *type, enum lval_type lv) |
c906108c | 507 | { |
f23631e4 | 508 | struct value *val = allocate_value (type); |
c906108c SS |
509 | VALUE_LVAL (val) = lv; |
510 | ||
511 | return val; | |
512 | } | |
513 | ||
301f0ecf DE |
514 | /* Create a value of numeric type TYPE that is one, and return it. */ |
515 | ||
516 | struct value * | |
517 | value_one (struct type *type, enum lval_type lv) | |
518 | { | |
519 | struct type *type1 = check_typedef (type); | |
520 | struct value *val = NULL; /* avoid -Wall warning */ | |
521 | ||
522 | if (TYPE_CODE (type1) == TYPE_CODE_DECFLOAT) | |
523 | { | |
524 | struct value *int_one = value_from_longest (builtin_type_int, 1); | |
525 | struct value *val; | |
526 | gdb_byte v[16]; | |
527 | ||
528 | decimal_from_integral (int_one, v, TYPE_LENGTH (builtin_type_int)); | |
529 | val = value_from_decfloat (type, v); | |
530 | } | |
531 | else if (TYPE_CODE (type1) == TYPE_CODE_FLT) | |
532 | { | |
533 | val = value_from_double (type, (DOUBLEST) 1); | |
534 | } | |
535 | else if (is_integral_type (type1)) | |
536 | { | |
537 | val = value_from_longest (type, (LONGEST) 1); | |
538 | } | |
539 | else | |
540 | { | |
541 | error (_("Not a numeric type.")); | |
542 | } | |
543 | ||
544 | VALUE_LVAL (val) = lv; | |
545 | return val; | |
546 | } | |
547 | ||
070ad9f0 | 548 | /* Return a value with type TYPE located at ADDR. |
c906108c SS |
549 | |
550 | Call value_at only if the data needs to be fetched immediately; | |
551 | if we can be 'lazy' and defer the fetch, perhaps indefinately, call | |
552 | value_at_lazy instead. value_at_lazy simply records the address of | |
070ad9f0 | 553 | the data and sets the lazy-evaluation-required flag. The lazy flag |
0fd88904 | 554 | is tested in the value_contents macro, which is used if and when |
070ad9f0 | 555 | the contents are actually required. |
c906108c SS |
556 | |
557 | Note: value_at does *NOT* handle embedded offsets; perform such | |
ac3eeb49 | 558 | adjustments before or after calling it. */ |
c906108c | 559 | |
f23631e4 | 560 | struct value * |
00a4c844 | 561 | value_at (struct type *type, CORE_ADDR addr) |
c906108c | 562 | { |
f23631e4 | 563 | struct value *val; |
c906108c SS |
564 | |
565 | if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) | |
8a3fe4f8 | 566 | error (_("Attempt to dereference a generic pointer.")); |
c906108c SS |
567 | |
568 | val = allocate_value (type); | |
569 | ||
990a07ab | 570 | read_memory (addr, value_contents_all_raw (val), TYPE_LENGTH (type)); |
c906108c SS |
571 | |
572 | VALUE_LVAL (val) = lval_memory; | |
573 | VALUE_ADDRESS (val) = addr; | |
c906108c SS |
574 | |
575 | return val; | |
576 | } | |
577 | ||
578 | /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */ | |
579 | ||
f23631e4 | 580 | struct value * |
00a4c844 | 581 | value_at_lazy (struct type *type, CORE_ADDR addr) |
c906108c | 582 | { |
f23631e4 | 583 | struct value *val; |
c906108c SS |
584 | |
585 | if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) | |
8a3fe4f8 | 586 | error (_("Attempt to dereference a generic pointer.")); |
c906108c SS |
587 | |
588 | val = allocate_value (type); | |
589 | ||
590 | VALUE_LVAL (val) = lval_memory; | |
591 | VALUE_ADDRESS (val) = addr; | |
dfa52d88 | 592 | set_value_lazy (val, 1); |
c906108c SS |
593 | |
594 | return val; | |
595 | } | |
596 | ||
0fd88904 | 597 | /* Called only from the value_contents and value_contents_all() |
46615f07 | 598 | macros, if the current data for a variable needs to be loaded into |
0fd88904 | 599 | value_contents(VAL). Fetches the data from the user's process, and |
46615f07 AC |
600 | clears the lazy flag to indicate that the data in the buffer is |
601 | valid. | |
c906108c | 602 | |
ac3eeb49 MS |
603 | If the value is zero-length, we avoid calling read_memory, which |
604 | would abort. We mark the value as fetched anyway -- all 0 bytes of | |
605 | it. | |
c906108c | 606 | |
ac3eeb49 MS |
607 | This function returns a value because it is used in the |
608 | value_contents macro as part of an expression, where a void would | |
609 | not work. The value is ignored. */ | |
c906108c SS |
610 | |
611 | int | |
f23631e4 | 612 | value_fetch_lazy (struct value *val) |
c906108c | 613 | { |
df407dfe | 614 | CORE_ADDR addr = VALUE_ADDRESS (val) + value_offset (val); |
4754a64e | 615 | int length = TYPE_LENGTH (value_enclosing_type (val)); |
c906108c | 616 | |
df407dfe | 617 | struct type *type = value_type (val); |
75af7f68 | 618 | if (length) |
990a07ab | 619 | read_memory (addr, value_contents_all_raw (val), length); |
802db21b | 620 | |
dfa52d88 | 621 | set_value_lazy (val, 0); |
c906108c SS |
622 | return 0; |
623 | } | |
624 | ||
625 | ||
626 | /* Store the contents of FROMVAL into the location of TOVAL. | |
627 | Return a new value with the location of TOVAL and contents of FROMVAL. */ | |
628 | ||
f23631e4 AC |
629 | struct value * |
630 | value_assign (struct value *toval, struct value *fromval) | |
c906108c | 631 | { |
52f0bd74 | 632 | struct type *type; |
f23631e4 | 633 | struct value *val; |
cb741690 | 634 | struct frame_id old_frame; |
c906108c | 635 | |
88e3b34b | 636 | if (!deprecated_value_modifiable (toval)) |
8a3fe4f8 | 637 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
c906108c | 638 | |
994b9211 | 639 | toval = coerce_ref (toval); |
c906108c | 640 | |
df407dfe | 641 | type = value_type (toval); |
c906108c | 642 | if (VALUE_LVAL (toval) != lval_internalvar) |
63092375 DJ |
643 | { |
644 | toval = value_coerce_to_target (toval); | |
645 | fromval = value_cast (type, fromval); | |
646 | } | |
c906108c | 647 | else |
63092375 DJ |
648 | { |
649 | /* Coerce arrays and functions to pointers, except for arrays | |
650 | which only live in GDB's storage. */ | |
651 | if (!value_must_coerce_to_target (fromval)) | |
652 | fromval = coerce_array (fromval); | |
653 | } | |
654 | ||
c906108c SS |
655 | CHECK_TYPEDEF (type); |
656 | ||
ac3eeb49 MS |
657 | /* Since modifying a register can trash the frame chain, and |
658 | modifying memory can trash the frame cache, we save the old frame | |
659 | and then restore the new frame afterwards. */ | |
206415a3 | 660 | old_frame = get_frame_id (deprecated_safe_get_selected_frame ()); |
cb741690 | 661 | |
c906108c SS |
662 | switch (VALUE_LVAL (toval)) |
663 | { | |
664 | case lval_internalvar: | |
665 | set_internalvar (VALUE_INTERNALVAR (toval), fromval); | |
666 | val = value_copy (VALUE_INTERNALVAR (toval)->value); | |
ac3eeb49 MS |
667 | val = value_change_enclosing_type (val, |
668 | value_enclosing_type (fromval)); | |
13c3b5f5 | 669 | set_value_embedded_offset (val, value_embedded_offset (fromval)); |
ac3eeb49 MS |
670 | set_value_pointed_to_offset (val, |
671 | value_pointed_to_offset (fromval)); | |
c906108c SS |
672 | return val; |
673 | ||
674 | case lval_internalvar_component: | |
675 | set_internalvar_component (VALUE_INTERNALVAR (toval), | |
df407dfe AC |
676 | value_offset (toval), |
677 | value_bitpos (toval), | |
678 | value_bitsize (toval), | |
c906108c SS |
679 | fromval); |
680 | break; | |
681 | ||
682 | case lval_memory: | |
683 | { | |
fc1a4b47 | 684 | const gdb_byte *dest_buffer; |
c5aa993b JM |
685 | CORE_ADDR changed_addr; |
686 | int changed_len; | |
10c42a71 | 687 | gdb_byte buffer[sizeof (LONGEST)]; |
c906108c | 688 | |
df407dfe | 689 | if (value_bitsize (toval)) |
c5aa993b | 690 | { |
ac3eeb49 MS |
691 | /* We assume that the argument to read_memory is in units |
692 | of host chars. FIXME: Is that correct? */ | |
df407dfe AC |
693 | changed_len = (value_bitpos (toval) |
694 | + value_bitsize (toval) | |
c5aa993b JM |
695 | + HOST_CHAR_BIT - 1) |
696 | / HOST_CHAR_BIT; | |
c906108c SS |
697 | |
698 | if (changed_len > (int) sizeof (LONGEST)) | |
8a3fe4f8 | 699 | error (_("Can't handle bitfields which don't fit in a %d bit word."), |
baa6f10b | 700 | (int) sizeof (LONGEST) * HOST_CHAR_BIT); |
c906108c | 701 | |
df407dfe | 702 | read_memory (VALUE_ADDRESS (toval) + value_offset (toval), |
c906108c SS |
703 | buffer, changed_len); |
704 | modify_field (buffer, value_as_long (fromval), | |
df407dfe AC |
705 | value_bitpos (toval), value_bitsize (toval)); |
706 | changed_addr = VALUE_ADDRESS (toval) + value_offset (toval); | |
c906108c SS |
707 | dest_buffer = buffer; |
708 | } | |
c906108c SS |
709 | else |
710 | { | |
df407dfe | 711 | changed_addr = VALUE_ADDRESS (toval) + value_offset (toval); |
c906108c | 712 | changed_len = TYPE_LENGTH (type); |
0fd88904 | 713 | dest_buffer = value_contents (fromval); |
c906108c SS |
714 | } |
715 | ||
716 | write_memory (changed_addr, dest_buffer, changed_len); | |
9a4105ab AC |
717 | if (deprecated_memory_changed_hook) |
718 | deprecated_memory_changed_hook (changed_addr, changed_len); | |
c906108c SS |
719 | } |
720 | break; | |
721 | ||
492254e9 | 722 | case lval_register: |
c906108c | 723 | { |
c906108c | 724 | struct frame_info *frame; |
ff2e87ac | 725 | int value_reg; |
c906108c SS |
726 | |
727 | /* Figure out which frame this is in currently. */ | |
0c16dd26 AC |
728 | frame = frame_find_by_id (VALUE_FRAME_ID (toval)); |
729 | value_reg = VALUE_REGNUM (toval); | |
c906108c SS |
730 | |
731 | if (!frame) | |
8a3fe4f8 | 732 | error (_("Value being assigned to is no longer active.")); |
492254e9 | 733 | |
c1afe53d UW |
734 | if (gdbarch_convert_register_p |
735 | (current_gdbarch, VALUE_REGNUM (toval), type)) | |
492254e9 | 736 | { |
ff2e87ac | 737 | /* If TOVAL is a special machine register requiring |
ac3eeb49 MS |
738 | conversion of program values to a special raw |
739 | format. */ | |
740 | gdbarch_value_to_register (current_gdbarch, frame, | |
741 | VALUE_REGNUM (toval), type, | |
742 | value_contents (fromval)); | |
492254e9 | 743 | } |
c906108c | 744 | else |
492254e9 | 745 | { |
df407dfe | 746 | if (value_bitsize (toval)) |
00fa51f6 UW |
747 | { |
748 | int changed_len; | |
749 | gdb_byte buffer[sizeof (LONGEST)]; | |
750 | ||
751 | changed_len = (value_bitpos (toval) | |
752 | + value_bitsize (toval) | |
753 | + HOST_CHAR_BIT - 1) | |
754 | / HOST_CHAR_BIT; | |
755 | ||
756 | if (changed_len > (int) sizeof (LONGEST)) | |
757 | error (_("Can't handle bitfields which don't fit in a %d bit word."), | |
758 | (int) sizeof (LONGEST) * HOST_CHAR_BIT); | |
759 | ||
760 | get_frame_register_bytes (frame, value_reg, | |
761 | value_offset (toval), | |
762 | changed_len, buffer); | |
763 | ||
764 | modify_field (buffer, value_as_long (fromval), | |
ac3eeb49 MS |
765 | value_bitpos (toval), |
766 | value_bitsize (toval)); | |
00fa51f6 UW |
767 | |
768 | put_frame_register_bytes (frame, value_reg, | |
769 | value_offset (toval), | |
770 | changed_len, buffer); | |
771 | } | |
c906108c | 772 | else |
00fa51f6 UW |
773 | { |
774 | put_frame_register_bytes (frame, value_reg, | |
775 | value_offset (toval), | |
776 | TYPE_LENGTH (type), | |
777 | value_contents (fromval)); | |
778 | } | |
ff2e87ac | 779 | } |
00fa51f6 | 780 | |
9a4105ab AC |
781 | if (deprecated_register_changed_hook) |
782 | deprecated_register_changed_hook (-1); | |
f4c5303c | 783 | observer_notify_target_changed (¤t_target); |
ff2e87ac | 784 | break; |
c906108c | 785 | } |
492254e9 | 786 | |
c906108c | 787 | default: |
8a3fe4f8 | 788 | error (_("Left operand of assignment is not an lvalue.")); |
c906108c SS |
789 | } |
790 | ||
cb741690 DJ |
791 | /* Assigning to the stack pointer, frame pointer, and other |
792 | (architecture and calling convention specific) registers may | |
793 | cause the frame cache to be out of date. Assigning to memory | |
794 | also can. We just do this on all assignments to registers or | |
795 | memory, for simplicity's sake; I doubt the slowdown matters. */ | |
796 | switch (VALUE_LVAL (toval)) | |
797 | { | |
798 | case lval_memory: | |
799 | case lval_register: | |
cb741690 DJ |
800 | |
801 | reinit_frame_cache (); | |
802 | ||
ac3eeb49 MS |
803 | /* Having destroyed the frame cache, restore the selected |
804 | frame. */ | |
cb741690 DJ |
805 | |
806 | /* FIXME: cagney/2002-11-02: There has to be a better way of | |
807 | doing this. Instead of constantly saving/restoring the | |
808 | frame. Why not create a get_selected_frame() function that, | |
809 | having saved the selected frame's ID can automatically | |
810 | re-find the previously selected frame automatically. */ | |
811 | ||
812 | { | |
813 | struct frame_info *fi = frame_find_by_id (old_frame); | |
814 | if (fi != NULL) | |
815 | select_frame (fi); | |
816 | } | |
817 | ||
818 | break; | |
819 | default: | |
820 | break; | |
821 | } | |
822 | ||
ac3eeb49 MS |
823 | /* If the field does not entirely fill a LONGEST, then zero the sign |
824 | bits. If the field is signed, and is negative, then sign | |
825 | extend. */ | |
df407dfe AC |
826 | if ((value_bitsize (toval) > 0) |
827 | && (value_bitsize (toval) < 8 * (int) sizeof (LONGEST))) | |
c906108c SS |
828 | { |
829 | LONGEST fieldval = value_as_long (fromval); | |
df407dfe | 830 | LONGEST valmask = (((ULONGEST) 1) << value_bitsize (toval)) - 1; |
c906108c SS |
831 | |
832 | fieldval &= valmask; | |
ac3eeb49 MS |
833 | if (!TYPE_UNSIGNED (type) |
834 | && (fieldval & (valmask ^ (valmask >> 1)))) | |
c906108c SS |
835 | fieldval |= ~valmask; |
836 | ||
837 | fromval = value_from_longest (type, fieldval); | |
838 | } | |
839 | ||
840 | val = value_copy (toval); | |
0fd88904 | 841 | memcpy (value_contents_raw (val), value_contents (fromval), |
c906108c | 842 | TYPE_LENGTH (type)); |
04624583 | 843 | deprecated_set_value_type (val, type); |
ac3eeb49 MS |
844 | val = value_change_enclosing_type (val, |
845 | value_enclosing_type (fromval)); | |
13c3b5f5 | 846 | set_value_embedded_offset (val, value_embedded_offset (fromval)); |
b44d461b | 847 | set_value_pointed_to_offset (val, value_pointed_to_offset (fromval)); |
c5aa993b | 848 | |
c906108c SS |
849 | return val; |
850 | } | |
851 | ||
852 | /* Extend a value VAL to COUNT repetitions of its type. */ | |
853 | ||
f23631e4 AC |
854 | struct value * |
855 | value_repeat (struct value *arg1, int count) | |
c906108c | 856 | { |
f23631e4 | 857 | struct value *val; |
c906108c SS |
858 | |
859 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 860 | error (_("Only values in memory can be extended with '@'.")); |
c906108c | 861 | if (count < 1) |
8a3fe4f8 | 862 | error (_("Invalid number %d of repetitions."), count); |
c906108c | 863 | |
4754a64e | 864 | val = allocate_repeat_value (value_enclosing_type (arg1), count); |
c906108c | 865 | |
df407dfe | 866 | read_memory (VALUE_ADDRESS (arg1) + value_offset (arg1), |
990a07ab | 867 | value_contents_all_raw (val), |
4754a64e | 868 | TYPE_LENGTH (value_enclosing_type (val))); |
c906108c | 869 | VALUE_LVAL (val) = lval_memory; |
df407dfe | 870 | VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + value_offset (arg1); |
c906108c SS |
871 | |
872 | return val; | |
873 | } | |
874 | ||
f23631e4 | 875 | struct value * |
fba45db2 | 876 | value_of_variable (struct symbol *var, struct block *b) |
c906108c | 877 | { |
f23631e4 | 878 | struct value *val; |
c906108c SS |
879 | struct frame_info *frame = NULL; |
880 | ||
881 | if (!b) | |
882 | frame = NULL; /* Use selected frame. */ | |
883 | else if (symbol_read_needs_frame (var)) | |
884 | { | |
885 | frame = block_innermost_frame (b); | |
886 | if (!frame) | |
c5aa993b | 887 | { |
c906108c | 888 | if (BLOCK_FUNCTION (b) |
de5ad195 | 889 | && SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b))) |
8a3fe4f8 | 890 | error (_("No frame is currently executing in block %s."), |
de5ad195 | 891 | SYMBOL_PRINT_NAME (BLOCK_FUNCTION (b))); |
c906108c | 892 | else |
8a3fe4f8 | 893 | error (_("No frame is currently executing in specified block")); |
c5aa993b | 894 | } |
c906108c SS |
895 | } |
896 | ||
897 | val = read_var_value (var, frame); | |
898 | if (!val) | |
8a3fe4f8 | 899 | error (_("Address of symbol \"%s\" is unknown."), SYMBOL_PRINT_NAME (var)); |
c906108c SS |
900 | |
901 | return val; | |
902 | } | |
903 | ||
63092375 DJ |
904 | /* Return one if VAL does not live in target memory, but should in order |
905 | to operate on it. Otherwise return zero. */ | |
906 | ||
907 | int | |
908 | value_must_coerce_to_target (struct value *val) | |
909 | { | |
910 | struct type *valtype; | |
911 | ||
912 | /* The only lval kinds which do not live in target memory. */ | |
913 | if (VALUE_LVAL (val) != not_lval | |
914 | && VALUE_LVAL (val) != lval_internalvar) | |
915 | return 0; | |
916 | ||
917 | valtype = check_typedef (value_type (val)); | |
918 | ||
919 | switch (TYPE_CODE (valtype)) | |
920 | { | |
921 | case TYPE_CODE_ARRAY: | |
922 | case TYPE_CODE_STRING: | |
923 | return 1; | |
924 | default: | |
925 | return 0; | |
926 | } | |
927 | } | |
928 | ||
929 | /* Make sure that VAL lives in target memory if it's supposed to. For instance, | |
930 | strings are constructed as character arrays in GDB's storage, and this | |
931 | function copies them to the target. */ | |
932 | ||
933 | struct value * | |
934 | value_coerce_to_target (struct value *val) | |
935 | { | |
936 | LONGEST length; | |
937 | CORE_ADDR addr; | |
938 | ||
939 | if (!value_must_coerce_to_target (val)) | |
940 | return val; | |
941 | ||
942 | length = TYPE_LENGTH (check_typedef (value_type (val))); | |
943 | addr = allocate_space_in_inferior (length); | |
944 | write_memory (addr, value_contents (val), length); | |
945 | return value_at_lazy (value_type (val), addr); | |
946 | } | |
947 | ||
ac3eeb49 MS |
948 | /* Given a value which is an array, return a value which is a pointer |
949 | to its first element, regardless of whether or not the array has a | |
950 | nonzero lower bound. | |
c906108c | 951 | |
ac3eeb49 MS |
952 | FIXME: A previous comment here indicated that this routine should |
953 | be substracting the array's lower bound. It's not clear to me that | |
954 | this is correct. Given an array subscripting operation, it would | |
955 | certainly work to do the adjustment here, essentially computing: | |
c906108c SS |
956 | |
957 | (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0]) | |
958 | ||
ac3eeb49 MS |
959 | However I believe a more appropriate and logical place to account |
960 | for the lower bound is to do so in value_subscript, essentially | |
961 | computing: | |
c906108c SS |
962 | |
963 | (&array[0] + ((index - lowerbound) * sizeof array[0])) | |
964 | ||
ac3eeb49 MS |
965 | As further evidence consider what would happen with operations |
966 | other than array subscripting, where the caller would get back a | |
967 | value that had an address somewhere before the actual first element | |
968 | of the array, and the information about the lower bound would be | |
969 | lost because of the coercion to pointer type. | |
c5aa993b | 970 | */ |
c906108c | 971 | |
f23631e4 AC |
972 | struct value * |
973 | value_coerce_array (struct value *arg1) | |
c906108c | 974 | { |
df407dfe | 975 | struct type *type = check_typedef (value_type (arg1)); |
c906108c | 976 | |
63092375 DJ |
977 | /* If the user tries to do something requiring a pointer with an |
978 | array that has not yet been pushed to the target, then this would | |
979 | be a good time to do so. */ | |
980 | arg1 = value_coerce_to_target (arg1); | |
981 | ||
c906108c | 982 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 983 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 984 | |
4478b372 | 985 | return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
df407dfe | 986 | (VALUE_ADDRESS (arg1) + value_offset (arg1))); |
c906108c SS |
987 | } |
988 | ||
989 | /* Given a value which is a function, return a value which is a pointer | |
990 | to it. */ | |
991 | ||
f23631e4 AC |
992 | struct value * |
993 | value_coerce_function (struct value *arg1) | |
c906108c | 994 | { |
f23631e4 | 995 | struct value *retval; |
c906108c SS |
996 | |
997 | if (VALUE_LVAL (arg1) != lval_memory) | |
8a3fe4f8 | 998 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 999 | |
df407dfe AC |
1000 | retval = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
1001 | (VALUE_ADDRESS (arg1) + value_offset (arg1))); | |
c906108c | 1002 | return retval; |
c5aa993b | 1003 | } |
c906108c | 1004 | |
ac3eeb49 MS |
1005 | /* Return a pointer value for the object for which ARG1 is the |
1006 | contents. */ | |
c906108c | 1007 | |
f23631e4 AC |
1008 | struct value * |
1009 | value_addr (struct value *arg1) | |
c906108c | 1010 | { |
f23631e4 | 1011 | struct value *arg2; |
c906108c | 1012 | |
df407dfe | 1013 | struct type *type = check_typedef (value_type (arg1)); |
c906108c SS |
1014 | if (TYPE_CODE (type) == TYPE_CODE_REF) |
1015 | { | |
ac3eeb49 MS |
1016 | /* Copy the value, but change the type from (T&) to (T*). We |
1017 | keep the same location information, which is efficient, and | |
1018 | allows &(&X) to get the location containing the reference. */ | |
c906108c | 1019 | arg2 = value_copy (arg1); |
ac3eeb49 MS |
1020 | deprecated_set_value_type (arg2, |
1021 | lookup_pointer_type (TYPE_TARGET_TYPE (type))); | |
c906108c SS |
1022 | return arg2; |
1023 | } | |
1024 | if (TYPE_CODE (type) == TYPE_CODE_FUNC) | |
1025 | return value_coerce_function (arg1); | |
1026 | ||
63092375 DJ |
1027 | /* If this is an array that has not yet been pushed to the target, |
1028 | then this would be a good time to force it to memory. */ | |
1029 | arg1 = value_coerce_to_target (arg1); | |
1030 | ||
c906108c | 1031 | if (VALUE_LVAL (arg1) != lval_memory) |
8a3fe4f8 | 1032 | error (_("Attempt to take address of value not located in memory.")); |
c906108c | 1033 | |
c5aa993b | 1034 | /* Get target memory address */ |
df407dfe | 1035 | arg2 = value_from_pointer (lookup_pointer_type (value_type (arg1)), |
4478b372 | 1036 | (VALUE_ADDRESS (arg1) |
df407dfe | 1037 | + value_offset (arg1) |
13c3b5f5 | 1038 | + value_embedded_offset (arg1))); |
c906108c SS |
1039 | |
1040 | /* This may be a pointer to a base subobject; so remember the | |
ac3eeb49 | 1041 | full derived object's type ... */ |
4754a64e | 1042 | arg2 = value_change_enclosing_type (arg2, lookup_pointer_type (value_enclosing_type (arg1))); |
ac3eeb49 MS |
1043 | /* ... and also the relative position of the subobject in the full |
1044 | object. */ | |
b44d461b | 1045 | set_value_pointed_to_offset (arg2, value_embedded_offset (arg1)); |
c906108c SS |
1046 | return arg2; |
1047 | } | |
1048 | ||
ac3eeb49 MS |
1049 | /* Return a reference value for the object for which ARG1 is the |
1050 | contents. */ | |
fb933624 DJ |
1051 | |
1052 | struct value * | |
1053 | value_ref (struct value *arg1) | |
1054 | { | |
1055 | struct value *arg2; | |
1056 | ||
1057 | struct type *type = check_typedef (value_type (arg1)); | |
1058 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
1059 | return arg1; | |
1060 | ||
1061 | arg2 = value_addr (arg1); | |
1062 | deprecated_set_value_type (arg2, lookup_reference_type (type)); | |
1063 | return arg2; | |
1064 | } | |
1065 | ||
ac3eeb49 MS |
1066 | /* Given a value of a pointer type, apply the C unary * operator to |
1067 | it. */ | |
c906108c | 1068 | |
f23631e4 AC |
1069 | struct value * |
1070 | value_ind (struct value *arg1) | |
c906108c SS |
1071 | { |
1072 | struct type *base_type; | |
f23631e4 | 1073 | struct value *arg2; |
c906108c | 1074 | |
994b9211 | 1075 | arg1 = coerce_array (arg1); |
c906108c | 1076 | |
df407dfe | 1077 | base_type = check_typedef (value_type (arg1)); |
c906108c | 1078 | |
c906108c | 1079 | /* Allow * on an integer so we can cast it to whatever we want. |
ac3eeb49 MS |
1080 | This returns an int, which seems like the most C-like thing to |
1081 | do. "long long" variables are rare enough that | |
c906108c SS |
1082 | BUILTIN_TYPE_LONGEST would seem to be a mistake. */ |
1083 | if (TYPE_CODE (base_type) == TYPE_CODE_INT) | |
56468235 | 1084 | return value_at_lazy (builtin_type_int, |
fef862e5 | 1085 | (CORE_ADDR) value_as_address (arg1)); |
c906108c SS |
1086 | else if (TYPE_CODE (base_type) == TYPE_CODE_PTR) |
1087 | { | |
1088 | struct type *enc_type; | |
ac3eeb49 MS |
1089 | /* We may be pointing to something embedded in a larger object. |
1090 | Get the real type of the enclosing object. */ | |
4754a64e | 1091 | enc_type = check_typedef (value_enclosing_type (arg1)); |
c906108c | 1092 | enc_type = TYPE_TARGET_TYPE (enc_type); |
0d5de010 DJ |
1093 | |
1094 | if (TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_FUNC | |
1095 | || TYPE_CODE (check_typedef (enc_type)) == TYPE_CODE_METHOD) | |
1096 | /* For functions, go through find_function_addr, which knows | |
1097 | how to handle function descriptors. */ | |
ac3eeb49 MS |
1098 | arg2 = value_at_lazy (enc_type, |
1099 | find_function_addr (arg1, NULL)); | |
0d5de010 DJ |
1100 | else |
1101 | /* Retrieve the enclosing object pointed to */ | |
ac3eeb49 MS |
1102 | arg2 = value_at_lazy (enc_type, |
1103 | (value_as_address (arg1) | |
1104 | - value_pointed_to_offset (arg1))); | |
0d5de010 | 1105 | |
ac3eeb49 | 1106 | /* Re-adjust type. */ |
04624583 | 1107 | deprecated_set_value_type (arg2, TYPE_TARGET_TYPE (base_type)); |
ac3eeb49 | 1108 | /* Add embedding info. */ |
2b127877 | 1109 | arg2 = value_change_enclosing_type (arg2, enc_type); |
b44d461b | 1110 | set_value_embedded_offset (arg2, value_pointed_to_offset (arg1)); |
c906108c | 1111 | |
ac3eeb49 | 1112 | /* We may be pointing to an object of some derived type. */ |
c906108c SS |
1113 | arg2 = value_full_object (arg2, NULL, 0, 0, 0); |
1114 | return arg2; | |
1115 | } | |
1116 | ||
8a3fe4f8 | 1117 | error (_("Attempt to take contents of a non-pointer value.")); |
ac3eeb49 | 1118 | return 0; /* For lint -- never reached. */ |
c906108c SS |
1119 | } |
1120 | \f | |
63092375 | 1121 | /* Create a value for an array by allocating space in GDB, copying |
ac3eeb49 MS |
1122 | copying the data into that space, and then setting up an array |
1123 | value. | |
c906108c | 1124 | |
ac3eeb49 MS |
1125 | The array bounds are set from LOWBOUND and HIGHBOUND, and the array |
1126 | is populated from the values passed in ELEMVEC. | |
c906108c SS |
1127 | |
1128 | The element type of the array is inherited from the type of the | |
1129 | first element, and all elements must have the same size (though we | |
ac3eeb49 | 1130 | don't currently enforce any restriction on their types). */ |
c906108c | 1131 | |
f23631e4 AC |
1132 | struct value * |
1133 | value_array (int lowbound, int highbound, struct value **elemvec) | |
c906108c SS |
1134 | { |
1135 | int nelem; | |
1136 | int idx; | |
1137 | unsigned int typelength; | |
f23631e4 | 1138 | struct value *val; |
c906108c SS |
1139 | struct type *rangetype; |
1140 | struct type *arraytype; | |
1141 | CORE_ADDR addr; | |
1142 | ||
ac3eeb49 MS |
1143 | /* Validate that the bounds are reasonable and that each of the |
1144 | elements have the same size. */ | |
c906108c SS |
1145 | |
1146 | nelem = highbound - lowbound + 1; | |
1147 | if (nelem <= 0) | |
1148 | { | |
8a3fe4f8 | 1149 | error (_("bad array bounds (%d, %d)"), lowbound, highbound); |
c906108c | 1150 | } |
4754a64e | 1151 | typelength = TYPE_LENGTH (value_enclosing_type (elemvec[0])); |
c906108c SS |
1152 | for (idx = 1; idx < nelem; idx++) |
1153 | { | |
4754a64e | 1154 | if (TYPE_LENGTH (value_enclosing_type (elemvec[idx])) != typelength) |
c906108c | 1155 | { |
8a3fe4f8 | 1156 | error (_("array elements must all be the same size")); |
c906108c SS |
1157 | } |
1158 | } | |
1159 | ||
ac3eeb49 MS |
1160 | rangetype = create_range_type ((struct type *) NULL, |
1161 | builtin_type_int, | |
c906108c | 1162 | lowbound, highbound); |
c5aa993b | 1163 | arraytype = create_array_type ((struct type *) NULL, |
ac3eeb49 MS |
1164 | value_enclosing_type (elemvec[0]), |
1165 | rangetype); | |
c906108c SS |
1166 | |
1167 | if (!current_language->c_style_arrays) | |
1168 | { | |
1169 | val = allocate_value (arraytype); | |
1170 | for (idx = 0; idx < nelem; idx++) | |
1171 | { | |
990a07ab | 1172 | memcpy (value_contents_all_raw (val) + (idx * typelength), |
46615f07 | 1173 | value_contents_all (elemvec[idx]), |
c906108c SS |
1174 | typelength); |
1175 | } | |
c906108c SS |
1176 | return val; |
1177 | } | |
1178 | ||
63092375 DJ |
1179 | /* Allocate space to store the array, and then initialize it by |
1180 | copying in each element. */ | |
c906108c | 1181 | |
63092375 | 1182 | val = allocate_value (arraytype); |
c906108c | 1183 | for (idx = 0; idx < nelem; idx++) |
63092375 DJ |
1184 | memcpy (value_contents_writeable (val) + (idx * typelength), |
1185 | value_contents_all (elemvec[idx]), | |
1186 | typelength); | |
1187 | return val; | |
c906108c SS |
1188 | } |
1189 | ||
ac3eeb49 MS |
1190 | /* Create a value for a string constant by allocating space in the |
1191 | inferior, copying the data into that space, and returning the | |
1192 | address with type TYPE_CODE_STRING. PTR points to the string | |
1193 | constant data; LEN is number of characters. | |
1194 | ||
1195 | Note that string types are like array of char types with a lower | |
1196 | bound of zero and an upper bound of LEN - 1. Also note that the | |
1197 | string may contain embedded null bytes. */ | |
c906108c | 1198 | |
f23631e4 | 1199 | struct value * |
fba45db2 | 1200 | value_string (char *ptr, int len) |
c906108c | 1201 | { |
f23631e4 | 1202 | struct value *val; |
c906108c SS |
1203 | int lowbound = current_language->string_lower_bound; |
1204 | struct type *rangetype = create_range_type ((struct type *) NULL, | |
1205 | builtin_type_int, | |
ac3eeb49 MS |
1206 | lowbound, |
1207 | len + lowbound - 1); | |
c906108c | 1208 | struct type *stringtype |
ac3eeb49 | 1209 | = create_string_type ((struct type *) NULL, rangetype); |
c906108c SS |
1210 | CORE_ADDR addr; |
1211 | ||
1212 | if (current_language->c_style_arrays == 0) | |
1213 | { | |
1214 | val = allocate_value (stringtype); | |
990a07ab | 1215 | memcpy (value_contents_raw (val), ptr, len); |
c906108c SS |
1216 | return val; |
1217 | } | |
1218 | ||
1219 | ||
ac3eeb49 MS |
1220 | /* Allocate space to store the string in the inferior, and then copy |
1221 | LEN bytes from PTR in gdb to that address in the inferior. */ | |
c906108c SS |
1222 | |
1223 | addr = allocate_space_in_inferior (len); | |
47b667de | 1224 | write_memory (addr, (gdb_byte *) ptr, len); |
c906108c | 1225 | |
00a4c844 | 1226 | val = value_at_lazy (stringtype, addr); |
c906108c SS |
1227 | return (val); |
1228 | } | |
1229 | ||
f23631e4 | 1230 | struct value * |
fba45db2 | 1231 | value_bitstring (char *ptr, int len) |
c906108c | 1232 | { |
f23631e4 | 1233 | struct value *val; |
ac3eeb49 MS |
1234 | struct type *domain_type = create_range_type (NULL, |
1235 | builtin_type_int, | |
c906108c | 1236 | 0, len - 1); |
ac3eeb49 MS |
1237 | struct type *type = create_set_type ((struct type *) NULL, |
1238 | domain_type); | |
c906108c SS |
1239 | TYPE_CODE (type) = TYPE_CODE_BITSTRING; |
1240 | val = allocate_value (type); | |
990a07ab | 1241 | memcpy (value_contents_raw (val), ptr, TYPE_LENGTH (type)); |
c906108c SS |
1242 | return val; |
1243 | } | |
1244 | \f | |
ac3eeb49 MS |
1245 | /* See if we can pass arguments in T2 to a function which takes |
1246 | arguments of types T1. T1 is a list of NARGS arguments, and T2 is | |
1247 | a NULL-terminated vector. If some arguments need coercion of some | |
1248 | sort, then the coerced values are written into T2. Return value is | |
1249 | 0 if the arguments could be matched, or the position at which they | |
1250 | differ if not. | |
c906108c | 1251 | |
ac3eeb49 MS |
1252 | STATICP is nonzero if the T1 argument list came from a static |
1253 | member function. T2 will still include the ``this'' pointer, but | |
1254 | it will be skipped. | |
c906108c SS |
1255 | |
1256 | For non-static member functions, we ignore the first argument, | |
ac3eeb49 MS |
1257 | which is the type of the instance variable. This is because we |
1258 | want to handle calls with objects from derived classes. This is | |
1259 | not entirely correct: we should actually check to make sure that a | |
c906108c SS |
1260 | requested operation is type secure, shouldn't we? FIXME. */ |
1261 | ||
1262 | static int | |
ad2f7632 DJ |
1263 | typecmp (int staticp, int varargs, int nargs, |
1264 | struct field t1[], struct value *t2[]) | |
c906108c SS |
1265 | { |
1266 | int i; | |
1267 | ||
1268 | if (t2 == 0) | |
ac3eeb49 MS |
1269 | internal_error (__FILE__, __LINE__, |
1270 | _("typecmp: no argument list")); | |
ad2f7632 | 1271 | |
ac3eeb49 MS |
1272 | /* Skip ``this'' argument if applicable. T2 will always include |
1273 | THIS. */ | |
4a1970e4 | 1274 | if (staticp) |
ad2f7632 DJ |
1275 | t2 ++; |
1276 | ||
1277 | for (i = 0; | |
1278 | (i < nargs) && TYPE_CODE (t1[i].type) != TYPE_CODE_VOID; | |
1279 | i++) | |
c906108c | 1280 | { |
c5aa993b | 1281 | struct type *tt1, *tt2; |
ad2f7632 | 1282 | |
c5aa993b JM |
1283 | if (!t2[i]) |
1284 | return i + 1; | |
ad2f7632 DJ |
1285 | |
1286 | tt1 = check_typedef (t1[i].type); | |
df407dfe | 1287 | tt2 = check_typedef (value_type (t2[i])); |
ad2f7632 | 1288 | |
c906108c | 1289 | if (TYPE_CODE (tt1) == TYPE_CODE_REF |
c5aa993b | 1290 | /* We should be doing hairy argument matching, as below. */ |
c906108c SS |
1291 | && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2))) |
1292 | { | |
1293 | if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY) | |
1294 | t2[i] = value_coerce_array (t2[i]); | |
1295 | else | |
fb933624 | 1296 | t2[i] = value_ref (t2[i]); |
c906108c SS |
1297 | continue; |
1298 | } | |
1299 | ||
802db21b DB |
1300 | /* djb - 20000715 - Until the new type structure is in the |
1301 | place, and we can attempt things like implicit conversions, | |
1302 | we need to do this so you can take something like a map<const | |
1303 | char *>, and properly access map["hello"], because the | |
1304 | argument to [] will be a reference to a pointer to a char, | |
ac3eeb49 MS |
1305 | and the argument will be a pointer to a char. */ |
1306 | while (TYPE_CODE(tt1) == TYPE_CODE_REF | |
1307 | || TYPE_CODE (tt1) == TYPE_CODE_PTR) | |
802db21b DB |
1308 | { |
1309 | tt1 = check_typedef( TYPE_TARGET_TYPE(tt1) ); | |
1310 | } | |
ac3eeb49 MS |
1311 | while (TYPE_CODE(tt2) == TYPE_CODE_ARRAY |
1312 | || TYPE_CODE(tt2) == TYPE_CODE_PTR | |
1313 | || TYPE_CODE(tt2) == TYPE_CODE_REF) | |
c906108c | 1314 | { |
ac3eeb49 | 1315 | tt2 = check_typedef (TYPE_TARGET_TYPE(tt2)); |
c906108c | 1316 | } |
c5aa993b JM |
1317 | if (TYPE_CODE (tt1) == TYPE_CODE (tt2)) |
1318 | continue; | |
ac3eeb49 MS |
1319 | /* Array to pointer is a `trivial conversion' according to the |
1320 | ARM. */ | |
c906108c | 1321 | |
ac3eeb49 MS |
1322 | /* We should be doing much hairier argument matching (see |
1323 | section 13.2 of the ARM), but as a quick kludge, just check | |
1324 | for the same type code. */ | |
df407dfe | 1325 | if (TYPE_CODE (t1[i].type) != TYPE_CODE (value_type (t2[i]))) |
c5aa993b | 1326 | return i + 1; |
c906108c | 1327 | } |
ad2f7632 | 1328 | if (varargs || t2[i] == NULL) |
c5aa993b | 1329 | return 0; |
ad2f7632 | 1330 | return i + 1; |
c906108c SS |
1331 | } |
1332 | ||
ac3eeb49 MS |
1333 | /* Helper function used by value_struct_elt to recurse through |
1334 | baseclasses. Look for a field NAME in ARG1. Adjust the address of | |
1335 | ARG1 by OFFSET bytes, and search in it assuming it has (class) type | |
1336 | TYPE. If found, return value, else return NULL. | |
c906108c | 1337 | |
ac3eeb49 MS |
1338 | If LOOKING_FOR_BASECLASS, then instead of looking for struct |
1339 | fields, look for a baseclass named NAME. */ | |
c906108c | 1340 | |
f23631e4 AC |
1341 | static struct value * |
1342 | search_struct_field (char *name, struct value *arg1, int offset, | |
aa1ee363 | 1343 | struct type *type, int looking_for_baseclass) |
c906108c SS |
1344 | { |
1345 | int i; | |
1346 | int nbases = TYPE_N_BASECLASSES (type); | |
1347 | ||
1348 | CHECK_TYPEDEF (type); | |
1349 | ||
c5aa993b | 1350 | if (!looking_for_baseclass) |
c906108c SS |
1351 | for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--) |
1352 | { | |
1353 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
1354 | ||
db577aea | 1355 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c | 1356 | { |
f23631e4 | 1357 | struct value *v; |
c906108c | 1358 | if (TYPE_FIELD_STATIC (type, i)) |
2c2738a0 DC |
1359 | { |
1360 | v = value_static_field (type, i); | |
1361 | if (v == 0) | |
8a3fe4f8 | 1362 | error (_("field %s is nonexistent or has been optimised out"), |
2c2738a0 DC |
1363 | name); |
1364 | } | |
c906108c | 1365 | else |
2c2738a0 DC |
1366 | { |
1367 | v = value_primitive_field (arg1, offset, i, type); | |
1368 | if (v == 0) | |
8a3fe4f8 | 1369 | error (_("there is no field named %s"), name); |
2c2738a0 | 1370 | } |
c906108c SS |
1371 | return v; |
1372 | } | |
1373 | ||
1374 | if (t_field_name | |
1375 | && (t_field_name[0] == '\0' | |
1376 | || (TYPE_CODE (type) == TYPE_CODE_UNION | |
db577aea | 1377 | && (strcmp_iw (t_field_name, "else") == 0)))) |
c906108c SS |
1378 | { |
1379 | struct type *field_type = TYPE_FIELD_TYPE (type, i); | |
1380 | if (TYPE_CODE (field_type) == TYPE_CODE_UNION | |
1381 | || TYPE_CODE (field_type) == TYPE_CODE_STRUCT) | |
1382 | { | |
ac3eeb49 MS |
1383 | /* Look for a match through the fields of an anonymous |
1384 | union, or anonymous struct. C++ provides anonymous | |
1385 | unions. | |
c906108c | 1386 | |
1b831c93 AC |
1387 | In the GNU Chill (now deleted from GDB) |
1388 | implementation of variant record types, each | |
1389 | <alternative field> has an (anonymous) union type, | |
1390 | each member of the union represents a <variant | |
1391 | alternative>. Each <variant alternative> is | |
1392 | represented as a struct, with a member for each | |
1393 | <variant field>. */ | |
c5aa993b | 1394 | |
f23631e4 | 1395 | struct value *v; |
c906108c SS |
1396 | int new_offset = offset; |
1397 | ||
db034ac5 AC |
1398 | /* This is pretty gross. In G++, the offset in an |
1399 | anonymous union is relative to the beginning of the | |
1b831c93 AC |
1400 | enclosing struct. In the GNU Chill (now deleted |
1401 | from GDB) implementation of variant records, the | |
1402 | bitpos is zero in an anonymous union field, so we | |
ac3eeb49 | 1403 | have to add the offset of the union here. */ |
c906108c SS |
1404 | if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT |
1405 | || (TYPE_NFIELDS (field_type) > 0 | |
1406 | && TYPE_FIELD_BITPOS (field_type, 0) == 0)) | |
1407 | new_offset += TYPE_FIELD_BITPOS (type, i) / 8; | |
1408 | ||
ac3eeb49 MS |
1409 | v = search_struct_field (name, arg1, new_offset, |
1410 | field_type, | |
c906108c SS |
1411 | looking_for_baseclass); |
1412 | if (v) | |
1413 | return v; | |
1414 | } | |
1415 | } | |
1416 | } | |
1417 | ||
c5aa993b | 1418 | for (i = 0; i < nbases; i++) |
c906108c | 1419 | { |
f23631e4 | 1420 | struct value *v; |
c906108c | 1421 | struct type *basetype = check_typedef (TYPE_BASECLASS (type, i)); |
ac3eeb49 MS |
1422 | /* If we are looking for baseclasses, this is what we get when |
1423 | we hit them. But it could happen that the base part's member | |
1424 | name is not yet filled in. */ | |
c906108c SS |
1425 | int found_baseclass = (looking_for_baseclass |
1426 | && TYPE_BASECLASS_NAME (type, i) != NULL | |
ac3eeb49 MS |
1427 | && (strcmp_iw (name, |
1428 | TYPE_BASECLASS_NAME (type, | |
1429 | i)) == 0)); | |
c906108c SS |
1430 | |
1431 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
1432 | { | |
1433 | int boffset; | |
f23631e4 | 1434 | struct value *v2 = allocate_value (basetype); |
c906108c SS |
1435 | |
1436 | boffset = baseclass_offset (type, i, | |
0fd88904 | 1437 | value_contents (arg1) + offset, |
c906108c | 1438 | VALUE_ADDRESS (arg1) |
df407dfe | 1439 | + value_offset (arg1) + offset); |
c906108c | 1440 | if (boffset == -1) |
8a3fe4f8 | 1441 | error (_("virtual baseclass botch")); |
c906108c | 1442 | |
ac3eeb49 MS |
1443 | /* The virtual base class pointer might have been clobbered |
1444 | by the user program. Make sure that it still points to a | |
1445 | valid memory location. */ | |
c906108c SS |
1446 | |
1447 | boffset += offset; | |
1448 | if (boffset < 0 || boffset >= TYPE_LENGTH (type)) | |
1449 | { | |
1450 | CORE_ADDR base_addr; | |
c5aa993b | 1451 | |
ac3eeb49 MS |
1452 | base_addr = |
1453 | VALUE_ADDRESS (arg1) + value_offset (arg1) + boffset; | |
1454 | if (target_read_memory (base_addr, | |
1455 | value_contents_raw (v2), | |
c906108c | 1456 | TYPE_LENGTH (basetype)) != 0) |
8a3fe4f8 | 1457 | error (_("virtual baseclass botch")); |
c906108c SS |
1458 | VALUE_LVAL (v2) = lval_memory; |
1459 | VALUE_ADDRESS (v2) = base_addr; | |
1460 | } | |
1461 | else | |
1462 | { | |
1463 | VALUE_LVAL (v2) = VALUE_LVAL (arg1); | |
1464 | VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1); | |
65d3800a | 1465 | VALUE_FRAME_ID (v2) = VALUE_FRAME_ID (arg1); |
f5cf64a7 | 1466 | set_value_offset (v2, value_offset (arg1) + boffset); |
d69fe07e | 1467 | if (value_lazy (arg1)) |
dfa52d88 | 1468 | set_value_lazy (v2, 1); |
c906108c | 1469 | else |
990a07ab AC |
1470 | memcpy (value_contents_raw (v2), |
1471 | value_contents_raw (arg1) + boffset, | |
c906108c SS |
1472 | TYPE_LENGTH (basetype)); |
1473 | } | |
1474 | ||
1475 | if (found_baseclass) | |
1476 | return v2; | |
ac3eeb49 MS |
1477 | v = search_struct_field (name, v2, 0, |
1478 | TYPE_BASECLASS (type, i), | |
c906108c SS |
1479 | looking_for_baseclass); |
1480 | } | |
1481 | else if (found_baseclass) | |
1482 | v = value_primitive_field (arg1, offset, i, type); | |
1483 | else | |
1484 | v = search_struct_field (name, arg1, | |
ac3eeb49 MS |
1485 | offset + TYPE_BASECLASS_BITPOS (type, |
1486 | i) / 8, | |
c906108c | 1487 | basetype, looking_for_baseclass); |
c5aa993b JM |
1488 | if (v) |
1489 | return v; | |
c906108c SS |
1490 | } |
1491 | return NULL; | |
1492 | } | |
1493 | ||
ac3eeb49 MS |
1494 | /* Helper function used by value_struct_elt to recurse through |
1495 | baseclasses. Look for a field NAME in ARG1. Adjust the address of | |
1496 | ARG1 by OFFSET bytes, and search in it assuming it has (class) type | |
1497 | TYPE. | |
1498 | ||
1499 | If found, return value, else if name matched and args not return | |
1500 | (value) -1, else return NULL. */ | |
c906108c | 1501 | |
f23631e4 AC |
1502 | static struct value * |
1503 | search_struct_method (char *name, struct value **arg1p, | |
1504 | struct value **args, int offset, | |
aa1ee363 | 1505 | int *static_memfuncp, struct type *type) |
c906108c SS |
1506 | { |
1507 | int i; | |
f23631e4 | 1508 | struct value *v; |
c906108c SS |
1509 | int name_matched = 0; |
1510 | char dem_opname[64]; | |
1511 | ||
1512 | CHECK_TYPEDEF (type); | |
1513 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) | |
1514 | { | |
1515 | char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i); | |
1516 | /* FIXME! May need to check for ARM demangling here */ | |
c5aa993b JM |
1517 | if (strncmp (t_field_name, "__", 2) == 0 || |
1518 | strncmp (t_field_name, "op", 2) == 0 || | |
1519 | strncmp (t_field_name, "type", 4) == 0) | |
c906108c | 1520 | { |
c5aa993b JM |
1521 | if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI)) |
1522 | t_field_name = dem_opname; | |
1523 | else if (cplus_demangle_opname (t_field_name, dem_opname, 0)) | |
c906108c | 1524 | t_field_name = dem_opname; |
c906108c | 1525 | } |
db577aea | 1526 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
1527 | { |
1528 | int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1; | |
1529 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
c5aa993b | 1530 | name_matched = 1; |
c906108c | 1531 | |
de17c821 | 1532 | check_stub_method_group (type, i); |
c906108c | 1533 | if (j > 0 && args == 0) |
8a3fe4f8 | 1534 | error (_("cannot resolve overloaded method `%s': no arguments supplied"), name); |
acf5ed49 | 1535 | else if (j == 0 && args == 0) |
c906108c | 1536 | { |
acf5ed49 DJ |
1537 | v = value_fn_field (arg1p, f, j, type, offset); |
1538 | if (v != NULL) | |
1539 | return v; | |
c906108c | 1540 | } |
acf5ed49 DJ |
1541 | else |
1542 | while (j >= 0) | |
1543 | { | |
acf5ed49 | 1544 | if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j), |
ad2f7632 DJ |
1545 | TYPE_VARARGS (TYPE_FN_FIELD_TYPE (f, j)), |
1546 | TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (f, j)), | |
acf5ed49 DJ |
1547 | TYPE_FN_FIELD_ARGS (f, j), args)) |
1548 | { | |
1549 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) | |
ac3eeb49 MS |
1550 | return value_virtual_fn_field (arg1p, f, j, |
1551 | type, offset); | |
1552 | if (TYPE_FN_FIELD_STATIC_P (f, j) | |
1553 | && static_memfuncp) | |
acf5ed49 DJ |
1554 | *static_memfuncp = 1; |
1555 | v = value_fn_field (arg1p, f, j, type, offset); | |
1556 | if (v != NULL) | |
1557 | return v; | |
1558 | } | |
1559 | j--; | |
1560 | } | |
c906108c SS |
1561 | } |
1562 | } | |
1563 | ||
1564 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
1565 | { | |
1566 | int base_offset; | |
1567 | ||
1568 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
1569 | { | |
086280be UW |
1570 | struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i)); |
1571 | const gdb_byte *base_valaddr; | |
1572 | ||
1573 | /* The virtual base class pointer might have been | |
1574 | clobbered by the user program. Make sure that it | |
1575 | still points to a valid memory location. */ | |
1576 | ||
1577 | if (offset < 0 || offset >= TYPE_LENGTH (type)) | |
c5aa993b | 1578 | { |
086280be UW |
1579 | gdb_byte *tmp = alloca (TYPE_LENGTH (baseclass)); |
1580 | if (target_read_memory (VALUE_ADDRESS (*arg1p) | |
1581 | + value_offset (*arg1p) + offset, | |
1582 | tmp, TYPE_LENGTH (baseclass)) != 0) | |
1583 | error (_("virtual baseclass botch")); | |
1584 | base_valaddr = tmp; | |
c5aa993b JM |
1585 | } |
1586 | else | |
086280be | 1587 | base_valaddr = value_contents (*arg1p) + offset; |
c5aa993b | 1588 | |
086280be UW |
1589 | base_offset = baseclass_offset (type, i, base_valaddr, |
1590 | VALUE_ADDRESS (*arg1p) | |
1591 | + value_offset (*arg1p) + offset); | |
1592 | if (base_offset == -1) | |
1593 | error (_("virtual baseclass botch")); | |
c5aa993b | 1594 | } |
c906108c SS |
1595 | else |
1596 | { | |
1597 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 1598 | } |
c906108c SS |
1599 | v = search_struct_method (name, arg1p, args, base_offset + offset, |
1600 | static_memfuncp, TYPE_BASECLASS (type, i)); | |
f23631e4 | 1601 | if (v == (struct value *) - 1) |
c906108c SS |
1602 | { |
1603 | name_matched = 1; | |
1604 | } | |
1605 | else if (v) | |
1606 | { | |
ac3eeb49 MS |
1607 | /* FIXME-bothner: Why is this commented out? Why is it here? */ |
1608 | /* *arg1p = arg1_tmp; */ | |
c906108c | 1609 | return v; |
c5aa993b | 1610 | } |
c906108c | 1611 | } |
c5aa993b | 1612 | if (name_matched) |
f23631e4 | 1613 | return (struct value *) - 1; |
c5aa993b JM |
1614 | else |
1615 | return NULL; | |
c906108c SS |
1616 | } |
1617 | ||
1618 | /* Given *ARGP, a value of type (pointer to a)* structure/union, | |
ac3eeb49 MS |
1619 | extract the component named NAME from the ultimate target |
1620 | structure/union and return it as a value with its appropriate type. | |
c906108c SS |
1621 | ERR is used in the error message if *ARGP's type is wrong. |
1622 | ||
1623 | C++: ARGS is a list of argument types to aid in the selection of | |
1624 | an appropriate method. Also, handle derived types. | |
1625 | ||
1626 | STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location | |
1627 | where the truthvalue of whether the function that was resolved was | |
1628 | a static member function or not is stored. | |
1629 | ||
ac3eeb49 MS |
1630 | ERR is an error message to be printed in case the field is not |
1631 | found. */ | |
c906108c | 1632 | |
f23631e4 AC |
1633 | struct value * |
1634 | value_struct_elt (struct value **argp, struct value **args, | |
fba45db2 | 1635 | char *name, int *static_memfuncp, char *err) |
c906108c | 1636 | { |
52f0bd74 | 1637 | struct type *t; |
f23631e4 | 1638 | struct value *v; |
c906108c | 1639 | |
994b9211 | 1640 | *argp = coerce_array (*argp); |
c906108c | 1641 | |
df407dfe | 1642 | t = check_typedef (value_type (*argp)); |
c906108c SS |
1643 | |
1644 | /* Follow pointers until we get to a non-pointer. */ | |
1645 | ||
1646 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF) | |
1647 | { | |
1648 | *argp = value_ind (*argp); | |
1649 | /* Don't coerce fn pointer to fn and then back again! */ | |
df407dfe | 1650 | if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC) |
994b9211 | 1651 | *argp = coerce_array (*argp); |
df407dfe | 1652 | t = check_typedef (value_type (*argp)); |
c906108c SS |
1653 | } |
1654 | ||
c5aa993b | 1655 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c | 1656 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
8a3fe4f8 | 1657 | error (_("Attempt to extract a component of a value that is not a %s."), err); |
c906108c SS |
1658 | |
1659 | /* Assume it's not, unless we see that it is. */ | |
1660 | if (static_memfuncp) | |
c5aa993b | 1661 | *static_memfuncp = 0; |
c906108c SS |
1662 | |
1663 | if (!args) | |
1664 | { | |
1665 | /* if there are no arguments ...do this... */ | |
1666 | ||
ac3eeb49 MS |
1667 | /* Try as a field first, because if we succeed, there is less |
1668 | work to be done. */ | |
c906108c SS |
1669 | v = search_struct_field (name, *argp, 0, t, 0); |
1670 | if (v) | |
1671 | return v; | |
1672 | ||
1673 | /* C++: If it was not found as a data field, then try to | |
7b83ea04 | 1674 | return it as a pointer to a method. */ |
c906108c SS |
1675 | |
1676 | if (destructor_name_p (name, t)) | |
8a3fe4f8 | 1677 | error (_("Cannot get value of destructor")); |
c906108c | 1678 | |
ac3eeb49 MS |
1679 | v = search_struct_method (name, argp, args, 0, |
1680 | static_memfuncp, t); | |
c906108c | 1681 | |
f23631e4 | 1682 | if (v == (struct value *) - 1) |
55b39184 | 1683 | error (_("Cannot take address of method %s."), name); |
c906108c SS |
1684 | else if (v == 0) |
1685 | { | |
1686 | if (TYPE_NFN_FIELDS (t)) | |
8a3fe4f8 | 1687 | error (_("There is no member or method named %s."), name); |
c906108c | 1688 | else |
8a3fe4f8 | 1689 | error (_("There is no member named %s."), name); |
c906108c SS |
1690 | } |
1691 | return v; | |
1692 | } | |
1693 | ||
1694 | if (destructor_name_p (name, t)) | |
1695 | { | |
1696 | if (!args[1]) | |
1697 | { | |
1698 | /* Destructors are a special case. */ | |
1699 | int m_index, f_index; | |
1700 | ||
1701 | v = NULL; | |
1702 | if (get_destructor_fn_field (t, &m_index, &f_index)) | |
1703 | { | |
ac3eeb49 MS |
1704 | v = value_fn_field (NULL, |
1705 | TYPE_FN_FIELDLIST1 (t, m_index), | |
c906108c SS |
1706 | f_index, NULL, 0); |
1707 | } | |
1708 | if (v == NULL) | |
ac3eeb49 MS |
1709 | error (_("could not find destructor function named %s."), |
1710 | name); | |
c906108c SS |
1711 | else |
1712 | return v; | |
1713 | } | |
1714 | else | |
1715 | { | |
8a3fe4f8 | 1716 | error (_("destructor should not have any argument")); |
c906108c SS |
1717 | } |
1718 | } | |
1719 | else | |
ac3eeb49 MS |
1720 | v = search_struct_method (name, argp, args, 0, |
1721 | static_memfuncp, t); | |
7168a814 | 1722 | |
f23631e4 | 1723 | if (v == (struct value *) - 1) |
c906108c | 1724 | { |
8a3fe4f8 | 1725 | error (_("One of the arguments you tried to pass to %s could not be converted to what the function wants."), name); |
c906108c SS |
1726 | } |
1727 | else if (v == 0) | |
1728 | { | |
ac3eeb49 MS |
1729 | /* See if user tried to invoke data as function. If so, hand it |
1730 | back. If it's not callable (i.e., a pointer to function), | |
7b83ea04 | 1731 | gdb should give an error. */ |
c906108c SS |
1732 | v = search_struct_field (name, *argp, 0, t, 0); |
1733 | } | |
1734 | ||
1735 | if (!v) | |
8a3fe4f8 | 1736 | error (_("Structure has no component named %s."), name); |
c906108c SS |
1737 | return v; |
1738 | } | |
1739 | ||
ac3eeb49 MS |
1740 | /* Search through the methods of an object (and its bases) to find a |
1741 | specified method. Return the pointer to the fn_field list of | |
1742 | overloaded instances. | |
1743 | ||
1744 | Helper function for value_find_oload_list. | |
1745 | ARGP is a pointer to a pointer to a value (the object). | |
1746 | METHOD is a string containing the method name. | |
1747 | OFFSET is the offset within the value. | |
1748 | TYPE is the assumed type of the object. | |
1749 | NUM_FNS is the number of overloaded instances. | |
1750 | BASETYPE is set to the actual type of the subobject where the | |
1751 | method is found. | |
1752 | BOFFSET is the offset of the base subobject where the method is found. | |
1753 | */ | |
c906108c | 1754 | |
7a292a7a | 1755 | static struct fn_field * |
ac3eeb49 MS |
1756 | find_method_list (struct value **argp, char *method, |
1757 | int offset, struct type *type, int *num_fns, | |
fba45db2 | 1758 | struct type **basetype, int *boffset) |
c906108c SS |
1759 | { |
1760 | int i; | |
c5aa993b | 1761 | struct fn_field *f; |
c906108c SS |
1762 | CHECK_TYPEDEF (type); |
1763 | ||
1764 | *num_fns = 0; | |
1765 | ||
ac3eeb49 | 1766 | /* First check in object itself. */ |
c5aa993b | 1767 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) |
c906108c | 1768 | { |
ac3eeb49 | 1769 | /* pai: FIXME What about operators and type conversions? */ |
c5aa993b | 1770 | char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i); |
db577aea | 1771 | if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0)) |
c5aa993b | 1772 | { |
4a1970e4 DJ |
1773 | int len = TYPE_FN_FIELDLIST_LENGTH (type, i); |
1774 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
4a1970e4 DJ |
1775 | |
1776 | *num_fns = len; | |
c5aa993b JM |
1777 | *basetype = type; |
1778 | *boffset = offset; | |
4a1970e4 | 1779 | |
de17c821 DJ |
1780 | /* Resolve any stub methods. */ |
1781 | check_stub_method_group (type, i); | |
4a1970e4 DJ |
1782 | |
1783 | return f; | |
c5aa993b JM |
1784 | } |
1785 | } | |
1786 | ||
ac3eeb49 | 1787 | /* Not found in object, check in base subobjects. */ |
c906108c SS |
1788 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) |
1789 | { | |
1790 | int base_offset; | |
1791 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
1792 | { | |
086280be UW |
1793 | base_offset = value_offset (*argp) + offset; |
1794 | base_offset = baseclass_offset (type, i, | |
1795 | value_contents (*argp) + base_offset, | |
1796 | VALUE_ADDRESS (*argp) + base_offset); | |
1797 | if (base_offset == -1) | |
1798 | error (_("virtual baseclass botch")); | |
c5aa993b | 1799 | } |
ac3eeb49 MS |
1800 | else /* Non-virtual base, simply use bit position from debug |
1801 | info. */ | |
c906108c SS |
1802 | { |
1803 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 1804 | } |
c906108c | 1805 | f = find_method_list (argp, method, base_offset + offset, |
ac3eeb49 MS |
1806 | TYPE_BASECLASS (type, i), num_fns, |
1807 | basetype, boffset); | |
c906108c | 1808 | if (f) |
c5aa993b | 1809 | return f; |
c906108c | 1810 | } |
c5aa993b | 1811 | return NULL; |
c906108c SS |
1812 | } |
1813 | ||
1814 | /* Return the list of overloaded methods of a specified name. | |
ac3eeb49 MS |
1815 | |
1816 | ARGP is a pointer to a pointer to a value (the object). | |
1817 | METHOD is the method name. | |
1818 | OFFSET is the offset within the value contents. | |
1819 | NUM_FNS is the number of overloaded instances. | |
1820 | BASETYPE is set to the type of the base subobject that defines the | |
1821 | method. | |
1822 | BOFFSET is the offset of the base subobject which defines the method. | |
1823 | */ | |
c906108c SS |
1824 | |
1825 | struct fn_field * | |
ac3eeb49 MS |
1826 | value_find_oload_method_list (struct value **argp, char *method, |
1827 | int offset, int *num_fns, | |
1828 | struct type **basetype, int *boffset) | |
c906108c | 1829 | { |
c5aa993b | 1830 | struct type *t; |
c906108c | 1831 | |
df407dfe | 1832 | t = check_typedef (value_type (*argp)); |
c906108c | 1833 | |
ac3eeb49 | 1834 | /* Code snarfed from value_struct_elt. */ |
c906108c SS |
1835 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF) |
1836 | { | |
1837 | *argp = value_ind (*argp); | |
1838 | /* Don't coerce fn pointer to fn and then back again! */ | |
df407dfe | 1839 | if (TYPE_CODE (value_type (*argp)) != TYPE_CODE_FUNC) |
994b9211 | 1840 | *argp = coerce_array (*argp); |
df407dfe | 1841 | t = check_typedef (value_type (*argp)); |
c906108c | 1842 | } |
c5aa993b | 1843 | |
c5aa993b JM |
1844 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
1845 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
8a3fe4f8 | 1846 | error (_("Attempt to extract a component of a value that is not a struct or union")); |
c5aa993b | 1847 | |
ac3eeb49 MS |
1848 | return find_method_list (argp, method, 0, t, num_fns, |
1849 | basetype, boffset); | |
c906108c SS |
1850 | } |
1851 | ||
1852 | /* Given an array of argument types (ARGTYPES) (which includes an | |
1853 | entry for "this" in the case of C++ methods), the number of | |
1854 | arguments NARGS, the NAME of a function whether it's a method or | |
1855 | not (METHOD), and the degree of laxness (LAX) in conforming to | |
1856 | overload resolution rules in ANSI C++, find the best function that | |
1857 | matches on the argument types according to the overload resolution | |
1858 | rules. | |
1859 | ||
1860 | In the case of class methods, the parameter OBJ is an object value | |
1861 | in which to search for overloaded methods. | |
1862 | ||
1863 | In the case of non-method functions, the parameter FSYM is a symbol | |
1864 | corresponding to one of the overloaded functions. | |
1865 | ||
1866 | Return value is an integer: 0 -> good match, 10 -> debugger applied | |
1867 | non-standard coercions, 100 -> incompatible. | |
1868 | ||
1869 | If a method is being searched for, VALP will hold the value. | |
ac3eeb49 MS |
1870 | If a non-method is being searched for, SYMP will hold the symbol |
1871 | for it. | |
c906108c SS |
1872 | |
1873 | If a method is being searched for, and it is a static method, | |
1874 | then STATICP will point to a non-zero value. | |
1875 | ||
1876 | Note: This function does *not* check the value of | |
1877 | overload_resolution. Caller must check it to see whether overload | |
1878 | resolution is permitted. | |
ac3eeb49 | 1879 | */ |
c906108c SS |
1880 | |
1881 | int | |
ac3eeb49 MS |
1882 | find_overload_match (struct type **arg_types, int nargs, |
1883 | char *name, int method, int lax, | |
1884 | struct value **objp, struct symbol *fsym, | |
1885 | struct value **valp, struct symbol **symp, | |
1886 | int *staticp) | |
c906108c | 1887 | { |
7f8c9282 | 1888 | struct value *obj = (objp ? *objp : NULL); |
ac3eeb49 MS |
1889 | /* Index of best overloaded function. */ |
1890 | int oload_champ; | |
1891 | /* The measure for the current best match. */ | |
1892 | struct badness_vector *oload_champ_bv = NULL; | |
f23631e4 | 1893 | struct value *temp = obj; |
ac3eeb49 MS |
1894 | /* For methods, the list of overloaded methods. */ |
1895 | struct fn_field *fns_ptr = NULL; | |
1896 | /* For non-methods, the list of overloaded function symbols. */ | |
1897 | struct symbol **oload_syms = NULL; | |
1898 | /* Number of overloaded instances being considered. */ | |
1899 | int num_fns = 0; | |
c5aa993b | 1900 | struct type *basetype = NULL; |
c906108c | 1901 | int boffset; |
52f0bd74 | 1902 | int ix; |
4a1970e4 | 1903 | int static_offset; |
8d577d32 | 1904 | struct cleanup *old_cleanups = NULL; |
c906108c | 1905 | |
8d577d32 | 1906 | const char *obj_type_name = NULL; |
c5aa993b | 1907 | char *func_name = NULL; |
8d577d32 | 1908 | enum oload_classification match_quality; |
c906108c | 1909 | |
ac3eeb49 | 1910 | /* Get the list of overloaded methods or functions. */ |
c906108c SS |
1911 | if (method) |
1912 | { | |
a2ca50ae | 1913 | gdb_assert (obj); |
df407dfe | 1914 | obj_type_name = TYPE_NAME (value_type (obj)); |
c906108c | 1915 | /* Hack: evaluate_subexp_standard often passes in a pointer |
ac3eeb49 MS |
1916 | value rather than the object itself, so try again. */ |
1917 | if ((!obj_type_name || !*obj_type_name) | |
1918 | && (TYPE_CODE (value_type (obj)) == TYPE_CODE_PTR)) | |
df407dfe | 1919 | obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (value_type (obj))); |
c906108c | 1920 | |
ac3eeb49 MS |
1921 | fns_ptr = value_find_oload_method_list (&temp, name, |
1922 | 0, &num_fns, | |
c5aa993b | 1923 | &basetype, &boffset); |
c906108c | 1924 | if (!fns_ptr || !num_fns) |
8a3fe4f8 | 1925 | error (_("Couldn't find method %s%s%s"), |
c5aa993b JM |
1926 | obj_type_name, |
1927 | (obj_type_name && *obj_type_name) ? "::" : "", | |
1928 | name); | |
4a1970e4 | 1929 | /* If we are dealing with stub method types, they should have |
ac3eeb49 MS |
1930 | been resolved by find_method_list via |
1931 | value_find_oload_method_list above. */ | |
4a1970e4 | 1932 | gdb_assert (TYPE_DOMAIN_TYPE (fns_ptr[0].type) != NULL); |
ac3eeb49 MS |
1933 | oload_champ = find_oload_champ (arg_types, nargs, method, |
1934 | num_fns, fns_ptr, | |
1935 | oload_syms, &oload_champ_bv); | |
c906108c SS |
1936 | } |
1937 | else | |
1938 | { | |
8d577d32 | 1939 | const char *qualified_name = SYMBOL_CPLUS_DEMANGLED_NAME (fsym); |
c906108c | 1940 | |
d9639e13 DJ |
1941 | /* If we have a C++ name, try to extract just the function |
1942 | part. */ | |
1943 | if (qualified_name) | |
1944 | func_name = cp_func_name (qualified_name); | |
1945 | ||
1946 | /* If there was no C++ name, this must be a C-style function. | |
1947 | Just return the same symbol. Do the same if cp_func_name | |
1948 | fails for some reason. */ | |
8d577d32 | 1949 | if (func_name == NULL) |
7b83ea04 | 1950 | { |
917317f4 | 1951 | *symp = fsym; |
7b83ea04 AC |
1952 | return 0; |
1953 | } | |
917317f4 | 1954 | |
8d577d32 DC |
1955 | old_cleanups = make_cleanup (xfree, func_name); |
1956 | make_cleanup (xfree, oload_syms); | |
1957 | make_cleanup (xfree, oload_champ_bv); | |
1958 | ||
1959 | oload_champ = find_oload_champ_namespace (arg_types, nargs, | |
1960 | func_name, | |
1961 | qualified_name, | |
1962 | &oload_syms, | |
1963 | &oload_champ_bv); | |
1964 | } | |
1965 | ||
1966 | /* Check how bad the best match is. */ | |
1967 | ||
ac3eeb49 MS |
1968 | match_quality = |
1969 | classify_oload_match (oload_champ_bv, nargs, | |
1970 | oload_method_static (method, fns_ptr, | |
1971 | oload_champ)); | |
8d577d32 DC |
1972 | |
1973 | if (match_quality == INCOMPATIBLE) | |
1974 | { | |
1975 | if (method) | |
8a3fe4f8 | 1976 | error (_("Cannot resolve method %s%s%s to any overloaded instance"), |
8d577d32 DC |
1977 | obj_type_name, |
1978 | (obj_type_name && *obj_type_name) ? "::" : "", | |
1979 | name); | |
1980 | else | |
8a3fe4f8 | 1981 | error (_("Cannot resolve function %s to any overloaded instance"), |
8d577d32 DC |
1982 | func_name); |
1983 | } | |
1984 | else if (match_quality == NON_STANDARD) | |
1985 | { | |
1986 | if (method) | |
8a3fe4f8 | 1987 | warning (_("Using non-standard conversion to match method %s%s%s to supplied arguments"), |
8d577d32 DC |
1988 | obj_type_name, |
1989 | (obj_type_name && *obj_type_name) ? "::" : "", | |
1990 | name); | |
1991 | else | |
8a3fe4f8 | 1992 | warning (_("Using non-standard conversion to match function %s to supplied arguments"), |
8d577d32 DC |
1993 | func_name); |
1994 | } | |
1995 | ||
1996 | if (method) | |
1997 | { | |
1998 | if (staticp != NULL) | |
1999 | *staticp = oload_method_static (method, fns_ptr, oload_champ); | |
2000 | if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ)) | |
ac3eeb49 MS |
2001 | *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, |
2002 | basetype, boffset); | |
8d577d32 | 2003 | else |
ac3eeb49 MS |
2004 | *valp = value_fn_field (&temp, fns_ptr, oload_champ, |
2005 | basetype, boffset); | |
8d577d32 DC |
2006 | } |
2007 | else | |
2008 | { | |
2009 | *symp = oload_syms[oload_champ]; | |
2010 | } | |
2011 | ||
2012 | if (objp) | |
2013 | { | |
df407dfe AC |
2014 | if (TYPE_CODE (value_type (temp)) != TYPE_CODE_PTR |
2015 | && TYPE_CODE (value_type (*objp)) == TYPE_CODE_PTR) | |
8d577d32 DC |
2016 | { |
2017 | temp = value_addr (temp); | |
2018 | } | |
2019 | *objp = temp; | |
2020 | } | |
2021 | if (old_cleanups != NULL) | |
2022 | do_cleanups (old_cleanups); | |
2023 | ||
2024 | switch (match_quality) | |
2025 | { | |
2026 | case INCOMPATIBLE: | |
2027 | return 100; | |
2028 | case NON_STANDARD: | |
2029 | return 10; | |
2030 | default: /* STANDARD */ | |
2031 | return 0; | |
2032 | } | |
2033 | } | |
2034 | ||
2035 | /* Find the best overload match, searching for FUNC_NAME in namespaces | |
2036 | contained in QUALIFIED_NAME until it either finds a good match or | |
2037 | runs out of namespaces. It stores the overloaded functions in | |
2038 | *OLOAD_SYMS, and the badness vector in *OLOAD_CHAMP_BV. The | |
2039 | calling function is responsible for freeing *OLOAD_SYMS and | |
2040 | *OLOAD_CHAMP_BV. */ | |
2041 | ||
2042 | static int | |
2043 | find_oload_champ_namespace (struct type **arg_types, int nargs, | |
2044 | const char *func_name, | |
2045 | const char *qualified_name, | |
2046 | struct symbol ***oload_syms, | |
2047 | struct badness_vector **oload_champ_bv) | |
2048 | { | |
2049 | int oload_champ; | |
2050 | ||
2051 | find_oload_champ_namespace_loop (arg_types, nargs, | |
2052 | func_name, | |
2053 | qualified_name, 0, | |
2054 | oload_syms, oload_champ_bv, | |
2055 | &oload_champ); | |
2056 | ||
2057 | return oload_champ; | |
2058 | } | |
2059 | ||
2060 | /* Helper function for find_oload_champ_namespace; NAMESPACE_LEN is | |
2061 | how deep we've looked for namespaces, and the champ is stored in | |
2062 | OLOAD_CHAMP. The return value is 1 if the champ is a good one, 0 | |
2063 | if it isn't. | |
2064 | ||
2065 | It is the caller's responsibility to free *OLOAD_SYMS and | |
2066 | *OLOAD_CHAMP_BV. */ | |
2067 | ||
2068 | static int | |
2069 | find_oload_champ_namespace_loop (struct type **arg_types, int nargs, | |
2070 | const char *func_name, | |
2071 | const char *qualified_name, | |
2072 | int namespace_len, | |
2073 | struct symbol ***oload_syms, | |
2074 | struct badness_vector **oload_champ_bv, | |
2075 | int *oload_champ) | |
2076 | { | |
2077 | int next_namespace_len = namespace_len; | |
2078 | int searched_deeper = 0; | |
2079 | int num_fns = 0; | |
2080 | struct cleanup *old_cleanups; | |
2081 | int new_oload_champ; | |
2082 | struct symbol **new_oload_syms; | |
2083 | struct badness_vector *new_oload_champ_bv; | |
2084 | char *new_namespace; | |
2085 | ||
2086 | if (next_namespace_len != 0) | |
2087 | { | |
2088 | gdb_assert (qualified_name[next_namespace_len] == ':'); | |
2089 | next_namespace_len += 2; | |
c906108c | 2090 | } |
ac3eeb49 MS |
2091 | next_namespace_len += |
2092 | cp_find_first_component (qualified_name + next_namespace_len); | |
8d577d32 DC |
2093 | |
2094 | /* Initialize these to values that can safely be xfree'd. */ | |
2095 | *oload_syms = NULL; | |
2096 | *oload_champ_bv = NULL; | |
c5aa993b | 2097 | |
ac3eeb49 MS |
2098 | /* First, see if we have a deeper namespace we can search in. |
2099 | If we get a good match there, use it. */ | |
8d577d32 DC |
2100 | |
2101 | if (qualified_name[next_namespace_len] == ':') | |
2102 | { | |
2103 | searched_deeper = 1; | |
2104 | ||
2105 | if (find_oload_champ_namespace_loop (arg_types, nargs, | |
2106 | func_name, qualified_name, | |
2107 | next_namespace_len, | |
2108 | oload_syms, oload_champ_bv, | |
2109 | oload_champ)) | |
2110 | { | |
2111 | return 1; | |
2112 | } | |
2113 | }; | |
2114 | ||
2115 | /* If we reach here, either we're in the deepest namespace or we | |
2116 | didn't find a good match in a deeper namespace. But, in the | |
2117 | latter case, we still have a bad match in a deeper namespace; | |
2118 | note that we might not find any match at all in the current | |
2119 | namespace. (There's always a match in the deepest namespace, | |
2120 | because this overload mechanism only gets called if there's a | |
2121 | function symbol to start off with.) */ | |
2122 | ||
2123 | old_cleanups = make_cleanup (xfree, *oload_syms); | |
2124 | old_cleanups = make_cleanup (xfree, *oload_champ_bv); | |
2125 | new_namespace = alloca (namespace_len + 1); | |
2126 | strncpy (new_namespace, qualified_name, namespace_len); | |
2127 | new_namespace[namespace_len] = '\0'; | |
2128 | new_oload_syms = make_symbol_overload_list (func_name, | |
2129 | new_namespace); | |
2130 | while (new_oload_syms[num_fns]) | |
2131 | ++num_fns; | |
2132 | ||
2133 | new_oload_champ = find_oload_champ (arg_types, nargs, 0, num_fns, | |
2134 | NULL, new_oload_syms, | |
2135 | &new_oload_champ_bv); | |
2136 | ||
2137 | /* Case 1: We found a good match. Free earlier matches (if any), | |
2138 | and return it. Case 2: We didn't find a good match, but we're | |
2139 | not the deepest function. Then go with the bad match that the | |
2140 | deeper function found. Case 3: We found a bad match, and we're | |
2141 | the deepest function. Then return what we found, even though | |
2142 | it's a bad match. */ | |
2143 | ||
2144 | if (new_oload_champ != -1 | |
2145 | && classify_oload_match (new_oload_champ_bv, nargs, 0) == STANDARD) | |
2146 | { | |
2147 | *oload_syms = new_oload_syms; | |
2148 | *oload_champ = new_oload_champ; | |
2149 | *oload_champ_bv = new_oload_champ_bv; | |
2150 | do_cleanups (old_cleanups); | |
2151 | return 1; | |
2152 | } | |
2153 | else if (searched_deeper) | |
2154 | { | |
2155 | xfree (new_oload_syms); | |
2156 | xfree (new_oload_champ_bv); | |
2157 | discard_cleanups (old_cleanups); | |
2158 | return 0; | |
2159 | } | |
2160 | else | |
2161 | { | |
2162 | gdb_assert (new_oload_champ != -1); | |
2163 | *oload_syms = new_oload_syms; | |
2164 | *oload_champ = new_oload_champ; | |
2165 | *oload_champ_bv = new_oload_champ_bv; | |
2166 | discard_cleanups (old_cleanups); | |
2167 | return 0; | |
2168 | } | |
2169 | } | |
2170 | ||
2171 | /* Look for a function to take NARGS args of types ARG_TYPES. Find | |
2172 | the best match from among the overloaded methods or functions | |
2173 | (depending on METHOD) given by FNS_PTR or OLOAD_SYMS, respectively. | |
2174 | The number of methods/functions in the list is given by NUM_FNS. | |
2175 | Return the index of the best match; store an indication of the | |
2176 | quality of the match in OLOAD_CHAMP_BV. | |
2177 | ||
2178 | It is the caller's responsibility to free *OLOAD_CHAMP_BV. */ | |
2179 | ||
2180 | static int | |
2181 | find_oload_champ (struct type **arg_types, int nargs, int method, | |
2182 | int num_fns, struct fn_field *fns_ptr, | |
2183 | struct symbol **oload_syms, | |
2184 | struct badness_vector **oload_champ_bv) | |
2185 | { | |
2186 | int ix; | |
ac3eeb49 MS |
2187 | /* A measure of how good an overloaded instance is. */ |
2188 | struct badness_vector *bv; | |
2189 | /* Index of best overloaded function. */ | |
2190 | int oload_champ = -1; | |
2191 | /* Current ambiguity state for overload resolution. */ | |
2192 | int oload_ambiguous = 0; | |
2193 | /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs. */ | |
8d577d32 DC |
2194 | |
2195 | *oload_champ_bv = NULL; | |
c906108c | 2196 | |
ac3eeb49 | 2197 | /* Consider each candidate in turn. */ |
c906108c SS |
2198 | for (ix = 0; ix < num_fns; ix++) |
2199 | { | |
8d577d32 DC |
2200 | int jj; |
2201 | int static_offset = oload_method_static (method, fns_ptr, ix); | |
2202 | int nparms; | |
2203 | struct type **parm_types; | |
2204 | ||
db577aea AC |
2205 | if (method) |
2206 | { | |
ad2f7632 | 2207 | nparms = TYPE_NFIELDS (TYPE_FN_FIELD_TYPE (fns_ptr, ix)); |
db577aea AC |
2208 | } |
2209 | else | |
2210 | { | |
ac3eeb49 MS |
2211 | /* If it's not a method, this is the proper place. */ |
2212 | nparms = TYPE_NFIELDS (SYMBOL_TYPE (oload_syms[ix])); | |
db577aea | 2213 | } |
c906108c | 2214 | |
ac3eeb49 MS |
2215 | /* Prepare array of parameter types. */ |
2216 | parm_types = (struct type **) | |
2217 | xmalloc (nparms * (sizeof (struct type *))); | |
c906108c | 2218 | for (jj = 0; jj < nparms; jj++) |
db577aea | 2219 | parm_types[jj] = (method |
ad2f7632 | 2220 | ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj].type) |
ac3eeb49 MS |
2221 | : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), |
2222 | jj)); | |
c906108c | 2223 | |
ac3eeb49 MS |
2224 | /* Compare parameter types to supplied argument types. Skip |
2225 | THIS for static methods. */ | |
2226 | bv = rank_function (parm_types, nparms, | |
2227 | arg_types + static_offset, | |
4a1970e4 | 2228 | nargs - static_offset); |
c5aa993b | 2229 | |
8d577d32 | 2230 | if (!*oload_champ_bv) |
c5aa993b | 2231 | { |
8d577d32 | 2232 | *oload_champ_bv = bv; |
c5aa993b | 2233 | oload_champ = 0; |
c5aa993b | 2234 | } |
ac3eeb49 MS |
2235 | else /* See whether current candidate is better or worse than |
2236 | previous best. */ | |
8d577d32 | 2237 | switch (compare_badness (bv, *oload_champ_bv)) |
c5aa993b | 2238 | { |
ac3eeb49 MS |
2239 | case 0: /* Top two contenders are equally good. */ |
2240 | oload_ambiguous = 1; | |
c5aa993b | 2241 | break; |
ac3eeb49 MS |
2242 | case 1: /* Incomparable top contenders. */ |
2243 | oload_ambiguous = 2; | |
c5aa993b | 2244 | break; |
ac3eeb49 MS |
2245 | case 2: /* New champion, record details. */ |
2246 | *oload_champ_bv = bv; | |
c5aa993b JM |
2247 | oload_ambiguous = 0; |
2248 | oload_champ = ix; | |
c5aa993b JM |
2249 | break; |
2250 | case 3: | |
2251 | default: | |
2252 | break; | |
2253 | } | |
b8c9b27d | 2254 | xfree (parm_types); |
6b1ba9a0 ND |
2255 | if (overload_debug) |
2256 | { | |
2257 | if (method) | |
ac3eeb49 MS |
2258 | fprintf_filtered (gdb_stderr, |
2259 | "Overloaded method instance %s, # of parms %d\n", | |
2260 | fns_ptr[ix].physname, nparms); | |
6b1ba9a0 | 2261 | else |
ac3eeb49 MS |
2262 | fprintf_filtered (gdb_stderr, |
2263 | "Overloaded function instance %s # of parms %d\n", | |
2264 | SYMBOL_DEMANGLED_NAME (oload_syms[ix]), | |
2265 | nparms); | |
4a1970e4 | 2266 | for (jj = 0; jj < nargs - static_offset; jj++) |
ac3eeb49 MS |
2267 | fprintf_filtered (gdb_stderr, |
2268 | "...Badness @ %d : %d\n", | |
2269 | jj, bv->rank[jj]); | |
2270 | fprintf_filtered (gdb_stderr, | |
2271 | "Overload resolution champion is %d, ambiguous? %d\n", | |
2272 | oload_champ, oload_ambiguous); | |
6b1ba9a0 | 2273 | } |
c906108c SS |
2274 | } |
2275 | ||
8d577d32 DC |
2276 | return oload_champ; |
2277 | } | |
6b1ba9a0 | 2278 | |
8d577d32 DC |
2279 | /* Return 1 if we're looking at a static method, 0 if we're looking at |
2280 | a non-static method or a function that isn't a method. */ | |
c906108c | 2281 | |
8d577d32 DC |
2282 | static int |
2283 | oload_method_static (int method, struct fn_field *fns_ptr, int index) | |
2284 | { | |
2285 | if (method && TYPE_FN_FIELD_STATIC_P (fns_ptr, index)) | |
2286 | return 1; | |
c906108c | 2287 | else |
8d577d32 DC |
2288 | return 0; |
2289 | } | |
c906108c | 2290 | |
8d577d32 DC |
2291 | /* Check how good an overload match OLOAD_CHAMP_BV represents. */ |
2292 | ||
2293 | static enum oload_classification | |
2294 | classify_oload_match (struct badness_vector *oload_champ_bv, | |
2295 | int nargs, | |
2296 | int static_offset) | |
2297 | { | |
2298 | int ix; | |
2299 | ||
2300 | for (ix = 1; ix <= nargs - static_offset; ix++) | |
7f8c9282 | 2301 | { |
8d577d32 | 2302 | if (oload_champ_bv->rank[ix] >= 100) |
ac3eeb49 | 2303 | return INCOMPATIBLE; /* Truly mismatched types. */ |
8d577d32 | 2304 | else if (oload_champ_bv->rank[ix] >= 10) |
ac3eeb49 MS |
2305 | return NON_STANDARD; /* Non-standard type conversions |
2306 | needed. */ | |
7f8c9282 | 2307 | } |
02f0d45d | 2308 | |
8d577d32 | 2309 | return STANDARD; /* Only standard conversions needed. */ |
c906108c SS |
2310 | } |
2311 | ||
ac3eeb49 MS |
2312 | /* C++: return 1 is NAME is a legitimate name for the destructor of |
2313 | type TYPE. If TYPE does not have a destructor, or if NAME is | |
2314 | inappropriate for TYPE, an error is signaled. */ | |
c906108c | 2315 | int |
fba45db2 | 2316 | destructor_name_p (const char *name, const struct type *type) |
c906108c | 2317 | { |
ac3eeb49 | 2318 | /* Destructors are a special case. */ |
c906108c SS |
2319 | |
2320 | if (name[0] == '~') | |
2321 | { | |
2322 | char *dname = type_name_no_tag (type); | |
2323 | char *cp = strchr (dname, '<'); | |
2324 | unsigned int len; | |
2325 | ||
2326 | /* Do not compare the template part for template classes. */ | |
2327 | if (cp == NULL) | |
2328 | len = strlen (dname); | |
2329 | else | |
2330 | len = cp - dname; | |
bf896cb0 | 2331 | if (strlen (name + 1) != len || strncmp (dname, name + 1, len) != 0) |
8a3fe4f8 | 2332 | error (_("name of destructor must equal name of class")); |
c906108c SS |
2333 | else |
2334 | return 1; | |
2335 | } | |
2336 | return 0; | |
2337 | } | |
2338 | ||
2b2d9e11 | 2339 | /* Given TYPE, a structure/union, |
ac3eeb49 MS |
2340 | return 1 if the component named NAME from the ultimate target |
2341 | structure/union is defined, otherwise, return 0. */ | |
c906108c | 2342 | |
2b2d9e11 VP |
2343 | int |
2344 | check_field (struct type *type, const char *name) | |
c906108c | 2345 | { |
52f0bd74 | 2346 | int i; |
c906108c SS |
2347 | |
2348 | for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--) | |
2349 | { | |
2350 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
db577aea | 2351 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2352 | return 1; |
2353 | } | |
2354 | ||
ac3eeb49 MS |
2355 | /* C++: If it was not found as a data field, then try to return it |
2356 | as a pointer to a method. */ | |
c906108c SS |
2357 | |
2358 | /* Destructors are a special case. */ | |
2359 | if (destructor_name_p (name, type)) | |
2360 | { | |
2361 | int m_index, f_index; | |
2362 | ||
2363 | return get_destructor_fn_field (type, &m_index, &f_index); | |
2364 | } | |
2365 | ||
2366 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i) | |
2367 | { | |
db577aea | 2368 | if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0) |
c906108c SS |
2369 | return 1; |
2370 | } | |
2371 | ||
2372 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
2b2d9e11 | 2373 | if (check_field (TYPE_BASECLASS (type, i), name)) |
c906108c | 2374 | return 1; |
c5aa993b | 2375 | |
c906108c SS |
2376 | return 0; |
2377 | } | |
2378 | ||
79c2c32d | 2379 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
0d5de010 DJ |
2380 | return the appropriate member (or the address of the member, if |
2381 | WANT_ADDRESS). This function is used to resolve user expressions | |
2382 | of the form "DOMAIN::NAME". For more details on what happens, see | |
2383 | the comment before value_struct_elt_for_reference. */ | |
79c2c32d DC |
2384 | |
2385 | struct value * | |
2386 | value_aggregate_elt (struct type *curtype, | |
0d5de010 | 2387 | char *name, int want_address, |
79c2c32d DC |
2388 | enum noside noside) |
2389 | { | |
2390 | switch (TYPE_CODE (curtype)) | |
2391 | { | |
2392 | case TYPE_CODE_STRUCT: | |
2393 | case TYPE_CODE_UNION: | |
ac3eeb49 MS |
2394 | return value_struct_elt_for_reference (curtype, 0, curtype, |
2395 | name, NULL, | |
0d5de010 | 2396 | want_address, noside); |
79c2c32d | 2397 | case TYPE_CODE_NAMESPACE: |
ac3eeb49 MS |
2398 | return value_namespace_elt (curtype, name, |
2399 | want_address, noside); | |
79c2c32d DC |
2400 | default: |
2401 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 2402 | _("non-aggregate type in value_aggregate_elt")); |
79c2c32d DC |
2403 | } |
2404 | } | |
2405 | ||
c906108c | 2406 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, |
ac3eeb49 MS |
2407 | return the address of this member as a "pointer to member" type. |
2408 | If INTYPE is non-null, then it will be the type of the member we | |
2409 | are looking for. This will help us resolve "pointers to member | |
2410 | functions". This function is used to resolve user expressions of | |
2411 | the form "DOMAIN::NAME". */ | |
c906108c | 2412 | |
63d06c5c | 2413 | static struct value * |
fba45db2 KB |
2414 | value_struct_elt_for_reference (struct type *domain, int offset, |
2415 | struct type *curtype, char *name, | |
ac3eeb49 MS |
2416 | struct type *intype, |
2417 | int want_address, | |
63d06c5c | 2418 | enum noside noside) |
c906108c | 2419 | { |
52f0bd74 AC |
2420 | struct type *t = curtype; |
2421 | int i; | |
0d5de010 | 2422 | struct value *v, *result; |
c906108c | 2423 | |
c5aa993b | 2424 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c | 2425 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
8a3fe4f8 | 2426 | error (_("Internal error: non-aggregate type to value_struct_elt_for_reference")); |
c906108c SS |
2427 | |
2428 | for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--) | |
2429 | { | |
2430 | char *t_field_name = TYPE_FIELD_NAME (t, i); | |
c5aa993b | 2431 | |
6314a349 | 2432 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c SS |
2433 | { |
2434 | if (TYPE_FIELD_STATIC (t, i)) | |
2435 | { | |
2436 | v = value_static_field (t, i); | |
2437 | if (v == NULL) | |
8a3fe4f8 | 2438 | error (_("static field %s has been optimized out"), |
c906108c | 2439 | name); |
0d5de010 DJ |
2440 | if (want_address) |
2441 | v = value_addr (v); | |
c906108c SS |
2442 | return v; |
2443 | } | |
2444 | if (TYPE_FIELD_PACKED (t, i)) | |
8a3fe4f8 | 2445 | error (_("pointers to bitfield members not allowed")); |
c5aa993b | 2446 | |
0d5de010 DJ |
2447 | if (want_address) |
2448 | return value_from_longest | |
2449 | (lookup_memberptr_type (TYPE_FIELD_TYPE (t, i), domain), | |
2450 | offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3)); | |
2451 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2452 | return allocate_value (TYPE_FIELD_TYPE (t, i)); | |
2453 | else | |
2454 | error (_("Cannot reference non-static field \"%s\""), name); | |
c906108c SS |
2455 | } |
2456 | } | |
2457 | ||
ac3eeb49 MS |
2458 | /* C++: If it was not found as a data field, then try to return it |
2459 | as a pointer to a method. */ | |
c906108c SS |
2460 | |
2461 | /* Destructors are a special case. */ | |
2462 | if (destructor_name_p (name, t)) | |
2463 | { | |
8a3fe4f8 | 2464 | error (_("member pointers to destructors not implemented yet")); |
c906108c SS |
2465 | } |
2466 | ||
2467 | /* Perform all necessary dereferencing. */ | |
2468 | while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR) | |
2469 | intype = TYPE_TARGET_TYPE (intype); | |
2470 | ||
2471 | for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i) | |
2472 | { | |
2473 | char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i); | |
2474 | char dem_opname[64]; | |
2475 | ||
ac3eeb49 MS |
2476 | if (strncmp (t_field_name, "__", 2) == 0 |
2477 | || strncmp (t_field_name, "op", 2) == 0 | |
2478 | || strncmp (t_field_name, "type", 4) == 0) | |
c906108c | 2479 | { |
ac3eeb49 MS |
2480 | if (cplus_demangle_opname (t_field_name, |
2481 | dem_opname, DMGL_ANSI)) | |
c5aa993b | 2482 | t_field_name = dem_opname; |
ac3eeb49 MS |
2483 | else if (cplus_demangle_opname (t_field_name, |
2484 | dem_opname, 0)) | |
c906108c | 2485 | t_field_name = dem_opname; |
c906108c | 2486 | } |
6314a349 | 2487 | if (t_field_name && strcmp (t_field_name, name) == 0) |
c906108c SS |
2488 | { |
2489 | int j = TYPE_FN_FIELDLIST_LENGTH (t, i); | |
2490 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i); | |
c5aa993b | 2491 | |
de17c821 DJ |
2492 | check_stub_method_group (t, i); |
2493 | ||
c906108c | 2494 | if (intype == 0 && j > 1) |
8a3fe4f8 | 2495 | error (_("non-unique member `%s' requires type instantiation"), name); |
c906108c SS |
2496 | if (intype) |
2497 | { | |
2498 | while (j--) | |
2499 | if (TYPE_FN_FIELD_TYPE (f, j) == intype) | |
2500 | break; | |
2501 | if (j < 0) | |
8a3fe4f8 | 2502 | error (_("no member function matches that type instantiation")); |
c906108c SS |
2503 | } |
2504 | else | |
2505 | j = 0; | |
c5aa993b | 2506 | |
0d5de010 DJ |
2507 | if (TYPE_FN_FIELD_STATIC_P (f, j)) |
2508 | { | |
ac3eeb49 MS |
2509 | struct symbol *s = |
2510 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
2511 | 0, VAR_DOMAIN, 0, NULL); | |
0d5de010 DJ |
2512 | if (s == NULL) |
2513 | return NULL; | |
2514 | ||
2515 | if (want_address) | |
2516 | return value_addr (read_var_value (s, 0)); | |
2517 | else | |
2518 | return read_var_value (s, 0); | |
2519 | } | |
2520 | ||
c906108c SS |
2521 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) |
2522 | { | |
0d5de010 DJ |
2523 | if (want_address) |
2524 | { | |
2525 | result = allocate_value | |
2526 | (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); | |
2527 | cplus_make_method_ptr (value_contents_writeable (result), | |
2528 | TYPE_FN_FIELD_VOFFSET (f, j), 1); | |
2529 | } | |
2530 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
2531 | return allocate_value (TYPE_FN_FIELD_TYPE (f, j)); | |
2532 | else | |
2533 | error (_("Cannot reference virtual member function \"%s\""), | |
2534 | name); | |
c906108c SS |
2535 | } |
2536 | else | |
2537 | { | |
ac3eeb49 MS |
2538 | struct symbol *s = |
2539 | lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
2540 | 0, VAR_DOMAIN, 0, NULL); | |
c906108c | 2541 | if (s == NULL) |
0d5de010 DJ |
2542 | return NULL; |
2543 | ||
2544 | v = read_var_value (s, 0); | |
2545 | if (!want_address) | |
2546 | result = v; | |
c906108c SS |
2547 | else |
2548 | { | |
0d5de010 DJ |
2549 | result = allocate_value (lookup_methodptr_type (TYPE_FN_FIELD_TYPE (f, j))); |
2550 | cplus_make_method_ptr (value_contents_writeable (result), | |
2551 | VALUE_ADDRESS (v), 0); | |
c906108c | 2552 | } |
c906108c | 2553 | } |
0d5de010 | 2554 | return result; |
c906108c SS |
2555 | } |
2556 | } | |
2557 | for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--) | |
2558 | { | |
f23631e4 | 2559 | struct value *v; |
c906108c SS |
2560 | int base_offset; |
2561 | ||
2562 | if (BASETYPE_VIA_VIRTUAL (t, i)) | |
2563 | base_offset = 0; | |
2564 | else | |
2565 | base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8; | |
2566 | v = value_struct_elt_for_reference (domain, | |
2567 | offset + base_offset, | |
2568 | TYPE_BASECLASS (t, i), | |
ac3eeb49 MS |
2569 | name, intype, |
2570 | want_address, noside); | |
c906108c SS |
2571 | if (v) |
2572 | return v; | |
2573 | } | |
63d06c5c DC |
2574 | |
2575 | /* As a last chance, pretend that CURTYPE is a namespace, and look | |
2576 | it up that way; this (frequently) works for types nested inside | |
2577 | classes. */ | |
2578 | ||
ac3eeb49 MS |
2579 | return value_maybe_namespace_elt (curtype, name, |
2580 | want_address, noside); | |
c906108c SS |
2581 | } |
2582 | ||
79c2c32d DC |
2583 | /* C++: Return the member NAME of the namespace given by the type |
2584 | CURTYPE. */ | |
2585 | ||
2586 | static struct value * | |
2587 | value_namespace_elt (const struct type *curtype, | |
0d5de010 | 2588 | char *name, int want_address, |
79c2c32d | 2589 | enum noside noside) |
63d06c5c DC |
2590 | { |
2591 | struct value *retval = value_maybe_namespace_elt (curtype, name, | |
ac3eeb49 MS |
2592 | want_address, |
2593 | noside); | |
63d06c5c DC |
2594 | |
2595 | if (retval == NULL) | |
ac3eeb49 MS |
2596 | error (_("No symbol \"%s\" in namespace \"%s\"."), |
2597 | name, TYPE_TAG_NAME (curtype)); | |
63d06c5c DC |
2598 | |
2599 | return retval; | |
2600 | } | |
2601 | ||
2602 | /* A helper function used by value_namespace_elt and | |
2603 | value_struct_elt_for_reference. It looks up NAME inside the | |
2604 | context CURTYPE; this works if CURTYPE is a namespace or if CURTYPE | |
2605 | is a class and NAME refers to a type in CURTYPE itself (as opposed | |
2606 | to, say, some base class of CURTYPE). */ | |
2607 | ||
2608 | static struct value * | |
2609 | value_maybe_namespace_elt (const struct type *curtype, | |
0d5de010 | 2610 | char *name, int want_address, |
63d06c5c | 2611 | enum noside noside) |
79c2c32d DC |
2612 | { |
2613 | const char *namespace_name = TYPE_TAG_NAME (curtype); | |
2614 | struct symbol *sym; | |
0d5de010 | 2615 | struct value *result; |
79c2c32d DC |
2616 | |
2617 | sym = cp_lookup_symbol_namespace (namespace_name, name, NULL, | |
ac3eeb49 MS |
2618 | get_selected_block (0), |
2619 | VAR_DOMAIN, NULL); | |
79c2c32d DC |
2620 | |
2621 | if (sym == NULL) | |
63d06c5c | 2622 | return NULL; |
79c2c32d DC |
2623 | else if ((noside == EVAL_AVOID_SIDE_EFFECTS) |
2624 | && (SYMBOL_CLASS (sym) == LOC_TYPEDEF)) | |
0d5de010 | 2625 | result = allocate_value (SYMBOL_TYPE (sym)); |
79c2c32d | 2626 | else |
0d5de010 DJ |
2627 | result = value_of_variable (sym, get_selected_block (0)); |
2628 | ||
2629 | if (result && want_address) | |
2630 | result = value_addr (result); | |
2631 | ||
2632 | return result; | |
79c2c32d DC |
2633 | } |
2634 | ||
ac3eeb49 MS |
2635 | /* Given a pointer value V, find the real (RTTI) type of the object it |
2636 | points to. | |
2637 | ||
c906108c | 2638 | Other parameters FULL, TOP, USING_ENC as with value_rtti_type() |
ac3eeb49 | 2639 | and refer to the values computed for the object pointed to. */ |
c906108c SS |
2640 | |
2641 | struct type * | |
ac3eeb49 MS |
2642 | value_rtti_target_type (struct value *v, int *full, |
2643 | int *top, int *using_enc) | |
c906108c | 2644 | { |
f23631e4 | 2645 | struct value *target; |
c906108c SS |
2646 | |
2647 | target = value_ind (v); | |
2648 | ||
2649 | return value_rtti_type (target, full, top, using_enc); | |
2650 | } | |
2651 | ||
2652 | /* Given a value pointed to by ARGP, check its real run-time type, and | |
2653 | if that is different from the enclosing type, create a new value | |
2654 | using the real run-time type as the enclosing type (and of the same | |
2655 | type as ARGP) and return it, with the embedded offset adjusted to | |
ac3eeb49 MS |
2656 | be the correct offset to the enclosed object. RTYPE is the type, |
2657 | and XFULL, XTOP, and XUSING_ENC are the other parameters, computed | |
2658 | by value_rtti_type(). If these are available, they can be supplied | |
2659 | and a second call to value_rtti_type() is avoided. (Pass RTYPE == | |
2660 | NULL if they're not available. */ | |
c906108c | 2661 | |
f23631e4 | 2662 | struct value * |
ac3eeb49 MS |
2663 | value_full_object (struct value *argp, |
2664 | struct type *rtype, | |
2665 | int xfull, int xtop, | |
fba45db2 | 2666 | int xusing_enc) |
c906108c | 2667 | { |
c5aa993b | 2668 | struct type *real_type; |
c906108c SS |
2669 | int full = 0; |
2670 | int top = -1; | |
2671 | int using_enc = 0; | |
f23631e4 | 2672 | struct value *new_val; |
c906108c SS |
2673 | |
2674 | if (rtype) | |
2675 | { | |
2676 | real_type = rtype; | |
2677 | full = xfull; | |
2678 | top = xtop; | |
2679 | using_enc = xusing_enc; | |
2680 | } | |
2681 | else | |
2682 | real_type = value_rtti_type (argp, &full, &top, &using_enc); | |
2683 | ||
ac3eeb49 | 2684 | /* If no RTTI data, or if object is already complete, do nothing. */ |
4754a64e | 2685 | if (!real_type || real_type == value_enclosing_type (argp)) |
c906108c SS |
2686 | return argp; |
2687 | ||
2688 | /* If we have the full object, but for some reason the enclosing | |
ac3eeb49 MS |
2689 | type is wrong, set it. */ |
2690 | /* pai: FIXME -- sounds iffy */ | |
c906108c SS |
2691 | if (full) |
2692 | { | |
2b127877 | 2693 | argp = value_change_enclosing_type (argp, real_type); |
c906108c SS |
2694 | return argp; |
2695 | } | |
2696 | ||
2697 | /* Check if object is in memory */ | |
2698 | if (VALUE_LVAL (argp) != lval_memory) | |
2699 | { | |
ac3eeb49 MS |
2700 | warning (_("Couldn't retrieve complete object of RTTI type %s; object may be in register(s)."), |
2701 | TYPE_NAME (real_type)); | |
c5aa993b | 2702 | |
c906108c SS |
2703 | return argp; |
2704 | } | |
c5aa993b | 2705 | |
ac3eeb49 MS |
2706 | /* All other cases -- retrieve the complete object. */ |
2707 | /* Go back by the computed top_offset from the beginning of the | |
2708 | object, adjusting for the embedded offset of argp if that's what | |
2709 | value_rtti_type used for its computation. */ | |
c906108c | 2710 | new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top + |
13c3b5f5 | 2711 | (using_enc ? 0 : value_embedded_offset (argp))); |
04624583 | 2712 | deprecated_set_value_type (new_val, value_type (argp)); |
13c3b5f5 AC |
2713 | set_value_embedded_offset (new_val, (using_enc |
2714 | ? top + value_embedded_offset (argp) | |
2715 | : top)); | |
c906108c SS |
2716 | return new_val; |
2717 | } | |
2718 | ||
389e51db | 2719 | |
d069f99d | 2720 | /* Return the value of the local variable, if one exists. |
c906108c SS |
2721 | Flag COMPLAIN signals an error if the request is made in an |
2722 | inappropriate context. */ | |
2723 | ||
f23631e4 | 2724 | struct value * |
d069f99d | 2725 | value_of_local (const char *name, int complain) |
c906108c SS |
2726 | { |
2727 | struct symbol *func, *sym; | |
2728 | struct block *b; | |
d069f99d | 2729 | struct value * ret; |
206415a3 | 2730 | struct frame_info *frame; |
c906108c | 2731 | |
206415a3 DJ |
2732 | if (complain) |
2733 | frame = get_selected_frame (_("no frame selected")); | |
2734 | else | |
c906108c | 2735 | { |
206415a3 DJ |
2736 | frame = deprecated_safe_get_selected_frame (); |
2737 | if (frame == 0) | |
c5aa993b | 2738 | return 0; |
c906108c SS |
2739 | } |
2740 | ||
206415a3 | 2741 | func = get_frame_function (frame); |
c906108c SS |
2742 | if (!func) |
2743 | { | |
2744 | if (complain) | |
8a3fe4f8 | 2745 | error (_("no `%s' in nameless context"), name); |
c5aa993b JM |
2746 | else |
2747 | return 0; | |
c906108c SS |
2748 | } |
2749 | ||
2750 | b = SYMBOL_BLOCK_VALUE (func); | |
de4f826b | 2751 | if (dict_empty (BLOCK_DICT (b))) |
c906108c SS |
2752 | { |
2753 | if (complain) | |
8a3fe4f8 | 2754 | error (_("no args, no `%s'"), name); |
c5aa993b JM |
2755 | else |
2756 | return 0; | |
c906108c SS |
2757 | } |
2758 | ||
2759 | /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER | |
2760 | symbol instead of the LOC_ARG one (if both exist). */ | |
176620f1 | 2761 | sym = lookup_block_symbol (b, name, NULL, VAR_DOMAIN); |
c906108c SS |
2762 | if (sym == NULL) |
2763 | { | |
2764 | if (complain) | |
ac3eeb49 MS |
2765 | error (_("current stack frame does not contain a variable named `%s'"), |
2766 | name); | |
c906108c SS |
2767 | else |
2768 | return NULL; | |
2769 | } | |
2770 | ||
206415a3 | 2771 | ret = read_var_value (sym, frame); |
d069f99d | 2772 | if (ret == 0 && complain) |
8a3fe4f8 | 2773 | error (_("`%s' argument unreadable"), name); |
d069f99d AF |
2774 | return ret; |
2775 | } | |
2776 | ||
2777 | /* C++/Objective-C: return the value of the class instance variable, | |
2778 | if one exists. Flag COMPLAIN signals an error if the request is | |
2779 | made in an inappropriate context. */ | |
2780 | ||
2781 | struct value * | |
2782 | value_of_this (int complain) | |
2783 | { | |
2b2d9e11 VP |
2784 | if (!current_language->la_name_of_this) |
2785 | return 0; | |
2786 | return value_of_local (current_language->la_name_of_this, complain); | |
c906108c SS |
2787 | } |
2788 | ||
ac3eeb49 MS |
2789 | /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH |
2790 | elements long, starting at LOWBOUND. The result has the same lower | |
2791 | bound as the original ARRAY. */ | |
c906108c | 2792 | |
f23631e4 AC |
2793 | struct value * |
2794 | value_slice (struct value *array, int lowbound, int length) | |
c906108c SS |
2795 | { |
2796 | struct type *slice_range_type, *slice_type, *range_type; | |
7a67d0fe | 2797 | LONGEST lowerbound, upperbound; |
f23631e4 | 2798 | struct value *slice; |
c906108c | 2799 | struct type *array_type; |
ac3eeb49 | 2800 | |
df407dfe | 2801 | array_type = check_typedef (value_type (array)); |
c906108c SS |
2802 | if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY |
2803 | && TYPE_CODE (array_type) != TYPE_CODE_STRING | |
2804 | && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING) | |
8a3fe4f8 | 2805 | error (_("cannot take slice of non-array")); |
ac3eeb49 | 2806 | |
c906108c SS |
2807 | range_type = TYPE_INDEX_TYPE (array_type); |
2808 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
8a3fe4f8 | 2809 | error (_("slice from bad array or bitstring")); |
ac3eeb49 | 2810 | |
c906108c | 2811 | if (lowbound < lowerbound || length < 0 |
db034ac5 | 2812 | || lowbound + length - 1 > upperbound) |
8a3fe4f8 | 2813 | error (_("slice out of range")); |
ac3eeb49 | 2814 | |
c906108c SS |
2815 | /* FIXME-type-allocation: need a way to free this type when we are |
2816 | done with it. */ | |
c5aa993b | 2817 | slice_range_type = create_range_type ((struct type *) NULL, |
c906108c | 2818 | TYPE_TARGET_TYPE (range_type), |
ac3eeb49 MS |
2819 | lowbound, |
2820 | lowbound + length - 1); | |
c906108c SS |
2821 | if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING) |
2822 | { | |
2823 | int i; | |
ac3eeb49 MS |
2824 | |
2825 | slice_type = create_set_type ((struct type *) NULL, | |
2826 | slice_range_type); | |
c906108c SS |
2827 | TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING; |
2828 | slice = value_zero (slice_type, not_lval); | |
ac3eeb49 | 2829 | |
c906108c SS |
2830 | for (i = 0; i < length; i++) |
2831 | { | |
2832 | int element = value_bit_index (array_type, | |
0fd88904 | 2833 | value_contents (array), |
c906108c SS |
2834 | lowbound + i); |
2835 | if (element < 0) | |
8a3fe4f8 | 2836 | error (_("internal error accessing bitstring")); |
c906108c SS |
2837 | else if (element > 0) |
2838 | { | |
2839 | int j = i % TARGET_CHAR_BIT; | |
32c9a795 | 2840 | if (gdbarch_bits_big_endian (current_gdbarch)) |
c906108c | 2841 | j = TARGET_CHAR_BIT - 1 - j; |
990a07ab | 2842 | value_contents_raw (slice)[i / TARGET_CHAR_BIT] |= (1 << j); |
c906108c SS |
2843 | } |
2844 | } | |
ac3eeb49 MS |
2845 | /* We should set the address, bitssize, and bitspos, so the |
2846 | slice can be used on the LHS, but that may require extensions | |
2847 | to value_assign. For now, just leave as a non_lval. | |
2848 | FIXME. */ | |
c906108c SS |
2849 | } |
2850 | else | |
2851 | { | |
2852 | struct type *element_type = TYPE_TARGET_TYPE (array_type); | |
ac3eeb49 MS |
2853 | LONGEST offset = |
2854 | (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type)); | |
2855 | ||
2856 | slice_type = create_array_type ((struct type *) NULL, | |
2857 | element_type, | |
c906108c SS |
2858 | slice_range_type); |
2859 | TYPE_CODE (slice_type) = TYPE_CODE (array_type); | |
ac3eeb49 | 2860 | |
c906108c | 2861 | slice = allocate_value (slice_type); |
d69fe07e | 2862 | if (value_lazy (array)) |
dfa52d88 | 2863 | set_value_lazy (slice, 1); |
c906108c | 2864 | else |
0fd88904 AC |
2865 | memcpy (value_contents_writeable (slice), |
2866 | value_contents (array) + offset, | |
c906108c | 2867 | TYPE_LENGTH (slice_type)); |
ac3eeb49 | 2868 | |
c906108c SS |
2869 | if (VALUE_LVAL (array) == lval_internalvar) |
2870 | VALUE_LVAL (slice) = lval_internalvar_component; | |
2871 | else | |
2872 | VALUE_LVAL (slice) = VALUE_LVAL (array); | |
ac3eeb49 | 2873 | |
c906108c | 2874 | VALUE_ADDRESS (slice) = VALUE_ADDRESS (array); |
65d3800a | 2875 | VALUE_FRAME_ID (slice) = VALUE_FRAME_ID (array); |
f5cf64a7 | 2876 | set_value_offset (slice, value_offset (array) + offset); |
c906108c SS |
2877 | } |
2878 | return slice; | |
2879 | } | |
2880 | ||
ac3eeb49 MS |
2881 | /* Create a value for a FORTRAN complex number. Currently most of the |
2882 | time values are coerced to COMPLEX*16 (i.e. a complex number | |
070ad9f0 DB |
2883 | composed of 2 doubles. This really should be a smarter routine |
2884 | that figures out precision inteligently as opposed to assuming | |
ac3eeb49 | 2885 | doubles. FIXME: fmb */ |
c906108c | 2886 | |
f23631e4 | 2887 | struct value * |
ac3eeb49 MS |
2888 | value_literal_complex (struct value *arg1, |
2889 | struct value *arg2, | |
2890 | struct type *type) | |
c906108c | 2891 | { |
f23631e4 | 2892 | struct value *val; |
c906108c SS |
2893 | struct type *real_type = TYPE_TARGET_TYPE (type); |
2894 | ||
2895 | val = allocate_value (type); | |
2896 | arg1 = value_cast (real_type, arg1); | |
2897 | arg2 = value_cast (real_type, arg2); | |
2898 | ||
990a07ab | 2899 | memcpy (value_contents_raw (val), |
0fd88904 | 2900 | value_contents (arg1), TYPE_LENGTH (real_type)); |
990a07ab | 2901 | memcpy (value_contents_raw (val) + TYPE_LENGTH (real_type), |
0fd88904 | 2902 | value_contents (arg2), TYPE_LENGTH (real_type)); |
c906108c SS |
2903 | return val; |
2904 | } | |
2905 | ||
ac3eeb49 | 2906 | /* Cast a value into the appropriate complex data type. */ |
c906108c | 2907 | |
f23631e4 AC |
2908 | static struct value * |
2909 | cast_into_complex (struct type *type, struct value *val) | |
c906108c SS |
2910 | { |
2911 | struct type *real_type = TYPE_TARGET_TYPE (type); | |
ac3eeb49 | 2912 | |
df407dfe | 2913 | if (TYPE_CODE (value_type (val)) == TYPE_CODE_COMPLEX) |
c906108c | 2914 | { |
df407dfe | 2915 | struct type *val_real_type = TYPE_TARGET_TYPE (value_type (val)); |
f23631e4 AC |
2916 | struct value *re_val = allocate_value (val_real_type); |
2917 | struct value *im_val = allocate_value (val_real_type); | |
c906108c | 2918 | |
990a07ab | 2919 | memcpy (value_contents_raw (re_val), |
0fd88904 | 2920 | value_contents (val), TYPE_LENGTH (val_real_type)); |
990a07ab | 2921 | memcpy (value_contents_raw (im_val), |
0fd88904 | 2922 | value_contents (val) + TYPE_LENGTH (val_real_type), |
c5aa993b | 2923 | TYPE_LENGTH (val_real_type)); |
c906108c SS |
2924 | |
2925 | return value_literal_complex (re_val, im_val, type); | |
2926 | } | |
df407dfe AC |
2927 | else if (TYPE_CODE (value_type (val)) == TYPE_CODE_FLT |
2928 | || TYPE_CODE (value_type (val)) == TYPE_CODE_INT) | |
ac3eeb49 MS |
2929 | return value_literal_complex (val, |
2930 | value_zero (real_type, not_lval), | |
2931 | type); | |
c906108c | 2932 | else |
8a3fe4f8 | 2933 | error (_("cannot cast non-number to complex")); |
c906108c SS |
2934 | } |
2935 | ||
2936 | void | |
fba45db2 | 2937 | _initialize_valops (void) |
c906108c | 2938 | { |
5bf193a2 AC |
2939 | add_setshow_boolean_cmd ("overload-resolution", class_support, |
2940 | &overload_resolution, _("\ | |
2941 | Set overload resolution in evaluating C++ functions."), _("\ | |
ac3eeb49 MS |
2942 | Show overload resolution in evaluating C++ functions."), |
2943 | NULL, NULL, | |
920d2a44 | 2944 | show_overload_resolution, |
5bf193a2 | 2945 | &setlist, &showlist); |
c906108c | 2946 | overload_resolution = 1; |
c906108c | 2947 | } |