]>
Commit | Line | Data |
---|---|---|
c906108c SS |
1 | /* Perform non-arithmetic operations on values, for GDB. |
2 | Copyright 1986, 87, 89, 91, 92, 93, 94, 95, 96, 97, 1998 | |
3 | Free Software Foundation, Inc. | |
4 | ||
c5aa993b | 5 | This file is part of GDB. |
c906108c | 6 | |
c5aa993b JM |
7 | This program is free software; you can redistribute it and/or modify |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
c906108c | 11 | |
c5aa993b JM |
12 | This program is distributed in the hope that it will be useful, |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
c906108c | 16 | |
c5aa993b JM |
17 | You should have received a copy of the GNU General Public License |
18 | along with this program; if not, write to the Free Software | |
19 | Foundation, Inc., 59 Temple Place - Suite 330, | |
20 | Boston, MA 02111-1307, USA. */ | |
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" | |
33 | ||
34 | #include <errno.h> | |
35 | #include "gdb_string.h" | |
36 | ||
c906108c SS |
37 | /* Flag indicating HP compilers were used; needed to correctly handle some |
38 | value operations with HP aCC code/runtime. */ | |
39 | extern int hp_som_som_object_present; | |
40 | ||
070ad9f0 | 41 | extern int overload_debug; |
c906108c SS |
42 | /* Local functions. */ |
43 | ||
a14ed312 | 44 | static int typecmp (int staticp, struct type *t1[], value_ptr t2[]); |
c906108c | 45 | |
a14ed312 KB |
46 | static CORE_ADDR find_function_addr (value_ptr, struct type **); |
47 | static value_ptr value_arg_coerce (value_ptr, struct type *, int); | |
c906108c SS |
48 | |
49 | ||
a14ed312 | 50 | static CORE_ADDR value_push (CORE_ADDR, value_ptr); |
c906108c | 51 | |
a14ed312 KB |
52 | static value_ptr search_struct_field (char *, value_ptr, int, |
53 | struct type *, int); | |
c906108c | 54 | |
a14ed312 KB |
55 | static value_ptr search_struct_method (char *, value_ptr *, |
56 | value_ptr *, | |
57 | int, int *, struct type *); | |
c906108c | 58 | |
a14ed312 | 59 | static int check_field_in (struct type *, const char *); |
c906108c | 60 | |
a14ed312 | 61 | static CORE_ADDR allocate_space_in_inferior (int); |
c906108c | 62 | |
a14ed312 | 63 | static value_ptr cast_into_complex (struct type *, value_ptr); |
c906108c | 64 | |
a14ed312 KB |
65 | static struct fn_field *find_method_list (value_ptr * argp, char *method, |
66 | int offset, int *static_memfuncp, | |
67 | struct type *type, int *num_fns, | |
68 | struct type **basetype, | |
69 | int *boffset); | |
7a292a7a | 70 | |
a14ed312 | 71 | void _initialize_valops (void); |
c906108c SS |
72 | |
73 | #define VALUE_SUBSTRING_START(VAL) VALUE_FRAME(VAL) | |
74 | ||
75 | /* Flag for whether we want to abandon failed expression evals by default. */ | |
76 | ||
77 | #if 0 | |
78 | static int auto_abandon = 0; | |
79 | #endif | |
80 | ||
81 | int overload_resolution = 0; | |
242bfc55 FN |
82 | |
83 | /* This boolean tells what gdb should do if a signal is received while in | |
84 | a function called from gdb (call dummy). If set, gdb unwinds the stack | |
85 | and restore the context to what as it was before the call. | |
86 | The default is to stop in the frame where the signal was received. */ | |
87 | ||
88 | int unwind_on_signal_p = 0; | |
c5aa993b | 89 | \f |
c906108c SS |
90 | |
91 | ||
c906108c SS |
92 | /* Find the address of function name NAME in the inferior. */ |
93 | ||
94 | value_ptr | |
95 | find_function_in_inferior (name) | |
96 | char *name; | |
97 | { | |
98 | register struct symbol *sym; | |
99 | sym = lookup_symbol (name, 0, VAR_NAMESPACE, 0, NULL); | |
100 | if (sym != NULL) | |
101 | { | |
102 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
103 | { | |
104 | error ("\"%s\" exists in this program but is not a function.", | |
105 | name); | |
106 | } | |
107 | return value_of_variable (sym, NULL); | |
108 | } | |
109 | else | |
110 | { | |
c5aa993b | 111 | struct minimal_symbol *msymbol = lookup_minimal_symbol (name, NULL, NULL); |
c906108c SS |
112 | if (msymbol != NULL) |
113 | { | |
114 | struct type *type; | |
4478b372 | 115 | CORE_ADDR maddr; |
c906108c SS |
116 | type = lookup_pointer_type (builtin_type_char); |
117 | type = lookup_function_type (type); | |
118 | type = lookup_pointer_type (type); | |
4478b372 JB |
119 | maddr = SYMBOL_VALUE_ADDRESS (msymbol); |
120 | return value_from_pointer (type, maddr); | |
c906108c SS |
121 | } |
122 | else | |
123 | { | |
c5aa993b | 124 | if (!target_has_execution) |
c906108c | 125 | error ("evaluation of this expression requires the target program to be active"); |
c5aa993b | 126 | else |
c906108c SS |
127 | error ("evaluation of this expression requires the program to have a function \"%s\".", name); |
128 | } | |
129 | } | |
130 | } | |
131 | ||
132 | /* Allocate NBYTES of space in the inferior using the inferior's malloc | |
133 | and return a value that is a pointer to the allocated space. */ | |
134 | ||
135 | value_ptr | |
136 | value_allocate_space_in_inferior (len) | |
137 | int len; | |
138 | { | |
139 | value_ptr blocklen; | |
140 | register value_ptr val = find_function_in_inferior ("malloc"); | |
141 | ||
142 | blocklen = value_from_longest (builtin_type_int, (LONGEST) len); | |
143 | val = call_function_by_hand (val, 1, &blocklen); | |
144 | if (value_logical_not (val)) | |
145 | { | |
146 | if (!target_has_execution) | |
c5aa993b JM |
147 | error ("No memory available to program now: you need to start the target first"); |
148 | else | |
149 | error ("No memory available to program: call to malloc failed"); | |
c906108c SS |
150 | } |
151 | return val; | |
152 | } | |
153 | ||
154 | static CORE_ADDR | |
155 | allocate_space_in_inferior (len) | |
156 | int len; | |
157 | { | |
158 | return value_as_long (value_allocate_space_in_inferior (len)); | |
159 | } | |
160 | ||
161 | /* Cast value ARG2 to type TYPE and return as a value. | |
162 | More general than a C cast: accepts any two types of the same length, | |
163 | and if ARG2 is an lvalue it can be cast into anything at all. */ | |
164 | /* In C++, casts may change pointer or object representations. */ | |
165 | ||
166 | value_ptr | |
167 | value_cast (type, arg2) | |
168 | struct type *type; | |
169 | register value_ptr arg2; | |
170 | { | |
171 | register enum type_code code1; | |
172 | register enum type_code code2; | |
173 | register int scalar; | |
174 | struct type *type2; | |
175 | ||
176 | int convert_to_boolean = 0; | |
c5aa993b | 177 | |
c906108c SS |
178 | if (VALUE_TYPE (arg2) == type) |
179 | return arg2; | |
180 | ||
181 | CHECK_TYPEDEF (type); | |
182 | code1 = TYPE_CODE (type); | |
c5aa993b | 183 | COERCE_REF (arg2); |
c906108c SS |
184 | type2 = check_typedef (VALUE_TYPE (arg2)); |
185 | ||
186 | /* A cast to an undetermined-length array_type, such as (TYPE [])OBJECT, | |
187 | is treated like a cast to (TYPE [N])OBJECT, | |
188 | where N is sizeof(OBJECT)/sizeof(TYPE). */ | |
189 | if (code1 == TYPE_CODE_ARRAY) | |
190 | { | |
191 | struct type *element_type = TYPE_TARGET_TYPE (type); | |
192 | unsigned element_length = TYPE_LENGTH (check_typedef (element_type)); | |
193 | if (element_length > 0 | |
c5aa993b | 194 | && TYPE_ARRAY_UPPER_BOUND_TYPE (type) == BOUND_CANNOT_BE_DETERMINED) |
c906108c SS |
195 | { |
196 | struct type *range_type = TYPE_INDEX_TYPE (type); | |
197 | int val_length = TYPE_LENGTH (type2); | |
198 | LONGEST low_bound, high_bound, new_length; | |
199 | if (get_discrete_bounds (range_type, &low_bound, &high_bound) < 0) | |
200 | low_bound = 0, high_bound = 0; | |
201 | new_length = val_length / element_length; | |
202 | if (val_length % element_length != 0) | |
c5aa993b | 203 | warning ("array element type size does not divide object size in cast"); |
c906108c SS |
204 | /* FIXME-type-allocation: need a way to free this type when we are |
205 | done with it. */ | |
206 | range_type = create_range_type ((struct type *) NULL, | |
207 | TYPE_TARGET_TYPE (range_type), | |
208 | low_bound, | |
209 | new_length + low_bound - 1); | |
210 | VALUE_TYPE (arg2) = create_array_type ((struct type *) NULL, | |
211 | element_type, range_type); | |
212 | return arg2; | |
213 | } | |
214 | } | |
215 | ||
216 | if (current_language->c_style_arrays | |
217 | && TYPE_CODE (type2) == TYPE_CODE_ARRAY) | |
218 | arg2 = value_coerce_array (arg2); | |
219 | ||
220 | if (TYPE_CODE (type2) == TYPE_CODE_FUNC) | |
221 | arg2 = value_coerce_function (arg2); | |
222 | ||
223 | type2 = check_typedef (VALUE_TYPE (arg2)); | |
224 | COERCE_VARYING_ARRAY (arg2, type2); | |
225 | code2 = TYPE_CODE (type2); | |
226 | ||
227 | if (code1 == TYPE_CODE_COMPLEX) | |
228 | return cast_into_complex (type, arg2); | |
229 | if (code1 == TYPE_CODE_BOOL) | |
230 | { | |
231 | code1 = TYPE_CODE_INT; | |
232 | convert_to_boolean = 1; | |
233 | } | |
234 | if (code1 == TYPE_CODE_CHAR) | |
235 | code1 = TYPE_CODE_INT; | |
236 | if (code2 == TYPE_CODE_BOOL || code2 == TYPE_CODE_CHAR) | |
237 | code2 = TYPE_CODE_INT; | |
238 | ||
239 | scalar = (code2 == TYPE_CODE_INT || code2 == TYPE_CODE_FLT | |
240 | || code2 == TYPE_CODE_ENUM || code2 == TYPE_CODE_RANGE); | |
241 | ||
c5aa993b | 242 | if (code1 == TYPE_CODE_STRUCT |
c906108c SS |
243 | && code2 == TYPE_CODE_STRUCT |
244 | && TYPE_NAME (type) != 0) | |
245 | { | |
246 | /* Look in the type of the source to see if it contains the | |
7b83ea04 AC |
247 | type of the target as a superclass. If so, we'll need to |
248 | offset the object in addition to changing its type. */ | |
c906108c SS |
249 | value_ptr v = search_struct_field (type_name_no_tag (type), |
250 | arg2, 0, type2, 1); | |
251 | if (v) | |
252 | { | |
253 | VALUE_TYPE (v) = type; | |
254 | return v; | |
255 | } | |
256 | } | |
257 | if (code1 == TYPE_CODE_FLT && scalar) | |
258 | return value_from_double (type, value_as_double (arg2)); | |
259 | else if ((code1 == TYPE_CODE_INT || code1 == TYPE_CODE_ENUM | |
260 | || code1 == TYPE_CODE_RANGE) | |
261 | && (scalar || code2 == TYPE_CODE_PTR)) | |
262 | { | |
263 | LONGEST longest; | |
c5aa993b JM |
264 | |
265 | if (hp_som_som_object_present && /* if target compiled by HP aCC */ | |
266 | (code2 == TYPE_CODE_PTR)) | |
267 | { | |
268 | unsigned int *ptr; | |
269 | value_ptr retvalp; | |
270 | ||
271 | switch (TYPE_CODE (TYPE_TARGET_TYPE (type2))) | |
272 | { | |
273 | /* With HP aCC, pointers to data members have a bias */ | |
274 | case TYPE_CODE_MEMBER: | |
275 | retvalp = value_from_longest (type, value_as_long (arg2)); | |
276 | ptr = (unsigned int *) VALUE_CONTENTS (retvalp); /* force evaluation */ | |
277 | *ptr &= ~0x20000000; /* zap 29th bit to remove bias */ | |
278 | return retvalp; | |
279 | ||
280 | /* While pointers to methods don't really point to a function */ | |
281 | case TYPE_CODE_METHOD: | |
282 | error ("Pointers to methods not supported with HP aCC"); | |
283 | ||
284 | default: | |
285 | break; /* fall out and go to normal handling */ | |
286 | } | |
287 | } | |
c906108c SS |
288 | longest = value_as_long (arg2); |
289 | return value_from_longest (type, convert_to_boolean ? (LONGEST) (longest ? 1 : 0) : longest); | |
290 | } | |
291 | else if (TYPE_LENGTH (type) == TYPE_LENGTH (type2)) | |
292 | { | |
293 | if (code1 == TYPE_CODE_PTR && code2 == TYPE_CODE_PTR) | |
294 | { | |
295 | struct type *t1 = check_typedef (TYPE_TARGET_TYPE (type)); | |
296 | struct type *t2 = check_typedef (TYPE_TARGET_TYPE (type2)); | |
c5aa993b | 297 | if (TYPE_CODE (t1) == TYPE_CODE_STRUCT |
c906108c SS |
298 | && TYPE_CODE (t2) == TYPE_CODE_STRUCT |
299 | && !value_logical_not (arg2)) | |
300 | { | |
301 | value_ptr v; | |
302 | ||
303 | /* Look in the type of the source to see if it contains the | |
7b83ea04 AC |
304 | type of the target as a superclass. If so, we'll need to |
305 | offset the pointer rather than just change its type. */ | |
c906108c SS |
306 | if (TYPE_NAME (t1) != NULL) |
307 | { | |
308 | v = search_struct_field (type_name_no_tag (t1), | |
309 | value_ind (arg2), 0, t2, 1); | |
310 | if (v) | |
311 | { | |
312 | v = value_addr (v); | |
313 | VALUE_TYPE (v) = type; | |
314 | return v; | |
315 | } | |
316 | } | |
317 | ||
318 | /* Look in the type of the target to see if it contains the | |
7b83ea04 AC |
319 | type of the source as a superclass. If so, we'll need to |
320 | offset the pointer rather than just change its type. | |
321 | FIXME: This fails silently with virtual inheritance. */ | |
c906108c SS |
322 | if (TYPE_NAME (t2) != NULL) |
323 | { | |
324 | v = search_struct_field (type_name_no_tag (t2), | |
c5aa993b | 325 | value_zero (t1, not_lval), 0, t1, 1); |
c906108c SS |
326 | if (v) |
327 | { | |
328 | value_ptr v2 = value_ind (arg2); | |
329 | VALUE_ADDRESS (v2) -= VALUE_ADDRESS (v) | |
c5aa993b | 330 | + VALUE_OFFSET (v); |
070ad9f0 DB |
331 | |
332 | /* JYG: adjust the new pointer value and | |
333 | embedded offset. */ | |
334 | v2->aligner.contents[0] -= VALUE_EMBEDDED_OFFSET (v); | |
335 | VALUE_EMBEDDED_OFFSET (v2) = 0; | |
336 | ||
c906108c SS |
337 | v2 = value_addr (v2); |
338 | VALUE_TYPE (v2) = type; | |
339 | return v2; | |
340 | } | |
341 | } | |
342 | } | |
343 | /* No superclass found, just fall through to change ptr type. */ | |
344 | } | |
345 | VALUE_TYPE (arg2) = type; | |
c5aa993b JM |
346 | VALUE_ENCLOSING_TYPE (arg2) = type; /* pai: chk_val */ |
347 | VALUE_POINTED_TO_OFFSET (arg2) = 0; /* pai: chk_val */ | |
c906108c SS |
348 | return arg2; |
349 | } | |
350 | else if (chill_varying_type (type)) | |
351 | { | |
352 | struct type *range1, *range2, *eltype1, *eltype2; | |
353 | value_ptr val; | |
354 | int count1, count2; | |
355 | LONGEST low_bound, high_bound; | |
356 | char *valaddr, *valaddr_data; | |
357 | /* For lint warning about eltype2 possibly uninitialized: */ | |
358 | eltype2 = NULL; | |
359 | if (code2 == TYPE_CODE_BITSTRING) | |
360 | error ("not implemented: converting bitstring to varying type"); | |
361 | if ((code2 != TYPE_CODE_ARRAY && code2 != TYPE_CODE_STRING) | |
362 | || (eltype1 = check_typedef (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, 1))), | |
363 | eltype2 = check_typedef (TYPE_TARGET_TYPE (type2)), | |
364 | (TYPE_LENGTH (eltype1) != TYPE_LENGTH (eltype2) | |
c5aa993b | 365 | /* || TYPE_CODE (eltype1) != TYPE_CODE (eltype2) */ ))) |
c906108c SS |
366 | error ("Invalid conversion to varying type"); |
367 | range1 = TYPE_FIELD_TYPE (TYPE_FIELD_TYPE (type, 1), 0); | |
368 | range2 = TYPE_FIELD_TYPE (type2, 0); | |
369 | if (get_discrete_bounds (range1, &low_bound, &high_bound) < 0) | |
370 | count1 = -1; | |
371 | else | |
372 | count1 = high_bound - low_bound + 1; | |
373 | if (get_discrete_bounds (range2, &low_bound, &high_bound) < 0) | |
c5aa993b | 374 | count1 = -1, count2 = 0; /* To force error before */ |
c906108c SS |
375 | else |
376 | count2 = high_bound - low_bound + 1; | |
377 | if (count2 > count1) | |
378 | error ("target varying type is too small"); | |
379 | val = allocate_value (type); | |
380 | valaddr = VALUE_CONTENTS_RAW (val); | |
381 | valaddr_data = valaddr + TYPE_FIELD_BITPOS (type, 1) / 8; | |
382 | /* Set val's __var_length field to count2. */ | |
383 | store_signed_integer (valaddr, TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)), | |
384 | count2); | |
385 | /* Set the __var_data field to count2 elements copied from arg2. */ | |
386 | memcpy (valaddr_data, VALUE_CONTENTS (arg2), | |
387 | count2 * TYPE_LENGTH (eltype2)); | |
388 | /* Zero the rest of the __var_data field of val. */ | |
389 | memset (valaddr_data + count2 * TYPE_LENGTH (eltype2), '\0', | |
390 | (count1 - count2) * TYPE_LENGTH (eltype2)); | |
391 | return val; | |
392 | } | |
393 | else if (VALUE_LVAL (arg2) == lval_memory) | |
394 | { | |
395 | return value_at_lazy (type, VALUE_ADDRESS (arg2) + VALUE_OFFSET (arg2), | |
396 | VALUE_BFD_SECTION (arg2)); | |
397 | } | |
398 | else if (code1 == TYPE_CODE_VOID) | |
399 | { | |
400 | return value_zero (builtin_type_void, not_lval); | |
401 | } | |
402 | else | |
403 | { | |
404 | error ("Invalid cast."); | |
405 | return 0; | |
406 | } | |
407 | } | |
408 | ||
409 | /* Create a value of type TYPE that is zero, and return it. */ | |
410 | ||
411 | value_ptr | |
412 | value_zero (type, lv) | |
413 | struct type *type; | |
414 | enum lval_type lv; | |
415 | { | |
416 | register value_ptr val = allocate_value (type); | |
417 | ||
418 | memset (VALUE_CONTENTS (val), 0, TYPE_LENGTH (check_typedef (type))); | |
419 | VALUE_LVAL (val) = lv; | |
420 | ||
421 | return val; | |
422 | } | |
423 | ||
070ad9f0 | 424 | /* Return a value with type TYPE located at ADDR. |
c906108c SS |
425 | |
426 | Call value_at only if the data needs to be fetched immediately; | |
427 | if we can be 'lazy' and defer the fetch, perhaps indefinately, call | |
428 | value_at_lazy instead. value_at_lazy simply records the address of | |
070ad9f0 DB |
429 | the data and sets the lazy-evaluation-required flag. The lazy flag |
430 | is tested in the VALUE_CONTENTS macro, which is used if and when | |
431 | the contents are actually required. | |
c906108c SS |
432 | |
433 | Note: value_at does *NOT* handle embedded offsets; perform such | |
434 | adjustments before or after calling it. */ | |
435 | ||
436 | value_ptr | |
437 | value_at (type, addr, sect) | |
438 | struct type *type; | |
439 | CORE_ADDR addr; | |
440 | asection *sect; | |
441 | { | |
442 | register value_ptr val; | |
443 | ||
444 | if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) | |
445 | error ("Attempt to dereference a generic pointer."); | |
446 | ||
447 | val = allocate_value (type); | |
448 | ||
7a292a7a SS |
449 | if (GDB_TARGET_IS_D10V |
450 | && TYPE_CODE (type) == TYPE_CODE_PTR | |
c906108c SS |
451 | && TYPE_TARGET_TYPE (type) |
452 | && (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_FUNC)) | |
453 | { | |
454 | /* pointer to function */ | |
455 | unsigned long num; | |
456 | unsigned short snum; | |
457 | snum = read_memory_unsigned_integer (addr, 2); | |
7a292a7a SS |
458 | num = D10V_MAKE_IADDR (snum); |
459 | store_address (VALUE_CONTENTS_RAW (val), 4, num); | |
c906108c | 460 | } |
7a292a7a | 461 | else if (GDB_TARGET_IS_D10V |
c5aa993b | 462 | && TYPE_CODE (type) == TYPE_CODE_PTR) |
c906108c SS |
463 | { |
464 | /* pointer to data */ | |
465 | unsigned long num; | |
466 | unsigned short snum; | |
467 | snum = read_memory_unsigned_integer (addr, 2); | |
7a292a7a | 468 | num = D10V_MAKE_DADDR (snum); |
c5aa993b | 469 | store_address (VALUE_CONTENTS_RAW (val), 4, num); |
c906108c SS |
470 | } |
471 | else | |
d4b2399a | 472 | read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), TYPE_LENGTH (type)); |
c906108c SS |
473 | |
474 | VALUE_LVAL (val) = lval_memory; | |
475 | VALUE_ADDRESS (val) = addr; | |
476 | VALUE_BFD_SECTION (val) = sect; | |
477 | ||
478 | return val; | |
479 | } | |
480 | ||
481 | /* Return a lazy value with type TYPE located at ADDR (cf. value_at). */ | |
482 | ||
483 | value_ptr | |
484 | value_at_lazy (type, addr, sect) | |
485 | struct type *type; | |
486 | CORE_ADDR addr; | |
487 | asection *sect; | |
488 | { | |
489 | register value_ptr val; | |
490 | ||
491 | if (TYPE_CODE (check_typedef (type)) == TYPE_CODE_VOID) | |
492 | error ("Attempt to dereference a generic pointer."); | |
493 | ||
494 | val = allocate_value (type); | |
495 | ||
496 | VALUE_LVAL (val) = lval_memory; | |
497 | VALUE_ADDRESS (val) = addr; | |
498 | VALUE_LAZY (val) = 1; | |
499 | VALUE_BFD_SECTION (val) = sect; | |
500 | ||
501 | return val; | |
502 | } | |
503 | ||
070ad9f0 DB |
504 | /* Called only from the VALUE_CONTENTS and VALUE_CONTENTS_ALL macros, |
505 | if the current data for a variable needs to be loaded into | |
506 | VALUE_CONTENTS(VAL). Fetches the data from the user's process, and | |
c906108c SS |
507 | clears the lazy flag to indicate that the data in the buffer is valid. |
508 | ||
509 | If the value is zero-length, we avoid calling read_memory, which would | |
510 | abort. We mark the value as fetched anyway -- all 0 bytes of it. | |
511 | ||
512 | This function returns a value because it is used in the VALUE_CONTENTS | |
513 | macro as part of an expression, where a void would not work. The | |
514 | value is ignored. */ | |
515 | ||
516 | int | |
517 | value_fetch_lazy (val) | |
518 | register value_ptr val; | |
519 | { | |
520 | CORE_ADDR addr = VALUE_ADDRESS (val) + VALUE_OFFSET (val); | |
521 | int length = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val)); | |
522 | ||
c5aa993b | 523 | struct type *type = VALUE_TYPE (val); |
7a292a7a SS |
524 | if (GDB_TARGET_IS_D10V |
525 | && TYPE_CODE (type) == TYPE_CODE_PTR | |
c906108c SS |
526 | && TYPE_TARGET_TYPE (type) |
527 | && (TYPE_CODE (TYPE_TARGET_TYPE (type)) == TYPE_CODE_FUNC)) | |
528 | { | |
529 | /* pointer to function */ | |
530 | unsigned long num; | |
531 | unsigned short snum; | |
532 | snum = read_memory_unsigned_integer (addr, 2); | |
c5aa993b JM |
533 | num = D10V_MAKE_IADDR (snum); |
534 | store_address (VALUE_CONTENTS_RAW (val), 4, num); | |
c906108c | 535 | } |
7a292a7a | 536 | else if (GDB_TARGET_IS_D10V |
c5aa993b | 537 | && TYPE_CODE (type) == TYPE_CODE_PTR) |
c906108c SS |
538 | { |
539 | /* pointer to data */ | |
540 | unsigned long num; | |
541 | unsigned short snum; | |
542 | snum = read_memory_unsigned_integer (addr, 2); | |
c5aa993b JM |
543 | num = D10V_MAKE_DADDR (snum); |
544 | store_address (VALUE_CONTENTS_RAW (val), 4, num); | |
c906108c | 545 | } |
7a292a7a | 546 | else if (length) |
d4b2399a C |
547 | read_memory (addr, VALUE_CONTENTS_ALL_RAW (val), length); |
548 | ||
c906108c SS |
549 | VALUE_LAZY (val) = 0; |
550 | return 0; | |
551 | } | |
552 | ||
553 | ||
554 | /* Store the contents of FROMVAL into the location of TOVAL. | |
555 | Return a new value with the location of TOVAL and contents of FROMVAL. */ | |
556 | ||
557 | value_ptr | |
558 | value_assign (toval, fromval) | |
559 | register value_ptr toval, fromval; | |
560 | { | |
561 | register struct type *type; | |
562 | register value_ptr val; | |
563 | char raw_buffer[MAX_REGISTER_RAW_SIZE]; | |
564 | int use_buffer = 0; | |
565 | ||
566 | if (!toval->modifiable) | |
567 | error ("Left operand of assignment is not a modifiable lvalue."); | |
568 | ||
569 | COERCE_REF (toval); | |
570 | ||
571 | type = VALUE_TYPE (toval); | |
572 | if (VALUE_LVAL (toval) != lval_internalvar) | |
573 | fromval = value_cast (type, fromval); | |
574 | else | |
575 | COERCE_ARRAY (fromval); | |
576 | CHECK_TYPEDEF (type); | |
577 | ||
578 | /* If TOVAL is a special machine register requiring conversion | |
579 | of program values to a special raw format, | |
580 | convert FROMVAL's contents now, with result in `raw_buffer', | |
581 | and set USE_BUFFER to the number of bytes to write. */ | |
582 | ||
ac9a91a7 | 583 | if (VALUE_REGNO (toval) >= 0) |
c906108c SS |
584 | { |
585 | int regno = VALUE_REGNO (toval); | |
586 | if (REGISTER_CONVERTIBLE (regno)) | |
587 | { | |
588 | struct type *fromtype = check_typedef (VALUE_TYPE (fromval)); | |
589 | REGISTER_CONVERT_TO_RAW (fromtype, regno, | |
590 | VALUE_CONTENTS (fromval), raw_buffer); | |
591 | use_buffer = REGISTER_RAW_SIZE (regno); | |
592 | } | |
593 | } | |
c906108c SS |
594 | |
595 | switch (VALUE_LVAL (toval)) | |
596 | { | |
597 | case lval_internalvar: | |
598 | set_internalvar (VALUE_INTERNALVAR (toval), fromval); | |
599 | val = value_copy (VALUE_INTERNALVAR (toval)->value); | |
600 | VALUE_ENCLOSING_TYPE (val) = VALUE_ENCLOSING_TYPE (fromval); | |
601 | VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval); | |
602 | VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval); | |
603 | return val; | |
604 | ||
605 | case lval_internalvar_component: | |
606 | set_internalvar_component (VALUE_INTERNALVAR (toval), | |
607 | VALUE_OFFSET (toval), | |
608 | VALUE_BITPOS (toval), | |
609 | VALUE_BITSIZE (toval), | |
610 | fromval); | |
611 | break; | |
612 | ||
613 | case lval_memory: | |
614 | { | |
615 | char *dest_buffer; | |
c5aa993b JM |
616 | CORE_ADDR changed_addr; |
617 | int changed_len; | |
c906108c | 618 | |
c5aa993b JM |
619 | if (VALUE_BITSIZE (toval)) |
620 | { | |
c906108c SS |
621 | char buffer[sizeof (LONGEST)]; |
622 | /* We assume that the argument to read_memory is in units of | |
623 | host chars. FIXME: Is that correct? */ | |
624 | changed_len = (VALUE_BITPOS (toval) | |
c5aa993b JM |
625 | + VALUE_BITSIZE (toval) |
626 | + HOST_CHAR_BIT - 1) | |
627 | / HOST_CHAR_BIT; | |
c906108c SS |
628 | |
629 | if (changed_len > (int) sizeof (LONGEST)) | |
630 | error ("Can't handle bitfields which don't fit in a %d bit word.", | |
631 | sizeof (LONGEST) * HOST_CHAR_BIT); | |
632 | ||
633 | read_memory (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), | |
634 | buffer, changed_len); | |
635 | modify_field (buffer, value_as_long (fromval), | |
636 | VALUE_BITPOS (toval), VALUE_BITSIZE (toval)); | |
637 | changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval); | |
638 | dest_buffer = buffer; | |
639 | } | |
640 | else if (use_buffer) | |
641 | { | |
642 | changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval); | |
643 | changed_len = use_buffer; | |
644 | dest_buffer = raw_buffer; | |
645 | } | |
646 | else | |
647 | { | |
648 | changed_addr = VALUE_ADDRESS (toval) + VALUE_OFFSET (toval); | |
649 | changed_len = TYPE_LENGTH (type); | |
650 | dest_buffer = VALUE_CONTENTS (fromval); | |
651 | } | |
652 | ||
653 | write_memory (changed_addr, dest_buffer, changed_len); | |
654 | if (memory_changed_hook) | |
655 | memory_changed_hook (changed_addr, changed_len); | |
656 | } | |
657 | break; | |
658 | ||
659 | case lval_register: | |
660 | if (VALUE_BITSIZE (toval)) | |
661 | { | |
662 | char buffer[sizeof (LONGEST)]; | |
8903de4f FN |
663 | int len = |
664 | REGISTER_RAW_SIZE (VALUE_REGNO (toval)) - VALUE_OFFSET (toval); | |
c906108c SS |
665 | |
666 | if (len > (int) sizeof (LONGEST)) | |
667 | error ("Can't handle bitfields in registers larger than %d bits.", | |
668 | sizeof (LONGEST) * HOST_CHAR_BIT); | |
669 | ||
670 | if (VALUE_BITPOS (toval) + VALUE_BITSIZE (toval) | |
671 | > len * HOST_CHAR_BIT) | |
672 | /* Getting this right would involve being very careful about | |
673 | byte order. */ | |
c2d11a7d JM |
674 | error ("Can't assign to bitfields that cross register " |
675 | "boundaries."); | |
c906108c | 676 | |
c5aa993b JM |
677 | read_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), |
678 | buffer, len); | |
679 | modify_field (buffer, value_as_long (fromval), | |
680 | VALUE_BITPOS (toval), VALUE_BITSIZE (toval)); | |
681 | write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), | |
682 | buffer, len); | |
c906108c SS |
683 | } |
684 | else if (use_buffer) | |
685 | write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), | |
686 | raw_buffer, use_buffer); | |
687 | else | |
c5aa993b | 688 | { |
c906108c SS |
689 | /* Do any conversion necessary when storing this type to more |
690 | than one register. */ | |
691 | #ifdef REGISTER_CONVERT_FROM_TYPE | |
692 | memcpy (raw_buffer, VALUE_CONTENTS (fromval), TYPE_LENGTH (type)); | |
c5aa993b | 693 | REGISTER_CONVERT_FROM_TYPE (VALUE_REGNO (toval), type, raw_buffer); |
c906108c SS |
694 | write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), |
695 | raw_buffer, TYPE_LENGTH (type)); | |
696 | #else | |
697 | write_register_bytes (VALUE_ADDRESS (toval) + VALUE_OFFSET (toval), | |
c5aa993b | 698 | VALUE_CONTENTS (fromval), TYPE_LENGTH (type)); |
c906108c SS |
699 | #endif |
700 | } | |
701 | /* Assigning to the stack pointer, frame pointer, and other | |
7b83ea04 AC |
702 | (architecture and calling convention specific) registers may |
703 | cause the frame cache to be out of date. We just do this | |
704 | on all assignments to registers for simplicity; I doubt the slowdown | |
705 | matters. */ | |
c906108c SS |
706 | reinit_frame_cache (); |
707 | break; | |
708 | ||
709 | case lval_reg_frame_relative: | |
710 | { | |
711 | /* value is stored in a series of registers in the frame | |
712 | specified by the structure. Copy that value out, modify | |
713 | it, and copy it back in. */ | |
714 | int amount_to_copy = (VALUE_BITSIZE (toval) ? 1 : TYPE_LENGTH (type)); | |
715 | int reg_size = REGISTER_RAW_SIZE (VALUE_FRAME_REGNUM (toval)); | |
716 | int byte_offset = VALUE_OFFSET (toval) % reg_size; | |
717 | int reg_offset = VALUE_OFFSET (toval) / reg_size; | |
718 | int amount_copied; | |
719 | ||
720 | /* Make the buffer large enough in all cases. */ | |
721 | char *buffer = (char *) alloca (amount_to_copy | |
722 | + sizeof (LONGEST) | |
723 | + MAX_REGISTER_RAW_SIZE); | |
724 | ||
725 | int regno; | |
726 | struct frame_info *frame; | |
727 | ||
728 | /* Figure out which frame this is in currently. */ | |
729 | for (frame = get_current_frame (); | |
730 | frame && FRAME_FP (frame) != VALUE_FRAME (toval); | |
731 | frame = get_prev_frame (frame)) | |
732 | ; | |
733 | ||
734 | if (!frame) | |
735 | error ("Value being assigned to is no longer active."); | |
736 | ||
737 | amount_to_copy += (reg_size - amount_to_copy % reg_size); | |
738 | ||
739 | /* Copy it out. */ | |
740 | for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset, | |
741 | amount_copied = 0); | |
742 | amount_copied < amount_to_copy; | |
743 | amount_copied += reg_size, regno++) | |
744 | { | |
745 | get_saved_register (buffer + amount_copied, | |
c5aa993b JM |
746 | (int *) NULL, (CORE_ADDR *) NULL, |
747 | frame, regno, (enum lval_type *) NULL); | |
c906108c SS |
748 | } |
749 | ||
750 | /* Modify what needs to be modified. */ | |
751 | if (VALUE_BITSIZE (toval)) | |
752 | modify_field (buffer + byte_offset, | |
753 | value_as_long (fromval), | |
754 | VALUE_BITPOS (toval), VALUE_BITSIZE (toval)); | |
755 | else if (use_buffer) | |
756 | memcpy (buffer + byte_offset, raw_buffer, use_buffer); | |
757 | else | |
758 | memcpy (buffer + byte_offset, VALUE_CONTENTS (fromval), | |
759 | TYPE_LENGTH (type)); | |
760 | ||
761 | /* Copy it back. */ | |
762 | for ((regno = VALUE_FRAME_REGNUM (toval) + reg_offset, | |
763 | amount_copied = 0); | |
764 | amount_copied < amount_to_copy; | |
765 | amount_copied += reg_size, regno++) | |
766 | { | |
767 | enum lval_type lval; | |
768 | CORE_ADDR addr; | |
769 | int optim; | |
770 | ||
771 | /* Just find out where to put it. */ | |
c5aa993b JM |
772 | get_saved_register ((char *) NULL, |
773 | &optim, &addr, frame, regno, &lval); | |
774 | ||
c906108c SS |
775 | if (optim) |
776 | error ("Attempt to assign to a value that was optimized out."); | |
777 | if (lval == lval_memory) | |
778 | write_memory (addr, buffer + amount_copied, reg_size); | |
779 | else if (lval == lval_register) | |
780 | write_register_bytes (addr, buffer + amount_copied, reg_size); | |
781 | else | |
782 | error ("Attempt to assign to an unmodifiable value."); | |
783 | } | |
784 | ||
785 | if (register_changed_hook) | |
786 | register_changed_hook (-1); | |
787 | } | |
788 | break; | |
c5aa993b | 789 | |
c906108c SS |
790 | |
791 | default: | |
792 | error ("Left operand of assignment is not an lvalue."); | |
793 | } | |
794 | ||
795 | /* If the field does not entirely fill a LONGEST, then zero the sign bits. | |
796 | If the field is signed, and is negative, then sign extend. */ | |
797 | if ((VALUE_BITSIZE (toval) > 0) | |
798 | && (VALUE_BITSIZE (toval) < 8 * (int) sizeof (LONGEST))) | |
799 | { | |
800 | LONGEST fieldval = value_as_long (fromval); | |
801 | LONGEST valmask = (((ULONGEST) 1) << VALUE_BITSIZE (toval)) - 1; | |
802 | ||
803 | fieldval &= valmask; | |
804 | if (!TYPE_UNSIGNED (type) && (fieldval & (valmask ^ (valmask >> 1)))) | |
805 | fieldval |= ~valmask; | |
806 | ||
807 | fromval = value_from_longest (type, fieldval); | |
808 | } | |
809 | ||
810 | val = value_copy (toval); | |
811 | memcpy (VALUE_CONTENTS_RAW (val), VALUE_CONTENTS (fromval), | |
812 | TYPE_LENGTH (type)); | |
813 | VALUE_TYPE (val) = type; | |
814 | VALUE_ENCLOSING_TYPE (val) = VALUE_ENCLOSING_TYPE (fromval); | |
815 | VALUE_EMBEDDED_OFFSET (val) = VALUE_EMBEDDED_OFFSET (fromval); | |
816 | VALUE_POINTED_TO_OFFSET (val) = VALUE_POINTED_TO_OFFSET (fromval); | |
c5aa993b | 817 | |
c906108c SS |
818 | return val; |
819 | } | |
820 | ||
821 | /* Extend a value VAL to COUNT repetitions of its type. */ | |
822 | ||
823 | value_ptr | |
824 | value_repeat (arg1, count) | |
825 | value_ptr arg1; | |
826 | int count; | |
827 | { | |
828 | register value_ptr val; | |
829 | ||
830 | if (VALUE_LVAL (arg1) != lval_memory) | |
831 | error ("Only values in memory can be extended with '@'."); | |
832 | if (count < 1) | |
833 | error ("Invalid number %d of repetitions.", count); | |
834 | ||
835 | val = allocate_repeat_value (VALUE_ENCLOSING_TYPE (arg1), count); | |
836 | ||
837 | read_memory (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1), | |
838 | VALUE_CONTENTS_ALL_RAW (val), | |
839 | TYPE_LENGTH (VALUE_ENCLOSING_TYPE (val))); | |
840 | VALUE_LVAL (val) = lval_memory; | |
841 | VALUE_ADDRESS (val) = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1); | |
842 | ||
843 | return val; | |
844 | } | |
845 | ||
846 | value_ptr | |
847 | value_of_variable (var, b) | |
848 | struct symbol *var; | |
849 | struct block *b; | |
850 | { | |
851 | value_ptr val; | |
852 | struct frame_info *frame = NULL; | |
853 | ||
854 | if (!b) | |
855 | frame = NULL; /* Use selected frame. */ | |
856 | else if (symbol_read_needs_frame (var)) | |
857 | { | |
858 | frame = block_innermost_frame (b); | |
859 | if (!frame) | |
c5aa993b | 860 | { |
c906108c SS |
861 | if (BLOCK_FUNCTION (b) |
862 | && SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b))) | |
863 | error ("No frame is currently executing in block %s.", | |
864 | SYMBOL_SOURCE_NAME (BLOCK_FUNCTION (b))); | |
865 | else | |
866 | error ("No frame is currently executing in specified block"); | |
c5aa993b | 867 | } |
c906108c SS |
868 | } |
869 | ||
870 | val = read_var_value (var, frame); | |
871 | if (!val) | |
872 | error ("Address of symbol \"%s\" is unknown.", SYMBOL_SOURCE_NAME (var)); | |
873 | ||
874 | return val; | |
875 | } | |
876 | ||
877 | /* Given a value which is an array, return a value which is a pointer to its | |
878 | first element, regardless of whether or not the array has a nonzero lower | |
879 | bound. | |
880 | ||
881 | FIXME: A previous comment here indicated that this routine should be | |
882 | substracting the array's lower bound. It's not clear to me that this | |
883 | is correct. Given an array subscripting operation, it would certainly | |
884 | work to do the adjustment here, essentially computing: | |
885 | ||
886 | (&array[0] - (lowerbound * sizeof array[0])) + (index * sizeof array[0]) | |
887 | ||
888 | However I believe a more appropriate and logical place to account for | |
889 | the lower bound is to do so in value_subscript, essentially computing: | |
890 | ||
891 | (&array[0] + ((index - lowerbound) * sizeof array[0])) | |
892 | ||
893 | As further evidence consider what would happen with operations other | |
894 | than array subscripting, where the caller would get back a value that | |
895 | had an address somewhere before the actual first element of the array, | |
896 | and the information about the lower bound would be lost because of | |
897 | the coercion to pointer type. | |
c5aa993b | 898 | */ |
c906108c SS |
899 | |
900 | value_ptr | |
901 | value_coerce_array (arg1) | |
902 | value_ptr arg1; | |
903 | { | |
904 | register struct type *type = check_typedef (VALUE_TYPE (arg1)); | |
905 | ||
906 | if (VALUE_LVAL (arg1) != lval_memory) | |
907 | error ("Attempt to take address of value not located in memory."); | |
908 | ||
4478b372 JB |
909 | return value_from_pointer (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
910 | (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1))); | |
c906108c SS |
911 | } |
912 | ||
913 | /* Given a value which is a function, return a value which is a pointer | |
914 | to it. */ | |
915 | ||
916 | value_ptr | |
917 | value_coerce_function (arg1) | |
918 | value_ptr arg1; | |
919 | { | |
920 | value_ptr retval; | |
921 | ||
922 | if (VALUE_LVAL (arg1) != lval_memory) | |
923 | error ("Attempt to take address of value not located in memory."); | |
924 | ||
4478b372 JB |
925 | retval = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)), |
926 | (VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1))); | |
c906108c SS |
927 | VALUE_BFD_SECTION (retval) = VALUE_BFD_SECTION (arg1); |
928 | return retval; | |
c5aa993b | 929 | } |
c906108c SS |
930 | |
931 | /* Return a pointer value for the object for which ARG1 is the contents. */ | |
932 | ||
933 | value_ptr | |
934 | value_addr (arg1) | |
935 | value_ptr arg1; | |
936 | { | |
937 | value_ptr arg2; | |
938 | ||
939 | struct type *type = check_typedef (VALUE_TYPE (arg1)); | |
940 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
941 | { | |
942 | /* Copy the value, but change the type from (T&) to (T*). | |
7b83ea04 AC |
943 | We keep the same location information, which is efficient, |
944 | and allows &(&X) to get the location containing the reference. */ | |
c906108c SS |
945 | arg2 = value_copy (arg1); |
946 | VALUE_TYPE (arg2) = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
947 | return arg2; | |
948 | } | |
949 | if (TYPE_CODE (type) == TYPE_CODE_FUNC) | |
950 | return value_coerce_function (arg1); | |
951 | ||
952 | if (VALUE_LVAL (arg1) != lval_memory) | |
953 | error ("Attempt to take address of value not located in memory."); | |
954 | ||
c5aa993b | 955 | /* Get target memory address */ |
4478b372 JB |
956 | arg2 = value_from_pointer (lookup_pointer_type (VALUE_TYPE (arg1)), |
957 | (VALUE_ADDRESS (arg1) | |
958 | + VALUE_OFFSET (arg1) | |
959 | + VALUE_EMBEDDED_OFFSET (arg1))); | |
c906108c SS |
960 | |
961 | /* This may be a pointer to a base subobject; so remember the | |
c5aa993b | 962 | full derived object's type ... */ |
c906108c | 963 | VALUE_ENCLOSING_TYPE (arg2) = lookup_pointer_type (VALUE_ENCLOSING_TYPE (arg1)); |
c5aa993b JM |
964 | /* ... and also the relative position of the subobject in the full object */ |
965 | VALUE_POINTED_TO_OFFSET (arg2) = VALUE_EMBEDDED_OFFSET (arg1); | |
c906108c SS |
966 | VALUE_BFD_SECTION (arg2) = VALUE_BFD_SECTION (arg1); |
967 | return arg2; | |
968 | } | |
969 | ||
970 | /* Given a value of a pointer type, apply the C unary * operator to it. */ | |
971 | ||
972 | value_ptr | |
973 | value_ind (arg1) | |
974 | value_ptr arg1; | |
975 | { | |
976 | struct type *base_type; | |
977 | value_ptr arg2; | |
c906108c SS |
978 | |
979 | COERCE_ARRAY (arg1); | |
980 | ||
981 | base_type = check_typedef (VALUE_TYPE (arg1)); | |
982 | ||
983 | if (TYPE_CODE (base_type) == TYPE_CODE_MEMBER) | |
984 | error ("not implemented: member types in value_ind"); | |
985 | ||
986 | /* Allow * on an integer so we can cast it to whatever we want. | |
987 | This returns an int, which seems like the most C-like thing | |
988 | to do. "long long" variables are rare enough that | |
989 | BUILTIN_TYPE_LONGEST would seem to be a mistake. */ | |
990 | if (TYPE_CODE (base_type) == TYPE_CODE_INT) | |
991 | return value_at (builtin_type_int, | |
992 | (CORE_ADDR) value_as_long (arg1), | |
993 | VALUE_BFD_SECTION (arg1)); | |
994 | else if (TYPE_CODE (base_type) == TYPE_CODE_PTR) | |
995 | { | |
996 | struct type *enc_type; | |
997 | /* We may be pointing to something embedded in a larger object */ | |
c5aa993b | 998 | /* Get the real type of the enclosing object */ |
c906108c SS |
999 | enc_type = check_typedef (VALUE_ENCLOSING_TYPE (arg1)); |
1000 | enc_type = TYPE_TARGET_TYPE (enc_type); | |
c5aa993b JM |
1001 | /* Retrieve the enclosing object pointed to */ |
1002 | arg2 = value_at_lazy (enc_type, | |
1003 | value_as_pointer (arg1) - VALUE_POINTED_TO_OFFSET (arg1), | |
1004 | VALUE_BFD_SECTION (arg1)); | |
1005 | /* Re-adjust type */ | |
c906108c SS |
1006 | VALUE_TYPE (arg2) = TYPE_TARGET_TYPE (base_type); |
1007 | /* Add embedding info */ | |
1008 | VALUE_ENCLOSING_TYPE (arg2) = enc_type; | |
1009 | VALUE_EMBEDDED_OFFSET (arg2) = VALUE_POINTED_TO_OFFSET (arg1); | |
1010 | ||
1011 | /* We may be pointing to an object of some derived type */ | |
1012 | arg2 = value_full_object (arg2, NULL, 0, 0, 0); | |
1013 | return arg2; | |
1014 | } | |
1015 | ||
1016 | error ("Attempt to take contents of a non-pointer value."); | |
c5aa993b | 1017 | return 0; /* For lint -- never reached */ |
c906108c SS |
1018 | } |
1019 | \f | |
1020 | /* Pushing small parts of stack frames. */ | |
1021 | ||
1022 | /* Push one word (the size of object that a register holds). */ | |
1023 | ||
1024 | CORE_ADDR | |
1025 | push_word (sp, word) | |
1026 | CORE_ADDR sp; | |
1027 | ULONGEST word; | |
1028 | { | |
1029 | register int len = REGISTER_SIZE; | |
1030 | char buffer[MAX_REGISTER_RAW_SIZE]; | |
1031 | ||
1032 | store_unsigned_integer (buffer, len, word); | |
1033 | if (INNER_THAN (1, 2)) | |
1034 | { | |
1035 | /* stack grows downward */ | |
1036 | sp -= len; | |
1037 | write_memory (sp, buffer, len); | |
1038 | } | |
1039 | else | |
1040 | { | |
1041 | /* stack grows upward */ | |
1042 | write_memory (sp, buffer, len); | |
1043 | sp += len; | |
1044 | } | |
1045 | ||
1046 | return sp; | |
1047 | } | |
1048 | ||
1049 | /* Push LEN bytes with data at BUFFER. */ | |
1050 | ||
1051 | CORE_ADDR | |
1052 | push_bytes (sp, buffer, len) | |
1053 | CORE_ADDR sp; | |
1054 | char *buffer; | |
1055 | int len; | |
1056 | { | |
1057 | if (INNER_THAN (1, 2)) | |
1058 | { | |
1059 | /* stack grows downward */ | |
1060 | sp -= len; | |
1061 | write_memory (sp, buffer, len); | |
1062 | } | |
1063 | else | |
1064 | { | |
1065 | /* stack grows upward */ | |
1066 | write_memory (sp, buffer, len); | |
1067 | sp += len; | |
1068 | } | |
1069 | ||
1070 | return sp; | |
1071 | } | |
1072 | ||
2df3850c JM |
1073 | #ifndef PARM_BOUNDARY |
1074 | #define PARM_BOUNDARY (0) | |
1075 | #endif | |
1076 | ||
1077 | /* Push onto the stack the specified value VALUE. Pad it correctly for | |
1078 | it to be an argument to a function. */ | |
c906108c | 1079 | |
c906108c SS |
1080 | static CORE_ADDR |
1081 | value_push (sp, arg) | |
1082 | register CORE_ADDR sp; | |
1083 | value_ptr arg; | |
1084 | { | |
1085 | register int len = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (arg)); | |
917317f4 | 1086 | register int container_len = len; |
2df3850c JM |
1087 | register int offset; |
1088 | ||
1089 | /* How big is the container we're going to put this value in? */ | |
1090 | if (PARM_BOUNDARY) | |
1091 | container_len = ((len + PARM_BOUNDARY / TARGET_CHAR_BIT - 1) | |
1092 | & ~(PARM_BOUNDARY / TARGET_CHAR_BIT - 1)); | |
1093 | ||
1094 | /* Are we going to put it at the high or low end of the container? */ | |
1095 | if (TARGET_BYTE_ORDER == BIG_ENDIAN) | |
1096 | offset = container_len - len; | |
1097 | else | |
1098 | offset = 0; | |
c906108c SS |
1099 | |
1100 | if (INNER_THAN (1, 2)) | |
1101 | { | |
1102 | /* stack grows downward */ | |
2df3850c JM |
1103 | sp -= container_len; |
1104 | write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len); | |
c906108c SS |
1105 | } |
1106 | else | |
1107 | { | |
1108 | /* stack grows upward */ | |
2df3850c JM |
1109 | write_memory (sp + offset, VALUE_CONTENTS_ALL (arg), len); |
1110 | sp += container_len; | |
c906108c SS |
1111 | } |
1112 | ||
1113 | return sp; | |
1114 | } | |
1115 | ||
392a587b JM |
1116 | #ifndef PUSH_ARGUMENTS |
1117 | #define PUSH_ARGUMENTS default_push_arguments | |
1118 | #endif | |
1119 | ||
1120 | CORE_ADDR | |
ac9a91a7 | 1121 | default_push_arguments (nargs, args, sp, struct_return, struct_addr) |
392a587b JM |
1122 | int nargs; |
1123 | value_ptr *args; | |
392a587b | 1124 | CORE_ADDR sp; |
ac9a91a7 | 1125 | int struct_return; |
392a587b JM |
1126 | CORE_ADDR struct_addr; |
1127 | { | |
1128 | /* ASSERT ( !struct_return); */ | |
1129 | int i; | |
1130 | for (i = nargs - 1; i >= 0; i--) | |
1131 | sp = value_push (sp, args[i]); | |
1132 | return sp; | |
1133 | } | |
1134 | ||
c906108c | 1135 | |
b9a8e3bf JB |
1136 | /* A default function for COERCE_FLOAT_TO_DOUBLE: do the coercion only |
1137 | when we don't have any type for the argument at hand. This occurs | |
1138 | when we have no debug info, or when passing varargs. | |
1139 | ||
1140 | This is an annoying default: the rule the compiler follows is to do | |
1141 | the standard promotions whenever there is no prototype in scope, | |
1142 | and almost all targets want this behavior. But there are some old | |
1143 | architectures which want this odd behavior. If you want to go | |
1144 | through them all and fix them, please do. Modern gdbarch-style | |
1145 | targets may find it convenient to use standard_coerce_float_to_double. */ | |
1146 | int | |
1147 | default_coerce_float_to_double (struct type *formal, struct type *actual) | |
1148 | { | |
1149 | return formal == NULL; | |
1150 | } | |
1151 | ||
1152 | ||
1153 | /* Always coerce floats to doubles when there is no prototype in scope. | |
1154 | If your architecture follows the standard type promotion rules for | |
1155 | calling unprototyped functions, your gdbarch init function can pass | |
1156 | this function to set_gdbarch_coerce_float_to_double to use its logic. */ | |
1157 | int | |
1158 | standard_coerce_float_to_double (struct type *formal, struct type *actual) | |
1159 | { | |
1160 | return 1; | |
1161 | } | |
1162 | ||
1163 | ||
c906108c SS |
1164 | /* Perform the standard coercions that are specified |
1165 | for arguments to be passed to C functions. | |
1166 | ||
1167 | If PARAM_TYPE is non-NULL, it is the expected parameter type. | |
1168 | IS_PROTOTYPED is non-zero if the function declaration is prototyped. */ | |
1169 | ||
1170 | static value_ptr | |
1171 | value_arg_coerce (arg, param_type, is_prototyped) | |
1172 | value_ptr arg; | |
1173 | struct type *param_type; | |
1174 | int is_prototyped; | |
1175 | { | |
1176 | register struct type *arg_type = check_typedef (VALUE_TYPE (arg)); | |
1177 | register struct type *type | |
c5aa993b | 1178 | = param_type ? check_typedef (param_type) : arg_type; |
c906108c SS |
1179 | |
1180 | switch (TYPE_CODE (type)) | |
1181 | { | |
1182 | case TYPE_CODE_REF: | |
1183 | if (TYPE_CODE (arg_type) != TYPE_CODE_REF) | |
1184 | { | |
1185 | arg = value_addr (arg); | |
1186 | VALUE_TYPE (arg) = param_type; | |
1187 | return arg; | |
1188 | } | |
1189 | break; | |
1190 | case TYPE_CODE_INT: | |
1191 | case TYPE_CODE_CHAR: | |
1192 | case TYPE_CODE_BOOL: | |
1193 | case TYPE_CODE_ENUM: | |
1194 | /* If we don't have a prototype, coerce to integer type if necessary. */ | |
1195 | if (!is_prototyped) | |
1196 | { | |
1197 | if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int)) | |
1198 | type = builtin_type_int; | |
1199 | } | |
1200 | /* Currently all target ABIs require at least the width of an integer | |
7b83ea04 AC |
1201 | type for an argument. We may have to conditionalize the following |
1202 | type coercion for future targets. */ | |
c906108c SS |
1203 | if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_int)) |
1204 | type = builtin_type_int; | |
1205 | break; | |
1206 | case TYPE_CODE_FLT: | |
1207 | /* FIXME: We should always convert floats to doubles in the | |
7b83ea04 AC |
1208 | non-prototyped case. As many debugging formats include |
1209 | no information about prototyping, we have to live with | |
1210 | COERCE_FLOAT_TO_DOUBLE for now. */ | |
b9a8e3bf | 1211 | if (!is_prototyped && COERCE_FLOAT_TO_DOUBLE (param_type, arg_type)) |
c906108c SS |
1212 | { |
1213 | if (TYPE_LENGTH (type) < TYPE_LENGTH (builtin_type_double)) | |
1214 | type = builtin_type_double; | |
1215 | else if (TYPE_LENGTH (type) > TYPE_LENGTH (builtin_type_double)) | |
1216 | type = builtin_type_long_double; | |
1217 | } | |
1218 | break; | |
1219 | case TYPE_CODE_FUNC: | |
1220 | type = lookup_pointer_type (type); | |
1221 | break; | |
1222 | case TYPE_CODE_ARRAY: | |
1223 | if (current_language->c_style_arrays) | |
1224 | type = lookup_pointer_type (TYPE_TARGET_TYPE (type)); | |
1225 | break; | |
1226 | case TYPE_CODE_UNDEF: | |
1227 | case TYPE_CODE_PTR: | |
1228 | case TYPE_CODE_STRUCT: | |
1229 | case TYPE_CODE_UNION: | |
1230 | case TYPE_CODE_VOID: | |
1231 | case TYPE_CODE_SET: | |
1232 | case TYPE_CODE_RANGE: | |
1233 | case TYPE_CODE_STRING: | |
1234 | case TYPE_CODE_BITSTRING: | |
1235 | case TYPE_CODE_ERROR: | |
1236 | case TYPE_CODE_MEMBER: | |
1237 | case TYPE_CODE_METHOD: | |
1238 | case TYPE_CODE_COMPLEX: | |
1239 | default: | |
1240 | break; | |
1241 | } | |
1242 | ||
1243 | return value_cast (type, arg); | |
1244 | } | |
1245 | ||
070ad9f0 | 1246 | /* Determine a function's address and its return type from its value. |
c906108c SS |
1247 | Calls error() if the function is not valid for calling. */ |
1248 | ||
1249 | static CORE_ADDR | |
1250 | find_function_addr (function, retval_type) | |
1251 | value_ptr function; | |
1252 | struct type **retval_type; | |
1253 | { | |
1254 | register struct type *ftype = check_typedef (VALUE_TYPE (function)); | |
1255 | register enum type_code code = TYPE_CODE (ftype); | |
1256 | struct type *value_type; | |
1257 | CORE_ADDR funaddr; | |
1258 | ||
1259 | /* If it's a member function, just look at the function | |
1260 | part of it. */ | |
1261 | ||
1262 | /* Determine address to call. */ | |
1263 | if (code == TYPE_CODE_FUNC || code == TYPE_CODE_METHOD) | |
1264 | { | |
1265 | funaddr = VALUE_ADDRESS (function); | |
1266 | value_type = TYPE_TARGET_TYPE (ftype); | |
1267 | } | |
1268 | else if (code == TYPE_CODE_PTR) | |
1269 | { | |
1270 | funaddr = value_as_pointer (function); | |
1271 | ftype = check_typedef (TYPE_TARGET_TYPE (ftype)); | |
1272 | if (TYPE_CODE (ftype) == TYPE_CODE_FUNC | |
1273 | || TYPE_CODE (ftype) == TYPE_CODE_METHOD) | |
1274 | { | |
1275 | #ifdef CONVERT_FROM_FUNC_PTR_ADDR | |
1276 | /* FIXME: This is a workaround for the unusual function | |
1277 | pointer representation on the RS/6000, see comment | |
1278 | in config/rs6000/tm-rs6000.h */ | |
1279 | funaddr = CONVERT_FROM_FUNC_PTR_ADDR (funaddr); | |
1280 | #endif | |
1281 | value_type = TYPE_TARGET_TYPE (ftype); | |
1282 | } | |
1283 | else | |
1284 | value_type = builtin_type_int; | |
1285 | } | |
1286 | else if (code == TYPE_CODE_INT) | |
1287 | { | |
1288 | /* Handle the case of functions lacking debugging info. | |
7b83ea04 | 1289 | Their values are characters since their addresses are char */ |
c906108c SS |
1290 | if (TYPE_LENGTH (ftype) == 1) |
1291 | funaddr = value_as_pointer (value_addr (function)); | |
1292 | else | |
1293 | /* Handle integer used as address of a function. */ | |
1294 | funaddr = (CORE_ADDR) value_as_long (function); | |
1295 | ||
1296 | value_type = builtin_type_int; | |
1297 | } | |
1298 | else | |
1299 | error ("Invalid data type for function to be called."); | |
1300 | ||
1301 | *retval_type = value_type; | |
1302 | return funaddr; | |
1303 | } | |
1304 | ||
1305 | /* All this stuff with a dummy frame may seem unnecessarily complicated | |
1306 | (why not just save registers in GDB?). The purpose of pushing a dummy | |
1307 | frame which looks just like a real frame is so that if you call a | |
1308 | function and then hit a breakpoint (get a signal, etc), "backtrace" | |
1309 | will look right. Whether the backtrace needs to actually show the | |
1310 | stack at the time the inferior function was called is debatable, but | |
1311 | it certainly needs to not display garbage. So if you are contemplating | |
1312 | making dummy frames be different from normal frames, consider that. */ | |
1313 | ||
1314 | /* Perform a function call in the inferior. | |
1315 | ARGS is a vector of values of arguments (NARGS of them). | |
1316 | FUNCTION is a value, the function to be called. | |
1317 | Returns a value representing what the function returned. | |
1318 | May fail to return, if a breakpoint or signal is hit | |
1319 | during the execution of the function. | |
1320 | ||
1321 | ARGS is modified to contain coerced values. */ | |
1322 | ||
a14ed312 KB |
1323 | static value_ptr hand_function_call (value_ptr function, int nargs, |
1324 | value_ptr * args); | |
7a292a7a SS |
1325 | static value_ptr |
1326 | hand_function_call (function, nargs, args) | |
c906108c SS |
1327 | value_ptr function; |
1328 | int nargs; | |
1329 | value_ptr *args; | |
1330 | { | |
1331 | register CORE_ADDR sp; | |
1332 | register int i; | |
da59e081 | 1333 | int rc; |
c906108c SS |
1334 | CORE_ADDR start_sp; |
1335 | /* CALL_DUMMY is an array of words (REGISTER_SIZE), but each word | |
1336 | is in host byte order. Before calling FIX_CALL_DUMMY, we byteswap it | |
1337 | and remove any extra bytes which might exist because ULONGEST is | |
070ad9f0 | 1338 | bigger than REGISTER_SIZE. |
c906108c SS |
1339 | |
1340 | NOTE: This is pretty wierd, as the call dummy is actually a | |
c5aa993b JM |
1341 | sequence of instructions. But CISC machines will have |
1342 | to pack the instructions into REGISTER_SIZE units (and | |
1343 | so will RISC machines for which INSTRUCTION_SIZE is not | |
1344 | REGISTER_SIZE). | |
7a292a7a SS |
1345 | |
1346 | NOTE: This is pretty stupid. CALL_DUMMY should be in strict | |
c5aa993b | 1347 | target byte order. */ |
c906108c | 1348 | |
7a292a7a SS |
1349 | static ULONGEST *dummy; |
1350 | int sizeof_dummy1; | |
1351 | char *dummy1; | |
c906108c SS |
1352 | CORE_ADDR old_sp; |
1353 | struct type *value_type; | |
1354 | unsigned char struct_return; | |
1355 | CORE_ADDR struct_addr = 0; | |
7a292a7a | 1356 | struct inferior_status *inf_status; |
c906108c SS |
1357 | struct cleanup *old_chain; |
1358 | CORE_ADDR funaddr; | |
c5aa993b | 1359 | int using_gcc; /* Set to version of gcc in use, or zero if not gcc */ |
c906108c SS |
1360 | CORE_ADDR real_pc; |
1361 | struct type *param_type = NULL; | |
1362 | struct type *ftype = check_typedef (SYMBOL_TYPE (function)); | |
1363 | ||
7a292a7a SS |
1364 | dummy = alloca (SIZEOF_CALL_DUMMY_WORDS); |
1365 | sizeof_dummy1 = REGISTER_SIZE * SIZEOF_CALL_DUMMY_WORDS / sizeof (ULONGEST); | |
1366 | dummy1 = alloca (sizeof_dummy1); | |
1367 | memcpy (dummy, CALL_DUMMY_WORDS, SIZEOF_CALL_DUMMY_WORDS); | |
1368 | ||
c906108c | 1369 | if (!target_has_execution) |
c5aa993b | 1370 | noprocess (); |
c906108c | 1371 | |
7a292a7a | 1372 | inf_status = save_inferior_status (1); |
74b7792f | 1373 | old_chain = make_cleanup_restore_inferior_status (inf_status); |
c906108c SS |
1374 | |
1375 | /* PUSH_DUMMY_FRAME is responsible for saving the inferior registers | |
1376 | (and POP_FRAME for restoring them). (At least on most machines) | |
1377 | they are saved on the stack in the inferior. */ | |
1378 | PUSH_DUMMY_FRAME; | |
1379 | ||
1380 | old_sp = sp = read_sp (); | |
1381 | ||
1382 | if (INNER_THAN (1, 2)) | |
1383 | { | |
1384 | /* Stack grows down */ | |
7a292a7a | 1385 | sp -= sizeof_dummy1; |
c906108c SS |
1386 | start_sp = sp; |
1387 | } | |
1388 | else | |
1389 | { | |
1390 | /* Stack grows up */ | |
1391 | start_sp = sp; | |
7a292a7a | 1392 | sp += sizeof_dummy1; |
c906108c SS |
1393 | } |
1394 | ||
1395 | funaddr = find_function_addr (function, &value_type); | |
1396 | CHECK_TYPEDEF (value_type); | |
1397 | ||
1398 | { | |
1399 | struct block *b = block_for_pc (funaddr); | |
1400 | /* If compiled without -g, assume GCC 2. */ | |
1401 | using_gcc = (b == NULL ? 2 : BLOCK_GCC_COMPILED (b)); | |
1402 | } | |
1403 | ||
1404 | /* Are we returning a value using a structure return or a normal | |
1405 | value return? */ | |
1406 | ||
1407 | struct_return = using_struct_return (function, funaddr, value_type, | |
1408 | using_gcc); | |
1409 | ||
1410 | /* Create a call sequence customized for this function | |
1411 | and the number of arguments for it. */ | |
7a292a7a | 1412 | for (i = 0; i < (int) (SIZEOF_CALL_DUMMY_WORDS / sizeof (dummy[0])); i++) |
c906108c SS |
1413 | store_unsigned_integer (&dummy1[i * REGISTER_SIZE], |
1414 | REGISTER_SIZE, | |
c5aa993b | 1415 | (ULONGEST) dummy[i]); |
c906108c SS |
1416 | |
1417 | #ifdef GDB_TARGET_IS_HPPA | |
1418 | real_pc = FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args, | |
1419 | value_type, using_gcc); | |
1420 | #else | |
1421 | FIX_CALL_DUMMY (dummy1, start_sp, funaddr, nargs, args, | |
1422 | value_type, using_gcc); | |
1423 | real_pc = start_sp; | |
1424 | #endif | |
1425 | ||
7a292a7a SS |
1426 | if (CALL_DUMMY_LOCATION == ON_STACK) |
1427 | { | |
c5aa993b | 1428 | write_memory (start_sp, (char *) dummy1, sizeof_dummy1); |
7a292a7a | 1429 | } |
c906108c | 1430 | |
7a292a7a SS |
1431 | if (CALL_DUMMY_LOCATION == BEFORE_TEXT_END) |
1432 | { | |
1433 | /* Convex Unix prohibits executing in the stack segment. */ | |
1434 | /* Hope there is empty room at the top of the text segment. */ | |
1435 | extern CORE_ADDR text_end; | |
392a587b | 1436 | static int checked = 0; |
7a292a7a SS |
1437 | if (!checked) |
1438 | for (start_sp = text_end - sizeof_dummy1; start_sp < text_end; ++start_sp) | |
1439 | if (read_memory_integer (start_sp, 1) != 0) | |
1440 | error ("text segment full -- no place to put call"); | |
1441 | checked = 1; | |
1442 | sp = old_sp; | |
1443 | real_pc = text_end - sizeof_dummy1; | |
c5aa993b | 1444 | write_memory (real_pc, (char *) dummy1, sizeof_dummy1); |
7a292a7a | 1445 | } |
c5aa993b | 1446 | |
7a292a7a SS |
1447 | if (CALL_DUMMY_LOCATION == AFTER_TEXT_END) |
1448 | { | |
1449 | extern CORE_ADDR text_end; | |
1450 | int errcode; | |
1451 | sp = old_sp; | |
1452 | real_pc = text_end; | |
c5aa993b | 1453 | errcode = target_write_memory (real_pc, (char *) dummy1, sizeof_dummy1); |
7a292a7a SS |
1454 | if (errcode != 0) |
1455 | error ("Cannot write text segment -- call_function failed"); | |
1456 | } | |
c906108c | 1457 | |
7a292a7a SS |
1458 | if (CALL_DUMMY_LOCATION == AT_ENTRY_POINT) |
1459 | { | |
1460 | real_pc = funaddr; | |
1461 | } | |
c906108c SS |
1462 | |
1463 | #ifdef lint | |
c5aa993b | 1464 | sp = old_sp; /* It really is used, for some ifdef's... */ |
c906108c SS |
1465 | #endif |
1466 | ||
1467 | if (nargs < TYPE_NFIELDS (ftype)) | |
1468 | error ("too few arguments in function call"); | |
1469 | ||
1470 | for (i = nargs - 1; i >= 0; i--) | |
1471 | { | |
1472 | /* If we're off the end of the known arguments, do the standard | |
7b83ea04 AC |
1473 | promotions. FIXME: if we had a prototype, this should only |
1474 | be allowed if ... were present. */ | |
c906108c SS |
1475 | if (i >= TYPE_NFIELDS (ftype)) |
1476 | args[i] = value_arg_coerce (args[i], NULL, 0); | |
1477 | ||
c5aa993b | 1478 | else |
c906108c SS |
1479 | { |
1480 | int is_prototyped = TYPE_FLAGS (ftype) & TYPE_FLAG_PROTOTYPED; | |
1481 | param_type = TYPE_FIELD_TYPE (ftype, i); | |
1482 | ||
1483 | args[i] = value_arg_coerce (args[i], param_type, is_prototyped); | |
1484 | } | |
1485 | ||
070ad9f0 DB |
1486 | /*elz: this code is to handle the case in which the function to be called |
1487 | has a pointer to function as parameter and the corresponding actual argument | |
7b83ea04 AC |
1488 | is the address of a function and not a pointer to function variable. |
1489 | In aCC compiled code, the calls through pointers to functions (in the body | |
1490 | of the function called by hand) are made via $$dyncall_external which | |
070ad9f0 DB |
1491 | requires some registers setting, this is taken care of if we call |
1492 | via a function pointer variable, but not via a function address. | |
7b83ea04 | 1493 | In cc this is not a problem. */ |
c906108c SS |
1494 | |
1495 | if (using_gcc == 0) | |
1496 | if (param_type) | |
c5aa993b | 1497 | /* if this parameter is a pointer to function */ |
c906108c SS |
1498 | if (TYPE_CODE (param_type) == TYPE_CODE_PTR) |
1499 | if (TYPE_CODE (param_type->target_type) == TYPE_CODE_FUNC) | |
070ad9f0 | 1500 | /* elz: FIXME here should go the test about the compiler used |
7b83ea04 | 1501 | to compile the target. We want to issue the error |
070ad9f0 DB |
1502 | message only if the compiler used was HP's aCC. |
1503 | If we used HP's cc, then there is no problem and no need | |
7b83ea04 | 1504 | to return at this point */ |
c5aa993b | 1505 | if (using_gcc == 0) /* && compiler == aCC */ |
c906108c | 1506 | /* go see if the actual parameter is a variable of type |
c5aa993b | 1507 | pointer to function or just a function */ |
c906108c SS |
1508 | if (args[i]->lval == not_lval) |
1509 | { | |
1510 | char *arg_name; | |
c5aa993b JM |
1511 | if (find_pc_partial_function ((CORE_ADDR) args[i]->aligner.contents[0], &arg_name, NULL, NULL)) |
1512 | error ("\ | |
c906108c SS |
1513 | You cannot use function <%s> as argument. \n\ |
1514 | You must use a pointer to function type variable. Command ignored.", arg_name); | |
c5aa993b | 1515 | } |
c906108c SS |
1516 | } |
1517 | ||
d03e67c9 AC |
1518 | if (REG_STRUCT_HAS_ADDR_P ()) |
1519 | { | |
1520 | /* This is a machine like the sparc, where we may need to pass a | |
1521 | pointer to the structure, not the structure itself. */ | |
1522 | for (i = nargs - 1; i >= 0; i--) | |
1523 | { | |
1524 | struct type *arg_type = check_typedef (VALUE_TYPE (args[i])); | |
1525 | if ((TYPE_CODE (arg_type) == TYPE_CODE_STRUCT | |
1526 | || TYPE_CODE (arg_type) == TYPE_CODE_UNION | |
1527 | || TYPE_CODE (arg_type) == TYPE_CODE_ARRAY | |
1528 | || TYPE_CODE (arg_type) == TYPE_CODE_STRING | |
1529 | || TYPE_CODE (arg_type) == TYPE_CODE_BITSTRING | |
1530 | || TYPE_CODE (arg_type) == TYPE_CODE_SET | |
1531 | || (TYPE_CODE (arg_type) == TYPE_CODE_FLT | |
1532 | && TYPE_LENGTH (arg_type) > 8) | |
1533 | ) | |
1534 | && REG_STRUCT_HAS_ADDR (using_gcc, arg_type)) | |
1535 | { | |
1536 | CORE_ADDR addr; | |
1537 | int len; /* = TYPE_LENGTH (arg_type); */ | |
1538 | int aligned_len; | |
1539 | arg_type = check_typedef (VALUE_ENCLOSING_TYPE (args[i])); | |
1540 | len = TYPE_LENGTH (arg_type); | |
1541 | ||
1542 | if (STACK_ALIGN_P ()) | |
1543 | /* MVS 11/22/96: I think at least some of this | |
1544 | stack_align code is really broken. Better to let | |
1545 | PUSH_ARGUMENTS adjust the stack in a target-defined | |
1546 | manner. */ | |
1547 | aligned_len = STACK_ALIGN (len); | |
1548 | else | |
1549 | aligned_len = len; | |
1550 | if (INNER_THAN (1, 2)) | |
1551 | { | |
1552 | /* stack grows downward */ | |
1553 | sp -= aligned_len; | |
1554 | } | |
1555 | else | |
1556 | { | |
1557 | /* The stack grows up, so the address of the thing | |
1558 | we push is the stack pointer before we push it. */ | |
1559 | addr = sp; | |
1560 | } | |
1561 | /* Push the structure. */ | |
1562 | write_memory (sp, VALUE_CONTENTS_ALL (args[i]), len); | |
1563 | if (INNER_THAN (1, 2)) | |
1564 | { | |
1565 | /* The stack grows down, so the address of the thing | |
1566 | we push is the stack pointer after we push it. */ | |
1567 | addr = sp; | |
1568 | } | |
1569 | else | |
1570 | { | |
1571 | /* stack grows upward */ | |
1572 | sp += aligned_len; | |
1573 | } | |
1574 | /* The value we're going to pass is the address of the | |
1575 | thing we just pushed. */ | |
1576 | /*args[i] = value_from_longest (lookup_pointer_type (value_type), | |
1577 | (LONGEST) addr); */ | |
1578 | args[i] = value_from_pointer (lookup_pointer_type (arg_type), | |
1579 | addr); | |
1580 | } | |
1581 | } | |
1582 | } | |
1583 | ||
c906108c SS |
1584 | |
1585 | /* Reserve space for the return structure to be written on the | |
1586 | stack, if necessary */ | |
1587 | ||
1588 | if (struct_return) | |
1589 | { | |
1590 | int len = TYPE_LENGTH (value_type); | |
2ada493a AC |
1591 | if (STACK_ALIGN_P ()) |
1592 | /* MVS 11/22/96: I think at least some of this stack_align | |
1593 | code is really broken. Better to let PUSH_ARGUMENTS adjust | |
1594 | the stack in a target-defined manner. */ | |
1595 | len = STACK_ALIGN (len); | |
c906108c SS |
1596 | if (INNER_THAN (1, 2)) |
1597 | { | |
1598 | /* stack grows downward */ | |
1599 | sp -= len; | |
1600 | struct_addr = sp; | |
1601 | } | |
1602 | else | |
1603 | { | |
1604 | /* stack grows upward */ | |
1605 | struct_addr = sp; | |
1606 | sp += len; | |
1607 | } | |
1608 | } | |
1609 | ||
1610 | /* elz: on HPPA no need for this extra alignment, maybe it is needed | |
1611 | on other architectures. This is because all the alignment is taken care | |
070ad9f0 | 1612 | of in the above code (ifdef REG_STRUCT_HAS_ADDR) and in |
c5aa993b | 1613 | hppa_push_arguments */ |
c906108c SS |
1614 | #ifndef NO_EXTRA_ALIGNMENT_NEEDED |
1615 | ||
c906108c SS |
1616 | /* MVS 11/22/96: I think at least some of this stack_align code is |
1617 | really broken. Better to let PUSH_ARGUMENTS adjust the stack in | |
1618 | a target-defined manner. */ | |
2ada493a | 1619 | if (STACK_ALIGN_P () && INNER_THAN (1, 2)) |
c906108c SS |
1620 | { |
1621 | /* If stack grows down, we must leave a hole at the top. */ | |
1622 | int len = 0; | |
1623 | ||
1624 | for (i = nargs - 1; i >= 0; i--) | |
1625 | len += TYPE_LENGTH (VALUE_ENCLOSING_TYPE (args[i])); | |
7a292a7a SS |
1626 | if (CALL_DUMMY_STACK_ADJUST_P) |
1627 | len += CALL_DUMMY_STACK_ADJUST; | |
c906108c SS |
1628 | sp -= STACK_ALIGN (len) - len; |
1629 | } | |
c906108c SS |
1630 | #endif /* NO_EXTRA_ALIGNMENT_NEEDED */ |
1631 | ||
392a587b | 1632 | sp = PUSH_ARGUMENTS (nargs, args, sp, struct_return, struct_addr); |
c906108c SS |
1633 | |
1634 | #ifdef PUSH_RETURN_ADDRESS /* for targets that use no CALL_DUMMY */ | |
1635 | /* There are a number of targets now which actually don't write any | |
1636 | CALL_DUMMY instructions into the target, but instead just save the | |
1637 | machine state, push the arguments, and jump directly to the callee | |
1638 | function. Since this doesn't actually involve executing a JSR/BSR | |
1639 | instruction, the return address must be set up by hand, either by | |
1640 | pushing onto the stack or copying into a return-address register | |
070ad9f0 | 1641 | as appropriate. Formerly this has been done in PUSH_ARGUMENTS, |
c906108c SS |
1642 | but that's overloading its functionality a bit, so I'm making it |
1643 | explicit to do it here. */ | |
c5aa993b JM |
1644 | sp = PUSH_RETURN_ADDRESS (real_pc, sp); |
1645 | #endif /* PUSH_RETURN_ADDRESS */ | |
c906108c | 1646 | |
2ada493a | 1647 | if (STACK_ALIGN_P () && !INNER_THAN (1, 2)) |
c906108c SS |
1648 | { |
1649 | /* If stack grows up, we must leave a hole at the bottom, note | |
7b83ea04 | 1650 | that sp already has been advanced for the arguments! */ |
7a292a7a SS |
1651 | if (CALL_DUMMY_STACK_ADJUST_P) |
1652 | sp += CALL_DUMMY_STACK_ADJUST; | |
c906108c SS |
1653 | sp = STACK_ALIGN (sp); |
1654 | } | |
c906108c SS |
1655 | |
1656 | /* XXX This seems wrong. For stacks that grow down we shouldn't do | |
1657 | anything here! */ | |
1658 | /* MVS 11/22/96: I think at least some of this stack_align code is | |
1659 | really broken. Better to let PUSH_ARGUMENTS adjust the stack in | |
1660 | a target-defined manner. */ | |
7a292a7a SS |
1661 | if (CALL_DUMMY_STACK_ADJUST_P) |
1662 | if (INNER_THAN (1, 2)) | |
1663 | { | |
1664 | /* stack grows downward */ | |
1665 | sp -= CALL_DUMMY_STACK_ADJUST; | |
1666 | } | |
c906108c SS |
1667 | |
1668 | /* Store the address at which the structure is supposed to be | |
1669 | written. Note that this (and the code which reserved the space | |
1670 | above) assumes that gcc was used to compile this function. Since | |
1671 | it doesn't cost us anything but space and if the function is pcc | |
1672 | it will ignore this value, we will make that assumption. | |
1673 | ||
070ad9f0 | 1674 | Also note that on some machines (like the sparc) pcc uses a |
c906108c SS |
1675 | convention like gcc's. */ |
1676 | ||
1677 | if (struct_return) | |
1678 | STORE_STRUCT_RETURN (struct_addr, sp); | |
1679 | ||
1680 | /* Write the stack pointer. This is here because the statements above | |
1681 | might fool with it. On SPARC, this write also stores the register | |
1682 | window into the right place in the new stack frame, which otherwise | |
1683 | wouldn't happen. (See store_inferior_registers in sparc-nat.c.) */ | |
1684 | write_sp (sp); | |
1685 | ||
d1e3cf49 AC |
1686 | if (SAVE_DUMMY_FRAME_TOS_P ()) |
1687 | SAVE_DUMMY_FRAME_TOS (sp); | |
43ff13b4 | 1688 | |
c906108c SS |
1689 | { |
1690 | char retbuf[REGISTER_BYTES]; | |
1691 | char *name; | |
1692 | struct symbol *symbol; | |
1693 | ||
1694 | name = NULL; | |
1695 | symbol = find_pc_function (funaddr); | |
1696 | if (symbol) | |
1697 | { | |
1698 | name = SYMBOL_SOURCE_NAME (symbol); | |
1699 | } | |
1700 | else | |
1701 | { | |
1702 | /* Try the minimal symbols. */ | |
1703 | struct minimal_symbol *msymbol = lookup_minimal_symbol_by_pc (funaddr); | |
1704 | ||
1705 | if (msymbol) | |
1706 | { | |
1707 | name = SYMBOL_SOURCE_NAME (msymbol); | |
1708 | } | |
1709 | } | |
1710 | if (name == NULL) | |
1711 | { | |
1712 | char format[80]; | |
1713 | sprintf (format, "at %s", local_hex_format ()); | |
1714 | name = alloca (80); | |
1715 | /* FIXME-32x64: assumes funaddr fits in a long. */ | |
1716 | sprintf (name, format, (unsigned long) funaddr); | |
1717 | } | |
1718 | ||
1719 | /* Execute the stack dummy routine, calling FUNCTION. | |
1720 | When it is done, discard the empty frame | |
1721 | after storing the contents of all regs into retbuf. */ | |
da59e081 JM |
1722 | rc = run_stack_dummy (real_pc + CALL_DUMMY_START_OFFSET, retbuf); |
1723 | ||
1724 | if (rc == 1) | |
1725 | { | |
1726 | /* We stopped inside the FUNCTION because of a random signal. | |
1727 | Further execution of the FUNCTION is not allowed. */ | |
1728 | ||
7b83ea04 | 1729 | if (unwind_on_signal_p) |
242bfc55 FN |
1730 | { |
1731 | /* The user wants the context restored. */ | |
da59e081 | 1732 | |
7b83ea04 AC |
1733 | /* We must get back to the frame we were before the dummy call. */ |
1734 | POP_FRAME; | |
242bfc55 FN |
1735 | |
1736 | /* FIXME: Insert a bunch of wrap_here; name can be very long if it's | |
1737 | a C++ name with arguments and stuff. */ | |
1738 | error ("\ | |
1739 | The program being debugged was signaled while in a function called from GDB.\n\ | |
1740 | GDB has restored the context to what it was before the call.\n\ | |
1741 | To change this behavior use \"set unwindonsignal off\"\n\ | |
da59e081 | 1742 | Evaluation of the expression containing the function (%s) will be abandoned.", |
242bfc55 FN |
1743 | name); |
1744 | } | |
1745 | else | |
1746 | { | |
1747 | /* The user wants to stay in the frame where we stopped (default).*/ | |
1748 | ||
1749 | /* If we did the cleanups, we would print a spurious error | |
1750 | message (Unable to restore previously selected frame), | |
1751 | would write the registers from the inf_status (which is | |
1752 | wrong), and would do other wrong things. */ | |
1753 | discard_cleanups (old_chain); | |
1754 | discard_inferior_status (inf_status); | |
1755 | ||
1756 | /* FIXME: Insert a bunch of wrap_here; name can be very long if it's | |
1757 | a C++ name with arguments and stuff. */ | |
1758 | error ("\ | |
1759 | The program being debugged was signaled while in a function called from GDB.\n\ | |
1760 | GDB remains in the frame where the signal was received.\n\ | |
1761 | To change this behavior use \"set unwindonsignal on\"\n\ | |
1762 | Evaluation of the expression containing the function (%s) will be abandoned.", | |
1763 | name); | |
1764 | } | |
da59e081 JM |
1765 | } |
1766 | ||
1767 | if (rc == 2) | |
c906108c | 1768 | { |
da59e081 | 1769 | /* We hit a breakpoint inside the FUNCTION. */ |
c906108c | 1770 | |
7a292a7a SS |
1771 | /* If we did the cleanups, we would print a spurious error |
1772 | message (Unable to restore previously selected frame), | |
1773 | would write the registers from the inf_status (which is | |
1774 | wrong), and would do other wrong things. */ | |
c906108c | 1775 | discard_cleanups (old_chain); |
7a292a7a | 1776 | discard_inferior_status (inf_status); |
c906108c SS |
1777 | |
1778 | /* The following error message used to say "The expression | |
1779 | which contained the function call has been discarded." It | |
1780 | is a hard concept to explain in a few words. Ideally, GDB | |
1781 | would be able to resume evaluation of the expression when | |
1782 | the function finally is done executing. Perhaps someday | |
1783 | this will be implemented (it would not be easy). */ | |
1784 | ||
1785 | /* FIXME: Insert a bunch of wrap_here; name can be very long if it's | |
1786 | a C++ name with arguments and stuff. */ | |
1787 | error ("\ | |
1788 | The program being debugged stopped while in a function called from GDB.\n\ | |
1789 | When the function (%s) is done executing, GDB will silently\n\ | |
1790 | stop (instead of continuing to evaluate the expression containing\n\ | |
1791 | the function call).", name); | |
1792 | } | |
1793 | ||
da59e081 | 1794 | /* If we get here the called FUNCTION run to completion. */ |
c906108c SS |
1795 | do_cleanups (old_chain); |
1796 | ||
1797 | /* Figure out the value returned by the function. */ | |
1798 | /* elz: I defined this new macro for the hppa architecture only. | |
1799 | this gives us a way to get the value returned by the function from the stack, | |
1800 | at the same address we told the function to put it. | |
1801 | We cannot assume on the pa that r28 still contains the address of the returned | |
1802 | structure. Usually this will be overwritten by the callee. | |
1803 | I don't know about other architectures, so I defined this macro | |
c5aa993b | 1804 | */ |
c906108c SS |
1805 | |
1806 | #ifdef VALUE_RETURNED_FROM_STACK | |
1807 | if (struct_return) | |
1808 | return (value_ptr) VALUE_RETURNED_FROM_STACK (value_type, struct_addr); | |
1809 | #endif | |
1810 | ||
1811 | return value_being_returned (value_type, retbuf, struct_return); | |
1812 | } | |
1813 | } | |
7a292a7a | 1814 | |
c906108c SS |
1815 | value_ptr |
1816 | call_function_by_hand (function, nargs, args) | |
1817 | value_ptr function; | |
1818 | int nargs; | |
1819 | value_ptr *args; | |
1820 | { | |
7a292a7a SS |
1821 | if (CALL_DUMMY_P) |
1822 | { | |
1823 | return hand_function_call (function, nargs, args); | |
1824 | } | |
1825 | else | |
1826 | { | |
1827 | error ("Cannot invoke functions on this machine."); | |
1828 | } | |
c906108c | 1829 | } |
c5aa993b | 1830 | \f |
7a292a7a | 1831 | |
c906108c | 1832 | |
c906108c SS |
1833 | /* Create a value for an array by allocating space in the inferior, copying |
1834 | the data into that space, and then setting up an array value. | |
1835 | ||
1836 | The array bounds are set from LOWBOUND and HIGHBOUND, and the array is | |
1837 | populated from the values passed in ELEMVEC. | |
1838 | ||
1839 | The element type of the array is inherited from the type of the | |
1840 | first element, and all elements must have the same size (though we | |
1841 | don't currently enforce any restriction on their types). */ | |
1842 | ||
1843 | value_ptr | |
1844 | value_array (lowbound, highbound, elemvec) | |
1845 | int lowbound; | |
1846 | int highbound; | |
1847 | value_ptr *elemvec; | |
1848 | { | |
1849 | int nelem; | |
1850 | int idx; | |
1851 | unsigned int typelength; | |
1852 | value_ptr val; | |
1853 | struct type *rangetype; | |
1854 | struct type *arraytype; | |
1855 | CORE_ADDR addr; | |
1856 | ||
1857 | /* Validate that the bounds are reasonable and that each of the elements | |
1858 | have the same size. */ | |
1859 | ||
1860 | nelem = highbound - lowbound + 1; | |
1861 | if (nelem <= 0) | |
1862 | { | |
1863 | error ("bad array bounds (%d, %d)", lowbound, highbound); | |
1864 | } | |
1865 | typelength = TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[0])); | |
1866 | for (idx = 1; idx < nelem; idx++) | |
1867 | { | |
1868 | if (TYPE_LENGTH (VALUE_ENCLOSING_TYPE (elemvec[idx])) != typelength) | |
1869 | { | |
1870 | error ("array elements must all be the same size"); | |
1871 | } | |
1872 | } | |
1873 | ||
1874 | rangetype = create_range_type ((struct type *) NULL, builtin_type_int, | |
1875 | lowbound, highbound); | |
c5aa993b JM |
1876 | arraytype = create_array_type ((struct type *) NULL, |
1877 | VALUE_ENCLOSING_TYPE (elemvec[0]), rangetype); | |
c906108c SS |
1878 | |
1879 | if (!current_language->c_style_arrays) | |
1880 | { | |
1881 | val = allocate_value (arraytype); | |
1882 | for (idx = 0; idx < nelem; idx++) | |
1883 | { | |
1884 | memcpy (VALUE_CONTENTS_ALL_RAW (val) + (idx * typelength), | |
1885 | VALUE_CONTENTS_ALL (elemvec[idx]), | |
1886 | typelength); | |
1887 | } | |
1888 | VALUE_BFD_SECTION (val) = VALUE_BFD_SECTION (elemvec[0]); | |
1889 | return val; | |
1890 | } | |
1891 | ||
1892 | /* Allocate space to store the array in the inferior, and then initialize | |
1893 | it by copying in each element. FIXME: Is it worth it to create a | |
1894 | local buffer in which to collect each value and then write all the | |
1895 | bytes in one operation? */ | |
1896 | ||
1897 | addr = allocate_space_in_inferior (nelem * typelength); | |
1898 | for (idx = 0; idx < nelem; idx++) | |
1899 | { | |
1900 | write_memory (addr + (idx * typelength), VALUE_CONTENTS_ALL (elemvec[idx]), | |
1901 | typelength); | |
1902 | } | |
1903 | ||
1904 | /* Create the array type and set up an array value to be evaluated lazily. */ | |
1905 | ||
1906 | val = value_at_lazy (arraytype, addr, VALUE_BFD_SECTION (elemvec[0])); | |
1907 | return (val); | |
1908 | } | |
1909 | ||
1910 | /* Create a value for a string constant by allocating space in the inferior, | |
1911 | copying the data into that space, and returning the address with type | |
1912 | TYPE_CODE_STRING. PTR points to the string constant data; LEN is number | |
1913 | of characters. | |
1914 | Note that string types are like array of char types with a lower bound of | |
1915 | zero and an upper bound of LEN - 1. Also note that the string may contain | |
1916 | embedded null bytes. */ | |
1917 | ||
1918 | value_ptr | |
1919 | value_string (ptr, len) | |
1920 | char *ptr; | |
1921 | int len; | |
1922 | { | |
1923 | value_ptr val; | |
1924 | int lowbound = current_language->string_lower_bound; | |
1925 | struct type *rangetype = create_range_type ((struct type *) NULL, | |
1926 | builtin_type_int, | |
1927 | lowbound, len + lowbound - 1); | |
1928 | struct type *stringtype | |
c5aa993b | 1929 | = create_string_type ((struct type *) NULL, rangetype); |
c906108c SS |
1930 | CORE_ADDR addr; |
1931 | ||
1932 | if (current_language->c_style_arrays == 0) | |
1933 | { | |
1934 | val = allocate_value (stringtype); | |
1935 | memcpy (VALUE_CONTENTS_RAW (val), ptr, len); | |
1936 | return val; | |
1937 | } | |
1938 | ||
1939 | ||
1940 | /* Allocate space to store the string in the inferior, and then | |
1941 | copy LEN bytes from PTR in gdb to that address in the inferior. */ | |
1942 | ||
1943 | addr = allocate_space_in_inferior (len); | |
1944 | write_memory (addr, ptr, len); | |
1945 | ||
1946 | val = value_at_lazy (stringtype, addr, NULL); | |
1947 | return (val); | |
1948 | } | |
1949 | ||
1950 | value_ptr | |
1951 | value_bitstring (ptr, len) | |
1952 | char *ptr; | |
1953 | int len; | |
1954 | { | |
1955 | value_ptr val; | |
1956 | struct type *domain_type = create_range_type (NULL, builtin_type_int, | |
1957 | 0, len - 1); | |
c5aa993b | 1958 | struct type *type = create_set_type ((struct type *) NULL, domain_type); |
c906108c SS |
1959 | TYPE_CODE (type) = TYPE_CODE_BITSTRING; |
1960 | val = allocate_value (type); | |
1961 | memcpy (VALUE_CONTENTS_RAW (val), ptr, TYPE_LENGTH (type)); | |
1962 | return val; | |
1963 | } | |
1964 | \f | |
1965 | /* See if we can pass arguments in T2 to a function which takes arguments | |
1966 | of types T1. Both t1 and t2 are NULL-terminated vectors. If some | |
1967 | arguments need coercion of some sort, then the coerced values are written | |
1968 | into T2. Return value is 0 if the arguments could be matched, or the | |
1969 | position at which they differ if not. | |
1970 | ||
1971 | STATICP is nonzero if the T1 argument list came from a | |
1972 | static member function. | |
1973 | ||
1974 | For non-static member functions, we ignore the first argument, | |
1975 | which is the type of the instance variable. This is because we want | |
1976 | to handle calls with objects from derived classes. This is not | |
1977 | entirely correct: we should actually check to make sure that a | |
1978 | requested operation is type secure, shouldn't we? FIXME. */ | |
1979 | ||
1980 | static int | |
1981 | typecmp (staticp, t1, t2) | |
1982 | int staticp; | |
1983 | struct type *t1[]; | |
1984 | value_ptr t2[]; | |
1985 | { | |
1986 | int i; | |
1987 | ||
1988 | if (t2 == 0) | |
1989 | return 1; | |
1990 | if (staticp && t1 == 0) | |
1991 | return t2[1] != 0; | |
1992 | if (t1 == 0) | |
1993 | return 1; | |
c5aa993b JM |
1994 | if (TYPE_CODE (t1[0]) == TYPE_CODE_VOID) |
1995 | return 0; | |
1996 | if (t1[!staticp] == 0) | |
1997 | return 0; | |
c906108c SS |
1998 | for (i = !staticp; t1[i] && TYPE_CODE (t1[i]) != TYPE_CODE_VOID; i++) |
1999 | { | |
c5aa993b JM |
2000 | struct type *tt1, *tt2; |
2001 | if (!t2[i]) | |
2002 | return i + 1; | |
c906108c | 2003 | tt1 = check_typedef (t1[i]); |
c5aa993b | 2004 | tt2 = check_typedef (VALUE_TYPE (t2[i])); |
c906108c | 2005 | if (TYPE_CODE (tt1) == TYPE_CODE_REF |
c5aa993b | 2006 | /* We should be doing hairy argument matching, as below. */ |
c906108c SS |
2007 | && (TYPE_CODE (check_typedef (TYPE_TARGET_TYPE (tt1))) == TYPE_CODE (tt2))) |
2008 | { | |
2009 | if (TYPE_CODE (tt2) == TYPE_CODE_ARRAY) | |
2010 | t2[i] = value_coerce_array (t2[i]); | |
2011 | else | |
2012 | t2[i] = value_addr (t2[i]); | |
2013 | continue; | |
2014 | } | |
2015 | ||
2016 | while (TYPE_CODE (tt1) == TYPE_CODE_PTR | |
c5aa993b JM |
2017 | && (TYPE_CODE (tt2) == TYPE_CODE_ARRAY |
2018 | || TYPE_CODE (tt2) == TYPE_CODE_PTR)) | |
c906108c | 2019 | { |
c5aa993b JM |
2020 | tt1 = check_typedef (TYPE_TARGET_TYPE (tt1)); |
2021 | tt2 = check_typedef (TYPE_TARGET_TYPE (tt2)); | |
c906108c | 2022 | } |
c5aa993b JM |
2023 | if (TYPE_CODE (tt1) == TYPE_CODE (tt2)) |
2024 | continue; | |
c906108c SS |
2025 | /* Array to pointer is a `trivial conversion' according to the ARM. */ |
2026 | ||
2027 | /* We should be doing much hairier argument matching (see section 13.2 | |
7b83ea04 AC |
2028 | of the ARM), but as a quick kludge, just check for the same type |
2029 | code. */ | |
c906108c | 2030 | if (TYPE_CODE (t1[i]) != TYPE_CODE (VALUE_TYPE (t2[i]))) |
c5aa993b | 2031 | return i + 1; |
c906108c | 2032 | } |
c5aa993b JM |
2033 | if (!t1[i]) |
2034 | return 0; | |
2035 | return t2[i] ? i + 1 : 0; | |
c906108c SS |
2036 | } |
2037 | ||
2038 | /* Helper function used by value_struct_elt to recurse through baseclasses. | |
2039 | Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes, | |
2040 | and search in it assuming it has (class) type TYPE. | |
2041 | If found, return value, else return NULL. | |
2042 | ||
2043 | If LOOKING_FOR_BASECLASS, then instead of looking for struct fields, | |
2044 | look for a baseclass named NAME. */ | |
2045 | ||
2046 | static value_ptr | |
2047 | search_struct_field (name, arg1, offset, type, looking_for_baseclass) | |
2048 | char *name; | |
2049 | register value_ptr arg1; | |
2050 | int offset; | |
2051 | register struct type *type; | |
2052 | int looking_for_baseclass; | |
2053 | { | |
2054 | int i; | |
2055 | int nbases = TYPE_N_BASECLASSES (type); | |
2056 | ||
2057 | CHECK_TYPEDEF (type); | |
2058 | ||
c5aa993b | 2059 | if (!looking_for_baseclass) |
c906108c SS |
2060 | for (i = TYPE_NFIELDS (type) - 1; i >= nbases; i--) |
2061 | { | |
2062 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
2063 | ||
db577aea | 2064 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2065 | { |
2066 | value_ptr v; | |
2067 | if (TYPE_FIELD_STATIC (type, i)) | |
2068 | v = value_static_field (type, i); | |
2069 | else | |
2070 | v = value_primitive_field (arg1, offset, i, type); | |
2071 | if (v == 0) | |
c5aa993b | 2072 | error ("there is no field named %s", name); |
c906108c SS |
2073 | return v; |
2074 | } | |
2075 | ||
2076 | if (t_field_name | |
2077 | && (t_field_name[0] == '\0' | |
2078 | || (TYPE_CODE (type) == TYPE_CODE_UNION | |
db577aea | 2079 | && (strcmp_iw (t_field_name, "else") == 0)))) |
c906108c SS |
2080 | { |
2081 | struct type *field_type = TYPE_FIELD_TYPE (type, i); | |
2082 | if (TYPE_CODE (field_type) == TYPE_CODE_UNION | |
2083 | || TYPE_CODE (field_type) == TYPE_CODE_STRUCT) | |
2084 | { | |
2085 | /* Look for a match through the fields of an anonymous union, | |
2086 | or anonymous struct. C++ provides anonymous unions. | |
2087 | ||
2088 | In the GNU Chill implementation of variant record types, | |
2089 | each <alternative field> has an (anonymous) union type, | |
2090 | each member of the union represents a <variant alternative>. | |
2091 | Each <variant alternative> is represented as a struct, | |
2092 | with a member for each <variant field>. */ | |
c5aa993b | 2093 | |
c906108c SS |
2094 | value_ptr v; |
2095 | int new_offset = offset; | |
2096 | ||
2097 | /* This is pretty gross. In G++, the offset in an anonymous | |
2098 | union is relative to the beginning of the enclosing struct. | |
2099 | In the GNU Chill implementation of variant records, | |
2100 | the bitpos is zero in an anonymous union field, so we | |
2101 | have to add the offset of the union here. */ | |
2102 | if (TYPE_CODE (field_type) == TYPE_CODE_STRUCT | |
2103 | || (TYPE_NFIELDS (field_type) > 0 | |
2104 | && TYPE_FIELD_BITPOS (field_type, 0) == 0)) | |
2105 | new_offset += TYPE_FIELD_BITPOS (type, i) / 8; | |
2106 | ||
2107 | v = search_struct_field (name, arg1, new_offset, field_type, | |
2108 | looking_for_baseclass); | |
2109 | if (v) | |
2110 | return v; | |
2111 | } | |
2112 | } | |
2113 | } | |
2114 | ||
c5aa993b | 2115 | for (i = 0; i < nbases; i++) |
c906108c SS |
2116 | { |
2117 | value_ptr v; | |
2118 | struct type *basetype = check_typedef (TYPE_BASECLASS (type, i)); | |
2119 | /* If we are looking for baseclasses, this is what we get when we | |
7b83ea04 AC |
2120 | hit them. But it could happen that the base part's member name |
2121 | is not yet filled in. */ | |
c906108c SS |
2122 | int found_baseclass = (looking_for_baseclass |
2123 | && TYPE_BASECLASS_NAME (type, i) != NULL | |
db577aea | 2124 | && (strcmp_iw (name, TYPE_BASECLASS_NAME (type, i)) == 0)); |
c906108c SS |
2125 | |
2126 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2127 | { | |
2128 | int boffset; | |
2129 | value_ptr v2 = allocate_value (basetype); | |
2130 | ||
2131 | boffset = baseclass_offset (type, i, | |
2132 | VALUE_CONTENTS (arg1) + offset, | |
2133 | VALUE_ADDRESS (arg1) | |
c5aa993b | 2134 | + VALUE_OFFSET (arg1) + offset); |
c906108c SS |
2135 | if (boffset == -1) |
2136 | error ("virtual baseclass botch"); | |
2137 | ||
2138 | /* The virtual base class pointer might have been clobbered by the | |
2139 | user program. Make sure that it still points to a valid memory | |
2140 | location. */ | |
2141 | ||
2142 | boffset += offset; | |
2143 | if (boffset < 0 || boffset >= TYPE_LENGTH (type)) | |
2144 | { | |
2145 | CORE_ADDR base_addr; | |
c5aa993b | 2146 | |
c906108c SS |
2147 | base_addr = VALUE_ADDRESS (arg1) + VALUE_OFFSET (arg1) + boffset; |
2148 | if (target_read_memory (base_addr, VALUE_CONTENTS_RAW (v2), | |
2149 | TYPE_LENGTH (basetype)) != 0) | |
2150 | error ("virtual baseclass botch"); | |
2151 | VALUE_LVAL (v2) = lval_memory; | |
2152 | VALUE_ADDRESS (v2) = base_addr; | |
2153 | } | |
2154 | else | |
2155 | { | |
2156 | VALUE_LVAL (v2) = VALUE_LVAL (arg1); | |
2157 | VALUE_ADDRESS (v2) = VALUE_ADDRESS (arg1); | |
2158 | VALUE_OFFSET (v2) = VALUE_OFFSET (arg1) + boffset; | |
2159 | if (VALUE_LAZY (arg1)) | |
2160 | VALUE_LAZY (v2) = 1; | |
2161 | else | |
2162 | memcpy (VALUE_CONTENTS_RAW (v2), | |
2163 | VALUE_CONTENTS_RAW (arg1) + boffset, | |
2164 | TYPE_LENGTH (basetype)); | |
2165 | } | |
2166 | ||
2167 | if (found_baseclass) | |
2168 | return v2; | |
2169 | v = search_struct_field (name, v2, 0, TYPE_BASECLASS (type, i), | |
2170 | looking_for_baseclass); | |
2171 | } | |
2172 | else if (found_baseclass) | |
2173 | v = value_primitive_field (arg1, offset, i, type); | |
2174 | else | |
2175 | v = search_struct_field (name, arg1, | |
c5aa993b | 2176 | offset + TYPE_BASECLASS_BITPOS (type, i) / 8, |
c906108c | 2177 | basetype, looking_for_baseclass); |
c5aa993b JM |
2178 | if (v) |
2179 | return v; | |
c906108c SS |
2180 | } |
2181 | return NULL; | |
2182 | } | |
2183 | ||
2184 | ||
2185 | /* Return the offset (in bytes) of the virtual base of type BASETYPE | |
2186 | * in an object pointed to by VALADDR (on the host), assumed to be of | |
2187 | * type TYPE. OFFSET is number of bytes beyond start of ARG to start | |
2188 | * looking (in case VALADDR is the contents of an enclosing object). | |
2189 | * | |
2190 | * This routine recurses on the primary base of the derived class because | |
2191 | * the virtual base entries of the primary base appear before the other | |
2192 | * virtual base entries. | |
2193 | * | |
2194 | * If the virtual base is not found, a negative integer is returned. | |
2195 | * The magnitude of the negative integer is the number of entries in | |
2196 | * the virtual table to skip over (entries corresponding to various | |
2197 | * ancestral classes in the chain of primary bases). | |
2198 | * | |
2199 | * Important: This assumes the HP / Taligent C++ runtime | |
2200 | * conventions. Use baseclass_offset() instead to deal with g++ | |
2201 | * conventions. */ | |
2202 | ||
2203 | void | |
c5aa993b JM |
2204 | find_rt_vbase_offset (type, basetype, valaddr, offset, boffset_p, skip_p) |
2205 | struct type *type; | |
2206 | struct type *basetype; | |
2207 | char *valaddr; | |
2208 | int offset; | |
2209 | int *boffset_p; | |
2210 | int *skip_p; | |
c906108c | 2211 | { |
c5aa993b JM |
2212 | int boffset; /* offset of virtual base */ |
2213 | int index; /* displacement to use in virtual table */ | |
c906108c | 2214 | int skip; |
c5aa993b JM |
2215 | |
2216 | value_ptr vp; | |
2217 | CORE_ADDR vtbl; /* the virtual table pointer */ | |
2218 | struct type *pbc; /* the primary base class */ | |
c906108c SS |
2219 | |
2220 | /* Look for the virtual base recursively in the primary base, first. | |
2221 | * This is because the derived class object and its primary base | |
2222 | * subobject share the primary virtual table. */ | |
c5aa993b | 2223 | |
c906108c | 2224 | boffset = 0; |
c5aa993b | 2225 | pbc = TYPE_PRIMARY_BASE (type); |
c906108c SS |
2226 | if (pbc) |
2227 | { | |
2228 | find_rt_vbase_offset (pbc, basetype, valaddr, offset, &boffset, &skip); | |
2229 | if (skip < 0) | |
c5aa993b JM |
2230 | { |
2231 | *boffset_p = boffset; | |
2232 | *skip_p = -1; | |
2233 | return; | |
2234 | } | |
c906108c SS |
2235 | } |
2236 | else | |
2237 | skip = 0; | |
2238 | ||
2239 | ||
2240 | /* Find the index of the virtual base according to HP/Taligent | |
2241 | runtime spec. (Depth-first, left-to-right.) */ | |
2242 | index = virtual_base_index_skip_primaries (basetype, type); | |
2243 | ||
c5aa993b JM |
2244 | if (index < 0) |
2245 | { | |
2246 | *skip_p = skip + virtual_base_list_length_skip_primaries (type); | |
2247 | *boffset_p = 0; | |
2248 | return; | |
2249 | } | |
c906108c | 2250 | |
c5aa993b | 2251 | /* pai: FIXME -- 32x64 possible problem */ |
c906108c | 2252 | /* First word (4 bytes) in object layout is the vtable pointer */ |
c5aa993b | 2253 | vtbl = *(CORE_ADDR *) (valaddr + offset); |
c906108c | 2254 | |
c5aa993b | 2255 | /* Before the constructor is invoked, things are usually zero'd out. */ |
c906108c SS |
2256 | if (vtbl == 0) |
2257 | error ("Couldn't find virtual table -- object may not be constructed yet."); | |
2258 | ||
2259 | ||
2260 | /* Find virtual base's offset -- jump over entries for primary base | |
2261 | * ancestors, then use the index computed above. But also adjust by | |
2262 | * HP_ACC_VBASE_START for the vtable slots before the start of the | |
2263 | * virtual base entries. Offset is negative -- virtual base entries | |
2264 | * appear _before_ the address point of the virtual table. */ | |
c5aa993b | 2265 | |
070ad9f0 | 2266 | /* pai: FIXME -- 32x64 problem, if word = 8 bytes, change multiplier |
c5aa993b | 2267 | & use long type */ |
c906108c SS |
2268 | |
2269 | /* epstein : FIXME -- added param for overlay section. May not be correct */ | |
c5aa993b | 2270 | vp = value_at (builtin_type_int, vtbl + 4 * (-skip - index - HP_ACC_VBASE_START), NULL); |
c906108c SS |
2271 | boffset = value_as_long (vp); |
2272 | *skip_p = -1; | |
2273 | *boffset_p = boffset; | |
2274 | return; | |
2275 | } | |
2276 | ||
2277 | ||
2278 | /* Helper function used by value_struct_elt to recurse through baseclasses. | |
2279 | Look for a field NAME in ARG1. Adjust the address of ARG1 by OFFSET bytes, | |
2280 | and search in it assuming it has (class) type TYPE. | |
2281 | If found, return value, else if name matched and args not return (value)-1, | |
2282 | else return NULL. */ | |
2283 | ||
2284 | static value_ptr | |
2285 | search_struct_method (name, arg1p, args, offset, static_memfuncp, type) | |
2286 | char *name; | |
2287 | register value_ptr *arg1p, *args; | |
2288 | int offset, *static_memfuncp; | |
2289 | register struct type *type; | |
2290 | { | |
2291 | int i; | |
2292 | value_ptr v; | |
2293 | int name_matched = 0; | |
2294 | char dem_opname[64]; | |
2295 | ||
2296 | CHECK_TYPEDEF (type); | |
2297 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) | |
2298 | { | |
2299 | char *t_field_name = TYPE_FN_FIELDLIST_NAME (type, i); | |
2300 | /* FIXME! May need to check for ARM demangling here */ | |
c5aa993b JM |
2301 | if (strncmp (t_field_name, "__", 2) == 0 || |
2302 | strncmp (t_field_name, "op", 2) == 0 || | |
2303 | strncmp (t_field_name, "type", 4) == 0) | |
c906108c | 2304 | { |
c5aa993b JM |
2305 | if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI)) |
2306 | t_field_name = dem_opname; | |
2307 | else if (cplus_demangle_opname (t_field_name, dem_opname, 0)) | |
c906108c | 2308 | t_field_name = dem_opname; |
c906108c | 2309 | } |
db577aea | 2310 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2311 | { |
2312 | int j = TYPE_FN_FIELDLIST_LENGTH (type, i) - 1; | |
2313 | struct fn_field *f = TYPE_FN_FIELDLIST1 (type, i); | |
c5aa993b | 2314 | name_matched = 1; |
c906108c SS |
2315 | |
2316 | if (j > 0 && args == 0) | |
2317 | error ("cannot resolve overloaded method `%s': no arguments supplied", name); | |
2318 | while (j >= 0) | |
2319 | { | |
2320 | if (TYPE_FN_FIELD_STUB (f, j)) | |
2321 | check_stub_method (type, i, j); | |
2322 | if (!typecmp (TYPE_FN_FIELD_STATIC_P (f, j), | |
2323 | TYPE_FN_FIELD_ARGS (f, j), args)) | |
2324 | { | |
2325 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) | |
2326 | return value_virtual_fn_field (arg1p, f, j, type, offset); | |
2327 | if (TYPE_FN_FIELD_STATIC_P (f, j) && static_memfuncp) | |
2328 | *static_memfuncp = 1; | |
2329 | v = value_fn_field (arg1p, f, j, type, offset); | |
c5aa993b JM |
2330 | if (v != NULL) |
2331 | return v; | |
c906108c SS |
2332 | } |
2333 | j--; | |
2334 | } | |
2335 | } | |
2336 | } | |
2337 | ||
2338 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
2339 | { | |
2340 | int base_offset; | |
2341 | ||
2342 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2343 | { | |
c5aa993b JM |
2344 | if (TYPE_HAS_VTABLE (type)) |
2345 | { | |
2346 | /* HP aCC compiled type, search for virtual base offset | |
7b83ea04 | 2347 | according to HP/Taligent runtime spec. */ |
c5aa993b JM |
2348 | int skip; |
2349 | find_rt_vbase_offset (type, TYPE_BASECLASS (type, i), | |
2350 | VALUE_CONTENTS_ALL (*arg1p), | |
2351 | offset + VALUE_EMBEDDED_OFFSET (*arg1p), | |
2352 | &base_offset, &skip); | |
2353 | if (skip >= 0) | |
2354 | error ("Virtual base class offset not found in vtable"); | |
2355 | } | |
2356 | else | |
2357 | { | |
2358 | struct type *baseclass = check_typedef (TYPE_BASECLASS (type, i)); | |
2359 | char *base_valaddr; | |
2360 | ||
2361 | /* The virtual base class pointer might have been clobbered by the | |
7b83ea04 AC |
2362 | user program. Make sure that it still points to a valid memory |
2363 | location. */ | |
c5aa993b JM |
2364 | |
2365 | if (offset < 0 || offset >= TYPE_LENGTH (type)) | |
2366 | { | |
2367 | base_valaddr = (char *) alloca (TYPE_LENGTH (baseclass)); | |
2368 | if (target_read_memory (VALUE_ADDRESS (*arg1p) | |
2369 | + VALUE_OFFSET (*arg1p) + offset, | |
2370 | base_valaddr, | |
2371 | TYPE_LENGTH (baseclass)) != 0) | |
2372 | error ("virtual baseclass botch"); | |
2373 | } | |
2374 | else | |
2375 | base_valaddr = VALUE_CONTENTS (*arg1p) + offset; | |
2376 | ||
2377 | base_offset = | |
2378 | baseclass_offset (type, i, base_valaddr, | |
2379 | VALUE_ADDRESS (*arg1p) | |
2380 | + VALUE_OFFSET (*arg1p) + offset); | |
2381 | if (base_offset == -1) | |
2382 | error ("virtual baseclass botch"); | |
2383 | } | |
2384 | } | |
c906108c SS |
2385 | else |
2386 | { | |
2387 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2388 | } |
c906108c SS |
2389 | v = search_struct_method (name, arg1p, args, base_offset + offset, |
2390 | static_memfuncp, TYPE_BASECLASS (type, i)); | |
c5aa993b | 2391 | if (v == (value_ptr) - 1) |
c906108c SS |
2392 | { |
2393 | name_matched = 1; | |
2394 | } | |
2395 | else if (v) | |
2396 | { | |
2397 | /* FIXME-bothner: Why is this commented out? Why is it here? */ | |
c5aa993b | 2398 | /* *arg1p = arg1_tmp; */ |
c906108c | 2399 | return v; |
c5aa993b | 2400 | } |
c906108c | 2401 | } |
c5aa993b JM |
2402 | if (name_matched) |
2403 | return (value_ptr) - 1; | |
2404 | else | |
2405 | return NULL; | |
c906108c SS |
2406 | } |
2407 | ||
2408 | /* Given *ARGP, a value of type (pointer to a)* structure/union, | |
2409 | extract the component named NAME from the ultimate target structure/union | |
2410 | and return it as a value with its appropriate type. | |
2411 | ERR is used in the error message if *ARGP's type is wrong. | |
2412 | ||
2413 | C++: ARGS is a list of argument types to aid in the selection of | |
2414 | an appropriate method. Also, handle derived types. | |
2415 | ||
2416 | STATIC_MEMFUNCP, if non-NULL, points to a caller-supplied location | |
2417 | where the truthvalue of whether the function that was resolved was | |
2418 | a static member function or not is stored. | |
2419 | ||
2420 | ERR is an error message to be printed in case the field is not found. */ | |
2421 | ||
2422 | value_ptr | |
2423 | value_struct_elt (argp, args, name, static_memfuncp, err) | |
2424 | register value_ptr *argp, *args; | |
2425 | char *name; | |
2426 | int *static_memfuncp; | |
2427 | char *err; | |
2428 | { | |
2429 | register struct type *t; | |
2430 | value_ptr v; | |
2431 | ||
2432 | COERCE_ARRAY (*argp); | |
2433 | ||
2434 | t = check_typedef (VALUE_TYPE (*argp)); | |
2435 | ||
2436 | /* Follow pointers until we get to a non-pointer. */ | |
2437 | ||
2438 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF) | |
2439 | { | |
2440 | *argp = value_ind (*argp); | |
2441 | /* Don't coerce fn pointer to fn and then back again! */ | |
2442 | if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC) | |
2443 | COERCE_ARRAY (*argp); | |
2444 | t = check_typedef (VALUE_TYPE (*argp)); | |
2445 | } | |
2446 | ||
2447 | if (TYPE_CODE (t) == TYPE_CODE_MEMBER) | |
2448 | error ("not implemented: member type in value_struct_elt"); | |
2449 | ||
c5aa993b | 2450 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c SS |
2451 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
2452 | error ("Attempt to extract a component of a value that is not a %s.", err); | |
2453 | ||
2454 | /* Assume it's not, unless we see that it is. */ | |
2455 | if (static_memfuncp) | |
c5aa993b | 2456 | *static_memfuncp = 0; |
c906108c SS |
2457 | |
2458 | if (!args) | |
2459 | { | |
2460 | /* if there are no arguments ...do this... */ | |
2461 | ||
2462 | /* Try as a field first, because if we succeed, there | |
7b83ea04 | 2463 | is less work to be done. */ |
c906108c SS |
2464 | v = search_struct_field (name, *argp, 0, t, 0); |
2465 | if (v) | |
2466 | return v; | |
2467 | ||
2468 | /* C++: If it was not found as a data field, then try to | |
7b83ea04 | 2469 | return it as a pointer to a method. */ |
c906108c SS |
2470 | |
2471 | if (destructor_name_p (name, t)) | |
2472 | error ("Cannot get value of destructor"); | |
2473 | ||
2474 | v = search_struct_method (name, argp, args, 0, static_memfuncp, t); | |
2475 | ||
c5aa993b | 2476 | if (v == (value_ptr) - 1) |
c906108c SS |
2477 | error ("Cannot take address of a method"); |
2478 | else if (v == 0) | |
2479 | { | |
2480 | if (TYPE_NFN_FIELDS (t)) | |
2481 | error ("There is no member or method named %s.", name); | |
2482 | else | |
2483 | error ("There is no member named %s.", name); | |
2484 | } | |
2485 | return v; | |
2486 | } | |
2487 | ||
2488 | if (destructor_name_p (name, t)) | |
2489 | { | |
2490 | if (!args[1]) | |
2491 | { | |
2492 | /* Destructors are a special case. */ | |
2493 | int m_index, f_index; | |
2494 | ||
2495 | v = NULL; | |
2496 | if (get_destructor_fn_field (t, &m_index, &f_index)) | |
2497 | { | |
2498 | v = value_fn_field (NULL, TYPE_FN_FIELDLIST1 (t, m_index), | |
2499 | f_index, NULL, 0); | |
2500 | } | |
2501 | if (v == NULL) | |
2502 | error ("could not find destructor function named %s.", name); | |
2503 | else | |
2504 | return v; | |
2505 | } | |
2506 | else | |
2507 | { | |
2508 | error ("destructor should not have any argument"); | |
2509 | } | |
2510 | } | |
2511 | else | |
2512 | v = search_struct_method (name, argp, args, 0, static_memfuncp, t); | |
2513 | ||
c5aa993b | 2514 | if (v == (value_ptr) - 1) |
c906108c | 2515 | { |
c5aa993b | 2516 | error ("Argument list of %s mismatch with component in the structure.", name); |
c906108c SS |
2517 | } |
2518 | else if (v == 0) | |
2519 | { | |
2520 | /* See if user tried to invoke data as function. If so, | |
7b83ea04 AC |
2521 | hand it back. If it's not callable (i.e., a pointer to function), |
2522 | gdb should give an error. */ | |
c906108c SS |
2523 | v = search_struct_field (name, *argp, 0, t, 0); |
2524 | } | |
2525 | ||
2526 | if (!v) | |
2527 | error ("Structure has no component named %s.", name); | |
2528 | return v; | |
2529 | } | |
2530 | ||
2531 | /* Search through the methods of an object (and its bases) | |
2532 | * to find a specified method. Return the pointer to the | |
2533 | * fn_field list of overloaded instances. | |
2534 | * Helper function for value_find_oload_list. | |
2535 | * ARGP is a pointer to a pointer to a value (the object) | |
2536 | * METHOD is a string containing the method name | |
2537 | * OFFSET is the offset within the value | |
2538 | * STATIC_MEMFUNCP is set if the method is static | |
2539 | * TYPE is the assumed type of the object | |
2540 | * NUM_FNS is the number of overloaded instances | |
2541 | * BASETYPE is set to the actual type of the subobject where the method is found | |
2542 | * BOFFSET is the offset of the base subobject where the method is found */ | |
2543 | ||
7a292a7a | 2544 | static struct fn_field * |
c906108c | 2545 | find_method_list (argp, method, offset, static_memfuncp, type, num_fns, basetype, boffset) |
7a292a7a | 2546 | value_ptr *argp; |
c5aa993b | 2547 | char *method; |
7a292a7a | 2548 | int offset; |
c5aa993b JM |
2549 | int *static_memfuncp; |
2550 | struct type *type; | |
2551 | int *num_fns; | |
2552 | struct type **basetype; | |
2553 | int *boffset; | |
c906108c SS |
2554 | { |
2555 | int i; | |
c5aa993b | 2556 | struct fn_field *f; |
c906108c SS |
2557 | CHECK_TYPEDEF (type); |
2558 | ||
2559 | *num_fns = 0; | |
2560 | ||
c5aa993b JM |
2561 | /* First check in object itself */ |
2562 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; i--) | |
c906108c SS |
2563 | { |
2564 | /* pai: FIXME What about operators and type conversions? */ | |
c5aa993b | 2565 | char *fn_field_name = TYPE_FN_FIELDLIST_NAME (type, i); |
db577aea | 2566 | if (fn_field_name && (strcmp_iw (fn_field_name, method) == 0)) |
c5aa993b JM |
2567 | { |
2568 | *num_fns = TYPE_FN_FIELDLIST_LENGTH (type, i); | |
2569 | *basetype = type; | |
2570 | *boffset = offset; | |
2571 | return TYPE_FN_FIELDLIST1 (type, i); | |
2572 | } | |
2573 | } | |
2574 | ||
c906108c SS |
2575 | /* Not found in object, check in base subobjects */ |
2576 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
2577 | { | |
2578 | int base_offset; | |
2579 | if (BASETYPE_VIA_VIRTUAL (type, i)) | |
2580 | { | |
c5aa993b JM |
2581 | if (TYPE_HAS_VTABLE (type)) |
2582 | { | |
2583 | /* HP aCC compiled type, search for virtual base offset | |
2584 | * according to HP/Taligent runtime spec. */ | |
2585 | int skip; | |
2586 | find_rt_vbase_offset (type, TYPE_BASECLASS (type, i), | |
2587 | VALUE_CONTENTS_ALL (*argp), | |
2588 | offset + VALUE_EMBEDDED_OFFSET (*argp), | |
2589 | &base_offset, &skip); | |
2590 | if (skip >= 0) | |
2591 | error ("Virtual base class offset not found in vtable"); | |
2592 | } | |
2593 | else | |
2594 | { | |
2595 | /* probably g++ runtime model */ | |
2596 | base_offset = VALUE_OFFSET (*argp) + offset; | |
2597 | base_offset = | |
2598 | baseclass_offset (type, i, | |
2599 | VALUE_CONTENTS (*argp) + base_offset, | |
2600 | VALUE_ADDRESS (*argp) + base_offset); | |
2601 | if (base_offset == -1) | |
2602 | error ("virtual baseclass botch"); | |
2603 | } | |
2604 | } | |
2605 | else | |
2606 | /* non-virtual base, simply use bit position from debug info */ | |
c906108c SS |
2607 | { |
2608 | base_offset = TYPE_BASECLASS_BITPOS (type, i) / 8; | |
c5aa993b | 2609 | } |
c906108c | 2610 | f = find_method_list (argp, method, base_offset + offset, |
c5aa993b | 2611 | static_memfuncp, TYPE_BASECLASS (type, i), num_fns, basetype, boffset); |
c906108c | 2612 | if (f) |
c5aa993b | 2613 | return f; |
c906108c | 2614 | } |
c5aa993b | 2615 | return NULL; |
c906108c SS |
2616 | } |
2617 | ||
2618 | /* Return the list of overloaded methods of a specified name. | |
2619 | * ARGP is a pointer to a pointer to a value (the object) | |
2620 | * METHOD is the method name | |
2621 | * OFFSET is the offset within the value contents | |
2622 | * STATIC_MEMFUNCP is set if the method is static | |
2623 | * NUM_FNS is the number of overloaded instances | |
2624 | * BASETYPE is set to the type of the base subobject that defines the method | |
2625 | * BOFFSET is the offset of the base subobject which defines the method */ | |
2626 | ||
2627 | struct fn_field * | |
2628 | value_find_oload_method_list (argp, method, offset, static_memfuncp, num_fns, basetype, boffset) | |
c5aa993b JM |
2629 | value_ptr *argp; |
2630 | char *method; | |
2631 | int offset; | |
2632 | int *static_memfuncp; | |
2633 | int *num_fns; | |
2634 | struct type **basetype; | |
2635 | int *boffset; | |
c906108c | 2636 | { |
c5aa993b | 2637 | struct type *t; |
c906108c SS |
2638 | |
2639 | t = check_typedef (VALUE_TYPE (*argp)); | |
2640 | ||
c5aa993b | 2641 | /* code snarfed from value_struct_elt */ |
c906108c SS |
2642 | while (TYPE_CODE (t) == TYPE_CODE_PTR || TYPE_CODE (t) == TYPE_CODE_REF) |
2643 | { | |
2644 | *argp = value_ind (*argp); | |
2645 | /* Don't coerce fn pointer to fn and then back again! */ | |
2646 | if (TYPE_CODE (VALUE_TYPE (*argp)) != TYPE_CODE_FUNC) | |
2647 | COERCE_ARRAY (*argp); | |
2648 | t = check_typedef (VALUE_TYPE (*argp)); | |
2649 | } | |
c5aa993b | 2650 | |
c906108c SS |
2651 | if (TYPE_CODE (t) == TYPE_CODE_MEMBER) |
2652 | error ("Not implemented: member type in value_find_oload_lis"); | |
c5aa993b JM |
2653 | |
2654 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT | |
2655 | && TYPE_CODE (t) != TYPE_CODE_UNION) | |
c906108c | 2656 | error ("Attempt to extract a component of a value that is not a struct or union"); |
c5aa993b | 2657 | |
c906108c SS |
2658 | /* Assume it's not static, unless we see that it is. */ |
2659 | if (static_memfuncp) | |
c5aa993b | 2660 | *static_memfuncp = 0; |
c906108c SS |
2661 | |
2662 | return find_method_list (argp, method, 0, static_memfuncp, t, num_fns, basetype, boffset); | |
c5aa993b | 2663 | |
c906108c SS |
2664 | } |
2665 | ||
2666 | /* Given an array of argument types (ARGTYPES) (which includes an | |
2667 | entry for "this" in the case of C++ methods), the number of | |
2668 | arguments NARGS, the NAME of a function whether it's a method or | |
2669 | not (METHOD), and the degree of laxness (LAX) in conforming to | |
2670 | overload resolution rules in ANSI C++, find the best function that | |
2671 | matches on the argument types according to the overload resolution | |
2672 | rules. | |
2673 | ||
2674 | In the case of class methods, the parameter OBJ is an object value | |
2675 | in which to search for overloaded methods. | |
2676 | ||
2677 | In the case of non-method functions, the parameter FSYM is a symbol | |
2678 | corresponding to one of the overloaded functions. | |
2679 | ||
2680 | Return value is an integer: 0 -> good match, 10 -> debugger applied | |
2681 | non-standard coercions, 100 -> incompatible. | |
2682 | ||
2683 | If a method is being searched for, VALP will hold the value. | |
2684 | If a non-method is being searched for, SYMP will hold the symbol for it. | |
2685 | ||
2686 | If a method is being searched for, and it is a static method, | |
2687 | then STATICP will point to a non-zero value. | |
2688 | ||
2689 | Note: This function does *not* check the value of | |
2690 | overload_resolution. Caller must check it to see whether overload | |
2691 | resolution is permitted. | |
c5aa993b | 2692 | */ |
c906108c SS |
2693 | |
2694 | int | |
2695 | find_overload_match (arg_types, nargs, name, method, lax, obj, fsym, valp, symp, staticp) | |
c5aa993b JM |
2696 | struct type **arg_types; |
2697 | int nargs; | |
2698 | char *name; | |
2699 | int method; | |
2700 | int lax; | |
2701 | value_ptr obj; | |
2702 | struct symbol *fsym; | |
2703 | value_ptr *valp; | |
2704 | struct symbol **symp; | |
2705 | int *staticp; | |
c906108c SS |
2706 | { |
2707 | int nparms; | |
c5aa993b | 2708 | struct type **parm_types; |
c906108c | 2709 | int champ_nparms = 0; |
c5aa993b JM |
2710 | |
2711 | short oload_champ = -1; /* Index of best overloaded function */ | |
2712 | short oload_ambiguous = 0; /* Current ambiguity state for overload resolution */ | |
2713 | /* 0 => no ambiguity, 1 => two good funcs, 2 => incomparable funcs */ | |
2714 | short oload_ambig_champ = -1; /* 2nd contender for best match */ | |
2715 | short oload_non_standard = 0; /* did we have to use non-standard conversions? */ | |
2716 | short oload_incompatible = 0; /* are args supplied incompatible with any function? */ | |
2717 | ||
2718 | struct badness_vector *bv; /* A measure of how good an overloaded instance is */ | |
2719 | struct badness_vector *oload_champ_bv = NULL; /* The measure for the current best match */ | |
2720 | ||
c906108c | 2721 | value_ptr temp = obj; |
c5aa993b JM |
2722 | struct fn_field *fns_ptr = NULL; /* For methods, the list of overloaded methods */ |
2723 | struct symbol **oload_syms = NULL; /* For non-methods, the list of overloaded function symbols */ | |
2724 | int num_fns = 0; /* Number of overloaded instances being considered */ | |
2725 | struct type *basetype = NULL; | |
c906108c SS |
2726 | int boffset; |
2727 | register int jj; | |
2728 | register int ix; | |
2729 | ||
c5aa993b JM |
2730 | char *obj_type_name = NULL; |
2731 | char *func_name = NULL; | |
c906108c SS |
2732 | |
2733 | /* Get the list of overloaded methods or functions */ | |
2734 | if (method) | |
2735 | { | |
db577aea AC |
2736 | int i; |
2737 | int len; | |
2738 | struct type *domain; | |
c906108c SS |
2739 | obj_type_name = TYPE_NAME (VALUE_TYPE (obj)); |
2740 | /* Hack: evaluate_subexp_standard often passes in a pointer | |
7b83ea04 | 2741 | value rather than the object itself, so try again */ |
c906108c | 2742 | if ((!obj_type_name || !*obj_type_name) && |
c5aa993b JM |
2743 | (TYPE_CODE (VALUE_TYPE (obj)) == TYPE_CODE_PTR)) |
2744 | obj_type_name = TYPE_NAME (TYPE_TARGET_TYPE (VALUE_TYPE (obj))); | |
c906108c SS |
2745 | |
2746 | fns_ptr = value_find_oload_method_list (&temp, name, 0, | |
c5aa993b JM |
2747 | staticp, |
2748 | &num_fns, | |
2749 | &basetype, &boffset); | |
c906108c | 2750 | if (!fns_ptr || !num_fns) |
c5aa993b JM |
2751 | error ("Couldn't find method %s%s%s", |
2752 | obj_type_name, | |
2753 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2754 | name); | |
db577aea AC |
2755 | domain = TYPE_DOMAIN_TYPE (fns_ptr[0].type); |
2756 | len = TYPE_NFN_FIELDS (domain); | |
2757 | /* NOTE: dan/2000-03-10: This stuff is for STABS, which won't | |
2758 | give us the info we need directly in the types. We have to | |
2759 | use the method stub conversion to get it. Be aware that this | |
2760 | is by no means perfect, and if you use STABS, please move to | |
2761 | DWARF-2, or something like it, because trying to improve | |
2762 | overloading using STABS is really a waste of time. */ | |
2763 | for (i = 0; i < len; i++) | |
2764 | { | |
2765 | int j; | |
2766 | struct fn_field *f = TYPE_FN_FIELDLIST1 (domain, i); | |
2767 | int len2 = TYPE_FN_FIELDLIST_LENGTH (domain, i); | |
2768 | ||
2769 | for (j = 0; j < len2; j++) | |
2770 | { | |
070ad9f0 | 2771 | if (TYPE_FN_FIELD_STUB (f, j) && (!strcmp_iw (TYPE_FN_FIELDLIST_NAME (domain,i),name))) |
db577aea AC |
2772 | check_stub_method (domain, i, j); |
2773 | } | |
2774 | } | |
c906108c SS |
2775 | } |
2776 | else | |
2777 | { | |
2778 | int i = -1; | |
2779 | func_name = cplus_demangle (SYMBOL_NAME (fsym), DMGL_NO_OPTS); | |
2780 | ||
917317f4 | 2781 | /* If the name is NULL this must be a C-style function. |
7b83ea04 | 2782 | Just return the same symbol. */ |
917317f4 | 2783 | if (!func_name) |
7b83ea04 | 2784 | { |
917317f4 | 2785 | *symp = fsym; |
7b83ea04 AC |
2786 | return 0; |
2787 | } | |
917317f4 | 2788 | |
c906108c SS |
2789 | oload_syms = make_symbol_overload_list (fsym); |
2790 | while (oload_syms[++i]) | |
c5aa993b | 2791 | num_fns++; |
c906108c | 2792 | if (!num_fns) |
c5aa993b | 2793 | error ("Couldn't find function %s", func_name); |
c906108c | 2794 | } |
c5aa993b | 2795 | |
c906108c SS |
2796 | oload_champ_bv = NULL; |
2797 | ||
c5aa993b | 2798 | /* Consider each candidate in turn */ |
c906108c SS |
2799 | for (ix = 0; ix < num_fns; ix++) |
2800 | { | |
db577aea AC |
2801 | if (method) |
2802 | { | |
2803 | /* For static member functions, we won't have a this pointer, but nothing | |
2804 | else seems to handle them right now, so we just pretend ourselves */ | |
2805 | nparms=0; | |
2806 | ||
2807 | if (TYPE_FN_FIELD_ARGS(fns_ptr,ix)) | |
2808 | { | |
2809 | while (TYPE_CODE(TYPE_FN_FIELD_ARGS(fns_ptr,ix)[nparms]) != TYPE_CODE_VOID) | |
2810 | nparms++; | |
2811 | } | |
2812 | } | |
2813 | else | |
2814 | { | |
2815 | /* If it's not a method, this is the proper place */ | |
2816 | nparms=TYPE_NFIELDS(SYMBOL_TYPE(oload_syms[ix])); | |
2817 | } | |
c906108c | 2818 | |
c5aa993b | 2819 | /* Prepare array of parameter types */ |
c906108c SS |
2820 | parm_types = (struct type **) xmalloc (nparms * (sizeof (struct type *))); |
2821 | for (jj = 0; jj < nparms; jj++) | |
db577aea AC |
2822 | parm_types[jj] = (method |
2823 | ? (TYPE_FN_FIELD_ARGS (fns_ptr, ix)[jj]) | |
2824 | : TYPE_FIELD_TYPE (SYMBOL_TYPE (oload_syms[ix]), jj)); | |
c906108c SS |
2825 | |
2826 | /* Compare parameter types to supplied argument types */ | |
2827 | bv = rank_function (parm_types, nparms, arg_types, nargs); | |
c5aa993b | 2828 | |
c906108c | 2829 | if (!oload_champ_bv) |
c5aa993b JM |
2830 | { |
2831 | oload_champ_bv = bv; | |
2832 | oload_champ = 0; | |
2833 | champ_nparms = nparms; | |
2834 | } | |
c906108c | 2835 | else |
c5aa993b JM |
2836 | /* See whether current candidate is better or worse than previous best */ |
2837 | switch (compare_badness (bv, oload_champ_bv)) | |
2838 | { | |
2839 | case 0: | |
2840 | oload_ambiguous = 1; /* top two contenders are equally good */ | |
2841 | oload_ambig_champ = ix; | |
2842 | break; | |
2843 | case 1: | |
2844 | oload_ambiguous = 2; /* incomparable top contenders */ | |
2845 | oload_ambig_champ = ix; | |
2846 | break; | |
2847 | case 2: | |
2848 | oload_champ_bv = bv; /* new champion, record details */ | |
2849 | oload_ambiguous = 0; | |
2850 | oload_champ = ix; | |
2851 | oload_ambig_champ = -1; | |
2852 | champ_nparms = nparms; | |
2853 | break; | |
2854 | case 3: | |
2855 | default: | |
2856 | break; | |
2857 | } | |
c906108c | 2858 | free (parm_types); |
070ad9f0 DB |
2859 | if (overload_debug) |
2860 | { | |
c906108c | 2861 | if (method) |
070ad9f0 | 2862 | fprintf_filtered (gdb_stderr,"Overloaded method instance %s, # of parms %d\n", fns_ptr[ix].physname, nparms); |
c906108c | 2863 | else |
070ad9f0 | 2864 | fprintf_filtered (gdb_stderr,"Overloaded function instance %s # of parms %d\n", SYMBOL_DEMANGLED_NAME (oload_syms[ix]), nparms); |
db577aea | 2865 | for (jj = 0; jj < nargs; jj++) |
070ad9f0 DB |
2866 | fprintf_filtered (gdb_stderr,"...Badness @ %d : %d\n", jj, bv->rank[jj]); |
2867 | fprintf_filtered (gdb_stderr,"Overload resolution champion is %d, ambiguous? %d\n", oload_champ, oload_ambiguous); | |
2868 | } | |
c5aa993b | 2869 | } /* end loop over all candidates */ |
db577aea AC |
2870 | /* NOTE: dan/2000-03-10: Seems to be a better idea to just pick one |
2871 | if they have the exact same goodness. This is because there is no | |
2872 | way to differentiate based on return type, which we need to in | |
2873 | cases like overloads of .begin() <It's both const and non-const> */ | |
2874 | #if 0 | |
c906108c SS |
2875 | if (oload_ambiguous) |
2876 | { | |
2877 | if (method) | |
c5aa993b JM |
2878 | error ("Cannot resolve overloaded method %s%s%s to unique instance; disambiguate by specifying function signature", |
2879 | obj_type_name, | |
2880 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2881 | name); | |
c906108c | 2882 | else |
c5aa993b JM |
2883 | error ("Cannot resolve overloaded function %s to unique instance; disambiguate by specifying function signature", |
2884 | func_name); | |
c906108c | 2885 | } |
db577aea | 2886 | #endif |
c906108c | 2887 | |
c5aa993b | 2888 | /* Check how bad the best match is */ |
c906108c SS |
2889 | for (ix = 1; ix <= nargs; ix++) |
2890 | { | |
2891 | switch (oload_champ_bv->rank[ix]) | |
c5aa993b JM |
2892 | { |
2893 | case 10: | |
2894 | oload_non_standard = 1; /* non-standard type conversions needed */ | |
2895 | break; | |
2896 | case 100: | |
2897 | oload_incompatible = 1; /* truly mismatched types */ | |
2898 | break; | |
2899 | } | |
c906108c SS |
2900 | } |
2901 | if (oload_incompatible) | |
2902 | { | |
2903 | if (method) | |
c5aa993b JM |
2904 | error ("Cannot resolve method %s%s%s to any overloaded instance", |
2905 | obj_type_name, | |
2906 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2907 | name); | |
c906108c | 2908 | else |
c5aa993b JM |
2909 | error ("Cannot resolve function %s to any overloaded instance", |
2910 | func_name); | |
c906108c SS |
2911 | } |
2912 | else if (oload_non_standard) | |
2913 | { | |
2914 | if (method) | |
c5aa993b JM |
2915 | warning ("Using non-standard conversion to match method %s%s%s to supplied arguments", |
2916 | obj_type_name, | |
2917 | (obj_type_name && *obj_type_name) ? "::" : "", | |
2918 | name); | |
c906108c | 2919 | else |
c5aa993b JM |
2920 | warning ("Using non-standard conversion to match function %s to supplied arguments", |
2921 | func_name); | |
c906108c SS |
2922 | } |
2923 | ||
2924 | if (method) | |
2925 | { | |
2926 | if (TYPE_FN_FIELD_VIRTUAL_P (fns_ptr, oload_champ)) | |
c5aa993b | 2927 | *valp = value_virtual_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset); |
c906108c | 2928 | else |
c5aa993b | 2929 | *valp = value_fn_field (&temp, fns_ptr, oload_champ, basetype, boffset); |
c906108c SS |
2930 | } |
2931 | else | |
2932 | { | |
2933 | *symp = oload_syms[oload_champ]; | |
2934 | free (func_name); | |
2935 | } | |
2936 | ||
2937 | return oload_incompatible ? 100 : (oload_non_standard ? 10 : 0); | |
2938 | } | |
2939 | ||
2940 | /* C++: return 1 is NAME is a legitimate name for the destructor | |
2941 | of type TYPE. If TYPE does not have a destructor, or | |
2942 | if NAME is inappropriate for TYPE, an error is signaled. */ | |
2943 | int | |
2944 | destructor_name_p (name, type) | |
2945 | const char *name; | |
2946 | const struct type *type; | |
2947 | { | |
2948 | /* destructors are a special case. */ | |
2949 | ||
2950 | if (name[0] == '~') | |
2951 | { | |
2952 | char *dname = type_name_no_tag (type); | |
2953 | char *cp = strchr (dname, '<'); | |
2954 | unsigned int len; | |
2955 | ||
2956 | /* Do not compare the template part for template classes. */ | |
2957 | if (cp == NULL) | |
2958 | len = strlen (dname); | |
2959 | else | |
2960 | len = cp - dname; | |
2961 | if (strlen (name + 1) != len || !STREQN (dname, name + 1, len)) | |
2962 | error ("name of destructor must equal name of class"); | |
2963 | else | |
2964 | return 1; | |
2965 | } | |
2966 | return 0; | |
2967 | } | |
2968 | ||
2969 | /* Helper function for check_field: Given TYPE, a structure/union, | |
2970 | return 1 if the component named NAME from the ultimate | |
2971 | target structure/union is defined, otherwise, return 0. */ | |
2972 | ||
2973 | static int | |
2974 | check_field_in (type, name) | |
2975 | register struct type *type; | |
2976 | const char *name; | |
2977 | { | |
2978 | register int i; | |
2979 | ||
2980 | for (i = TYPE_NFIELDS (type) - 1; i >= TYPE_N_BASECLASSES (type); i--) | |
2981 | { | |
2982 | char *t_field_name = TYPE_FIELD_NAME (type, i); | |
db577aea | 2983 | if (t_field_name && (strcmp_iw (t_field_name, name) == 0)) |
c906108c SS |
2984 | return 1; |
2985 | } | |
2986 | ||
2987 | /* C++: If it was not found as a data field, then try to | |
2988 | return it as a pointer to a method. */ | |
2989 | ||
2990 | /* Destructors are a special case. */ | |
2991 | if (destructor_name_p (name, type)) | |
2992 | { | |
2993 | int m_index, f_index; | |
2994 | ||
2995 | return get_destructor_fn_field (type, &m_index, &f_index); | |
2996 | } | |
2997 | ||
2998 | for (i = TYPE_NFN_FIELDS (type) - 1; i >= 0; --i) | |
2999 | { | |
db577aea | 3000 | if (strcmp_iw (TYPE_FN_FIELDLIST_NAME (type, i), name) == 0) |
c906108c SS |
3001 | return 1; |
3002 | } | |
3003 | ||
3004 | for (i = TYPE_N_BASECLASSES (type) - 1; i >= 0; i--) | |
3005 | if (check_field_in (TYPE_BASECLASS (type, i), name)) | |
3006 | return 1; | |
c5aa993b | 3007 | |
c906108c SS |
3008 | return 0; |
3009 | } | |
3010 | ||
3011 | ||
3012 | /* C++: Given ARG1, a value of type (pointer to a)* structure/union, | |
3013 | return 1 if the component named NAME from the ultimate | |
3014 | target structure/union is defined, otherwise, return 0. */ | |
3015 | ||
3016 | int | |
3017 | check_field (arg1, name) | |
3018 | register value_ptr arg1; | |
3019 | const char *name; | |
3020 | { | |
3021 | register struct type *t; | |
3022 | ||
3023 | COERCE_ARRAY (arg1); | |
3024 | ||
3025 | t = VALUE_TYPE (arg1); | |
3026 | ||
3027 | /* Follow pointers until we get to a non-pointer. */ | |
3028 | ||
3029 | for (;;) | |
3030 | { | |
3031 | CHECK_TYPEDEF (t); | |
3032 | if (TYPE_CODE (t) != TYPE_CODE_PTR && TYPE_CODE (t) != TYPE_CODE_REF) | |
3033 | break; | |
3034 | t = TYPE_TARGET_TYPE (t); | |
3035 | } | |
3036 | ||
3037 | if (TYPE_CODE (t) == TYPE_CODE_MEMBER) | |
3038 | error ("not implemented: member type in check_field"); | |
3039 | ||
c5aa993b | 3040 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c SS |
3041 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
3042 | error ("Internal error: `this' is not an aggregate"); | |
3043 | ||
3044 | return check_field_in (t, name); | |
3045 | } | |
3046 | ||
3047 | /* C++: Given an aggregate type CURTYPE, and a member name NAME, | |
3048 | return the address of this member as a "pointer to member" | |
3049 | type. If INTYPE is non-null, then it will be the type | |
3050 | of the member we are looking for. This will help us resolve | |
3051 | "pointers to member functions". This function is used | |
3052 | to resolve user expressions of the form "DOMAIN::NAME". */ | |
3053 | ||
3054 | value_ptr | |
3055 | value_struct_elt_for_reference (domain, offset, curtype, name, intype) | |
3056 | struct type *domain, *curtype, *intype; | |
3057 | int offset; | |
3058 | char *name; | |
3059 | { | |
3060 | register struct type *t = curtype; | |
3061 | register int i; | |
3062 | value_ptr v; | |
3063 | ||
c5aa993b | 3064 | if (TYPE_CODE (t) != TYPE_CODE_STRUCT |
c906108c SS |
3065 | && TYPE_CODE (t) != TYPE_CODE_UNION) |
3066 | error ("Internal error: non-aggregate type to value_struct_elt_for_reference"); | |
3067 | ||
3068 | for (i = TYPE_NFIELDS (t) - 1; i >= TYPE_N_BASECLASSES (t); i--) | |
3069 | { | |
3070 | char *t_field_name = TYPE_FIELD_NAME (t, i); | |
c5aa993b | 3071 | |
c906108c SS |
3072 | if (t_field_name && STREQ (t_field_name, name)) |
3073 | { | |
3074 | if (TYPE_FIELD_STATIC (t, i)) | |
3075 | { | |
3076 | v = value_static_field (t, i); | |
3077 | if (v == NULL) | |
3078 | error ("Internal error: could not find static variable %s", | |
3079 | name); | |
3080 | return v; | |
3081 | } | |
3082 | if (TYPE_FIELD_PACKED (t, i)) | |
3083 | error ("pointers to bitfield members not allowed"); | |
c5aa993b | 3084 | |
c906108c SS |
3085 | return value_from_longest |
3086 | (lookup_reference_type (lookup_member_type (TYPE_FIELD_TYPE (t, i), | |
3087 | domain)), | |
3088 | offset + (LONGEST) (TYPE_FIELD_BITPOS (t, i) >> 3)); | |
3089 | } | |
3090 | } | |
3091 | ||
3092 | /* C++: If it was not found as a data field, then try to | |
3093 | return it as a pointer to a method. */ | |
3094 | ||
3095 | /* Destructors are a special case. */ | |
3096 | if (destructor_name_p (name, t)) | |
3097 | { | |
3098 | error ("member pointers to destructors not implemented yet"); | |
3099 | } | |
3100 | ||
3101 | /* Perform all necessary dereferencing. */ | |
3102 | while (intype && TYPE_CODE (intype) == TYPE_CODE_PTR) | |
3103 | intype = TYPE_TARGET_TYPE (intype); | |
3104 | ||
3105 | for (i = TYPE_NFN_FIELDS (t) - 1; i >= 0; --i) | |
3106 | { | |
3107 | char *t_field_name = TYPE_FN_FIELDLIST_NAME (t, i); | |
3108 | char dem_opname[64]; | |
3109 | ||
c5aa993b JM |
3110 | if (strncmp (t_field_name, "__", 2) == 0 || |
3111 | strncmp (t_field_name, "op", 2) == 0 || | |
3112 | strncmp (t_field_name, "type", 4) == 0) | |
c906108c | 3113 | { |
c5aa993b JM |
3114 | if (cplus_demangle_opname (t_field_name, dem_opname, DMGL_ANSI)) |
3115 | t_field_name = dem_opname; | |
3116 | else if (cplus_demangle_opname (t_field_name, dem_opname, 0)) | |
c906108c | 3117 | t_field_name = dem_opname; |
c906108c SS |
3118 | } |
3119 | if (t_field_name && STREQ (t_field_name, name)) | |
3120 | { | |
3121 | int j = TYPE_FN_FIELDLIST_LENGTH (t, i); | |
3122 | struct fn_field *f = TYPE_FN_FIELDLIST1 (t, i); | |
c5aa993b | 3123 | |
c906108c SS |
3124 | if (intype == 0 && j > 1) |
3125 | error ("non-unique member `%s' requires type instantiation", name); | |
3126 | if (intype) | |
3127 | { | |
3128 | while (j--) | |
3129 | if (TYPE_FN_FIELD_TYPE (f, j) == intype) | |
3130 | break; | |
3131 | if (j < 0) | |
3132 | error ("no member function matches that type instantiation"); | |
3133 | } | |
3134 | else | |
3135 | j = 0; | |
c5aa993b | 3136 | |
c906108c SS |
3137 | if (TYPE_FN_FIELD_STUB (f, j)) |
3138 | check_stub_method (t, i, j); | |
3139 | if (TYPE_FN_FIELD_VIRTUAL_P (f, j)) | |
3140 | { | |
3141 | return value_from_longest | |
3142 | (lookup_reference_type | |
3143 | (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j), | |
3144 | domain)), | |
3145 | (LONGEST) METHOD_PTR_FROM_VOFFSET (TYPE_FN_FIELD_VOFFSET (f, j))); | |
3146 | } | |
3147 | else | |
3148 | { | |
3149 | struct symbol *s = lookup_symbol (TYPE_FN_FIELD_PHYSNAME (f, j), | |
3150 | 0, VAR_NAMESPACE, 0, NULL); | |
3151 | if (s == NULL) | |
3152 | { | |
3153 | v = 0; | |
3154 | } | |
3155 | else | |
3156 | { | |
3157 | v = read_var_value (s, 0); | |
3158 | #if 0 | |
3159 | VALUE_TYPE (v) = lookup_reference_type | |
3160 | (lookup_member_type (TYPE_FN_FIELD_TYPE (f, j), | |
3161 | domain)); | |
3162 | #endif | |
3163 | } | |
3164 | return v; | |
3165 | } | |
3166 | } | |
3167 | } | |
3168 | for (i = TYPE_N_BASECLASSES (t) - 1; i >= 0; i--) | |
3169 | { | |
3170 | value_ptr v; | |
3171 | int base_offset; | |
3172 | ||
3173 | if (BASETYPE_VIA_VIRTUAL (t, i)) | |
3174 | base_offset = 0; | |
3175 | else | |
3176 | base_offset = TYPE_BASECLASS_BITPOS (t, i) / 8; | |
3177 | v = value_struct_elt_for_reference (domain, | |
3178 | offset + base_offset, | |
3179 | TYPE_BASECLASS (t, i), | |
3180 | name, | |
3181 | intype); | |
3182 | if (v) | |
3183 | return v; | |
3184 | } | |
3185 | return 0; | |
3186 | } | |
3187 | ||
3188 | ||
3189 | /* Find the real run-time type of a value using RTTI. | |
3190 | * V is a pointer to the value. | |
3191 | * A pointer to the struct type entry of the run-time type | |
3192 | * is returneed. | |
3193 | * FULL is a flag that is set only if the value V includes | |
3194 | * the entire contents of an object of the RTTI type. | |
3195 | * TOP is the offset to the top of the enclosing object of | |
3196 | * the real run-time type. This offset may be for the embedded | |
3197 | * object, or for the enclosing object of V. | |
3198 | * USING_ENC is the flag that distinguishes the two cases. | |
3199 | * If it is 1, then the offset is for the enclosing object, | |
3200 | * otherwise for the embedded object. | |
070ad9f0 DB |
3201 | * |
3202 | */ | |
c906108c SS |
3203 | |
3204 | struct type * | |
3205 | value_rtti_type (v, full, top, using_enc) | |
c5aa993b JM |
3206 | value_ptr v; |
3207 | int *full; | |
3208 | int *top; | |
3209 | int *using_enc; | |
c906108c | 3210 | { |
c5aa993b JM |
3211 | struct type *known_type; |
3212 | struct type *rtti_type; | |
c906108c SS |
3213 | CORE_ADDR coreptr; |
3214 | value_ptr vp; | |
3215 | int using_enclosing = 0; | |
3216 | long top_offset = 0; | |
3217 | char rtti_type_name[256]; | |
3218 | ||
3219 | if (full) | |
3220 | *full = 0; | |
3221 | if (top) | |
3222 | *top = -1; | |
3223 | if (using_enc) | |
3224 | *using_enc = 0; | |
3225 | ||
c5aa993b | 3226 | /* Get declared type */ |
c906108c SS |
3227 | known_type = VALUE_TYPE (v); |
3228 | CHECK_TYPEDEF (known_type); | |
c5aa993b | 3229 | /* RTTI works only or class objects */ |
c906108c SS |
3230 | if (TYPE_CODE (known_type) != TYPE_CODE_CLASS) |
3231 | return NULL; | |
070ad9f0 DB |
3232 | if (TYPE_HAS_VTABLE(known_type)) |
3233 | { | |
3234 | /* If neither the declared type nor the enclosing type of the | |
3235 | * value structure has a HP ANSI C++ style virtual table, | |
3236 | * we can't do anything. */ | |
3237 | if (!TYPE_HAS_VTABLE (known_type)) | |
3238 | { | |
3239 | known_type = VALUE_ENCLOSING_TYPE (v); | |
3240 | CHECK_TYPEDEF (known_type); | |
3241 | if ((TYPE_CODE (known_type) != TYPE_CODE_CLASS) || | |
3242 | !TYPE_HAS_VTABLE (known_type)) | |
3243 | return NULL; /* No RTTI, or not HP-compiled types */ | |
3244 | CHECK_TYPEDEF (known_type); | |
3245 | using_enclosing = 1; | |
3246 | } | |
c906108c | 3247 | |
070ad9f0 DB |
3248 | if (using_enclosing && using_enc) |
3249 | *using_enc = 1; | |
3250 | ||
3251 | /* First get the virtual table address */ | |
3252 | coreptr = *(CORE_ADDR *) ((VALUE_CONTENTS_ALL (v)) | |
3253 | + VALUE_OFFSET (v) | |
3254 | + (using_enclosing ? 0 : VALUE_EMBEDDED_OFFSET (v))); | |
3255 | if (coreptr == 0) | |
3256 | return NULL; /* return silently -- maybe called on gdb-generated value */ | |
3257 | ||
3258 | /* Fetch the top offset of the object */ | |
3259 | /* FIXME possible 32x64 problem with pointer size & arithmetic */ | |
3260 | vp = value_at (builtin_type_int, | |
3261 | coreptr + 4 * HP_ACC_TOP_OFFSET_OFFSET, | |
3262 | VALUE_BFD_SECTION (v)); | |
3263 | top_offset = value_as_long (vp); | |
3264 | if (top) | |
3265 | *top = top_offset; | |
3266 | ||
3267 | /* Fetch the typeinfo pointer */ | |
3268 | /* FIXME possible 32x64 problem with pointer size & arithmetic */ | |
3269 | vp = value_at (builtin_type_int, coreptr + 4 * HP_ACC_TYPEINFO_OFFSET, VALUE_BFD_SECTION (v)); | |
3270 | /* Indirect through the typeinfo pointer and retrieve the pointer | |
3271 | * to the string name */ | |
3272 | coreptr = *(CORE_ADDR *) (VALUE_CONTENTS (vp)); | |
3273 | if (!coreptr) | |
3274 | error ("Retrieved null typeinfo pointer in trying to determine run-time type"); | |
3275 | vp = value_at (builtin_type_int, coreptr + 4, VALUE_BFD_SECTION (v)); /* 4 -> offset of name field */ | |
3276 | /* FIXME possible 32x64 problem */ | |
3277 | ||
3278 | coreptr = *(CORE_ADDR *) (VALUE_CONTENTS (vp)); | |
3279 | ||
3280 | read_memory_string (coreptr, rtti_type_name, 256); | |
3281 | ||
3282 | if (strlen (rtti_type_name) == 0) | |
3283 | error ("Retrieved null type name from typeinfo"); | |
3284 | ||
3285 | /* search for type */ | |
3286 | rtti_type = lookup_typename (rtti_type_name, (struct block *) 0, 1); | |
3287 | ||
3288 | if (!rtti_type) | |
3289 | error ("Could not find run-time type: invalid type name %s in typeinfo??", rtti_type_name); | |
3290 | CHECK_TYPEDEF (rtti_type); | |
3291 | #if 0 | |
3292 | printf ("RTTI type name %s, tag %s, full? %d\n", TYPE_NAME (rtti_type), TYPE_TAG_NAME (rtti_type), full ? *full : -1); | |
3293 | #endif | |
3294 | /* Check whether we have the entire object */ | |
3295 | if (full /* Non-null pointer passed */ | |
3296 | && | |
3297 | /* Either we checked on the whole object in hand and found the | |
3298 | top offset to be zero */ | |
3299 | (((top_offset == 0) && | |
3300 | using_enclosing && | |
3301 | TYPE_LENGTH (known_type) == TYPE_LENGTH (rtti_type)) | |
3302 | || | |
3303 | /* Or we checked on the embedded object and top offset was the | |
3304 | same as the embedded offset */ | |
3305 | ((top_offset == VALUE_EMBEDDED_OFFSET (v)) && | |
3306 | !using_enclosing && | |
3307 | TYPE_LENGTH (VALUE_ENCLOSING_TYPE (v)) == TYPE_LENGTH (rtti_type)))) | |
3308 | ||
3309 | *full = 1; | |
3310 | } | |
3311 | else | |
3312 | /* | |
3313 | Right now this is G++ RTTI. Plan on this changing in the | |
3314 | future as i get around to setting the vtables properly for G++ | |
3315 | compiled stuff. Also, i'll be using the type info functions, | |
3316 | which are always right. Deal with it until then. | |
3317 | */ | |
3318 | { | |
3319 | CORE_ADDR vtbl; | |
3320 | struct minimal_symbol *minsym; | |
3321 | struct symbol *sym; | |
3322 | char *demangled_name; | |
3323 | struct type *btype; | |
3324 | /* If the type has no vptr fieldno, try to get it filled in */ | |
3325 | if (TYPE_VPTR_FIELDNO(known_type) < 0) | |
3326 | fill_in_vptr_fieldno(known_type); | |
3327 | ||
3328 | /* If we still can't find one, give up */ | |
3329 | if (TYPE_VPTR_FIELDNO(known_type) < 0) | |
3330 | return NULL; | |
c5aa993b | 3331 | |
070ad9f0 DB |
3332 | /* Make sure our basetype and known type match, otherwise, cast |
3333 | so we can get at the vtable properly. | |
3334 | */ | |
3335 | btype = TYPE_VPTR_BASETYPE (known_type); | |
3336 | CHECK_TYPEDEF (btype); | |
3337 | if (btype != known_type ) | |
3338 | { | |
3339 | v = value_cast (btype, v); | |
3340 | if (using_enc) | |
3341 | *using_enc=1; | |
3342 | } | |
3343 | /* | |
3344 | We can't use value_ind here, because it would want to use RTTI, and | |
3345 | we'd waste a bunch of time figuring out we already know the type. | |
3346 | Besides, we don't care about the type, just the actual pointer | |
3347 | */ | |
85c9a9d5 | 3348 | if (VALUE_ADDRESS (value_field (v, TYPE_VPTR_FIELDNO (known_type))) == 0) |
070ad9f0 | 3349 | return NULL; |
c5aa993b | 3350 | |
070ad9f0 DB |
3351 | /* |
3352 | If we are enclosed by something that isn't us, adjust the | |
3353 | address properly and set using_enclosing. | |
3354 | */ | |
3355 | if (VALUE_ENCLOSING_TYPE(v) != VALUE_TYPE(v)) | |
3356 | { | |
3357 | value_ptr tempval; | |
3358 | tempval=value_field(v,TYPE_VPTR_FIELDNO(known_type)); | |
3359 | VALUE_ADDRESS(tempval)+=(TYPE_BASECLASS_BITPOS(known_type,TYPE_VPTR_FIELDNO(known_type))/8); | |
3360 | vtbl=value_as_pointer(tempval); | |
3361 | using_enclosing=1; | |
3362 | } | |
3363 | else | |
3364 | { | |
3365 | vtbl=value_as_pointer(value_field(v,TYPE_VPTR_FIELDNO(known_type))); | |
3366 | using_enclosing=0; | |
3367 | } | |
c906108c | 3368 | |
070ad9f0 DB |
3369 | /* Try to find a symbol that is the vtable */ |
3370 | minsym=lookup_minimal_symbol_by_pc(vtbl); | |
3371 | if (minsym==NULL || (demangled_name=SYMBOL_NAME(minsym))==NULL || !VTBL_PREFIX_P(demangled_name)) | |
3372 | return NULL; | |
c906108c | 3373 | |
070ad9f0 DB |
3374 | /* If we just skip the prefix, we get screwed by namespaces */ |
3375 | demangled_name=cplus_demangle(demangled_name,DMGL_PARAMS|DMGL_ANSI); | |
3376 | *(strchr(demangled_name,' '))=0; | |
c906108c | 3377 | |
070ad9f0 DB |
3378 | /* Lookup the type for the name */ |
3379 | rtti_type=lookup_typename(demangled_name, (struct block *)0,1); | |
c5aa993b | 3380 | |
070ad9f0 DB |
3381 | if (rtti_type==NULL) |
3382 | return NULL; | |
c5aa993b | 3383 | |
070ad9f0 DB |
3384 | if (TYPE_N_BASECLASSES(rtti_type) > 1 && full && (*full) != 1) |
3385 | { | |
3386 | if (top) | |
3387 | *top=TYPE_BASECLASS_BITPOS(rtti_type,TYPE_VPTR_FIELDNO(rtti_type))/8; | |
3388 | if (top && ((*top) >0)) | |
3389 | { | |
3390 | if (TYPE_LENGTH(rtti_type) > TYPE_LENGTH(known_type)) | |
3391 | { | |
3392 | if (full) | |
3393 | *full=0; | |
3394 | } | |
3395 | else | |
3396 | { | |
3397 | if (full) | |
3398 | *full=1; | |
3399 | } | |
3400 | } | |
3401 | } | |
3402 | else | |
3403 | { | |
3404 | if (full) | |
3405 | *full=1; | |
3406 | } | |
3407 | if (using_enc) | |
3408 | *using_enc=using_enclosing; | |
3409 | } | |
c906108c SS |
3410 | return rtti_type; |
3411 | } | |
3412 | ||
3413 | /* Given a pointer value V, find the real (RTTI) type | |
3414 | of the object it points to. | |
3415 | Other parameters FULL, TOP, USING_ENC as with value_rtti_type() | |
3416 | and refer to the values computed for the object pointed to. */ | |
3417 | ||
3418 | struct type * | |
3419 | value_rtti_target_type (v, full, top, using_enc) | |
c5aa993b JM |
3420 | value_ptr v; |
3421 | int *full; | |
3422 | int *top; | |
3423 | int *using_enc; | |
c906108c SS |
3424 | { |
3425 | value_ptr target; | |
3426 | ||
3427 | target = value_ind (v); | |
3428 | ||
3429 | return value_rtti_type (target, full, top, using_enc); | |
3430 | } | |
3431 | ||
3432 | /* Given a value pointed to by ARGP, check its real run-time type, and | |
3433 | if that is different from the enclosing type, create a new value | |
3434 | using the real run-time type as the enclosing type (and of the same | |
3435 | type as ARGP) and return it, with the embedded offset adjusted to | |
3436 | be the correct offset to the enclosed object | |
3437 | RTYPE is the type, and XFULL, XTOP, and XUSING_ENC are the other | |
3438 | parameters, computed by value_rtti_type(). If these are available, | |
3439 | they can be supplied and a second call to value_rtti_type() is avoided. | |
3440 | (Pass RTYPE == NULL if they're not available */ | |
3441 | ||
3442 | value_ptr | |
3443 | value_full_object (argp, rtype, xfull, xtop, xusing_enc) | |
c5aa993b JM |
3444 | value_ptr argp; |
3445 | struct type *rtype; | |
3446 | int xfull; | |
3447 | int xtop; | |
3448 | int xusing_enc; | |
3449 | ||
c906108c | 3450 | { |
c5aa993b | 3451 | struct type *real_type; |
c906108c SS |
3452 | int full = 0; |
3453 | int top = -1; | |
3454 | int using_enc = 0; | |
3455 | value_ptr new_val; | |
3456 | ||
3457 | if (rtype) | |
3458 | { | |
3459 | real_type = rtype; | |
3460 | full = xfull; | |
3461 | top = xtop; | |
3462 | using_enc = xusing_enc; | |
3463 | } | |
3464 | else | |
3465 | real_type = value_rtti_type (argp, &full, &top, &using_enc); | |
3466 | ||
3467 | /* If no RTTI data, or if object is already complete, do nothing */ | |
3468 | if (!real_type || real_type == VALUE_ENCLOSING_TYPE (argp)) | |
3469 | return argp; | |
3470 | ||
3471 | /* If we have the full object, but for some reason the enclosing | |
c5aa993b | 3472 | type is wrong, set it *//* pai: FIXME -- sounds iffy */ |
c906108c SS |
3473 | if (full) |
3474 | { | |
3475 | VALUE_ENCLOSING_TYPE (argp) = real_type; | |
3476 | return argp; | |
3477 | } | |
3478 | ||
3479 | /* Check if object is in memory */ | |
3480 | if (VALUE_LVAL (argp) != lval_memory) | |
3481 | { | |
3482 | warning ("Couldn't retrieve complete object of RTTI type %s; object may be in register(s).", TYPE_NAME (real_type)); | |
c5aa993b | 3483 | |
c906108c SS |
3484 | return argp; |
3485 | } | |
c5aa993b | 3486 | |
c906108c SS |
3487 | /* All other cases -- retrieve the complete object */ |
3488 | /* Go back by the computed top_offset from the beginning of the object, | |
3489 | adjusting for the embedded offset of argp if that's what value_rtti_type | |
3490 | used for its computation. */ | |
3491 | new_val = value_at_lazy (real_type, VALUE_ADDRESS (argp) - top + | |
c5aa993b JM |
3492 | (using_enc ? 0 : VALUE_EMBEDDED_OFFSET (argp)), |
3493 | VALUE_BFD_SECTION (argp)); | |
c906108c SS |
3494 | VALUE_TYPE (new_val) = VALUE_TYPE (argp); |
3495 | VALUE_EMBEDDED_OFFSET (new_val) = using_enc ? top + VALUE_EMBEDDED_OFFSET (argp) : top; | |
3496 | return new_val; | |
3497 | } | |
3498 | ||
3499 | ||
3500 | ||
3501 | ||
3502 | /* C++: return the value of the class instance variable, if one exists. | |
3503 | Flag COMPLAIN signals an error if the request is made in an | |
3504 | inappropriate context. */ | |
3505 | ||
3506 | value_ptr | |
3507 | value_of_this (complain) | |
3508 | int complain; | |
3509 | { | |
3510 | struct symbol *func, *sym; | |
3511 | struct block *b; | |
3512 | int i; | |
3513 | static const char funny_this[] = "this"; | |
3514 | value_ptr this; | |
3515 | ||
3516 | if (selected_frame == 0) | |
3517 | { | |
3518 | if (complain) | |
c5aa993b JM |
3519 | error ("no frame selected"); |
3520 | else | |
3521 | return 0; | |
c906108c SS |
3522 | } |
3523 | ||
3524 | func = get_frame_function (selected_frame); | |
3525 | if (!func) | |
3526 | { | |
3527 | if (complain) | |
3528 | error ("no `this' in nameless context"); | |
c5aa993b JM |
3529 | else |
3530 | return 0; | |
c906108c SS |
3531 | } |
3532 | ||
3533 | b = SYMBOL_BLOCK_VALUE (func); | |
3534 | i = BLOCK_NSYMS (b); | |
3535 | if (i <= 0) | |
3536 | { | |
3537 | if (complain) | |
c5aa993b JM |
3538 | error ("no args, no `this'"); |
3539 | else | |
3540 | return 0; | |
c906108c SS |
3541 | } |
3542 | ||
3543 | /* Calling lookup_block_symbol is necessary to get the LOC_REGISTER | |
3544 | symbol instead of the LOC_ARG one (if both exist). */ | |
3545 | sym = lookup_block_symbol (b, funny_this, VAR_NAMESPACE); | |
3546 | if (sym == NULL) | |
3547 | { | |
3548 | if (complain) | |
3549 | error ("current stack frame not in method"); | |
3550 | else | |
3551 | return NULL; | |
3552 | } | |
3553 | ||
3554 | this = read_var_value (sym, selected_frame); | |
3555 | if (this == 0 && complain) | |
3556 | error ("`this' argument at unknown address"); | |
3557 | return this; | |
3558 | } | |
3559 | ||
3560 | /* Create a slice (sub-string, sub-array) of ARRAY, that is LENGTH elements | |
3561 | long, starting at LOWBOUND. The result has the same lower bound as | |
3562 | the original ARRAY. */ | |
3563 | ||
3564 | value_ptr | |
3565 | value_slice (array, lowbound, length) | |
3566 | value_ptr array; | |
3567 | int lowbound, length; | |
3568 | { | |
3569 | struct type *slice_range_type, *slice_type, *range_type; | |
3570 | LONGEST lowerbound, upperbound, offset; | |
3571 | value_ptr slice; | |
3572 | struct type *array_type; | |
3573 | array_type = check_typedef (VALUE_TYPE (array)); | |
3574 | COERCE_VARYING_ARRAY (array, array_type); | |
3575 | if (TYPE_CODE (array_type) != TYPE_CODE_ARRAY | |
3576 | && TYPE_CODE (array_type) != TYPE_CODE_STRING | |
3577 | && TYPE_CODE (array_type) != TYPE_CODE_BITSTRING) | |
3578 | error ("cannot take slice of non-array"); | |
3579 | range_type = TYPE_INDEX_TYPE (array_type); | |
3580 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
3581 | error ("slice from bad array or bitstring"); | |
3582 | if (lowbound < lowerbound || length < 0 | |
3583 | || lowbound + length - 1 > upperbound | |
c5aa993b | 3584 | /* Chill allows zero-length strings but not arrays. */ |
c906108c SS |
3585 | || (current_language->la_language == language_chill |
3586 | && length == 0 && TYPE_CODE (array_type) == TYPE_CODE_ARRAY)) | |
3587 | error ("slice out of range"); | |
3588 | /* FIXME-type-allocation: need a way to free this type when we are | |
3589 | done with it. */ | |
c5aa993b | 3590 | slice_range_type = create_range_type ((struct type *) NULL, |
c906108c SS |
3591 | TYPE_TARGET_TYPE (range_type), |
3592 | lowbound, lowbound + length - 1); | |
3593 | if (TYPE_CODE (array_type) == TYPE_CODE_BITSTRING) | |
3594 | { | |
3595 | int i; | |
c5aa993b | 3596 | slice_type = create_set_type ((struct type *) NULL, slice_range_type); |
c906108c SS |
3597 | TYPE_CODE (slice_type) = TYPE_CODE_BITSTRING; |
3598 | slice = value_zero (slice_type, not_lval); | |
3599 | for (i = 0; i < length; i++) | |
3600 | { | |
3601 | int element = value_bit_index (array_type, | |
3602 | VALUE_CONTENTS (array), | |
3603 | lowbound + i); | |
3604 | if (element < 0) | |
3605 | error ("internal error accessing bitstring"); | |
3606 | else if (element > 0) | |
3607 | { | |
3608 | int j = i % TARGET_CHAR_BIT; | |
3609 | if (BITS_BIG_ENDIAN) | |
3610 | j = TARGET_CHAR_BIT - 1 - j; | |
3611 | VALUE_CONTENTS_RAW (slice)[i / TARGET_CHAR_BIT] |= (1 << j); | |
3612 | } | |
3613 | } | |
3614 | /* We should set the address, bitssize, and bitspos, so the clice | |
7b83ea04 AC |
3615 | can be used on the LHS, but that may require extensions to |
3616 | value_assign. For now, just leave as a non_lval. FIXME. */ | |
c906108c SS |
3617 | } |
3618 | else | |
3619 | { | |
3620 | struct type *element_type = TYPE_TARGET_TYPE (array_type); | |
3621 | offset | |
3622 | = (lowbound - lowerbound) * TYPE_LENGTH (check_typedef (element_type)); | |
c5aa993b | 3623 | slice_type = create_array_type ((struct type *) NULL, element_type, |
c906108c SS |
3624 | slice_range_type); |
3625 | TYPE_CODE (slice_type) = TYPE_CODE (array_type); | |
3626 | slice = allocate_value (slice_type); | |
3627 | if (VALUE_LAZY (array)) | |
3628 | VALUE_LAZY (slice) = 1; | |
3629 | else | |
3630 | memcpy (VALUE_CONTENTS (slice), VALUE_CONTENTS (array) + offset, | |
3631 | TYPE_LENGTH (slice_type)); | |
3632 | if (VALUE_LVAL (array) == lval_internalvar) | |
3633 | VALUE_LVAL (slice) = lval_internalvar_component; | |
3634 | else | |
3635 | VALUE_LVAL (slice) = VALUE_LVAL (array); | |
3636 | VALUE_ADDRESS (slice) = VALUE_ADDRESS (array); | |
3637 | VALUE_OFFSET (slice) = VALUE_OFFSET (array) + offset; | |
3638 | } | |
3639 | return slice; | |
3640 | } | |
3641 | ||
3642 | /* Assuming chill_varying_type (VARRAY) is true, return an equivalent | |
3643 | value as a fixed-length array. */ | |
3644 | ||
3645 | value_ptr | |
3646 | varying_to_slice (varray) | |
3647 | value_ptr varray; | |
3648 | { | |
3649 | struct type *vtype = check_typedef (VALUE_TYPE (varray)); | |
3650 | LONGEST length = unpack_long (TYPE_FIELD_TYPE (vtype, 0), | |
3651 | VALUE_CONTENTS (varray) | |
3652 | + TYPE_FIELD_BITPOS (vtype, 0) / 8); | |
3653 | return value_slice (value_primitive_field (varray, 0, 1, vtype), 0, length); | |
3654 | } | |
3655 | ||
070ad9f0 DB |
3656 | /* Create a value for a FORTRAN complex number. Currently most of |
3657 | the time values are coerced to COMPLEX*16 (i.e. a complex number | |
3658 | composed of 2 doubles. This really should be a smarter routine | |
3659 | that figures out precision inteligently as opposed to assuming | |
c5aa993b | 3660 | doubles. FIXME: fmb */ |
c906108c SS |
3661 | |
3662 | value_ptr | |
3663 | value_literal_complex (arg1, arg2, type) | |
3664 | value_ptr arg1; | |
3665 | value_ptr arg2; | |
3666 | struct type *type; | |
3667 | { | |
3668 | register value_ptr val; | |
3669 | struct type *real_type = TYPE_TARGET_TYPE (type); | |
3670 | ||
3671 | val = allocate_value (type); | |
3672 | arg1 = value_cast (real_type, arg1); | |
3673 | arg2 = value_cast (real_type, arg2); | |
3674 | ||
3675 | memcpy (VALUE_CONTENTS_RAW (val), | |
3676 | VALUE_CONTENTS (arg1), TYPE_LENGTH (real_type)); | |
3677 | memcpy (VALUE_CONTENTS_RAW (val) + TYPE_LENGTH (real_type), | |
3678 | VALUE_CONTENTS (arg2), TYPE_LENGTH (real_type)); | |
3679 | return val; | |
3680 | } | |
3681 | ||
3682 | /* Cast a value into the appropriate complex data type. */ | |
3683 | ||
3684 | static value_ptr | |
3685 | cast_into_complex (type, val) | |
3686 | struct type *type; | |
3687 | register value_ptr val; | |
3688 | { | |
3689 | struct type *real_type = TYPE_TARGET_TYPE (type); | |
3690 | if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_COMPLEX) | |
3691 | { | |
3692 | struct type *val_real_type = TYPE_TARGET_TYPE (VALUE_TYPE (val)); | |
3693 | value_ptr re_val = allocate_value (val_real_type); | |
3694 | value_ptr im_val = allocate_value (val_real_type); | |
3695 | ||
3696 | memcpy (VALUE_CONTENTS_RAW (re_val), | |
3697 | VALUE_CONTENTS (val), TYPE_LENGTH (val_real_type)); | |
3698 | memcpy (VALUE_CONTENTS_RAW (im_val), | |
3699 | VALUE_CONTENTS (val) + TYPE_LENGTH (val_real_type), | |
c5aa993b | 3700 | TYPE_LENGTH (val_real_type)); |
c906108c SS |
3701 | |
3702 | return value_literal_complex (re_val, im_val, type); | |
3703 | } | |
3704 | else if (TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_FLT | |
3705 | || TYPE_CODE (VALUE_TYPE (val)) == TYPE_CODE_INT) | |
3706 | return value_literal_complex (val, value_zero (real_type, not_lval), type); | |
3707 | else | |
3708 | error ("cannot cast non-number to complex"); | |
3709 | } | |
3710 | ||
3711 | void | |
3712 | _initialize_valops () | |
3713 | { | |
3714 | #if 0 | |
3715 | add_show_from_set | |
c5aa993b | 3716 | (add_set_cmd ("abandon", class_support, var_boolean, (char *) &auto_abandon, |
c906108c SS |
3717 | "Set automatic abandonment of expressions upon failure.", |
3718 | &setlist), | |
3719 | &showlist); | |
3720 | #endif | |
3721 | ||
3722 | add_show_from_set | |
c5aa993b | 3723 | (add_set_cmd ("overload-resolution", class_support, var_boolean, (char *) &overload_resolution, |
c906108c SS |
3724 | "Set overload resolution in evaluating C++ functions.", |
3725 | &setlist), | |
3726 | &showlist); | |
3727 | overload_resolution = 1; | |
3728 | ||
242bfc55 FN |
3729 | add_show_from_set ( |
3730 | add_set_cmd ("unwindonsignal", no_class, var_boolean, | |
3731 | (char *) &unwind_on_signal_p, | |
3732 | "Set unwinding of stack if a signal is received while in a call dummy.\n\ | |
3733 | The unwindonsignal lets the user determine what gdb should do if a signal\n\ | |
3734 | is received while in a function called from gdb (call dummy). If set, gdb\n\ | |
3735 | unwinds the stack and restore the context to what as it was before the call.\n\ | |
3736 | The default is to stop in the frame where the signal was received.", &setlist), | |
3737 | &showlist); | |
c906108c | 3738 | } |