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