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