Commit | Line | Data |
---|---|---|
6e681866 | 1 | /* Ada language support routines for GDB, the GNU debugger. |
10a2c479 | 2 | |
e2882c85 | 3 | Copyright (C) 1992-2018 Free Software Foundation, Inc. |
14f9c5c9 | 4 | |
a9762ec7 | 5 | This file is part of GDB. |
14f9c5c9 | 6 | |
a9762ec7 JB |
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 3 of the License, or | |
10 | (at your option) any later version. | |
14f9c5c9 | 11 | |
a9762ec7 JB |
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. | |
14f9c5c9 | 16 | |
a9762ec7 JB |
17 | You should have received a copy of the GNU General Public License |
18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ | |
14f9c5c9 | 19 | |
96d887e8 | 20 | |
4c4b4cd2 | 21 | #include "defs.h" |
14f9c5c9 | 22 | #include <ctype.h> |
14f9c5c9 | 23 | #include "demangle.h" |
4c4b4cd2 PH |
24 | #include "gdb_regex.h" |
25 | #include "frame.h" | |
14f9c5c9 AS |
26 | #include "symtab.h" |
27 | #include "gdbtypes.h" | |
28 | #include "gdbcmd.h" | |
29 | #include "expression.h" | |
30 | #include "parser-defs.h" | |
31 | #include "language.h" | |
a53b64ea | 32 | #include "varobj.h" |
14f9c5c9 AS |
33 | #include "c-lang.h" |
34 | #include "inferior.h" | |
35 | #include "symfile.h" | |
36 | #include "objfiles.h" | |
37 | #include "breakpoint.h" | |
38 | #include "gdbcore.h" | |
4c4b4cd2 PH |
39 | #include "hashtab.h" |
40 | #include "gdb_obstack.h" | |
14f9c5c9 | 41 | #include "ada-lang.h" |
4c4b4cd2 | 42 | #include "completer.h" |
53ce3c39 | 43 | #include <sys/stat.h> |
14f9c5c9 | 44 | #include "ui-out.h" |
fe898f56 | 45 | #include "block.h" |
04714b91 | 46 | #include "infcall.h" |
de4f826b | 47 | #include "dictionary.h" |
f7f9143b JB |
48 | #include "annotate.h" |
49 | #include "valprint.h" | |
9bbc9174 | 50 | #include "source.h" |
0259addd | 51 | #include "observer.h" |
2ba95b9b | 52 | #include "vec.h" |
692465f1 | 53 | #include "stack.h" |
fa864999 | 54 | #include "gdb_vecs.h" |
79d43c61 | 55 | #include "typeprint.h" |
22cee43f | 56 | #include "namespace.h" |
14f9c5c9 | 57 | |
ccefe4c4 | 58 | #include "psymtab.h" |
40bc484c | 59 | #include "value.h" |
956a9fb9 | 60 | #include "mi/mi-common.h" |
9ac4176b | 61 | #include "arch-utils.h" |
0fcd72ba | 62 | #include "cli/cli-utils.h" |
14bc53a8 | 63 | #include "common/function-view.h" |
d5722aa2 | 64 | #include "common/byte-vector.h" |
ab816a27 | 65 | #include <algorithm> |
ccefe4c4 | 66 | |
4c4b4cd2 | 67 | /* Define whether or not the C operator '/' truncates towards zero for |
0963b4bd | 68 | differently signed operands (truncation direction is undefined in C). |
4c4b4cd2 PH |
69 | Copied from valarith.c. */ |
70 | ||
71 | #ifndef TRUNCATION_TOWARDS_ZERO | |
72 | #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2) | |
73 | #endif | |
74 | ||
d2e4a39e | 75 | static struct type *desc_base_type (struct type *); |
14f9c5c9 | 76 | |
d2e4a39e | 77 | static struct type *desc_bounds_type (struct type *); |
14f9c5c9 | 78 | |
d2e4a39e | 79 | static struct value *desc_bounds (struct value *); |
14f9c5c9 | 80 | |
d2e4a39e | 81 | static int fat_pntr_bounds_bitpos (struct type *); |
14f9c5c9 | 82 | |
d2e4a39e | 83 | static int fat_pntr_bounds_bitsize (struct type *); |
14f9c5c9 | 84 | |
556bdfd4 | 85 | static struct type *desc_data_target_type (struct type *); |
14f9c5c9 | 86 | |
d2e4a39e | 87 | static struct value *desc_data (struct value *); |
14f9c5c9 | 88 | |
d2e4a39e | 89 | static int fat_pntr_data_bitpos (struct type *); |
14f9c5c9 | 90 | |
d2e4a39e | 91 | static int fat_pntr_data_bitsize (struct type *); |
14f9c5c9 | 92 | |
d2e4a39e | 93 | static struct value *desc_one_bound (struct value *, int, int); |
14f9c5c9 | 94 | |
d2e4a39e | 95 | static int desc_bound_bitpos (struct type *, int, int); |
14f9c5c9 | 96 | |
d2e4a39e | 97 | static int desc_bound_bitsize (struct type *, int, int); |
14f9c5c9 | 98 | |
d2e4a39e | 99 | static struct type *desc_index_type (struct type *, int); |
14f9c5c9 | 100 | |
d2e4a39e | 101 | static int desc_arity (struct type *); |
14f9c5c9 | 102 | |
d2e4a39e | 103 | static int ada_type_match (struct type *, struct type *, int); |
14f9c5c9 | 104 | |
d2e4a39e | 105 | static int ada_args_match (struct symbol *, struct value **, int); |
14f9c5c9 | 106 | |
40bc484c | 107 | static struct value *make_array_descriptor (struct type *, struct value *); |
14f9c5c9 | 108 | |
4c4b4cd2 | 109 | static void ada_add_block_symbols (struct obstack *, |
b5ec771e PA |
110 | const struct block *, |
111 | const lookup_name_info &lookup_name, | |
112 | domain_enum, struct objfile *); | |
14f9c5c9 | 113 | |
22cee43f | 114 | static void ada_add_all_symbols (struct obstack *, const struct block *, |
b5ec771e PA |
115 | const lookup_name_info &lookup_name, |
116 | domain_enum, int, int *); | |
22cee43f | 117 | |
d12307c1 | 118 | static int is_nonfunction (struct block_symbol *, int); |
14f9c5c9 | 119 | |
76a01679 | 120 | static void add_defn_to_vec (struct obstack *, struct symbol *, |
f0c5f9b2 | 121 | const struct block *); |
14f9c5c9 | 122 | |
4c4b4cd2 PH |
123 | static int num_defns_collected (struct obstack *); |
124 | ||
d12307c1 | 125 | static struct block_symbol *defns_collected (struct obstack *, int); |
14f9c5c9 | 126 | |
e9d9f57e | 127 | static struct value *resolve_subexp (expression_up *, int *, int, |
76a01679 | 128 | struct type *); |
14f9c5c9 | 129 | |
e9d9f57e | 130 | static void replace_operator_with_call (expression_up *, int, int, int, |
270140bd | 131 | struct symbol *, const struct block *); |
14f9c5c9 | 132 | |
d2e4a39e | 133 | static int possible_user_operator_p (enum exp_opcode, struct value **); |
14f9c5c9 | 134 | |
a121b7c1 | 135 | static const char *ada_op_name (enum exp_opcode); |
4c4b4cd2 PH |
136 | |
137 | static const char *ada_decoded_op_name (enum exp_opcode); | |
14f9c5c9 | 138 | |
d2e4a39e | 139 | static int numeric_type_p (struct type *); |
14f9c5c9 | 140 | |
d2e4a39e | 141 | static int integer_type_p (struct type *); |
14f9c5c9 | 142 | |
d2e4a39e | 143 | static int scalar_type_p (struct type *); |
14f9c5c9 | 144 | |
d2e4a39e | 145 | static int discrete_type_p (struct type *); |
14f9c5c9 | 146 | |
aeb5907d JB |
147 | static enum ada_renaming_category parse_old_style_renaming (struct type *, |
148 | const char **, | |
149 | int *, | |
150 | const char **); | |
151 | ||
152 | static struct symbol *find_old_style_renaming_symbol (const char *, | |
270140bd | 153 | const struct block *); |
aeb5907d | 154 | |
a121b7c1 | 155 | static struct type *ada_lookup_struct_elt_type (struct type *, const char *, |
988f6b3d | 156 | int, int); |
4c4b4cd2 | 157 | |
d2e4a39e | 158 | static struct value *evaluate_subexp_type (struct expression *, int *); |
14f9c5c9 | 159 | |
b4ba55a1 JB |
160 | static struct type *ada_find_parallel_type_with_name (struct type *, |
161 | const char *); | |
162 | ||
d2e4a39e | 163 | static int is_dynamic_field (struct type *, int); |
14f9c5c9 | 164 | |
10a2c479 | 165 | static struct type *to_fixed_variant_branch_type (struct type *, |
fc1a4b47 | 166 | const gdb_byte *, |
4c4b4cd2 PH |
167 | CORE_ADDR, struct value *); |
168 | ||
169 | static struct type *to_fixed_array_type (struct type *, struct value *, int); | |
14f9c5c9 | 170 | |
28c85d6c | 171 | static struct type *to_fixed_range_type (struct type *, struct value *); |
14f9c5c9 | 172 | |
d2e4a39e | 173 | static struct type *to_static_fixed_type (struct type *); |
f192137b | 174 | static struct type *static_unwrap_type (struct type *type); |
14f9c5c9 | 175 | |
d2e4a39e | 176 | static struct value *unwrap_value (struct value *); |
14f9c5c9 | 177 | |
ad82864c | 178 | static struct type *constrained_packed_array_type (struct type *, long *); |
14f9c5c9 | 179 | |
ad82864c | 180 | static struct type *decode_constrained_packed_array_type (struct type *); |
14f9c5c9 | 181 | |
ad82864c JB |
182 | static long decode_packed_array_bitsize (struct type *); |
183 | ||
184 | static struct value *decode_constrained_packed_array (struct value *); | |
185 | ||
186 | static int ada_is_packed_array_type (struct type *); | |
187 | ||
188 | static int ada_is_unconstrained_packed_array_type (struct type *); | |
14f9c5c9 | 189 | |
d2e4a39e | 190 | static struct value *value_subscript_packed (struct value *, int, |
4c4b4cd2 | 191 | struct value **); |
14f9c5c9 | 192 | |
50810684 | 193 | static void move_bits (gdb_byte *, int, const gdb_byte *, int, int, int); |
52ce6436 | 194 | |
4c4b4cd2 PH |
195 | static struct value *coerce_unspec_val_to_type (struct value *, |
196 | struct type *); | |
14f9c5c9 | 197 | |
d2e4a39e | 198 | static int lesseq_defined_than (struct symbol *, struct symbol *); |
14f9c5c9 | 199 | |
d2e4a39e | 200 | static int equiv_types (struct type *, struct type *); |
14f9c5c9 | 201 | |
d2e4a39e | 202 | static int is_name_suffix (const char *); |
14f9c5c9 | 203 | |
73589123 PH |
204 | static int advance_wild_match (const char **, const char *, int); |
205 | ||
b5ec771e | 206 | static bool wild_match (const char *name, const char *patn); |
14f9c5c9 | 207 | |
d2e4a39e | 208 | static struct value *ada_coerce_ref (struct value *); |
14f9c5c9 | 209 | |
4c4b4cd2 PH |
210 | static LONGEST pos_atr (struct value *); |
211 | ||
3cb382c9 | 212 | static struct value *value_pos_atr (struct type *, struct value *); |
14f9c5c9 | 213 | |
d2e4a39e | 214 | static struct value *value_val_atr (struct type *, struct value *); |
14f9c5c9 | 215 | |
4c4b4cd2 PH |
216 | static struct symbol *standard_lookup (const char *, const struct block *, |
217 | domain_enum); | |
14f9c5c9 | 218 | |
108d56a4 | 219 | static struct value *ada_search_struct_field (const char *, struct value *, int, |
4c4b4cd2 PH |
220 | struct type *); |
221 | ||
222 | static struct value *ada_value_primitive_field (struct value *, int, int, | |
223 | struct type *); | |
224 | ||
0d5cff50 | 225 | static int find_struct_field (const char *, struct type *, int, |
52ce6436 | 226 | struct type **, int *, int *, int *, int *); |
4c4b4cd2 | 227 | |
d12307c1 | 228 | static int ada_resolve_function (struct block_symbol *, int, |
4c4b4cd2 PH |
229 | struct value **, int, const char *, |
230 | struct type *); | |
231 | ||
4c4b4cd2 PH |
232 | static int ada_is_direct_array_type (struct type *); |
233 | ||
72d5681a PH |
234 | static void ada_language_arch_info (struct gdbarch *, |
235 | struct language_arch_info *); | |
714e53ab | 236 | |
52ce6436 PH |
237 | static struct value *ada_index_struct_field (int, struct value *, int, |
238 | struct type *); | |
239 | ||
240 | static struct value *assign_aggregate (struct value *, struct value *, | |
0963b4bd MS |
241 | struct expression *, |
242 | int *, enum noside); | |
52ce6436 PH |
243 | |
244 | static void aggregate_assign_from_choices (struct value *, struct value *, | |
245 | struct expression *, | |
246 | int *, LONGEST *, int *, | |
247 | int, LONGEST, LONGEST); | |
248 | ||
249 | static void aggregate_assign_positional (struct value *, struct value *, | |
250 | struct expression *, | |
251 | int *, LONGEST *, int *, int, | |
252 | LONGEST, LONGEST); | |
253 | ||
254 | ||
255 | static void aggregate_assign_others (struct value *, struct value *, | |
256 | struct expression *, | |
257 | int *, LONGEST *, int, LONGEST, LONGEST); | |
258 | ||
259 | ||
260 | static void add_component_interval (LONGEST, LONGEST, LONGEST *, int *, int); | |
261 | ||
262 | ||
263 | static struct value *ada_evaluate_subexp (struct type *, struct expression *, | |
264 | int *, enum noside); | |
265 | ||
266 | static void ada_forward_operator_length (struct expression *, int, int *, | |
267 | int *); | |
852dff6c JB |
268 | |
269 | static struct type *ada_find_any_type (const char *name); | |
b5ec771e PA |
270 | |
271 | static symbol_name_matcher_ftype *ada_get_symbol_name_matcher | |
272 | (const lookup_name_info &lookup_name); | |
273 | ||
4c4b4cd2 PH |
274 | \f |
275 | ||
ee01b665 JB |
276 | /* The result of a symbol lookup to be stored in our symbol cache. */ |
277 | ||
278 | struct cache_entry | |
279 | { | |
280 | /* The name used to perform the lookup. */ | |
281 | const char *name; | |
282 | /* The namespace used during the lookup. */ | |
fe978cb0 | 283 | domain_enum domain; |
ee01b665 JB |
284 | /* The symbol returned by the lookup, or NULL if no matching symbol |
285 | was found. */ | |
286 | struct symbol *sym; | |
287 | /* The block where the symbol was found, or NULL if no matching | |
288 | symbol was found. */ | |
289 | const struct block *block; | |
290 | /* A pointer to the next entry with the same hash. */ | |
291 | struct cache_entry *next; | |
292 | }; | |
293 | ||
294 | /* The Ada symbol cache, used to store the result of Ada-mode symbol | |
295 | lookups in the course of executing the user's commands. | |
296 | ||
297 | The cache is implemented using a simple, fixed-sized hash. | |
298 | The size is fixed on the grounds that there are not likely to be | |
299 | all that many symbols looked up during any given session, regardless | |
300 | of the size of the symbol table. If we decide to go to a resizable | |
301 | table, let's just use the stuff from libiberty instead. */ | |
302 | ||
303 | #define HASH_SIZE 1009 | |
304 | ||
305 | struct ada_symbol_cache | |
306 | { | |
307 | /* An obstack used to store the entries in our cache. */ | |
308 | struct obstack cache_space; | |
309 | ||
310 | /* The root of the hash table used to implement our symbol cache. */ | |
311 | struct cache_entry *root[HASH_SIZE]; | |
312 | }; | |
313 | ||
314 | static void ada_free_symbol_cache (struct ada_symbol_cache *sym_cache); | |
76a01679 | 315 | |
4c4b4cd2 | 316 | /* Maximum-sized dynamic type. */ |
14f9c5c9 AS |
317 | static unsigned int varsize_limit; |
318 | ||
67cb5b2d | 319 | static const char ada_completer_word_break_characters[] = |
4c4b4cd2 PH |
320 | #ifdef VMS |
321 | " \t\n!@#%^&*()+=|~`}{[]\";:?/,-"; | |
322 | #else | |
14f9c5c9 | 323 | " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-"; |
4c4b4cd2 | 324 | #endif |
14f9c5c9 | 325 | |
4c4b4cd2 | 326 | /* The name of the symbol to use to get the name of the main subprogram. */ |
76a01679 | 327 | static const char ADA_MAIN_PROGRAM_SYMBOL_NAME[] |
4c4b4cd2 | 328 | = "__gnat_ada_main_program_name"; |
14f9c5c9 | 329 | |
4c4b4cd2 PH |
330 | /* Limit on the number of warnings to raise per expression evaluation. */ |
331 | static int warning_limit = 2; | |
332 | ||
333 | /* Number of warning messages issued; reset to 0 by cleanups after | |
334 | expression evaluation. */ | |
335 | static int warnings_issued = 0; | |
336 | ||
337 | static const char *known_runtime_file_name_patterns[] = { | |
338 | ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL | |
339 | }; | |
340 | ||
341 | static const char *known_auxiliary_function_name_patterns[] = { | |
342 | ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL | |
343 | }; | |
344 | ||
c6044dd1 JB |
345 | /* Maintenance-related settings for this module. */ |
346 | ||
347 | static struct cmd_list_element *maint_set_ada_cmdlist; | |
348 | static struct cmd_list_element *maint_show_ada_cmdlist; | |
349 | ||
350 | /* Implement the "maintenance set ada" (prefix) command. */ | |
351 | ||
352 | static void | |
981a3fb3 | 353 | maint_set_ada_cmd (const char *args, int from_tty) |
c6044dd1 | 354 | { |
635c7e8a TT |
355 | help_list (maint_set_ada_cmdlist, "maintenance set ada ", all_commands, |
356 | gdb_stdout); | |
c6044dd1 JB |
357 | } |
358 | ||
359 | /* Implement the "maintenance show ada" (prefix) command. */ | |
360 | ||
361 | static void | |
981a3fb3 | 362 | maint_show_ada_cmd (const char *args, int from_tty) |
c6044dd1 JB |
363 | { |
364 | cmd_show_list (maint_show_ada_cmdlist, from_tty, ""); | |
365 | } | |
366 | ||
367 | /* The "maintenance ada set/show ignore-descriptive-type" value. */ | |
368 | ||
369 | static int ada_ignore_descriptive_types_p = 0; | |
370 | ||
e802dbe0 JB |
371 | /* Inferior-specific data. */ |
372 | ||
373 | /* Per-inferior data for this module. */ | |
374 | ||
375 | struct ada_inferior_data | |
376 | { | |
377 | /* The ada__tags__type_specific_data type, which is used when decoding | |
378 | tagged types. With older versions of GNAT, this type was directly | |
379 | accessible through a component ("tsd") in the object tag. But this | |
380 | is no longer the case, so we cache it for each inferior. */ | |
381 | struct type *tsd_type; | |
3eecfa55 JB |
382 | |
383 | /* The exception_support_info data. This data is used to determine | |
384 | how to implement support for Ada exception catchpoints in a given | |
385 | inferior. */ | |
386 | const struct exception_support_info *exception_info; | |
e802dbe0 JB |
387 | }; |
388 | ||
389 | /* Our key to this module's inferior data. */ | |
390 | static const struct inferior_data *ada_inferior_data; | |
391 | ||
392 | /* A cleanup routine for our inferior data. */ | |
393 | static void | |
394 | ada_inferior_data_cleanup (struct inferior *inf, void *arg) | |
395 | { | |
396 | struct ada_inferior_data *data; | |
397 | ||
9a3c8263 | 398 | data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data); |
e802dbe0 JB |
399 | if (data != NULL) |
400 | xfree (data); | |
401 | } | |
402 | ||
403 | /* Return our inferior data for the given inferior (INF). | |
404 | ||
405 | This function always returns a valid pointer to an allocated | |
406 | ada_inferior_data structure. If INF's inferior data has not | |
407 | been previously set, this functions creates a new one with all | |
408 | fields set to zero, sets INF's inferior to it, and then returns | |
409 | a pointer to that newly allocated ada_inferior_data. */ | |
410 | ||
411 | static struct ada_inferior_data * | |
412 | get_ada_inferior_data (struct inferior *inf) | |
413 | { | |
414 | struct ada_inferior_data *data; | |
415 | ||
9a3c8263 | 416 | data = (struct ada_inferior_data *) inferior_data (inf, ada_inferior_data); |
e802dbe0 JB |
417 | if (data == NULL) |
418 | { | |
41bf6aca | 419 | data = XCNEW (struct ada_inferior_data); |
e802dbe0 JB |
420 | set_inferior_data (inf, ada_inferior_data, data); |
421 | } | |
422 | ||
423 | return data; | |
424 | } | |
425 | ||
426 | /* Perform all necessary cleanups regarding our module's inferior data | |
427 | that is required after the inferior INF just exited. */ | |
428 | ||
429 | static void | |
430 | ada_inferior_exit (struct inferior *inf) | |
431 | { | |
432 | ada_inferior_data_cleanup (inf, NULL); | |
433 | set_inferior_data (inf, ada_inferior_data, NULL); | |
434 | } | |
435 | ||
ee01b665 JB |
436 | |
437 | /* program-space-specific data. */ | |
438 | ||
439 | /* This module's per-program-space data. */ | |
440 | struct ada_pspace_data | |
441 | { | |
442 | /* The Ada symbol cache. */ | |
443 | struct ada_symbol_cache *sym_cache; | |
444 | }; | |
445 | ||
446 | /* Key to our per-program-space data. */ | |
447 | static const struct program_space_data *ada_pspace_data_handle; | |
448 | ||
449 | /* Return this module's data for the given program space (PSPACE). | |
450 | If not is found, add a zero'ed one now. | |
451 | ||
452 | This function always returns a valid object. */ | |
453 | ||
454 | static struct ada_pspace_data * | |
455 | get_ada_pspace_data (struct program_space *pspace) | |
456 | { | |
457 | struct ada_pspace_data *data; | |
458 | ||
9a3c8263 SM |
459 | data = ((struct ada_pspace_data *) |
460 | program_space_data (pspace, ada_pspace_data_handle)); | |
ee01b665 JB |
461 | if (data == NULL) |
462 | { | |
463 | data = XCNEW (struct ada_pspace_data); | |
464 | set_program_space_data (pspace, ada_pspace_data_handle, data); | |
465 | } | |
466 | ||
467 | return data; | |
468 | } | |
469 | ||
470 | /* The cleanup callback for this module's per-program-space data. */ | |
471 | ||
472 | static void | |
473 | ada_pspace_data_cleanup (struct program_space *pspace, void *data) | |
474 | { | |
9a3c8263 | 475 | struct ada_pspace_data *pspace_data = (struct ada_pspace_data *) data; |
ee01b665 JB |
476 | |
477 | if (pspace_data->sym_cache != NULL) | |
478 | ada_free_symbol_cache (pspace_data->sym_cache); | |
479 | xfree (pspace_data); | |
480 | } | |
481 | ||
4c4b4cd2 PH |
482 | /* Utilities */ |
483 | ||
720d1a40 | 484 | /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after |
eed9788b | 485 | all typedef layers have been peeled. Otherwise, return TYPE. |
720d1a40 JB |
486 | |
487 | Normally, we really expect a typedef type to only have 1 typedef layer. | |
488 | In other words, we really expect the target type of a typedef type to be | |
489 | a non-typedef type. This is particularly true for Ada units, because | |
490 | the language does not have a typedef vs not-typedef distinction. | |
491 | In that respect, the Ada compiler has been trying to eliminate as many | |
492 | typedef definitions in the debugging information, since they generally | |
493 | do not bring any extra information (we still use typedef under certain | |
494 | circumstances related mostly to the GNAT encoding). | |
495 | ||
496 | Unfortunately, we have seen situations where the debugging information | |
497 | generated by the compiler leads to such multiple typedef layers. For | |
498 | instance, consider the following example with stabs: | |
499 | ||
500 | .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...] | |
501 | .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0 | |
502 | ||
503 | This is an error in the debugging information which causes type | |
504 | pck__float_array___XUP to be defined twice, and the second time, | |
505 | it is defined as a typedef of a typedef. | |
506 | ||
507 | This is on the fringe of legality as far as debugging information is | |
508 | concerned, and certainly unexpected. But it is easy to handle these | |
509 | situations correctly, so we can afford to be lenient in this case. */ | |
510 | ||
511 | static struct type * | |
512 | ada_typedef_target_type (struct type *type) | |
513 | { | |
514 | while (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
515 | type = TYPE_TARGET_TYPE (type); | |
516 | return type; | |
517 | } | |
518 | ||
41d27058 JB |
519 | /* Given DECODED_NAME a string holding a symbol name in its |
520 | decoded form (ie using the Ada dotted notation), returns | |
521 | its unqualified name. */ | |
522 | ||
523 | static const char * | |
524 | ada_unqualified_name (const char *decoded_name) | |
525 | { | |
2b0f535a JB |
526 | const char *result; |
527 | ||
528 | /* If the decoded name starts with '<', it means that the encoded | |
529 | name does not follow standard naming conventions, and thus that | |
530 | it is not your typical Ada symbol name. Trying to unqualify it | |
531 | is therefore pointless and possibly erroneous. */ | |
532 | if (decoded_name[0] == '<') | |
533 | return decoded_name; | |
534 | ||
535 | result = strrchr (decoded_name, '.'); | |
41d27058 JB |
536 | if (result != NULL) |
537 | result++; /* Skip the dot... */ | |
538 | else | |
539 | result = decoded_name; | |
540 | ||
541 | return result; | |
542 | } | |
543 | ||
544 | /* Return a string starting with '<', followed by STR, and '>'. | |
545 | The result is good until the next call. */ | |
546 | ||
547 | static char * | |
548 | add_angle_brackets (const char *str) | |
549 | { | |
550 | static char *result = NULL; | |
551 | ||
552 | xfree (result); | |
88c15c34 | 553 | result = xstrprintf ("<%s>", str); |
41d27058 JB |
554 | return result; |
555 | } | |
96d887e8 | 556 | |
67cb5b2d | 557 | static const char * |
4c4b4cd2 PH |
558 | ada_get_gdb_completer_word_break_characters (void) |
559 | { | |
560 | return ada_completer_word_break_characters; | |
561 | } | |
562 | ||
e79af960 JB |
563 | /* Print an array element index using the Ada syntax. */ |
564 | ||
565 | static void | |
566 | ada_print_array_index (struct value *index_value, struct ui_file *stream, | |
79a45b7d | 567 | const struct value_print_options *options) |
e79af960 | 568 | { |
79a45b7d | 569 | LA_VALUE_PRINT (index_value, stream, options); |
e79af960 JB |
570 | fprintf_filtered (stream, " => "); |
571 | } | |
572 | ||
f27cf670 | 573 | /* Assuming VECT points to an array of *SIZE objects of size |
14f9c5c9 | 574 | ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects, |
f27cf670 | 575 | updating *SIZE as necessary and returning the (new) array. */ |
14f9c5c9 | 576 | |
f27cf670 AS |
577 | void * |
578 | grow_vect (void *vect, size_t *size, size_t min_size, int element_size) | |
14f9c5c9 | 579 | { |
d2e4a39e AS |
580 | if (*size < min_size) |
581 | { | |
582 | *size *= 2; | |
583 | if (*size < min_size) | |
4c4b4cd2 | 584 | *size = min_size; |
f27cf670 | 585 | vect = xrealloc (vect, *size * element_size); |
d2e4a39e | 586 | } |
f27cf670 | 587 | return vect; |
14f9c5c9 AS |
588 | } |
589 | ||
590 | /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing | |
4c4b4cd2 | 591 | suffix of FIELD_NAME beginning "___". */ |
14f9c5c9 AS |
592 | |
593 | static int | |
ebf56fd3 | 594 | field_name_match (const char *field_name, const char *target) |
14f9c5c9 AS |
595 | { |
596 | int len = strlen (target); | |
5b4ee69b | 597 | |
d2e4a39e | 598 | return |
4c4b4cd2 PH |
599 | (strncmp (field_name, target, len) == 0 |
600 | && (field_name[len] == '\0' | |
61012eef | 601 | || (startswith (field_name + len, "___") |
76a01679 JB |
602 | && strcmp (field_name + strlen (field_name) - 6, |
603 | "___XVN") != 0))); | |
14f9c5c9 AS |
604 | } |
605 | ||
606 | ||
872c8b51 JB |
607 | /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to |
608 | a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME, | |
609 | and return its index. This function also handles fields whose name | |
610 | have ___ suffixes because the compiler sometimes alters their name | |
611 | by adding such a suffix to represent fields with certain constraints. | |
612 | If the field could not be found, return a negative number if | |
613 | MAYBE_MISSING is set. Otherwise raise an error. */ | |
4c4b4cd2 PH |
614 | |
615 | int | |
616 | ada_get_field_index (const struct type *type, const char *field_name, | |
617 | int maybe_missing) | |
618 | { | |
619 | int fieldno; | |
872c8b51 JB |
620 | struct type *struct_type = check_typedef ((struct type *) type); |
621 | ||
622 | for (fieldno = 0; fieldno < TYPE_NFIELDS (struct_type); fieldno++) | |
623 | if (field_name_match (TYPE_FIELD_NAME (struct_type, fieldno), field_name)) | |
4c4b4cd2 PH |
624 | return fieldno; |
625 | ||
626 | if (!maybe_missing) | |
323e0a4a | 627 | error (_("Unable to find field %s in struct %s. Aborting"), |
872c8b51 | 628 | field_name, TYPE_NAME (struct_type)); |
4c4b4cd2 PH |
629 | |
630 | return -1; | |
631 | } | |
632 | ||
633 | /* The length of the prefix of NAME prior to any "___" suffix. */ | |
14f9c5c9 AS |
634 | |
635 | int | |
d2e4a39e | 636 | ada_name_prefix_len (const char *name) |
14f9c5c9 AS |
637 | { |
638 | if (name == NULL) | |
639 | return 0; | |
d2e4a39e | 640 | else |
14f9c5c9 | 641 | { |
d2e4a39e | 642 | const char *p = strstr (name, "___"); |
5b4ee69b | 643 | |
14f9c5c9 | 644 | if (p == NULL) |
4c4b4cd2 | 645 | return strlen (name); |
14f9c5c9 | 646 | else |
4c4b4cd2 | 647 | return p - name; |
14f9c5c9 AS |
648 | } |
649 | } | |
650 | ||
4c4b4cd2 PH |
651 | /* Return non-zero if SUFFIX is a suffix of STR. |
652 | Return zero if STR is null. */ | |
653 | ||
14f9c5c9 | 654 | static int |
d2e4a39e | 655 | is_suffix (const char *str, const char *suffix) |
14f9c5c9 AS |
656 | { |
657 | int len1, len2; | |
5b4ee69b | 658 | |
14f9c5c9 AS |
659 | if (str == NULL) |
660 | return 0; | |
661 | len1 = strlen (str); | |
662 | len2 = strlen (suffix); | |
4c4b4cd2 | 663 | return (len1 >= len2 && strcmp (str + len1 - len2, suffix) == 0); |
14f9c5c9 AS |
664 | } |
665 | ||
4c4b4cd2 PH |
666 | /* The contents of value VAL, treated as a value of type TYPE. The |
667 | result is an lval in memory if VAL is. */ | |
14f9c5c9 | 668 | |
d2e4a39e | 669 | static struct value * |
4c4b4cd2 | 670 | coerce_unspec_val_to_type (struct value *val, struct type *type) |
14f9c5c9 | 671 | { |
61ee279c | 672 | type = ada_check_typedef (type); |
df407dfe | 673 | if (value_type (val) == type) |
4c4b4cd2 | 674 | return val; |
d2e4a39e | 675 | else |
14f9c5c9 | 676 | { |
4c4b4cd2 PH |
677 | struct value *result; |
678 | ||
679 | /* Make sure that the object size is not unreasonable before | |
680 | trying to allocate some memory for it. */ | |
c1b5a1a6 | 681 | ada_ensure_varsize_limit (type); |
4c4b4cd2 | 682 | |
41e8491f JK |
683 | if (value_lazy (val) |
684 | || TYPE_LENGTH (type) > TYPE_LENGTH (value_type (val))) | |
685 | result = allocate_value_lazy (type); | |
686 | else | |
687 | { | |
688 | result = allocate_value (type); | |
9a0dc9e3 | 689 | value_contents_copy_raw (result, 0, val, 0, TYPE_LENGTH (type)); |
41e8491f | 690 | } |
74bcbdf3 | 691 | set_value_component_location (result, val); |
9bbda503 AC |
692 | set_value_bitsize (result, value_bitsize (val)); |
693 | set_value_bitpos (result, value_bitpos (val)); | |
42ae5230 | 694 | set_value_address (result, value_address (val)); |
14f9c5c9 AS |
695 | return result; |
696 | } | |
697 | } | |
698 | ||
fc1a4b47 AC |
699 | static const gdb_byte * |
700 | cond_offset_host (const gdb_byte *valaddr, long offset) | |
14f9c5c9 AS |
701 | { |
702 | if (valaddr == NULL) | |
703 | return NULL; | |
704 | else | |
705 | return valaddr + offset; | |
706 | } | |
707 | ||
708 | static CORE_ADDR | |
ebf56fd3 | 709 | cond_offset_target (CORE_ADDR address, long offset) |
14f9c5c9 AS |
710 | { |
711 | if (address == 0) | |
712 | return 0; | |
d2e4a39e | 713 | else |
14f9c5c9 AS |
714 | return address + offset; |
715 | } | |
716 | ||
4c4b4cd2 PH |
717 | /* Issue a warning (as for the definition of warning in utils.c, but |
718 | with exactly one argument rather than ...), unless the limit on the | |
719 | number of warnings has passed during the evaluation of the current | |
720 | expression. */ | |
a2249542 | 721 | |
77109804 AC |
722 | /* FIXME: cagney/2004-10-10: This function is mimicking the behavior |
723 | provided by "complaint". */ | |
a0b31db1 | 724 | static void lim_warning (const char *format, ...) ATTRIBUTE_PRINTF (1, 2); |
77109804 | 725 | |
14f9c5c9 | 726 | static void |
a2249542 | 727 | lim_warning (const char *format, ...) |
14f9c5c9 | 728 | { |
a2249542 | 729 | va_list args; |
a2249542 | 730 | |
5b4ee69b | 731 | va_start (args, format); |
4c4b4cd2 PH |
732 | warnings_issued += 1; |
733 | if (warnings_issued <= warning_limit) | |
a2249542 MK |
734 | vwarning (format, args); |
735 | ||
736 | va_end (args); | |
4c4b4cd2 PH |
737 | } |
738 | ||
714e53ab PH |
739 | /* Issue an error if the size of an object of type T is unreasonable, |
740 | i.e. if it would be a bad idea to allocate a value of this type in | |
741 | GDB. */ | |
742 | ||
c1b5a1a6 JB |
743 | void |
744 | ada_ensure_varsize_limit (const struct type *type) | |
714e53ab PH |
745 | { |
746 | if (TYPE_LENGTH (type) > varsize_limit) | |
323e0a4a | 747 | error (_("object size is larger than varsize-limit")); |
714e53ab PH |
748 | } |
749 | ||
0963b4bd | 750 | /* Maximum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 751 | static LONGEST |
c3e5cd34 | 752 | max_of_size (int size) |
4c4b4cd2 | 753 | { |
76a01679 | 754 | LONGEST top_bit = (LONGEST) 1 << (size * 8 - 2); |
5b4ee69b | 755 | |
76a01679 | 756 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
757 | } |
758 | ||
0963b4bd | 759 | /* Minimum value of a SIZE-byte signed integer type. */ |
4c4b4cd2 | 760 | static LONGEST |
c3e5cd34 | 761 | min_of_size (int size) |
4c4b4cd2 | 762 | { |
c3e5cd34 | 763 | return -max_of_size (size) - 1; |
4c4b4cd2 PH |
764 | } |
765 | ||
0963b4bd | 766 | /* Maximum value of a SIZE-byte unsigned integer type. */ |
4c4b4cd2 | 767 | static ULONGEST |
c3e5cd34 | 768 | umax_of_size (int size) |
4c4b4cd2 | 769 | { |
76a01679 | 770 | ULONGEST top_bit = (ULONGEST) 1 << (size * 8 - 1); |
5b4ee69b | 771 | |
76a01679 | 772 | return top_bit | (top_bit - 1); |
4c4b4cd2 PH |
773 | } |
774 | ||
0963b4bd | 775 | /* Maximum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
776 | static LONGEST |
777 | max_of_type (struct type *t) | |
4c4b4cd2 | 778 | { |
c3e5cd34 PH |
779 | if (TYPE_UNSIGNED (t)) |
780 | return (LONGEST) umax_of_size (TYPE_LENGTH (t)); | |
781 | else | |
782 | return max_of_size (TYPE_LENGTH (t)); | |
783 | } | |
784 | ||
0963b4bd | 785 | /* Minimum value of integral type T, as a signed quantity. */ |
c3e5cd34 PH |
786 | static LONGEST |
787 | min_of_type (struct type *t) | |
788 | { | |
789 | if (TYPE_UNSIGNED (t)) | |
790 | return 0; | |
791 | else | |
792 | return min_of_size (TYPE_LENGTH (t)); | |
4c4b4cd2 PH |
793 | } |
794 | ||
795 | /* The largest value in the domain of TYPE, a discrete type, as an integer. */ | |
43bbcdc2 PH |
796 | LONGEST |
797 | ada_discrete_type_high_bound (struct type *type) | |
4c4b4cd2 | 798 | { |
c3345124 | 799 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 800 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
801 | { |
802 | case TYPE_CODE_RANGE: | |
690cc4eb | 803 | return TYPE_HIGH_BOUND (type); |
4c4b4cd2 | 804 | case TYPE_CODE_ENUM: |
14e75d8e | 805 | return TYPE_FIELD_ENUMVAL (type, TYPE_NFIELDS (type) - 1); |
690cc4eb PH |
806 | case TYPE_CODE_BOOL: |
807 | return 1; | |
808 | case TYPE_CODE_CHAR: | |
76a01679 | 809 | case TYPE_CODE_INT: |
690cc4eb | 810 | return max_of_type (type); |
4c4b4cd2 | 811 | default: |
43bbcdc2 | 812 | error (_("Unexpected type in ada_discrete_type_high_bound.")); |
4c4b4cd2 PH |
813 | } |
814 | } | |
815 | ||
14e75d8e | 816 | /* The smallest value in the domain of TYPE, a discrete type, as an integer. */ |
43bbcdc2 PH |
817 | LONGEST |
818 | ada_discrete_type_low_bound (struct type *type) | |
4c4b4cd2 | 819 | { |
c3345124 | 820 | type = resolve_dynamic_type (type, NULL, 0); |
76a01679 | 821 | switch (TYPE_CODE (type)) |
4c4b4cd2 PH |
822 | { |
823 | case TYPE_CODE_RANGE: | |
690cc4eb | 824 | return TYPE_LOW_BOUND (type); |
4c4b4cd2 | 825 | case TYPE_CODE_ENUM: |
14e75d8e | 826 | return TYPE_FIELD_ENUMVAL (type, 0); |
690cc4eb PH |
827 | case TYPE_CODE_BOOL: |
828 | return 0; | |
829 | case TYPE_CODE_CHAR: | |
76a01679 | 830 | case TYPE_CODE_INT: |
690cc4eb | 831 | return min_of_type (type); |
4c4b4cd2 | 832 | default: |
43bbcdc2 | 833 | error (_("Unexpected type in ada_discrete_type_low_bound.")); |
4c4b4cd2 PH |
834 | } |
835 | } | |
836 | ||
837 | /* The identity on non-range types. For range types, the underlying | |
76a01679 | 838 | non-range scalar type. */ |
4c4b4cd2 PH |
839 | |
840 | static struct type * | |
18af8284 | 841 | get_base_type (struct type *type) |
4c4b4cd2 PH |
842 | { |
843 | while (type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE) | |
844 | { | |
76a01679 JB |
845 | if (type == TYPE_TARGET_TYPE (type) || TYPE_TARGET_TYPE (type) == NULL) |
846 | return type; | |
4c4b4cd2 PH |
847 | type = TYPE_TARGET_TYPE (type); |
848 | } | |
849 | return type; | |
14f9c5c9 | 850 | } |
41246937 JB |
851 | |
852 | /* Return a decoded version of the given VALUE. This means returning | |
853 | a value whose type is obtained by applying all the GNAT-specific | |
854 | encondings, making the resulting type a static but standard description | |
855 | of the initial type. */ | |
856 | ||
857 | struct value * | |
858 | ada_get_decoded_value (struct value *value) | |
859 | { | |
860 | struct type *type = ada_check_typedef (value_type (value)); | |
861 | ||
862 | if (ada_is_array_descriptor_type (type) | |
863 | || (ada_is_constrained_packed_array_type (type) | |
864 | && TYPE_CODE (type) != TYPE_CODE_PTR)) | |
865 | { | |
866 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) /* array access type. */ | |
867 | value = ada_coerce_to_simple_array_ptr (value); | |
868 | else | |
869 | value = ada_coerce_to_simple_array (value); | |
870 | } | |
871 | else | |
872 | value = ada_to_fixed_value (value); | |
873 | ||
874 | return value; | |
875 | } | |
876 | ||
877 | /* Same as ada_get_decoded_value, but with the given TYPE. | |
878 | Because there is no associated actual value for this type, | |
879 | the resulting type might be a best-effort approximation in | |
880 | the case of dynamic types. */ | |
881 | ||
882 | struct type * | |
883 | ada_get_decoded_type (struct type *type) | |
884 | { | |
885 | type = to_static_fixed_type (type); | |
886 | if (ada_is_constrained_packed_array_type (type)) | |
887 | type = ada_coerce_to_simple_array_type (type); | |
888 | return type; | |
889 | } | |
890 | ||
4c4b4cd2 | 891 | \f |
76a01679 | 892 | |
4c4b4cd2 | 893 | /* Language Selection */ |
14f9c5c9 AS |
894 | |
895 | /* If the main program is in Ada, return language_ada, otherwise return LANG | |
ccefe4c4 | 896 | (the main program is in Ada iif the adainit symbol is found). */ |
d2e4a39e | 897 | |
14f9c5c9 | 898 | enum language |
ccefe4c4 | 899 | ada_update_initial_language (enum language lang) |
14f9c5c9 | 900 | { |
d2e4a39e | 901 | if (lookup_minimal_symbol ("adainit", (const char *) NULL, |
3b7344d5 | 902 | (struct objfile *) NULL).minsym != NULL) |
4c4b4cd2 | 903 | return language_ada; |
14f9c5c9 AS |
904 | |
905 | return lang; | |
906 | } | |
96d887e8 PH |
907 | |
908 | /* If the main procedure is written in Ada, then return its name. | |
909 | The result is good until the next call. Return NULL if the main | |
910 | procedure doesn't appear to be in Ada. */ | |
911 | ||
912 | char * | |
913 | ada_main_name (void) | |
914 | { | |
3b7344d5 | 915 | struct bound_minimal_symbol msym; |
f9bc20b9 | 916 | static char *main_program_name = NULL; |
6c038f32 | 917 | |
96d887e8 PH |
918 | /* For Ada, the name of the main procedure is stored in a specific |
919 | string constant, generated by the binder. Look for that symbol, | |
920 | extract its address, and then read that string. If we didn't find | |
921 | that string, then most probably the main procedure is not written | |
922 | in Ada. */ | |
923 | msym = lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME, NULL, NULL); | |
924 | ||
3b7344d5 | 925 | if (msym.minsym != NULL) |
96d887e8 | 926 | { |
f9bc20b9 JB |
927 | CORE_ADDR main_program_name_addr; |
928 | int err_code; | |
929 | ||
77e371c0 | 930 | main_program_name_addr = BMSYMBOL_VALUE_ADDRESS (msym); |
96d887e8 | 931 | if (main_program_name_addr == 0) |
323e0a4a | 932 | error (_("Invalid address for Ada main program name.")); |
96d887e8 | 933 | |
f9bc20b9 JB |
934 | xfree (main_program_name); |
935 | target_read_string (main_program_name_addr, &main_program_name, | |
936 | 1024, &err_code); | |
937 | ||
938 | if (err_code != 0) | |
939 | return NULL; | |
96d887e8 PH |
940 | return main_program_name; |
941 | } | |
942 | ||
943 | /* The main procedure doesn't seem to be in Ada. */ | |
944 | return NULL; | |
945 | } | |
14f9c5c9 | 946 | \f |
4c4b4cd2 | 947 | /* Symbols */ |
d2e4a39e | 948 | |
4c4b4cd2 PH |
949 | /* Table of Ada operators and their GNAT-encoded names. Last entry is pair |
950 | of NULLs. */ | |
14f9c5c9 | 951 | |
d2e4a39e AS |
952 | const struct ada_opname_map ada_opname_table[] = { |
953 | {"Oadd", "\"+\"", BINOP_ADD}, | |
954 | {"Osubtract", "\"-\"", BINOP_SUB}, | |
955 | {"Omultiply", "\"*\"", BINOP_MUL}, | |
956 | {"Odivide", "\"/\"", BINOP_DIV}, | |
957 | {"Omod", "\"mod\"", BINOP_MOD}, | |
958 | {"Orem", "\"rem\"", BINOP_REM}, | |
959 | {"Oexpon", "\"**\"", BINOP_EXP}, | |
960 | {"Olt", "\"<\"", BINOP_LESS}, | |
961 | {"Ole", "\"<=\"", BINOP_LEQ}, | |
962 | {"Ogt", "\">\"", BINOP_GTR}, | |
963 | {"Oge", "\">=\"", BINOP_GEQ}, | |
964 | {"Oeq", "\"=\"", BINOP_EQUAL}, | |
965 | {"One", "\"/=\"", BINOP_NOTEQUAL}, | |
966 | {"Oand", "\"and\"", BINOP_BITWISE_AND}, | |
967 | {"Oor", "\"or\"", BINOP_BITWISE_IOR}, | |
968 | {"Oxor", "\"xor\"", BINOP_BITWISE_XOR}, | |
969 | {"Oconcat", "\"&\"", BINOP_CONCAT}, | |
970 | {"Oabs", "\"abs\"", UNOP_ABS}, | |
971 | {"Onot", "\"not\"", UNOP_LOGICAL_NOT}, | |
972 | {"Oadd", "\"+\"", UNOP_PLUS}, | |
973 | {"Osubtract", "\"-\"", UNOP_NEG}, | |
974 | {NULL, NULL} | |
14f9c5c9 AS |
975 | }; |
976 | ||
b5ec771e PA |
977 | /* The "encoded" form of DECODED, according to GNAT conventions. The |
978 | result is valid until the next call to ada_encode. If | |
979 | THROW_ERRORS, throw an error if invalid operator name is found. | |
980 | Otherwise, return NULL in that case. */ | |
4c4b4cd2 | 981 | |
b5ec771e PA |
982 | static char * |
983 | ada_encode_1 (const char *decoded, bool throw_errors) | |
14f9c5c9 | 984 | { |
4c4b4cd2 PH |
985 | static char *encoding_buffer = NULL; |
986 | static size_t encoding_buffer_size = 0; | |
d2e4a39e | 987 | const char *p; |
14f9c5c9 | 988 | int k; |
d2e4a39e | 989 | |
4c4b4cd2 | 990 | if (decoded == NULL) |
14f9c5c9 AS |
991 | return NULL; |
992 | ||
4c4b4cd2 PH |
993 | GROW_VECT (encoding_buffer, encoding_buffer_size, |
994 | 2 * strlen (decoded) + 10); | |
14f9c5c9 AS |
995 | |
996 | k = 0; | |
4c4b4cd2 | 997 | for (p = decoded; *p != '\0'; p += 1) |
14f9c5c9 | 998 | { |
cdc7bb92 | 999 | if (*p == '.') |
4c4b4cd2 PH |
1000 | { |
1001 | encoding_buffer[k] = encoding_buffer[k + 1] = '_'; | |
1002 | k += 2; | |
1003 | } | |
14f9c5c9 | 1004 | else if (*p == '"') |
4c4b4cd2 PH |
1005 | { |
1006 | const struct ada_opname_map *mapping; | |
1007 | ||
1008 | for (mapping = ada_opname_table; | |
1265e4aa | 1009 | mapping->encoded != NULL |
61012eef | 1010 | && !startswith (p, mapping->decoded); mapping += 1) |
4c4b4cd2 PH |
1011 | ; |
1012 | if (mapping->encoded == NULL) | |
b5ec771e PA |
1013 | { |
1014 | if (throw_errors) | |
1015 | error (_("invalid Ada operator name: %s"), p); | |
1016 | else | |
1017 | return NULL; | |
1018 | } | |
4c4b4cd2 PH |
1019 | strcpy (encoding_buffer + k, mapping->encoded); |
1020 | k += strlen (mapping->encoded); | |
1021 | break; | |
1022 | } | |
d2e4a39e | 1023 | else |
4c4b4cd2 PH |
1024 | { |
1025 | encoding_buffer[k] = *p; | |
1026 | k += 1; | |
1027 | } | |
14f9c5c9 AS |
1028 | } |
1029 | ||
4c4b4cd2 PH |
1030 | encoding_buffer[k] = '\0'; |
1031 | return encoding_buffer; | |
14f9c5c9 AS |
1032 | } |
1033 | ||
b5ec771e PA |
1034 | /* The "encoded" form of DECODED, according to GNAT conventions. |
1035 | The result is valid until the next call to ada_encode. */ | |
1036 | ||
1037 | char * | |
1038 | ada_encode (const char *decoded) | |
1039 | { | |
1040 | return ada_encode_1 (decoded, true); | |
1041 | } | |
1042 | ||
14f9c5c9 | 1043 | /* Return NAME folded to lower case, or, if surrounded by single |
4c4b4cd2 PH |
1044 | quotes, unfolded, but with the quotes stripped away. Result good |
1045 | to next call. */ | |
1046 | ||
d2e4a39e AS |
1047 | char * |
1048 | ada_fold_name (const char *name) | |
14f9c5c9 | 1049 | { |
d2e4a39e | 1050 | static char *fold_buffer = NULL; |
14f9c5c9 AS |
1051 | static size_t fold_buffer_size = 0; |
1052 | ||
1053 | int len = strlen (name); | |
d2e4a39e | 1054 | GROW_VECT (fold_buffer, fold_buffer_size, len + 1); |
14f9c5c9 AS |
1055 | |
1056 | if (name[0] == '\'') | |
1057 | { | |
d2e4a39e AS |
1058 | strncpy (fold_buffer, name + 1, len - 2); |
1059 | fold_buffer[len - 2] = '\000'; | |
14f9c5c9 AS |
1060 | } |
1061 | else | |
1062 | { | |
1063 | int i; | |
5b4ee69b | 1064 | |
14f9c5c9 | 1065 | for (i = 0; i <= len; i += 1) |
4c4b4cd2 | 1066 | fold_buffer[i] = tolower (name[i]); |
14f9c5c9 AS |
1067 | } |
1068 | ||
1069 | return fold_buffer; | |
1070 | } | |
1071 | ||
529cad9c PH |
1072 | /* Return nonzero if C is either a digit or a lowercase alphabet character. */ |
1073 | ||
1074 | static int | |
1075 | is_lower_alphanum (const char c) | |
1076 | { | |
1077 | return (isdigit (c) || (isalpha (c) && islower (c))); | |
1078 | } | |
1079 | ||
c90092fe JB |
1080 | /* ENCODED is the linkage name of a symbol and LEN contains its length. |
1081 | This function saves in LEN the length of that same symbol name but | |
1082 | without either of these suffixes: | |
29480c32 JB |
1083 | . .{DIGIT}+ |
1084 | . ${DIGIT}+ | |
1085 | . ___{DIGIT}+ | |
1086 | . __{DIGIT}+. | |
c90092fe | 1087 | |
29480c32 JB |
1088 | These are suffixes introduced by the compiler for entities such as |
1089 | nested subprogram for instance, in order to avoid name clashes. | |
1090 | They do not serve any purpose for the debugger. */ | |
1091 | ||
1092 | static void | |
1093 | ada_remove_trailing_digits (const char *encoded, int *len) | |
1094 | { | |
1095 | if (*len > 1 && isdigit (encoded[*len - 1])) | |
1096 | { | |
1097 | int i = *len - 2; | |
5b4ee69b | 1098 | |
29480c32 JB |
1099 | while (i > 0 && isdigit (encoded[i])) |
1100 | i--; | |
1101 | if (i >= 0 && encoded[i] == '.') | |
1102 | *len = i; | |
1103 | else if (i >= 0 && encoded[i] == '$') | |
1104 | *len = i; | |
61012eef | 1105 | else if (i >= 2 && startswith (encoded + i - 2, "___")) |
29480c32 | 1106 | *len = i - 2; |
61012eef | 1107 | else if (i >= 1 && startswith (encoded + i - 1, "__")) |
29480c32 JB |
1108 | *len = i - 1; |
1109 | } | |
1110 | } | |
1111 | ||
1112 | /* Remove the suffix introduced by the compiler for protected object | |
1113 | subprograms. */ | |
1114 | ||
1115 | static void | |
1116 | ada_remove_po_subprogram_suffix (const char *encoded, int *len) | |
1117 | { | |
1118 | /* Remove trailing N. */ | |
1119 | ||
1120 | /* Protected entry subprograms are broken into two | |
1121 | separate subprograms: The first one is unprotected, and has | |
1122 | a 'N' suffix; the second is the protected version, and has | |
0963b4bd | 1123 | the 'P' suffix. The second calls the first one after handling |
29480c32 JB |
1124 | the protection. Since the P subprograms are internally generated, |
1125 | we leave these names undecoded, giving the user a clue that this | |
1126 | entity is internal. */ | |
1127 | ||
1128 | if (*len > 1 | |
1129 | && encoded[*len - 1] == 'N' | |
1130 | && (isdigit (encoded[*len - 2]) || islower (encoded[*len - 2]))) | |
1131 | *len = *len - 1; | |
1132 | } | |
1133 | ||
69fadcdf JB |
1134 | /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */ |
1135 | ||
1136 | static void | |
1137 | ada_remove_Xbn_suffix (const char *encoded, int *len) | |
1138 | { | |
1139 | int i = *len - 1; | |
1140 | ||
1141 | while (i > 0 && (encoded[i] == 'b' || encoded[i] == 'n')) | |
1142 | i--; | |
1143 | ||
1144 | if (encoded[i] != 'X') | |
1145 | return; | |
1146 | ||
1147 | if (i == 0) | |
1148 | return; | |
1149 | ||
1150 | if (isalnum (encoded[i-1])) | |
1151 | *len = i; | |
1152 | } | |
1153 | ||
29480c32 JB |
1154 | /* If ENCODED follows the GNAT entity encoding conventions, then return |
1155 | the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is | |
1156 | replaced by ENCODED. | |
14f9c5c9 | 1157 | |
4c4b4cd2 | 1158 | The resulting string is valid until the next call of ada_decode. |
29480c32 | 1159 | If the string is unchanged by decoding, the original string pointer |
4c4b4cd2 PH |
1160 | is returned. */ |
1161 | ||
1162 | const char * | |
1163 | ada_decode (const char *encoded) | |
14f9c5c9 AS |
1164 | { |
1165 | int i, j; | |
1166 | int len0; | |
d2e4a39e | 1167 | const char *p; |
4c4b4cd2 | 1168 | char *decoded; |
14f9c5c9 | 1169 | int at_start_name; |
4c4b4cd2 PH |
1170 | static char *decoding_buffer = NULL; |
1171 | static size_t decoding_buffer_size = 0; | |
d2e4a39e | 1172 | |
29480c32 JB |
1173 | /* The name of the Ada main procedure starts with "_ada_". |
1174 | This prefix is not part of the decoded name, so skip this part | |
1175 | if we see this prefix. */ | |
61012eef | 1176 | if (startswith (encoded, "_ada_")) |
4c4b4cd2 | 1177 | encoded += 5; |
14f9c5c9 | 1178 | |
29480c32 JB |
1179 | /* If the name starts with '_', then it is not a properly encoded |
1180 | name, so do not attempt to decode it. Similarly, if the name | |
1181 | starts with '<', the name should not be decoded. */ | |
4c4b4cd2 | 1182 | if (encoded[0] == '_' || encoded[0] == '<') |
14f9c5c9 AS |
1183 | goto Suppress; |
1184 | ||
4c4b4cd2 | 1185 | len0 = strlen (encoded); |
4c4b4cd2 | 1186 | |
29480c32 JB |
1187 | ada_remove_trailing_digits (encoded, &len0); |
1188 | ada_remove_po_subprogram_suffix (encoded, &len0); | |
529cad9c | 1189 | |
4c4b4cd2 PH |
1190 | /* Remove the ___X.* suffix if present. Do not forget to verify that |
1191 | the suffix is located before the current "end" of ENCODED. We want | |
1192 | to avoid re-matching parts of ENCODED that have previously been | |
1193 | marked as discarded (by decrementing LEN0). */ | |
1194 | p = strstr (encoded, "___"); | |
1195 | if (p != NULL && p - encoded < len0 - 3) | |
14f9c5c9 AS |
1196 | { |
1197 | if (p[3] == 'X') | |
4c4b4cd2 | 1198 | len0 = p - encoded; |
14f9c5c9 | 1199 | else |
4c4b4cd2 | 1200 | goto Suppress; |
14f9c5c9 | 1201 | } |
4c4b4cd2 | 1202 | |
29480c32 JB |
1203 | /* Remove any trailing TKB suffix. It tells us that this symbol |
1204 | is for the body of a task, but that information does not actually | |
1205 | appear in the decoded name. */ | |
1206 | ||
61012eef | 1207 | if (len0 > 3 && startswith (encoded + len0 - 3, "TKB")) |
14f9c5c9 | 1208 | len0 -= 3; |
76a01679 | 1209 | |
a10967fa JB |
1210 | /* Remove any trailing TB suffix. The TB suffix is slightly different |
1211 | from the TKB suffix because it is used for non-anonymous task | |
1212 | bodies. */ | |
1213 | ||
61012eef | 1214 | if (len0 > 2 && startswith (encoded + len0 - 2, "TB")) |
a10967fa JB |
1215 | len0 -= 2; |
1216 | ||
29480c32 JB |
1217 | /* Remove trailing "B" suffixes. */ |
1218 | /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */ | |
1219 | ||
61012eef | 1220 | if (len0 > 1 && startswith (encoded + len0 - 1, "B")) |
14f9c5c9 AS |
1221 | len0 -= 1; |
1222 | ||
4c4b4cd2 | 1223 | /* Make decoded big enough for possible expansion by operator name. */ |
29480c32 | 1224 | |
4c4b4cd2 PH |
1225 | GROW_VECT (decoding_buffer, decoding_buffer_size, 2 * len0 + 1); |
1226 | decoded = decoding_buffer; | |
14f9c5c9 | 1227 | |
29480c32 JB |
1228 | /* Remove trailing __{digit}+ or trailing ${digit}+. */ |
1229 | ||
4c4b4cd2 | 1230 | if (len0 > 1 && isdigit (encoded[len0 - 1])) |
d2e4a39e | 1231 | { |
4c4b4cd2 PH |
1232 | i = len0 - 2; |
1233 | while ((i >= 0 && isdigit (encoded[i])) | |
1234 | || (i >= 1 && encoded[i] == '_' && isdigit (encoded[i - 1]))) | |
1235 | i -= 1; | |
1236 | if (i > 1 && encoded[i] == '_' && encoded[i - 1] == '_') | |
1237 | len0 = i - 1; | |
1238 | else if (encoded[i] == '$') | |
1239 | len0 = i; | |
d2e4a39e | 1240 | } |
14f9c5c9 | 1241 | |
29480c32 JB |
1242 | /* The first few characters that are not alphabetic are not part |
1243 | of any encoding we use, so we can copy them over verbatim. */ | |
1244 | ||
4c4b4cd2 PH |
1245 | for (i = 0, j = 0; i < len0 && !isalpha (encoded[i]); i += 1, j += 1) |
1246 | decoded[j] = encoded[i]; | |
14f9c5c9 AS |
1247 | |
1248 | at_start_name = 1; | |
1249 | while (i < len0) | |
1250 | { | |
29480c32 | 1251 | /* Is this a symbol function? */ |
4c4b4cd2 PH |
1252 | if (at_start_name && encoded[i] == 'O') |
1253 | { | |
1254 | int k; | |
5b4ee69b | 1255 | |
4c4b4cd2 PH |
1256 | for (k = 0; ada_opname_table[k].encoded != NULL; k += 1) |
1257 | { | |
1258 | int op_len = strlen (ada_opname_table[k].encoded); | |
06d5cf63 JB |
1259 | if ((strncmp (ada_opname_table[k].encoded + 1, encoded + i + 1, |
1260 | op_len - 1) == 0) | |
1261 | && !isalnum (encoded[i + op_len])) | |
4c4b4cd2 PH |
1262 | { |
1263 | strcpy (decoded + j, ada_opname_table[k].decoded); | |
1264 | at_start_name = 0; | |
1265 | i += op_len; | |
1266 | j += strlen (ada_opname_table[k].decoded); | |
1267 | break; | |
1268 | } | |
1269 | } | |
1270 | if (ada_opname_table[k].encoded != NULL) | |
1271 | continue; | |
1272 | } | |
14f9c5c9 AS |
1273 | at_start_name = 0; |
1274 | ||
529cad9c PH |
1275 | /* Replace "TK__" with "__", which will eventually be translated |
1276 | into "." (just below). */ | |
1277 | ||
61012eef | 1278 | if (i < len0 - 4 && startswith (encoded + i, "TK__")) |
4c4b4cd2 | 1279 | i += 2; |
529cad9c | 1280 | |
29480c32 JB |
1281 | /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually |
1282 | be translated into "." (just below). These are internal names | |
1283 | generated for anonymous blocks inside which our symbol is nested. */ | |
1284 | ||
1285 | if (len0 - i > 5 && encoded [i] == '_' && encoded [i+1] == '_' | |
1286 | && encoded [i+2] == 'B' && encoded [i+3] == '_' | |
1287 | && isdigit (encoded [i+4])) | |
1288 | { | |
1289 | int k = i + 5; | |
1290 | ||
1291 | while (k < len0 && isdigit (encoded[k])) | |
1292 | k++; /* Skip any extra digit. */ | |
1293 | ||
1294 | /* Double-check that the "__B_{DIGITS}+" sequence we found | |
1295 | is indeed followed by "__". */ | |
1296 | if (len0 - k > 2 && encoded [k] == '_' && encoded [k+1] == '_') | |
1297 | i = k; | |
1298 | } | |
1299 | ||
529cad9c PH |
1300 | /* Remove _E{DIGITS}+[sb] */ |
1301 | ||
1302 | /* Just as for protected object subprograms, there are 2 categories | |
0963b4bd | 1303 | of subprograms created by the compiler for each entry. The first |
529cad9c PH |
1304 | one implements the actual entry code, and has a suffix following |
1305 | the convention above; the second one implements the barrier and | |
1306 | uses the same convention as above, except that the 'E' is replaced | |
1307 | by a 'B'. | |
1308 | ||
1309 | Just as above, we do not decode the name of barrier functions | |
1310 | to give the user a clue that the code he is debugging has been | |
1311 | internally generated. */ | |
1312 | ||
1313 | if (len0 - i > 3 && encoded [i] == '_' && encoded[i+1] == 'E' | |
1314 | && isdigit (encoded[i+2])) | |
1315 | { | |
1316 | int k = i + 3; | |
1317 | ||
1318 | while (k < len0 && isdigit (encoded[k])) | |
1319 | k++; | |
1320 | ||
1321 | if (k < len0 | |
1322 | && (encoded[k] == 'b' || encoded[k] == 's')) | |
1323 | { | |
1324 | k++; | |
1325 | /* Just as an extra precaution, make sure that if this | |
1326 | suffix is followed by anything else, it is a '_'. | |
1327 | Otherwise, we matched this sequence by accident. */ | |
1328 | if (k == len0 | |
1329 | || (k < len0 && encoded[k] == '_')) | |
1330 | i = k; | |
1331 | } | |
1332 | } | |
1333 | ||
1334 | /* Remove trailing "N" in [a-z0-9]+N__. The N is added by | |
1335 | the GNAT front-end in protected object subprograms. */ | |
1336 | ||
1337 | if (i < len0 + 3 | |
1338 | && encoded[i] == 'N' && encoded[i+1] == '_' && encoded[i+2] == '_') | |
1339 | { | |
1340 | /* Backtrack a bit up until we reach either the begining of | |
1341 | the encoded name, or "__". Make sure that we only find | |
1342 | digits or lowercase characters. */ | |
1343 | const char *ptr = encoded + i - 1; | |
1344 | ||
1345 | while (ptr >= encoded && is_lower_alphanum (ptr[0])) | |
1346 | ptr--; | |
1347 | if (ptr < encoded | |
1348 | || (ptr > encoded && ptr[0] == '_' && ptr[-1] == '_')) | |
1349 | i++; | |
1350 | } | |
1351 | ||
4c4b4cd2 PH |
1352 | if (encoded[i] == 'X' && i != 0 && isalnum (encoded[i - 1])) |
1353 | { | |
29480c32 JB |
1354 | /* This is a X[bn]* sequence not separated from the previous |
1355 | part of the name with a non-alpha-numeric character (in other | |
1356 | words, immediately following an alpha-numeric character), then | |
1357 | verify that it is placed at the end of the encoded name. If | |
1358 | not, then the encoding is not valid and we should abort the | |
1359 | decoding. Otherwise, just skip it, it is used in body-nested | |
1360 | package names. */ | |
4c4b4cd2 PH |
1361 | do |
1362 | i += 1; | |
1363 | while (i < len0 && (encoded[i] == 'b' || encoded[i] == 'n')); | |
1364 | if (i < len0) | |
1365 | goto Suppress; | |
1366 | } | |
cdc7bb92 | 1367 | else if (i < len0 - 2 && encoded[i] == '_' && encoded[i + 1] == '_') |
4c4b4cd2 | 1368 | { |
29480c32 | 1369 | /* Replace '__' by '.'. */ |
4c4b4cd2 PH |
1370 | decoded[j] = '.'; |
1371 | at_start_name = 1; | |
1372 | i += 2; | |
1373 | j += 1; | |
1374 | } | |
14f9c5c9 | 1375 | else |
4c4b4cd2 | 1376 | { |
29480c32 JB |
1377 | /* It's a character part of the decoded name, so just copy it |
1378 | over. */ | |
4c4b4cd2 PH |
1379 | decoded[j] = encoded[i]; |
1380 | i += 1; | |
1381 | j += 1; | |
1382 | } | |
14f9c5c9 | 1383 | } |
4c4b4cd2 | 1384 | decoded[j] = '\000'; |
14f9c5c9 | 1385 | |
29480c32 JB |
1386 | /* Decoded names should never contain any uppercase character. |
1387 | Double-check this, and abort the decoding if we find one. */ | |
1388 | ||
4c4b4cd2 PH |
1389 | for (i = 0; decoded[i] != '\0'; i += 1) |
1390 | if (isupper (decoded[i]) || decoded[i] == ' ') | |
14f9c5c9 AS |
1391 | goto Suppress; |
1392 | ||
4c4b4cd2 PH |
1393 | if (strcmp (decoded, encoded) == 0) |
1394 | return encoded; | |
1395 | else | |
1396 | return decoded; | |
14f9c5c9 AS |
1397 | |
1398 | Suppress: | |
4c4b4cd2 PH |
1399 | GROW_VECT (decoding_buffer, decoding_buffer_size, strlen (encoded) + 3); |
1400 | decoded = decoding_buffer; | |
1401 | if (encoded[0] == '<') | |
1402 | strcpy (decoded, encoded); | |
14f9c5c9 | 1403 | else |
88c15c34 | 1404 | xsnprintf (decoded, decoding_buffer_size, "<%s>", encoded); |
4c4b4cd2 PH |
1405 | return decoded; |
1406 | ||
1407 | } | |
1408 | ||
1409 | /* Table for keeping permanent unique copies of decoded names. Once | |
1410 | allocated, names in this table are never released. While this is a | |
1411 | storage leak, it should not be significant unless there are massive | |
1412 | changes in the set of decoded names in successive versions of a | |
1413 | symbol table loaded during a single session. */ | |
1414 | static struct htab *decoded_names_store; | |
1415 | ||
1416 | /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it | |
1417 | in the language-specific part of GSYMBOL, if it has not been | |
1418 | previously computed. Tries to save the decoded name in the same | |
1419 | obstack as GSYMBOL, if possible, and otherwise on the heap (so that, | |
1420 | in any case, the decoded symbol has a lifetime at least that of | |
0963b4bd | 1421 | GSYMBOL). |
4c4b4cd2 PH |
1422 | The GSYMBOL parameter is "mutable" in the C++ sense: logically |
1423 | const, but nevertheless modified to a semantically equivalent form | |
0963b4bd | 1424 | when a decoded name is cached in it. */ |
4c4b4cd2 | 1425 | |
45e6c716 | 1426 | const char * |
f85f34ed | 1427 | ada_decode_symbol (const struct general_symbol_info *arg) |
4c4b4cd2 | 1428 | { |
f85f34ed TT |
1429 | struct general_symbol_info *gsymbol = (struct general_symbol_info *) arg; |
1430 | const char **resultp = | |
615b3f62 | 1431 | &gsymbol->language_specific.demangled_name; |
5b4ee69b | 1432 | |
f85f34ed | 1433 | if (!gsymbol->ada_mangled) |
4c4b4cd2 PH |
1434 | { |
1435 | const char *decoded = ada_decode (gsymbol->name); | |
f85f34ed | 1436 | struct obstack *obstack = gsymbol->language_specific.obstack; |
5b4ee69b | 1437 | |
f85f34ed | 1438 | gsymbol->ada_mangled = 1; |
5b4ee69b | 1439 | |
f85f34ed | 1440 | if (obstack != NULL) |
224c3ddb SM |
1441 | *resultp |
1442 | = (const char *) obstack_copy0 (obstack, decoded, strlen (decoded)); | |
f85f34ed | 1443 | else |
76a01679 | 1444 | { |
f85f34ed TT |
1445 | /* Sometimes, we can't find a corresponding objfile, in |
1446 | which case, we put the result on the heap. Since we only | |
1447 | decode when needed, we hope this usually does not cause a | |
1448 | significant memory leak (FIXME). */ | |
1449 | ||
76a01679 JB |
1450 | char **slot = (char **) htab_find_slot (decoded_names_store, |
1451 | decoded, INSERT); | |
5b4ee69b | 1452 | |
76a01679 JB |
1453 | if (*slot == NULL) |
1454 | *slot = xstrdup (decoded); | |
1455 | *resultp = *slot; | |
1456 | } | |
4c4b4cd2 | 1457 | } |
14f9c5c9 | 1458 | |
4c4b4cd2 PH |
1459 | return *resultp; |
1460 | } | |
76a01679 | 1461 | |
2c0b251b | 1462 | static char * |
76a01679 | 1463 | ada_la_decode (const char *encoded, int options) |
4c4b4cd2 PH |
1464 | { |
1465 | return xstrdup (ada_decode (encoded)); | |
14f9c5c9 AS |
1466 | } |
1467 | ||
8b302db8 TT |
1468 | /* Implement la_sniff_from_mangled_name for Ada. */ |
1469 | ||
1470 | static int | |
1471 | ada_sniff_from_mangled_name (const char *mangled, char **out) | |
1472 | { | |
1473 | const char *demangled = ada_decode (mangled); | |
1474 | ||
1475 | *out = NULL; | |
1476 | ||
1477 | if (demangled != mangled && demangled != NULL && demangled[0] != '<') | |
1478 | { | |
1479 | /* Set the gsymbol language to Ada, but still return 0. | |
1480 | Two reasons for that: | |
1481 | ||
1482 | 1. For Ada, we prefer computing the symbol's decoded name | |
1483 | on the fly rather than pre-compute it, in order to save | |
1484 | memory (Ada projects are typically very large). | |
1485 | ||
1486 | 2. There are some areas in the definition of the GNAT | |
1487 | encoding where, with a bit of bad luck, we might be able | |
1488 | to decode a non-Ada symbol, generating an incorrect | |
1489 | demangled name (Eg: names ending with "TB" for instance | |
1490 | are identified as task bodies and so stripped from | |
1491 | the decoded name returned). | |
1492 | ||
1493 | Returning 1, here, but not setting *DEMANGLED, helps us get a | |
1494 | little bit of the best of both worlds. Because we're last, | |
1495 | we should not affect any of the other languages that were | |
1496 | able to demangle the symbol before us; we get to correctly | |
1497 | tag Ada symbols as such; and even if we incorrectly tagged a | |
1498 | non-Ada symbol, which should be rare, any routing through the | |
1499 | Ada language should be transparent (Ada tries to behave much | |
1500 | like C/C++ with non-Ada symbols). */ | |
1501 | return 1; | |
1502 | } | |
1503 | ||
1504 | return 0; | |
1505 | } | |
1506 | ||
14f9c5c9 | 1507 | \f |
d2e4a39e | 1508 | |
4c4b4cd2 | 1509 | /* Arrays */ |
14f9c5c9 | 1510 | |
28c85d6c JB |
1511 | /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure |
1512 | generated by the GNAT compiler to describe the index type used | |
1513 | for each dimension of an array, check whether it follows the latest | |
1514 | known encoding. If not, fix it up to conform to the latest encoding. | |
1515 | Otherwise, do nothing. This function also does nothing if | |
1516 | INDEX_DESC_TYPE is NULL. | |
1517 | ||
1518 | The GNAT encoding used to describle the array index type evolved a bit. | |
1519 | Initially, the information would be provided through the name of each | |
1520 | field of the structure type only, while the type of these fields was | |
1521 | described as unspecified and irrelevant. The debugger was then expected | |
1522 | to perform a global type lookup using the name of that field in order | |
1523 | to get access to the full index type description. Because these global | |
1524 | lookups can be very expensive, the encoding was later enhanced to make | |
1525 | the global lookup unnecessary by defining the field type as being | |
1526 | the full index type description. | |
1527 | ||
1528 | The purpose of this routine is to allow us to support older versions | |
1529 | of the compiler by detecting the use of the older encoding, and by | |
1530 | fixing up the INDEX_DESC_TYPE to follow the new one (at this point, | |
1531 | we essentially replace each field's meaningless type by the associated | |
1532 | index subtype). */ | |
1533 | ||
1534 | void | |
1535 | ada_fixup_array_indexes_type (struct type *index_desc_type) | |
1536 | { | |
1537 | int i; | |
1538 | ||
1539 | if (index_desc_type == NULL) | |
1540 | return; | |
1541 | gdb_assert (TYPE_NFIELDS (index_desc_type) > 0); | |
1542 | ||
1543 | /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient | |
1544 | to check one field only, no need to check them all). If not, return | |
1545 | now. | |
1546 | ||
1547 | If our INDEX_DESC_TYPE was generated using the older encoding, | |
1548 | the field type should be a meaningless integer type whose name | |
1549 | is not equal to the field name. */ | |
1550 | if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)) != NULL | |
1551 | && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type, 0)), | |
1552 | TYPE_FIELD_NAME (index_desc_type, 0)) == 0) | |
1553 | return; | |
1554 | ||
1555 | /* Fixup each field of INDEX_DESC_TYPE. */ | |
1556 | for (i = 0; i < TYPE_NFIELDS (index_desc_type); i++) | |
1557 | { | |
0d5cff50 | 1558 | const char *name = TYPE_FIELD_NAME (index_desc_type, i); |
28c85d6c JB |
1559 | struct type *raw_type = ada_check_typedef (ada_find_any_type (name)); |
1560 | ||
1561 | if (raw_type) | |
1562 | TYPE_FIELD_TYPE (index_desc_type, i) = raw_type; | |
1563 | } | |
1564 | } | |
1565 | ||
4c4b4cd2 | 1566 | /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */ |
14f9c5c9 | 1567 | |
a121b7c1 | 1568 | static const char *bound_name[] = { |
d2e4a39e | 1569 | "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3", |
14f9c5c9 AS |
1570 | "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7" |
1571 | }; | |
1572 | ||
1573 | /* Maximum number of array dimensions we are prepared to handle. */ | |
1574 | ||
4c4b4cd2 | 1575 | #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *))) |
14f9c5c9 | 1576 | |
14f9c5c9 | 1577 | |
4c4b4cd2 PH |
1578 | /* The desc_* routines return primitive portions of array descriptors |
1579 | (fat pointers). */ | |
14f9c5c9 AS |
1580 | |
1581 | /* The descriptor or array type, if any, indicated by TYPE; removes | |
4c4b4cd2 PH |
1582 | level of indirection, if needed. */ |
1583 | ||
d2e4a39e AS |
1584 | static struct type * |
1585 | desc_base_type (struct type *type) | |
14f9c5c9 AS |
1586 | { |
1587 | if (type == NULL) | |
1588 | return NULL; | |
61ee279c | 1589 | type = ada_check_typedef (type); |
720d1a40 JB |
1590 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
1591 | type = ada_typedef_target_type (type); | |
1592 | ||
1265e4aa JB |
1593 | if (type != NULL |
1594 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1595 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
61ee279c | 1596 | return ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 AS |
1597 | else |
1598 | return type; | |
1599 | } | |
1600 | ||
4c4b4cd2 PH |
1601 | /* True iff TYPE indicates a "thin" array pointer type. */ |
1602 | ||
14f9c5c9 | 1603 | static int |
d2e4a39e | 1604 | is_thin_pntr (struct type *type) |
14f9c5c9 | 1605 | { |
d2e4a39e | 1606 | return |
14f9c5c9 AS |
1607 | is_suffix (ada_type_name (desc_base_type (type)), "___XUT") |
1608 | || is_suffix (ada_type_name (desc_base_type (type)), "___XUT___XVE"); | |
1609 | } | |
1610 | ||
4c4b4cd2 PH |
1611 | /* The descriptor type for thin pointer type TYPE. */ |
1612 | ||
d2e4a39e AS |
1613 | static struct type * |
1614 | thin_descriptor_type (struct type *type) | |
14f9c5c9 | 1615 | { |
d2e4a39e | 1616 | struct type *base_type = desc_base_type (type); |
5b4ee69b | 1617 | |
14f9c5c9 AS |
1618 | if (base_type == NULL) |
1619 | return NULL; | |
1620 | if (is_suffix (ada_type_name (base_type), "___XVE")) | |
1621 | return base_type; | |
d2e4a39e | 1622 | else |
14f9c5c9 | 1623 | { |
d2e4a39e | 1624 | struct type *alt_type = ada_find_parallel_type (base_type, "___XVE"); |
5b4ee69b | 1625 | |
14f9c5c9 | 1626 | if (alt_type == NULL) |
4c4b4cd2 | 1627 | return base_type; |
14f9c5c9 | 1628 | else |
4c4b4cd2 | 1629 | return alt_type; |
14f9c5c9 AS |
1630 | } |
1631 | } | |
1632 | ||
4c4b4cd2 PH |
1633 | /* A pointer to the array data for thin-pointer value VAL. */ |
1634 | ||
d2e4a39e AS |
1635 | static struct value * |
1636 | thin_data_pntr (struct value *val) | |
14f9c5c9 | 1637 | { |
828292f2 | 1638 | struct type *type = ada_check_typedef (value_type (val)); |
556bdfd4 | 1639 | struct type *data_type = desc_data_target_type (thin_descriptor_type (type)); |
5b4ee69b | 1640 | |
556bdfd4 UW |
1641 | data_type = lookup_pointer_type (data_type); |
1642 | ||
14f9c5c9 | 1643 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
556bdfd4 | 1644 | return value_cast (data_type, value_copy (val)); |
d2e4a39e | 1645 | else |
42ae5230 | 1646 | return value_from_longest (data_type, value_address (val)); |
14f9c5c9 AS |
1647 | } |
1648 | ||
4c4b4cd2 PH |
1649 | /* True iff TYPE indicates a "thick" array pointer type. */ |
1650 | ||
14f9c5c9 | 1651 | static int |
d2e4a39e | 1652 | is_thick_pntr (struct type *type) |
14f9c5c9 AS |
1653 | { |
1654 | type = desc_base_type (type); | |
1655 | return (type != NULL && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
4c4b4cd2 | 1656 | && lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL); |
14f9c5c9 AS |
1657 | } |
1658 | ||
4c4b4cd2 PH |
1659 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
1660 | pointer to one, the type of its bounds data; otherwise, NULL. */ | |
76a01679 | 1661 | |
d2e4a39e AS |
1662 | static struct type * |
1663 | desc_bounds_type (struct type *type) | |
14f9c5c9 | 1664 | { |
d2e4a39e | 1665 | struct type *r; |
14f9c5c9 AS |
1666 | |
1667 | type = desc_base_type (type); | |
1668 | ||
1669 | if (type == NULL) | |
1670 | return NULL; | |
1671 | else if (is_thin_pntr (type)) | |
1672 | { | |
1673 | type = thin_descriptor_type (type); | |
1674 | if (type == NULL) | |
4c4b4cd2 | 1675 | return NULL; |
14f9c5c9 AS |
1676 | r = lookup_struct_elt_type (type, "BOUNDS", 1); |
1677 | if (r != NULL) | |
61ee279c | 1678 | return ada_check_typedef (r); |
14f9c5c9 AS |
1679 | } |
1680 | else if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
1681 | { | |
1682 | r = lookup_struct_elt_type (type, "P_BOUNDS", 1); | |
1683 | if (r != NULL) | |
61ee279c | 1684 | return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r))); |
14f9c5c9 AS |
1685 | } |
1686 | return NULL; | |
1687 | } | |
1688 | ||
1689 | /* If ARR is an array descriptor (fat or thin pointer), or pointer to | |
4c4b4cd2 PH |
1690 | one, a pointer to its bounds data. Otherwise NULL. */ |
1691 | ||
d2e4a39e AS |
1692 | static struct value * |
1693 | desc_bounds (struct value *arr) | |
14f9c5c9 | 1694 | { |
df407dfe | 1695 | struct type *type = ada_check_typedef (value_type (arr)); |
5b4ee69b | 1696 | |
d2e4a39e | 1697 | if (is_thin_pntr (type)) |
14f9c5c9 | 1698 | { |
d2e4a39e | 1699 | struct type *bounds_type = |
4c4b4cd2 | 1700 | desc_bounds_type (thin_descriptor_type (type)); |
14f9c5c9 AS |
1701 | LONGEST addr; |
1702 | ||
4cdfadb1 | 1703 | if (bounds_type == NULL) |
323e0a4a | 1704 | error (_("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1705 | |
1706 | /* NOTE: The following calculation is not really kosher, but | |
d2e4a39e | 1707 | since desc_type is an XVE-encoded type (and shouldn't be), |
4c4b4cd2 | 1708 | the correct calculation is a real pain. FIXME (and fix GCC). */ |
14f9c5c9 | 1709 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
4c4b4cd2 | 1710 | addr = value_as_long (arr); |
d2e4a39e | 1711 | else |
42ae5230 | 1712 | addr = value_address (arr); |
14f9c5c9 | 1713 | |
d2e4a39e | 1714 | return |
4c4b4cd2 PH |
1715 | value_from_longest (lookup_pointer_type (bounds_type), |
1716 | addr - TYPE_LENGTH (bounds_type)); | |
14f9c5c9 AS |
1717 | } |
1718 | ||
1719 | else if (is_thick_pntr (type)) | |
05e522ef JB |
1720 | { |
1721 | struct value *p_bounds = value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, | |
1722 | _("Bad GNAT array descriptor")); | |
1723 | struct type *p_bounds_type = value_type (p_bounds); | |
1724 | ||
1725 | if (p_bounds_type | |
1726 | && TYPE_CODE (p_bounds_type) == TYPE_CODE_PTR) | |
1727 | { | |
1728 | struct type *target_type = TYPE_TARGET_TYPE (p_bounds_type); | |
1729 | ||
1730 | if (TYPE_STUB (target_type)) | |
1731 | p_bounds = value_cast (lookup_pointer_type | |
1732 | (ada_check_typedef (target_type)), | |
1733 | p_bounds); | |
1734 | } | |
1735 | else | |
1736 | error (_("Bad GNAT array descriptor")); | |
1737 | ||
1738 | return p_bounds; | |
1739 | } | |
14f9c5c9 AS |
1740 | else |
1741 | return NULL; | |
1742 | } | |
1743 | ||
4c4b4cd2 PH |
1744 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit |
1745 | position of the field containing the address of the bounds data. */ | |
1746 | ||
14f9c5c9 | 1747 | static int |
d2e4a39e | 1748 | fat_pntr_bounds_bitpos (struct type *type) |
14f9c5c9 AS |
1749 | { |
1750 | return TYPE_FIELD_BITPOS (desc_base_type (type), 1); | |
1751 | } | |
1752 | ||
1753 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1754 | size of the field containing the address of the bounds data. */ |
1755 | ||
14f9c5c9 | 1756 | static int |
d2e4a39e | 1757 | fat_pntr_bounds_bitsize (struct type *type) |
14f9c5c9 AS |
1758 | { |
1759 | type = desc_base_type (type); | |
1760 | ||
d2e4a39e | 1761 | if (TYPE_FIELD_BITSIZE (type, 1) > 0) |
14f9c5c9 AS |
1762 | return TYPE_FIELD_BITSIZE (type, 1); |
1763 | else | |
61ee279c | 1764 | return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type, 1))); |
14f9c5c9 AS |
1765 | } |
1766 | ||
4c4b4cd2 | 1767 | /* If TYPE is the type of an array descriptor (fat or thin pointer) or a |
556bdfd4 UW |
1768 | pointer to one, the type of its array data (a array-with-no-bounds type); |
1769 | otherwise, NULL. Use ada_type_of_array to get an array type with bounds | |
1770 | data. */ | |
4c4b4cd2 | 1771 | |
d2e4a39e | 1772 | static struct type * |
556bdfd4 | 1773 | desc_data_target_type (struct type *type) |
14f9c5c9 AS |
1774 | { |
1775 | type = desc_base_type (type); | |
1776 | ||
4c4b4cd2 | 1777 | /* NOTE: The following is bogus; see comment in desc_bounds. */ |
14f9c5c9 | 1778 | if (is_thin_pntr (type)) |
556bdfd4 | 1779 | return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type), 1)); |
14f9c5c9 | 1780 | else if (is_thick_pntr (type)) |
556bdfd4 UW |
1781 | { |
1782 | struct type *data_type = lookup_struct_elt_type (type, "P_ARRAY", 1); | |
1783 | ||
1784 | if (data_type | |
1785 | && TYPE_CODE (ada_check_typedef (data_type)) == TYPE_CODE_PTR) | |
05e522ef | 1786 | return ada_check_typedef (TYPE_TARGET_TYPE (data_type)); |
556bdfd4 UW |
1787 | } |
1788 | ||
1789 | return NULL; | |
14f9c5c9 AS |
1790 | } |
1791 | ||
1792 | /* If ARR is an array descriptor (fat or thin pointer), a pointer to | |
1793 | its array data. */ | |
4c4b4cd2 | 1794 | |
d2e4a39e AS |
1795 | static struct value * |
1796 | desc_data (struct value *arr) | |
14f9c5c9 | 1797 | { |
df407dfe | 1798 | struct type *type = value_type (arr); |
5b4ee69b | 1799 | |
14f9c5c9 AS |
1800 | if (is_thin_pntr (type)) |
1801 | return thin_data_pntr (arr); | |
1802 | else if (is_thick_pntr (type)) | |
d2e4a39e | 1803 | return value_struct_elt (&arr, NULL, "P_ARRAY", NULL, |
323e0a4a | 1804 | _("Bad GNAT array descriptor")); |
14f9c5c9 AS |
1805 | else |
1806 | return NULL; | |
1807 | } | |
1808 | ||
1809 | ||
1810 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1811 | position of the field containing the address of the data. */ |
1812 | ||
14f9c5c9 | 1813 | static int |
d2e4a39e | 1814 | fat_pntr_data_bitpos (struct type *type) |
14f9c5c9 AS |
1815 | { |
1816 | return TYPE_FIELD_BITPOS (desc_base_type (type), 0); | |
1817 | } | |
1818 | ||
1819 | /* If TYPE is the type of an array-descriptor (fat pointer), the bit | |
4c4b4cd2 PH |
1820 | size of the field containing the address of the data. */ |
1821 | ||
14f9c5c9 | 1822 | static int |
d2e4a39e | 1823 | fat_pntr_data_bitsize (struct type *type) |
14f9c5c9 AS |
1824 | { |
1825 | type = desc_base_type (type); | |
1826 | ||
1827 | if (TYPE_FIELD_BITSIZE (type, 0) > 0) | |
1828 | return TYPE_FIELD_BITSIZE (type, 0); | |
d2e4a39e | 1829 | else |
14f9c5c9 AS |
1830 | return TARGET_CHAR_BIT * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 0)); |
1831 | } | |
1832 | ||
4c4b4cd2 | 1833 | /* If BOUNDS is an array-bounds structure (or pointer to one), return |
14f9c5c9 | 1834 | the Ith lower bound stored in it, if WHICH is 0, and the Ith upper |
4c4b4cd2 PH |
1835 | bound, if WHICH is 1. The first bound is I=1. */ |
1836 | ||
d2e4a39e AS |
1837 | static struct value * |
1838 | desc_one_bound (struct value *bounds, int i, int which) | |
14f9c5c9 | 1839 | { |
d2e4a39e | 1840 | return value_struct_elt (&bounds, NULL, bound_name[2 * i + which - 2], NULL, |
323e0a4a | 1841 | _("Bad GNAT array descriptor bounds")); |
14f9c5c9 AS |
1842 | } |
1843 | ||
1844 | /* If BOUNDS is an array-bounds structure type, return the bit position | |
1845 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1846 | bound, if WHICH is 1. The first bound is I=1. */ |
1847 | ||
14f9c5c9 | 1848 | static int |
d2e4a39e | 1849 | desc_bound_bitpos (struct type *type, int i, int which) |
14f9c5c9 | 1850 | { |
d2e4a39e | 1851 | return TYPE_FIELD_BITPOS (desc_base_type (type), 2 * i + which - 2); |
14f9c5c9 AS |
1852 | } |
1853 | ||
1854 | /* If BOUNDS is an array-bounds structure type, return the bit field size | |
1855 | of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper | |
4c4b4cd2 PH |
1856 | bound, if WHICH is 1. The first bound is I=1. */ |
1857 | ||
76a01679 | 1858 | static int |
d2e4a39e | 1859 | desc_bound_bitsize (struct type *type, int i, int which) |
14f9c5c9 AS |
1860 | { |
1861 | type = desc_base_type (type); | |
1862 | ||
d2e4a39e AS |
1863 | if (TYPE_FIELD_BITSIZE (type, 2 * i + which - 2) > 0) |
1864 | return TYPE_FIELD_BITSIZE (type, 2 * i + which - 2); | |
1865 | else | |
1866 | return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type, 2 * i + which - 2)); | |
14f9c5c9 AS |
1867 | } |
1868 | ||
1869 | /* If TYPE is the type of an array-bounds structure, the type of its | |
4c4b4cd2 PH |
1870 | Ith bound (numbering from 1). Otherwise, NULL. */ |
1871 | ||
d2e4a39e AS |
1872 | static struct type * |
1873 | desc_index_type (struct type *type, int i) | |
14f9c5c9 AS |
1874 | { |
1875 | type = desc_base_type (type); | |
1876 | ||
1877 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) | |
d2e4a39e AS |
1878 | return lookup_struct_elt_type (type, bound_name[2 * i - 2], 1); |
1879 | else | |
14f9c5c9 AS |
1880 | return NULL; |
1881 | } | |
1882 | ||
4c4b4cd2 PH |
1883 | /* The number of index positions in the array-bounds type TYPE. |
1884 | Return 0 if TYPE is NULL. */ | |
1885 | ||
14f9c5c9 | 1886 | static int |
d2e4a39e | 1887 | desc_arity (struct type *type) |
14f9c5c9 AS |
1888 | { |
1889 | type = desc_base_type (type); | |
1890 | ||
1891 | if (type != NULL) | |
1892 | return TYPE_NFIELDS (type) / 2; | |
1893 | return 0; | |
1894 | } | |
1895 | ||
4c4b4cd2 PH |
1896 | /* Non-zero iff TYPE is a simple array type (not a pointer to one) or |
1897 | an array descriptor type (representing an unconstrained array | |
1898 | type). */ | |
1899 | ||
76a01679 JB |
1900 | static int |
1901 | ada_is_direct_array_type (struct type *type) | |
4c4b4cd2 PH |
1902 | { |
1903 | if (type == NULL) | |
1904 | return 0; | |
61ee279c | 1905 | type = ada_check_typedef (type); |
4c4b4cd2 | 1906 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
76a01679 | 1907 | || ada_is_array_descriptor_type (type)); |
4c4b4cd2 PH |
1908 | } |
1909 | ||
52ce6436 | 1910 | /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer |
0963b4bd | 1911 | * to one. */ |
52ce6436 | 1912 | |
2c0b251b | 1913 | static int |
52ce6436 PH |
1914 | ada_is_array_type (struct type *type) |
1915 | { | |
1916 | while (type != NULL | |
1917 | && (TYPE_CODE (type) == TYPE_CODE_PTR | |
1918 | || TYPE_CODE (type) == TYPE_CODE_REF)) | |
1919 | type = TYPE_TARGET_TYPE (type); | |
1920 | return ada_is_direct_array_type (type); | |
1921 | } | |
1922 | ||
4c4b4cd2 | 1923 | /* Non-zero iff TYPE is a simple array type or pointer to one. */ |
14f9c5c9 | 1924 | |
14f9c5c9 | 1925 | int |
4c4b4cd2 | 1926 | ada_is_simple_array_type (struct type *type) |
14f9c5c9 AS |
1927 | { |
1928 | if (type == NULL) | |
1929 | return 0; | |
61ee279c | 1930 | type = ada_check_typedef (type); |
14f9c5c9 | 1931 | return (TYPE_CODE (type) == TYPE_CODE_ARRAY |
4c4b4cd2 | 1932 | || (TYPE_CODE (type) == TYPE_CODE_PTR |
b0dd7688 JB |
1933 | && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type))) |
1934 | == TYPE_CODE_ARRAY)); | |
14f9c5c9 AS |
1935 | } |
1936 | ||
4c4b4cd2 PH |
1937 | /* Non-zero iff TYPE belongs to a GNAT array descriptor. */ |
1938 | ||
14f9c5c9 | 1939 | int |
4c4b4cd2 | 1940 | ada_is_array_descriptor_type (struct type *type) |
14f9c5c9 | 1941 | { |
556bdfd4 | 1942 | struct type *data_type = desc_data_target_type (type); |
14f9c5c9 AS |
1943 | |
1944 | if (type == NULL) | |
1945 | return 0; | |
61ee279c | 1946 | type = ada_check_typedef (type); |
556bdfd4 UW |
1947 | return (data_type != NULL |
1948 | && TYPE_CODE (data_type) == TYPE_CODE_ARRAY | |
1949 | && desc_arity (desc_bounds_type (type)) > 0); | |
14f9c5c9 AS |
1950 | } |
1951 | ||
1952 | /* Non-zero iff type is a partially mal-formed GNAT array | |
4c4b4cd2 | 1953 | descriptor. FIXME: This is to compensate for some problems with |
14f9c5c9 | 1954 | debugging output from GNAT. Re-examine periodically to see if it |
4c4b4cd2 PH |
1955 | is still needed. */ |
1956 | ||
14f9c5c9 | 1957 | int |
ebf56fd3 | 1958 | ada_is_bogus_array_descriptor (struct type *type) |
14f9c5c9 | 1959 | { |
d2e4a39e | 1960 | return |
14f9c5c9 AS |
1961 | type != NULL |
1962 | && TYPE_CODE (type) == TYPE_CODE_STRUCT | |
1963 | && (lookup_struct_elt_type (type, "P_BOUNDS", 1) != NULL | |
4c4b4cd2 PH |
1964 | || lookup_struct_elt_type (type, "P_ARRAY", 1) != NULL) |
1965 | && !ada_is_array_descriptor_type (type); | |
14f9c5c9 AS |
1966 | } |
1967 | ||
1968 | ||
4c4b4cd2 | 1969 | /* If ARR has a record type in the form of a standard GNAT array descriptor, |
14f9c5c9 | 1970 | (fat pointer) returns the type of the array data described---specifically, |
4c4b4cd2 | 1971 | a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled |
14f9c5c9 | 1972 | in from the descriptor; otherwise, they are left unspecified. If |
4c4b4cd2 PH |
1973 | the ARR denotes a null array descriptor and BOUNDS is non-zero, |
1974 | returns NULL. The result is simply the type of ARR if ARR is not | |
14f9c5c9 | 1975 | a descriptor. */ |
d2e4a39e AS |
1976 | struct type * |
1977 | ada_type_of_array (struct value *arr, int bounds) | |
14f9c5c9 | 1978 | { |
ad82864c JB |
1979 | if (ada_is_constrained_packed_array_type (value_type (arr))) |
1980 | return decode_constrained_packed_array_type (value_type (arr)); | |
14f9c5c9 | 1981 | |
df407dfe AC |
1982 | if (!ada_is_array_descriptor_type (value_type (arr))) |
1983 | return value_type (arr); | |
d2e4a39e AS |
1984 | |
1985 | if (!bounds) | |
ad82864c JB |
1986 | { |
1987 | struct type *array_type = | |
1988 | ada_check_typedef (desc_data_target_type (value_type (arr))); | |
1989 | ||
1990 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
1991 | TYPE_FIELD_BITSIZE (array_type, 0) = | |
1992 | decode_packed_array_bitsize (value_type (arr)); | |
1993 | ||
1994 | return array_type; | |
1995 | } | |
14f9c5c9 AS |
1996 | else |
1997 | { | |
d2e4a39e | 1998 | struct type *elt_type; |
14f9c5c9 | 1999 | int arity; |
d2e4a39e | 2000 | struct value *descriptor; |
14f9c5c9 | 2001 | |
df407dfe AC |
2002 | elt_type = ada_array_element_type (value_type (arr), -1); |
2003 | arity = ada_array_arity (value_type (arr)); | |
14f9c5c9 | 2004 | |
d2e4a39e | 2005 | if (elt_type == NULL || arity == 0) |
df407dfe | 2006 | return ada_check_typedef (value_type (arr)); |
14f9c5c9 AS |
2007 | |
2008 | descriptor = desc_bounds (arr); | |
d2e4a39e | 2009 | if (value_as_long (descriptor) == 0) |
4c4b4cd2 | 2010 | return NULL; |
d2e4a39e | 2011 | while (arity > 0) |
4c4b4cd2 | 2012 | { |
e9bb382b UW |
2013 | struct type *range_type = alloc_type_copy (value_type (arr)); |
2014 | struct type *array_type = alloc_type_copy (value_type (arr)); | |
4c4b4cd2 PH |
2015 | struct value *low = desc_one_bound (descriptor, arity, 0); |
2016 | struct value *high = desc_one_bound (descriptor, arity, 1); | |
4c4b4cd2 | 2017 | |
5b4ee69b | 2018 | arity -= 1; |
0c9c3474 SA |
2019 | create_static_range_type (range_type, value_type (low), |
2020 | longest_to_int (value_as_long (low)), | |
2021 | longest_to_int (value_as_long (high))); | |
4c4b4cd2 | 2022 | elt_type = create_array_type (array_type, elt_type, range_type); |
ad82864c JB |
2023 | |
2024 | if (ada_is_unconstrained_packed_array_type (value_type (arr))) | |
e67ad678 JB |
2025 | { |
2026 | /* We need to store the element packed bitsize, as well as | |
2027 | recompute the array size, because it was previously | |
2028 | computed based on the unpacked element size. */ | |
2029 | LONGEST lo = value_as_long (low); | |
2030 | LONGEST hi = value_as_long (high); | |
2031 | ||
2032 | TYPE_FIELD_BITSIZE (elt_type, 0) = | |
2033 | decode_packed_array_bitsize (value_type (arr)); | |
2034 | /* If the array has no element, then the size is already | |
2035 | zero, and does not need to be recomputed. */ | |
2036 | if (lo < hi) | |
2037 | { | |
2038 | int array_bitsize = | |
2039 | (hi - lo + 1) * TYPE_FIELD_BITSIZE (elt_type, 0); | |
2040 | ||
2041 | TYPE_LENGTH (array_type) = (array_bitsize + 7) / 8; | |
2042 | } | |
2043 | } | |
4c4b4cd2 | 2044 | } |
14f9c5c9 AS |
2045 | |
2046 | return lookup_pointer_type (elt_type); | |
2047 | } | |
2048 | } | |
2049 | ||
2050 | /* If ARR does not represent an array, returns ARR unchanged. | |
4c4b4cd2 PH |
2051 | Otherwise, returns either a standard GDB array with bounds set |
2052 | appropriately or, if ARR is a non-null fat pointer, a pointer to a standard | |
2053 | GDB array. Returns NULL if ARR is a null fat pointer. */ | |
2054 | ||
d2e4a39e AS |
2055 | struct value * |
2056 | ada_coerce_to_simple_array_ptr (struct value *arr) | |
14f9c5c9 | 2057 | { |
df407dfe | 2058 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2059 | { |
d2e4a39e | 2060 | struct type *arrType = ada_type_of_array (arr, 1); |
5b4ee69b | 2061 | |
14f9c5c9 | 2062 | if (arrType == NULL) |
4c4b4cd2 | 2063 | return NULL; |
14f9c5c9 AS |
2064 | return value_cast (arrType, value_copy (desc_data (arr))); |
2065 | } | |
ad82864c JB |
2066 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2067 | return decode_constrained_packed_array (arr); | |
14f9c5c9 AS |
2068 | else |
2069 | return arr; | |
2070 | } | |
2071 | ||
2072 | /* If ARR does not represent an array, returns ARR unchanged. | |
2073 | Otherwise, returns a standard GDB array describing ARR (which may | |
4c4b4cd2 PH |
2074 | be ARR itself if it already is in the proper form). */ |
2075 | ||
720d1a40 | 2076 | struct value * |
d2e4a39e | 2077 | ada_coerce_to_simple_array (struct value *arr) |
14f9c5c9 | 2078 | { |
df407dfe | 2079 | if (ada_is_array_descriptor_type (value_type (arr))) |
14f9c5c9 | 2080 | { |
d2e4a39e | 2081 | struct value *arrVal = ada_coerce_to_simple_array_ptr (arr); |
5b4ee69b | 2082 | |
14f9c5c9 | 2083 | if (arrVal == NULL) |
323e0a4a | 2084 | error (_("Bounds unavailable for null array pointer.")); |
c1b5a1a6 | 2085 | ada_ensure_varsize_limit (TYPE_TARGET_TYPE (value_type (arrVal))); |
14f9c5c9 AS |
2086 | return value_ind (arrVal); |
2087 | } | |
ad82864c JB |
2088 | else if (ada_is_constrained_packed_array_type (value_type (arr))) |
2089 | return decode_constrained_packed_array (arr); | |
d2e4a39e | 2090 | else |
14f9c5c9 AS |
2091 | return arr; |
2092 | } | |
2093 | ||
2094 | /* If TYPE represents a GNAT array type, return it translated to an | |
2095 | ordinary GDB array type (possibly with BITSIZE fields indicating | |
4c4b4cd2 PH |
2096 | packing). For other types, is the identity. */ |
2097 | ||
d2e4a39e AS |
2098 | struct type * |
2099 | ada_coerce_to_simple_array_type (struct type *type) | |
14f9c5c9 | 2100 | { |
ad82864c JB |
2101 | if (ada_is_constrained_packed_array_type (type)) |
2102 | return decode_constrained_packed_array_type (type); | |
17280b9f UW |
2103 | |
2104 | if (ada_is_array_descriptor_type (type)) | |
556bdfd4 | 2105 | return ada_check_typedef (desc_data_target_type (type)); |
17280b9f UW |
2106 | |
2107 | return type; | |
14f9c5c9 AS |
2108 | } |
2109 | ||
4c4b4cd2 PH |
2110 | /* Non-zero iff TYPE represents a standard GNAT packed-array type. */ |
2111 | ||
ad82864c JB |
2112 | static int |
2113 | ada_is_packed_array_type (struct type *type) | |
14f9c5c9 AS |
2114 | { |
2115 | if (type == NULL) | |
2116 | return 0; | |
4c4b4cd2 | 2117 | type = desc_base_type (type); |
61ee279c | 2118 | type = ada_check_typedef (type); |
d2e4a39e | 2119 | return |
14f9c5c9 AS |
2120 | ada_type_name (type) != NULL |
2121 | && strstr (ada_type_name (type), "___XP") != NULL; | |
2122 | } | |
2123 | ||
ad82864c JB |
2124 | /* Non-zero iff TYPE represents a standard GNAT constrained |
2125 | packed-array type. */ | |
2126 | ||
2127 | int | |
2128 | ada_is_constrained_packed_array_type (struct type *type) | |
2129 | { | |
2130 | return ada_is_packed_array_type (type) | |
2131 | && !ada_is_array_descriptor_type (type); | |
2132 | } | |
2133 | ||
2134 | /* Non-zero iff TYPE represents an array descriptor for a | |
2135 | unconstrained packed-array type. */ | |
2136 | ||
2137 | static int | |
2138 | ada_is_unconstrained_packed_array_type (struct type *type) | |
2139 | { | |
2140 | return ada_is_packed_array_type (type) | |
2141 | && ada_is_array_descriptor_type (type); | |
2142 | } | |
2143 | ||
2144 | /* Given that TYPE encodes a packed array type (constrained or unconstrained), | |
2145 | return the size of its elements in bits. */ | |
2146 | ||
2147 | static long | |
2148 | decode_packed_array_bitsize (struct type *type) | |
2149 | { | |
0d5cff50 DE |
2150 | const char *raw_name; |
2151 | const char *tail; | |
ad82864c JB |
2152 | long bits; |
2153 | ||
720d1a40 JB |
2154 | /* Access to arrays implemented as fat pointers are encoded as a typedef |
2155 | of the fat pointer type. We need the name of the fat pointer type | |
2156 | to do the decoding, so strip the typedef layer. */ | |
2157 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) | |
2158 | type = ada_typedef_target_type (type); | |
2159 | ||
2160 | raw_name = ada_type_name (ada_check_typedef (type)); | |
ad82864c JB |
2161 | if (!raw_name) |
2162 | raw_name = ada_type_name (desc_base_type (type)); | |
2163 | ||
2164 | if (!raw_name) | |
2165 | return 0; | |
2166 | ||
2167 | tail = strstr (raw_name, "___XP"); | |
720d1a40 | 2168 | gdb_assert (tail != NULL); |
ad82864c JB |
2169 | |
2170 | if (sscanf (tail + sizeof ("___XP") - 1, "%ld", &bits) != 1) | |
2171 | { | |
2172 | lim_warning | |
2173 | (_("could not understand bit size information on packed array")); | |
2174 | return 0; | |
2175 | } | |
2176 | ||
2177 | return bits; | |
2178 | } | |
2179 | ||
14f9c5c9 AS |
2180 | /* Given that TYPE is a standard GDB array type with all bounds filled |
2181 | in, and that the element size of its ultimate scalar constituents | |
2182 | (that is, either its elements, or, if it is an array of arrays, its | |
2183 | elements' elements, etc.) is *ELT_BITS, return an identical type, | |
2184 | but with the bit sizes of its elements (and those of any | |
2185 | constituent arrays) recorded in the BITSIZE components of its | |
4c4b4cd2 | 2186 | TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size |
4a46959e JB |
2187 | in bits. |
2188 | ||
2189 | Note that, for arrays whose index type has an XA encoding where | |
2190 | a bound references a record discriminant, getting that discriminant, | |
2191 | and therefore the actual value of that bound, is not possible | |
2192 | because none of the given parameters gives us access to the record. | |
2193 | This function assumes that it is OK in the context where it is being | |
2194 | used to return an array whose bounds are still dynamic and where | |
2195 | the length is arbitrary. */ | |
4c4b4cd2 | 2196 | |
d2e4a39e | 2197 | static struct type * |
ad82864c | 2198 | constrained_packed_array_type (struct type *type, long *elt_bits) |
14f9c5c9 | 2199 | { |
d2e4a39e AS |
2200 | struct type *new_elt_type; |
2201 | struct type *new_type; | |
99b1c762 JB |
2202 | struct type *index_type_desc; |
2203 | struct type *index_type; | |
14f9c5c9 AS |
2204 | LONGEST low_bound, high_bound; |
2205 | ||
61ee279c | 2206 | type = ada_check_typedef (type); |
14f9c5c9 AS |
2207 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) |
2208 | return type; | |
2209 | ||
99b1c762 JB |
2210 | index_type_desc = ada_find_parallel_type (type, "___XA"); |
2211 | if (index_type_desc) | |
2212 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, 0), | |
2213 | NULL); | |
2214 | else | |
2215 | index_type = TYPE_INDEX_TYPE (type); | |
2216 | ||
e9bb382b | 2217 | new_type = alloc_type_copy (type); |
ad82864c JB |
2218 | new_elt_type = |
2219 | constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type)), | |
2220 | elt_bits); | |
99b1c762 | 2221 | create_array_type (new_type, new_elt_type, index_type); |
14f9c5c9 AS |
2222 | TYPE_FIELD_BITSIZE (new_type, 0) = *elt_bits; |
2223 | TYPE_NAME (new_type) = ada_type_name (type); | |
2224 | ||
4a46959e JB |
2225 | if ((TYPE_CODE (check_typedef (index_type)) == TYPE_CODE_RANGE |
2226 | && is_dynamic_type (check_typedef (index_type))) | |
2227 | || get_discrete_bounds (index_type, &low_bound, &high_bound) < 0) | |
14f9c5c9 AS |
2228 | low_bound = high_bound = 0; |
2229 | if (high_bound < low_bound) | |
2230 | *elt_bits = TYPE_LENGTH (new_type) = 0; | |
d2e4a39e | 2231 | else |
14f9c5c9 AS |
2232 | { |
2233 | *elt_bits *= (high_bound - low_bound + 1); | |
d2e4a39e | 2234 | TYPE_LENGTH (new_type) = |
4c4b4cd2 | 2235 | (*elt_bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
14f9c5c9 AS |
2236 | } |
2237 | ||
876cecd0 | 2238 | TYPE_FIXED_INSTANCE (new_type) = 1; |
14f9c5c9 AS |
2239 | return new_type; |
2240 | } | |
2241 | ||
ad82864c JB |
2242 | /* The array type encoded by TYPE, where |
2243 | ada_is_constrained_packed_array_type (TYPE). */ | |
4c4b4cd2 | 2244 | |
d2e4a39e | 2245 | static struct type * |
ad82864c | 2246 | decode_constrained_packed_array_type (struct type *type) |
d2e4a39e | 2247 | { |
0d5cff50 | 2248 | const char *raw_name = ada_type_name (ada_check_typedef (type)); |
727e3d2e | 2249 | char *name; |
0d5cff50 | 2250 | const char *tail; |
d2e4a39e | 2251 | struct type *shadow_type; |
14f9c5c9 | 2252 | long bits; |
14f9c5c9 | 2253 | |
727e3d2e JB |
2254 | if (!raw_name) |
2255 | raw_name = ada_type_name (desc_base_type (type)); | |
2256 | ||
2257 | if (!raw_name) | |
2258 | return NULL; | |
2259 | ||
2260 | name = (char *) alloca (strlen (raw_name) + 1); | |
2261 | tail = strstr (raw_name, "___XP"); | |
4c4b4cd2 PH |
2262 | type = desc_base_type (type); |
2263 | ||
14f9c5c9 AS |
2264 | memcpy (name, raw_name, tail - raw_name); |
2265 | name[tail - raw_name] = '\000'; | |
2266 | ||
b4ba55a1 JB |
2267 | shadow_type = ada_find_parallel_type_with_name (type, name); |
2268 | ||
2269 | if (shadow_type == NULL) | |
14f9c5c9 | 2270 | { |
323e0a4a | 2271 | lim_warning (_("could not find bounds information on packed array")); |
14f9c5c9 AS |
2272 | return NULL; |
2273 | } | |
f168693b | 2274 | shadow_type = check_typedef (shadow_type); |
14f9c5c9 AS |
2275 | |
2276 | if (TYPE_CODE (shadow_type) != TYPE_CODE_ARRAY) | |
2277 | { | |
0963b4bd MS |
2278 | lim_warning (_("could not understand bounds " |
2279 | "information on packed array")); | |
14f9c5c9 AS |
2280 | return NULL; |
2281 | } | |
d2e4a39e | 2282 | |
ad82864c JB |
2283 | bits = decode_packed_array_bitsize (type); |
2284 | return constrained_packed_array_type (shadow_type, &bits); | |
14f9c5c9 AS |
2285 | } |
2286 | ||
ad82864c JB |
2287 | /* Given that ARR is a struct value *indicating a GNAT constrained packed |
2288 | array, returns a simple array that denotes that array. Its type is a | |
14f9c5c9 AS |
2289 | standard GDB array type except that the BITSIZEs of the array |
2290 | target types are set to the number of bits in each element, and the | |
4c4b4cd2 | 2291 | type length is set appropriately. */ |
14f9c5c9 | 2292 | |
d2e4a39e | 2293 | static struct value * |
ad82864c | 2294 | decode_constrained_packed_array (struct value *arr) |
14f9c5c9 | 2295 | { |
4c4b4cd2 | 2296 | struct type *type; |
14f9c5c9 | 2297 | |
11aa919a PMR |
2298 | /* If our value is a pointer, then dereference it. Likewise if |
2299 | the value is a reference. Make sure that this operation does not | |
2300 | cause the target type to be fixed, as this would indirectly cause | |
2301 | this array to be decoded. The rest of the routine assumes that | |
2302 | the array hasn't been decoded yet, so we use the basic "coerce_ref" | |
2303 | and "value_ind" routines to perform the dereferencing, as opposed | |
2304 | to using "ada_coerce_ref" or "ada_value_ind". */ | |
2305 | arr = coerce_ref (arr); | |
828292f2 | 2306 | if (TYPE_CODE (ada_check_typedef (value_type (arr))) == TYPE_CODE_PTR) |
284614f0 | 2307 | arr = value_ind (arr); |
4c4b4cd2 | 2308 | |
ad82864c | 2309 | type = decode_constrained_packed_array_type (value_type (arr)); |
14f9c5c9 AS |
2310 | if (type == NULL) |
2311 | { | |
323e0a4a | 2312 | error (_("can't unpack array")); |
14f9c5c9 AS |
2313 | return NULL; |
2314 | } | |
61ee279c | 2315 | |
50810684 | 2316 | if (gdbarch_bits_big_endian (get_type_arch (value_type (arr))) |
32c9a795 | 2317 | && ada_is_modular_type (value_type (arr))) |
61ee279c PH |
2318 | { |
2319 | /* This is a (right-justified) modular type representing a packed | |
2320 | array with no wrapper. In order to interpret the value through | |
2321 | the (left-justified) packed array type we just built, we must | |
2322 | first left-justify it. */ | |
2323 | int bit_size, bit_pos; | |
2324 | ULONGEST mod; | |
2325 | ||
df407dfe | 2326 | mod = ada_modulus (value_type (arr)) - 1; |
61ee279c PH |
2327 | bit_size = 0; |
2328 | while (mod > 0) | |
2329 | { | |
2330 | bit_size += 1; | |
2331 | mod >>= 1; | |
2332 | } | |
df407dfe | 2333 | bit_pos = HOST_CHAR_BIT * TYPE_LENGTH (value_type (arr)) - bit_size; |
61ee279c PH |
2334 | arr = ada_value_primitive_packed_val (arr, NULL, |
2335 | bit_pos / HOST_CHAR_BIT, | |
2336 | bit_pos % HOST_CHAR_BIT, | |
2337 | bit_size, | |
2338 | type); | |
2339 | } | |
2340 | ||
4c4b4cd2 | 2341 | return coerce_unspec_val_to_type (arr, type); |
14f9c5c9 AS |
2342 | } |
2343 | ||
2344 | ||
2345 | /* The value of the element of packed array ARR at the ARITY indices | |
4c4b4cd2 | 2346 | given in IND. ARR must be a simple array. */ |
14f9c5c9 | 2347 | |
d2e4a39e AS |
2348 | static struct value * |
2349 | value_subscript_packed (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2350 | { |
2351 | int i; | |
2352 | int bits, elt_off, bit_off; | |
2353 | long elt_total_bit_offset; | |
d2e4a39e AS |
2354 | struct type *elt_type; |
2355 | struct value *v; | |
14f9c5c9 AS |
2356 | |
2357 | bits = 0; | |
2358 | elt_total_bit_offset = 0; | |
df407dfe | 2359 | elt_type = ada_check_typedef (value_type (arr)); |
d2e4a39e | 2360 | for (i = 0; i < arity; i += 1) |
14f9c5c9 | 2361 | { |
d2e4a39e | 2362 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY |
4c4b4cd2 PH |
2363 | || TYPE_FIELD_BITSIZE (elt_type, 0) == 0) |
2364 | error | |
0963b4bd MS |
2365 | (_("attempt to do packed indexing of " |
2366 | "something other than a packed array")); | |
14f9c5c9 | 2367 | else |
4c4b4cd2 PH |
2368 | { |
2369 | struct type *range_type = TYPE_INDEX_TYPE (elt_type); | |
2370 | LONGEST lowerbound, upperbound; | |
2371 | LONGEST idx; | |
2372 | ||
2373 | if (get_discrete_bounds (range_type, &lowerbound, &upperbound) < 0) | |
2374 | { | |
323e0a4a | 2375 | lim_warning (_("don't know bounds of array")); |
4c4b4cd2 PH |
2376 | lowerbound = upperbound = 0; |
2377 | } | |
2378 | ||
3cb382c9 | 2379 | idx = pos_atr (ind[i]); |
4c4b4cd2 | 2380 | if (idx < lowerbound || idx > upperbound) |
0963b4bd MS |
2381 | lim_warning (_("packed array index %ld out of bounds"), |
2382 | (long) idx); | |
4c4b4cd2 PH |
2383 | bits = TYPE_FIELD_BITSIZE (elt_type, 0); |
2384 | elt_total_bit_offset += (idx - lowerbound) * bits; | |
61ee279c | 2385 | elt_type = ada_check_typedef (TYPE_TARGET_TYPE (elt_type)); |
4c4b4cd2 | 2386 | } |
14f9c5c9 AS |
2387 | } |
2388 | elt_off = elt_total_bit_offset / HOST_CHAR_BIT; | |
2389 | bit_off = elt_total_bit_offset % HOST_CHAR_BIT; | |
d2e4a39e AS |
2390 | |
2391 | v = ada_value_primitive_packed_val (arr, NULL, elt_off, bit_off, | |
4c4b4cd2 | 2392 | bits, elt_type); |
14f9c5c9 AS |
2393 | return v; |
2394 | } | |
2395 | ||
4c4b4cd2 | 2396 | /* Non-zero iff TYPE includes negative integer values. */ |
14f9c5c9 AS |
2397 | |
2398 | static int | |
d2e4a39e | 2399 | has_negatives (struct type *type) |
14f9c5c9 | 2400 | { |
d2e4a39e AS |
2401 | switch (TYPE_CODE (type)) |
2402 | { | |
2403 | default: | |
2404 | return 0; | |
2405 | case TYPE_CODE_INT: | |
2406 | return !TYPE_UNSIGNED (type); | |
2407 | case TYPE_CODE_RANGE: | |
2408 | return TYPE_LOW_BOUND (type) < 0; | |
2409 | } | |
14f9c5c9 | 2410 | } |
d2e4a39e | 2411 | |
f93fca70 | 2412 | /* With SRC being a buffer containing BIT_SIZE bits of data at BIT_OFFSET, |
5b639dea | 2413 | unpack that data into UNPACKED. UNPACKED_LEN is the size in bytes of |
f93fca70 | 2414 | the unpacked buffer. |
14f9c5c9 | 2415 | |
5b639dea JB |
2416 | The size of the unpacked buffer (UNPACKED_LEN) is expected to be large |
2417 | enough to contain at least BIT_OFFSET bits. If not, an error is raised. | |
2418 | ||
f93fca70 JB |
2419 | IS_BIG_ENDIAN is nonzero if the data is stored in big endian mode, |
2420 | zero otherwise. | |
14f9c5c9 | 2421 | |
f93fca70 | 2422 | IS_SIGNED_TYPE is nonzero if the data corresponds to a signed type. |
a1c95e6b | 2423 | |
f93fca70 JB |
2424 | IS_SCALAR is nonzero if the data corresponds to a signed type. */ |
2425 | ||
2426 | static void | |
2427 | ada_unpack_from_contents (const gdb_byte *src, int bit_offset, int bit_size, | |
2428 | gdb_byte *unpacked, int unpacked_len, | |
2429 | int is_big_endian, int is_signed_type, | |
2430 | int is_scalar) | |
2431 | { | |
a1c95e6b JB |
2432 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
2433 | int src_idx; /* Index into the source area */ | |
2434 | int src_bytes_left; /* Number of source bytes left to process. */ | |
2435 | int srcBitsLeft; /* Number of source bits left to move */ | |
2436 | int unusedLS; /* Number of bits in next significant | |
2437 | byte of source that are unused */ | |
2438 | ||
a1c95e6b JB |
2439 | int unpacked_idx; /* Index into the unpacked buffer */ |
2440 | int unpacked_bytes_left; /* Number of bytes left to set in unpacked. */ | |
2441 | ||
4c4b4cd2 | 2442 | unsigned long accum; /* Staging area for bits being transferred */ |
a1c95e6b | 2443 | int accumSize; /* Number of meaningful bits in accum */ |
14f9c5c9 | 2444 | unsigned char sign; |
a1c95e6b | 2445 | |
4c4b4cd2 PH |
2446 | /* Transmit bytes from least to most significant; delta is the direction |
2447 | the indices move. */ | |
f93fca70 | 2448 | int delta = is_big_endian ? -1 : 1; |
14f9c5c9 | 2449 | |
5b639dea JB |
2450 | /* Make sure that unpacked is large enough to receive the BIT_SIZE |
2451 | bits from SRC. .*/ | |
2452 | if ((bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT > unpacked_len) | |
2453 | error (_("Cannot unpack %d bits into buffer of %d bytes"), | |
2454 | bit_size, unpacked_len); | |
2455 | ||
14f9c5c9 | 2456 | srcBitsLeft = bit_size; |
086ca51f | 2457 | src_bytes_left = src_len; |
f93fca70 | 2458 | unpacked_bytes_left = unpacked_len; |
14f9c5c9 | 2459 | sign = 0; |
f93fca70 JB |
2460 | |
2461 | if (is_big_endian) | |
14f9c5c9 | 2462 | { |
086ca51f | 2463 | src_idx = src_len - 1; |
f93fca70 JB |
2464 | if (is_signed_type |
2465 | && ((src[0] << bit_offset) & (1 << (HOST_CHAR_BIT - 1)))) | |
4c4b4cd2 | 2466 | sign = ~0; |
d2e4a39e AS |
2467 | |
2468 | unusedLS = | |
4c4b4cd2 PH |
2469 | (HOST_CHAR_BIT - (bit_size + bit_offset) % HOST_CHAR_BIT) |
2470 | % HOST_CHAR_BIT; | |
14f9c5c9 | 2471 | |
f93fca70 JB |
2472 | if (is_scalar) |
2473 | { | |
2474 | accumSize = 0; | |
2475 | unpacked_idx = unpacked_len - 1; | |
2476 | } | |
2477 | else | |
2478 | { | |
4c4b4cd2 PH |
2479 | /* Non-scalar values must be aligned at a byte boundary... */ |
2480 | accumSize = | |
2481 | (HOST_CHAR_BIT - bit_size % HOST_CHAR_BIT) % HOST_CHAR_BIT; | |
2482 | /* ... And are placed at the beginning (most-significant) bytes | |
2483 | of the target. */ | |
086ca51f JB |
2484 | unpacked_idx = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT - 1; |
2485 | unpacked_bytes_left = unpacked_idx + 1; | |
f93fca70 | 2486 | } |
14f9c5c9 | 2487 | } |
d2e4a39e | 2488 | else |
14f9c5c9 AS |
2489 | { |
2490 | int sign_bit_offset = (bit_size + bit_offset - 1) % 8; | |
2491 | ||
086ca51f | 2492 | src_idx = unpacked_idx = 0; |
14f9c5c9 AS |
2493 | unusedLS = bit_offset; |
2494 | accumSize = 0; | |
2495 | ||
f93fca70 | 2496 | if (is_signed_type && (src[src_len - 1] & (1 << sign_bit_offset))) |
4c4b4cd2 | 2497 | sign = ~0; |
14f9c5c9 | 2498 | } |
d2e4a39e | 2499 | |
14f9c5c9 | 2500 | accum = 0; |
086ca51f | 2501 | while (src_bytes_left > 0) |
14f9c5c9 AS |
2502 | { |
2503 | /* Mask for removing bits of the next source byte that are not | |
4c4b4cd2 | 2504 | part of the value. */ |
d2e4a39e | 2505 | unsigned int unusedMSMask = |
4c4b4cd2 PH |
2506 | (1 << (srcBitsLeft >= HOST_CHAR_BIT ? HOST_CHAR_BIT : srcBitsLeft)) - |
2507 | 1; | |
2508 | /* Sign-extend bits for this byte. */ | |
14f9c5c9 | 2509 | unsigned int signMask = sign & ~unusedMSMask; |
5b4ee69b | 2510 | |
d2e4a39e | 2511 | accum |= |
086ca51f | 2512 | (((src[src_idx] >> unusedLS) & unusedMSMask) | signMask) << accumSize; |
14f9c5c9 | 2513 | accumSize += HOST_CHAR_BIT - unusedLS; |
d2e4a39e | 2514 | if (accumSize >= HOST_CHAR_BIT) |
4c4b4cd2 | 2515 | { |
db297a65 | 2516 | unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT); |
4c4b4cd2 PH |
2517 | accumSize -= HOST_CHAR_BIT; |
2518 | accum >>= HOST_CHAR_BIT; | |
086ca51f JB |
2519 | unpacked_bytes_left -= 1; |
2520 | unpacked_idx += delta; | |
4c4b4cd2 | 2521 | } |
14f9c5c9 AS |
2522 | srcBitsLeft -= HOST_CHAR_BIT - unusedLS; |
2523 | unusedLS = 0; | |
086ca51f JB |
2524 | src_bytes_left -= 1; |
2525 | src_idx += delta; | |
14f9c5c9 | 2526 | } |
086ca51f | 2527 | while (unpacked_bytes_left > 0) |
14f9c5c9 AS |
2528 | { |
2529 | accum |= sign << accumSize; | |
db297a65 | 2530 | unpacked[unpacked_idx] = accum & ~(~0UL << HOST_CHAR_BIT); |
14f9c5c9 | 2531 | accumSize -= HOST_CHAR_BIT; |
9cd4d857 JB |
2532 | if (accumSize < 0) |
2533 | accumSize = 0; | |
14f9c5c9 | 2534 | accum >>= HOST_CHAR_BIT; |
086ca51f JB |
2535 | unpacked_bytes_left -= 1; |
2536 | unpacked_idx += delta; | |
14f9c5c9 | 2537 | } |
f93fca70 JB |
2538 | } |
2539 | ||
2540 | /* Create a new value of type TYPE from the contents of OBJ starting | |
2541 | at byte OFFSET, and bit offset BIT_OFFSET within that byte, | |
2542 | proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then | |
2543 | assigning through the result will set the field fetched from. | |
2544 | VALADDR is ignored unless OBJ is NULL, in which case, | |
2545 | VALADDR+OFFSET must address the start of storage containing the | |
2546 | packed value. The value returned in this case is never an lval. | |
2547 | Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */ | |
2548 | ||
2549 | struct value * | |
2550 | ada_value_primitive_packed_val (struct value *obj, const gdb_byte *valaddr, | |
2551 | long offset, int bit_offset, int bit_size, | |
2552 | struct type *type) | |
2553 | { | |
2554 | struct value *v; | |
bfb1c796 | 2555 | const gdb_byte *src; /* First byte containing data to unpack */ |
f93fca70 | 2556 | gdb_byte *unpacked; |
220475ed | 2557 | const int is_scalar = is_scalar_type (type); |
d0a9e810 | 2558 | const int is_big_endian = gdbarch_bits_big_endian (get_type_arch (type)); |
d5722aa2 | 2559 | gdb::byte_vector staging; |
f93fca70 JB |
2560 | |
2561 | type = ada_check_typedef (type); | |
2562 | ||
d0a9e810 | 2563 | if (obj == NULL) |
bfb1c796 | 2564 | src = valaddr + offset; |
d0a9e810 | 2565 | else |
bfb1c796 | 2566 | src = value_contents (obj) + offset; |
d0a9e810 JB |
2567 | |
2568 | if (is_dynamic_type (type)) | |
2569 | { | |
2570 | /* The length of TYPE might by dynamic, so we need to resolve | |
2571 | TYPE in order to know its actual size, which we then use | |
2572 | to create the contents buffer of the value we return. | |
2573 | The difficulty is that the data containing our object is | |
2574 | packed, and therefore maybe not at a byte boundary. So, what | |
2575 | we do, is unpack the data into a byte-aligned buffer, and then | |
2576 | use that buffer as our object's value for resolving the type. */ | |
d5722aa2 PA |
2577 | int staging_len = (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; |
2578 | staging.resize (staging_len); | |
d0a9e810 JB |
2579 | |
2580 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
d5722aa2 | 2581 | staging.data (), staging.size (), |
d0a9e810 JB |
2582 | is_big_endian, has_negatives (type), |
2583 | is_scalar); | |
d5722aa2 | 2584 | type = resolve_dynamic_type (type, staging.data (), 0); |
0cafa88c JB |
2585 | if (TYPE_LENGTH (type) < (bit_size + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT) |
2586 | { | |
2587 | /* This happens when the length of the object is dynamic, | |
2588 | and is actually smaller than the space reserved for it. | |
2589 | For instance, in an array of variant records, the bit_size | |
2590 | we're given is the array stride, which is constant and | |
2591 | normally equal to the maximum size of its element. | |
2592 | But, in reality, each element only actually spans a portion | |
2593 | of that stride. */ | |
2594 | bit_size = TYPE_LENGTH (type) * HOST_CHAR_BIT; | |
2595 | } | |
d0a9e810 JB |
2596 | } |
2597 | ||
f93fca70 JB |
2598 | if (obj == NULL) |
2599 | { | |
2600 | v = allocate_value (type); | |
bfb1c796 | 2601 | src = valaddr + offset; |
f93fca70 JB |
2602 | } |
2603 | else if (VALUE_LVAL (obj) == lval_memory && value_lazy (obj)) | |
2604 | { | |
0cafa88c | 2605 | int src_len = (bit_size + bit_offset + HOST_CHAR_BIT - 1) / 8; |
bfb1c796 | 2606 | gdb_byte *buf; |
0cafa88c | 2607 | |
f93fca70 | 2608 | v = value_at (type, value_address (obj) + offset); |
bfb1c796 PA |
2609 | buf = (gdb_byte *) alloca (src_len); |
2610 | read_memory (value_address (v), buf, src_len); | |
2611 | src = buf; | |
f93fca70 JB |
2612 | } |
2613 | else | |
2614 | { | |
2615 | v = allocate_value (type); | |
bfb1c796 | 2616 | src = value_contents (obj) + offset; |
f93fca70 JB |
2617 | } |
2618 | ||
2619 | if (obj != NULL) | |
2620 | { | |
2621 | long new_offset = offset; | |
2622 | ||
2623 | set_value_component_location (v, obj); | |
2624 | set_value_bitpos (v, bit_offset + value_bitpos (obj)); | |
2625 | set_value_bitsize (v, bit_size); | |
2626 | if (value_bitpos (v) >= HOST_CHAR_BIT) | |
2627 | { | |
2628 | ++new_offset; | |
2629 | set_value_bitpos (v, value_bitpos (v) - HOST_CHAR_BIT); | |
2630 | } | |
2631 | set_value_offset (v, new_offset); | |
2632 | ||
2633 | /* Also set the parent value. This is needed when trying to | |
2634 | assign a new value (in inferior memory). */ | |
2635 | set_value_parent (v, obj); | |
2636 | } | |
2637 | else | |
2638 | set_value_bitsize (v, bit_size); | |
bfb1c796 | 2639 | unpacked = value_contents_writeable (v); |
f93fca70 JB |
2640 | |
2641 | if (bit_size == 0) | |
2642 | { | |
2643 | memset (unpacked, 0, TYPE_LENGTH (type)); | |
2644 | return v; | |
2645 | } | |
2646 | ||
d5722aa2 | 2647 | if (staging.size () == TYPE_LENGTH (type)) |
f93fca70 | 2648 | { |
d0a9e810 JB |
2649 | /* Small short-cut: If we've unpacked the data into a buffer |
2650 | of the same size as TYPE's length, then we can reuse that, | |
2651 | instead of doing the unpacking again. */ | |
d5722aa2 | 2652 | memcpy (unpacked, staging.data (), staging.size ()); |
f93fca70 | 2653 | } |
d0a9e810 JB |
2654 | else |
2655 | ada_unpack_from_contents (src, bit_offset, bit_size, | |
2656 | unpacked, TYPE_LENGTH (type), | |
2657 | is_big_endian, has_negatives (type), is_scalar); | |
f93fca70 | 2658 | |
14f9c5c9 AS |
2659 | return v; |
2660 | } | |
d2e4a39e | 2661 | |
14f9c5c9 AS |
2662 | /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to |
2663 | TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must | |
4c4b4cd2 | 2664 | not overlap. */ |
14f9c5c9 | 2665 | static void |
fc1a4b47 | 2666 | move_bits (gdb_byte *target, int targ_offset, const gdb_byte *source, |
50810684 | 2667 | int src_offset, int n, int bits_big_endian_p) |
14f9c5c9 AS |
2668 | { |
2669 | unsigned int accum, mask; | |
2670 | int accum_bits, chunk_size; | |
2671 | ||
2672 | target += targ_offset / HOST_CHAR_BIT; | |
2673 | targ_offset %= HOST_CHAR_BIT; | |
2674 | source += src_offset / HOST_CHAR_BIT; | |
2675 | src_offset %= HOST_CHAR_BIT; | |
50810684 | 2676 | if (bits_big_endian_p) |
14f9c5c9 AS |
2677 | { |
2678 | accum = (unsigned char) *source; | |
2679 | source += 1; | |
2680 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2681 | ||
d2e4a39e | 2682 | while (n > 0) |
4c4b4cd2 PH |
2683 | { |
2684 | int unused_right; | |
5b4ee69b | 2685 | |
4c4b4cd2 PH |
2686 | accum = (accum << HOST_CHAR_BIT) + (unsigned char) *source; |
2687 | accum_bits += HOST_CHAR_BIT; | |
2688 | source += 1; | |
2689 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2690 | if (chunk_size > n) | |
2691 | chunk_size = n; | |
2692 | unused_right = HOST_CHAR_BIT - (chunk_size + targ_offset); | |
2693 | mask = ((1 << chunk_size) - 1) << unused_right; | |
2694 | *target = | |
2695 | (*target & ~mask) | |
2696 | | ((accum >> (accum_bits - chunk_size - unused_right)) & mask); | |
2697 | n -= chunk_size; | |
2698 | accum_bits -= chunk_size; | |
2699 | target += 1; | |
2700 | targ_offset = 0; | |
2701 | } | |
14f9c5c9 AS |
2702 | } |
2703 | else | |
2704 | { | |
2705 | accum = (unsigned char) *source >> src_offset; | |
2706 | source += 1; | |
2707 | accum_bits = HOST_CHAR_BIT - src_offset; | |
2708 | ||
d2e4a39e | 2709 | while (n > 0) |
4c4b4cd2 PH |
2710 | { |
2711 | accum = accum + ((unsigned char) *source << accum_bits); | |
2712 | accum_bits += HOST_CHAR_BIT; | |
2713 | source += 1; | |
2714 | chunk_size = HOST_CHAR_BIT - targ_offset; | |
2715 | if (chunk_size > n) | |
2716 | chunk_size = n; | |
2717 | mask = ((1 << chunk_size) - 1) << targ_offset; | |
2718 | *target = (*target & ~mask) | ((accum << targ_offset) & mask); | |
2719 | n -= chunk_size; | |
2720 | accum_bits -= chunk_size; | |
2721 | accum >>= chunk_size; | |
2722 | target += 1; | |
2723 | targ_offset = 0; | |
2724 | } | |
14f9c5c9 AS |
2725 | } |
2726 | } | |
2727 | ||
14f9c5c9 AS |
2728 | /* Store the contents of FROMVAL into the location of TOVAL. |
2729 | Return a new value with the location of TOVAL and contents of | |
2730 | FROMVAL. Handles assignment into packed fields that have | |
4c4b4cd2 | 2731 | floating-point or non-scalar types. */ |
14f9c5c9 | 2732 | |
d2e4a39e AS |
2733 | static struct value * |
2734 | ada_value_assign (struct value *toval, struct value *fromval) | |
14f9c5c9 | 2735 | { |
df407dfe AC |
2736 | struct type *type = value_type (toval); |
2737 | int bits = value_bitsize (toval); | |
14f9c5c9 | 2738 | |
52ce6436 PH |
2739 | toval = ada_coerce_ref (toval); |
2740 | fromval = ada_coerce_ref (fromval); | |
2741 | ||
2742 | if (ada_is_direct_array_type (value_type (toval))) | |
2743 | toval = ada_coerce_to_simple_array (toval); | |
2744 | if (ada_is_direct_array_type (value_type (fromval))) | |
2745 | fromval = ada_coerce_to_simple_array (fromval); | |
2746 | ||
88e3b34b | 2747 | if (!deprecated_value_modifiable (toval)) |
323e0a4a | 2748 | error (_("Left operand of assignment is not a modifiable lvalue.")); |
14f9c5c9 | 2749 | |
d2e4a39e | 2750 | if (VALUE_LVAL (toval) == lval_memory |
14f9c5c9 | 2751 | && bits > 0 |
d2e4a39e | 2752 | && (TYPE_CODE (type) == TYPE_CODE_FLT |
4c4b4cd2 | 2753 | || TYPE_CODE (type) == TYPE_CODE_STRUCT)) |
14f9c5c9 | 2754 | { |
df407dfe AC |
2755 | int len = (value_bitpos (toval) |
2756 | + bits + HOST_CHAR_BIT - 1) / HOST_CHAR_BIT; | |
aced2898 | 2757 | int from_size; |
224c3ddb | 2758 | gdb_byte *buffer = (gdb_byte *) alloca (len); |
d2e4a39e | 2759 | struct value *val; |
42ae5230 | 2760 | CORE_ADDR to_addr = value_address (toval); |
14f9c5c9 AS |
2761 | |
2762 | if (TYPE_CODE (type) == TYPE_CODE_FLT) | |
4c4b4cd2 | 2763 | fromval = value_cast (type, fromval); |
14f9c5c9 | 2764 | |
52ce6436 | 2765 | read_memory (to_addr, buffer, len); |
aced2898 PH |
2766 | from_size = value_bitsize (fromval); |
2767 | if (from_size == 0) | |
2768 | from_size = TYPE_LENGTH (value_type (fromval)) * TARGET_CHAR_BIT; | |
50810684 | 2769 | if (gdbarch_bits_big_endian (get_type_arch (type))) |
df407dfe | 2770 | move_bits (buffer, value_bitpos (toval), |
50810684 | 2771 | value_contents (fromval), from_size - bits, bits, 1); |
14f9c5c9 | 2772 | else |
50810684 UW |
2773 | move_bits (buffer, value_bitpos (toval), |
2774 | value_contents (fromval), 0, bits, 0); | |
972daa01 | 2775 | write_memory_with_notification (to_addr, buffer, len); |
8cebebb9 | 2776 | |
14f9c5c9 | 2777 | val = value_copy (toval); |
0fd88904 | 2778 | memcpy (value_contents_raw (val), value_contents (fromval), |
4c4b4cd2 | 2779 | TYPE_LENGTH (type)); |
04624583 | 2780 | deprecated_set_value_type (val, type); |
d2e4a39e | 2781 | |
14f9c5c9 AS |
2782 | return val; |
2783 | } | |
2784 | ||
2785 | return value_assign (toval, fromval); | |
2786 | } | |
2787 | ||
2788 | ||
7c512744 JB |
2789 | /* Given that COMPONENT is a memory lvalue that is part of the lvalue |
2790 | CONTAINER, assign the contents of VAL to COMPONENTS's place in | |
2791 | CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not | |
2792 | COMPONENT, and not the inferior's memory. The current contents | |
2793 | of COMPONENT are ignored. | |
2794 | ||
2795 | Although not part of the initial design, this function also works | |
2796 | when CONTAINER and COMPONENT are not_lval's: it works as if CONTAINER | |
2797 | had a null address, and COMPONENT had an address which is equal to | |
2798 | its offset inside CONTAINER. */ | |
2799 | ||
52ce6436 PH |
2800 | static void |
2801 | value_assign_to_component (struct value *container, struct value *component, | |
2802 | struct value *val) | |
2803 | { | |
2804 | LONGEST offset_in_container = | |
42ae5230 | 2805 | (LONGEST) (value_address (component) - value_address (container)); |
7c512744 | 2806 | int bit_offset_in_container = |
52ce6436 PH |
2807 | value_bitpos (component) - value_bitpos (container); |
2808 | int bits; | |
7c512744 | 2809 | |
52ce6436 PH |
2810 | val = value_cast (value_type (component), val); |
2811 | ||
2812 | if (value_bitsize (component) == 0) | |
2813 | bits = TARGET_CHAR_BIT * TYPE_LENGTH (value_type (component)); | |
2814 | else | |
2815 | bits = value_bitsize (component); | |
2816 | ||
50810684 | 2817 | if (gdbarch_bits_big_endian (get_type_arch (value_type (container)))) |
7c512744 | 2818 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 PH |
2819 | value_bitpos (container) + bit_offset_in_container, |
2820 | value_contents (val), | |
2821 | TYPE_LENGTH (value_type (component)) * TARGET_CHAR_BIT - bits, | |
50810684 | 2822 | bits, 1); |
52ce6436 | 2823 | else |
7c512744 | 2824 | move_bits (value_contents_writeable (container) + offset_in_container, |
52ce6436 | 2825 | value_bitpos (container) + bit_offset_in_container, |
50810684 | 2826 | value_contents (val), 0, bits, 0); |
7c512744 JB |
2827 | } |
2828 | ||
4c4b4cd2 PH |
2829 | /* The value of the element of array ARR at the ARITY indices given in IND. |
2830 | ARR may be either a simple array, GNAT array descriptor, or pointer | |
14f9c5c9 AS |
2831 | thereto. */ |
2832 | ||
d2e4a39e AS |
2833 | struct value * |
2834 | ada_value_subscript (struct value *arr, int arity, struct value **ind) | |
14f9c5c9 AS |
2835 | { |
2836 | int k; | |
d2e4a39e AS |
2837 | struct value *elt; |
2838 | struct type *elt_type; | |
14f9c5c9 AS |
2839 | |
2840 | elt = ada_coerce_to_simple_array (arr); | |
2841 | ||
df407dfe | 2842 | elt_type = ada_check_typedef (value_type (elt)); |
d2e4a39e | 2843 | if (TYPE_CODE (elt_type) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
2844 | && TYPE_FIELD_BITSIZE (elt_type, 0) > 0) |
2845 | return value_subscript_packed (elt, arity, ind); | |
2846 | ||
2847 | for (k = 0; k < arity; k += 1) | |
2848 | { | |
2849 | if (TYPE_CODE (elt_type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2850 | error (_("too many subscripts (%d expected)"), k); |
2497b498 | 2851 | elt = value_subscript (elt, pos_atr (ind[k])); |
14f9c5c9 AS |
2852 | } |
2853 | return elt; | |
2854 | } | |
2855 | ||
deede10c JB |
2856 | /* Assuming ARR is a pointer to a GDB array, the value of the element |
2857 | of *ARR at the ARITY indices given in IND. | |
919e6dbe PMR |
2858 | Does not read the entire array into memory. |
2859 | ||
2860 | Note: Unlike what one would expect, this function is used instead of | |
2861 | ada_value_subscript for basically all non-packed array types. The reason | |
2862 | for this is that a side effect of doing our own pointer arithmetics instead | |
2863 | of relying on value_subscript is that there is no implicit typedef peeling. | |
2864 | This is important for arrays of array accesses, where it allows us to | |
2865 | preserve the fact that the array's element is an array access, where the | |
2866 | access part os encoded in a typedef layer. */ | |
14f9c5c9 | 2867 | |
2c0b251b | 2868 | static struct value * |
deede10c | 2869 | ada_value_ptr_subscript (struct value *arr, int arity, struct value **ind) |
14f9c5c9 AS |
2870 | { |
2871 | int k; | |
919e6dbe | 2872 | struct value *array_ind = ada_value_ind (arr); |
deede10c | 2873 | struct type *type |
919e6dbe PMR |
2874 | = check_typedef (value_enclosing_type (array_ind)); |
2875 | ||
2876 | if (TYPE_CODE (type) == TYPE_CODE_ARRAY | |
2877 | && TYPE_FIELD_BITSIZE (type, 0) > 0) | |
2878 | return value_subscript_packed (array_ind, arity, ind); | |
14f9c5c9 AS |
2879 | |
2880 | for (k = 0; k < arity; k += 1) | |
2881 | { | |
2882 | LONGEST lwb, upb; | |
aa715135 | 2883 | struct value *lwb_value; |
14f9c5c9 AS |
2884 | |
2885 | if (TYPE_CODE (type) != TYPE_CODE_ARRAY) | |
323e0a4a | 2886 | error (_("too many subscripts (%d expected)"), k); |
d2e4a39e | 2887 | arr = value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type)), |
4c4b4cd2 | 2888 | value_copy (arr)); |
14f9c5c9 | 2889 | get_discrete_bounds (TYPE_INDEX_TYPE (type), &lwb, &upb); |
aa715135 JG |
2890 | lwb_value = value_from_longest (value_type(ind[k]), lwb); |
2891 | arr = value_ptradd (arr, pos_atr (ind[k]) - pos_atr (lwb_value)); | |
14f9c5c9 AS |
2892 | type = TYPE_TARGET_TYPE (type); |
2893 | } | |
2894 | ||
2895 | return value_ind (arr); | |
2896 | } | |
2897 | ||
0b5d8877 | 2898 | /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the |
aa715135 JG |
2899 | actual type of ARRAY_PTR is ignored), returns the Ada slice of |
2900 | HIGH'Pos-LOW'Pos+1 elements starting at index LOW. The lower bound of | |
2901 | this array is LOW, as per Ada rules. */ | |
0b5d8877 | 2902 | static struct value * |
f5938064 JG |
2903 | ada_value_slice_from_ptr (struct value *array_ptr, struct type *type, |
2904 | int low, int high) | |
0b5d8877 | 2905 | { |
b0dd7688 | 2906 | struct type *type0 = ada_check_typedef (type); |
aa715135 | 2907 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0)); |
0c9c3474 | 2908 | struct type *index_type |
aa715135 | 2909 | = create_static_range_type (NULL, base_index_type, low, high); |
9fe561ab JB |
2910 | struct type *slice_type = create_array_type_with_stride |
2911 | (NULL, TYPE_TARGET_TYPE (type0), index_type, | |
2912 | get_dyn_prop (DYN_PROP_BYTE_STRIDE, type0), | |
2913 | TYPE_FIELD_BITSIZE (type0, 0)); | |
aa715135 JG |
2914 | int base_low = ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0)); |
2915 | LONGEST base_low_pos, low_pos; | |
2916 | CORE_ADDR base; | |
2917 | ||
2918 | if (!discrete_position (base_index_type, low, &low_pos) | |
2919 | || !discrete_position (base_index_type, base_low, &base_low_pos)) | |
2920 | { | |
2921 | warning (_("unable to get positions in slice, use bounds instead")); | |
2922 | low_pos = low; | |
2923 | base_low_pos = base_low; | |
2924 | } | |
5b4ee69b | 2925 | |
aa715135 JG |
2926 | base = value_as_address (array_ptr) |
2927 | + ((low_pos - base_low_pos) | |
2928 | * TYPE_LENGTH (TYPE_TARGET_TYPE (type0))); | |
f5938064 | 2929 | return value_at_lazy (slice_type, base); |
0b5d8877 PH |
2930 | } |
2931 | ||
2932 | ||
2933 | static struct value * | |
2934 | ada_value_slice (struct value *array, int low, int high) | |
2935 | { | |
b0dd7688 | 2936 | struct type *type = ada_check_typedef (value_type (array)); |
aa715135 | 2937 | struct type *base_index_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
0c9c3474 SA |
2938 | struct type *index_type |
2939 | = create_static_range_type (NULL, TYPE_INDEX_TYPE (type), low, high); | |
9fe561ab JB |
2940 | struct type *slice_type = create_array_type_with_stride |
2941 | (NULL, TYPE_TARGET_TYPE (type), index_type, | |
2942 | get_dyn_prop (DYN_PROP_BYTE_STRIDE, type), | |
2943 | TYPE_FIELD_BITSIZE (type, 0)); | |
aa715135 | 2944 | LONGEST low_pos, high_pos; |
5b4ee69b | 2945 | |
aa715135 JG |
2946 | if (!discrete_position (base_index_type, low, &low_pos) |
2947 | || !discrete_position (base_index_type, high, &high_pos)) | |
2948 | { | |
2949 | warning (_("unable to get positions in slice, use bounds instead")); | |
2950 | low_pos = low; | |
2951 | high_pos = high; | |
2952 | } | |
2953 | ||
2954 | return value_cast (slice_type, | |
2955 | value_slice (array, low, high_pos - low_pos + 1)); | |
0b5d8877 PH |
2956 | } |
2957 | ||
14f9c5c9 AS |
2958 | /* If type is a record type in the form of a standard GNAT array |
2959 | descriptor, returns the number of dimensions for type. If arr is a | |
2960 | simple array, returns the number of "array of"s that prefix its | |
4c4b4cd2 | 2961 | type designation. Otherwise, returns 0. */ |
14f9c5c9 AS |
2962 | |
2963 | int | |
d2e4a39e | 2964 | ada_array_arity (struct type *type) |
14f9c5c9 AS |
2965 | { |
2966 | int arity; | |
2967 | ||
2968 | if (type == NULL) | |
2969 | return 0; | |
2970 | ||
2971 | type = desc_base_type (type); | |
2972 | ||
2973 | arity = 0; | |
d2e4a39e | 2974 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 | 2975 | return desc_arity (desc_bounds_type (type)); |
d2e4a39e AS |
2976 | else |
2977 | while (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 | 2978 | { |
4c4b4cd2 | 2979 | arity += 1; |
61ee279c | 2980 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
14f9c5c9 | 2981 | } |
d2e4a39e | 2982 | |
14f9c5c9 AS |
2983 | return arity; |
2984 | } | |
2985 | ||
2986 | /* If TYPE is a record type in the form of a standard GNAT array | |
2987 | descriptor or a simple array type, returns the element type for | |
2988 | TYPE after indexing by NINDICES indices, or by all indices if | |
4c4b4cd2 | 2989 | NINDICES is -1. Otherwise, returns NULL. */ |
14f9c5c9 | 2990 | |
d2e4a39e AS |
2991 | struct type * |
2992 | ada_array_element_type (struct type *type, int nindices) | |
14f9c5c9 AS |
2993 | { |
2994 | type = desc_base_type (type); | |
2995 | ||
d2e4a39e | 2996 | if (TYPE_CODE (type) == TYPE_CODE_STRUCT) |
14f9c5c9 AS |
2997 | { |
2998 | int k; | |
d2e4a39e | 2999 | struct type *p_array_type; |
14f9c5c9 | 3000 | |
556bdfd4 | 3001 | p_array_type = desc_data_target_type (type); |
14f9c5c9 AS |
3002 | |
3003 | k = ada_array_arity (type); | |
3004 | if (k == 0) | |
4c4b4cd2 | 3005 | return NULL; |
d2e4a39e | 3006 | |
4c4b4cd2 | 3007 | /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */ |
14f9c5c9 | 3008 | if (nindices >= 0 && k > nindices) |
4c4b4cd2 | 3009 | k = nindices; |
d2e4a39e | 3010 | while (k > 0 && p_array_type != NULL) |
4c4b4cd2 | 3011 | { |
61ee279c | 3012 | p_array_type = ada_check_typedef (TYPE_TARGET_TYPE (p_array_type)); |
4c4b4cd2 PH |
3013 | k -= 1; |
3014 | } | |
14f9c5c9 AS |
3015 | return p_array_type; |
3016 | } | |
3017 | else if (TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
3018 | { | |
3019 | while (nindices != 0 && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
4c4b4cd2 PH |
3020 | { |
3021 | type = TYPE_TARGET_TYPE (type); | |
3022 | nindices -= 1; | |
3023 | } | |
14f9c5c9 AS |
3024 | return type; |
3025 | } | |
3026 | ||
3027 | return NULL; | |
3028 | } | |
3029 | ||
4c4b4cd2 | 3030 | /* The type of nth index in arrays of given type (n numbering from 1). |
dd19d49e UW |
3031 | Does not examine memory. Throws an error if N is invalid or TYPE |
3032 | is not an array type. NAME is the name of the Ada attribute being | |
3033 | evaluated ('range, 'first, 'last, or 'length); it is used in building | |
3034 | the error message. */ | |
14f9c5c9 | 3035 | |
1eea4ebd UW |
3036 | static struct type * |
3037 | ada_index_type (struct type *type, int n, const char *name) | |
14f9c5c9 | 3038 | { |
4c4b4cd2 PH |
3039 | struct type *result_type; |
3040 | ||
14f9c5c9 AS |
3041 | type = desc_base_type (type); |
3042 | ||
1eea4ebd UW |
3043 | if (n < 0 || n > ada_array_arity (type)) |
3044 | error (_("invalid dimension number to '%s"), name); | |
14f9c5c9 | 3045 | |
4c4b4cd2 | 3046 | if (ada_is_simple_array_type (type)) |
14f9c5c9 AS |
3047 | { |
3048 | int i; | |
3049 | ||
3050 | for (i = 1; i < n; i += 1) | |
4c4b4cd2 | 3051 | type = TYPE_TARGET_TYPE (type); |
262452ec | 3052 | result_type = TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type)); |
4c4b4cd2 PH |
3053 | /* FIXME: The stabs type r(0,0);bound;bound in an array type |
3054 | has a target type of TYPE_CODE_UNDEF. We compensate here, but | |
76a01679 | 3055 | perhaps stabsread.c would make more sense. */ |
1eea4ebd UW |
3056 | if (result_type && TYPE_CODE (result_type) == TYPE_CODE_UNDEF) |
3057 | result_type = NULL; | |
14f9c5c9 | 3058 | } |
d2e4a39e | 3059 | else |
1eea4ebd UW |
3060 | { |
3061 | result_type = desc_index_type (desc_bounds_type (type), n); | |
3062 | if (result_type == NULL) | |
3063 | error (_("attempt to take bound of something that is not an array")); | |
3064 | } | |
3065 | ||
3066 | return result_type; | |
14f9c5c9 AS |
3067 | } |
3068 | ||
3069 | /* Given that arr is an array type, returns the lower bound of the | |
3070 | Nth index (numbering from 1) if WHICH is 0, and the upper bound if | |
4c4b4cd2 | 3071 | WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an |
1eea4ebd UW |
3072 | array-descriptor type. It works for other arrays with bounds supplied |
3073 | by run-time quantities other than discriminants. */ | |
14f9c5c9 | 3074 | |
abb68b3e | 3075 | static LONGEST |
fb5e3d5c | 3076 | ada_array_bound_from_type (struct type *arr_type, int n, int which) |
14f9c5c9 | 3077 | { |
8a48ac95 | 3078 | struct type *type, *index_type_desc, *index_type; |
1ce677a4 | 3079 | int i; |
262452ec JK |
3080 | |
3081 | gdb_assert (which == 0 || which == 1); | |
14f9c5c9 | 3082 | |
ad82864c JB |
3083 | if (ada_is_constrained_packed_array_type (arr_type)) |
3084 | arr_type = decode_constrained_packed_array_type (arr_type); | |
14f9c5c9 | 3085 | |
4c4b4cd2 | 3086 | if (arr_type == NULL || !ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3087 | return (LONGEST) - which; |
14f9c5c9 AS |
3088 | |
3089 | if (TYPE_CODE (arr_type) == TYPE_CODE_PTR) | |
3090 | type = TYPE_TARGET_TYPE (arr_type); | |
3091 | else | |
3092 | type = arr_type; | |
3093 | ||
bafffb51 JB |
3094 | if (TYPE_FIXED_INSTANCE (type)) |
3095 | { | |
3096 | /* The array has already been fixed, so we do not need to | |
3097 | check the parallel ___XA type again. That encoding has | |
3098 | already been applied, so ignore it now. */ | |
3099 | index_type_desc = NULL; | |
3100 | } | |
3101 | else | |
3102 | { | |
3103 | index_type_desc = ada_find_parallel_type (type, "___XA"); | |
3104 | ada_fixup_array_indexes_type (index_type_desc); | |
3105 | } | |
3106 | ||
262452ec | 3107 | if (index_type_desc != NULL) |
28c85d6c JB |
3108 | index_type = to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, n - 1), |
3109 | NULL); | |
262452ec | 3110 | else |
8a48ac95 JB |
3111 | { |
3112 | struct type *elt_type = check_typedef (type); | |
3113 | ||
3114 | for (i = 1; i < n; i++) | |
3115 | elt_type = check_typedef (TYPE_TARGET_TYPE (elt_type)); | |
3116 | ||
3117 | index_type = TYPE_INDEX_TYPE (elt_type); | |
3118 | } | |
262452ec | 3119 | |
43bbcdc2 PH |
3120 | return |
3121 | (LONGEST) (which == 0 | |
3122 | ? ada_discrete_type_low_bound (index_type) | |
3123 | : ada_discrete_type_high_bound (index_type)); | |
14f9c5c9 AS |
3124 | } |
3125 | ||
3126 | /* Given that arr is an array value, returns the lower bound of the | |
abb68b3e JB |
3127 | nth index (numbering from 1) if WHICH is 0, and the upper bound if |
3128 | WHICH is 1. This routine will also work for arrays with bounds | |
4c4b4cd2 | 3129 | supplied by run-time quantities other than discriminants. */ |
14f9c5c9 | 3130 | |
1eea4ebd | 3131 | static LONGEST |
4dc81987 | 3132 | ada_array_bound (struct value *arr, int n, int which) |
14f9c5c9 | 3133 | { |
eb479039 JB |
3134 | struct type *arr_type; |
3135 | ||
3136 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3137 | arr = value_ind (arr); | |
3138 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3139 | |
ad82864c JB |
3140 | if (ada_is_constrained_packed_array_type (arr_type)) |
3141 | return ada_array_bound (decode_constrained_packed_array (arr), n, which); | |
4c4b4cd2 | 3142 | else if (ada_is_simple_array_type (arr_type)) |
1eea4ebd | 3143 | return ada_array_bound_from_type (arr_type, n, which); |
14f9c5c9 | 3144 | else |
1eea4ebd | 3145 | return value_as_long (desc_one_bound (desc_bounds (arr), n, which)); |
14f9c5c9 AS |
3146 | } |
3147 | ||
3148 | /* Given that arr is an array value, returns the length of the | |
3149 | nth index. This routine will also work for arrays with bounds | |
4c4b4cd2 PH |
3150 | supplied by run-time quantities other than discriminants. |
3151 | Does not work for arrays indexed by enumeration types with representation | |
3152 | clauses at the moment. */ | |
14f9c5c9 | 3153 | |
1eea4ebd | 3154 | static LONGEST |
d2e4a39e | 3155 | ada_array_length (struct value *arr, int n) |
14f9c5c9 | 3156 | { |
aa715135 JG |
3157 | struct type *arr_type, *index_type; |
3158 | int low, high; | |
eb479039 JB |
3159 | |
3160 | if (TYPE_CODE (check_typedef (value_type (arr))) == TYPE_CODE_PTR) | |
3161 | arr = value_ind (arr); | |
3162 | arr_type = value_enclosing_type (arr); | |
14f9c5c9 | 3163 | |
ad82864c JB |
3164 | if (ada_is_constrained_packed_array_type (arr_type)) |
3165 | return ada_array_length (decode_constrained_packed_array (arr), n); | |
14f9c5c9 | 3166 | |
4c4b4cd2 | 3167 | if (ada_is_simple_array_type (arr_type)) |
aa715135 JG |
3168 | { |
3169 | low = ada_array_bound_from_type (arr_type, n, 0); | |
3170 | high = ada_array_bound_from_type (arr_type, n, 1); | |
3171 | } | |
14f9c5c9 | 3172 | else |
aa715135 JG |
3173 | { |
3174 | low = value_as_long (desc_one_bound (desc_bounds (arr), n, 0)); | |
3175 | high = value_as_long (desc_one_bound (desc_bounds (arr), n, 1)); | |
3176 | } | |
3177 | ||
f168693b | 3178 | arr_type = check_typedef (arr_type); |
7150d33c | 3179 | index_type = ada_index_type (arr_type, n, "length"); |
aa715135 JG |
3180 | if (index_type != NULL) |
3181 | { | |
3182 | struct type *base_type; | |
3183 | if (TYPE_CODE (index_type) == TYPE_CODE_RANGE) | |
3184 | base_type = TYPE_TARGET_TYPE (index_type); | |
3185 | else | |
3186 | base_type = index_type; | |
3187 | ||
3188 | low = pos_atr (value_from_longest (base_type, low)); | |
3189 | high = pos_atr (value_from_longest (base_type, high)); | |
3190 | } | |
3191 | return high - low + 1; | |
4c4b4cd2 PH |
3192 | } |
3193 | ||
3194 | /* An empty array whose type is that of ARR_TYPE (an array type), | |
3195 | with bounds LOW to LOW-1. */ | |
3196 | ||
3197 | static struct value * | |
3198 | empty_array (struct type *arr_type, int low) | |
3199 | { | |
b0dd7688 | 3200 | struct type *arr_type0 = ada_check_typedef (arr_type); |
0c9c3474 SA |
3201 | struct type *index_type |
3202 | = create_static_range_type | |
3203 | (NULL, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0)), low, low - 1); | |
b0dd7688 | 3204 | struct type *elt_type = ada_array_element_type (arr_type0, 1); |
5b4ee69b | 3205 | |
0b5d8877 | 3206 | return allocate_value (create_array_type (NULL, elt_type, index_type)); |
14f9c5c9 | 3207 | } |
14f9c5c9 | 3208 | \f |
d2e4a39e | 3209 | |
4c4b4cd2 | 3210 | /* Name resolution */ |
14f9c5c9 | 3211 | |
4c4b4cd2 PH |
3212 | /* The "decoded" name for the user-definable Ada operator corresponding |
3213 | to OP. */ | |
14f9c5c9 | 3214 | |
d2e4a39e | 3215 | static const char * |
4c4b4cd2 | 3216 | ada_decoded_op_name (enum exp_opcode op) |
14f9c5c9 AS |
3217 | { |
3218 | int i; | |
3219 | ||
4c4b4cd2 | 3220 | for (i = 0; ada_opname_table[i].encoded != NULL; i += 1) |
14f9c5c9 AS |
3221 | { |
3222 | if (ada_opname_table[i].op == op) | |
4c4b4cd2 | 3223 | return ada_opname_table[i].decoded; |
14f9c5c9 | 3224 | } |
323e0a4a | 3225 | error (_("Could not find operator name for opcode")); |
14f9c5c9 AS |
3226 | } |
3227 | ||
3228 | ||
4c4b4cd2 PH |
3229 | /* Same as evaluate_type (*EXP), but resolves ambiguous symbol |
3230 | references (marked by OP_VAR_VALUE nodes in which the symbol has an | |
3231 | undefined namespace) and converts operators that are | |
3232 | user-defined into appropriate function calls. If CONTEXT_TYPE is | |
14f9c5c9 AS |
3233 | non-null, it provides a preferred result type [at the moment, only |
3234 | type void has any effect---causing procedures to be preferred over | |
3235 | functions in calls]. A null CONTEXT_TYPE indicates that a non-void | |
4c4b4cd2 | 3236 | return type is preferred. May change (expand) *EXP. */ |
14f9c5c9 | 3237 | |
4c4b4cd2 | 3238 | static void |
e9d9f57e | 3239 | resolve (expression_up *expp, int void_context_p) |
14f9c5c9 | 3240 | { |
30b15541 UW |
3241 | struct type *context_type = NULL; |
3242 | int pc = 0; | |
3243 | ||
3244 | if (void_context_p) | |
3245 | context_type = builtin_type ((*expp)->gdbarch)->builtin_void; | |
3246 | ||
3247 | resolve_subexp (expp, &pc, 1, context_type); | |
14f9c5c9 AS |
3248 | } |
3249 | ||
4c4b4cd2 PH |
3250 | /* Resolve the operator of the subexpression beginning at |
3251 | position *POS of *EXPP. "Resolving" consists of replacing | |
3252 | the symbols that have undefined namespaces in OP_VAR_VALUE nodes | |
3253 | with their resolutions, replacing built-in operators with | |
3254 | function calls to user-defined operators, where appropriate, and, | |
3255 | when DEPROCEDURE_P is non-zero, converting function-valued variables | |
3256 | into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions | |
3257 | are as in ada_resolve, above. */ | |
14f9c5c9 | 3258 | |
d2e4a39e | 3259 | static struct value * |
e9d9f57e | 3260 | resolve_subexp (expression_up *expp, int *pos, int deprocedure_p, |
76a01679 | 3261 | struct type *context_type) |
14f9c5c9 AS |
3262 | { |
3263 | int pc = *pos; | |
3264 | int i; | |
4c4b4cd2 | 3265 | struct expression *exp; /* Convenience: == *expp. */ |
14f9c5c9 | 3266 | enum exp_opcode op = (*expp)->elts[pc].opcode; |
4c4b4cd2 PH |
3267 | struct value **argvec; /* Vector of operand types (alloca'ed). */ |
3268 | int nargs; /* Number of operands. */ | |
52ce6436 | 3269 | int oplen; |
ec6a20c2 | 3270 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
14f9c5c9 AS |
3271 | |
3272 | argvec = NULL; | |
3273 | nargs = 0; | |
e9d9f57e | 3274 | exp = expp->get (); |
14f9c5c9 | 3275 | |
52ce6436 PH |
3276 | /* Pass one: resolve operands, saving their types and updating *pos, |
3277 | if needed. */ | |
14f9c5c9 AS |
3278 | switch (op) |
3279 | { | |
4c4b4cd2 PH |
3280 | case OP_FUNCALL: |
3281 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE | |
76a01679 JB |
3282 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
3283 | *pos += 7; | |
4c4b4cd2 PH |
3284 | else |
3285 | { | |
3286 | *pos += 3; | |
3287 | resolve_subexp (expp, pos, 0, NULL); | |
3288 | } | |
3289 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
14f9c5c9 AS |
3290 | break; |
3291 | ||
14f9c5c9 | 3292 | case UNOP_ADDR: |
4c4b4cd2 PH |
3293 | *pos += 1; |
3294 | resolve_subexp (expp, pos, 0, NULL); | |
3295 | break; | |
3296 | ||
52ce6436 PH |
3297 | case UNOP_QUAL: |
3298 | *pos += 3; | |
17466c1a | 3299 | resolve_subexp (expp, pos, 1, check_typedef (exp->elts[pc + 1].type)); |
4c4b4cd2 PH |
3300 | break; |
3301 | ||
52ce6436 | 3302 | case OP_ATR_MODULUS: |
4c4b4cd2 PH |
3303 | case OP_ATR_SIZE: |
3304 | case OP_ATR_TAG: | |
4c4b4cd2 PH |
3305 | case OP_ATR_FIRST: |
3306 | case OP_ATR_LAST: | |
3307 | case OP_ATR_LENGTH: | |
3308 | case OP_ATR_POS: | |
3309 | case OP_ATR_VAL: | |
4c4b4cd2 PH |
3310 | case OP_ATR_MIN: |
3311 | case OP_ATR_MAX: | |
52ce6436 PH |
3312 | case TERNOP_IN_RANGE: |
3313 | case BINOP_IN_BOUNDS: | |
3314 | case UNOP_IN_RANGE: | |
3315 | case OP_AGGREGATE: | |
3316 | case OP_OTHERS: | |
3317 | case OP_CHOICES: | |
3318 | case OP_POSITIONAL: | |
3319 | case OP_DISCRETE_RANGE: | |
3320 | case OP_NAME: | |
3321 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
3322 | *pos += oplen; | |
14f9c5c9 AS |
3323 | break; |
3324 | ||
3325 | case BINOP_ASSIGN: | |
3326 | { | |
4c4b4cd2 PH |
3327 | struct value *arg1; |
3328 | ||
3329 | *pos += 1; | |
3330 | arg1 = resolve_subexp (expp, pos, 0, NULL); | |
3331 | if (arg1 == NULL) | |
3332 | resolve_subexp (expp, pos, 1, NULL); | |
3333 | else | |
df407dfe | 3334 | resolve_subexp (expp, pos, 1, value_type (arg1)); |
4c4b4cd2 | 3335 | break; |
14f9c5c9 AS |
3336 | } |
3337 | ||
4c4b4cd2 | 3338 | case UNOP_CAST: |
4c4b4cd2 PH |
3339 | *pos += 3; |
3340 | nargs = 1; | |
3341 | break; | |
14f9c5c9 | 3342 | |
4c4b4cd2 PH |
3343 | case BINOP_ADD: |
3344 | case BINOP_SUB: | |
3345 | case BINOP_MUL: | |
3346 | case BINOP_DIV: | |
3347 | case BINOP_REM: | |
3348 | case BINOP_MOD: | |
3349 | case BINOP_EXP: | |
3350 | case BINOP_CONCAT: | |
3351 | case BINOP_LOGICAL_AND: | |
3352 | case BINOP_LOGICAL_OR: | |
3353 | case BINOP_BITWISE_AND: | |
3354 | case BINOP_BITWISE_IOR: | |
3355 | case BINOP_BITWISE_XOR: | |
14f9c5c9 | 3356 | |
4c4b4cd2 PH |
3357 | case BINOP_EQUAL: |
3358 | case BINOP_NOTEQUAL: | |
3359 | case BINOP_LESS: | |
3360 | case BINOP_GTR: | |
3361 | case BINOP_LEQ: | |
3362 | case BINOP_GEQ: | |
14f9c5c9 | 3363 | |
4c4b4cd2 PH |
3364 | case BINOP_REPEAT: |
3365 | case BINOP_SUBSCRIPT: | |
3366 | case BINOP_COMMA: | |
40c8aaa9 JB |
3367 | *pos += 1; |
3368 | nargs = 2; | |
3369 | break; | |
14f9c5c9 | 3370 | |
4c4b4cd2 PH |
3371 | case UNOP_NEG: |
3372 | case UNOP_PLUS: | |
3373 | case UNOP_LOGICAL_NOT: | |
3374 | case UNOP_ABS: | |
3375 | case UNOP_IND: | |
3376 | *pos += 1; | |
3377 | nargs = 1; | |
3378 | break; | |
14f9c5c9 | 3379 | |
4c4b4cd2 | 3380 | case OP_LONG: |
edd079d9 | 3381 | case OP_FLOAT: |
4c4b4cd2 | 3382 | case OP_VAR_VALUE: |
74ea4be4 | 3383 | case OP_VAR_MSYM_VALUE: |
4c4b4cd2 PH |
3384 | *pos += 4; |
3385 | break; | |
14f9c5c9 | 3386 | |
4c4b4cd2 PH |
3387 | case OP_TYPE: |
3388 | case OP_BOOL: | |
3389 | case OP_LAST: | |
4c4b4cd2 PH |
3390 | case OP_INTERNALVAR: |
3391 | *pos += 3; | |
3392 | break; | |
14f9c5c9 | 3393 | |
4c4b4cd2 PH |
3394 | case UNOP_MEMVAL: |
3395 | *pos += 3; | |
3396 | nargs = 1; | |
3397 | break; | |
3398 | ||
67f3407f DJ |
3399 | case OP_REGISTER: |
3400 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3401 | break; | |
3402 | ||
4c4b4cd2 PH |
3403 | case STRUCTOP_STRUCT: |
3404 | *pos += 4 + BYTES_TO_EXP_ELEM (exp->elts[pc + 1].longconst + 1); | |
3405 | nargs = 1; | |
3406 | break; | |
3407 | ||
4c4b4cd2 | 3408 | case TERNOP_SLICE: |
4c4b4cd2 PH |
3409 | *pos += 1; |
3410 | nargs = 3; | |
3411 | break; | |
3412 | ||
52ce6436 | 3413 | case OP_STRING: |
14f9c5c9 | 3414 | break; |
4c4b4cd2 PH |
3415 | |
3416 | default: | |
323e0a4a | 3417 | error (_("Unexpected operator during name resolution")); |
14f9c5c9 AS |
3418 | } |
3419 | ||
8d749320 | 3420 | argvec = XALLOCAVEC (struct value *, nargs + 1); |
4c4b4cd2 PH |
3421 | for (i = 0; i < nargs; i += 1) |
3422 | argvec[i] = resolve_subexp (expp, pos, 1, NULL); | |
3423 | argvec[i] = NULL; | |
e9d9f57e | 3424 | exp = expp->get (); |
4c4b4cd2 PH |
3425 | |
3426 | /* Pass two: perform any resolution on principal operator. */ | |
14f9c5c9 AS |
3427 | switch (op) |
3428 | { | |
3429 | default: | |
3430 | break; | |
3431 | ||
14f9c5c9 | 3432 | case OP_VAR_VALUE: |
4c4b4cd2 | 3433 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) |
76a01679 | 3434 | { |
d12307c1 | 3435 | struct block_symbol *candidates; |
76a01679 JB |
3436 | int n_candidates; |
3437 | ||
3438 | n_candidates = | |
3439 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME | |
3440 | (exp->elts[pc + 2].symbol), | |
3441 | exp->elts[pc + 1].block, VAR_DOMAIN, | |
4eeaa230 | 3442 | &candidates); |
ec6a20c2 | 3443 | make_cleanup (xfree, candidates); |
76a01679 JB |
3444 | |
3445 | if (n_candidates > 1) | |
3446 | { | |
3447 | /* Types tend to get re-introduced locally, so if there | |
3448 | are any local symbols that are not types, first filter | |
3449 | out all types. */ | |
3450 | int j; | |
3451 | for (j = 0; j < n_candidates; j += 1) | |
d12307c1 | 3452 | switch (SYMBOL_CLASS (candidates[j].symbol)) |
76a01679 JB |
3453 | { |
3454 | case LOC_REGISTER: | |
3455 | case LOC_ARG: | |
3456 | case LOC_REF_ARG: | |
76a01679 JB |
3457 | case LOC_REGPARM_ADDR: |
3458 | case LOC_LOCAL: | |
76a01679 | 3459 | case LOC_COMPUTED: |
76a01679 JB |
3460 | goto FoundNonType; |
3461 | default: | |
3462 | break; | |
3463 | } | |
3464 | FoundNonType: | |
3465 | if (j < n_candidates) | |
3466 | { | |
3467 | j = 0; | |
3468 | while (j < n_candidates) | |
3469 | { | |
d12307c1 | 3470 | if (SYMBOL_CLASS (candidates[j].symbol) == LOC_TYPEDEF) |
76a01679 JB |
3471 | { |
3472 | candidates[j] = candidates[n_candidates - 1]; | |
3473 | n_candidates -= 1; | |
3474 | } | |
3475 | else | |
3476 | j += 1; | |
3477 | } | |
3478 | } | |
3479 | } | |
3480 | ||
3481 | if (n_candidates == 0) | |
323e0a4a | 3482 | error (_("No definition found for %s"), |
76a01679 JB |
3483 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3484 | else if (n_candidates == 1) | |
3485 | i = 0; | |
3486 | else if (deprocedure_p | |
3487 | && !is_nonfunction (candidates, n_candidates)) | |
3488 | { | |
06d5cf63 JB |
3489 | i = ada_resolve_function |
3490 | (candidates, n_candidates, NULL, 0, | |
3491 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 2].symbol), | |
3492 | context_type); | |
76a01679 | 3493 | if (i < 0) |
323e0a4a | 3494 | error (_("Could not find a match for %s"), |
76a01679 JB |
3495 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3496 | } | |
3497 | else | |
3498 | { | |
323e0a4a | 3499 | printf_filtered (_("Multiple matches for %s\n"), |
76a01679 JB |
3500 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
3501 | user_select_syms (candidates, n_candidates, 1); | |
3502 | i = 0; | |
3503 | } | |
3504 | ||
3505 | exp->elts[pc + 1].block = candidates[i].block; | |
d12307c1 | 3506 | exp->elts[pc + 2].symbol = candidates[i].symbol; |
aee1fcdf | 3507 | innermost_block.update (candidates[i]); |
76a01679 JB |
3508 | } |
3509 | ||
3510 | if (deprocedure_p | |
3511 | && (TYPE_CODE (SYMBOL_TYPE (exp->elts[pc + 2].symbol)) | |
3512 | == TYPE_CODE_FUNC)) | |
3513 | { | |
3514 | replace_operator_with_call (expp, pc, 0, 0, | |
3515 | exp->elts[pc + 2].symbol, | |
3516 | exp->elts[pc + 1].block); | |
e9d9f57e | 3517 | exp = expp->get (); |
76a01679 | 3518 | } |
14f9c5c9 AS |
3519 | break; |
3520 | ||
3521 | case OP_FUNCALL: | |
3522 | { | |
4c4b4cd2 | 3523 | if (exp->elts[pc + 3].opcode == OP_VAR_VALUE |
76a01679 | 3524 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
4c4b4cd2 | 3525 | { |
d12307c1 | 3526 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3527 | int n_candidates; |
3528 | ||
3529 | n_candidates = | |
76a01679 JB |
3530 | ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME |
3531 | (exp->elts[pc + 5].symbol), | |
3532 | exp->elts[pc + 4].block, VAR_DOMAIN, | |
4eeaa230 | 3533 | &candidates); |
ec6a20c2 JB |
3534 | make_cleanup (xfree, candidates); |
3535 | ||
4c4b4cd2 PH |
3536 | if (n_candidates == 1) |
3537 | i = 0; | |
3538 | else | |
3539 | { | |
06d5cf63 JB |
3540 | i = ada_resolve_function |
3541 | (candidates, n_candidates, | |
3542 | argvec, nargs, | |
3543 | SYMBOL_LINKAGE_NAME (exp->elts[pc + 5].symbol), | |
3544 | context_type); | |
4c4b4cd2 | 3545 | if (i < 0) |
323e0a4a | 3546 | error (_("Could not find a match for %s"), |
4c4b4cd2 PH |
3547 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
3548 | } | |
3549 | ||
3550 | exp->elts[pc + 4].block = candidates[i].block; | |
d12307c1 | 3551 | exp->elts[pc + 5].symbol = candidates[i].symbol; |
aee1fcdf | 3552 | innermost_block.update (candidates[i]); |
4c4b4cd2 | 3553 | } |
14f9c5c9 AS |
3554 | } |
3555 | break; | |
3556 | case BINOP_ADD: | |
3557 | case BINOP_SUB: | |
3558 | case BINOP_MUL: | |
3559 | case BINOP_DIV: | |
3560 | case BINOP_REM: | |
3561 | case BINOP_MOD: | |
3562 | case BINOP_CONCAT: | |
3563 | case BINOP_BITWISE_AND: | |
3564 | case BINOP_BITWISE_IOR: | |
3565 | case BINOP_BITWISE_XOR: | |
3566 | case BINOP_EQUAL: | |
3567 | case BINOP_NOTEQUAL: | |
3568 | case BINOP_LESS: | |
3569 | case BINOP_GTR: | |
3570 | case BINOP_LEQ: | |
3571 | case BINOP_GEQ: | |
3572 | case BINOP_EXP: | |
3573 | case UNOP_NEG: | |
3574 | case UNOP_PLUS: | |
3575 | case UNOP_LOGICAL_NOT: | |
3576 | case UNOP_ABS: | |
3577 | if (possible_user_operator_p (op, argvec)) | |
4c4b4cd2 | 3578 | { |
d12307c1 | 3579 | struct block_symbol *candidates; |
4c4b4cd2 PH |
3580 | int n_candidates; |
3581 | ||
3582 | n_candidates = | |
b5ec771e | 3583 | ada_lookup_symbol_list (ada_decoded_op_name (op), |
4c4b4cd2 | 3584 | (struct block *) NULL, VAR_DOMAIN, |
4eeaa230 | 3585 | &candidates); |
ec6a20c2 JB |
3586 | make_cleanup (xfree, candidates); |
3587 | ||
4c4b4cd2 | 3588 | i = ada_resolve_function (candidates, n_candidates, argvec, nargs, |
76a01679 | 3589 | ada_decoded_op_name (op), NULL); |
4c4b4cd2 PH |
3590 | if (i < 0) |
3591 | break; | |
3592 | ||
d12307c1 PMR |
3593 | replace_operator_with_call (expp, pc, nargs, 1, |
3594 | candidates[i].symbol, | |
3595 | candidates[i].block); | |
e9d9f57e | 3596 | exp = expp->get (); |
4c4b4cd2 | 3597 | } |
14f9c5c9 | 3598 | break; |
4c4b4cd2 PH |
3599 | |
3600 | case OP_TYPE: | |
b3dbf008 | 3601 | case OP_REGISTER: |
ec6a20c2 | 3602 | do_cleanups (old_chain); |
4c4b4cd2 | 3603 | return NULL; |
14f9c5c9 AS |
3604 | } |
3605 | ||
3606 | *pos = pc; | |
ec6a20c2 | 3607 | do_cleanups (old_chain); |
ced9779b JB |
3608 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE) |
3609 | return evaluate_var_msym_value (EVAL_AVOID_SIDE_EFFECTS, | |
3610 | exp->elts[pc + 1].objfile, | |
3611 | exp->elts[pc + 2].msymbol); | |
3612 | else | |
3613 | return evaluate_subexp_type (exp, pos); | |
14f9c5c9 AS |
3614 | } |
3615 | ||
3616 | /* Return non-zero if formal type FTYPE matches actual type ATYPE. If | |
4c4b4cd2 | 3617 | MAY_DEREF is non-zero, the formal may be a pointer and the actual |
5b3d5b7d | 3618 | a non-pointer. */ |
14f9c5c9 | 3619 | /* The term "match" here is rather loose. The match is heuristic and |
5b3d5b7d | 3620 | liberal. */ |
14f9c5c9 AS |
3621 | |
3622 | static int | |
4dc81987 | 3623 | ada_type_match (struct type *ftype, struct type *atype, int may_deref) |
14f9c5c9 | 3624 | { |
61ee279c PH |
3625 | ftype = ada_check_typedef (ftype); |
3626 | atype = ada_check_typedef (atype); | |
14f9c5c9 AS |
3627 | |
3628 | if (TYPE_CODE (ftype) == TYPE_CODE_REF) | |
3629 | ftype = TYPE_TARGET_TYPE (ftype); | |
3630 | if (TYPE_CODE (atype) == TYPE_CODE_REF) | |
3631 | atype = TYPE_TARGET_TYPE (atype); | |
3632 | ||
d2e4a39e | 3633 | switch (TYPE_CODE (ftype)) |
14f9c5c9 AS |
3634 | { |
3635 | default: | |
5b3d5b7d | 3636 | return TYPE_CODE (ftype) == TYPE_CODE (atype); |
14f9c5c9 AS |
3637 | case TYPE_CODE_PTR: |
3638 | if (TYPE_CODE (atype) == TYPE_CODE_PTR) | |
4c4b4cd2 PH |
3639 | return ada_type_match (TYPE_TARGET_TYPE (ftype), |
3640 | TYPE_TARGET_TYPE (atype), 0); | |
d2e4a39e | 3641 | else |
1265e4aa JB |
3642 | return (may_deref |
3643 | && ada_type_match (TYPE_TARGET_TYPE (ftype), atype, 0)); | |
14f9c5c9 AS |
3644 | case TYPE_CODE_INT: |
3645 | case TYPE_CODE_ENUM: | |
3646 | case TYPE_CODE_RANGE: | |
3647 | switch (TYPE_CODE (atype)) | |
4c4b4cd2 PH |
3648 | { |
3649 | case TYPE_CODE_INT: | |
3650 | case TYPE_CODE_ENUM: | |
3651 | case TYPE_CODE_RANGE: | |
3652 | return 1; | |
3653 | default: | |
3654 | return 0; | |
3655 | } | |
14f9c5c9 AS |
3656 | |
3657 | case TYPE_CODE_ARRAY: | |
d2e4a39e | 3658 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY |
4c4b4cd2 | 3659 | || ada_is_array_descriptor_type (atype)); |
14f9c5c9 AS |
3660 | |
3661 | case TYPE_CODE_STRUCT: | |
4c4b4cd2 PH |
3662 | if (ada_is_array_descriptor_type (ftype)) |
3663 | return (TYPE_CODE (atype) == TYPE_CODE_ARRAY | |
3664 | || ada_is_array_descriptor_type (atype)); | |
14f9c5c9 | 3665 | else |
4c4b4cd2 PH |
3666 | return (TYPE_CODE (atype) == TYPE_CODE_STRUCT |
3667 | && !ada_is_array_descriptor_type (atype)); | |
14f9c5c9 AS |
3668 | |
3669 | case TYPE_CODE_UNION: | |
3670 | case TYPE_CODE_FLT: | |
3671 | return (TYPE_CODE (atype) == TYPE_CODE (ftype)); | |
3672 | } | |
3673 | } | |
3674 | ||
3675 | /* Return non-zero if the formals of FUNC "sufficiently match" the | |
3676 | vector of actual argument types ACTUALS of size N_ACTUALS. FUNC | |
3677 | may also be an enumeral, in which case it is treated as a 0- | |
4c4b4cd2 | 3678 | argument function. */ |
14f9c5c9 AS |
3679 | |
3680 | static int | |
d2e4a39e | 3681 | ada_args_match (struct symbol *func, struct value **actuals, int n_actuals) |
14f9c5c9 AS |
3682 | { |
3683 | int i; | |
d2e4a39e | 3684 | struct type *func_type = SYMBOL_TYPE (func); |
14f9c5c9 | 3685 | |
1265e4aa JB |
3686 | if (SYMBOL_CLASS (func) == LOC_CONST |
3687 | && TYPE_CODE (func_type) == TYPE_CODE_ENUM) | |
14f9c5c9 AS |
3688 | return (n_actuals == 0); |
3689 | else if (func_type == NULL || TYPE_CODE (func_type) != TYPE_CODE_FUNC) | |
3690 | return 0; | |
3691 | ||
3692 | if (TYPE_NFIELDS (func_type) != n_actuals) | |
3693 | return 0; | |
3694 | ||
3695 | for (i = 0; i < n_actuals; i += 1) | |
3696 | { | |
4c4b4cd2 | 3697 | if (actuals[i] == NULL) |
76a01679 JB |
3698 | return 0; |
3699 | else | |
3700 | { | |
5b4ee69b MS |
3701 | struct type *ftype = ada_check_typedef (TYPE_FIELD_TYPE (func_type, |
3702 | i)); | |
df407dfe | 3703 | struct type *atype = ada_check_typedef (value_type (actuals[i])); |
4c4b4cd2 | 3704 | |
76a01679 JB |
3705 | if (!ada_type_match (ftype, atype, 1)) |
3706 | return 0; | |
3707 | } | |
14f9c5c9 AS |
3708 | } |
3709 | return 1; | |
3710 | } | |
3711 | ||
3712 | /* False iff function type FUNC_TYPE definitely does not produce a value | |
3713 | compatible with type CONTEXT_TYPE. Conservatively returns 1 if | |
3714 | FUNC_TYPE is not a valid function type with a non-null return type | |
3715 | or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */ | |
3716 | ||
3717 | static int | |
d2e4a39e | 3718 | return_match (struct type *func_type, struct type *context_type) |
14f9c5c9 | 3719 | { |
d2e4a39e | 3720 | struct type *return_type; |
14f9c5c9 AS |
3721 | |
3722 | if (func_type == NULL) | |
3723 | return 1; | |
3724 | ||
4c4b4cd2 | 3725 | if (TYPE_CODE (func_type) == TYPE_CODE_FUNC) |
18af8284 | 3726 | return_type = get_base_type (TYPE_TARGET_TYPE (func_type)); |
4c4b4cd2 | 3727 | else |
18af8284 | 3728 | return_type = get_base_type (func_type); |
14f9c5c9 AS |
3729 | if (return_type == NULL) |
3730 | return 1; | |
3731 | ||
18af8284 | 3732 | context_type = get_base_type (context_type); |
14f9c5c9 AS |
3733 | |
3734 | if (TYPE_CODE (return_type) == TYPE_CODE_ENUM) | |
3735 | return context_type == NULL || return_type == context_type; | |
3736 | else if (context_type == NULL) | |
3737 | return TYPE_CODE (return_type) != TYPE_CODE_VOID; | |
3738 | else | |
3739 | return TYPE_CODE (return_type) == TYPE_CODE (context_type); | |
3740 | } | |
3741 | ||
3742 | ||
4c4b4cd2 | 3743 | /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the |
14f9c5c9 | 3744 | function (if any) that matches the types of the NARGS arguments in |
4c4b4cd2 PH |
3745 | ARGS. If CONTEXT_TYPE is non-null and there is at least one match |
3746 | that returns that type, then eliminate matches that don't. If | |
3747 | CONTEXT_TYPE is void and there is at least one match that does not | |
3748 | return void, eliminate all matches that do. | |
3749 | ||
14f9c5c9 AS |
3750 | Asks the user if there is more than one match remaining. Returns -1 |
3751 | if there is no such symbol or none is selected. NAME is used | |
4c4b4cd2 PH |
3752 | solely for messages. May re-arrange and modify SYMS in |
3753 | the process; the index returned is for the modified vector. */ | |
14f9c5c9 | 3754 | |
4c4b4cd2 | 3755 | static int |
d12307c1 | 3756 | ada_resolve_function (struct block_symbol syms[], |
4c4b4cd2 PH |
3757 | int nsyms, struct value **args, int nargs, |
3758 | const char *name, struct type *context_type) | |
14f9c5c9 | 3759 | { |
30b15541 | 3760 | int fallback; |
14f9c5c9 | 3761 | int k; |
4c4b4cd2 | 3762 | int m; /* Number of hits */ |
14f9c5c9 | 3763 | |
d2e4a39e | 3764 | m = 0; |
30b15541 UW |
3765 | /* In the first pass of the loop, we only accept functions matching |
3766 | context_type. If none are found, we add a second pass of the loop | |
3767 | where every function is accepted. */ | |
3768 | for (fallback = 0; m == 0 && fallback < 2; fallback++) | |
14f9c5c9 AS |
3769 | { |
3770 | for (k = 0; k < nsyms; k += 1) | |
4c4b4cd2 | 3771 | { |
d12307c1 | 3772 | struct type *type = ada_check_typedef (SYMBOL_TYPE (syms[k].symbol)); |
4c4b4cd2 | 3773 | |
d12307c1 | 3774 | if (ada_args_match (syms[k].symbol, args, nargs) |
30b15541 | 3775 | && (fallback || return_match (type, context_type))) |
4c4b4cd2 PH |
3776 | { |
3777 | syms[m] = syms[k]; | |
3778 | m += 1; | |
3779 | } | |
3780 | } | |
14f9c5c9 AS |
3781 | } |
3782 | ||
dc5c8746 PMR |
3783 | /* If we got multiple matches, ask the user which one to use. Don't do this |
3784 | interactive thing during completion, though, as the purpose of the | |
3785 | completion is providing a list of all possible matches. Prompting the | |
3786 | user to filter it down would be completely unexpected in this case. */ | |
14f9c5c9 AS |
3787 | if (m == 0) |
3788 | return -1; | |
dc5c8746 | 3789 | else if (m > 1 && !parse_completion) |
14f9c5c9 | 3790 | { |
323e0a4a | 3791 | printf_filtered (_("Multiple matches for %s\n"), name); |
4c4b4cd2 | 3792 | user_select_syms (syms, m, 1); |
14f9c5c9 AS |
3793 | return 0; |
3794 | } | |
3795 | return 0; | |
3796 | } | |
3797 | ||
4c4b4cd2 PH |
3798 | /* Returns true (non-zero) iff decoded name N0 should appear before N1 |
3799 | in a listing of choices during disambiguation (see sort_choices, below). | |
3800 | The idea is that overloadings of a subprogram name from the | |
3801 | same package should sort in their source order. We settle for ordering | |
3802 | such symbols by their trailing number (__N or $N). */ | |
3803 | ||
14f9c5c9 | 3804 | static int |
0d5cff50 | 3805 | encoded_ordered_before (const char *N0, const char *N1) |
14f9c5c9 AS |
3806 | { |
3807 | if (N1 == NULL) | |
3808 | return 0; | |
3809 | else if (N0 == NULL) | |
3810 | return 1; | |
3811 | else | |
3812 | { | |
3813 | int k0, k1; | |
5b4ee69b | 3814 | |
d2e4a39e | 3815 | for (k0 = strlen (N0) - 1; k0 > 0 && isdigit (N0[k0]); k0 -= 1) |
4c4b4cd2 | 3816 | ; |
d2e4a39e | 3817 | for (k1 = strlen (N1) - 1; k1 > 0 && isdigit (N1[k1]); k1 -= 1) |
4c4b4cd2 | 3818 | ; |
d2e4a39e | 3819 | if ((N0[k0] == '_' || N0[k0] == '$') && N0[k0 + 1] != '\000' |
4c4b4cd2 PH |
3820 | && (N1[k1] == '_' || N1[k1] == '$') && N1[k1 + 1] != '\000') |
3821 | { | |
3822 | int n0, n1; | |
5b4ee69b | 3823 | |
4c4b4cd2 PH |
3824 | n0 = k0; |
3825 | while (N0[n0] == '_' && n0 > 0 && N0[n0 - 1] == '_') | |
3826 | n0 -= 1; | |
3827 | n1 = k1; | |
3828 | while (N1[n1] == '_' && n1 > 0 && N1[n1 - 1] == '_') | |
3829 | n1 -= 1; | |
3830 | if (n0 == n1 && strncmp (N0, N1, n0) == 0) | |
3831 | return (atoi (N0 + k0 + 1) < atoi (N1 + k1 + 1)); | |
3832 | } | |
14f9c5c9 AS |
3833 | return (strcmp (N0, N1) < 0); |
3834 | } | |
3835 | } | |
d2e4a39e | 3836 | |
4c4b4cd2 PH |
3837 | /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the |
3838 | encoded names. */ | |
3839 | ||
d2e4a39e | 3840 | static void |
d12307c1 | 3841 | sort_choices (struct block_symbol syms[], int nsyms) |
14f9c5c9 | 3842 | { |
4c4b4cd2 | 3843 | int i; |
5b4ee69b | 3844 | |
d2e4a39e | 3845 | for (i = 1; i < nsyms; i += 1) |
14f9c5c9 | 3846 | { |
d12307c1 | 3847 | struct block_symbol sym = syms[i]; |
14f9c5c9 AS |
3848 | int j; |
3849 | ||
d2e4a39e | 3850 | for (j = i - 1; j >= 0; j -= 1) |
4c4b4cd2 | 3851 | { |
d12307c1 PMR |
3852 | if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms[j].symbol), |
3853 | SYMBOL_LINKAGE_NAME (sym.symbol))) | |
4c4b4cd2 PH |
3854 | break; |
3855 | syms[j + 1] = syms[j]; | |
3856 | } | |
d2e4a39e | 3857 | syms[j + 1] = sym; |
14f9c5c9 AS |
3858 | } |
3859 | } | |
3860 | ||
d72413e6 PMR |
3861 | /* Whether GDB should display formals and return types for functions in the |
3862 | overloads selection menu. */ | |
3863 | static int print_signatures = 1; | |
3864 | ||
3865 | /* Print the signature for SYM on STREAM according to the FLAGS options. For | |
3866 | all but functions, the signature is just the name of the symbol. For | |
3867 | functions, this is the name of the function, the list of types for formals | |
3868 | and the return type (if any). */ | |
3869 | ||
3870 | static void | |
3871 | ada_print_symbol_signature (struct ui_file *stream, struct symbol *sym, | |
3872 | const struct type_print_options *flags) | |
3873 | { | |
3874 | struct type *type = SYMBOL_TYPE (sym); | |
3875 | ||
3876 | fprintf_filtered (stream, "%s", SYMBOL_PRINT_NAME (sym)); | |
3877 | if (!print_signatures | |
3878 | || type == NULL | |
3879 | || TYPE_CODE (type) != TYPE_CODE_FUNC) | |
3880 | return; | |
3881 | ||
3882 | if (TYPE_NFIELDS (type) > 0) | |
3883 | { | |
3884 | int i; | |
3885 | ||
3886 | fprintf_filtered (stream, " ("); | |
3887 | for (i = 0; i < TYPE_NFIELDS (type); ++i) | |
3888 | { | |
3889 | if (i > 0) | |
3890 | fprintf_filtered (stream, "; "); | |
3891 | ada_print_type (TYPE_FIELD_TYPE (type, i), NULL, stream, -1, 0, | |
3892 | flags); | |
3893 | } | |
3894 | fprintf_filtered (stream, ")"); | |
3895 | } | |
3896 | if (TYPE_TARGET_TYPE (type) != NULL | |
3897 | && TYPE_CODE (TYPE_TARGET_TYPE (type)) != TYPE_CODE_VOID) | |
3898 | { | |
3899 | fprintf_filtered (stream, " return "); | |
3900 | ada_print_type (TYPE_TARGET_TYPE (type), NULL, stream, -1, 0, flags); | |
3901 | } | |
3902 | } | |
3903 | ||
4c4b4cd2 PH |
3904 | /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0 |
3905 | by asking the user (if necessary), returning the number selected, | |
3906 | and setting the first elements of SYMS items. Error if no symbols | |
3907 | selected. */ | |
14f9c5c9 AS |
3908 | |
3909 | /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought | |
4c4b4cd2 | 3910 | to be re-integrated one of these days. */ |
14f9c5c9 AS |
3911 | |
3912 | int | |
d12307c1 | 3913 | user_select_syms (struct block_symbol *syms, int nsyms, int max_results) |
14f9c5c9 AS |
3914 | { |
3915 | int i; | |
8d749320 | 3916 | int *chosen = XALLOCAVEC (int , nsyms); |
14f9c5c9 AS |
3917 | int n_chosen; |
3918 | int first_choice = (max_results == 1) ? 1 : 2; | |
717d2f5a | 3919 | const char *select_mode = multiple_symbols_select_mode (); |
14f9c5c9 AS |
3920 | |
3921 | if (max_results < 1) | |
323e0a4a | 3922 | error (_("Request to select 0 symbols!")); |
14f9c5c9 AS |
3923 | if (nsyms <= 1) |
3924 | return nsyms; | |
3925 | ||
717d2f5a JB |
3926 | if (select_mode == multiple_symbols_cancel) |
3927 | error (_("\ | |
3928 | canceled because the command is ambiguous\n\ | |
3929 | See set/show multiple-symbol.")); | |
3930 | ||
3931 | /* If select_mode is "all", then return all possible symbols. | |
3932 | Only do that if more than one symbol can be selected, of course. | |
3933 | Otherwise, display the menu as usual. */ | |
3934 | if (select_mode == multiple_symbols_all && max_results > 1) | |
3935 | return nsyms; | |
3936 | ||
323e0a4a | 3937 | printf_unfiltered (_("[0] cancel\n")); |
14f9c5c9 | 3938 | if (max_results > 1) |
323e0a4a | 3939 | printf_unfiltered (_("[1] all\n")); |
14f9c5c9 | 3940 | |
4c4b4cd2 | 3941 | sort_choices (syms, nsyms); |
14f9c5c9 AS |
3942 | |
3943 | for (i = 0; i < nsyms; i += 1) | |
3944 | { | |
d12307c1 | 3945 | if (syms[i].symbol == NULL) |
4c4b4cd2 PH |
3946 | continue; |
3947 | ||
d12307c1 | 3948 | if (SYMBOL_CLASS (syms[i].symbol) == LOC_BLOCK) |
4c4b4cd2 | 3949 | { |
76a01679 | 3950 | struct symtab_and_line sal = |
d12307c1 | 3951 | find_function_start_sal (syms[i].symbol, 1); |
5b4ee69b | 3952 | |
d72413e6 PMR |
3953 | printf_unfiltered ("[%d] ", i + first_choice); |
3954 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3955 | &type_print_raw_options); | |
323e0a4a | 3956 | if (sal.symtab == NULL) |
d72413e6 | 3957 | printf_unfiltered (_(" at <no source file available>:%d\n"), |
323e0a4a AC |
3958 | sal.line); |
3959 | else | |
d72413e6 | 3960 | printf_unfiltered (_(" at %s:%d\n"), |
05cba821 JK |
3961 | symtab_to_filename_for_display (sal.symtab), |
3962 | sal.line); | |
4c4b4cd2 PH |
3963 | continue; |
3964 | } | |
d2e4a39e | 3965 | else |
4c4b4cd2 PH |
3966 | { |
3967 | int is_enumeral = | |
d12307c1 PMR |
3968 | (SYMBOL_CLASS (syms[i].symbol) == LOC_CONST |
3969 | && SYMBOL_TYPE (syms[i].symbol) != NULL | |
3970 | && TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) == TYPE_CODE_ENUM); | |
1994afbf DE |
3971 | struct symtab *symtab = NULL; |
3972 | ||
d12307c1 PMR |
3973 | if (SYMBOL_OBJFILE_OWNED (syms[i].symbol)) |
3974 | symtab = symbol_symtab (syms[i].symbol); | |
4c4b4cd2 | 3975 | |
d12307c1 | 3976 | if (SYMBOL_LINE (syms[i].symbol) != 0 && symtab != NULL) |
d72413e6 PMR |
3977 | { |
3978 | printf_unfiltered ("[%d] ", i + first_choice); | |
3979 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3980 | &type_print_raw_options); | |
3981 | printf_unfiltered (_(" at %s:%d\n"), | |
3982 | symtab_to_filename_for_display (symtab), | |
3983 | SYMBOL_LINE (syms[i].symbol)); | |
3984 | } | |
76a01679 | 3985 | else if (is_enumeral |
d12307c1 | 3986 | && TYPE_NAME (SYMBOL_TYPE (syms[i].symbol)) != NULL) |
4c4b4cd2 | 3987 | { |
a3f17187 | 3988 | printf_unfiltered (("[%d] "), i + first_choice); |
d12307c1 | 3989 | ada_print_type (SYMBOL_TYPE (syms[i].symbol), NULL, |
79d43c61 | 3990 | gdb_stdout, -1, 0, &type_print_raw_options); |
323e0a4a | 3991 | printf_unfiltered (_("'(%s) (enumeral)\n"), |
d12307c1 | 3992 | SYMBOL_PRINT_NAME (syms[i].symbol)); |
4c4b4cd2 | 3993 | } |
d72413e6 PMR |
3994 | else |
3995 | { | |
3996 | printf_unfiltered ("[%d] ", i + first_choice); | |
3997 | ada_print_symbol_signature (gdb_stdout, syms[i].symbol, | |
3998 | &type_print_raw_options); | |
3999 | ||
4000 | if (symtab != NULL) | |
4001 | printf_unfiltered (is_enumeral | |
4002 | ? _(" in %s (enumeral)\n") | |
4003 | : _(" at %s:?\n"), | |
4004 | symtab_to_filename_for_display (symtab)); | |
4005 | else | |
4006 | printf_unfiltered (is_enumeral | |
4007 | ? _(" (enumeral)\n") | |
4008 | : _(" at ?\n")); | |
4009 | } | |
4c4b4cd2 | 4010 | } |
14f9c5c9 | 4011 | } |
d2e4a39e | 4012 | |
14f9c5c9 | 4013 | n_chosen = get_selections (chosen, nsyms, max_results, max_results > 1, |
4c4b4cd2 | 4014 | "overload-choice"); |
14f9c5c9 AS |
4015 | |
4016 | for (i = 0; i < n_chosen; i += 1) | |
4c4b4cd2 | 4017 | syms[i] = syms[chosen[i]]; |
14f9c5c9 AS |
4018 | |
4019 | return n_chosen; | |
4020 | } | |
4021 | ||
4022 | /* Read and validate a set of numeric choices from the user in the | |
4c4b4cd2 | 4023 | range 0 .. N_CHOICES-1. Place the results in increasing |
14f9c5c9 AS |
4024 | order in CHOICES[0 .. N-1], and return N. |
4025 | ||
4026 | The user types choices as a sequence of numbers on one line | |
4027 | separated by blanks, encoding them as follows: | |
4028 | ||
4c4b4cd2 | 4029 | + A choice of 0 means to cancel the selection, throwing an error. |
14f9c5c9 AS |
4030 | + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1. |
4031 | + The user chooses k by typing k+IS_ALL_CHOICE+1. | |
4032 | ||
4c4b4cd2 | 4033 | The user is not allowed to choose more than MAX_RESULTS values. |
14f9c5c9 AS |
4034 | |
4035 | ANNOTATION_SUFFIX, if present, is used to annotate the input | |
4c4b4cd2 | 4036 | prompts (for use with the -f switch). */ |
14f9c5c9 AS |
4037 | |
4038 | int | |
d2e4a39e | 4039 | get_selections (int *choices, int n_choices, int max_results, |
a121b7c1 | 4040 | int is_all_choice, const char *annotation_suffix) |
14f9c5c9 | 4041 | { |
d2e4a39e | 4042 | char *args; |
a121b7c1 | 4043 | const char *prompt; |
14f9c5c9 AS |
4044 | int n_chosen; |
4045 | int first_choice = is_all_choice ? 2 : 1; | |
d2e4a39e | 4046 | |
14f9c5c9 AS |
4047 | prompt = getenv ("PS2"); |
4048 | if (prompt == NULL) | |
0bcd0149 | 4049 | prompt = "> "; |
14f9c5c9 | 4050 | |
0bcd0149 | 4051 | args = command_line_input (prompt, 0, annotation_suffix); |
d2e4a39e | 4052 | |
14f9c5c9 | 4053 | if (args == NULL) |
323e0a4a | 4054 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 AS |
4055 | |
4056 | n_chosen = 0; | |
76a01679 | 4057 | |
4c4b4cd2 PH |
4058 | /* Set choices[0 .. n_chosen-1] to the users' choices in ascending |
4059 | order, as given in args. Choices are validated. */ | |
14f9c5c9 AS |
4060 | while (1) |
4061 | { | |
d2e4a39e | 4062 | char *args2; |
14f9c5c9 AS |
4063 | int choice, j; |
4064 | ||
0fcd72ba | 4065 | args = skip_spaces (args); |
14f9c5c9 | 4066 | if (*args == '\0' && n_chosen == 0) |
323e0a4a | 4067 | error_no_arg (_("one or more choice numbers")); |
14f9c5c9 | 4068 | else if (*args == '\0') |
4c4b4cd2 | 4069 | break; |
14f9c5c9 AS |
4070 | |
4071 | choice = strtol (args, &args2, 10); | |
d2e4a39e | 4072 | if (args == args2 || choice < 0 |
4c4b4cd2 | 4073 | || choice > n_choices + first_choice - 1) |
323e0a4a | 4074 | error (_("Argument must be choice number")); |
14f9c5c9 AS |
4075 | args = args2; |
4076 | ||
d2e4a39e | 4077 | if (choice == 0) |
323e0a4a | 4078 | error (_("cancelled")); |
14f9c5c9 AS |
4079 | |
4080 | if (choice < first_choice) | |
4c4b4cd2 PH |
4081 | { |
4082 | n_chosen = n_choices; | |
4083 | for (j = 0; j < n_choices; j += 1) | |
4084 | choices[j] = j; | |
4085 | break; | |
4086 | } | |
14f9c5c9 AS |
4087 | choice -= first_choice; |
4088 | ||
d2e4a39e | 4089 | for (j = n_chosen - 1; j >= 0 && choice < choices[j]; j -= 1) |
4c4b4cd2 PH |
4090 | { |
4091 | } | |
14f9c5c9 AS |
4092 | |
4093 | if (j < 0 || choice != choices[j]) | |
4c4b4cd2 PH |
4094 | { |
4095 | int k; | |
5b4ee69b | 4096 | |
4c4b4cd2 PH |
4097 | for (k = n_chosen - 1; k > j; k -= 1) |
4098 | choices[k + 1] = choices[k]; | |
4099 | choices[j + 1] = choice; | |
4100 | n_chosen += 1; | |
4101 | } | |
14f9c5c9 AS |
4102 | } |
4103 | ||
4104 | if (n_chosen > max_results) | |
323e0a4a | 4105 | error (_("Select no more than %d of the above"), max_results); |
d2e4a39e | 4106 | |
14f9c5c9 AS |
4107 | return n_chosen; |
4108 | } | |
4109 | ||
4c4b4cd2 PH |
4110 | /* Replace the operator of length OPLEN at position PC in *EXPP with a call |
4111 | on the function identified by SYM and BLOCK, and taking NARGS | |
4112 | arguments. Update *EXPP as needed to hold more space. */ | |
14f9c5c9 AS |
4113 | |
4114 | static void | |
e9d9f57e | 4115 | replace_operator_with_call (expression_up *expp, int pc, int nargs, |
4c4b4cd2 | 4116 | int oplen, struct symbol *sym, |
270140bd | 4117 | const struct block *block) |
14f9c5c9 AS |
4118 | { |
4119 | /* A new expression, with 6 more elements (3 for funcall, 4 for function | |
4c4b4cd2 | 4120 | symbol, -oplen for operator being replaced). */ |
d2e4a39e | 4121 | struct expression *newexp = (struct expression *) |
8c1a34e7 | 4122 | xzalloc (sizeof (struct expression) |
4c4b4cd2 | 4123 | + EXP_ELEM_TO_BYTES ((*expp)->nelts + 7 - oplen)); |
e9d9f57e | 4124 | struct expression *exp = expp->get (); |
14f9c5c9 AS |
4125 | |
4126 | newexp->nelts = exp->nelts + 7 - oplen; | |
4127 | newexp->language_defn = exp->language_defn; | |
3489610d | 4128 | newexp->gdbarch = exp->gdbarch; |
14f9c5c9 | 4129 | memcpy (newexp->elts, exp->elts, EXP_ELEM_TO_BYTES (pc)); |
d2e4a39e | 4130 | memcpy (newexp->elts + pc + 7, exp->elts + pc + oplen, |
4c4b4cd2 | 4131 | EXP_ELEM_TO_BYTES (exp->nelts - pc - oplen)); |
14f9c5c9 AS |
4132 | |
4133 | newexp->elts[pc].opcode = newexp->elts[pc + 2].opcode = OP_FUNCALL; | |
4134 | newexp->elts[pc + 1].longconst = (LONGEST) nargs; | |
4135 | ||
4136 | newexp->elts[pc + 3].opcode = newexp->elts[pc + 6].opcode = OP_VAR_VALUE; | |
4137 | newexp->elts[pc + 4].block = block; | |
4138 | newexp->elts[pc + 5].symbol = sym; | |
4139 | ||
e9d9f57e | 4140 | expp->reset (newexp); |
d2e4a39e | 4141 | } |
14f9c5c9 AS |
4142 | |
4143 | /* Type-class predicates */ | |
4144 | ||
4c4b4cd2 PH |
4145 | /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type), |
4146 | or FLOAT). */ | |
14f9c5c9 AS |
4147 | |
4148 | static int | |
d2e4a39e | 4149 | numeric_type_p (struct type *type) |
14f9c5c9 AS |
4150 | { |
4151 | if (type == NULL) | |
4152 | return 0; | |
d2e4a39e AS |
4153 | else |
4154 | { | |
4155 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4156 | { |
4157 | case TYPE_CODE_INT: | |
4158 | case TYPE_CODE_FLT: | |
4159 | return 1; | |
4160 | case TYPE_CODE_RANGE: | |
4161 | return (type == TYPE_TARGET_TYPE (type) | |
4162 | || numeric_type_p (TYPE_TARGET_TYPE (type))); | |
4163 | default: | |
4164 | return 0; | |
4165 | } | |
d2e4a39e | 4166 | } |
14f9c5c9 AS |
4167 | } |
4168 | ||
4c4b4cd2 | 4169 | /* True iff TYPE is integral (an INT or RANGE of INTs). */ |
14f9c5c9 AS |
4170 | |
4171 | static int | |
d2e4a39e | 4172 | integer_type_p (struct type *type) |
14f9c5c9 AS |
4173 | { |
4174 | if (type == NULL) | |
4175 | return 0; | |
d2e4a39e AS |
4176 | else |
4177 | { | |
4178 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4179 | { |
4180 | case TYPE_CODE_INT: | |
4181 | return 1; | |
4182 | case TYPE_CODE_RANGE: | |
4183 | return (type == TYPE_TARGET_TYPE (type) | |
4184 | || integer_type_p (TYPE_TARGET_TYPE (type))); | |
4185 | default: | |
4186 | return 0; | |
4187 | } | |
d2e4a39e | 4188 | } |
14f9c5c9 AS |
4189 | } |
4190 | ||
4c4b4cd2 | 4191 | /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */ |
14f9c5c9 AS |
4192 | |
4193 | static int | |
d2e4a39e | 4194 | scalar_type_p (struct type *type) |
14f9c5c9 AS |
4195 | { |
4196 | if (type == NULL) | |
4197 | return 0; | |
d2e4a39e AS |
4198 | else |
4199 | { | |
4200 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4201 | { |
4202 | case TYPE_CODE_INT: | |
4203 | case TYPE_CODE_RANGE: | |
4204 | case TYPE_CODE_ENUM: | |
4205 | case TYPE_CODE_FLT: | |
4206 | return 1; | |
4207 | default: | |
4208 | return 0; | |
4209 | } | |
d2e4a39e | 4210 | } |
14f9c5c9 AS |
4211 | } |
4212 | ||
4c4b4cd2 | 4213 | /* True iff TYPE is discrete (INT, RANGE, ENUM). */ |
14f9c5c9 AS |
4214 | |
4215 | static int | |
d2e4a39e | 4216 | discrete_type_p (struct type *type) |
14f9c5c9 AS |
4217 | { |
4218 | if (type == NULL) | |
4219 | return 0; | |
d2e4a39e AS |
4220 | else |
4221 | { | |
4222 | switch (TYPE_CODE (type)) | |
4c4b4cd2 PH |
4223 | { |
4224 | case TYPE_CODE_INT: | |
4225 | case TYPE_CODE_RANGE: | |
4226 | case TYPE_CODE_ENUM: | |
872f0337 | 4227 | case TYPE_CODE_BOOL: |
4c4b4cd2 PH |
4228 | return 1; |
4229 | default: | |
4230 | return 0; | |
4231 | } | |
d2e4a39e | 4232 | } |
14f9c5c9 AS |
4233 | } |
4234 | ||
4c4b4cd2 PH |
4235 | /* Returns non-zero if OP with operands in the vector ARGS could be |
4236 | a user-defined function. Errs on the side of pre-defined operators | |
4237 | (i.e., result 0). */ | |
14f9c5c9 AS |
4238 | |
4239 | static int | |
d2e4a39e | 4240 | possible_user_operator_p (enum exp_opcode op, struct value *args[]) |
14f9c5c9 | 4241 | { |
76a01679 | 4242 | struct type *type0 = |
df407dfe | 4243 | (args[0] == NULL) ? NULL : ada_check_typedef (value_type (args[0])); |
d2e4a39e | 4244 | struct type *type1 = |
df407dfe | 4245 | (args[1] == NULL) ? NULL : ada_check_typedef (value_type (args[1])); |
d2e4a39e | 4246 | |
4c4b4cd2 PH |
4247 | if (type0 == NULL) |
4248 | return 0; | |
4249 | ||
14f9c5c9 AS |
4250 | switch (op) |
4251 | { | |
4252 | default: | |
4253 | return 0; | |
4254 | ||
4255 | case BINOP_ADD: | |
4256 | case BINOP_SUB: | |
4257 | case BINOP_MUL: | |
4258 | case BINOP_DIV: | |
d2e4a39e | 4259 | return (!(numeric_type_p (type0) && numeric_type_p (type1))); |
14f9c5c9 AS |
4260 | |
4261 | case BINOP_REM: | |
4262 | case BINOP_MOD: | |
4263 | case BINOP_BITWISE_AND: | |
4264 | case BINOP_BITWISE_IOR: | |
4265 | case BINOP_BITWISE_XOR: | |
d2e4a39e | 4266 | return (!(integer_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4267 | |
4268 | case BINOP_EQUAL: | |
4269 | case BINOP_NOTEQUAL: | |
4270 | case BINOP_LESS: | |
4271 | case BINOP_GTR: | |
4272 | case BINOP_LEQ: | |
4273 | case BINOP_GEQ: | |
d2e4a39e | 4274 | return (!(scalar_type_p (type0) && scalar_type_p (type1))); |
14f9c5c9 AS |
4275 | |
4276 | case BINOP_CONCAT: | |
ee90b9ab | 4277 | return !ada_is_array_type (type0) || !ada_is_array_type (type1); |
14f9c5c9 AS |
4278 | |
4279 | case BINOP_EXP: | |
d2e4a39e | 4280 | return (!(numeric_type_p (type0) && integer_type_p (type1))); |
14f9c5c9 AS |
4281 | |
4282 | case UNOP_NEG: | |
4283 | case UNOP_PLUS: | |
4284 | case UNOP_LOGICAL_NOT: | |
d2e4a39e AS |
4285 | case UNOP_ABS: |
4286 | return (!numeric_type_p (type0)); | |
14f9c5c9 AS |
4287 | |
4288 | } | |
4289 | } | |
4290 | \f | |
4c4b4cd2 | 4291 | /* Renaming */ |
14f9c5c9 | 4292 | |
aeb5907d JB |
4293 | /* NOTES: |
4294 | ||
4295 | 1. In the following, we assume that a renaming type's name may | |
4296 | have an ___XD suffix. It would be nice if this went away at some | |
4297 | point. | |
4298 | 2. We handle both the (old) purely type-based representation of | |
4299 | renamings and the (new) variable-based encoding. At some point, | |
4300 | it is devoutly to be hoped that the former goes away | |
4301 | (FIXME: hilfinger-2007-07-09). | |
4302 | 3. Subprogram renamings are not implemented, although the XRS | |
4303 | suffix is recognized (FIXME: hilfinger-2007-07-09). */ | |
4304 | ||
4305 | /* If SYM encodes a renaming, | |
4306 | ||
4307 | <renaming> renames <renamed entity>, | |
4308 | ||
4309 | sets *LEN to the length of the renamed entity's name, | |
4310 | *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to | |
4311 | the string describing the subcomponent selected from the renamed | |
0963b4bd | 4312 | entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming |
aeb5907d JB |
4313 | (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR |
4314 | are undefined). Otherwise, returns a value indicating the category | |
4315 | of entity renamed: an object (ADA_OBJECT_RENAMING), exception | |
4316 | (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or | |
4317 | subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the | |
4318 | strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be | |
4319 | deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR | |
4320 | may be NULL, in which case they are not assigned. | |
4321 | ||
4322 | [Currently, however, GCC does not generate subprogram renamings.] */ | |
4323 | ||
4324 | enum ada_renaming_category | |
4325 | ada_parse_renaming (struct symbol *sym, | |
4326 | const char **renamed_entity, int *len, | |
4327 | const char **renaming_expr) | |
4328 | { | |
4329 | enum ada_renaming_category kind; | |
4330 | const char *info; | |
4331 | const char *suffix; | |
4332 | ||
4333 | if (sym == NULL) | |
4334 | return ADA_NOT_RENAMING; | |
4335 | switch (SYMBOL_CLASS (sym)) | |
14f9c5c9 | 4336 | { |
aeb5907d JB |
4337 | default: |
4338 | return ADA_NOT_RENAMING; | |
4339 | case LOC_TYPEDEF: | |
4340 | return parse_old_style_renaming (SYMBOL_TYPE (sym), | |
4341 | renamed_entity, len, renaming_expr); | |
4342 | case LOC_LOCAL: | |
4343 | case LOC_STATIC: | |
4344 | case LOC_COMPUTED: | |
4345 | case LOC_OPTIMIZED_OUT: | |
4346 | info = strstr (SYMBOL_LINKAGE_NAME (sym), "___XR"); | |
4347 | if (info == NULL) | |
4348 | return ADA_NOT_RENAMING; | |
4349 | switch (info[5]) | |
4350 | { | |
4351 | case '_': | |
4352 | kind = ADA_OBJECT_RENAMING; | |
4353 | info += 6; | |
4354 | break; | |
4355 | case 'E': | |
4356 | kind = ADA_EXCEPTION_RENAMING; | |
4357 | info += 7; | |
4358 | break; | |
4359 | case 'P': | |
4360 | kind = ADA_PACKAGE_RENAMING; | |
4361 | info += 7; | |
4362 | break; | |
4363 | case 'S': | |
4364 | kind = ADA_SUBPROGRAM_RENAMING; | |
4365 | info += 7; | |
4366 | break; | |
4367 | default: | |
4368 | return ADA_NOT_RENAMING; | |
4369 | } | |
14f9c5c9 | 4370 | } |
4c4b4cd2 | 4371 | |
aeb5907d JB |
4372 | if (renamed_entity != NULL) |
4373 | *renamed_entity = info; | |
4374 | suffix = strstr (info, "___XE"); | |
4375 | if (suffix == NULL || suffix == info) | |
4376 | return ADA_NOT_RENAMING; | |
4377 | if (len != NULL) | |
4378 | *len = strlen (info) - strlen (suffix); | |
4379 | suffix += 5; | |
4380 | if (renaming_expr != NULL) | |
4381 | *renaming_expr = suffix; | |
4382 | return kind; | |
4383 | } | |
4384 | ||
4385 | /* Assuming TYPE encodes a renaming according to the old encoding in | |
4386 | exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY, | |
4387 | *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns | |
4388 | ADA_NOT_RENAMING otherwise. */ | |
4389 | static enum ada_renaming_category | |
4390 | parse_old_style_renaming (struct type *type, | |
4391 | const char **renamed_entity, int *len, | |
4392 | const char **renaming_expr) | |
4393 | { | |
4394 | enum ada_renaming_category kind; | |
4395 | const char *name; | |
4396 | const char *info; | |
4397 | const char *suffix; | |
14f9c5c9 | 4398 | |
aeb5907d JB |
4399 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
4400 | || TYPE_NFIELDS (type) != 1) | |
4401 | return ADA_NOT_RENAMING; | |
14f9c5c9 | 4402 | |
aeb5907d JB |
4403 | name = type_name_no_tag (type); |
4404 | if (name == NULL) | |
4405 | return ADA_NOT_RENAMING; | |
4406 | ||
4407 | name = strstr (name, "___XR"); | |
4408 | if (name == NULL) | |
4409 | return ADA_NOT_RENAMING; | |
4410 | switch (name[5]) | |
4411 | { | |
4412 | case '\0': | |
4413 | case '_': | |
4414 | kind = ADA_OBJECT_RENAMING; | |
4415 | break; | |
4416 | case 'E': | |
4417 | kind = ADA_EXCEPTION_RENAMING; | |
4418 | break; | |
4419 | case 'P': | |
4420 | kind = ADA_PACKAGE_RENAMING; | |
4421 | break; | |
4422 | case 'S': | |
4423 | kind = ADA_SUBPROGRAM_RENAMING; | |
4424 | break; | |
4425 | default: | |
4426 | return ADA_NOT_RENAMING; | |
4427 | } | |
14f9c5c9 | 4428 | |
aeb5907d JB |
4429 | info = TYPE_FIELD_NAME (type, 0); |
4430 | if (info == NULL) | |
4431 | return ADA_NOT_RENAMING; | |
4432 | if (renamed_entity != NULL) | |
4433 | *renamed_entity = info; | |
4434 | suffix = strstr (info, "___XE"); | |
4435 | if (renaming_expr != NULL) | |
4436 | *renaming_expr = suffix + 5; | |
4437 | if (suffix == NULL || suffix == info) | |
4438 | return ADA_NOT_RENAMING; | |
4439 | if (len != NULL) | |
4440 | *len = suffix - info; | |
4441 | return kind; | |
a5ee536b JB |
4442 | } |
4443 | ||
4444 | /* Compute the value of the given RENAMING_SYM, which is expected to | |
4445 | be a symbol encoding a renaming expression. BLOCK is the block | |
4446 | used to evaluate the renaming. */ | |
52ce6436 | 4447 | |
a5ee536b JB |
4448 | static struct value * |
4449 | ada_read_renaming_var_value (struct symbol *renaming_sym, | |
3977b71f | 4450 | const struct block *block) |
a5ee536b | 4451 | { |
bbc13ae3 | 4452 | const char *sym_name; |
a5ee536b | 4453 | |
bbc13ae3 | 4454 | sym_name = SYMBOL_LINKAGE_NAME (renaming_sym); |
4d01a485 PA |
4455 | expression_up expr = parse_exp_1 (&sym_name, 0, block, 0); |
4456 | return evaluate_expression (expr.get ()); | |
a5ee536b | 4457 | } |
14f9c5c9 | 4458 | \f |
d2e4a39e | 4459 | |
4c4b4cd2 | 4460 | /* Evaluation: Function Calls */ |
14f9c5c9 | 4461 | |
4c4b4cd2 | 4462 | /* Return an lvalue containing the value VAL. This is the identity on |
40bc484c JB |
4463 | lvalues, and otherwise has the side-effect of allocating memory |
4464 | in the inferior where a copy of the value contents is copied. */ | |
14f9c5c9 | 4465 | |
d2e4a39e | 4466 | static struct value * |
40bc484c | 4467 | ensure_lval (struct value *val) |
14f9c5c9 | 4468 | { |
40bc484c JB |
4469 | if (VALUE_LVAL (val) == not_lval |
4470 | || VALUE_LVAL (val) == lval_internalvar) | |
c3e5cd34 | 4471 | { |
df407dfe | 4472 | int len = TYPE_LENGTH (ada_check_typedef (value_type (val))); |
40bc484c JB |
4473 | const CORE_ADDR addr = |
4474 | value_as_long (value_allocate_space_in_inferior (len)); | |
c3e5cd34 | 4475 | |
a84a8a0d | 4476 | VALUE_LVAL (val) = lval_memory; |
1a088441 | 4477 | set_value_address (val, addr); |
40bc484c | 4478 | write_memory (addr, value_contents (val), len); |
c3e5cd34 | 4479 | } |
14f9c5c9 AS |
4480 | |
4481 | return val; | |
4482 | } | |
4483 | ||
4484 | /* Return the value ACTUAL, converted to be an appropriate value for a | |
4485 | formal of type FORMAL_TYPE. Use *SP as a stack pointer for | |
4486 | allocating any necessary descriptors (fat pointers), or copies of | |
4c4b4cd2 | 4487 | values not residing in memory, updating it as needed. */ |
14f9c5c9 | 4488 | |
a93c0eb6 | 4489 | struct value * |
40bc484c | 4490 | ada_convert_actual (struct value *actual, struct type *formal_type0) |
14f9c5c9 | 4491 | { |
df407dfe | 4492 | struct type *actual_type = ada_check_typedef (value_type (actual)); |
61ee279c | 4493 | struct type *formal_type = ada_check_typedef (formal_type0); |
d2e4a39e AS |
4494 | struct type *formal_target = |
4495 | TYPE_CODE (formal_type) == TYPE_CODE_PTR | |
61ee279c | 4496 | ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type)) : formal_type; |
d2e4a39e AS |
4497 | struct type *actual_target = |
4498 | TYPE_CODE (actual_type) == TYPE_CODE_PTR | |
61ee279c | 4499 | ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type)) : actual_type; |
14f9c5c9 | 4500 | |
4c4b4cd2 | 4501 | if (ada_is_array_descriptor_type (formal_target) |
14f9c5c9 | 4502 | && TYPE_CODE (actual_target) == TYPE_CODE_ARRAY) |
40bc484c | 4503 | return make_array_descriptor (formal_type, actual); |
a84a8a0d JB |
4504 | else if (TYPE_CODE (formal_type) == TYPE_CODE_PTR |
4505 | || TYPE_CODE (formal_type) == TYPE_CODE_REF) | |
14f9c5c9 | 4506 | { |
a84a8a0d | 4507 | struct value *result; |
5b4ee69b | 4508 | |
14f9c5c9 | 4509 | if (TYPE_CODE (formal_target) == TYPE_CODE_ARRAY |
4c4b4cd2 | 4510 | && ada_is_array_descriptor_type (actual_target)) |
a84a8a0d | 4511 | result = desc_data (actual); |
cb923fcc | 4512 | else if (TYPE_CODE (formal_type) != TYPE_CODE_PTR) |
4c4b4cd2 PH |
4513 | { |
4514 | if (VALUE_LVAL (actual) != lval_memory) | |
4515 | { | |
4516 | struct value *val; | |
5b4ee69b | 4517 | |
df407dfe | 4518 | actual_type = ada_check_typedef (value_type (actual)); |
4c4b4cd2 | 4519 | val = allocate_value (actual_type); |
990a07ab | 4520 | memcpy ((char *) value_contents_raw (val), |
0fd88904 | 4521 | (char *) value_contents (actual), |
4c4b4cd2 | 4522 | TYPE_LENGTH (actual_type)); |
40bc484c | 4523 | actual = ensure_lval (val); |
4c4b4cd2 | 4524 | } |
a84a8a0d | 4525 | result = value_addr (actual); |
4c4b4cd2 | 4526 | } |
a84a8a0d JB |
4527 | else |
4528 | return actual; | |
b1af9e97 | 4529 | return value_cast_pointers (formal_type, result, 0); |
14f9c5c9 AS |
4530 | } |
4531 | else if (TYPE_CODE (actual_type) == TYPE_CODE_PTR) | |
4532 | return ada_value_ind (actual); | |
8344af1e JB |
4533 | else if (ada_is_aligner_type (formal_type)) |
4534 | { | |
4535 | /* We need to turn this parameter into an aligner type | |
4536 | as well. */ | |
4537 | struct value *aligner = allocate_value (formal_type); | |
4538 | struct value *component = ada_value_struct_elt (aligner, "F", 0); | |
4539 | ||
4540 | value_assign_to_component (aligner, component, actual); | |
4541 | return aligner; | |
4542 | } | |
14f9c5c9 AS |
4543 | |
4544 | return actual; | |
4545 | } | |
4546 | ||
438c98a1 JB |
4547 | /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of |
4548 | type TYPE. This is usually an inefficient no-op except on some targets | |
4549 | (such as AVR) where the representation of a pointer and an address | |
4550 | differs. */ | |
4551 | ||
4552 | static CORE_ADDR | |
4553 | value_pointer (struct value *value, struct type *type) | |
4554 | { | |
4555 | struct gdbarch *gdbarch = get_type_arch (type); | |
4556 | unsigned len = TYPE_LENGTH (type); | |
224c3ddb | 4557 | gdb_byte *buf = (gdb_byte *) alloca (len); |
438c98a1 JB |
4558 | CORE_ADDR addr; |
4559 | ||
4560 | addr = value_address (value); | |
4561 | gdbarch_address_to_pointer (gdbarch, type, buf, addr); | |
4562 | addr = extract_unsigned_integer (buf, len, gdbarch_byte_order (gdbarch)); | |
4563 | return addr; | |
4564 | } | |
4565 | ||
14f9c5c9 | 4566 | |
4c4b4cd2 PH |
4567 | /* Push a descriptor of type TYPE for array value ARR on the stack at |
4568 | *SP, updating *SP to reflect the new descriptor. Return either | |
14f9c5c9 | 4569 | an lvalue representing the new descriptor, or (if TYPE is a pointer- |
4c4b4cd2 PH |
4570 | to-descriptor type rather than a descriptor type), a struct value * |
4571 | representing a pointer to this descriptor. */ | |
14f9c5c9 | 4572 | |
d2e4a39e | 4573 | static struct value * |
40bc484c | 4574 | make_array_descriptor (struct type *type, struct value *arr) |
14f9c5c9 | 4575 | { |
d2e4a39e AS |
4576 | struct type *bounds_type = desc_bounds_type (type); |
4577 | struct type *desc_type = desc_base_type (type); | |
4578 | struct value *descriptor = allocate_value (desc_type); | |
4579 | struct value *bounds = allocate_value (bounds_type); | |
14f9c5c9 | 4580 | int i; |
d2e4a39e | 4581 | |
0963b4bd MS |
4582 | for (i = ada_array_arity (ada_check_typedef (value_type (arr))); |
4583 | i > 0; i -= 1) | |
14f9c5c9 | 4584 | { |
19f220c3 JK |
4585 | modify_field (value_type (bounds), value_contents_writeable (bounds), |
4586 | ada_array_bound (arr, i, 0), | |
4587 | desc_bound_bitpos (bounds_type, i, 0), | |
4588 | desc_bound_bitsize (bounds_type, i, 0)); | |
4589 | modify_field (value_type (bounds), value_contents_writeable (bounds), | |
4590 | ada_array_bound (arr, i, 1), | |
4591 | desc_bound_bitpos (bounds_type, i, 1), | |
4592 | desc_bound_bitsize (bounds_type, i, 1)); | |
14f9c5c9 | 4593 | } |
d2e4a39e | 4594 | |
40bc484c | 4595 | bounds = ensure_lval (bounds); |
d2e4a39e | 4596 | |
19f220c3 JK |
4597 | modify_field (value_type (descriptor), |
4598 | value_contents_writeable (descriptor), | |
4599 | value_pointer (ensure_lval (arr), | |
4600 | TYPE_FIELD_TYPE (desc_type, 0)), | |
4601 | fat_pntr_data_bitpos (desc_type), | |
4602 | fat_pntr_data_bitsize (desc_type)); | |
4603 | ||
4604 | modify_field (value_type (descriptor), | |
4605 | value_contents_writeable (descriptor), | |
4606 | value_pointer (bounds, | |
4607 | TYPE_FIELD_TYPE (desc_type, 1)), | |
4608 | fat_pntr_bounds_bitpos (desc_type), | |
4609 | fat_pntr_bounds_bitsize (desc_type)); | |
14f9c5c9 | 4610 | |
40bc484c | 4611 | descriptor = ensure_lval (descriptor); |
14f9c5c9 AS |
4612 | |
4613 | if (TYPE_CODE (type) == TYPE_CODE_PTR) | |
4614 | return value_addr (descriptor); | |
4615 | else | |
4616 | return descriptor; | |
4617 | } | |
14f9c5c9 | 4618 | \f |
3d9434b5 JB |
4619 | /* Symbol Cache Module */ |
4620 | ||
3d9434b5 | 4621 | /* Performance measurements made as of 2010-01-15 indicate that |
ee01b665 | 4622 | this cache does bring some noticeable improvements. Depending |
3d9434b5 JB |
4623 | on the type of entity being printed, the cache can make it as much |
4624 | as an order of magnitude faster than without it. | |
4625 | ||
4626 | The descriptive type DWARF extension has significantly reduced | |
4627 | the need for this cache, at least when DWARF is being used. However, | |
4628 | even in this case, some expensive name-based symbol searches are still | |
4629 | sometimes necessary - to find an XVZ variable, mostly. */ | |
4630 | ||
ee01b665 | 4631 | /* Initialize the contents of SYM_CACHE. */ |
3d9434b5 | 4632 | |
ee01b665 JB |
4633 | static void |
4634 | ada_init_symbol_cache (struct ada_symbol_cache *sym_cache) | |
4635 | { | |
4636 | obstack_init (&sym_cache->cache_space); | |
4637 | memset (sym_cache->root, '\000', sizeof (sym_cache->root)); | |
4638 | } | |
3d9434b5 | 4639 | |
ee01b665 JB |
4640 | /* Free the memory used by SYM_CACHE. */ |
4641 | ||
4642 | static void | |
4643 | ada_free_symbol_cache (struct ada_symbol_cache *sym_cache) | |
3d9434b5 | 4644 | { |
ee01b665 JB |
4645 | obstack_free (&sym_cache->cache_space, NULL); |
4646 | xfree (sym_cache); | |
4647 | } | |
3d9434b5 | 4648 | |
ee01b665 JB |
4649 | /* Return the symbol cache associated to the given program space PSPACE. |
4650 | If not allocated for this PSPACE yet, allocate and initialize one. */ | |
3d9434b5 | 4651 | |
ee01b665 JB |
4652 | static struct ada_symbol_cache * |
4653 | ada_get_symbol_cache (struct program_space *pspace) | |
4654 | { | |
4655 | struct ada_pspace_data *pspace_data = get_ada_pspace_data (pspace); | |
ee01b665 | 4656 | |
66c168ae | 4657 | if (pspace_data->sym_cache == NULL) |
ee01b665 | 4658 | { |
66c168ae JB |
4659 | pspace_data->sym_cache = XCNEW (struct ada_symbol_cache); |
4660 | ada_init_symbol_cache (pspace_data->sym_cache); | |
ee01b665 JB |
4661 | } |
4662 | ||
66c168ae | 4663 | return pspace_data->sym_cache; |
ee01b665 | 4664 | } |
3d9434b5 JB |
4665 | |
4666 | /* Clear all entries from the symbol cache. */ | |
4667 | ||
4668 | static void | |
4669 | ada_clear_symbol_cache (void) | |
4670 | { | |
ee01b665 JB |
4671 | struct ada_symbol_cache *sym_cache |
4672 | = ada_get_symbol_cache (current_program_space); | |
4673 | ||
4674 | obstack_free (&sym_cache->cache_space, NULL); | |
4675 | ada_init_symbol_cache (sym_cache); | |
3d9434b5 JB |
4676 | } |
4677 | ||
fe978cb0 | 4678 | /* Search our cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4679 | Return it if found, or NULL otherwise. */ |
4680 | ||
4681 | static struct cache_entry ** | |
fe978cb0 | 4682 | find_entry (const char *name, domain_enum domain) |
3d9434b5 | 4683 | { |
ee01b665 JB |
4684 | struct ada_symbol_cache *sym_cache |
4685 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4686 | int h = msymbol_hash (name) % HASH_SIZE; |
4687 | struct cache_entry **e; | |
4688 | ||
ee01b665 | 4689 | for (e = &sym_cache->root[h]; *e != NULL; e = &(*e)->next) |
3d9434b5 | 4690 | { |
fe978cb0 | 4691 | if (domain == (*e)->domain && strcmp (name, (*e)->name) == 0) |
3d9434b5 JB |
4692 | return e; |
4693 | } | |
4694 | return NULL; | |
4695 | } | |
4696 | ||
fe978cb0 | 4697 | /* Search the symbol cache for an entry matching NAME and DOMAIN. |
3d9434b5 JB |
4698 | Return 1 if found, 0 otherwise. |
4699 | ||
4700 | If an entry was found and SYM is not NULL, set *SYM to the entry's | |
4701 | SYM. Same principle for BLOCK if not NULL. */ | |
96d887e8 | 4702 | |
96d887e8 | 4703 | static int |
fe978cb0 | 4704 | lookup_cached_symbol (const char *name, domain_enum domain, |
f0c5f9b2 | 4705 | struct symbol **sym, const struct block **block) |
96d887e8 | 4706 | { |
fe978cb0 | 4707 | struct cache_entry **e = find_entry (name, domain); |
3d9434b5 JB |
4708 | |
4709 | if (e == NULL) | |
4710 | return 0; | |
4711 | if (sym != NULL) | |
4712 | *sym = (*e)->sym; | |
4713 | if (block != NULL) | |
4714 | *block = (*e)->block; | |
4715 | return 1; | |
96d887e8 PH |
4716 | } |
4717 | ||
3d9434b5 | 4718 | /* Assuming that (SYM, BLOCK) is the result of the lookup of NAME |
fe978cb0 | 4719 | in domain DOMAIN, save this result in our symbol cache. */ |
3d9434b5 | 4720 | |
96d887e8 | 4721 | static void |
fe978cb0 | 4722 | cache_symbol (const char *name, domain_enum domain, struct symbol *sym, |
270140bd | 4723 | const struct block *block) |
96d887e8 | 4724 | { |
ee01b665 JB |
4725 | struct ada_symbol_cache *sym_cache |
4726 | = ada_get_symbol_cache (current_program_space); | |
3d9434b5 JB |
4727 | int h; |
4728 | char *copy; | |
4729 | struct cache_entry *e; | |
4730 | ||
1994afbf DE |
4731 | /* Symbols for builtin types don't have a block. |
4732 | For now don't cache such symbols. */ | |
4733 | if (sym != NULL && !SYMBOL_OBJFILE_OWNED (sym)) | |
4734 | return; | |
4735 | ||
3d9434b5 JB |
4736 | /* If the symbol is a local symbol, then do not cache it, as a search |
4737 | for that symbol depends on the context. To determine whether | |
4738 | the symbol is local or not, we check the block where we found it | |
4739 | against the global and static blocks of its associated symtab. */ | |
4740 | if (sym | |
08be3fe3 | 4741 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4742 | GLOBAL_BLOCK) != block |
08be3fe3 | 4743 | && BLOCKVECTOR_BLOCK (SYMTAB_BLOCKVECTOR (symbol_symtab (sym)), |
439247b6 | 4744 | STATIC_BLOCK) != block) |
3d9434b5 JB |
4745 | return; |
4746 | ||
4747 | h = msymbol_hash (name) % HASH_SIZE; | |
ee01b665 JB |
4748 | e = (struct cache_entry *) obstack_alloc (&sym_cache->cache_space, |
4749 | sizeof (*e)); | |
4750 | e->next = sym_cache->root[h]; | |
4751 | sym_cache->root[h] = e; | |
224c3ddb SM |
4752 | e->name = copy |
4753 | = (char *) obstack_alloc (&sym_cache->cache_space, strlen (name) + 1); | |
3d9434b5 JB |
4754 | strcpy (copy, name); |
4755 | e->sym = sym; | |
fe978cb0 | 4756 | e->domain = domain; |
3d9434b5 | 4757 | e->block = block; |
96d887e8 | 4758 | } |
4c4b4cd2 PH |
4759 | \f |
4760 | /* Symbol Lookup */ | |
4761 | ||
b5ec771e PA |
4762 | /* Return the symbol name match type that should be used used when |
4763 | searching for all symbols matching LOOKUP_NAME. | |
c0431670 JB |
4764 | |
4765 | LOOKUP_NAME is expected to be a symbol name after transformation | |
f98b2e33 | 4766 | for Ada lookups. */ |
c0431670 | 4767 | |
b5ec771e PA |
4768 | static symbol_name_match_type |
4769 | name_match_type_from_name (const char *lookup_name) | |
c0431670 | 4770 | { |
b5ec771e PA |
4771 | return (strstr (lookup_name, "__") == NULL |
4772 | ? symbol_name_match_type::WILD | |
4773 | : symbol_name_match_type::FULL); | |
c0431670 JB |
4774 | } |
4775 | ||
4c4b4cd2 PH |
4776 | /* Return the result of a standard (literal, C-like) lookup of NAME in |
4777 | given DOMAIN, visible from lexical block BLOCK. */ | |
4778 | ||
4779 | static struct symbol * | |
4780 | standard_lookup (const char *name, const struct block *block, | |
4781 | domain_enum domain) | |
4782 | { | |
acbd605d | 4783 | /* Initialize it just to avoid a GCC false warning. */ |
d12307c1 | 4784 | struct block_symbol sym = {NULL, NULL}; |
4c4b4cd2 | 4785 | |
d12307c1 PMR |
4786 | if (lookup_cached_symbol (name, domain, &sym.symbol, NULL)) |
4787 | return sym.symbol; | |
2570f2b7 | 4788 | sym = lookup_symbol_in_language (name, block, domain, language_c, 0); |
d12307c1 PMR |
4789 | cache_symbol (name, domain, sym.symbol, sym.block); |
4790 | return sym.symbol; | |
4c4b4cd2 PH |
4791 | } |
4792 | ||
4793 | ||
4794 | /* Non-zero iff there is at least one non-function/non-enumeral symbol | |
4795 | in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions, | |
4796 | since they contend in overloading in the same way. */ | |
4797 | static int | |
d12307c1 | 4798 | is_nonfunction (struct block_symbol syms[], int n) |
4c4b4cd2 PH |
4799 | { |
4800 | int i; | |
4801 | ||
4802 | for (i = 0; i < n; i += 1) | |
d12307c1 PMR |
4803 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_FUNC |
4804 | && (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM | |
4805 | || SYMBOL_CLASS (syms[i].symbol) != LOC_CONST)) | |
14f9c5c9 AS |
4806 | return 1; |
4807 | ||
4808 | return 0; | |
4809 | } | |
4810 | ||
4811 | /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent | |
4c4b4cd2 | 4812 | struct types. Otherwise, they may not. */ |
14f9c5c9 AS |
4813 | |
4814 | static int | |
d2e4a39e | 4815 | equiv_types (struct type *type0, struct type *type1) |
14f9c5c9 | 4816 | { |
d2e4a39e | 4817 | if (type0 == type1) |
14f9c5c9 | 4818 | return 1; |
d2e4a39e | 4819 | if (type0 == NULL || type1 == NULL |
14f9c5c9 AS |
4820 | || TYPE_CODE (type0) != TYPE_CODE (type1)) |
4821 | return 0; | |
d2e4a39e | 4822 | if ((TYPE_CODE (type0) == TYPE_CODE_STRUCT |
14f9c5c9 AS |
4823 | || TYPE_CODE (type0) == TYPE_CODE_ENUM) |
4824 | && ada_type_name (type0) != NULL && ada_type_name (type1) != NULL | |
4c4b4cd2 | 4825 | && strcmp (ada_type_name (type0), ada_type_name (type1)) == 0) |
14f9c5c9 | 4826 | return 1; |
d2e4a39e | 4827 | |
14f9c5c9 AS |
4828 | return 0; |
4829 | } | |
4830 | ||
4831 | /* True iff SYM0 represents the same entity as SYM1, or one that is | |
4c4b4cd2 | 4832 | no more defined than that of SYM1. */ |
14f9c5c9 AS |
4833 | |
4834 | static int | |
d2e4a39e | 4835 | lesseq_defined_than (struct symbol *sym0, struct symbol *sym1) |
14f9c5c9 AS |
4836 | { |
4837 | if (sym0 == sym1) | |
4838 | return 1; | |
176620f1 | 4839 | if (SYMBOL_DOMAIN (sym0) != SYMBOL_DOMAIN (sym1) |
14f9c5c9 AS |
4840 | || SYMBOL_CLASS (sym0) != SYMBOL_CLASS (sym1)) |
4841 | return 0; | |
4842 | ||
d2e4a39e | 4843 | switch (SYMBOL_CLASS (sym0)) |
14f9c5c9 AS |
4844 | { |
4845 | case LOC_UNDEF: | |
4846 | return 1; | |
4847 | case LOC_TYPEDEF: | |
4848 | { | |
4c4b4cd2 PH |
4849 | struct type *type0 = SYMBOL_TYPE (sym0); |
4850 | struct type *type1 = SYMBOL_TYPE (sym1); | |
0d5cff50 DE |
4851 | const char *name0 = SYMBOL_LINKAGE_NAME (sym0); |
4852 | const char *name1 = SYMBOL_LINKAGE_NAME (sym1); | |
4c4b4cd2 | 4853 | int len0 = strlen (name0); |
5b4ee69b | 4854 | |
4c4b4cd2 PH |
4855 | return |
4856 | TYPE_CODE (type0) == TYPE_CODE (type1) | |
4857 | && (equiv_types (type0, type1) | |
4858 | || (len0 < strlen (name1) && strncmp (name0, name1, len0) == 0 | |
61012eef | 4859 | && startswith (name1 + len0, "___XV"))); |
14f9c5c9 AS |
4860 | } |
4861 | case LOC_CONST: | |
4862 | return SYMBOL_VALUE (sym0) == SYMBOL_VALUE (sym1) | |
4c4b4cd2 | 4863 | && equiv_types (SYMBOL_TYPE (sym0), SYMBOL_TYPE (sym1)); |
d2e4a39e AS |
4864 | default: |
4865 | return 0; | |
14f9c5c9 AS |
4866 | } |
4867 | } | |
4868 | ||
d12307c1 | 4869 | /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct block_symbol |
4c4b4cd2 | 4870 | records in OBSTACKP. Do nothing if SYM is a duplicate. */ |
14f9c5c9 AS |
4871 | |
4872 | static void | |
76a01679 JB |
4873 | add_defn_to_vec (struct obstack *obstackp, |
4874 | struct symbol *sym, | |
f0c5f9b2 | 4875 | const struct block *block) |
14f9c5c9 AS |
4876 | { |
4877 | int i; | |
d12307c1 | 4878 | struct block_symbol *prevDefns = defns_collected (obstackp, 0); |
14f9c5c9 | 4879 | |
529cad9c PH |
4880 | /* Do not try to complete stub types, as the debugger is probably |
4881 | already scanning all symbols matching a certain name at the | |
4882 | time when this function is called. Trying to replace the stub | |
4883 | type by its associated full type will cause us to restart a scan | |
4884 | which may lead to an infinite recursion. Instead, the client | |
4885 | collecting the matching symbols will end up collecting several | |
4886 | matches, with at least one of them complete. It can then filter | |
4887 | out the stub ones if needed. */ | |
4888 | ||
4c4b4cd2 PH |
4889 | for (i = num_defns_collected (obstackp) - 1; i >= 0; i -= 1) |
4890 | { | |
d12307c1 | 4891 | if (lesseq_defined_than (sym, prevDefns[i].symbol)) |
4c4b4cd2 | 4892 | return; |
d12307c1 | 4893 | else if (lesseq_defined_than (prevDefns[i].symbol, sym)) |
4c4b4cd2 | 4894 | { |
d12307c1 | 4895 | prevDefns[i].symbol = sym; |
4c4b4cd2 | 4896 | prevDefns[i].block = block; |
4c4b4cd2 | 4897 | return; |
76a01679 | 4898 | } |
4c4b4cd2 PH |
4899 | } |
4900 | ||
4901 | { | |
d12307c1 | 4902 | struct block_symbol info; |
4c4b4cd2 | 4903 | |
d12307c1 | 4904 | info.symbol = sym; |
4c4b4cd2 | 4905 | info.block = block; |
d12307c1 | 4906 | obstack_grow (obstackp, &info, sizeof (struct block_symbol)); |
4c4b4cd2 PH |
4907 | } |
4908 | } | |
4909 | ||
d12307c1 PMR |
4910 | /* Number of block_symbol structures currently collected in current vector in |
4911 | OBSTACKP. */ | |
4c4b4cd2 | 4912 | |
76a01679 JB |
4913 | static int |
4914 | num_defns_collected (struct obstack *obstackp) | |
4c4b4cd2 | 4915 | { |
d12307c1 | 4916 | return obstack_object_size (obstackp) / sizeof (struct block_symbol); |
4c4b4cd2 PH |
4917 | } |
4918 | ||
d12307c1 PMR |
4919 | /* Vector of block_symbol structures currently collected in current vector in |
4920 | OBSTACKP. If FINISH, close off the vector and return its final address. */ | |
4c4b4cd2 | 4921 | |
d12307c1 | 4922 | static struct block_symbol * |
4c4b4cd2 PH |
4923 | defns_collected (struct obstack *obstackp, int finish) |
4924 | { | |
4925 | if (finish) | |
224c3ddb | 4926 | return (struct block_symbol *) obstack_finish (obstackp); |
4c4b4cd2 | 4927 | else |
d12307c1 | 4928 | return (struct block_symbol *) obstack_base (obstackp); |
4c4b4cd2 PH |
4929 | } |
4930 | ||
7c7b6655 TT |
4931 | /* Return a bound minimal symbol matching NAME according to Ada |
4932 | decoding rules. Returns an invalid symbol if there is no such | |
4933 | minimal symbol. Names prefixed with "standard__" are handled | |
4934 | specially: "standard__" is first stripped off, and only static and | |
4935 | global symbols are searched. */ | |
4c4b4cd2 | 4936 | |
7c7b6655 | 4937 | struct bound_minimal_symbol |
96d887e8 | 4938 | ada_lookup_simple_minsym (const char *name) |
4c4b4cd2 | 4939 | { |
7c7b6655 | 4940 | struct bound_minimal_symbol result; |
4c4b4cd2 | 4941 | struct objfile *objfile; |
96d887e8 | 4942 | struct minimal_symbol *msymbol; |
4c4b4cd2 | 4943 | |
7c7b6655 TT |
4944 | memset (&result, 0, sizeof (result)); |
4945 | ||
b5ec771e PA |
4946 | symbol_name_match_type match_type = name_match_type_from_name (name); |
4947 | lookup_name_info lookup_name (name, match_type); | |
4948 | ||
4949 | symbol_name_matcher_ftype *match_name | |
4950 | = ada_get_symbol_name_matcher (lookup_name); | |
4c4b4cd2 | 4951 | |
96d887e8 PH |
4952 | ALL_MSYMBOLS (objfile, msymbol) |
4953 | { | |
b5ec771e | 4954 | if (match_name (MSYMBOL_LINKAGE_NAME (msymbol), lookup_name, NULL) |
96d887e8 | 4955 | && MSYMBOL_TYPE (msymbol) != mst_solib_trampoline) |
7c7b6655 TT |
4956 | { |
4957 | result.minsym = msymbol; | |
4958 | result.objfile = objfile; | |
4959 | break; | |
4960 | } | |
96d887e8 | 4961 | } |
4c4b4cd2 | 4962 | |
7c7b6655 | 4963 | return result; |
96d887e8 | 4964 | } |
4c4b4cd2 | 4965 | |
96d887e8 PH |
4966 | /* For all subprograms that statically enclose the subprogram of the |
4967 | selected frame, add symbols matching identifier NAME in DOMAIN | |
4968 | and their blocks to the list of data in OBSTACKP, as for | |
48b78332 JB |
4969 | ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME |
4970 | with a wildcard prefix. */ | |
4c4b4cd2 | 4971 | |
96d887e8 PH |
4972 | static void |
4973 | add_symbols_from_enclosing_procs (struct obstack *obstackp, | |
b5ec771e PA |
4974 | const lookup_name_info &lookup_name, |
4975 | domain_enum domain) | |
96d887e8 | 4976 | { |
96d887e8 | 4977 | } |
14f9c5c9 | 4978 | |
96d887e8 PH |
4979 | /* True if TYPE is definitely an artificial type supplied to a symbol |
4980 | for which no debugging information was given in the symbol file. */ | |
14f9c5c9 | 4981 | |
96d887e8 PH |
4982 | static int |
4983 | is_nondebugging_type (struct type *type) | |
4984 | { | |
0d5cff50 | 4985 | const char *name = ada_type_name (type); |
5b4ee69b | 4986 | |
96d887e8 PH |
4987 | return (name != NULL && strcmp (name, "<variable, no debug info>") == 0); |
4988 | } | |
4c4b4cd2 | 4989 | |
8f17729f JB |
4990 | /* Return nonzero if TYPE1 and TYPE2 are two enumeration types |
4991 | that are deemed "identical" for practical purposes. | |
4992 | ||
4993 | This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM | |
4994 | types and that their number of enumerals is identical (in other | |
4995 | words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */ | |
4996 | ||
4997 | static int | |
4998 | ada_identical_enum_types_p (struct type *type1, struct type *type2) | |
4999 | { | |
5000 | int i; | |
5001 | ||
5002 | /* The heuristic we use here is fairly conservative. We consider | |
5003 | that 2 enumerate types are identical if they have the same | |
5004 | number of enumerals and that all enumerals have the same | |
5005 | underlying value and name. */ | |
5006 | ||
5007 | /* All enums in the type should have an identical underlying value. */ | |
5008 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
14e75d8e | 5009 | if (TYPE_FIELD_ENUMVAL (type1, i) != TYPE_FIELD_ENUMVAL (type2, i)) |
8f17729f JB |
5010 | return 0; |
5011 | ||
5012 | /* All enumerals should also have the same name (modulo any numerical | |
5013 | suffix). */ | |
5014 | for (i = 0; i < TYPE_NFIELDS (type1); i++) | |
5015 | { | |
0d5cff50 DE |
5016 | const char *name_1 = TYPE_FIELD_NAME (type1, i); |
5017 | const char *name_2 = TYPE_FIELD_NAME (type2, i); | |
8f17729f JB |
5018 | int len_1 = strlen (name_1); |
5019 | int len_2 = strlen (name_2); | |
5020 | ||
5021 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type1, i), &len_1); | |
5022 | ada_remove_trailing_digits (TYPE_FIELD_NAME (type2, i), &len_2); | |
5023 | if (len_1 != len_2 | |
5024 | || strncmp (TYPE_FIELD_NAME (type1, i), | |
5025 | TYPE_FIELD_NAME (type2, i), | |
5026 | len_1) != 0) | |
5027 | return 0; | |
5028 | } | |
5029 | ||
5030 | return 1; | |
5031 | } | |
5032 | ||
5033 | /* Return nonzero if all the symbols in SYMS are all enumeral symbols | |
5034 | that are deemed "identical" for practical purposes. Sometimes, | |
5035 | enumerals are not strictly identical, but their types are so similar | |
5036 | that they can be considered identical. | |
5037 | ||
5038 | For instance, consider the following code: | |
5039 | ||
5040 | type Color is (Black, Red, Green, Blue, White); | |
5041 | type RGB_Color is new Color range Red .. Blue; | |
5042 | ||
5043 | Type RGB_Color is a subrange of an implicit type which is a copy | |
5044 | of type Color. If we call that implicit type RGB_ColorB ("B" is | |
5045 | for "Base Type"), then type RGB_ColorB is a copy of type Color. | |
5046 | As a result, when an expression references any of the enumeral | |
5047 | by name (Eg. "print green"), the expression is technically | |
5048 | ambiguous and the user should be asked to disambiguate. But | |
5049 | doing so would only hinder the user, since it wouldn't matter | |
5050 | what choice he makes, the outcome would always be the same. | |
5051 | So, for practical purposes, we consider them as the same. */ | |
5052 | ||
5053 | static int | |
d12307c1 | 5054 | symbols_are_identical_enums (struct block_symbol *syms, int nsyms) |
8f17729f JB |
5055 | { |
5056 | int i; | |
5057 | ||
5058 | /* Before performing a thorough comparison check of each type, | |
5059 | we perform a series of inexpensive checks. We expect that these | |
5060 | checks will quickly fail in the vast majority of cases, and thus | |
5061 | help prevent the unnecessary use of a more expensive comparison. | |
5062 | Said comparison also expects us to make some of these checks | |
5063 | (see ada_identical_enum_types_p). */ | |
5064 | ||
5065 | /* Quick check: All symbols should have an enum type. */ | |
5066 | for (i = 0; i < nsyms; i++) | |
d12307c1 | 5067 | if (TYPE_CODE (SYMBOL_TYPE (syms[i].symbol)) != TYPE_CODE_ENUM) |
8f17729f JB |
5068 | return 0; |
5069 | ||
5070 | /* Quick check: They should all have the same value. */ | |
5071 | for (i = 1; i < nsyms; i++) | |
d12307c1 | 5072 | if (SYMBOL_VALUE (syms[i].symbol) != SYMBOL_VALUE (syms[0].symbol)) |
8f17729f JB |
5073 | return 0; |
5074 | ||
5075 | /* Quick check: They should all have the same number of enumerals. */ | |
5076 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
5077 | if (TYPE_NFIELDS (SYMBOL_TYPE (syms[i].symbol)) |
5078 | != TYPE_NFIELDS (SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
5079 | return 0; |
5080 | ||
5081 | /* All the sanity checks passed, so we might have a set of | |
5082 | identical enumeration types. Perform a more complete | |
5083 | comparison of the type of each symbol. */ | |
5084 | for (i = 1; i < nsyms; i++) | |
d12307c1 PMR |
5085 | if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms[i].symbol), |
5086 | SYMBOL_TYPE (syms[0].symbol))) | |
8f17729f JB |
5087 | return 0; |
5088 | ||
5089 | return 1; | |
5090 | } | |
5091 | ||
96d887e8 PH |
5092 | /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely |
5093 | duplicate other symbols in the list (The only case I know of where | |
5094 | this happens is when object files containing stabs-in-ecoff are | |
5095 | linked with files containing ordinary ecoff debugging symbols (or no | |
5096 | debugging symbols)). Modifies SYMS to squeeze out deleted entries. | |
5097 | Returns the number of items in the modified list. */ | |
4c4b4cd2 | 5098 | |
96d887e8 | 5099 | static int |
d12307c1 | 5100 | remove_extra_symbols (struct block_symbol *syms, int nsyms) |
96d887e8 PH |
5101 | { |
5102 | int i, j; | |
4c4b4cd2 | 5103 | |
8f17729f JB |
5104 | /* We should never be called with less than 2 symbols, as there |
5105 | cannot be any extra symbol in that case. But it's easy to | |
5106 | handle, since we have nothing to do in that case. */ | |
5107 | if (nsyms < 2) | |
5108 | return nsyms; | |
5109 | ||
96d887e8 PH |
5110 | i = 0; |
5111 | while (i < nsyms) | |
5112 | { | |
a35ddb44 | 5113 | int remove_p = 0; |
339c13b6 JB |
5114 | |
5115 | /* If two symbols have the same name and one of them is a stub type, | |
5116 | the get rid of the stub. */ | |
5117 | ||
d12307c1 PMR |
5118 | if (TYPE_STUB (SYMBOL_TYPE (syms[i].symbol)) |
5119 | && SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL) | |
339c13b6 JB |
5120 | { |
5121 | for (j = 0; j < nsyms; j++) | |
5122 | { | |
5123 | if (j != i | |
d12307c1 PMR |
5124 | && !TYPE_STUB (SYMBOL_TYPE (syms[j].symbol)) |
5125 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL | |
5126 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
5127 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0) | |
a35ddb44 | 5128 | remove_p = 1; |
339c13b6 JB |
5129 | } |
5130 | } | |
5131 | ||
5132 | /* Two symbols with the same name, same class and same address | |
5133 | should be identical. */ | |
5134 | ||
d12307c1 PMR |
5135 | else if (SYMBOL_LINKAGE_NAME (syms[i].symbol) != NULL |
5136 | && SYMBOL_CLASS (syms[i].symbol) == LOC_STATIC | |
5137 | && is_nondebugging_type (SYMBOL_TYPE (syms[i].symbol))) | |
96d887e8 PH |
5138 | { |
5139 | for (j = 0; j < nsyms; j += 1) | |
5140 | { | |
5141 | if (i != j | |
d12307c1 PMR |
5142 | && SYMBOL_LINKAGE_NAME (syms[j].symbol) != NULL |
5143 | && strcmp (SYMBOL_LINKAGE_NAME (syms[i].symbol), | |
5144 | SYMBOL_LINKAGE_NAME (syms[j].symbol)) == 0 | |
5145 | && SYMBOL_CLASS (syms[i].symbol) | |
5146 | == SYMBOL_CLASS (syms[j].symbol) | |
5147 | && SYMBOL_VALUE_ADDRESS (syms[i].symbol) | |
5148 | == SYMBOL_VALUE_ADDRESS (syms[j].symbol)) | |
a35ddb44 | 5149 | remove_p = 1; |
4c4b4cd2 | 5150 | } |
4c4b4cd2 | 5151 | } |
339c13b6 | 5152 | |
a35ddb44 | 5153 | if (remove_p) |
339c13b6 JB |
5154 | { |
5155 | for (j = i + 1; j < nsyms; j += 1) | |
5156 | syms[j - 1] = syms[j]; | |
5157 | nsyms -= 1; | |
5158 | } | |
5159 | ||
96d887e8 | 5160 | i += 1; |
14f9c5c9 | 5161 | } |
8f17729f JB |
5162 | |
5163 | /* If all the remaining symbols are identical enumerals, then | |
5164 | just keep the first one and discard the rest. | |
5165 | ||
5166 | Unlike what we did previously, we do not discard any entry | |
5167 | unless they are ALL identical. This is because the symbol | |
5168 | comparison is not a strict comparison, but rather a practical | |
5169 | comparison. If all symbols are considered identical, then | |
5170 | we can just go ahead and use the first one and discard the rest. | |
5171 | But if we cannot reduce the list to a single element, we have | |
5172 | to ask the user to disambiguate anyways. And if we have to | |
5173 | present a multiple-choice menu, it's less confusing if the list | |
5174 | isn't missing some choices that were identical and yet distinct. */ | |
5175 | if (symbols_are_identical_enums (syms, nsyms)) | |
5176 | nsyms = 1; | |
5177 | ||
96d887e8 | 5178 | return nsyms; |
14f9c5c9 AS |
5179 | } |
5180 | ||
96d887e8 PH |
5181 | /* Given a type that corresponds to a renaming entity, use the type name |
5182 | to extract the scope (package name or function name, fully qualified, | |
5183 | and following the GNAT encoding convention) where this renaming has been | |
5184 | defined. The string returned needs to be deallocated after use. */ | |
4c4b4cd2 | 5185 | |
96d887e8 PH |
5186 | static char * |
5187 | xget_renaming_scope (struct type *renaming_type) | |
14f9c5c9 | 5188 | { |
96d887e8 | 5189 | /* The renaming types adhere to the following convention: |
0963b4bd | 5190 | <scope>__<rename>___<XR extension>. |
96d887e8 PH |
5191 | So, to extract the scope, we search for the "___XR" extension, |
5192 | and then backtrack until we find the first "__". */ | |
76a01679 | 5193 | |
96d887e8 | 5194 | const char *name = type_name_no_tag (renaming_type); |
108d56a4 SM |
5195 | const char *suffix = strstr (name, "___XR"); |
5196 | const char *last; | |
96d887e8 PH |
5197 | int scope_len; |
5198 | char *scope; | |
14f9c5c9 | 5199 | |
96d887e8 PH |
5200 | /* Now, backtrack a bit until we find the first "__". Start looking |
5201 | at suffix - 3, as the <rename> part is at least one character long. */ | |
14f9c5c9 | 5202 | |
96d887e8 PH |
5203 | for (last = suffix - 3; last > name; last--) |
5204 | if (last[0] == '_' && last[1] == '_') | |
5205 | break; | |
76a01679 | 5206 | |
96d887e8 | 5207 | /* Make a copy of scope and return it. */ |
14f9c5c9 | 5208 | |
96d887e8 PH |
5209 | scope_len = last - name; |
5210 | scope = (char *) xmalloc ((scope_len + 1) * sizeof (char)); | |
14f9c5c9 | 5211 | |
96d887e8 PH |
5212 | strncpy (scope, name, scope_len); |
5213 | scope[scope_len] = '\0'; | |
4c4b4cd2 | 5214 | |
96d887e8 | 5215 | return scope; |
4c4b4cd2 PH |
5216 | } |
5217 | ||
96d887e8 | 5218 | /* Return nonzero if NAME corresponds to a package name. */ |
4c4b4cd2 | 5219 | |
96d887e8 PH |
5220 | static int |
5221 | is_package_name (const char *name) | |
4c4b4cd2 | 5222 | { |
96d887e8 PH |
5223 | /* Here, We take advantage of the fact that no symbols are generated |
5224 | for packages, while symbols are generated for each function. | |
5225 | So the condition for NAME represent a package becomes equivalent | |
5226 | to NAME not existing in our list of symbols. There is only one | |
5227 | small complication with library-level functions (see below). */ | |
4c4b4cd2 | 5228 | |
96d887e8 | 5229 | char *fun_name; |
76a01679 | 5230 | |
96d887e8 PH |
5231 | /* If it is a function that has not been defined at library level, |
5232 | then we should be able to look it up in the symbols. */ | |
5233 | if (standard_lookup (name, NULL, VAR_DOMAIN) != NULL) | |
5234 | return 0; | |
14f9c5c9 | 5235 | |
96d887e8 PH |
5236 | /* Library-level function names start with "_ada_". See if function |
5237 | "_ada_" followed by NAME can be found. */ | |
14f9c5c9 | 5238 | |
96d887e8 | 5239 | /* Do a quick check that NAME does not contain "__", since library-level |
e1d5a0d2 | 5240 | functions names cannot contain "__" in them. */ |
96d887e8 PH |
5241 | if (strstr (name, "__") != NULL) |
5242 | return 0; | |
4c4b4cd2 | 5243 | |
b435e160 | 5244 | fun_name = xstrprintf ("_ada_%s", name); |
14f9c5c9 | 5245 | |
96d887e8 PH |
5246 | return (standard_lookup (fun_name, NULL, VAR_DOMAIN) == NULL); |
5247 | } | |
14f9c5c9 | 5248 | |
96d887e8 | 5249 | /* Return nonzero if SYM corresponds to a renaming entity that is |
aeb5907d | 5250 | not visible from FUNCTION_NAME. */ |
14f9c5c9 | 5251 | |
96d887e8 | 5252 | static int |
0d5cff50 | 5253 | old_renaming_is_invisible (const struct symbol *sym, const char *function_name) |
96d887e8 | 5254 | { |
aeb5907d | 5255 | char *scope; |
1509e573 | 5256 | struct cleanup *old_chain; |
aeb5907d JB |
5257 | |
5258 | if (SYMBOL_CLASS (sym) != LOC_TYPEDEF) | |
5259 | return 0; | |
5260 | ||
5261 | scope = xget_renaming_scope (SYMBOL_TYPE (sym)); | |
1509e573 | 5262 | old_chain = make_cleanup (xfree, scope); |
14f9c5c9 | 5263 | |
96d887e8 PH |
5264 | /* If the rename has been defined in a package, then it is visible. */ |
5265 | if (is_package_name (scope)) | |
1509e573 JB |
5266 | { |
5267 | do_cleanups (old_chain); | |
5268 | return 0; | |
5269 | } | |
14f9c5c9 | 5270 | |
96d887e8 PH |
5271 | /* Check that the rename is in the current function scope by checking |
5272 | that its name starts with SCOPE. */ | |
76a01679 | 5273 | |
96d887e8 PH |
5274 | /* If the function name starts with "_ada_", it means that it is |
5275 | a library-level function. Strip this prefix before doing the | |
5276 | comparison, as the encoding for the renaming does not contain | |
5277 | this prefix. */ | |
61012eef | 5278 | if (startswith (function_name, "_ada_")) |
96d887e8 | 5279 | function_name += 5; |
f26caa11 | 5280 | |
1509e573 | 5281 | { |
61012eef | 5282 | int is_invisible = !startswith (function_name, scope); |
1509e573 JB |
5283 | |
5284 | do_cleanups (old_chain); | |
5285 | return is_invisible; | |
5286 | } | |
f26caa11 PH |
5287 | } |
5288 | ||
aeb5907d JB |
5289 | /* Remove entries from SYMS that corresponds to a renaming entity that |
5290 | is not visible from the function associated with CURRENT_BLOCK or | |
5291 | that is superfluous due to the presence of more specific renaming | |
5292 | information. Places surviving symbols in the initial entries of | |
5293 | SYMS and returns the number of surviving symbols. | |
96d887e8 PH |
5294 | |
5295 | Rationale: | |
aeb5907d JB |
5296 | First, in cases where an object renaming is implemented as a |
5297 | reference variable, GNAT may produce both the actual reference | |
5298 | variable and the renaming encoding. In this case, we discard the | |
5299 | latter. | |
5300 | ||
5301 | Second, GNAT emits a type following a specified encoding for each renaming | |
96d887e8 PH |
5302 | entity. Unfortunately, STABS currently does not support the definition |
5303 | of types that are local to a given lexical block, so all renamings types | |
5304 | are emitted at library level. As a consequence, if an application | |
5305 | contains two renaming entities using the same name, and a user tries to | |
5306 | print the value of one of these entities, the result of the ada symbol | |
5307 | lookup will also contain the wrong renaming type. | |
f26caa11 | 5308 | |
96d887e8 PH |
5309 | This function partially covers for this limitation by attempting to |
5310 | remove from the SYMS list renaming symbols that should be visible | |
5311 | from CURRENT_BLOCK. However, there does not seem be a 100% reliable | |
5312 | method with the current information available. The implementation | |
5313 | below has a couple of limitations (FIXME: brobecker-2003-05-12): | |
5314 | ||
5315 | - When the user tries to print a rename in a function while there | |
5316 | is another rename entity defined in a package: Normally, the | |
5317 | rename in the function has precedence over the rename in the | |
5318 | package, so the latter should be removed from the list. This is | |
5319 | currently not the case. | |
5320 | ||
5321 | - This function will incorrectly remove valid renames if | |
5322 | the CURRENT_BLOCK corresponds to a function which symbol name | |
5323 | has been changed by an "Export" pragma. As a consequence, | |
5324 | the user will be unable to print such rename entities. */ | |
4c4b4cd2 | 5325 | |
14f9c5c9 | 5326 | static int |
d12307c1 | 5327 | remove_irrelevant_renamings (struct block_symbol *syms, |
aeb5907d | 5328 | int nsyms, const struct block *current_block) |
4c4b4cd2 PH |
5329 | { |
5330 | struct symbol *current_function; | |
0d5cff50 | 5331 | const char *current_function_name; |
4c4b4cd2 | 5332 | int i; |
aeb5907d JB |
5333 | int is_new_style_renaming; |
5334 | ||
5335 | /* If there is both a renaming foo___XR... encoded as a variable and | |
5336 | a simple variable foo in the same block, discard the latter. | |
0963b4bd | 5337 | First, zero out such symbols, then compress. */ |
aeb5907d JB |
5338 | is_new_style_renaming = 0; |
5339 | for (i = 0; i < nsyms; i += 1) | |
5340 | { | |
d12307c1 | 5341 | struct symbol *sym = syms[i].symbol; |
270140bd | 5342 | const struct block *block = syms[i].block; |
aeb5907d JB |
5343 | const char *name; |
5344 | const char *suffix; | |
5345 | ||
5346 | if (sym == NULL || SYMBOL_CLASS (sym) == LOC_TYPEDEF) | |
5347 | continue; | |
5348 | name = SYMBOL_LINKAGE_NAME (sym); | |
5349 | suffix = strstr (name, "___XR"); | |
5350 | ||
5351 | if (suffix != NULL) | |
5352 | { | |
5353 | int name_len = suffix - name; | |
5354 | int j; | |
5b4ee69b | 5355 | |
aeb5907d JB |
5356 | is_new_style_renaming = 1; |
5357 | for (j = 0; j < nsyms; j += 1) | |
d12307c1 PMR |
5358 | if (i != j && syms[j].symbol != NULL |
5359 | && strncmp (name, SYMBOL_LINKAGE_NAME (syms[j].symbol), | |
aeb5907d JB |
5360 | name_len) == 0 |
5361 | && block == syms[j].block) | |
d12307c1 | 5362 | syms[j].symbol = NULL; |
aeb5907d JB |
5363 | } |
5364 | } | |
5365 | if (is_new_style_renaming) | |
5366 | { | |
5367 | int j, k; | |
5368 | ||
5369 | for (j = k = 0; j < nsyms; j += 1) | |
d12307c1 | 5370 | if (syms[j].symbol != NULL) |
aeb5907d JB |
5371 | { |
5372 | syms[k] = syms[j]; | |
5373 | k += 1; | |
5374 | } | |
5375 | return k; | |
5376 | } | |
4c4b4cd2 PH |
5377 | |
5378 | /* Extract the function name associated to CURRENT_BLOCK. | |
5379 | Abort if unable to do so. */ | |
76a01679 | 5380 | |
4c4b4cd2 PH |
5381 | if (current_block == NULL) |
5382 | return nsyms; | |
76a01679 | 5383 | |
7f0df278 | 5384 | current_function = block_linkage_function (current_block); |
4c4b4cd2 PH |
5385 | if (current_function == NULL) |
5386 | return nsyms; | |
5387 | ||
5388 | current_function_name = SYMBOL_LINKAGE_NAME (current_function); | |
5389 | if (current_function_name == NULL) | |
5390 | return nsyms; | |
5391 | ||
5392 | /* Check each of the symbols, and remove it from the list if it is | |
5393 | a type corresponding to a renaming that is out of the scope of | |
5394 | the current block. */ | |
5395 | ||
5396 | i = 0; | |
5397 | while (i < nsyms) | |
5398 | { | |
d12307c1 | 5399 | if (ada_parse_renaming (syms[i].symbol, NULL, NULL, NULL) |
aeb5907d | 5400 | == ADA_OBJECT_RENAMING |
d12307c1 | 5401 | && old_renaming_is_invisible (syms[i].symbol, current_function_name)) |
4c4b4cd2 PH |
5402 | { |
5403 | int j; | |
5b4ee69b | 5404 | |
aeb5907d | 5405 | for (j = i + 1; j < nsyms; j += 1) |
76a01679 | 5406 | syms[j - 1] = syms[j]; |
4c4b4cd2 PH |
5407 | nsyms -= 1; |
5408 | } | |
5409 | else | |
5410 | i += 1; | |
5411 | } | |
5412 | ||
5413 | return nsyms; | |
5414 | } | |
5415 | ||
339c13b6 JB |
5416 | /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks) |
5417 | whose name and domain match NAME and DOMAIN respectively. | |
5418 | If no match was found, then extend the search to "enclosing" | |
5419 | routines (in other words, if we're inside a nested function, | |
5420 | search the symbols defined inside the enclosing functions). | |
d0a8ab18 JB |
5421 | If WILD_MATCH_P is nonzero, perform the naming matching in |
5422 | "wild" mode (see function "wild_match" for more info). | |
339c13b6 JB |
5423 | |
5424 | Note: This function assumes that OBSTACKP has 0 (zero) element in it. */ | |
5425 | ||
5426 | static void | |
b5ec771e PA |
5427 | ada_add_local_symbols (struct obstack *obstackp, |
5428 | const lookup_name_info &lookup_name, | |
5429 | const struct block *block, domain_enum domain) | |
339c13b6 JB |
5430 | { |
5431 | int block_depth = 0; | |
5432 | ||
5433 | while (block != NULL) | |
5434 | { | |
5435 | block_depth += 1; | |
b5ec771e | 5436 | ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL); |
339c13b6 JB |
5437 | |
5438 | /* If we found a non-function match, assume that's the one. */ | |
5439 | if (is_nonfunction (defns_collected (obstackp, 0), | |
5440 | num_defns_collected (obstackp))) | |
5441 | return; | |
5442 | ||
5443 | block = BLOCK_SUPERBLOCK (block); | |
5444 | } | |
5445 | ||
5446 | /* If no luck so far, try to find NAME as a local symbol in some lexically | |
5447 | enclosing subprogram. */ | |
5448 | if (num_defns_collected (obstackp) == 0 && block_depth > 2) | |
b5ec771e | 5449 | add_symbols_from_enclosing_procs (obstackp, lookup_name, domain); |
339c13b6 JB |
5450 | } |
5451 | ||
ccefe4c4 | 5452 | /* An object of this type is used as the user_data argument when |
40658b94 | 5453 | calling the map_matching_symbols method. */ |
ccefe4c4 | 5454 | |
40658b94 | 5455 | struct match_data |
ccefe4c4 | 5456 | { |
40658b94 | 5457 | struct objfile *objfile; |
ccefe4c4 | 5458 | struct obstack *obstackp; |
40658b94 PH |
5459 | struct symbol *arg_sym; |
5460 | int found_sym; | |
ccefe4c4 TT |
5461 | }; |
5462 | ||
22cee43f | 5463 | /* A callback for add_nonlocal_symbols that adds SYM, found in BLOCK, |
40658b94 PH |
5464 | to a list of symbols. DATA0 is a pointer to a struct match_data * |
5465 | containing the obstack that collects the symbol list, the file that SYM | |
5466 | must come from, a flag indicating whether a non-argument symbol has | |
5467 | been found in the current block, and the last argument symbol | |
5468 | passed in SYM within the current block (if any). When SYM is null, | |
5469 | marking the end of a block, the argument symbol is added if no | |
5470 | other has been found. */ | |
ccefe4c4 | 5471 | |
40658b94 PH |
5472 | static int |
5473 | aux_add_nonlocal_symbols (struct block *block, struct symbol *sym, void *data0) | |
ccefe4c4 | 5474 | { |
40658b94 PH |
5475 | struct match_data *data = (struct match_data *) data0; |
5476 | ||
5477 | if (sym == NULL) | |
5478 | { | |
5479 | if (!data->found_sym && data->arg_sym != NULL) | |
5480 | add_defn_to_vec (data->obstackp, | |
5481 | fixup_symbol_section (data->arg_sym, data->objfile), | |
5482 | block); | |
5483 | data->found_sym = 0; | |
5484 | data->arg_sym = NULL; | |
5485 | } | |
5486 | else | |
5487 | { | |
5488 | if (SYMBOL_CLASS (sym) == LOC_UNRESOLVED) | |
5489 | return 0; | |
5490 | else if (SYMBOL_IS_ARGUMENT (sym)) | |
5491 | data->arg_sym = sym; | |
5492 | else | |
5493 | { | |
5494 | data->found_sym = 1; | |
5495 | add_defn_to_vec (data->obstackp, | |
5496 | fixup_symbol_section (sym, data->objfile), | |
5497 | block); | |
5498 | } | |
5499 | } | |
5500 | return 0; | |
5501 | } | |
5502 | ||
b5ec771e PA |
5503 | /* Helper for add_nonlocal_symbols. Find symbols in DOMAIN which are |
5504 | targeted by renamings matching LOOKUP_NAME in BLOCK. Add these | |
5505 | symbols to OBSTACKP. Return whether we found such symbols. */ | |
22cee43f PMR |
5506 | |
5507 | static int | |
5508 | ada_add_block_renamings (struct obstack *obstackp, | |
5509 | const struct block *block, | |
b5ec771e PA |
5510 | const lookup_name_info &lookup_name, |
5511 | domain_enum domain) | |
22cee43f PMR |
5512 | { |
5513 | struct using_direct *renaming; | |
5514 | int defns_mark = num_defns_collected (obstackp); | |
5515 | ||
b5ec771e PA |
5516 | symbol_name_matcher_ftype *name_match |
5517 | = ada_get_symbol_name_matcher (lookup_name); | |
5518 | ||
22cee43f PMR |
5519 | for (renaming = block_using (block); |
5520 | renaming != NULL; | |
5521 | renaming = renaming->next) | |
5522 | { | |
5523 | const char *r_name; | |
22cee43f PMR |
5524 | |
5525 | /* Avoid infinite recursions: skip this renaming if we are actually | |
5526 | already traversing it. | |
5527 | ||
5528 | Currently, symbol lookup in Ada don't use the namespace machinery from | |
5529 | C++/Fortran support: skip namespace imports that use them. */ | |
5530 | if (renaming->searched | |
5531 | || (renaming->import_src != NULL | |
5532 | && renaming->import_src[0] != '\0') | |
5533 | || (renaming->import_dest != NULL | |
5534 | && renaming->import_dest[0] != '\0')) | |
5535 | continue; | |
5536 | renaming->searched = 1; | |
5537 | ||
5538 | /* TODO: here, we perform another name-based symbol lookup, which can | |
5539 | pull its own multiple overloads. In theory, we should be able to do | |
5540 | better in this case since, in DWARF, DW_AT_import is a DIE reference, | |
5541 | not a simple name. But in order to do this, we would need to enhance | |
5542 | the DWARF reader to associate a symbol to this renaming, instead of a | |
5543 | name. So, for now, we do something simpler: re-use the C++/Fortran | |
5544 | namespace machinery. */ | |
5545 | r_name = (renaming->alias != NULL | |
5546 | ? renaming->alias | |
5547 | : renaming->declaration); | |
b5ec771e PA |
5548 | if (name_match (r_name, lookup_name, NULL)) |
5549 | { | |
5550 | lookup_name_info decl_lookup_name (renaming->declaration, | |
5551 | lookup_name.match_type ()); | |
5552 | ada_add_all_symbols (obstackp, block, decl_lookup_name, domain, | |
5553 | 1, NULL); | |
5554 | } | |
22cee43f PMR |
5555 | renaming->searched = 0; |
5556 | } | |
5557 | return num_defns_collected (obstackp) != defns_mark; | |
5558 | } | |
5559 | ||
db230ce3 JB |
5560 | /* Implements compare_names, but only applying the comparision using |
5561 | the given CASING. */ | |
5b4ee69b | 5562 | |
40658b94 | 5563 | static int |
db230ce3 JB |
5564 | compare_names_with_case (const char *string1, const char *string2, |
5565 | enum case_sensitivity casing) | |
40658b94 PH |
5566 | { |
5567 | while (*string1 != '\0' && *string2 != '\0') | |
5568 | { | |
db230ce3 JB |
5569 | char c1, c2; |
5570 | ||
40658b94 PH |
5571 | if (isspace (*string1) || isspace (*string2)) |
5572 | return strcmp_iw_ordered (string1, string2); | |
db230ce3 JB |
5573 | |
5574 | if (casing == case_sensitive_off) | |
5575 | { | |
5576 | c1 = tolower (*string1); | |
5577 | c2 = tolower (*string2); | |
5578 | } | |
5579 | else | |
5580 | { | |
5581 | c1 = *string1; | |
5582 | c2 = *string2; | |
5583 | } | |
5584 | if (c1 != c2) | |
40658b94 | 5585 | break; |
db230ce3 | 5586 | |
40658b94 PH |
5587 | string1 += 1; |
5588 | string2 += 1; | |
5589 | } | |
db230ce3 | 5590 | |
40658b94 PH |
5591 | switch (*string1) |
5592 | { | |
5593 | case '(': | |
5594 | return strcmp_iw_ordered (string1, string2); | |
5595 | case '_': | |
5596 | if (*string2 == '\0') | |
5597 | { | |
052874e8 | 5598 | if (is_name_suffix (string1)) |
40658b94 PH |
5599 | return 0; |
5600 | else | |
1a1d5513 | 5601 | return 1; |
40658b94 | 5602 | } |
dbb8534f | 5603 | /* FALLTHROUGH */ |
40658b94 PH |
5604 | default: |
5605 | if (*string2 == '(') | |
5606 | return strcmp_iw_ordered (string1, string2); | |
5607 | else | |
db230ce3 JB |
5608 | { |
5609 | if (casing == case_sensitive_off) | |
5610 | return tolower (*string1) - tolower (*string2); | |
5611 | else | |
5612 | return *string1 - *string2; | |
5613 | } | |
40658b94 | 5614 | } |
ccefe4c4 TT |
5615 | } |
5616 | ||
db230ce3 JB |
5617 | /* Compare STRING1 to STRING2, with results as for strcmp. |
5618 | Compatible with strcmp_iw_ordered in that... | |
5619 | ||
5620 | strcmp_iw_ordered (STRING1, STRING2) <= 0 | |
5621 | ||
5622 | ... implies... | |
5623 | ||
5624 | compare_names (STRING1, STRING2) <= 0 | |
5625 | ||
5626 | (they may differ as to what symbols compare equal). */ | |
5627 | ||
5628 | static int | |
5629 | compare_names (const char *string1, const char *string2) | |
5630 | { | |
5631 | int result; | |
5632 | ||
5633 | /* Similar to what strcmp_iw_ordered does, we need to perform | |
5634 | a case-insensitive comparison first, and only resort to | |
5635 | a second, case-sensitive, comparison if the first one was | |
5636 | not sufficient to differentiate the two strings. */ | |
5637 | ||
5638 | result = compare_names_with_case (string1, string2, case_sensitive_off); | |
5639 | if (result == 0) | |
5640 | result = compare_names_with_case (string1, string2, case_sensitive_on); | |
5641 | ||
5642 | return result; | |
5643 | } | |
5644 | ||
b5ec771e PA |
5645 | /* Convenience function to get at the Ada encoded lookup name for |
5646 | LOOKUP_NAME, as a C string. */ | |
5647 | ||
5648 | static const char * | |
5649 | ada_lookup_name (const lookup_name_info &lookup_name) | |
5650 | { | |
5651 | return lookup_name.ada ().lookup_name ().c_str (); | |
5652 | } | |
5653 | ||
339c13b6 | 5654 | /* Add to OBSTACKP all non-local symbols whose name and domain match |
b5ec771e PA |
5655 | LOOKUP_NAME and DOMAIN respectively. The search is performed on |
5656 | GLOBAL_BLOCK symbols if GLOBAL is non-zero, or on STATIC_BLOCK | |
5657 | symbols otherwise. */ | |
339c13b6 JB |
5658 | |
5659 | static void | |
b5ec771e PA |
5660 | add_nonlocal_symbols (struct obstack *obstackp, |
5661 | const lookup_name_info &lookup_name, | |
5662 | domain_enum domain, int global) | |
339c13b6 JB |
5663 | { |
5664 | struct objfile *objfile; | |
22cee43f | 5665 | struct compunit_symtab *cu; |
40658b94 | 5666 | struct match_data data; |
339c13b6 | 5667 | |
6475f2fe | 5668 | memset (&data, 0, sizeof data); |
ccefe4c4 | 5669 | data.obstackp = obstackp; |
339c13b6 | 5670 | |
b5ec771e PA |
5671 | bool is_wild_match = lookup_name.ada ().wild_match_p (); |
5672 | ||
ccefe4c4 | 5673 | ALL_OBJFILES (objfile) |
40658b94 PH |
5674 | { |
5675 | data.objfile = objfile; | |
5676 | ||
5677 | if (is_wild_match) | |
b5ec771e PA |
5678 | objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (), |
5679 | domain, global, | |
4186eb54 | 5680 | aux_add_nonlocal_symbols, &data, |
b5ec771e PA |
5681 | symbol_name_match_type::WILD, |
5682 | NULL); | |
40658b94 | 5683 | else |
b5ec771e PA |
5684 | objfile->sf->qf->map_matching_symbols (objfile, lookup_name.name ().c_str (), |
5685 | domain, global, | |
4186eb54 | 5686 | aux_add_nonlocal_symbols, &data, |
b5ec771e PA |
5687 | symbol_name_match_type::FULL, |
5688 | compare_names); | |
22cee43f PMR |
5689 | |
5690 | ALL_OBJFILE_COMPUNITS (objfile, cu) | |
5691 | { | |
5692 | const struct block *global_block | |
5693 | = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (cu), GLOBAL_BLOCK); | |
5694 | ||
b5ec771e PA |
5695 | if (ada_add_block_renamings (obstackp, global_block, lookup_name, |
5696 | domain)) | |
22cee43f PMR |
5697 | data.found_sym = 1; |
5698 | } | |
40658b94 PH |
5699 | } |
5700 | ||
5701 | if (num_defns_collected (obstackp) == 0 && global && !is_wild_match) | |
5702 | { | |
b5ec771e PA |
5703 | const char *name = ada_lookup_name (lookup_name); |
5704 | std::string name1 = std::string ("<_ada_") + name + '>'; | |
5705 | ||
40658b94 PH |
5706 | ALL_OBJFILES (objfile) |
5707 | { | |
40658b94 | 5708 | data.objfile = objfile; |
b5ec771e PA |
5709 | objfile->sf->qf->map_matching_symbols (objfile, name1.c_str (), |
5710 | domain, global, | |
0963b4bd MS |
5711 | aux_add_nonlocal_symbols, |
5712 | &data, | |
b5ec771e PA |
5713 | symbol_name_match_type::FULL, |
5714 | compare_names); | |
40658b94 PH |
5715 | } |
5716 | } | |
339c13b6 JB |
5717 | } |
5718 | ||
b5ec771e PA |
5719 | /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if |
5720 | FULL_SEARCH is non-zero, enclosing scope and in global scopes, | |
5721 | returning the number of matches. Add these to OBSTACKP. | |
4eeaa230 | 5722 | |
22cee43f PMR |
5723 | When FULL_SEARCH is non-zero, any non-function/non-enumeral |
5724 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
4c4b4cd2 | 5725 | is the one match returned (no other matches in that or |
d9680e73 | 5726 | enclosing blocks is returned). If there are any matches in or |
22cee43f | 5727 | surrounding BLOCK, then these alone are returned. |
4eeaa230 | 5728 | |
b5ec771e PA |
5729 | Names prefixed with "standard__" are handled specially: |
5730 | "standard__" is first stripped off (by the lookup_name | |
5731 | constructor), and only static and global symbols are searched. | |
14f9c5c9 | 5732 | |
22cee43f PMR |
5733 | If MADE_GLOBAL_LOOKUP_P is non-null, set it before return to whether we had |
5734 | to lookup global symbols. */ | |
5735 | ||
5736 | static void | |
5737 | ada_add_all_symbols (struct obstack *obstackp, | |
5738 | const struct block *block, | |
b5ec771e | 5739 | const lookup_name_info &lookup_name, |
22cee43f PMR |
5740 | domain_enum domain, |
5741 | int full_search, | |
5742 | int *made_global_lookup_p) | |
14f9c5c9 AS |
5743 | { |
5744 | struct symbol *sym; | |
14f9c5c9 | 5745 | |
22cee43f PMR |
5746 | if (made_global_lookup_p) |
5747 | *made_global_lookup_p = 0; | |
339c13b6 JB |
5748 | |
5749 | /* Special case: If the user specifies a symbol name inside package | |
5750 | Standard, do a non-wild matching of the symbol name without | |
5751 | the "standard__" prefix. This was primarily introduced in order | |
5752 | to allow the user to specifically access the standard exceptions | |
5753 | using, for instance, Standard.Constraint_Error when Constraint_Error | |
5754 | is ambiguous (due to the user defining its own Constraint_Error | |
5755 | entity inside its program). */ | |
b5ec771e PA |
5756 | if (lookup_name.ada ().standard_p ()) |
5757 | block = NULL; | |
4c4b4cd2 | 5758 | |
339c13b6 | 5759 | /* Check the non-global symbols. If we have ANY match, then we're done. */ |
14f9c5c9 | 5760 | |
4eeaa230 DE |
5761 | if (block != NULL) |
5762 | { | |
5763 | if (full_search) | |
b5ec771e | 5764 | ada_add_local_symbols (obstackp, lookup_name, block, domain); |
4eeaa230 DE |
5765 | else |
5766 | { | |
5767 | /* In the !full_search case we're are being called by | |
5768 | ada_iterate_over_symbols, and we don't want to search | |
5769 | superblocks. */ | |
b5ec771e | 5770 | ada_add_block_symbols (obstackp, block, lookup_name, domain, NULL); |
4eeaa230 | 5771 | } |
22cee43f PMR |
5772 | if (num_defns_collected (obstackp) > 0 || !full_search) |
5773 | return; | |
4eeaa230 | 5774 | } |
d2e4a39e | 5775 | |
339c13b6 JB |
5776 | /* No non-global symbols found. Check our cache to see if we have |
5777 | already performed this search before. If we have, then return | |
5778 | the same result. */ | |
5779 | ||
b5ec771e PA |
5780 | if (lookup_cached_symbol (ada_lookup_name (lookup_name), |
5781 | domain, &sym, &block)) | |
4c4b4cd2 PH |
5782 | { |
5783 | if (sym != NULL) | |
b5ec771e | 5784 | add_defn_to_vec (obstackp, sym, block); |
22cee43f | 5785 | return; |
4c4b4cd2 | 5786 | } |
14f9c5c9 | 5787 | |
22cee43f PMR |
5788 | if (made_global_lookup_p) |
5789 | *made_global_lookup_p = 1; | |
b1eedac9 | 5790 | |
339c13b6 JB |
5791 | /* Search symbols from all global blocks. */ |
5792 | ||
b5ec771e | 5793 | add_nonlocal_symbols (obstackp, lookup_name, domain, 1); |
d2e4a39e | 5794 | |
4c4b4cd2 | 5795 | /* Now add symbols from all per-file blocks if we've gotten no hits |
339c13b6 | 5796 | (not strictly correct, but perhaps better than an error). */ |
d2e4a39e | 5797 | |
22cee43f | 5798 | if (num_defns_collected (obstackp) == 0) |
b5ec771e | 5799 | add_nonlocal_symbols (obstackp, lookup_name, domain, 0); |
22cee43f PMR |
5800 | } |
5801 | ||
b5ec771e PA |
5802 | /* Find symbols in DOMAIN matching LOOKUP_NAME, in BLOCK and, if FULL_SEARCH |
5803 | is non-zero, enclosing scope and in global scopes, returning the number of | |
22cee43f | 5804 | matches. |
ec6a20c2 | 5805 | Sets *RESULTS to point to a newly allocated vector of (SYM,BLOCK) tuples, |
22cee43f | 5806 | indicating the symbols found and the blocks and symbol tables (if |
ec6a20c2 JB |
5807 | any) in which they were found. This vector should be freed when |
5808 | no longer useful. | |
22cee43f PMR |
5809 | |
5810 | When full_search is non-zero, any non-function/non-enumeral | |
5811 | symbol match within the nest of blocks whose innermost member is BLOCK, | |
5812 | is the one match returned (no other matches in that or | |
5813 | enclosing blocks is returned). If there are any matches in or | |
5814 | surrounding BLOCK, then these alone are returned. | |
5815 | ||
5816 | Names prefixed with "standard__" are handled specially: "standard__" | |
5817 | is first stripped off, and only static and global symbols are searched. */ | |
5818 | ||
5819 | static int | |
b5ec771e PA |
5820 | ada_lookup_symbol_list_worker (const lookup_name_info &lookup_name, |
5821 | const struct block *block, | |
22cee43f PMR |
5822 | domain_enum domain, |
5823 | struct block_symbol **results, | |
5824 | int full_search) | |
5825 | { | |
22cee43f PMR |
5826 | int syms_from_global_search; |
5827 | int ndefns; | |
ec6a20c2 JB |
5828 | int results_size; |
5829 | auto_obstack obstack; | |
22cee43f | 5830 | |
ec6a20c2 | 5831 | ada_add_all_symbols (&obstack, block, lookup_name, |
b5ec771e | 5832 | domain, full_search, &syms_from_global_search); |
14f9c5c9 | 5833 | |
ec6a20c2 JB |
5834 | ndefns = num_defns_collected (&obstack); |
5835 | ||
5836 | results_size = obstack_object_size (&obstack); | |
5837 | *results = (struct block_symbol *) malloc (results_size); | |
5838 | memcpy (*results, defns_collected (&obstack, 1), results_size); | |
4c4b4cd2 PH |
5839 | |
5840 | ndefns = remove_extra_symbols (*results, ndefns); | |
5841 | ||
b1eedac9 | 5842 | if (ndefns == 0 && full_search && syms_from_global_search) |
b5ec771e | 5843 | cache_symbol (ada_lookup_name (lookup_name), domain, NULL, NULL); |
14f9c5c9 | 5844 | |
b1eedac9 | 5845 | if (ndefns == 1 && full_search && syms_from_global_search) |
b5ec771e PA |
5846 | cache_symbol (ada_lookup_name (lookup_name), domain, |
5847 | (*results)[0].symbol, (*results)[0].block); | |
14f9c5c9 | 5848 | |
22cee43f | 5849 | ndefns = remove_irrelevant_renamings (*results, ndefns, block); |
ec6a20c2 | 5850 | |
14f9c5c9 AS |
5851 | return ndefns; |
5852 | } | |
5853 | ||
b5ec771e | 5854 | /* Find symbols in DOMAIN matching NAME, in BLOCK and enclosing scope and |
4eeaa230 | 5855 | in global scopes, returning the number of matches, and setting *RESULTS |
ec6a20c2 JB |
5856 | to a newly-allocated vector of (SYM,BLOCK) tuples. This newly-allocated |
5857 | vector should be freed when no longer useful. | |
5858 | ||
4eeaa230 DE |
5859 | See ada_lookup_symbol_list_worker for further details. */ |
5860 | ||
5861 | int | |
b5ec771e | 5862 | ada_lookup_symbol_list (const char *name, const struct block *block, |
d12307c1 | 5863 | domain_enum domain, struct block_symbol **results) |
4eeaa230 | 5864 | { |
b5ec771e PA |
5865 | symbol_name_match_type name_match_type = name_match_type_from_name (name); |
5866 | lookup_name_info lookup_name (name, name_match_type); | |
5867 | ||
5868 | return ada_lookup_symbol_list_worker (lookup_name, block, domain, results, 1); | |
4eeaa230 DE |
5869 | } |
5870 | ||
5871 | /* Implementation of the la_iterate_over_symbols method. */ | |
5872 | ||
5873 | static void | |
14bc53a8 | 5874 | ada_iterate_over_symbols |
b5ec771e PA |
5875 | (const struct block *block, const lookup_name_info &name, |
5876 | domain_enum domain, | |
14bc53a8 | 5877 | gdb::function_view<symbol_found_callback_ftype> callback) |
4eeaa230 DE |
5878 | { |
5879 | int ndefs, i; | |
d12307c1 | 5880 | struct block_symbol *results; |
ec6a20c2 | 5881 | struct cleanup *old_chain; |
4eeaa230 DE |
5882 | |
5883 | ndefs = ada_lookup_symbol_list_worker (name, block, domain, &results, 0); | |
ec6a20c2 JB |
5884 | old_chain = make_cleanup (xfree, results); |
5885 | ||
4eeaa230 DE |
5886 | for (i = 0; i < ndefs; ++i) |
5887 | { | |
14bc53a8 | 5888 | if (!callback (results[i].symbol)) |
4eeaa230 DE |
5889 | break; |
5890 | } | |
ec6a20c2 JB |
5891 | |
5892 | do_cleanups (old_chain); | |
4eeaa230 DE |
5893 | } |
5894 | ||
4e5c77fe JB |
5895 | /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set |
5896 | to 1, but choosing the first symbol found if there are multiple | |
5897 | choices. | |
5898 | ||
5e2336be JB |
5899 | The result is stored in *INFO, which must be non-NULL. |
5900 | If no match is found, INFO->SYM is set to NULL. */ | |
4e5c77fe JB |
5901 | |
5902 | void | |
5903 | ada_lookup_encoded_symbol (const char *name, const struct block *block, | |
fe978cb0 | 5904 | domain_enum domain, |
d12307c1 | 5905 | struct block_symbol *info) |
14f9c5c9 | 5906 | { |
b5ec771e PA |
5907 | /* Since we already have an encoded name, wrap it in '<>' to force a |
5908 | verbatim match. Otherwise, if the name happens to not look like | |
5909 | an encoded name (because it doesn't include a "__"), | |
5910 | ada_lookup_name_info would re-encode/fold it again, and that | |
5911 | would e.g., incorrectly lowercase object renaming names like | |
5912 | "R28b" -> "r28b". */ | |
5913 | std::string verbatim = std::string ("<") + name + '>'; | |
5914 | ||
5e2336be | 5915 | gdb_assert (info != NULL); |
f98fc17b | 5916 | *info = ada_lookup_symbol (verbatim.c_str (), block, domain, NULL); |
4e5c77fe | 5917 | } |
aeb5907d JB |
5918 | |
5919 | /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing | |
5920 | scope and in global scopes, or NULL if none. NAME is folded and | |
5921 | encoded first. Otherwise, the result is as for ada_lookup_symbol_list, | |
0963b4bd | 5922 | choosing the first symbol if there are multiple choices. |
4e5c77fe JB |
5923 | If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */ |
5924 | ||
d12307c1 | 5925 | struct block_symbol |
aeb5907d | 5926 | ada_lookup_symbol (const char *name, const struct block *block0, |
fe978cb0 | 5927 | domain_enum domain, int *is_a_field_of_this) |
aeb5907d JB |
5928 | { |
5929 | if (is_a_field_of_this != NULL) | |
5930 | *is_a_field_of_this = 0; | |
5931 | ||
f98fc17b PA |
5932 | struct block_symbol *candidates; |
5933 | int n_candidates; | |
5934 | struct cleanup *old_chain; | |
5935 | ||
5936 | n_candidates = ada_lookup_symbol_list (name, block0, domain, &candidates); | |
5937 | old_chain = make_cleanup (xfree, candidates); | |
5938 | ||
5939 | if (n_candidates == 0) | |
5940 | { | |
5941 | do_cleanups (old_chain); | |
5942 | return {}; | |
5943 | } | |
5944 | ||
5945 | block_symbol info = candidates[0]; | |
5946 | info.symbol = fixup_symbol_section (info.symbol, NULL); | |
5947 | ||
5948 | do_cleanups (old_chain); | |
5949 | ||
d12307c1 | 5950 | return info; |
4c4b4cd2 | 5951 | } |
14f9c5c9 | 5952 | |
d12307c1 | 5953 | static struct block_symbol |
f606139a DE |
5954 | ada_lookup_symbol_nonlocal (const struct language_defn *langdef, |
5955 | const char *name, | |
76a01679 | 5956 | const struct block *block, |
21b556f4 | 5957 | const domain_enum domain) |
4c4b4cd2 | 5958 | { |
d12307c1 | 5959 | struct block_symbol sym; |
04dccad0 JB |
5960 | |
5961 | sym = ada_lookup_symbol (name, block_static_block (block), domain, NULL); | |
d12307c1 | 5962 | if (sym.symbol != NULL) |
04dccad0 JB |
5963 | return sym; |
5964 | ||
5965 | /* If we haven't found a match at this point, try the primitive | |
5966 | types. In other languages, this search is performed before | |
5967 | searching for global symbols in order to short-circuit that | |
5968 | global-symbol search if it happens that the name corresponds | |
5969 | to a primitive type. But we cannot do the same in Ada, because | |
5970 | it is perfectly legitimate for a program to declare a type which | |
5971 | has the same name as a standard type. If looking up a type in | |
5972 | that situation, we have traditionally ignored the primitive type | |
5973 | in favor of user-defined types. This is why, unlike most other | |
5974 | languages, we search the primitive types this late and only after | |
5975 | having searched the global symbols without success. */ | |
5976 | ||
5977 | if (domain == VAR_DOMAIN) | |
5978 | { | |
5979 | struct gdbarch *gdbarch; | |
5980 | ||
5981 | if (block == NULL) | |
5982 | gdbarch = target_gdbarch (); | |
5983 | else | |
5984 | gdbarch = block_gdbarch (block); | |
d12307c1 PMR |
5985 | sym.symbol = language_lookup_primitive_type_as_symbol (langdef, gdbarch, name); |
5986 | if (sym.symbol != NULL) | |
04dccad0 JB |
5987 | return sym; |
5988 | } | |
5989 | ||
d12307c1 | 5990 | return (struct block_symbol) {NULL, NULL}; |
14f9c5c9 AS |
5991 | } |
5992 | ||
5993 | ||
4c4b4cd2 PH |
5994 | /* True iff STR is a possible encoded suffix of a normal Ada name |
5995 | that is to be ignored for matching purposes. Suffixes of parallel | |
5996 | names (e.g., XVE) are not included here. Currently, the possible suffixes | |
5823c3ef | 5997 | are given by any of the regular expressions: |
4c4b4cd2 | 5998 | |
babe1480 JB |
5999 | [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux] |
6000 | ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX] | |
9ac7f98e | 6001 | TKB [subprogram suffix for task bodies] |
babe1480 | 6002 | _E[0-9]+[bs]$ [protected object entry suffixes] |
61ee279c | 6003 | (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$ |
babe1480 JB |
6004 | |
6005 | Also, any leading "__[0-9]+" sequence is skipped before the suffix | |
6006 | match is performed. This sequence is used to differentiate homonyms, | |
6007 | is an optional part of a valid name suffix. */ | |
4c4b4cd2 | 6008 | |
14f9c5c9 | 6009 | static int |
d2e4a39e | 6010 | is_name_suffix (const char *str) |
14f9c5c9 AS |
6011 | { |
6012 | int k; | |
4c4b4cd2 PH |
6013 | const char *matching; |
6014 | const int len = strlen (str); | |
6015 | ||
babe1480 JB |
6016 | /* Skip optional leading __[0-9]+. */ |
6017 | ||
4c4b4cd2 PH |
6018 | if (len > 3 && str[0] == '_' && str[1] == '_' && isdigit (str[2])) |
6019 | { | |
babe1480 JB |
6020 | str += 3; |
6021 | while (isdigit (str[0])) | |
6022 | str += 1; | |
4c4b4cd2 | 6023 | } |
babe1480 JB |
6024 | |
6025 | /* [.$][0-9]+ */ | |
4c4b4cd2 | 6026 | |
babe1480 | 6027 | if (str[0] == '.' || str[0] == '$') |
4c4b4cd2 | 6028 | { |
babe1480 | 6029 | matching = str + 1; |
4c4b4cd2 PH |
6030 | while (isdigit (matching[0])) |
6031 | matching += 1; | |
6032 | if (matching[0] == '\0') | |
6033 | return 1; | |
6034 | } | |
6035 | ||
6036 | /* ___[0-9]+ */ | |
babe1480 | 6037 | |
4c4b4cd2 PH |
6038 | if (len > 3 && str[0] == '_' && str[1] == '_' && str[2] == '_') |
6039 | { | |
6040 | matching = str + 3; | |
6041 | while (isdigit (matching[0])) | |
6042 | matching += 1; | |
6043 | if (matching[0] == '\0') | |
6044 | return 1; | |
6045 | } | |
6046 | ||
9ac7f98e JB |
6047 | /* "TKB" suffixes are used for subprograms implementing task bodies. */ |
6048 | ||
6049 | if (strcmp (str, "TKB") == 0) | |
6050 | return 1; | |
6051 | ||
529cad9c PH |
6052 | #if 0 |
6053 | /* FIXME: brobecker/2005-09-23: Protected Object subprograms end | |
0963b4bd MS |
6054 | with a N at the end. Unfortunately, the compiler uses the same |
6055 | convention for other internal types it creates. So treating | |
529cad9c | 6056 | all entity names that end with an "N" as a name suffix causes |
0963b4bd MS |
6057 | some regressions. For instance, consider the case of an enumerated |
6058 | type. To support the 'Image attribute, it creates an array whose | |
529cad9c PH |
6059 | name ends with N. |
6060 | Having a single character like this as a suffix carrying some | |
0963b4bd | 6061 | information is a bit risky. Perhaps we should change the encoding |
529cad9c PH |
6062 | to be something like "_N" instead. In the meantime, do not do |
6063 | the following check. */ | |
6064 | /* Protected Object Subprograms */ | |
6065 | if (len == 1 && str [0] == 'N') | |
6066 | return 1; | |
6067 | #endif | |
6068 | ||
6069 | /* _E[0-9]+[bs]$ */ | |
6070 | if (len > 3 && str[0] == '_' && str [1] == 'E' && isdigit (str[2])) | |
6071 | { | |
6072 | matching = str + 3; | |
6073 | while (isdigit (matching[0])) | |
6074 | matching += 1; | |
6075 | if ((matching[0] == 'b' || matching[0] == 's') | |
6076 | && matching [1] == '\0') | |
6077 | return 1; | |
6078 | } | |
6079 | ||
4c4b4cd2 PH |
6080 | /* ??? We should not modify STR directly, as we are doing below. This |
6081 | is fine in this case, but may become problematic later if we find | |
6082 | that this alternative did not work, and want to try matching | |
6083 | another one from the begining of STR. Since we modified it, we | |
6084 | won't be able to find the begining of the string anymore! */ | |
14f9c5c9 AS |
6085 | if (str[0] == 'X') |
6086 | { | |
6087 | str += 1; | |
d2e4a39e | 6088 | while (str[0] != '_' && str[0] != '\0') |
4c4b4cd2 PH |
6089 | { |
6090 | if (str[0] != 'n' && str[0] != 'b') | |
6091 | return 0; | |
6092 | str += 1; | |
6093 | } | |
14f9c5c9 | 6094 | } |
babe1480 | 6095 | |
14f9c5c9 AS |
6096 | if (str[0] == '\000') |
6097 | return 1; | |
babe1480 | 6098 | |
d2e4a39e | 6099 | if (str[0] == '_') |
14f9c5c9 AS |
6100 | { |
6101 | if (str[1] != '_' || str[2] == '\000') | |
4c4b4cd2 | 6102 | return 0; |
d2e4a39e | 6103 | if (str[2] == '_') |
4c4b4cd2 | 6104 | { |
61ee279c PH |
6105 | if (strcmp (str + 3, "JM") == 0) |
6106 | return 1; | |
6107 | /* FIXME: brobecker/2004-09-30: GNAT will soon stop using | |
6108 | the LJM suffix in favor of the JM one. But we will | |
6109 | still accept LJM as a valid suffix for a reasonable | |
6110 | amount of time, just to allow ourselves to debug programs | |
6111 | compiled using an older version of GNAT. */ | |
4c4b4cd2 PH |
6112 | if (strcmp (str + 3, "LJM") == 0) |
6113 | return 1; | |
6114 | if (str[3] != 'X') | |
6115 | return 0; | |
1265e4aa JB |
6116 | if (str[4] == 'F' || str[4] == 'D' || str[4] == 'B' |
6117 | || str[4] == 'U' || str[4] == 'P') | |
4c4b4cd2 PH |
6118 | return 1; |
6119 | if (str[4] == 'R' && str[5] != 'T') | |
6120 | return 1; | |
6121 | return 0; | |
6122 | } | |
6123 | if (!isdigit (str[2])) | |
6124 | return 0; | |
6125 | for (k = 3; str[k] != '\0'; k += 1) | |
6126 | if (!isdigit (str[k]) && str[k] != '_') | |
6127 | return 0; | |
14f9c5c9 AS |
6128 | return 1; |
6129 | } | |
4c4b4cd2 | 6130 | if (str[0] == '$' && isdigit (str[1])) |
14f9c5c9 | 6131 | { |
4c4b4cd2 PH |
6132 | for (k = 2; str[k] != '\0'; k += 1) |
6133 | if (!isdigit (str[k]) && str[k] != '_') | |
6134 | return 0; | |
14f9c5c9 AS |
6135 | return 1; |
6136 | } | |
6137 | return 0; | |
6138 | } | |
d2e4a39e | 6139 | |
aeb5907d JB |
6140 | /* Return non-zero if the string starting at NAME and ending before |
6141 | NAME_END contains no capital letters. */ | |
529cad9c PH |
6142 | |
6143 | static int | |
6144 | is_valid_name_for_wild_match (const char *name0) | |
6145 | { | |
6146 | const char *decoded_name = ada_decode (name0); | |
6147 | int i; | |
6148 | ||
5823c3ef JB |
6149 | /* If the decoded name starts with an angle bracket, it means that |
6150 | NAME0 does not follow the GNAT encoding format. It should then | |
6151 | not be allowed as a possible wild match. */ | |
6152 | if (decoded_name[0] == '<') | |
6153 | return 0; | |
6154 | ||
529cad9c PH |
6155 | for (i=0; decoded_name[i] != '\0'; i++) |
6156 | if (isalpha (decoded_name[i]) && !islower (decoded_name[i])) | |
6157 | return 0; | |
6158 | ||
6159 | return 1; | |
6160 | } | |
6161 | ||
73589123 PH |
6162 | /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0 |
6163 | that could start a simple name. Assumes that *NAMEP points into | |
6164 | the string beginning at NAME0. */ | |
4c4b4cd2 | 6165 | |
14f9c5c9 | 6166 | static int |
73589123 | 6167 | advance_wild_match (const char **namep, const char *name0, int target0) |
14f9c5c9 | 6168 | { |
73589123 | 6169 | const char *name = *namep; |
5b4ee69b | 6170 | |
5823c3ef | 6171 | while (1) |
14f9c5c9 | 6172 | { |
aa27d0b3 | 6173 | int t0, t1; |
73589123 PH |
6174 | |
6175 | t0 = *name; | |
6176 | if (t0 == '_') | |
6177 | { | |
6178 | t1 = name[1]; | |
6179 | if ((t1 >= 'a' && t1 <= 'z') || (t1 >= '0' && t1 <= '9')) | |
6180 | { | |
6181 | name += 1; | |
61012eef | 6182 | if (name == name0 + 5 && startswith (name0, "_ada")) |
73589123 PH |
6183 | break; |
6184 | else | |
6185 | name += 1; | |
6186 | } | |
aa27d0b3 JB |
6187 | else if (t1 == '_' && ((name[2] >= 'a' && name[2] <= 'z') |
6188 | || name[2] == target0)) | |
73589123 PH |
6189 | { |
6190 | name += 2; | |
6191 | break; | |
6192 | } | |
6193 | else | |
6194 | return 0; | |
6195 | } | |
6196 | else if ((t0 >= 'a' && t0 <= 'z') || (t0 >= '0' && t0 <= '9')) | |
6197 | name += 1; | |
6198 | else | |
5823c3ef | 6199 | return 0; |
73589123 PH |
6200 | } |
6201 | ||
6202 | *namep = name; | |
6203 | return 1; | |
6204 | } | |
6205 | ||
b5ec771e PA |
6206 | /* Return true iff NAME encodes a name of the form prefix.PATN. |
6207 | Ignores any informational suffixes of NAME (i.e., for which | |
6208 | is_name_suffix is true). Assumes that PATN is a lower-cased Ada | |
6209 | simple name. */ | |
73589123 | 6210 | |
b5ec771e | 6211 | static bool |
73589123 PH |
6212 | wild_match (const char *name, const char *patn) |
6213 | { | |
22e048c9 | 6214 | const char *p; |
73589123 PH |
6215 | const char *name0 = name; |
6216 | ||
6217 | while (1) | |
6218 | { | |
6219 | const char *match = name; | |
6220 | ||
6221 | if (*name == *patn) | |
6222 | { | |
6223 | for (name += 1, p = patn + 1; *p != '\0'; name += 1, p += 1) | |
6224 | if (*p != *name) | |
6225 | break; | |
6226 | if (*p == '\0' && is_name_suffix (name)) | |
b5ec771e | 6227 | return match == name0 || is_valid_name_for_wild_match (name0); |
73589123 PH |
6228 | |
6229 | if (name[-1] == '_') | |
6230 | name -= 1; | |
6231 | } | |
6232 | if (!advance_wild_match (&name, name0, *patn)) | |
b5ec771e | 6233 | return false; |
96d887e8 | 6234 | } |
96d887e8 PH |
6235 | } |
6236 | ||
b5ec771e PA |
6237 | /* Returns true iff symbol name SYM_NAME matches SEARCH_NAME, ignoring |
6238 | any trailing suffixes that encode debugging information or leading | |
6239 | _ada_ on SYM_NAME (see is_name_suffix commentary for the debugging | |
6240 | information that is ignored). */ | |
40658b94 | 6241 | |
b5ec771e | 6242 | static bool |
c4d840bd PH |
6243 | full_match (const char *sym_name, const char *search_name) |
6244 | { | |
b5ec771e PA |
6245 | size_t search_name_len = strlen (search_name); |
6246 | ||
6247 | if (strncmp (sym_name, search_name, search_name_len) == 0 | |
6248 | && is_name_suffix (sym_name + search_name_len)) | |
6249 | return true; | |
6250 | ||
6251 | if (startswith (sym_name, "_ada_") | |
6252 | && strncmp (sym_name + 5, search_name, search_name_len) == 0 | |
6253 | && is_name_suffix (sym_name + search_name_len + 5)) | |
6254 | return true; | |
c4d840bd | 6255 | |
b5ec771e PA |
6256 | return false; |
6257 | } | |
c4d840bd | 6258 | |
b5ec771e PA |
6259 | /* Add symbols from BLOCK matching LOOKUP_NAME in DOMAIN to vector |
6260 | *defn_symbols, updating the list of symbols in OBSTACKP (if | |
6261 | necessary). OBJFILE is the section containing BLOCK. */ | |
96d887e8 PH |
6262 | |
6263 | static void | |
6264 | ada_add_block_symbols (struct obstack *obstackp, | |
b5ec771e PA |
6265 | const struct block *block, |
6266 | const lookup_name_info &lookup_name, | |
6267 | domain_enum domain, struct objfile *objfile) | |
96d887e8 | 6268 | { |
8157b174 | 6269 | struct block_iterator iter; |
96d887e8 PH |
6270 | /* A matching argument symbol, if any. */ |
6271 | struct symbol *arg_sym; | |
6272 | /* Set true when we find a matching non-argument symbol. */ | |
6273 | int found_sym; | |
6274 | struct symbol *sym; | |
6275 | ||
6276 | arg_sym = NULL; | |
6277 | found_sym = 0; | |
b5ec771e PA |
6278 | for (sym = block_iter_match_first (block, lookup_name, &iter); |
6279 | sym != NULL; | |
6280 | sym = block_iter_match_next (lookup_name, &iter)) | |
96d887e8 | 6281 | { |
b5ec771e PA |
6282 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6283 | SYMBOL_DOMAIN (sym), domain)) | |
6284 | { | |
6285 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) | |
6286 | { | |
6287 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6288 | arg_sym = sym; | |
6289 | else | |
6290 | { | |
6291 | found_sym = 1; | |
6292 | add_defn_to_vec (obstackp, | |
6293 | fixup_symbol_section (sym, objfile), | |
6294 | block); | |
6295 | } | |
6296 | } | |
6297 | } | |
96d887e8 PH |
6298 | } |
6299 | ||
22cee43f PMR |
6300 | /* Handle renamings. */ |
6301 | ||
b5ec771e | 6302 | if (ada_add_block_renamings (obstackp, block, lookup_name, domain)) |
22cee43f PMR |
6303 | found_sym = 1; |
6304 | ||
96d887e8 PH |
6305 | if (!found_sym && arg_sym != NULL) |
6306 | { | |
76a01679 JB |
6307 | add_defn_to_vec (obstackp, |
6308 | fixup_symbol_section (arg_sym, objfile), | |
2570f2b7 | 6309 | block); |
96d887e8 PH |
6310 | } |
6311 | ||
b5ec771e | 6312 | if (!lookup_name.ada ().wild_match_p ()) |
96d887e8 PH |
6313 | { |
6314 | arg_sym = NULL; | |
6315 | found_sym = 0; | |
b5ec771e PA |
6316 | const std::string &ada_lookup_name = lookup_name.ada ().lookup_name (); |
6317 | const char *name = ada_lookup_name.c_str (); | |
6318 | size_t name_len = ada_lookup_name.size (); | |
96d887e8 PH |
6319 | |
6320 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
76a01679 | 6321 | { |
4186eb54 KS |
6322 | if (symbol_matches_domain (SYMBOL_LANGUAGE (sym), |
6323 | SYMBOL_DOMAIN (sym), domain)) | |
76a01679 JB |
6324 | { |
6325 | int cmp; | |
6326 | ||
6327 | cmp = (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym)[0]; | |
6328 | if (cmp == 0) | |
6329 | { | |
61012eef | 6330 | cmp = !startswith (SYMBOL_LINKAGE_NAME (sym), "_ada_"); |
76a01679 JB |
6331 | if (cmp == 0) |
6332 | cmp = strncmp (name, SYMBOL_LINKAGE_NAME (sym) + 5, | |
6333 | name_len); | |
6334 | } | |
6335 | ||
6336 | if (cmp == 0 | |
6337 | && is_name_suffix (SYMBOL_LINKAGE_NAME (sym) + name_len + 5)) | |
6338 | { | |
2a2d4dc3 AS |
6339 | if (SYMBOL_CLASS (sym) != LOC_UNRESOLVED) |
6340 | { | |
6341 | if (SYMBOL_IS_ARGUMENT (sym)) | |
6342 | arg_sym = sym; | |
6343 | else | |
6344 | { | |
6345 | found_sym = 1; | |
6346 | add_defn_to_vec (obstackp, | |
6347 | fixup_symbol_section (sym, objfile), | |
6348 | block); | |
6349 | } | |
6350 | } | |
76a01679 JB |
6351 | } |
6352 | } | |
76a01679 | 6353 | } |
96d887e8 PH |
6354 | |
6355 | /* NOTE: This really shouldn't be needed for _ada_ symbols. | |
6356 | They aren't parameters, right? */ | |
6357 | if (!found_sym && arg_sym != NULL) | |
6358 | { | |
6359 | add_defn_to_vec (obstackp, | |
76a01679 | 6360 | fixup_symbol_section (arg_sym, objfile), |
2570f2b7 | 6361 | block); |
96d887e8 PH |
6362 | } |
6363 | } | |
6364 | } | |
6365 | \f | |
41d27058 JB |
6366 | |
6367 | /* Symbol Completion */ | |
6368 | ||
b5ec771e | 6369 | /* See symtab.h. */ |
41d27058 | 6370 | |
b5ec771e PA |
6371 | bool |
6372 | ada_lookup_name_info::matches | |
6373 | (const char *sym_name, | |
6374 | symbol_name_match_type match_type, | |
a207cff2 | 6375 | completion_match_result *comp_match_res) const |
41d27058 | 6376 | { |
b5ec771e PA |
6377 | bool match = false; |
6378 | const char *text = m_encoded_name.c_str (); | |
6379 | size_t text_len = m_encoded_name.size (); | |
41d27058 JB |
6380 | |
6381 | /* First, test against the fully qualified name of the symbol. */ | |
6382 | ||
6383 | if (strncmp (sym_name, text, text_len) == 0) | |
b5ec771e | 6384 | match = true; |
41d27058 | 6385 | |
b5ec771e | 6386 | if (match && !m_encoded_p) |
41d27058 JB |
6387 | { |
6388 | /* One needed check before declaring a positive match is to verify | |
6389 | that iff we are doing a verbatim match, the decoded version | |
6390 | of the symbol name starts with '<'. Otherwise, this symbol name | |
6391 | is not a suitable completion. */ | |
6392 | const char *sym_name_copy = sym_name; | |
b5ec771e | 6393 | bool has_angle_bracket; |
41d27058 JB |
6394 | |
6395 | sym_name = ada_decode (sym_name); | |
6396 | has_angle_bracket = (sym_name[0] == '<'); | |
b5ec771e | 6397 | match = (has_angle_bracket == m_verbatim_p); |
41d27058 JB |
6398 | sym_name = sym_name_copy; |
6399 | } | |
6400 | ||
b5ec771e | 6401 | if (match && !m_verbatim_p) |
41d27058 JB |
6402 | { |
6403 | /* When doing non-verbatim match, another check that needs to | |
6404 | be done is to verify that the potentially matching symbol name | |
6405 | does not include capital letters, because the ada-mode would | |
6406 | not be able to understand these symbol names without the | |
6407 | angle bracket notation. */ | |
6408 | const char *tmp; | |
6409 | ||
6410 | for (tmp = sym_name; *tmp != '\0' && !isupper (*tmp); tmp++); | |
6411 | if (*tmp != '\0') | |
b5ec771e | 6412 | match = false; |
41d27058 JB |
6413 | } |
6414 | ||
6415 | /* Second: Try wild matching... */ | |
6416 | ||
b5ec771e | 6417 | if (!match && m_wild_match_p) |
41d27058 JB |
6418 | { |
6419 | /* Since we are doing wild matching, this means that TEXT | |
6420 | may represent an unqualified symbol name. We therefore must | |
6421 | also compare TEXT against the unqualified name of the symbol. */ | |
6422 | sym_name = ada_unqualified_name (ada_decode (sym_name)); | |
6423 | ||
6424 | if (strncmp (sym_name, text, text_len) == 0) | |
b5ec771e | 6425 | match = true; |
41d27058 JB |
6426 | } |
6427 | ||
b5ec771e | 6428 | /* Finally: If we found a match, prepare the result to return. */ |
41d27058 JB |
6429 | |
6430 | if (!match) | |
b5ec771e | 6431 | return false; |
41d27058 | 6432 | |
a207cff2 | 6433 | if (comp_match_res != NULL) |
b5ec771e | 6434 | { |
a207cff2 | 6435 | std::string &match_str = comp_match_res->match.storage (); |
41d27058 | 6436 | |
b5ec771e | 6437 | if (!m_encoded_p) |
a207cff2 | 6438 | match_str = ada_decode (sym_name); |
b5ec771e PA |
6439 | else |
6440 | { | |
6441 | if (m_verbatim_p) | |
6442 | match_str = add_angle_brackets (sym_name); | |
6443 | else | |
6444 | match_str = sym_name; | |
41d27058 | 6445 | |
b5ec771e | 6446 | } |
a207cff2 PA |
6447 | |
6448 | comp_match_res->set_match (match_str.c_str ()); | |
41d27058 JB |
6449 | } |
6450 | ||
b5ec771e | 6451 | return true; |
41d27058 JB |
6452 | } |
6453 | ||
b5ec771e | 6454 | /* Add the list of possible symbol names completing TEXT to TRACKER. |
eb3ff9a5 | 6455 | WORD is the entire command on which completion is made. */ |
41d27058 | 6456 | |
eb3ff9a5 PA |
6457 | static void |
6458 | ada_collect_symbol_completion_matches (completion_tracker &tracker, | |
c6756f62 | 6459 | complete_symbol_mode mode, |
b5ec771e PA |
6460 | symbol_name_match_type name_match_type, |
6461 | const char *text, const char *word, | |
eb3ff9a5 | 6462 | enum type_code code) |
41d27058 | 6463 | { |
41d27058 | 6464 | struct symbol *sym; |
43f3e411 | 6465 | struct compunit_symtab *s; |
41d27058 JB |
6466 | struct minimal_symbol *msymbol; |
6467 | struct objfile *objfile; | |
3977b71f | 6468 | const struct block *b, *surrounding_static_block = 0; |
8157b174 | 6469 | struct block_iterator iter; |
b8fea896 | 6470 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); |
41d27058 | 6471 | |
2f68a895 TT |
6472 | gdb_assert (code == TYPE_CODE_UNDEF); |
6473 | ||
1b026119 | 6474 | lookup_name_info lookup_name (text, name_match_type, true); |
41d27058 JB |
6475 | |
6476 | /* First, look at the partial symtab symbols. */ | |
14bc53a8 | 6477 | expand_symtabs_matching (NULL, |
b5ec771e PA |
6478 | lookup_name, |
6479 | NULL, | |
14bc53a8 PA |
6480 | NULL, |
6481 | ALL_DOMAIN); | |
41d27058 JB |
6482 | |
6483 | /* At this point scan through the misc symbol vectors and add each | |
6484 | symbol you find to the list. Eventually we want to ignore | |
6485 | anything that isn't a text symbol (everything else will be | |
6486 | handled by the psymtab code above). */ | |
6487 | ||
6488 | ALL_MSYMBOLS (objfile, msymbol) | |
6489 | { | |
6490 | QUIT; | |
b5ec771e | 6491 | |
f9d67a22 PA |
6492 | if (completion_skip_symbol (mode, msymbol)) |
6493 | continue; | |
6494 | ||
d4c2a405 PA |
6495 | language symbol_language = MSYMBOL_LANGUAGE (msymbol); |
6496 | ||
6497 | /* Ada minimal symbols won't have their language set to Ada. If | |
6498 | we let completion_list_add_name compare using the | |
6499 | default/C-like matcher, then when completing e.g., symbols in a | |
6500 | package named "pck", we'd match internal Ada symbols like | |
6501 | "pckS", which are invalid in an Ada expression, unless you wrap | |
6502 | them in '<' '>' to request a verbatim match. | |
6503 | ||
6504 | Unfortunately, some Ada encoded names successfully demangle as | |
6505 | C++ symbols (using an old mangling scheme), such as "name__2Xn" | |
6506 | -> "Xn::name(void)" and thus some Ada minimal symbols end up | |
6507 | with the wrong language set. Paper over that issue here. */ | |
6508 | if (symbol_language == language_auto | |
6509 | || symbol_language == language_cplus) | |
6510 | symbol_language = language_ada; | |
6511 | ||
b5ec771e | 6512 | completion_list_add_name (tracker, |
d4c2a405 | 6513 | symbol_language, |
b5ec771e | 6514 | MSYMBOL_LINKAGE_NAME (msymbol), |
1b026119 | 6515 | lookup_name, text, word); |
41d27058 JB |
6516 | } |
6517 | ||
6518 | /* Search upwards from currently selected frame (so that we can | |
6519 | complete on local vars. */ | |
6520 | ||
6521 | for (b = get_selected_block (0); b != NULL; b = BLOCK_SUPERBLOCK (b)) | |
6522 | { | |
6523 | if (!BLOCK_SUPERBLOCK (b)) | |
6524 | surrounding_static_block = b; /* For elmin of dups */ | |
6525 | ||
6526 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6527 | { | |
f9d67a22 PA |
6528 | if (completion_skip_symbol (mode, sym)) |
6529 | continue; | |
6530 | ||
b5ec771e PA |
6531 | completion_list_add_name (tracker, |
6532 | SYMBOL_LANGUAGE (sym), | |
6533 | SYMBOL_LINKAGE_NAME (sym), | |
1b026119 | 6534 | lookup_name, text, word); |
41d27058 JB |
6535 | } |
6536 | } | |
6537 | ||
6538 | /* Go through the symtabs and check the externs and statics for | |
43f3e411 | 6539 | symbols which match. */ |
41d27058 | 6540 | |
43f3e411 | 6541 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6542 | { |
6543 | QUIT; | |
43f3e411 | 6544 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), GLOBAL_BLOCK); |
41d27058 JB |
6545 | ALL_BLOCK_SYMBOLS (b, iter, sym) |
6546 | { | |
f9d67a22 PA |
6547 | if (completion_skip_symbol (mode, sym)) |
6548 | continue; | |
6549 | ||
b5ec771e PA |
6550 | completion_list_add_name (tracker, |
6551 | SYMBOL_LANGUAGE (sym), | |
6552 | SYMBOL_LINKAGE_NAME (sym), | |
1b026119 | 6553 | lookup_name, text, word); |
41d27058 JB |
6554 | } |
6555 | } | |
6556 | ||
43f3e411 | 6557 | ALL_COMPUNITS (objfile, s) |
41d27058 JB |
6558 | { |
6559 | QUIT; | |
43f3e411 | 6560 | b = BLOCKVECTOR_BLOCK (COMPUNIT_BLOCKVECTOR (s), STATIC_BLOCK); |
41d27058 JB |
6561 | /* Don't do this block twice. */ |
6562 | if (b == surrounding_static_block) | |
6563 | continue; | |
6564 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
6565 | { | |
f9d67a22 PA |
6566 | if (completion_skip_symbol (mode, sym)) |
6567 | continue; | |
6568 | ||
b5ec771e PA |
6569 | completion_list_add_name (tracker, |
6570 | SYMBOL_LANGUAGE (sym), | |
6571 | SYMBOL_LINKAGE_NAME (sym), | |
1b026119 | 6572 | lookup_name, text, word); |
41d27058 JB |
6573 | } |
6574 | } | |
6575 | ||
b8fea896 | 6576 | do_cleanups (old_chain); |
41d27058 JB |
6577 | } |
6578 | ||
963a6417 | 6579 | /* Field Access */ |
96d887e8 | 6580 | |
73fb9985 JB |
6581 | /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used |
6582 | for tagged types. */ | |
6583 | ||
6584 | static int | |
6585 | ada_is_dispatch_table_ptr_type (struct type *type) | |
6586 | { | |
0d5cff50 | 6587 | const char *name; |
73fb9985 JB |
6588 | |
6589 | if (TYPE_CODE (type) != TYPE_CODE_PTR) | |
6590 | return 0; | |
6591 | ||
6592 | name = TYPE_NAME (TYPE_TARGET_TYPE (type)); | |
6593 | if (name == NULL) | |
6594 | return 0; | |
6595 | ||
6596 | return (strcmp (name, "ada__tags__dispatch_table") == 0); | |
6597 | } | |
6598 | ||
ac4a2da4 JG |
6599 | /* Return non-zero if TYPE is an interface tag. */ |
6600 | ||
6601 | static int | |
6602 | ada_is_interface_tag (struct type *type) | |
6603 | { | |
6604 | const char *name = TYPE_NAME (type); | |
6605 | ||
6606 | if (name == NULL) | |
6607 | return 0; | |
6608 | ||
6609 | return (strcmp (name, "ada__tags__interface_tag") == 0); | |
6610 | } | |
6611 | ||
963a6417 PH |
6612 | /* True if field number FIELD_NUM in struct or union type TYPE is supposed |
6613 | to be invisible to users. */ | |
96d887e8 | 6614 | |
963a6417 PH |
6615 | int |
6616 | ada_is_ignored_field (struct type *type, int field_num) | |
96d887e8 | 6617 | { |
963a6417 PH |
6618 | if (field_num < 0 || field_num > TYPE_NFIELDS (type)) |
6619 | return 1; | |
ffde82bf | 6620 | |
73fb9985 JB |
6621 | /* Check the name of that field. */ |
6622 | { | |
6623 | const char *name = TYPE_FIELD_NAME (type, field_num); | |
6624 | ||
6625 | /* Anonymous field names should not be printed. | |
6626 | brobecker/2007-02-20: I don't think this can actually happen | |
6627 | but we don't want to print the value of annonymous fields anyway. */ | |
6628 | if (name == NULL) | |
6629 | return 1; | |
6630 | ||
ffde82bf JB |
6631 | /* Normally, fields whose name start with an underscore ("_") |
6632 | are fields that have been internally generated by the compiler, | |
6633 | and thus should not be printed. The "_parent" field is special, | |
6634 | however: This is a field internally generated by the compiler | |
6635 | for tagged types, and it contains the components inherited from | |
6636 | the parent type. This field should not be printed as is, but | |
6637 | should not be ignored either. */ | |
61012eef | 6638 | if (name[0] == '_' && !startswith (name, "_parent")) |
73fb9985 JB |
6639 | return 1; |
6640 | } | |
6641 | ||
ac4a2da4 JG |
6642 | /* If this is the dispatch table of a tagged type or an interface tag, |
6643 | then ignore. */ | |
73fb9985 | 6644 | if (ada_is_tagged_type (type, 1) |
ac4a2da4 JG |
6645 | && (ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type, field_num)) |
6646 | || ada_is_interface_tag (TYPE_FIELD_TYPE (type, field_num)))) | |
73fb9985 JB |
6647 | return 1; |
6648 | ||
6649 | /* Not a special field, so it should not be ignored. */ | |
6650 | return 0; | |
963a6417 | 6651 | } |
96d887e8 | 6652 | |
963a6417 | 6653 | /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a |
0963b4bd | 6654 | pointer or reference type whose ultimate target has a tag field. */ |
96d887e8 | 6655 | |
963a6417 PH |
6656 | int |
6657 | ada_is_tagged_type (struct type *type, int refok) | |
6658 | { | |
988f6b3d | 6659 | return (ada_lookup_struct_elt_type (type, "_tag", refok, 1) != NULL); |
963a6417 | 6660 | } |
96d887e8 | 6661 | |
963a6417 | 6662 | /* True iff TYPE represents the type of X'Tag */ |
96d887e8 | 6663 | |
963a6417 PH |
6664 | int |
6665 | ada_is_tag_type (struct type *type) | |
6666 | { | |
460efde1 JB |
6667 | type = ada_check_typedef (type); |
6668 | ||
963a6417 PH |
6669 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_PTR) |
6670 | return 0; | |
6671 | else | |
96d887e8 | 6672 | { |
963a6417 | 6673 | const char *name = ada_type_name (TYPE_TARGET_TYPE (type)); |
5b4ee69b | 6674 | |
963a6417 PH |
6675 | return (name != NULL |
6676 | && strcmp (name, "ada__tags__dispatch_table") == 0); | |
96d887e8 | 6677 | } |
96d887e8 PH |
6678 | } |
6679 | ||
963a6417 | 6680 | /* The type of the tag on VAL. */ |
76a01679 | 6681 | |
963a6417 PH |
6682 | struct type * |
6683 | ada_tag_type (struct value *val) | |
96d887e8 | 6684 | { |
988f6b3d | 6685 | return ada_lookup_struct_elt_type (value_type (val), "_tag", 1, 0); |
963a6417 | 6686 | } |
96d887e8 | 6687 | |
b50d69b5 JG |
6688 | /* Return 1 if TAG follows the old scheme for Ada tags (used for Ada 95, |
6689 | retired at Ada 05). */ | |
6690 | ||
6691 | static int | |
6692 | is_ada95_tag (struct value *tag) | |
6693 | { | |
6694 | return ada_value_struct_elt (tag, "tsd", 1) != NULL; | |
6695 | } | |
6696 | ||
963a6417 | 6697 | /* The value of the tag on VAL. */ |
96d887e8 | 6698 | |
963a6417 PH |
6699 | struct value * |
6700 | ada_value_tag (struct value *val) | |
6701 | { | |
03ee6b2e | 6702 | return ada_value_struct_elt (val, "_tag", 0); |
96d887e8 PH |
6703 | } |
6704 | ||
963a6417 PH |
6705 | /* The value of the tag on the object of type TYPE whose contents are |
6706 | saved at VALADDR, if it is non-null, or is at memory address | |
0963b4bd | 6707 | ADDRESS. */ |
96d887e8 | 6708 | |
963a6417 | 6709 | static struct value * |
10a2c479 | 6710 | value_tag_from_contents_and_address (struct type *type, |
fc1a4b47 | 6711 | const gdb_byte *valaddr, |
963a6417 | 6712 | CORE_ADDR address) |
96d887e8 | 6713 | { |
b5385fc0 | 6714 | int tag_byte_offset; |
963a6417 | 6715 | struct type *tag_type; |
5b4ee69b | 6716 | |
963a6417 | 6717 | if (find_struct_field ("_tag", type, 0, &tag_type, &tag_byte_offset, |
52ce6436 | 6718 | NULL, NULL, NULL)) |
96d887e8 | 6719 | { |
fc1a4b47 | 6720 | const gdb_byte *valaddr1 = ((valaddr == NULL) |
10a2c479 AC |
6721 | ? NULL |
6722 | : valaddr + tag_byte_offset); | |
963a6417 | 6723 | CORE_ADDR address1 = (address == 0) ? 0 : address + tag_byte_offset; |
96d887e8 | 6724 | |
963a6417 | 6725 | return value_from_contents_and_address (tag_type, valaddr1, address1); |
96d887e8 | 6726 | } |
963a6417 PH |
6727 | return NULL; |
6728 | } | |
96d887e8 | 6729 | |
963a6417 PH |
6730 | static struct type * |
6731 | type_from_tag (struct value *tag) | |
6732 | { | |
6733 | const char *type_name = ada_tag_name (tag); | |
5b4ee69b | 6734 | |
963a6417 PH |
6735 | if (type_name != NULL) |
6736 | return ada_find_any_type (ada_encode (type_name)); | |
6737 | return NULL; | |
6738 | } | |
96d887e8 | 6739 | |
b50d69b5 JG |
6740 | /* Given a value OBJ of a tagged type, return a value of this |
6741 | type at the base address of the object. The base address, as | |
6742 | defined in Ada.Tags, it is the address of the primary tag of | |
6743 | the object, and therefore where the field values of its full | |
6744 | view can be fetched. */ | |
6745 | ||
6746 | struct value * | |
6747 | ada_tag_value_at_base_address (struct value *obj) | |
6748 | { | |
b50d69b5 JG |
6749 | struct value *val; |
6750 | LONGEST offset_to_top = 0; | |
6751 | struct type *ptr_type, *obj_type; | |
6752 | struct value *tag; | |
6753 | CORE_ADDR base_address; | |
6754 | ||
6755 | obj_type = value_type (obj); | |
6756 | ||
6757 | /* It is the responsability of the caller to deref pointers. */ | |
6758 | ||
6759 | if (TYPE_CODE (obj_type) == TYPE_CODE_PTR | |
6760 | || TYPE_CODE (obj_type) == TYPE_CODE_REF) | |
6761 | return obj; | |
6762 | ||
6763 | tag = ada_value_tag (obj); | |
6764 | if (!tag) | |
6765 | return obj; | |
6766 | ||
6767 | /* Base addresses only appeared with Ada 05 and multiple inheritance. */ | |
6768 | ||
6769 | if (is_ada95_tag (tag)) | |
6770 | return obj; | |
6771 | ||
08f49010 XR |
6772 | ptr_type = language_lookup_primitive_type |
6773 | (language_def (language_ada), target_gdbarch(), "storage_offset"); | |
b50d69b5 JG |
6774 | ptr_type = lookup_pointer_type (ptr_type); |
6775 | val = value_cast (ptr_type, tag); | |
6776 | if (!val) | |
6777 | return obj; | |
6778 | ||
6779 | /* It is perfectly possible that an exception be raised while | |
6780 | trying to determine the base address, just like for the tag; | |
6781 | see ada_tag_name for more details. We do not print the error | |
6782 | message for the same reason. */ | |
6783 | ||
492d29ea | 6784 | TRY |
b50d69b5 JG |
6785 | { |
6786 | offset_to_top = value_as_long (value_ind (value_ptradd (val, -2))); | |
6787 | } | |
6788 | ||
492d29ea PA |
6789 | CATCH (e, RETURN_MASK_ERROR) |
6790 | { | |
6791 | return obj; | |
6792 | } | |
6793 | END_CATCH | |
b50d69b5 JG |
6794 | |
6795 | /* If offset is null, nothing to do. */ | |
6796 | ||
6797 | if (offset_to_top == 0) | |
6798 | return obj; | |
6799 | ||
6800 | /* -1 is a special case in Ada.Tags; however, what should be done | |
6801 | is not quite clear from the documentation. So do nothing for | |
6802 | now. */ | |
6803 | ||
6804 | if (offset_to_top == -1) | |
6805 | return obj; | |
6806 | ||
08f49010 XR |
6807 | /* OFFSET_TO_TOP used to be a positive value to be subtracted |
6808 | from the base address. This was however incompatible with | |
6809 | C++ dispatch table: C++ uses a *negative* value to *add* | |
6810 | to the base address. Ada's convention has therefore been | |
6811 | changed in GNAT 19.0w 20171023: since then, C++ and Ada | |
6812 | use the same convention. Here, we support both cases by | |
6813 | checking the sign of OFFSET_TO_TOP. */ | |
6814 | ||
6815 | if (offset_to_top > 0) | |
6816 | offset_to_top = -offset_to_top; | |
6817 | ||
6818 | base_address = value_address (obj) + offset_to_top; | |
b50d69b5 JG |
6819 | tag = value_tag_from_contents_and_address (obj_type, NULL, base_address); |
6820 | ||
6821 | /* Make sure that we have a proper tag at the new address. | |
6822 | Otherwise, offset_to_top is bogus (which can happen when | |
6823 | the object is not initialized yet). */ | |
6824 | ||
6825 | if (!tag) | |
6826 | return obj; | |
6827 | ||
6828 | obj_type = type_from_tag (tag); | |
6829 | ||
6830 | if (!obj_type) | |
6831 | return obj; | |
6832 | ||
6833 | return value_from_contents_and_address (obj_type, NULL, base_address); | |
6834 | } | |
6835 | ||
1b611343 JB |
6836 | /* Return the "ada__tags__type_specific_data" type. */ |
6837 | ||
6838 | static struct type * | |
6839 | ada_get_tsd_type (struct inferior *inf) | |
963a6417 | 6840 | { |
1b611343 | 6841 | struct ada_inferior_data *data = get_ada_inferior_data (inf); |
4c4b4cd2 | 6842 | |
1b611343 JB |
6843 | if (data->tsd_type == 0) |
6844 | data->tsd_type = ada_find_any_type ("ada__tags__type_specific_data"); | |
6845 | return data->tsd_type; | |
6846 | } | |
529cad9c | 6847 | |
1b611343 JB |
6848 | /* Return the TSD (type-specific data) associated to the given TAG. |
6849 | TAG is assumed to be the tag of a tagged-type entity. | |
529cad9c | 6850 | |
1b611343 | 6851 | May return NULL if we are unable to get the TSD. */ |
4c4b4cd2 | 6852 | |
1b611343 JB |
6853 | static struct value * |
6854 | ada_get_tsd_from_tag (struct value *tag) | |
4c4b4cd2 | 6855 | { |
4c4b4cd2 | 6856 | struct value *val; |
1b611343 | 6857 | struct type *type; |
5b4ee69b | 6858 | |
1b611343 JB |
6859 | /* First option: The TSD is simply stored as a field of our TAG. |
6860 | Only older versions of GNAT would use this format, but we have | |
6861 | to test it first, because there are no visible markers for | |
6862 | the current approach except the absence of that field. */ | |
529cad9c | 6863 | |
1b611343 JB |
6864 | val = ada_value_struct_elt (tag, "tsd", 1); |
6865 | if (val) | |
6866 | return val; | |
e802dbe0 | 6867 | |
1b611343 JB |
6868 | /* Try the second representation for the dispatch table (in which |
6869 | there is no explicit 'tsd' field in the referent of the tag pointer, | |
6870 | and instead the tsd pointer is stored just before the dispatch | |
6871 | table. */ | |
e802dbe0 | 6872 | |
1b611343 JB |
6873 | type = ada_get_tsd_type (current_inferior()); |
6874 | if (type == NULL) | |
6875 | return NULL; | |
6876 | type = lookup_pointer_type (lookup_pointer_type (type)); | |
6877 | val = value_cast (type, tag); | |
6878 | if (val == NULL) | |
6879 | return NULL; | |
6880 | return value_ind (value_ptradd (val, -1)); | |
e802dbe0 JB |
6881 | } |
6882 | ||
1b611343 JB |
6883 | /* Given the TSD of a tag (type-specific data), return a string |
6884 | containing the name of the associated type. | |
6885 | ||
6886 | The returned value is good until the next call. May return NULL | |
6887 | if we are unable to determine the tag name. */ | |
6888 | ||
6889 | static char * | |
6890 | ada_tag_name_from_tsd (struct value *tsd) | |
529cad9c | 6891 | { |
529cad9c PH |
6892 | static char name[1024]; |
6893 | char *p; | |
1b611343 | 6894 | struct value *val; |
529cad9c | 6895 | |
1b611343 | 6896 | val = ada_value_struct_elt (tsd, "expanded_name", 1); |
4c4b4cd2 | 6897 | if (val == NULL) |
1b611343 | 6898 | return NULL; |
4c4b4cd2 PH |
6899 | read_memory_string (value_as_address (val), name, sizeof (name) - 1); |
6900 | for (p = name; *p != '\0'; p += 1) | |
6901 | if (isalpha (*p)) | |
6902 | *p = tolower (*p); | |
1b611343 | 6903 | return name; |
4c4b4cd2 PH |
6904 | } |
6905 | ||
6906 | /* The type name of the dynamic type denoted by the 'tag value TAG, as | |
1b611343 JB |
6907 | a C string. |
6908 | ||
6909 | Return NULL if the TAG is not an Ada tag, or if we were unable to | |
6910 | determine the name of that tag. The result is good until the next | |
6911 | call. */ | |
4c4b4cd2 PH |
6912 | |
6913 | const char * | |
6914 | ada_tag_name (struct value *tag) | |
6915 | { | |
1b611343 | 6916 | char *name = NULL; |
5b4ee69b | 6917 | |
df407dfe | 6918 | if (!ada_is_tag_type (value_type (tag))) |
4c4b4cd2 | 6919 | return NULL; |
1b611343 JB |
6920 | |
6921 | /* It is perfectly possible that an exception be raised while trying | |
6922 | to determine the TAG's name, even under normal circumstances: | |
6923 | The associated variable may be uninitialized or corrupted, for | |
6924 | instance. We do not let any exception propagate past this point. | |
6925 | instead we return NULL. | |
6926 | ||
6927 | We also do not print the error message either (which often is very | |
6928 | low-level (Eg: "Cannot read memory at 0x[...]"), but instead let | |
6929 | the caller print a more meaningful message if necessary. */ | |
492d29ea | 6930 | TRY |
1b611343 JB |
6931 | { |
6932 | struct value *tsd = ada_get_tsd_from_tag (tag); | |
6933 | ||
6934 | if (tsd != NULL) | |
6935 | name = ada_tag_name_from_tsd (tsd); | |
6936 | } | |
492d29ea PA |
6937 | CATCH (e, RETURN_MASK_ERROR) |
6938 | { | |
6939 | } | |
6940 | END_CATCH | |
1b611343 JB |
6941 | |
6942 | return name; | |
4c4b4cd2 PH |
6943 | } |
6944 | ||
6945 | /* The parent type of TYPE, or NULL if none. */ | |
14f9c5c9 | 6946 | |
d2e4a39e | 6947 | struct type * |
ebf56fd3 | 6948 | ada_parent_type (struct type *type) |
14f9c5c9 AS |
6949 | { |
6950 | int i; | |
6951 | ||
61ee279c | 6952 | type = ada_check_typedef (type); |
14f9c5c9 AS |
6953 | |
6954 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) | |
6955 | return NULL; | |
6956 | ||
6957 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
6958 | if (ada_is_parent_field (type, i)) | |
0c1f74cf JB |
6959 | { |
6960 | struct type *parent_type = TYPE_FIELD_TYPE (type, i); | |
6961 | ||
6962 | /* If the _parent field is a pointer, then dereference it. */ | |
6963 | if (TYPE_CODE (parent_type) == TYPE_CODE_PTR) | |
6964 | parent_type = TYPE_TARGET_TYPE (parent_type); | |
6965 | /* If there is a parallel XVS type, get the actual base type. */ | |
6966 | parent_type = ada_get_base_type (parent_type); | |
6967 | ||
6968 | return ada_check_typedef (parent_type); | |
6969 | } | |
14f9c5c9 AS |
6970 | |
6971 | return NULL; | |
6972 | } | |
6973 | ||
4c4b4cd2 PH |
6974 | /* True iff field number FIELD_NUM of structure type TYPE contains the |
6975 | parent-type (inherited) fields of a derived type. Assumes TYPE is | |
6976 | a structure type with at least FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
6977 | |
6978 | int | |
ebf56fd3 | 6979 | ada_is_parent_field (struct type *type, int field_num) |
14f9c5c9 | 6980 | { |
61ee279c | 6981 | const char *name = TYPE_FIELD_NAME (ada_check_typedef (type), field_num); |
5b4ee69b | 6982 | |
4c4b4cd2 | 6983 | return (name != NULL |
61012eef GB |
6984 | && (startswith (name, "PARENT") |
6985 | || startswith (name, "_parent"))); | |
14f9c5c9 AS |
6986 | } |
6987 | ||
4c4b4cd2 | 6988 | /* True iff field number FIELD_NUM of structure type TYPE is a |
14f9c5c9 | 6989 | transparent wrapper field (which should be silently traversed when doing |
4c4b4cd2 | 6990 | field selection and flattened when printing). Assumes TYPE is a |
14f9c5c9 | 6991 | structure type with at least FIELD_NUM+1 fields. Such fields are always |
4c4b4cd2 | 6992 | structures. */ |
14f9c5c9 AS |
6993 | |
6994 | int | |
ebf56fd3 | 6995 | ada_is_wrapper_field (struct type *type, int field_num) |
14f9c5c9 | 6996 | { |
d2e4a39e | 6997 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 6998 | |
dddc0e16 JB |
6999 | if (name != NULL && strcmp (name, "RETVAL") == 0) |
7000 | { | |
7001 | /* This happens in functions with "out" or "in out" parameters | |
7002 | which are passed by copy. For such functions, GNAT describes | |
7003 | the function's return type as being a struct where the return | |
7004 | value is in a field called RETVAL, and where the other "out" | |
7005 | or "in out" parameters are fields of that struct. This is not | |
7006 | a wrapper. */ | |
7007 | return 0; | |
7008 | } | |
7009 | ||
d2e4a39e | 7010 | return (name != NULL |
61012eef | 7011 | && (startswith (name, "PARENT") |
4c4b4cd2 | 7012 | || strcmp (name, "REP") == 0 |
61012eef | 7013 | || startswith (name, "_parent") |
4c4b4cd2 | 7014 | || name[0] == 'S' || name[0] == 'R' || name[0] == 'O')); |
14f9c5c9 AS |
7015 | } |
7016 | ||
4c4b4cd2 PH |
7017 | /* True iff field number FIELD_NUM of structure or union type TYPE |
7018 | is a variant wrapper. Assumes TYPE is a structure type with at least | |
7019 | FIELD_NUM+1 fields. */ | |
14f9c5c9 AS |
7020 | |
7021 | int | |
ebf56fd3 | 7022 | ada_is_variant_part (struct type *type, int field_num) |
14f9c5c9 | 7023 | { |
d2e4a39e | 7024 | struct type *field_type = TYPE_FIELD_TYPE (type, field_num); |
5b4ee69b | 7025 | |
14f9c5c9 | 7026 | return (TYPE_CODE (field_type) == TYPE_CODE_UNION |
4c4b4cd2 | 7027 | || (is_dynamic_field (type, field_num) |
c3e5cd34 PH |
7028 | && (TYPE_CODE (TYPE_TARGET_TYPE (field_type)) |
7029 | == TYPE_CODE_UNION))); | |
14f9c5c9 AS |
7030 | } |
7031 | ||
7032 | /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part) | |
4c4b4cd2 | 7033 | whose discriminants are contained in the record type OUTER_TYPE, |
7c964f07 UW |
7034 | returns the type of the controlling discriminant for the variant. |
7035 | May return NULL if the type could not be found. */ | |
14f9c5c9 | 7036 | |
d2e4a39e | 7037 | struct type * |
ebf56fd3 | 7038 | ada_variant_discrim_type (struct type *var_type, struct type *outer_type) |
14f9c5c9 | 7039 | { |
a121b7c1 | 7040 | const char *name = ada_variant_discrim_name (var_type); |
5b4ee69b | 7041 | |
988f6b3d | 7042 | return ada_lookup_struct_elt_type (outer_type, name, 1, 1); |
14f9c5c9 AS |
7043 | } |
7044 | ||
4c4b4cd2 | 7045 | /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a |
14f9c5c9 | 7046 | valid field number within it, returns 1 iff field FIELD_NUM of TYPE |
4c4b4cd2 | 7047 | represents a 'when others' clause; otherwise 0. */ |
14f9c5c9 AS |
7048 | |
7049 | int | |
ebf56fd3 | 7050 | ada_is_others_clause (struct type *type, int field_num) |
14f9c5c9 | 7051 | { |
d2e4a39e | 7052 | const char *name = TYPE_FIELD_NAME (type, field_num); |
5b4ee69b | 7053 | |
14f9c5c9 AS |
7054 | return (name != NULL && name[0] == 'O'); |
7055 | } | |
7056 | ||
7057 | /* Assuming that TYPE0 is the type of the variant part of a record, | |
4c4b4cd2 PH |
7058 | returns the name of the discriminant controlling the variant. |
7059 | The value is valid until the next call to ada_variant_discrim_name. */ | |
14f9c5c9 | 7060 | |
a121b7c1 | 7061 | const char * |
ebf56fd3 | 7062 | ada_variant_discrim_name (struct type *type0) |
14f9c5c9 | 7063 | { |
d2e4a39e | 7064 | static char *result = NULL; |
14f9c5c9 | 7065 | static size_t result_len = 0; |
d2e4a39e AS |
7066 | struct type *type; |
7067 | const char *name; | |
7068 | const char *discrim_end; | |
7069 | const char *discrim_start; | |
14f9c5c9 AS |
7070 | |
7071 | if (TYPE_CODE (type0) == TYPE_CODE_PTR) | |
7072 | type = TYPE_TARGET_TYPE (type0); | |
7073 | else | |
7074 | type = type0; | |
7075 | ||
7076 | name = ada_type_name (type); | |
7077 | ||
7078 | if (name == NULL || name[0] == '\000') | |
7079 | return ""; | |
7080 | ||
7081 | for (discrim_end = name + strlen (name) - 6; discrim_end != name; | |
7082 | discrim_end -= 1) | |
7083 | { | |
61012eef | 7084 | if (startswith (discrim_end, "___XVN")) |
4c4b4cd2 | 7085 | break; |
14f9c5c9 AS |
7086 | } |
7087 | if (discrim_end == name) | |
7088 | return ""; | |
7089 | ||
d2e4a39e | 7090 | for (discrim_start = discrim_end; discrim_start != name + 3; |
14f9c5c9 AS |
7091 | discrim_start -= 1) |
7092 | { | |
d2e4a39e | 7093 | if (discrim_start == name + 1) |
4c4b4cd2 | 7094 | return ""; |
76a01679 | 7095 | if ((discrim_start > name + 3 |
61012eef | 7096 | && startswith (discrim_start - 3, "___")) |
4c4b4cd2 PH |
7097 | || discrim_start[-1] == '.') |
7098 | break; | |
14f9c5c9 AS |
7099 | } |
7100 | ||
7101 | GROW_VECT (result, result_len, discrim_end - discrim_start + 1); | |
7102 | strncpy (result, discrim_start, discrim_end - discrim_start); | |
d2e4a39e | 7103 | result[discrim_end - discrim_start] = '\0'; |
14f9c5c9 AS |
7104 | return result; |
7105 | } | |
7106 | ||
4c4b4cd2 PH |
7107 | /* Scan STR for a subtype-encoded number, beginning at position K. |
7108 | Put the position of the character just past the number scanned in | |
7109 | *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL. | |
7110 | Return 1 if there was a valid number at the given position, and 0 | |
7111 | otherwise. A "subtype-encoded" number consists of the absolute value | |
7112 | in decimal, followed by the letter 'm' to indicate a negative number. | |
7113 | Assumes 0m does not occur. */ | |
14f9c5c9 AS |
7114 | |
7115 | int | |
d2e4a39e | 7116 | ada_scan_number (const char str[], int k, LONGEST * R, int *new_k) |
14f9c5c9 AS |
7117 | { |
7118 | ULONGEST RU; | |
7119 | ||
d2e4a39e | 7120 | if (!isdigit (str[k])) |
14f9c5c9 AS |
7121 | return 0; |
7122 | ||
4c4b4cd2 | 7123 | /* Do it the hard way so as not to make any assumption about |
14f9c5c9 | 7124 | the relationship of unsigned long (%lu scan format code) and |
4c4b4cd2 | 7125 | LONGEST. */ |
14f9c5c9 AS |
7126 | RU = 0; |
7127 | while (isdigit (str[k])) | |
7128 | { | |
d2e4a39e | 7129 | RU = RU * 10 + (str[k] - '0'); |
14f9c5c9 AS |
7130 | k += 1; |
7131 | } | |
7132 | ||
d2e4a39e | 7133 | if (str[k] == 'm') |
14f9c5c9 AS |
7134 | { |
7135 | if (R != NULL) | |
4c4b4cd2 | 7136 | *R = (-(LONGEST) (RU - 1)) - 1; |
14f9c5c9 AS |
7137 | k += 1; |
7138 | } | |
7139 | else if (R != NULL) | |
7140 | *R = (LONGEST) RU; | |
7141 | ||
4c4b4cd2 | 7142 | /* NOTE on the above: Technically, C does not say what the results of |
14f9c5c9 AS |
7143 | - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive |
7144 | number representable as a LONGEST (although either would probably work | |
7145 | in most implementations). When RU>0, the locution in the then branch | |
4c4b4cd2 | 7146 | above is always equivalent to the negative of RU. */ |
14f9c5c9 AS |
7147 | |
7148 | if (new_k != NULL) | |
7149 | *new_k = k; | |
7150 | return 1; | |
7151 | } | |
7152 | ||
4c4b4cd2 PH |
7153 | /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field), |
7154 | and FIELD_NUM is a valid field number within it, returns 1 iff VAL is | |
7155 | in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */ | |
14f9c5c9 | 7156 | |
d2e4a39e | 7157 | int |
ebf56fd3 | 7158 | ada_in_variant (LONGEST val, struct type *type, int field_num) |
14f9c5c9 | 7159 | { |
d2e4a39e | 7160 | const char *name = TYPE_FIELD_NAME (type, field_num); |
14f9c5c9 AS |
7161 | int p; |
7162 | ||
7163 | p = 0; | |
7164 | while (1) | |
7165 | { | |
d2e4a39e | 7166 | switch (name[p]) |
4c4b4cd2 PH |
7167 | { |
7168 | case '\0': | |
7169 | return 0; | |
7170 | case 'S': | |
7171 | { | |
7172 | LONGEST W; | |
5b4ee69b | 7173 | |
4c4b4cd2 PH |
7174 | if (!ada_scan_number (name, p + 1, &W, &p)) |
7175 | return 0; | |
7176 | if (val == W) | |
7177 | return 1; | |
7178 | break; | |
7179 | } | |
7180 | case 'R': | |
7181 | { | |
7182 | LONGEST L, U; | |
5b4ee69b | 7183 | |
4c4b4cd2 PH |
7184 | if (!ada_scan_number (name, p + 1, &L, &p) |
7185 | || name[p] != 'T' || !ada_scan_number (name, p + 1, &U, &p)) | |
7186 | return 0; | |
7187 | if (val >= L && val <= U) | |
7188 | return 1; | |
7189 | break; | |
7190 | } | |
7191 | case 'O': | |
7192 | return 1; | |
7193 | default: | |
7194 | return 0; | |
7195 | } | |
7196 | } | |
7197 | } | |
7198 | ||
0963b4bd | 7199 | /* FIXME: Lots of redundancy below. Try to consolidate. */ |
4c4b4cd2 PH |
7200 | |
7201 | /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type | |
7202 | ARG_TYPE, extract and return the value of one of its (non-static) | |
7203 | fields. FIELDNO says which field. Differs from value_primitive_field | |
7204 | only in that it can handle packed values of arbitrary type. */ | |
14f9c5c9 | 7205 | |
4c4b4cd2 | 7206 | static struct value * |
d2e4a39e | 7207 | ada_value_primitive_field (struct value *arg1, int offset, int fieldno, |
4c4b4cd2 | 7208 | struct type *arg_type) |
14f9c5c9 | 7209 | { |
14f9c5c9 AS |
7210 | struct type *type; |
7211 | ||
61ee279c | 7212 | arg_type = ada_check_typedef (arg_type); |
14f9c5c9 AS |
7213 | type = TYPE_FIELD_TYPE (arg_type, fieldno); |
7214 | ||
4c4b4cd2 | 7215 | /* Handle packed fields. */ |
14f9c5c9 AS |
7216 | |
7217 | if (TYPE_FIELD_BITSIZE (arg_type, fieldno) != 0) | |
7218 | { | |
7219 | int bit_pos = TYPE_FIELD_BITPOS (arg_type, fieldno); | |
7220 | int bit_size = TYPE_FIELD_BITSIZE (arg_type, fieldno); | |
d2e4a39e | 7221 | |
0fd88904 | 7222 | return ada_value_primitive_packed_val (arg1, value_contents (arg1), |
4c4b4cd2 PH |
7223 | offset + bit_pos / 8, |
7224 | bit_pos % 8, bit_size, type); | |
14f9c5c9 AS |
7225 | } |
7226 | else | |
7227 | return value_primitive_field (arg1, offset, fieldno, arg_type); | |
7228 | } | |
7229 | ||
52ce6436 PH |
7230 | /* Find field with name NAME in object of type TYPE. If found, |
7231 | set the following for each argument that is non-null: | |
7232 | - *FIELD_TYPE_P to the field's type; | |
7233 | - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within | |
7234 | an object of that type; | |
7235 | - *BIT_OFFSET_P to the bit offset modulo byte size of the field; | |
7236 | - *BIT_SIZE_P to its size in bits if the field is packed, and | |
7237 | 0 otherwise; | |
7238 | If INDEX_P is non-null, increment *INDEX_P by the number of source-visible | |
7239 | fields up to but not including the desired field, or by the total | |
7240 | number of fields if not found. A NULL value of NAME never | |
7241 | matches; the function just counts visible fields in this case. | |
7242 | ||
828d5846 XR |
7243 | Notice that we need to handle when a tagged record hierarchy |
7244 | has some components with the same name, like in this scenario: | |
7245 | ||
7246 | type Top_T is tagged record | |
7247 | N : Integer := 1; | |
7248 | U : Integer := 974; | |
7249 | A : Integer := 48; | |
7250 | end record; | |
7251 | ||
7252 | type Middle_T is new Top.Top_T with record | |
7253 | N : Character := 'a'; | |
7254 | C : Integer := 3; | |
7255 | end record; | |
7256 | ||
7257 | type Bottom_T is new Middle.Middle_T with record | |
7258 | N : Float := 4.0; | |
7259 | C : Character := '5'; | |
7260 | X : Integer := 6; | |
7261 | A : Character := 'J'; | |
7262 | end record; | |
7263 | ||
7264 | Let's say we now have a variable declared and initialized as follow: | |
7265 | ||
7266 | TC : Top_A := new Bottom_T; | |
7267 | ||
7268 | And then we use this variable to call this function | |
7269 | ||
7270 | procedure Assign (Obj: in out Top_T; TV : Integer); | |
7271 | ||
7272 | as follow: | |
7273 | ||
7274 | Assign (Top_T (B), 12); | |
7275 | ||
7276 | Now, we're in the debugger, and we're inside that procedure | |
7277 | then and we want to print the value of obj.c: | |
7278 | ||
7279 | Usually, the tagged record or one of the parent type owns the | |
7280 | component to print and there's no issue but in this particular | |
7281 | case, what does it mean to ask for Obj.C? Since the actual | |
7282 | type for object is type Bottom_T, it could mean two things: type | |
7283 | component C from the Middle_T view, but also component C from | |
7284 | Bottom_T. So in that "undefined" case, when the component is | |
7285 | not found in the non-resolved type (which includes all the | |
7286 | components of the parent type), then resolve it and see if we | |
7287 | get better luck once expanded. | |
7288 | ||
7289 | In the case of homonyms in the derived tagged type, we don't | |
7290 | guaranty anything, and pick the one that's easiest for us | |
7291 | to program. | |
7292 | ||
0963b4bd | 7293 | Returns 1 if found, 0 otherwise. */ |
52ce6436 | 7294 | |
4c4b4cd2 | 7295 | static int |
0d5cff50 | 7296 | find_struct_field (const char *name, struct type *type, int offset, |
76a01679 | 7297 | struct type **field_type_p, |
52ce6436 PH |
7298 | int *byte_offset_p, int *bit_offset_p, int *bit_size_p, |
7299 | int *index_p) | |
4c4b4cd2 PH |
7300 | { |
7301 | int i; | |
828d5846 | 7302 | int parent_offset = -1; |
4c4b4cd2 | 7303 | |
61ee279c | 7304 | type = ada_check_typedef (type); |
76a01679 | 7305 | |
52ce6436 PH |
7306 | if (field_type_p != NULL) |
7307 | *field_type_p = NULL; | |
7308 | if (byte_offset_p != NULL) | |
d5d6fca5 | 7309 | *byte_offset_p = 0; |
52ce6436 PH |
7310 | if (bit_offset_p != NULL) |
7311 | *bit_offset_p = 0; | |
7312 | if (bit_size_p != NULL) | |
7313 | *bit_size_p = 0; | |
7314 | ||
7315 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
4c4b4cd2 PH |
7316 | { |
7317 | int bit_pos = TYPE_FIELD_BITPOS (type, i); | |
7318 | int fld_offset = offset + bit_pos / 8; | |
0d5cff50 | 7319 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
76a01679 | 7320 | |
4c4b4cd2 PH |
7321 | if (t_field_name == NULL) |
7322 | continue; | |
7323 | ||
828d5846 XR |
7324 | else if (ada_is_parent_field (type, i)) |
7325 | { | |
7326 | /* This is a field pointing us to the parent type of a tagged | |
7327 | type. As hinted in this function's documentation, we give | |
7328 | preference to fields in the current record first, so what | |
7329 | we do here is just record the index of this field before | |
7330 | we skip it. If it turns out we couldn't find our field | |
7331 | in the current record, then we'll get back to it and search | |
7332 | inside it whether the field might exist in the parent. */ | |
7333 | ||
7334 | parent_offset = i; | |
7335 | continue; | |
7336 | } | |
7337 | ||
52ce6436 | 7338 | else if (name != NULL && field_name_match (t_field_name, name)) |
76a01679 JB |
7339 | { |
7340 | int bit_size = TYPE_FIELD_BITSIZE (type, i); | |
5b4ee69b | 7341 | |
52ce6436 PH |
7342 | if (field_type_p != NULL) |
7343 | *field_type_p = TYPE_FIELD_TYPE (type, i); | |
7344 | if (byte_offset_p != NULL) | |
7345 | *byte_offset_p = fld_offset; | |
7346 | if (bit_offset_p != NULL) | |
7347 | *bit_offset_p = bit_pos % 8; | |
7348 | if (bit_size_p != NULL) | |
7349 | *bit_size_p = bit_size; | |
76a01679 JB |
7350 | return 1; |
7351 | } | |
4c4b4cd2 PH |
7352 | else if (ada_is_wrapper_field (type, i)) |
7353 | { | |
52ce6436 PH |
7354 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, i), fld_offset, |
7355 | field_type_p, byte_offset_p, bit_offset_p, | |
7356 | bit_size_p, index_p)) | |
76a01679 JB |
7357 | return 1; |
7358 | } | |
4c4b4cd2 PH |
7359 | else if (ada_is_variant_part (type, i)) |
7360 | { | |
52ce6436 PH |
7361 | /* PNH: Wait. Do we ever execute this section, or is ARG always of |
7362 | fixed type?? */ | |
4c4b4cd2 | 7363 | int j; |
52ce6436 PH |
7364 | struct type *field_type |
7365 | = ada_check_typedef (TYPE_FIELD_TYPE (type, i)); | |
4c4b4cd2 | 7366 | |
52ce6436 | 7367 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7368 | { |
76a01679 JB |
7369 | if (find_struct_field (name, TYPE_FIELD_TYPE (field_type, j), |
7370 | fld_offset | |
7371 | + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7372 | field_type_p, byte_offset_p, | |
52ce6436 | 7373 | bit_offset_p, bit_size_p, index_p)) |
76a01679 | 7374 | return 1; |
4c4b4cd2 PH |
7375 | } |
7376 | } | |
52ce6436 PH |
7377 | else if (index_p != NULL) |
7378 | *index_p += 1; | |
4c4b4cd2 | 7379 | } |
828d5846 XR |
7380 | |
7381 | /* Field not found so far. If this is a tagged type which | |
7382 | has a parent, try finding that field in the parent now. */ | |
7383 | ||
7384 | if (parent_offset != -1) | |
7385 | { | |
7386 | int bit_pos = TYPE_FIELD_BITPOS (type, parent_offset); | |
7387 | int fld_offset = offset + bit_pos / 8; | |
7388 | ||
7389 | if (find_struct_field (name, TYPE_FIELD_TYPE (type, parent_offset), | |
7390 | fld_offset, field_type_p, byte_offset_p, | |
7391 | bit_offset_p, bit_size_p, index_p)) | |
7392 | return 1; | |
7393 | } | |
7394 | ||
4c4b4cd2 PH |
7395 | return 0; |
7396 | } | |
7397 | ||
0963b4bd | 7398 | /* Number of user-visible fields in record type TYPE. */ |
4c4b4cd2 | 7399 | |
52ce6436 PH |
7400 | static int |
7401 | num_visible_fields (struct type *type) | |
7402 | { | |
7403 | int n; | |
5b4ee69b | 7404 | |
52ce6436 PH |
7405 | n = 0; |
7406 | find_struct_field (NULL, type, 0, NULL, NULL, NULL, NULL, &n); | |
7407 | return n; | |
7408 | } | |
14f9c5c9 | 7409 | |
4c4b4cd2 | 7410 | /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes, |
14f9c5c9 AS |
7411 | and search in it assuming it has (class) type TYPE. |
7412 | If found, return value, else return NULL. | |
7413 | ||
828d5846 XR |
7414 | Searches recursively through wrapper fields (e.g., '_parent'). |
7415 | ||
7416 | In the case of homonyms in the tagged types, please refer to the | |
7417 | long explanation in find_struct_field's function documentation. */ | |
14f9c5c9 | 7418 | |
4c4b4cd2 | 7419 | static struct value * |
108d56a4 | 7420 | ada_search_struct_field (const char *name, struct value *arg, int offset, |
4c4b4cd2 | 7421 | struct type *type) |
14f9c5c9 AS |
7422 | { |
7423 | int i; | |
828d5846 | 7424 | int parent_offset = -1; |
14f9c5c9 | 7425 | |
5b4ee69b | 7426 | type = ada_check_typedef (type); |
52ce6436 | 7427 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) |
14f9c5c9 | 7428 | { |
0d5cff50 | 7429 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 AS |
7430 | |
7431 | if (t_field_name == NULL) | |
4c4b4cd2 | 7432 | continue; |
14f9c5c9 | 7433 | |
828d5846 XR |
7434 | else if (ada_is_parent_field (type, i)) |
7435 | { | |
7436 | /* This is a field pointing us to the parent type of a tagged | |
7437 | type. As hinted in this function's documentation, we give | |
7438 | preference to fields in the current record first, so what | |
7439 | we do here is just record the index of this field before | |
7440 | we skip it. If it turns out we couldn't find our field | |
7441 | in the current record, then we'll get back to it and search | |
7442 | inside it whether the field might exist in the parent. */ | |
7443 | ||
7444 | parent_offset = i; | |
7445 | continue; | |
7446 | } | |
7447 | ||
14f9c5c9 | 7448 | else if (field_name_match (t_field_name, name)) |
4c4b4cd2 | 7449 | return ada_value_primitive_field (arg, offset, i, type); |
14f9c5c9 AS |
7450 | |
7451 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7452 | { |
0963b4bd | 7453 | struct value *v = /* Do not let indent join lines here. */ |
06d5cf63 JB |
7454 | ada_search_struct_field (name, arg, |
7455 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7456 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7457 | |
4c4b4cd2 PH |
7458 | if (v != NULL) |
7459 | return v; | |
7460 | } | |
14f9c5c9 AS |
7461 | |
7462 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 | 7463 | { |
0963b4bd | 7464 | /* PNH: Do we ever get here? See find_struct_field. */ |
4c4b4cd2 | 7465 | int j; |
5b4ee69b MS |
7466 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7467 | i)); | |
4c4b4cd2 PH |
7468 | int var_offset = offset + TYPE_FIELD_BITPOS (type, i) / 8; |
7469 | ||
52ce6436 | 7470 | for (j = 0; j < TYPE_NFIELDS (field_type); j += 1) |
4c4b4cd2 | 7471 | { |
0963b4bd MS |
7472 | struct value *v = ada_search_struct_field /* Force line |
7473 | break. */ | |
06d5cf63 JB |
7474 | (name, arg, |
7475 | var_offset + TYPE_FIELD_BITPOS (field_type, j) / 8, | |
7476 | TYPE_FIELD_TYPE (field_type, j)); | |
5b4ee69b | 7477 | |
4c4b4cd2 PH |
7478 | if (v != NULL) |
7479 | return v; | |
7480 | } | |
7481 | } | |
14f9c5c9 | 7482 | } |
828d5846 XR |
7483 | |
7484 | /* Field not found so far. If this is a tagged type which | |
7485 | has a parent, try finding that field in the parent now. */ | |
7486 | ||
7487 | if (parent_offset != -1) | |
7488 | { | |
7489 | struct value *v = ada_search_struct_field ( | |
7490 | name, arg, offset + TYPE_FIELD_BITPOS (type, parent_offset) / 8, | |
7491 | TYPE_FIELD_TYPE (type, parent_offset)); | |
7492 | ||
7493 | if (v != NULL) | |
7494 | return v; | |
7495 | } | |
7496 | ||
14f9c5c9 AS |
7497 | return NULL; |
7498 | } | |
d2e4a39e | 7499 | |
52ce6436 PH |
7500 | static struct value *ada_index_struct_field_1 (int *, struct value *, |
7501 | int, struct type *); | |
7502 | ||
7503 | ||
7504 | /* Return field #INDEX in ARG, where the index is that returned by | |
7505 | * find_struct_field through its INDEX_P argument. Adjust the address | |
7506 | * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE. | |
0963b4bd | 7507 | * If found, return value, else return NULL. */ |
52ce6436 PH |
7508 | |
7509 | static struct value * | |
7510 | ada_index_struct_field (int index, struct value *arg, int offset, | |
7511 | struct type *type) | |
7512 | { | |
7513 | return ada_index_struct_field_1 (&index, arg, offset, type); | |
7514 | } | |
7515 | ||
7516 | ||
7517 | /* Auxiliary function for ada_index_struct_field. Like | |
7518 | * ada_index_struct_field, but takes index from *INDEX_P and modifies | |
0963b4bd | 7519 | * *INDEX_P. */ |
52ce6436 PH |
7520 | |
7521 | static struct value * | |
7522 | ada_index_struct_field_1 (int *index_p, struct value *arg, int offset, | |
7523 | struct type *type) | |
7524 | { | |
7525 | int i; | |
7526 | type = ada_check_typedef (type); | |
7527 | ||
7528 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7529 | { | |
7530 | if (TYPE_FIELD_NAME (type, i) == NULL) | |
7531 | continue; | |
7532 | else if (ada_is_wrapper_field (type, i)) | |
7533 | { | |
0963b4bd | 7534 | struct value *v = /* Do not let indent join lines here. */ |
52ce6436 PH |
7535 | ada_index_struct_field_1 (index_p, arg, |
7536 | offset + TYPE_FIELD_BITPOS (type, i) / 8, | |
7537 | TYPE_FIELD_TYPE (type, i)); | |
5b4ee69b | 7538 | |
52ce6436 PH |
7539 | if (v != NULL) |
7540 | return v; | |
7541 | } | |
7542 | ||
7543 | else if (ada_is_variant_part (type, i)) | |
7544 | { | |
7545 | /* PNH: Do we ever get here? See ada_search_struct_field, | |
0963b4bd | 7546 | find_struct_field. */ |
52ce6436 PH |
7547 | error (_("Cannot assign this kind of variant record")); |
7548 | } | |
7549 | else if (*index_p == 0) | |
7550 | return ada_value_primitive_field (arg, offset, i, type); | |
7551 | else | |
7552 | *index_p -= 1; | |
7553 | } | |
7554 | return NULL; | |
7555 | } | |
7556 | ||
4c4b4cd2 PH |
7557 | /* Given ARG, a value of type (pointer or reference to a)* |
7558 | structure/union, extract the component named NAME from the ultimate | |
7559 | target structure/union and return it as a value with its | |
f5938064 | 7560 | appropriate type. |
14f9c5c9 | 7561 | |
4c4b4cd2 PH |
7562 | The routine searches for NAME among all members of the structure itself |
7563 | and (recursively) among all members of any wrapper members | |
14f9c5c9 AS |
7564 | (e.g., '_parent'). |
7565 | ||
03ee6b2e PH |
7566 | If NO_ERR, then simply return NULL in case of error, rather than |
7567 | calling error. */ | |
14f9c5c9 | 7568 | |
d2e4a39e | 7569 | struct value * |
a121b7c1 | 7570 | ada_value_struct_elt (struct value *arg, const char *name, int no_err) |
14f9c5c9 | 7571 | { |
4c4b4cd2 | 7572 | struct type *t, *t1; |
d2e4a39e | 7573 | struct value *v; |
14f9c5c9 | 7574 | |
4c4b4cd2 | 7575 | v = NULL; |
df407dfe | 7576 | t1 = t = ada_check_typedef (value_type (arg)); |
4c4b4cd2 PH |
7577 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7578 | { | |
7579 | t1 = TYPE_TARGET_TYPE (t); | |
7580 | if (t1 == NULL) | |
03ee6b2e | 7581 | goto BadValue; |
61ee279c | 7582 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7583 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 | 7584 | { |
994b9211 | 7585 | arg = coerce_ref (arg); |
76a01679 JB |
7586 | t = t1; |
7587 | } | |
4c4b4cd2 | 7588 | } |
14f9c5c9 | 7589 | |
4c4b4cd2 PH |
7590 | while (TYPE_CODE (t) == TYPE_CODE_PTR) |
7591 | { | |
7592 | t1 = TYPE_TARGET_TYPE (t); | |
7593 | if (t1 == NULL) | |
03ee6b2e | 7594 | goto BadValue; |
61ee279c | 7595 | t1 = ada_check_typedef (t1); |
4c4b4cd2 | 7596 | if (TYPE_CODE (t1) == TYPE_CODE_PTR) |
76a01679 JB |
7597 | { |
7598 | arg = value_ind (arg); | |
7599 | t = t1; | |
7600 | } | |
4c4b4cd2 | 7601 | else |
76a01679 | 7602 | break; |
4c4b4cd2 | 7603 | } |
14f9c5c9 | 7604 | |
4c4b4cd2 | 7605 | if (TYPE_CODE (t1) != TYPE_CODE_STRUCT && TYPE_CODE (t1) != TYPE_CODE_UNION) |
03ee6b2e | 7606 | goto BadValue; |
14f9c5c9 | 7607 | |
4c4b4cd2 PH |
7608 | if (t1 == t) |
7609 | v = ada_search_struct_field (name, arg, 0, t); | |
7610 | else | |
7611 | { | |
7612 | int bit_offset, bit_size, byte_offset; | |
7613 | struct type *field_type; | |
7614 | CORE_ADDR address; | |
7615 | ||
76a01679 | 7616 | if (TYPE_CODE (t) == TYPE_CODE_PTR) |
b50d69b5 | 7617 | address = value_address (ada_value_ind (arg)); |
4c4b4cd2 | 7618 | else |
b50d69b5 | 7619 | address = value_address (ada_coerce_ref (arg)); |
14f9c5c9 | 7620 | |
828d5846 XR |
7621 | /* Check to see if this is a tagged type. We also need to handle |
7622 | the case where the type is a reference to a tagged type, but | |
7623 | we have to be careful to exclude pointers to tagged types. | |
7624 | The latter should be shown as usual (as a pointer), whereas | |
7625 | a reference should mostly be transparent to the user. */ | |
7626 | ||
7627 | if (ada_is_tagged_type (t1, 0) | |
7628 | || (TYPE_CODE (t1) == TYPE_CODE_REF | |
7629 | && ada_is_tagged_type (TYPE_TARGET_TYPE (t1), 0))) | |
7630 | { | |
7631 | /* We first try to find the searched field in the current type. | |
7632 | If not found then let's look in the fixed type. */ | |
7633 | ||
7634 | if (!find_struct_field (name, t1, 0, | |
7635 | &field_type, &byte_offset, &bit_offset, | |
7636 | &bit_size, NULL)) | |
7637 | t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, | |
7638 | address, NULL, 1); | |
7639 | } | |
7640 | else | |
7641 | t1 = ada_to_fixed_type (ada_get_base_type (t1), NULL, | |
7642 | address, NULL, 1); | |
7643 | ||
76a01679 JB |
7644 | if (find_struct_field (name, t1, 0, |
7645 | &field_type, &byte_offset, &bit_offset, | |
52ce6436 | 7646 | &bit_size, NULL)) |
76a01679 JB |
7647 | { |
7648 | if (bit_size != 0) | |
7649 | { | |
714e53ab PH |
7650 | if (TYPE_CODE (t) == TYPE_CODE_REF) |
7651 | arg = ada_coerce_ref (arg); | |
7652 | else | |
7653 | arg = ada_value_ind (arg); | |
76a01679 JB |
7654 | v = ada_value_primitive_packed_val (arg, NULL, byte_offset, |
7655 | bit_offset, bit_size, | |
7656 | field_type); | |
7657 | } | |
7658 | else | |
f5938064 | 7659 | v = value_at_lazy (field_type, address + byte_offset); |
76a01679 JB |
7660 | } |
7661 | } | |
7662 | ||
03ee6b2e PH |
7663 | if (v != NULL || no_err) |
7664 | return v; | |
7665 | else | |
323e0a4a | 7666 | error (_("There is no member named %s."), name); |
14f9c5c9 | 7667 | |
03ee6b2e PH |
7668 | BadValue: |
7669 | if (no_err) | |
7670 | return NULL; | |
7671 | else | |
0963b4bd MS |
7672 | error (_("Attempt to extract a component of " |
7673 | "a value that is not a record.")); | |
14f9c5c9 AS |
7674 | } |
7675 | ||
3b4de39c | 7676 | /* Return a string representation of type TYPE. */ |
99bbb428 | 7677 | |
3b4de39c | 7678 | static std::string |
99bbb428 PA |
7679 | type_as_string (struct type *type) |
7680 | { | |
d7e74731 | 7681 | string_file tmp_stream; |
99bbb428 | 7682 | |
d7e74731 | 7683 | type_print (type, "", &tmp_stream, -1); |
99bbb428 | 7684 | |
d7e74731 | 7685 | return std::move (tmp_stream.string ()); |
99bbb428 PA |
7686 | } |
7687 | ||
14f9c5c9 | 7688 | /* Given a type TYPE, look up the type of the component of type named NAME. |
4c4b4cd2 PH |
7689 | If DISPP is non-null, add its byte displacement from the beginning of a |
7690 | structure (pointed to by a value) of type TYPE to *DISPP (does not | |
14f9c5c9 AS |
7691 | work for packed fields). |
7692 | ||
7693 | Matches any field whose name has NAME as a prefix, possibly | |
4c4b4cd2 | 7694 | followed by "___". |
14f9c5c9 | 7695 | |
0963b4bd | 7696 | TYPE can be either a struct or union. If REFOK, TYPE may also |
4c4b4cd2 PH |
7697 | be a (pointer or reference)+ to a struct or union, and the |
7698 | ultimate target type will be searched. | |
14f9c5c9 AS |
7699 | |
7700 | Looks recursively into variant clauses and parent types. | |
7701 | ||
828d5846 XR |
7702 | In the case of homonyms in the tagged types, please refer to the |
7703 | long explanation in find_struct_field's function documentation. | |
7704 | ||
4c4b4cd2 PH |
7705 | If NOERR is nonzero, return NULL if NAME is not suitably defined or |
7706 | TYPE is not a type of the right kind. */ | |
14f9c5c9 | 7707 | |
4c4b4cd2 | 7708 | static struct type * |
a121b7c1 | 7709 | ada_lookup_struct_elt_type (struct type *type, const char *name, int refok, |
988f6b3d | 7710 | int noerr) |
14f9c5c9 AS |
7711 | { |
7712 | int i; | |
828d5846 | 7713 | int parent_offset = -1; |
14f9c5c9 AS |
7714 | |
7715 | if (name == NULL) | |
7716 | goto BadName; | |
7717 | ||
76a01679 | 7718 | if (refok && type != NULL) |
4c4b4cd2 PH |
7719 | while (1) |
7720 | { | |
61ee279c | 7721 | type = ada_check_typedef (type); |
76a01679 JB |
7722 | if (TYPE_CODE (type) != TYPE_CODE_PTR |
7723 | && TYPE_CODE (type) != TYPE_CODE_REF) | |
7724 | break; | |
7725 | type = TYPE_TARGET_TYPE (type); | |
4c4b4cd2 | 7726 | } |
14f9c5c9 | 7727 | |
76a01679 | 7728 | if (type == NULL |
1265e4aa JB |
7729 | || (TYPE_CODE (type) != TYPE_CODE_STRUCT |
7730 | && TYPE_CODE (type) != TYPE_CODE_UNION)) | |
14f9c5c9 | 7731 | { |
4c4b4cd2 | 7732 | if (noerr) |
76a01679 | 7733 | return NULL; |
99bbb428 | 7734 | |
3b4de39c PA |
7735 | error (_("Type %s is not a structure or union type"), |
7736 | type != NULL ? type_as_string (type).c_str () : _("(null)")); | |
14f9c5c9 AS |
7737 | } |
7738 | ||
7739 | type = to_static_fixed_type (type); | |
7740 | ||
7741 | for (i = 0; i < TYPE_NFIELDS (type); i += 1) | |
7742 | { | |
0d5cff50 | 7743 | const char *t_field_name = TYPE_FIELD_NAME (type, i); |
14f9c5c9 | 7744 | struct type *t; |
d2e4a39e | 7745 | |
14f9c5c9 | 7746 | if (t_field_name == NULL) |
4c4b4cd2 | 7747 | continue; |
14f9c5c9 | 7748 | |
828d5846 XR |
7749 | else if (ada_is_parent_field (type, i)) |
7750 | { | |
7751 | /* This is a field pointing us to the parent type of a tagged | |
7752 | type. As hinted in this function's documentation, we give | |
7753 | preference to fields in the current record first, so what | |
7754 | we do here is just record the index of this field before | |
7755 | we skip it. If it turns out we couldn't find our field | |
7756 | in the current record, then we'll get back to it and search | |
7757 | inside it whether the field might exist in the parent. */ | |
7758 | ||
7759 | parent_offset = i; | |
7760 | continue; | |
7761 | } | |
7762 | ||
14f9c5c9 | 7763 | else if (field_name_match (t_field_name, name)) |
988f6b3d | 7764 | return TYPE_FIELD_TYPE (type, i); |
14f9c5c9 AS |
7765 | |
7766 | else if (ada_is_wrapper_field (type, i)) | |
4c4b4cd2 | 7767 | { |
4c4b4cd2 | 7768 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, i), name, |
988f6b3d | 7769 | 0, 1); |
4c4b4cd2 | 7770 | if (t != NULL) |
988f6b3d | 7771 | return t; |
4c4b4cd2 | 7772 | } |
14f9c5c9 AS |
7773 | |
7774 | else if (ada_is_variant_part (type, i)) | |
4c4b4cd2 PH |
7775 | { |
7776 | int j; | |
5b4ee69b MS |
7777 | struct type *field_type = ada_check_typedef (TYPE_FIELD_TYPE (type, |
7778 | i)); | |
4c4b4cd2 PH |
7779 | |
7780 | for (j = TYPE_NFIELDS (field_type) - 1; j >= 0; j -= 1) | |
7781 | { | |
b1f33ddd JB |
7782 | /* FIXME pnh 2008/01/26: We check for a field that is |
7783 | NOT wrapped in a struct, since the compiler sometimes | |
7784 | generates these for unchecked variant types. Revisit | |
0963b4bd | 7785 | if the compiler changes this practice. */ |
0d5cff50 | 7786 | const char *v_field_name = TYPE_FIELD_NAME (field_type, j); |
988f6b3d | 7787 | |
b1f33ddd JB |
7788 | if (v_field_name != NULL |
7789 | && field_name_match (v_field_name, name)) | |
460efde1 | 7790 | t = TYPE_FIELD_TYPE (field_type, j); |
b1f33ddd | 7791 | else |
0963b4bd MS |
7792 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type, |
7793 | j), | |
988f6b3d | 7794 | name, 0, 1); |
b1f33ddd | 7795 | |
4c4b4cd2 | 7796 | if (t != NULL) |
988f6b3d | 7797 | return t; |
4c4b4cd2 PH |
7798 | } |
7799 | } | |
14f9c5c9 AS |
7800 | |
7801 | } | |
7802 | ||
828d5846 XR |
7803 | /* Field not found so far. If this is a tagged type which |
7804 | has a parent, try finding that field in the parent now. */ | |
7805 | ||
7806 | if (parent_offset != -1) | |
7807 | { | |
7808 | struct type *t; | |
7809 | ||
7810 | t = ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type, parent_offset), | |
7811 | name, 0, 1); | |
7812 | if (t != NULL) | |
7813 | return t; | |
7814 | } | |
7815 | ||
14f9c5c9 | 7816 | BadName: |
d2e4a39e | 7817 | if (!noerr) |
14f9c5c9 | 7818 | { |
2b2798cc | 7819 | const char *name_str = name != NULL ? name : _("<null>"); |
99bbb428 PA |
7820 | |
7821 | error (_("Type %s has no component named %s"), | |
3b4de39c | 7822 | type_as_string (type).c_str (), name_str); |
14f9c5c9 AS |
7823 | } |
7824 | ||
7825 | return NULL; | |
7826 | } | |
7827 | ||
b1f33ddd JB |
7828 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7829 | within a value of type OUTER_TYPE, return true iff VAR_TYPE | |
7830 | represents an unchecked union (that is, the variant part of a | |
0963b4bd | 7831 | record that is named in an Unchecked_Union pragma). */ |
b1f33ddd JB |
7832 | |
7833 | static int | |
7834 | is_unchecked_variant (struct type *var_type, struct type *outer_type) | |
7835 | { | |
a121b7c1 | 7836 | const char *discrim_name = ada_variant_discrim_name (var_type); |
5b4ee69b | 7837 | |
988f6b3d | 7838 | return (ada_lookup_struct_elt_type (outer_type, discrim_name, 0, 1) == NULL); |
b1f33ddd JB |
7839 | } |
7840 | ||
7841 | ||
14f9c5c9 AS |
7842 | /* Assuming that VAR_TYPE is the type of a variant part of a record (a union), |
7843 | within a value of type OUTER_TYPE that is stored in GDB at | |
4c4b4cd2 PH |
7844 | OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE, |
7845 | numbering from 0) is applicable. Returns -1 if none are. */ | |
14f9c5c9 | 7846 | |
d2e4a39e | 7847 | int |
ebf56fd3 | 7848 | ada_which_variant_applies (struct type *var_type, struct type *outer_type, |
fc1a4b47 | 7849 | const gdb_byte *outer_valaddr) |
14f9c5c9 AS |
7850 | { |
7851 | int others_clause; | |
7852 | int i; | |
a121b7c1 | 7853 | const char *discrim_name = ada_variant_discrim_name (var_type); |
0c281816 JB |
7854 | struct value *outer; |
7855 | struct value *discrim; | |
14f9c5c9 AS |
7856 | LONGEST discrim_val; |
7857 | ||
012370f6 TT |
7858 | /* Using plain value_from_contents_and_address here causes problems |
7859 | because we will end up trying to resolve a type that is currently | |
7860 | being constructed. */ | |
7861 | outer = value_from_contents_and_address_unresolved (outer_type, | |
7862 | outer_valaddr, 0); | |
0c281816 JB |
7863 | discrim = ada_value_struct_elt (outer, discrim_name, 1); |
7864 | if (discrim == NULL) | |
14f9c5c9 | 7865 | return -1; |
0c281816 | 7866 | discrim_val = value_as_long (discrim); |
14f9c5c9 AS |
7867 | |
7868 | others_clause = -1; | |
7869 | for (i = 0; i < TYPE_NFIELDS (var_type); i += 1) | |
7870 | { | |
7871 | if (ada_is_others_clause (var_type, i)) | |
4c4b4cd2 | 7872 | others_clause = i; |
14f9c5c9 | 7873 | else if (ada_in_variant (discrim_val, var_type, i)) |
4c4b4cd2 | 7874 | return i; |
14f9c5c9 AS |
7875 | } |
7876 | ||
7877 | return others_clause; | |
7878 | } | |
d2e4a39e | 7879 | \f |
14f9c5c9 AS |
7880 | |
7881 | ||
4c4b4cd2 | 7882 | /* Dynamic-Sized Records */ |
14f9c5c9 AS |
7883 | |
7884 | /* Strategy: The type ostensibly attached to a value with dynamic size | |
7885 | (i.e., a size that is not statically recorded in the debugging | |
7886 | data) does not accurately reflect the size or layout of the value. | |
7887 | Our strategy is to convert these values to values with accurate, | |
4c4b4cd2 | 7888 | conventional types that are constructed on the fly. */ |
14f9c5c9 AS |
7889 | |
7890 | /* There is a subtle and tricky problem here. In general, we cannot | |
7891 | determine the size of dynamic records without its data. However, | |
7892 | the 'struct value' data structure, which GDB uses to represent | |
7893 | quantities in the inferior process (the target), requires the size | |
7894 | of the type at the time of its allocation in order to reserve space | |
7895 | for GDB's internal copy of the data. That's why the | |
7896 | 'to_fixed_xxx_type' routines take (target) addresses as parameters, | |
4c4b4cd2 | 7897 | rather than struct value*s. |
14f9c5c9 AS |
7898 | |
7899 | However, GDB's internal history variables ($1, $2, etc.) are | |
7900 | struct value*s containing internal copies of the data that are not, in | |
7901 | general, the same as the data at their corresponding addresses in | |
7902 | the target. Fortunately, the types we give to these values are all | |
7903 | conventional, fixed-size types (as per the strategy described | |
7904 | above), so that we don't usually have to perform the | |
7905 | 'to_fixed_xxx_type' conversions to look at their values. | |
7906 | Unfortunately, there is one exception: if one of the internal | |
7907 | history variables is an array whose elements are unconstrained | |
7908 | records, then we will need to create distinct fixed types for each | |
7909 | element selected. */ | |
7910 | ||
7911 | /* The upshot of all of this is that many routines take a (type, host | |
7912 | address, target address) triple as arguments to represent a value. | |
7913 | The host address, if non-null, is supposed to contain an internal | |
7914 | copy of the relevant data; otherwise, the program is to consult the | |
4c4b4cd2 | 7915 | target at the target address. */ |
14f9c5c9 AS |
7916 | |
7917 | /* Assuming that VAL0 represents a pointer value, the result of | |
7918 | dereferencing it. Differs from value_ind in its treatment of | |
4c4b4cd2 | 7919 | dynamic-sized types. */ |
14f9c5c9 | 7920 | |
d2e4a39e AS |
7921 | struct value * |
7922 | ada_value_ind (struct value *val0) | |
14f9c5c9 | 7923 | { |
c48db5ca | 7924 | struct value *val = value_ind (val0); |
5b4ee69b | 7925 | |
b50d69b5 JG |
7926 | if (ada_is_tagged_type (value_type (val), 0)) |
7927 | val = ada_tag_value_at_base_address (val); | |
7928 | ||
4c4b4cd2 | 7929 | return ada_to_fixed_value (val); |
14f9c5c9 AS |
7930 | } |
7931 | ||
7932 | /* The value resulting from dereferencing any "reference to" | |
4c4b4cd2 PH |
7933 | qualifiers on VAL0. */ |
7934 | ||
d2e4a39e AS |
7935 | static struct value * |
7936 | ada_coerce_ref (struct value *val0) | |
7937 | { | |
df407dfe | 7938 | if (TYPE_CODE (value_type (val0)) == TYPE_CODE_REF) |
d2e4a39e AS |
7939 | { |
7940 | struct value *val = val0; | |
5b4ee69b | 7941 | |
994b9211 | 7942 | val = coerce_ref (val); |
b50d69b5 JG |
7943 | |
7944 | if (ada_is_tagged_type (value_type (val), 0)) | |
7945 | val = ada_tag_value_at_base_address (val); | |
7946 | ||
4c4b4cd2 | 7947 | return ada_to_fixed_value (val); |
d2e4a39e AS |
7948 | } |
7949 | else | |
14f9c5c9 AS |
7950 | return val0; |
7951 | } | |
7952 | ||
7953 | /* Return OFF rounded upward if necessary to a multiple of | |
4c4b4cd2 | 7954 | ALIGNMENT (a power of 2). */ |
14f9c5c9 AS |
7955 | |
7956 | static unsigned int | |
ebf56fd3 | 7957 | align_value (unsigned int off, unsigned int alignment) |
14f9c5c9 AS |
7958 | { |
7959 | return (off + alignment - 1) & ~(alignment - 1); | |
7960 | } | |
7961 | ||
4c4b4cd2 | 7962 | /* Return the bit alignment required for field #F of template type TYPE. */ |
14f9c5c9 AS |
7963 | |
7964 | static unsigned int | |
ebf56fd3 | 7965 | field_alignment (struct type *type, int f) |
14f9c5c9 | 7966 | { |
d2e4a39e | 7967 | const char *name = TYPE_FIELD_NAME (type, f); |
64a1bf19 | 7968 | int len; |
14f9c5c9 AS |
7969 | int align_offset; |
7970 | ||
64a1bf19 JB |
7971 | /* The field name should never be null, unless the debugging information |
7972 | is somehow malformed. In this case, we assume the field does not | |
7973 | require any alignment. */ | |
7974 | if (name == NULL) | |
7975 | return 1; | |
7976 | ||
7977 | len = strlen (name); | |
7978 | ||
4c4b4cd2 PH |
7979 | if (!isdigit (name[len - 1])) |
7980 | return 1; | |
14f9c5c9 | 7981 | |
d2e4a39e | 7982 | if (isdigit (name[len - 2])) |
14f9c5c9 AS |
7983 | align_offset = len - 2; |
7984 | else | |
7985 | align_offset = len - 1; | |
7986 | ||
61012eef | 7987 | if (align_offset < 7 || !startswith (name + align_offset - 6, "___XV")) |
14f9c5c9 AS |
7988 | return TARGET_CHAR_BIT; |
7989 | ||
4c4b4cd2 PH |
7990 | return atoi (name + align_offset) * TARGET_CHAR_BIT; |
7991 | } | |
7992 | ||
852dff6c | 7993 | /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */ |
4c4b4cd2 | 7994 | |
852dff6c JB |
7995 | static struct symbol * |
7996 | ada_find_any_type_symbol (const char *name) | |
4c4b4cd2 PH |
7997 | { |
7998 | struct symbol *sym; | |
7999 | ||
8000 | sym = standard_lookup (name, get_selected_block (NULL), VAR_DOMAIN); | |
4186eb54 | 8001 | if (sym != NULL && SYMBOL_CLASS (sym) == LOC_TYPEDEF) |
4c4b4cd2 PH |
8002 | return sym; |
8003 | ||
4186eb54 KS |
8004 | sym = standard_lookup (name, NULL, STRUCT_DOMAIN); |
8005 | return sym; | |
14f9c5c9 AS |
8006 | } |
8007 | ||
dddfab26 UW |
8008 | /* Find a type named NAME. Ignores ambiguity. This routine will look |
8009 | solely for types defined by debug info, it will not search the GDB | |
8010 | primitive types. */ | |
4c4b4cd2 | 8011 | |
852dff6c | 8012 | static struct type * |
ebf56fd3 | 8013 | ada_find_any_type (const char *name) |
14f9c5c9 | 8014 | { |
852dff6c | 8015 | struct symbol *sym = ada_find_any_type_symbol (name); |
14f9c5c9 | 8016 | |
14f9c5c9 | 8017 | if (sym != NULL) |
dddfab26 | 8018 | return SYMBOL_TYPE (sym); |
14f9c5c9 | 8019 | |
dddfab26 | 8020 | return NULL; |
14f9c5c9 AS |
8021 | } |
8022 | ||
739593e0 JB |
8023 | /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol |
8024 | associated with NAME_SYM's name. NAME_SYM may itself be a renaming | |
8025 | symbol, in which case it is returned. Otherwise, this looks for | |
8026 | symbols whose name is that of NAME_SYM suffixed with "___XR". | |
8027 | Return symbol if found, and NULL otherwise. */ | |
4c4b4cd2 PH |
8028 | |
8029 | struct symbol * | |
270140bd | 8030 | ada_find_renaming_symbol (struct symbol *name_sym, const struct block *block) |
aeb5907d | 8031 | { |
739593e0 | 8032 | const char *name = SYMBOL_LINKAGE_NAME (name_sym); |
aeb5907d JB |
8033 | struct symbol *sym; |
8034 | ||
739593e0 JB |
8035 | if (strstr (name, "___XR") != NULL) |
8036 | return name_sym; | |
8037 | ||
aeb5907d JB |
8038 | sym = find_old_style_renaming_symbol (name, block); |
8039 | ||
8040 | if (sym != NULL) | |
8041 | return sym; | |
8042 | ||
0963b4bd | 8043 | /* Not right yet. FIXME pnh 7/20/2007. */ |
852dff6c | 8044 | sym = ada_find_any_type_symbol (name); |
aeb5907d JB |
8045 | if (sym != NULL && strstr (SYMBOL_LINKAGE_NAME (sym), "___XR") != NULL) |
8046 | return sym; | |
8047 | else | |
8048 | return NULL; | |
8049 | } | |
8050 | ||
8051 | static struct symbol * | |
270140bd | 8052 | find_old_style_renaming_symbol (const char *name, const struct block *block) |
4c4b4cd2 | 8053 | { |
7f0df278 | 8054 | const struct symbol *function_sym = block_linkage_function (block); |
4c4b4cd2 PH |
8055 | char *rename; |
8056 | ||
8057 | if (function_sym != NULL) | |
8058 | { | |
8059 | /* If the symbol is defined inside a function, NAME is not fully | |
8060 | qualified. This means we need to prepend the function name | |
8061 | as well as adding the ``___XR'' suffix to build the name of | |
8062 | the associated renaming symbol. */ | |
0d5cff50 | 8063 | const char *function_name = SYMBOL_LINKAGE_NAME (function_sym); |
529cad9c PH |
8064 | /* Function names sometimes contain suffixes used |
8065 | for instance to qualify nested subprograms. When building | |
8066 | the XR type name, we need to make sure that this suffix is | |
8067 | not included. So do not include any suffix in the function | |
8068 | name length below. */ | |
69fadcdf | 8069 | int function_name_len = ada_name_prefix_len (function_name); |
76a01679 JB |
8070 | const int rename_len = function_name_len + 2 /* "__" */ |
8071 | + strlen (name) + 6 /* "___XR\0" */ ; | |
4c4b4cd2 | 8072 | |
529cad9c | 8073 | /* Strip the suffix if necessary. */ |
69fadcdf JB |
8074 | ada_remove_trailing_digits (function_name, &function_name_len); |
8075 | ada_remove_po_subprogram_suffix (function_name, &function_name_len); | |
8076 | ada_remove_Xbn_suffix (function_name, &function_name_len); | |
529cad9c | 8077 | |
4c4b4cd2 PH |
8078 | /* Library-level functions are a special case, as GNAT adds |
8079 | a ``_ada_'' prefix to the function name to avoid namespace | |
aeb5907d | 8080 | pollution. However, the renaming symbols themselves do not |
4c4b4cd2 PH |
8081 | have this prefix, so we need to skip this prefix if present. */ |
8082 | if (function_name_len > 5 /* "_ada_" */ | |
8083 | && strstr (function_name, "_ada_") == function_name) | |
69fadcdf JB |
8084 | { |
8085 | function_name += 5; | |
8086 | function_name_len -= 5; | |
8087 | } | |
4c4b4cd2 PH |
8088 | |
8089 | rename = (char *) alloca (rename_len * sizeof (char)); | |
69fadcdf JB |
8090 | strncpy (rename, function_name, function_name_len); |
8091 | xsnprintf (rename + function_name_len, rename_len - function_name_len, | |
8092 | "__%s___XR", name); | |
4c4b4cd2 PH |
8093 | } |
8094 | else | |
8095 | { | |
8096 | const int rename_len = strlen (name) + 6; | |
5b4ee69b | 8097 | |
4c4b4cd2 | 8098 | rename = (char *) alloca (rename_len * sizeof (char)); |
88c15c34 | 8099 | xsnprintf (rename, rename_len * sizeof (char), "%s___XR", name); |
4c4b4cd2 PH |
8100 | } |
8101 | ||
852dff6c | 8102 | return ada_find_any_type_symbol (rename); |
4c4b4cd2 PH |
8103 | } |
8104 | ||
14f9c5c9 | 8105 | /* Because of GNAT encoding conventions, several GDB symbols may match a |
4c4b4cd2 | 8106 | given type name. If the type denoted by TYPE0 is to be preferred to |
14f9c5c9 | 8107 | that of TYPE1 for purposes of type printing, return non-zero; |
4c4b4cd2 PH |
8108 | otherwise return 0. */ |
8109 | ||
14f9c5c9 | 8110 | int |
d2e4a39e | 8111 | ada_prefer_type (struct type *type0, struct type *type1) |
14f9c5c9 AS |
8112 | { |
8113 | if (type1 == NULL) | |
8114 | return 1; | |
8115 | else if (type0 == NULL) | |
8116 | return 0; | |
8117 | else if (TYPE_CODE (type1) == TYPE_CODE_VOID) | |
8118 | return 1; | |
8119 | else if (TYPE_CODE (type0) == TYPE_CODE_VOID) | |
8120 | return 0; | |
4c4b4cd2 PH |
8121 | else if (TYPE_NAME (type1) == NULL && TYPE_NAME (type0) != NULL) |
8122 | return 1; | |
ad82864c | 8123 | else if (ada_is_constrained_packed_array_type (type0)) |
14f9c5c9 | 8124 | return 1; |
4c4b4cd2 PH |
8125 | else if (ada_is_array_descriptor_type (type0) |
8126 | && !ada_is_array_descriptor_type (type1)) | |
14f9c5c9 | 8127 | return 1; |
aeb5907d JB |
8128 | else |
8129 | { | |
8130 | const char *type0_name = type_name_no_tag (type0); | |
8131 | const char *type1_name = type_name_no_tag (type1); | |
8132 | ||
8133 | if (type0_name != NULL && strstr (type0_name, "___XR") != NULL | |
8134 | && (type1_name == NULL || strstr (type1_name, "___XR") == NULL)) | |
8135 | return 1; | |
8136 | } | |
14f9c5c9 AS |
8137 | return 0; |
8138 | } | |
8139 | ||
8140 | /* The name of TYPE, which is either its TYPE_NAME, or, if that is | |
4c4b4cd2 PH |
8141 | null, its TYPE_TAG_NAME. Null if TYPE is null. */ |
8142 | ||
0d5cff50 | 8143 | const char * |
d2e4a39e | 8144 | ada_type_name (struct type *type) |
14f9c5c9 | 8145 | { |
d2e4a39e | 8146 | if (type == NULL) |
14f9c5c9 AS |
8147 | return NULL; |
8148 | else if (TYPE_NAME (type) != NULL) | |
8149 | return TYPE_NAME (type); | |
8150 | else | |
8151 | return TYPE_TAG_NAME (type); | |
8152 | } | |
8153 | ||
b4ba55a1 JB |
8154 | /* Search the list of "descriptive" types associated to TYPE for a type |
8155 | whose name is NAME. */ | |
8156 | ||
8157 | static struct type * | |
8158 | find_parallel_type_by_descriptive_type (struct type *type, const char *name) | |
8159 | { | |
931e5bc3 | 8160 | struct type *result, *tmp; |
b4ba55a1 | 8161 | |
c6044dd1 JB |
8162 | if (ada_ignore_descriptive_types_p) |
8163 | return NULL; | |
8164 | ||
b4ba55a1 JB |
8165 | /* If there no descriptive-type info, then there is no parallel type |
8166 | to be found. */ | |
8167 | if (!HAVE_GNAT_AUX_INFO (type)) | |
8168 | return NULL; | |
8169 | ||
8170 | result = TYPE_DESCRIPTIVE_TYPE (type); | |
8171 | while (result != NULL) | |
8172 | { | |
0d5cff50 | 8173 | const char *result_name = ada_type_name (result); |
b4ba55a1 JB |
8174 | |
8175 | if (result_name == NULL) | |
8176 | { | |
8177 | warning (_("unexpected null name on descriptive type")); | |
8178 | return NULL; | |
8179 | } | |
8180 | ||
8181 | /* If the names match, stop. */ | |
8182 | if (strcmp (result_name, name) == 0) | |
8183 | break; | |
8184 | ||
8185 | /* Otherwise, look at the next item on the list, if any. */ | |
8186 | if (HAVE_GNAT_AUX_INFO (result)) | |
931e5bc3 JG |
8187 | tmp = TYPE_DESCRIPTIVE_TYPE (result); |
8188 | else | |
8189 | tmp = NULL; | |
8190 | ||
8191 | /* If not found either, try after having resolved the typedef. */ | |
8192 | if (tmp != NULL) | |
8193 | result = tmp; | |
b4ba55a1 | 8194 | else |
931e5bc3 | 8195 | { |
f168693b | 8196 | result = check_typedef (result); |
931e5bc3 JG |
8197 | if (HAVE_GNAT_AUX_INFO (result)) |
8198 | result = TYPE_DESCRIPTIVE_TYPE (result); | |
8199 | else | |
8200 | result = NULL; | |
8201 | } | |
b4ba55a1 JB |
8202 | } |
8203 | ||
8204 | /* If we didn't find a match, see whether this is a packed array. With | |
8205 | older compilers, the descriptive type information is either absent or | |
8206 | irrelevant when it comes to packed arrays so the above lookup fails. | |
8207 | Fall back to using a parallel lookup by name in this case. */ | |
12ab9e09 | 8208 | if (result == NULL && ada_is_constrained_packed_array_type (type)) |
b4ba55a1 JB |
8209 | return ada_find_any_type (name); |
8210 | ||
8211 | return result; | |
8212 | } | |
8213 | ||
8214 | /* Find a parallel type to TYPE with the specified NAME, using the | |
8215 | descriptive type taken from the debugging information, if available, | |
8216 | and otherwise using the (slower) name-based method. */ | |
8217 | ||
8218 | static struct type * | |
8219 | ada_find_parallel_type_with_name (struct type *type, const char *name) | |
8220 | { | |
8221 | struct type *result = NULL; | |
8222 | ||
8223 | if (HAVE_GNAT_AUX_INFO (type)) | |
8224 | result = find_parallel_type_by_descriptive_type (type, name); | |
8225 | else | |
8226 | result = ada_find_any_type (name); | |
8227 | ||
8228 | return result; | |
8229 | } | |
8230 | ||
8231 | /* Same as above, but specify the name of the parallel type by appending | |
4c4b4cd2 | 8232 | SUFFIX to the name of TYPE. */ |
14f9c5c9 | 8233 | |
d2e4a39e | 8234 | struct type * |
ebf56fd3 | 8235 | ada_find_parallel_type (struct type *type, const char *suffix) |
14f9c5c9 | 8236 | { |
0d5cff50 | 8237 | char *name; |
fe978cb0 | 8238 | const char *type_name = ada_type_name (type); |
14f9c5c9 | 8239 | int len; |
d2e4a39e | 8240 | |
fe978cb0 | 8241 | if (type_name == NULL) |
14f9c5c9 AS |
8242 | return NULL; |
8243 | ||
fe978cb0 | 8244 | len = strlen (type_name); |
14f9c5c9 | 8245 | |
b4ba55a1 | 8246 | name = (char *) alloca (len + strlen (suffix) + 1); |
14f9c5c9 | 8247 | |
fe978cb0 | 8248 | strcpy (name, type_name); |
14f9c5c9 AS |
8249 | strcpy (name + len, suffix); |
8250 | ||
b4ba55a1 | 8251 | return ada_find_parallel_type_with_name (type, name); |
14f9c5c9 AS |
8252 | } |
8253 | ||
14f9c5c9 | 8254 | /* If TYPE is a variable-size record type, return the corresponding template |
4c4b4cd2 | 8255 | type describing its fields. Otherwise, return NULL. */ |
14f9c5c9 | 8256 | |
d2e4a39e AS |
8257 | static struct type * |
8258 | dynamic_template_type (struct type *type) | |
14f9c5c9 | 8259 | { |
61ee279c | 8260 | type = ada_check_typedef (type); |
14f9c5c9 AS |
8261 | |
8262 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT | |
d2e4a39e | 8263 | || ada_type_name (type) == NULL) |
14f9c5c9 | 8264 | return NULL; |
d2e4a39e | 8265 | else |
14f9c5c9 AS |
8266 | { |
8267 | int len = strlen (ada_type_name (type)); | |
5b4ee69b | 8268 | |
4c4b4cd2 PH |
8269 | if (len > 6 && strcmp (ada_type_name (type) + len - 6, "___XVE") == 0) |
8270 | return type; | |
14f9c5c9 | 8271 | else |
4c4b4cd2 | 8272 | return ada_find_parallel_type (type, "___XVE"); |
14f9c5c9 AS |
8273 | } |
8274 | } | |
8275 | ||
8276 | /* Assuming that TEMPL_TYPE is a union or struct type, returns | |
4c4b4cd2 | 8277 | non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */ |
14f9c5c9 | 8278 | |
d2e4a39e AS |
8279 | static int |
8280 | is_dynamic_field (struct type *templ_type, int field_num) | |
14f9c5c9 AS |
8281 | { |
8282 | const char *name = TYPE_FIELD_NAME (templ_type, field_num); | |
5b4ee69b | 8283 | |
d2e4a39e | 8284 | return name != NULL |
14f9c5c9 AS |
8285 | && TYPE_CODE (TYPE_FIELD_TYPE (templ_type, field_num)) == TYPE_CODE_PTR |
8286 | && strstr (name, "___XVL") != NULL; | |
8287 | } | |
8288 | ||
4c4b4cd2 PH |
8289 | /* The index of the variant field of TYPE, or -1 if TYPE does not |
8290 | represent a variant record type. */ | |
14f9c5c9 | 8291 | |
d2e4a39e | 8292 | static int |
4c4b4cd2 | 8293 | variant_field_index (struct type *type) |
14f9c5c9 AS |
8294 | { |
8295 | int f; | |
8296 | ||
4c4b4cd2 PH |
8297 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_STRUCT) |
8298 | return -1; | |
8299 | ||
8300 | for (f = 0; f < TYPE_NFIELDS (type); f += 1) | |
8301 | { | |
8302 | if (ada_is_variant_part (type, f)) | |
8303 | return f; | |
8304 | } | |
8305 | return -1; | |
14f9c5c9 AS |
8306 | } |
8307 | ||
4c4b4cd2 PH |
8308 | /* A record type with no fields. */ |
8309 | ||
d2e4a39e | 8310 | static struct type * |
fe978cb0 | 8311 | empty_record (struct type *templ) |
14f9c5c9 | 8312 | { |
fe978cb0 | 8313 | struct type *type = alloc_type_copy (templ); |
5b4ee69b | 8314 | |
14f9c5c9 AS |
8315 | TYPE_CODE (type) = TYPE_CODE_STRUCT; |
8316 | TYPE_NFIELDS (type) = 0; | |
8317 | TYPE_FIELDS (type) = NULL; | |
b1f33ddd | 8318 | INIT_CPLUS_SPECIFIC (type); |
14f9c5c9 AS |
8319 | TYPE_NAME (type) = "<empty>"; |
8320 | TYPE_TAG_NAME (type) = NULL; | |
14f9c5c9 AS |
8321 | TYPE_LENGTH (type) = 0; |
8322 | return type; | |
8323 | } | |
8324 | ||
8325 | /* An ordinary record type (with fixed-length fields) that describes | |
4c4b4cd2 PH |
8326 | the value of type TYPE at VALADDR or ADDRESS (see comments at |
8327 | the beginning of this section) VAL according to GNAT conventions. | |
8328 | DVAL0 should describe the (portion of a) record that contains any | |
df407dfe | 8329 | necessary discriminants. It should be NULL if value_type (VAL) is |
14f9c5c9 AS |
8330 | an outer-level type (i.e., as opposed to a branch of a variant.) A |
8331 | variant field (unless unchecked) is replaced by a particular branch | |
4c4b4cd2 | 8332 | of the variant. |
14f9c5c9 | 8333 | |
4c4b4cd2 PH |
8334 | If not KEEP_DYNAMIC_FIELDS, then all fields whose position or |
8335 | length are not statically known are discarded. As a consequence, | |
8336 | VALADDR, ADDRESS and DVAL0 are ignored. | |
8337 | ||
8338 | NOTE: Limitations: For now, we assume that dynamic fields and | |
8339 | variants occupy whole numbers of bytes. However, they need not be | |
8340 | byte-aligned. */ | |
8341 | ||
8342 | struct type * | |
10a2c479 | 8343 | ada_template_to_fixed_record_type_1 (struct type *type, |
fc1a4b47 | 8344 | const gdb_byte *valaddr, |
4c4b4cd2 PH |
8345 | CORE_ADDR address, struct value *dval0, |
8346 | int keep_dynamic_fields) | |
14f9c5c9 | 8347 | { |
d2e4a39e AS |
8348 | struct value *mark = value_mark (); |
8349 | struct value *dval; | |
8350 | struct type *rtype; | |
14f9c5c9 | 8351 | int nfields, bit_len; |
4c4b4cd2 | 8352 | int variant_field; |
14f9c5c9 | 8353 | long off; |
d94e4f4f | 8354 | int fld_bit_len; |
14f9c5c9 AS |
8355 | int f; |
8356 | ||
4c4b4cd2 PH |
8357 | /* Compute the number of fields in this record type that are going |
8358 | to be processed: unless keep_dynamic_fields, this includes only | |
8359 | fields whose position and length are static will be processed. */ | |
8360 | if (keep_dynamic_fields) | |
8361 | nfields = TYPE_NFIELDS (type); | |
8362 | else | |
8363 | { | |
8364 | nfields = 0; | |
76a01679 | 8365 | while (nfields < TYPE_NFIELDS (type) |
4c4b4cd2 PH |
8366 | && !ada_is_variant_part (type, nfields) |
8367 | && !is_dynamic_field (type, nfields)) | |
8368 | nfields++; | |
8369 | } | |
8370 | ||
e9bb382b | 8371 | rtype = alloc_type_copy (type); |
14f9c5c9 AS |
8372 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
8373 | INIT_CPLUS_SPECIFIC (rtype); | |
8374 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e | 8375 | TYPE_FIELDS (rtype) = (struct field *) |
14f9c5c9 AS |
8376 | TYPE_ALLOC (rtype, nfields * sizeof (struct field)); |
8377 | memset (TYPE_FIELDS (rtype), 0, sizeof (struct field) * nfields); | |
8378 | TYPE_NAME (rtype) = ada_type_name (type); | |
8379 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8380 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 | 8381 | |
d2e4a39e AS |
8382 | off = 0; |
8383 | bit_len = 0; | |
4c4b4cd2 PH |
8384 | variant_field = -1; |
8385 | ||
14f9c5c9 AS |
8386 | for (f = 0; f < nfields; f += 1) |
8387 | { | |
6c038f32 PH |
8388 | off = align_value (off, field_alignment (type, f)) |
8389 | + TYPE_FIELD_BITPOS (type, f); | |
945b3a32 | 8390 | SET_FIELD_BITPOS (TYPE_FIELD (rtype, f), off); |
d2e4a39e | 8391 | TYPE_FIELD_BITSIZE (rtype, f) = 0; |
14f9c5c9 | 8392 | |
d2e4a39e | 8393 | if (ada_is_variant_part (type, f)) |
4c4b4cd2 PH |
8394 | { |
8395 | variant_field = f; | |
d94e4f4f | 8396 | fld_bit_len = 0; |
4c4b4cd2 | 8397 | } |
14f9c5c9 | 8398 | else if (is_dynamic_field (type, f)) |
4c4b4cd2 | 8399 | { |
284614f0 JB |
8400 | const gdb_byte *field_valaddr = valaddr; |
8401 | CORE_ADDR field_address = address; | |
8402 | struct type *field_type = | |
8403 | TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type, f)); | |
8404 | ||
4c4b4cd2 | 8405 | if (dval0 == NULL) |
b5304971 JG |
8406 | { |
8407 | /* rtype's length is computed based on the run-time | |
8408 | value of discriminants. If the discriminants are not | |
8409 | initialized, the type size may be completely bogus and | |
0963b4bd | 8410 | GDB may fail to allocate a value for it. So check the |
b5304971 | 8411 | size first before creating the value. */ |
c1b5a1a6 | 8412 | ada_ensure_varsize_limit (rtype); |
012370f6 TT |
8413 | /* Using plain value_from_contents_and_address here |
8414 | causes problems because we will end up trying to | |
8415 | resolve a type that is currently being | |
8416 | constructed. */ | |
8417 | dval = value_from_contents_and_address_unresolved (rtype, | |
8418 | valaddr, | |
8419 | address); | |
9f1f738a | 8420 | rtype = value_type (dval); |
b5304971 | 8421 | } |
4c4b4cd2 PH |
8422 | else |
8423 | dval = dval0; | |
8424 | ||
284614f0 JB |
8425 | /* If the type referenced by this field is an aligner type, we need |
8426 | to unwrap that aligner type, because its size might not be set. | |
8427 | Keeping the aligner type would cause us to compute the wrong | |
8428 | size for this field, impacting the offset of the all the fields | |
8429 | that follow this one. */ | |
8430 | if (ada_is_aligner_type (field_type)) | |
8431 | { | |
8432 | long field_offset = TYPE_FIELD_BITPOS (field_type, f); | |
8433 | ||
8434 | field_valaddr = cond_offset_host (field_valaddr, field_offset); | |
8435 | field_address = cond_offset_target (field_address, field_offset); | |
8436 | field_type = ada_aligned_type (field_type); | |
8437 | } | |
8438 | ||
8439 | field_valaddr = cond_offset_host (field_valaddr, | |
8440 | off / TARGET_CHAR_BIT); | |
8441 | field_address = cond_offset_target (field_address, | |
8442 | off / TARGET_CHAR_BIT); | |
8443 | ||
8444 | /* Get the fixed type of the field. Note that, in this case, | |
8445 | we do not want to get the real type out of the tag: if | |
8446 | the current field is the parent part of a tagged record, | |
8447 | we will get the tag of the object. Clearly wrong: the real | |
8448 | type of the parent is not the real type of the child. We | |
8449 | would end up in an infinite loop. */ | |
8450 | field_type = ada_get_base_type (field_type); | |
8451 | field_type = ada_to_fixed_type (field_type, field_valaddr, | |
8452 | field_address, dval, 0); | |
27f2a97b JB |
8453 | /* If the field size is already larger than the maximum |
8454 | object size, then the record itself will necessarily | |
8455 | be larger than the maximum object size. We need to make | |
8456 | this check now, because the size might be so ridiculously | |
8457 | large (due to an uninitialized variable in the inferior) | |
8458 | that it would cause an overflow when adding it to the | |
8459 | record size. */ | |
c1b5a1a6 | 8460 | ada_ensure_varsize_limit (field_type); |
284614f0 JB |
8461 | |
8462 | TYPE_FIELD_TYPE (rtype, f) = field_type; | |
4c4b4cd2 | 8463 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
27f2a97b JB |
8464 | /* The multiplication can potentially overflow. But because |
8465 | the field length has been size-checked just above, and | |
8466 | assuming that the maximum size is a reasonable value, | |
8467 | an overflow should not happen in practice. So rather than | |
8468 | adding overflow recovery code to this already complex code, | |
8469 | we just assume that it's not going to happen. */ | |
d94e4f4f | 8470 | fld_bit_len = |
4c4b4cd2 PH |
8471 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, f)) * TARGET_CHAR_BIT; |
8472 | } | |
14f9c5c9 | 8473 | else |
4c4b4cd2 | 8474 | { |
5ded5331 JB |
8475 | /* Note: If this field's type is a typedef, it is important |
8476 | to preserve the typedef layer. | |
8477 | ||
8478 | Otherwise, we might be transforming a typedef to a fat | |
8479 | pointer (encoding a pointer to an unconstrained array), | |
8480 | into a basic fat pointer (encoding an unconstrained | |
8481 | array). As both types are implemented using the same | |
8482 | structure, the typedef is the only clue which allows us | |
8483 | to distinguish between the two options. Stripping it | |
8484 | would prevent us from printing this field appropriately. */ | |
8485 | TYPE_FIELD_TYPE (rtype, f) = TYPE_FIELD_TYPE (type, f); | |
4c4b4cd2 PH |
8486 | TYPE_FIELD_NAME (rtype, f) = TYPE_FIELD_NAME (type, f); |
8487 | if (TYPE_FIELD_BITSIZE (type, f) > 0) | |
d94e4f4f | 8488 | fld_bit_len = |
4c4b4cd2 PH |
8489 | TYPE_FIELD_BITSIZE (rtype, f) = TYPE_FIELD_BITSIZE (type, f); |
8490 | else | |
5ded5331 JB |
8491 | { |
8492 | struct type *field_type = TYPE_FIELD_TYPE (type, f); | |
8493 | ||
8494 | /* We need to be careful of typedefs when computing | |
8495 | the length of our field. If this is a typedef, | |
8496 | get the length of the target type, not the length | |
8497 | of the typedef. */ | |
8498 | if (TYPE_CODE (field_type) == TYPE_CODE_TYPEDEF) | |
8499 | field_type = ada_typedef_target_type (field_type); | |
8500 | ||
8501 | fld_bit_len = | |
8502 | TYPE_LENGTH (ada_check_typedef (field_type)) * TARGET_CHAR_BIT; | |
8503 | } | |
4c4b4cd2 | 8504 | } |
14f9c5c9 | 8505 | if (off + fld_bit_len > bit_len) |
4c4b4cd2 | 8506 | bit_len = off + fld_bit_len; |
d94e4f4f | 8507 | off += fld_bit_len; |
4c4b4cd2 PH |
8508 | TYPE_LENGTH (rtype) = |
8509 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
14f9c5c9 | 8510 | } |
4c4b4cd2 PH |
8511 | |
8512 | /* We handle the variant part, if any, at the end because of certain | |
b1f33ddd | 8513 | odd cases in which it is re-ordered so as NOT to be the last field of |
4c4b4cd2 PH |
8514 | the record. This can happen in the presence of representation |
8515 | clauses. */ | |
8516 | if (variant_field >= 0) | |
8517 | { | |
8518 | struct type *branch_type; | |
8519 | ||
8520 | off = TYPE_FIELD_BITPOS (rtype, variant_field); | |
8521 | ||
8522 | if (dval0 == NULL) | |
9f1f738a | 8523 | { |
012370f6 TT |
8524 | /* Using plain value_from_contents_and_address here causes |
8525 | problems because we will end up trying to resolve a type | |
8526 | that is currently being constructed. */ | |
8527 | dval = value_from_contents_and_address_unresolved (rtype, valaddr, | |
8528 | address); | |
9f1f738a SA |
8529 | rtype = value_type (dval); |
8530 | } | |
4c4b4cd2 PH |
8531 | else |
8532 | dval = dval0; | |
8533 | ||
8534 | branch_type = | |
8535 | to_fixed_variant_branch_type | |
8536 | (TYPE_FIELD_TYPE (type, variant_field), | |
8537 | cond_offset_host (valaddr, off / TARGET_CHAR_BIT), | |
8538 | cond_offset_target (address, off / TARGET_CHAR_BIT), dval); | |
8539 | if (branch_type == NULL) | |
8540 | { | |
8541 | for (f = variant_field + 1; f < TYPE_NFIELDS (rtype); f += 1) | |
8542 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
8543 | TYPE_NFIELDS (rtype) -= 1; | |
8544 | } | |
8545 | else | |
8546 | { | |
8547 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; | |
8548 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8549 | fld_bit_len = | |
8550 | TYPE_LENGTH (TYPE_FIELD_TYPE (rtype, variant_field)) * | |
8551 | TARGET_CHAR_BIT; | |
8552 | if (off + fld_bit_len > bit_len) | |
8553 | bit_len = off + fld_bit_len; | |
8554 | TYPE_LENGTH (rtype) = | |
8555 | align_value (bit_len, TARGET_CHAR_BIT) / TARGET_CHAR_BIT; | |
8556 | } | |
8557 | } | |
8558 | ||
714e53ab PH |
8559 | /* According to exp_dbug.ads, the size of TYPE for variable-size records |
8560 | should contain the alignment of that record, which should be a strictly | |
8561 | positive value. If null or negative, then something is wrong, most | |
8562 | probably in the debug info. In that case, we don't round up the size | |
0963b4bd | 8563 | of the resulting type. If this record is not part of another structure, |
714e53ab PH |
8564 | the current RTYPE length might be good enough for our purposes. */ |
8565 | if (TYPE_LENGTH (type) <= 0) | |
8566 | { | |
323e0a4a AC |
8567 | if (TYPE_NAME (rtype)) |
8568 | warning (_("Invalid type size for `%s' detected: %d."), | |
8569 | TYPE_NAME (rtype), TYPE_LENGTH (type)); | |
8570 | else | |
8571 | warning (_("Invalid type size for <unnamed> detected: %d."), | |
8572 | TYPE_LENGTH (type)); | |
714e53ab PH |
8573 | } |
8574 | else | |
8575 | { | |
8576 | TYPE_LENGTH (rtype) = align_value (TYPE_LENGTH (rtype), | |
8577 | TYPE_LENGTH (type)); | |
8578 | } | |
14f9c5c9 AS |
8579 | |
8580 | value_free_to_mark (mark); | |
d2e4a39e | 8581 | if (TYPE_LENGTH (rtype) > varsize_limit) |
323e0a4a | 8582 | error (_("record type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
8583 | return rtype; |
8584 | } | |
8585 | ||
4c4b4cd2 PH |
8586 | /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS |
8587 | of 1. */ | |
14f9c5c9 | 8588 | |
d2e4a39e | 8589 | static struct type * |
fc1a4b47 | 8590 | template_to_fixed_record_type (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 PH |
8591 | CORE_ADDR address, struct value *dval0) |
8592 | { | |
8593 | return ada_template_to_fixed_record_type_1 (type, valaddr, | |
8594 | address, dval0, 1); | |
8595 | } | |
8596 | ||
8597 | /* An ordinary record type in which ___XVL-convention fields and | |
8598 | ___XVU- and ___XVN-convention field types in TYPE0 are replaced with | |
8599 | static approximations, containing all possible fields. Uses | |
8600 | no runtime values. Useless for use in values, but that's OK, | |
8601 | since the results are used only for type determinations. Works on both | |
8602 | structs and unions. Representation note: to save space, we memorize | |
8603 | the result of this function in the TYPE_TARGET_TYPE of the | |
8604 | template type. */ | |
8605 | ||
8606 | static struct type * | |
8607 | template_to_static_fixed_type (struct type *type0) | |
14f9c5c9 AS |
8608 | { |
8609 | struct type *type; | |
8610 | int nfields; | |
8611 | int f; | |
8612 | ||
9e195661 PMR |
8613 | /* No need no do anything if the input type is already fixed. */ |
8614 | if (TYPE_FIXED_INSTANCE (type0)) | |
8615 | return type0; | |
8616 | ||
8617 | /* Likewise if we already have computed the static approximation. */ | |
4c4b4cd2 PH |
8618 | if (TYPE_TARGET_TYPE (type0) != NULL) |
8619 | return TYPE_TARGET_TYPE (type0); | |
8620 | ||
9e195661 | 8621 | /* Don't clone TYPE0 until we are sure we are going to need a copy. */ |
4c4b4cd2 | 8622 | type = type0; |
9e195661 PMR |
8623 | nfields = TYPE_NFIELDS (type0); |
8624 | ||
8625 | /* Whether or not we cloned TYPE0, cache the result so that we don't do | |
8626 | recompute all over next time. */ | |
8627 | TYPE_TARGET_TYPE (type0) = type; | |
14f9c5c9 AS |
8628 | |
8629 | for (f = 0; f < nfields; f += 1) | |
8630 | { | |
460efde1 | 8631 | struct type *field_type = TYPE_FIELD_TYPE (type0, f); |
4c4b4cd2 | 8632 | struct type *new_type; |
14f9c5c9 | 8633 | |
4c4b4cd2 | 8634 | if (is_dynamic_field (type0, f)) |
460efde1 JB |
8635 | { |
8636 | field_type = ada_check_typedef (field_type); | |
8637 | new_type = to_static_fixed_type (TYPE_TARGET_TYPE (field_type)); | |
8638 | } | |
14f9c5c9 | 8639 | else |
f192137b | 8640 | new_type = static_unwrap_type (field_type); |
9e195661 PMR |
8641 | |
8642 | if (new_type != field_type) | |
8643 | { | |
8644 | /* Clone TYPE0 only the first time we get a new field type. */ | |
8645 | if (type == type0) | |
8646 | { | |
8647 | TYPE_TARGET_TYPE (type0) = type = alloc_type_copy (type0); | |
8648 | TYPE_CODE (type) = TYPE_CODE (type0); | |
8649 | INIT_CPLUS_SPECIFIC (type); | |
8650 | TYPE_NFIELDS (type) = nfields; | |
8651 | TYPE_FIELDS (type) = (struct field *) | |
8652 | TYPE_ALLOC (type, nfields * sizeof (struct field)); | |
8653 | memcpy (TYPE_FIELDS (type), TYPE_FIELDS (type0), | |
8654 | sizeof (struct field) * nfields); | |
8655 | TYPE_NAME (type) = ada_type_name (type0); | |
8656 | TYPE_TAG_NAME (type) = NULL; | |
8657 | TYPE_FIXED_INSTANCE (type) = 1; | |
8658 | TYPE_LENGTH (type) = 0; | |
8659 | } | |
8660 | TYPE_FIELD_TYPE (type, f) = new_type; | |
8661 | TYPE_FIELD_NAME (type, f) = TYPE_FIELD_NAME (type0, f); | |
8662 | } | |
14f9c5c9 | 8663 | } |
9e195661 | 8664 | |
14f9c5c9 AS |
8665 | return type; |
8666 | } | |
8667 | ||
4c4b4cd2 | 8668 | /* Given an object of type TYPE whose contents are at VALADDR and |
5823c3ef JB |
8669 | whose address in memory is ADDRESS, returns a revision of TYPE, |
8670 | which should be a non-dynamic-sized record, in which the variant | |
8671 | part, if any, is replaced with the appropriate branch. Looks | |
4c4b4cd2 PH |
8672 | for discriminant values in DVAL0, which can be NULL if the record |
8673 | contains the necessary discriminant values. */ | |
8674 | ||
d2e4a39e | 8675 | static struct type * |
fc1a4b47 | 8676 | to_record_with_fixed_variant_part (struct type *type, const gdb_byte *valaddr, |
4c4b4cd2 | 8677 | CORE_ADDR address, struct value *dval0) |
14f9c5c9 | 8678 | { |
d2e4a39e | 8679 | struct value *mark = value_mark (); |
4c4b4cd2 | 8680 | struct value *dval; |
d2e4a39e | 8681 | struct type *rtype; |
14f9c5c9 AS |
8682 | struct type *branch_type; |
8683 | int nfields = TYPE_NFIELDS (type); | |
4c4b4cd2 | 8684 | int variant_field = variant_field_index (type); |
14f9c5c9 | 8685 | |
4c4b4cd2 | 8686 | if (variant_field == -1) |
14f9c5c9 AS |
8687 | return type; |
8688 | ||
4c4b4cd2 | 8689 | if (dval0 == NULL) |
9f1f738a SA |
8690 | { |
8691 | dval = value_from_contents_and_address (type, valaddr, address); | |
8692 | type = value_type (dval); | |
8693 | } | |
4c4b4cd2 PH |
8694 | else |
8695 | dval = dval0; | |
8696 | ||
e9bb382b | 8697 | rtype = alloc_type_copy (type); |
14f9c5c9 | 8698 | TYPE_CODE (rtype) = TYPE_CODE_STRUCT; |
4c4b4cd2 PH |
8699 | INIT_CPLUS_SPECIFIC (rtype); |
8700 | TYPE_NFIELDS (rtype) = nfields; | |
d2e4a39e AS |
8701 | TYPE_FIELDS (rtype) = |
8702 | (struct field *) TYPE_ALLOC (rtype, nfields * sizeof (struct field)); | |
8703 | memcpy (TYPE_FIELDS (rtype), TYPE_FIELDS (type), | |
4c4b4cd2 | 8704 | sizeof (struct field) * nfields); |
14f9c5c9 AS |
8705 | TYPE_NAME (rtype) = ada_type_name (type); |
8706 | TYPE_TAG_NAME (rtype) = NULL; | |
876cecd0 | 8707 | TYPE_FIXED_INSTANCE (rtype) = 1; |
14f9c5c9 AS |
8708 | TYPE_LENGTH (rtype) = TYPE_LENGTH (type); |
8709 | ||
4c4b4cd2 PH |
8710 | branch_type = to_fixed_variant_branch_type |
8711 | (TYPE_FIELD_TYPE (type, variant_field), | |
d2e4a39e | 8712 | cond_offset_host (valaddr, |
4c4b4cd2 PH |
8713 | TYPE_FIELD_BITPOS (type, variant_field) |
8714 | / TARGET_CHAR_BIT), | |
d2e4a39e | 8715 | cond_offset_target (address, |
4c4b4cd2 PH |
8716 | TYPE_FIELD_BITPOS (type, variant_field) |
8717 | / TARGET_CHAR_BIT), dval); | |
d2e4a39e | 8718 | if (branch_type == NULL) |
14f9c5c9 | 8719 | { |
4c4b4cd2 | 8720 | int f; |
5b4ee69b | 8721 | |
4c4b4cd2 PH |
8722 | for (f = variant_field + 1; f < nfields; f += 1) |
8723 | TYPE_FIELDS (rtype)[f - 1] = TYPE_FIELDS (rtype)[f]; | |
14f9c5c9 | 8724 | TYPE_NFIELDS (rtype) -= 1; |
14f9c5c9 AS |
8725 | } |
8726 | else | |
8727 | { | |
4c4b4cd2 PH |
8728 | TYPE_FIELD_TYPE (rtype, variant_field) = branch_type; |
8729 | TYPE_FIELD_NAME (rtype, variant_field) = "S"; | |
8730 | TYPE_FIELD_BITSIZE (rtype, variant_field) = 0; | |
14f9c5c9 | 8731 | TYPE_LENGTH (rtype) += TYPE_LENGTH (branch_type); |
14f9c5c9 | 8732 | } |
4c4b4cd2 | 8733 | TYPE_LENGTH (rtype) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type, variant_field)); |
d2e4a39e | 8734 | |
4c4b4cd2 | 8735 | value_free_to_mark (mark); |
14f9c5c9 AS |
8736 | return rtype; |
8737 | } | |
8738 | ||
8739 | /* An ordinary record type (with fixed-length fields) that describes | |
8740 | the value at (TYPE0, VALADDR, ADDRESS) [see explanation at | |
8741 | beginning of this section]. Any necessary discriminants' values | |
4c4b4cd2 PH |
8742 | should be in DVAL, a record value; it may be NULL if the object |
8743 | at ADDR itself contains any necessary discriminant values. | |
8744 | Additionally, VALADDR and ADDRESS may also be NULL if no discriminant | |
8745 | values from the record are needed. Except in the case that DVAL, | |
8746 | VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless | |
8747 | unchecked) is replaced by a particular branch of the variant. | |
8748 | ||
8749 | NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0 | |
8750 | is questionable and may be removed. It can arise during the | |
8751 | processing of an unconstrained-array-of-record type where all the | |
8752 | variant branches have exactly the same size. This is because in | |
8753 | such cases, the compiler does not bother to use the XVS convention | |
8754 | when encoding the record. I am currently dubious of this | |
8755 | shortcut and suspect the compiler should be altered. FIXME. */ | |
14f9c5c9 | 8756 | |
d2e4a39e | 8757 | static struct type * |
fc1a4b47 | 8758 | to_fixed_record_type (struct type *type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8759 | CORE_ADDR address, struct value *dval) |
14f9c5c9 | 8760 | { |
d2e4a39e | 8761 | struct type *templ_type; |
14f9c5c9 | 8762 | |
876cecd0 | 8763 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
8764 | return type0; |
8765 | ||
d2e4a39e | 8766 | templ_type = dynamic_template_type (type0); |
14f9c5c9 AS |
8767 | |
8768 | if (templ_type != NULL) | |
8769 | return template_to_fixed_record_type (templ_type, valaddr, address, dval); | |
4c4b4cd2 PH |
8770 | else if (variant_field_index (type0) >= 0) |
8771 | { | |
8772 | if (dval == NULL && valaddr == NULL && address == 0) | |
8773 | return type0; | |
8774 | return to_record_with_fixed_variant_part (type0, valaddr, address, | |
8775 | dval); | |
8776 | } | |
14f9c5c9 AS |
8777 | else |
8778 | { | |
876cecd0 | 8779 | TYPE_FIXED_INSTANCE (type0) = 1; |
14f9c5c9 AS |
8780 | return type0; |
8781 | } | |
8782 | ||
8783 | } | |
8784 | ||
8785 | /* An ordinary record type (with fixed-length fields) that describes | |
8786 | the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a | |
8787 | union type. Any necessary discriminants' values should be in DVAL, | |
8788 | a record value. That is, this routine selects the appropriate | |
8789 | branch of the union at ADDR according to the discriminant value | |
b1f33ddd | 8790 | indicated in the union's type name. Returns VAR_TYPE0 itself if |
0963b4bd | 8791 | it represents a variant subject to a pragma Unchecked_Union. */ |
14f9c5c9 | 8792 | |
d2e4a39e | 8793 | static struct type * |
fc1a4b47 | 8794 | to_fixed_variant_branch_type (struct type *var_type0, const gdb_byte *valaddr, |
4c4b4cd2 | 8795 | CORE_ADDR address, struct value *dval) |
14f9c5c9 AS |
8796 | { |
8797 | int which; | |
d2e4a39e AS |
8798 | struct type *templ_type; |
8799 | struct type *var_type; | |
14f9c5c9 AS |
8800 | |
8801 | if (TYPE_CODE (var_type0) == TYPE_CODE_PTR) | |
8802 | var_type = TYPE_TARGET_TYPE (var_type0); | |
d2e4a39e | 8803 | else |
14f9c5c9 AS |
8804 | var_type = var_type0; |
8805 | ||
8806 | templ_type = ada_find_parallel_type (var_type, "___XVU"); | |
8807 | ||
8808 | if (templ_type != NULL) | |
8809 | var_type = templ_type; | |
8810 | ||
b1f33ddd JB |
8811 | if (is_unchecked_variant (var_type, value_type (dval))) |
8812 | return var_type0; | |
d2e4a39e AS |
8813 | which = |
8814 | ada_which_variant_applies (var_type, | |
0fd88904 | 8815 | value_type (dval), value_contents (dval)); |
14f9c5c9 AS |
8816 | |
8817 | if (which < 0) | |
e9bb382b | 8818 | return empty_record (var_type); |
14f9c5c9 | 8819 | else if (is_dynamic_field (var_type, which)) |
4c4b4cd2 | 8820 | return to_fixed_record_type |
d2e4a39e AS |
8821 | (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type, which)), |
8822 | valaddr, address, dval); | |
4c4b4cd2 | 8823 | else if (variant_field_index (TYPE_FIELD_TYPE (var_type, which)) >= 0) |
d2e4a39e AS |
8824 | return |
8825 | to_fixed_record_type | |
8826 | (TYPE_FIELD_TYPE (var_type, which), valaddr, address, dval); | |
14f9c5c9 AS |
8827 | else |
8828 | return TYPE_FIELD_TYPE (var_type, which); | |
8829 | } | |
8830 | ||
8908fca5 JB |
8831 | /* Assuming RANGE_TYPE is a TYPE_CODE_RANGE, return nonzero if |
8832 | ENCODING_TYPE, a type following the GNAT conventions for discrete | |
8833 | type encodings, only carries redundant information. */ | |
8834 | ||
8835 | static int | |
8836 | ada_is_redundant_range_encoding (struct type *range_type, | |
8837 | struct type *encoding_type) | |
8838 | { | |
108d56a4 | 8839 | const char *bounds_str; |
8908fca5 JB |
8840 | int n; |
8841 | LONGEST lo, hi; | |
8842 | ||
8843 | gdb_assert (TYPE_CODE (range_type) == TYPE_CODE_RANGE); | |
8844 | ||
005e2509 JB |
8845 | if (TYPE_CODE (get_base_type (range_type)) |
8846 | != TYPE_CODE (get_base_type (encoding_type))) | |
8847 | { | |
8848 | /* The compiler probably used a simple base type to describe | |
8849 | the range type instead of the range's actual base type, | |
8850 | expecting us to get the real base type from the encoding | |
8851 | anyway. In this situation, the encoding cannot be ignored | |
8852 | as redundant. */ | |
8853 | return 0; | |
8854 | } | |
8855 | ||
8908fca5 JB |
8856 | if (is_dynamic_type (range_type)) |
8857 | return 0; | |
8858 | ||
8859 | if (TYPE_NAME (encoding_type) == NULL) | |
8860 | return 0; | |
8861 | ||
8862 | bounds_str = strstr (TYPE_NAME (encoding_type), "___XDLU_"); | |
8863 | if (bounds_str == NULL) | |
8864 | return 0; | |
8865 | ||
8866 | n = 8; /* Skip "___XDLU_". */ | |
8867 | if (!ada_scan_number (bounds_str, n, &lo, &n)) | |
8868 | return 0; | |
8869 | if (TYPE_LOW_BOUND (range_type) != lo) | |
8870 | return 0; | |
8871 | ||
8872 | n += 2; /* Skip the "__" separator between the two bounds. */ | |
8873 | if (!ada_scan_number (bounds_str, n, &hi, &n)) | |
8874 | return 0; | |
8875 | if (TYPE_HIGH_BOUND (range_type) != hi) | |
8876 | return 0; | |
8877 | ||
8878 | return 1; | |
8879 | } | |
8880 | ||
8881 | /* Given the array type ARRAY_TYPE, return nonzero if DESC_TYPE, | |
8882 | a type following the GNAT encoding for describing array type | |
8883 | indices, only carries redundant information. */ | |
8884 | ||
8885 | static int | |
8886 | ada_is_redundant_index_type_desc (struct type *array_type, | |
8887 | struct type *desc_type) | |
8888 | { | |
8889 | struct type *this_layer = check_typedef (array_type); | |
8890 | int i; | |
8891 | ||
8892 | for (i = 0; i < TYPE_NFIELDS (desc_type); i++) | |
8893 | { | |
8894 | if (!ada_is_redundant_range_encoding (TYPE_INDEX_TYPE (this_layer), | |
8895 | TYPE_FIELD_TYPE (desc_type, i))) | |
8896 | return 0; | |
8897 | this_layer = check_typedef (TYPE_TARGET_TYPE (this_layer)); | |
8898 | } | |
8899 | ||
8900 | return 1; | |
8901 | } | |
8902 | ||
14f9c5c9 AS |
8903 | /* Assuming that TYPE0 is an array type describing the type of a value |
8904 | at ADDR, and that DVAL describes a record containing any | |
8905 | discriminants used in TYPE0, returns a type for the value that | |
8906 | contains no dynamic components (that is, no components whose sizes | |
8907 | are determined by run-time quantities). Unless IGNORE_TOO_BIG is | |
8908 | true, gives an error message if the resulting type's size is over | |
4c4b4cd2 | 8909 | varsize_limit. */ |
14f9c5c9 | 8910 | |
d2e4a39e AS |
8911 | static struct type * |
8912 | to_fixed_array_type (struct type *type0, struct value *dval, | |
4c4b4cd2 | 8913 | int ignore_too_big) |
14f9c5c9 | 8914 | { |
d2e4a39e AS |
8915 | struct type *index_type_desc; |
8916 | struct type *result; | |
ad82864c | 8917 | int constrained_packed_array_p; |
931e5bc3 | 8918 | static const char *xa_suffix = "___XA"; |
14f9c5c9 | 8919 | |
b0dd7688 | 8920 | type0 = ada_check_typedef (type0); |
284614f0 | 8921 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 | 8922 | return type0; |
14f9c5c9 | 8923 | |
ad82864c JB |
8924 | constrained_packed_array_p = ada_is_constrained_packed_array_type (type0); |
8925 | if (constrained_packed_array_p) | |
8926 | type0 = decode_constrained_packed_array_type (type0); | |
284614f0 | 8927 | |
931e5bc3 JG |
8928 | index_type_desc = ada_find_parallel_type (type0, xa_suffix); |
8929 | ||
8930 | /* As mentioned in exp_dbug.ads, for non bit-packed arrays an | |
8931 | encoding suffixed with 'P' may still be generated. If so, | |
8932 | it should be used to find the XA type. */ | |
8933 | ||
8934 | if (index_type_desc == NULL) | |
8935 | { | |
1da0522e | 8936 | const char *type_name = ada_type_name (type0); |
931e5bc3 | 8937 | |
1da0522e | 8938 | if (type_name != NULL) |
931e5bc3 | 8939 | { |
1da0522e | 8940 | const int len = strlen (type_name); |
931e5bc3 JG |
8941 | char *name = (char *) alloca (len + strlen (xa_suffix)); |
8942 | ||
1da0522e | 8943 | if (type_name[len - 1] == 'P') |
931e5bc3 | 8944 | { |
1da0522e | 8945 | strcpy (name, type_name); |
931e5bc3 JG |
8946 | strcpy (name + len - 1, xa_suffix); |
8947 | index_type_desc = ada_find_parallel_type_with_name (type0, name); | |
8948 | } | |
8949 | } | |
8950 | } | |
8951 | ||
28c85d6c | 8952 | ada_fixup_array_indexes_type (index_type_desc); |
8908fca5 JB |
8953 | if (index_type_desc != NULL |
8954 | && ada_is_redundant_index_type_desc (type0, index_type_desc)) | |
8955 | { | |
8956 | /* Ignore this ___XA parallel type, as it does not bring any | |
8957 | useful information. This allows us to avoid creating fixed | |
8958 | versions of the array's index types, which would be identical | |
8959 | to the original ones. This, in turn, can also help avoid | |
8960 | the creation of fixed versions of the array itself. */ | |
8961 | index_type_desc = NULL; | |
8962 | } | |
8963 | ||
14f9c5c9 AS |
8964 | if (index_type_desc == NULL) |
8965 | { | |
61ee279c | 8966 | struct type *elt_type0 = ada_check_typedef (TYPE_TARGET_TYPE (type0)); |
5b4ee69b | 8967 | |
14f9c5c9 | 8968 | /* NOTE: elt_type---the fixed version of elt_type0---should never |
4c4b4cd2 PH |
8969 | depend on the contents of the array in properly constructed |
8970 | debugging data. */ | |
529cad9c PH |
8971 | /* Create a fixed version of the array element type. |
8972 | We're not providing the address of an element here, | |
e1d5a0d2 | 8973 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
8974 | the conversion. This should not be a problem, since arrays of |
8975 | unconstrained objects are not allowed. In particular, all | |
8976 | the elements of an array of a tagged type should all be of | |
8977 | the same type specified in the debugging info. No need to | |
8978 | consult the object tag. */ | |
1ed6ede0 | 8979 | struct type *elt_type = ada_to_fixed_type (elt_type0, 0, 0, dval, 1); |
14f9c5c9 | 8980 | |
284614f0 JB |
8981 | /* Make sure we always create a new array type when dealing with |
8982 | packed array types, since we're going to fix-up the array | |
8983 | type length and element bitsize a little further down. */ | |
ad82864c | 8984 | if (elt_type0 == elt_type && !constrained_packed_array_p) |
4c4b4cd2 | 8985 | result = type0; |
14f9c5c9 | 8986 | else |
e9bb382b | 8987 | result = create_array_type (alloc_type_copy (type0), |
4c4b4cd2 | 8988 | elt_type, TYPE_INDEX_TYPE (type0)); |
14f9c5c9 AS |
8989 | } |
8990 | else | |
8991 | { | |
8992 | int i; | |
8993 | struct type *elt_type0; | |
8994 | ||
8995 | elt_type0 = type0; | |
8996 | for (i = TYPE_NFIELDS (index_type_desc); i > 0; i -= 1) | |
4c4b4cd2 | 8997 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
14f9c5c9 AS |
8998 | |
8999 | /* NOTE: result---the fixed version of elt_type0---should never | |
4c4b4cd2 PH |
9000 | depend on the contents of the array in properly constructed |
9001 | debugging data. */ | |
529cad9c PH |
9002 | /* Create a fixed version of the array element type. |
9003 | We're not providing the address of an element here, | |
e1d5a0d2 | 9004 | and thus the actual object value cannot be inspected to do |
529cad9c PH |
9005 | the conversion. This should not be a problem, since arrays of |
9006 | unconstrained objects are not allowed. In particular, all | |
9007 | the elements of an array of a tagged type should all be of | |
9008 | the same type specified in the debugging info. No need to | |
9009 | consult the object tag. */ | |
1ed6ede0 JB |
9010 | result = |
9011 | ada_to_fixed_type (ada_check_typedef (elt_type0), 0, 0, dval, 1); | |
1ce677a4 UW |
9012 | |
9013 | elt_type0 = type0; | |
14f9c5c9 | 9014 | for (i = TYPE_NFIELDS (index_type_desc) - 1; i >= 0; i -= 1) |
4c4b4cd2 PH |
9015 | { |
9016 | struct type *range_type = | |
28c85d6c | 9017 | to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc, i), dval); |
5b4ee69b | 9018 | |
e9bb382b | 9019 | result = create_array_type (alloc_type_copy (elt_type0), |
4c4b4cd2 | 9020 | result, range_type); |
1ce677a4 | 9021 | elt_type0 = TYPE_TARGET_TYPE (elt_type0); |
4c4b4cd2 | 9022 | } |
d2e4a39e | 9023 | if (!ignore_too_big && TYPE_LENGTH (result) > varsize_limit) |
323e0a4a | 9024 | error (_("array type with dynamic size is larger than varsize-limit")); |
14f9c5c9 AS |
9025 | } |
9026 | ||
2e6fda7d JB |
9027 | /* We want to preserve the type name. This can be useful when |
9028 | trying to get the type name of a value that has already been | |
9029 | printed (for instance, if the user did "print VAR; whatis $". */ | |
9030 | TYPE_NAME (result) = TYPE_NAME (type0); | |
9031 | ||
ad82864c | 9032 | if (constrained_packed_array_p) |
284614f0 JB |
9033 | { |
9034 | /* So far, the resulting type has been created as if the original | |
9035 | type was a regular (non-packed) array type. As a result, the | |
9036 | bitsize of the array elements needs to be set again, and the array | |
9037 | length needs to be recomputed based on that bitsize. */ | |
9038 | int len = TYPE_LENGTH (result) / TYPE_LENGTH (TYPE_TARGET_TYPE (result)); | |
9039 | int elt_bitsize = TYPE_FIELD_BITSIZE (type0, 0); | |
9040 | ||
9041 | TYPE_FIELD_BITSIZE (result, 0) = TYPE_FIELD_BITSIZE (type0, 0); | |
9042 | TYPE_LENGTH (result) = len * elt_bitsize / HOST_CHAR_BIT; | |
9043 | if (TYPE_LENGTH (result) * HOST_CHAR_BIT < len * elt_bitsize) | |
9044 | TYPE_LENGTH (result)++; | |
9045 | } | |
9046 | ||
876cecd0 | 9047 | TYPE_FIXED_INSTANCE (result) = 1; |
14f9c5c9 | 9048 | return result; |
d2e4a39e | 9049 | } |
14f9c5c9 AS |
9050 | |
9051 | ||
9052 | /* A standard type (containing no dynamically sized components) | |
9053 | corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS) | |
9054 | DVAL describes a record containing any discriminants used in TYPE0, | |
4c4b4cd2 | 9055 | and may be NULL if there are none, or if the object of type TYPE at |
529cad9c PH |
9056 | ADDRESS or in VALADDR contains these discriminants. |
9057 | ||
1ed6ede0 JB |
9058 | If CHECK_TAG is not null, in the case of tagged types, this function |
9059 | attempts to locate the object's tag and use it to compute the actual | |
9060 | type. However, when ADDRESS is null, we cannot use it to determine the | |
9061 | location of the tag, and therefore compute the tagged type's actual type. | |
9062 | So we return the tagged type without consulting the tag. */ | |
529cad9c | 9063 | |
f192137b JB |
9064 | static struct type * |
9065 | ada_to_fixed_type_1 (struct type *type, const gdb_byte *valaddr, | |
1ed6ede0 | 9066 | CORE_ADDR address, struct value *dval, int check_tag) |
14f9c5c9 | 9067 | { |
61ee279c | 9068 | type = ada_check_typedef (type); |
d2e4a39e AS |
9069 | switch (TYPE_CODE (type)) |
9070 | { | |
9071 | default: | |
14f9c5c9 | 9072 | return type; |
d2e4a39e | 9073 | case TYPE_CODE_STRUCT: |
4c4b4cd2 | 9074 | { |
76a01679 | 9075 | struct type *static_type = to_static_fixed_type (type); |
1ed6ede0 JB |
9076 | struct type *fixed_record_type = |
9077 | to_fixed_record_type (type, valaddr, address, NULL); | |
5b4ee69b | 9078 | |
529cad9c PH |
9079 | /* If STATIC_TYPE is a tagged type and we know the object's address, |
9080 | then we can determine its tag, and compute the object's actual | |
0963b4bd | 9081 | type from there. Note that we have to use the fixed record |
1ed6ede0 JB |
9082 | type (the parent part of the record may have dynamic fields |
9083 | and the way the location of _tag is expressed may depend on | |
9084 | them). */ | |
529cad9c | 9085 | |
1ed6ede0 | 9086 | if (check_tag && address != 0 && ada_is_tagged_type (static_type, 0)) |
76a01679 | 9087 | { |
b50d69b5 JG |
9088 | struct value *tag = |
9089 | value_tag_from_contents_and_address | |
9090 | (fixed_record_type, | |
9091 | valaddr, | |
9092 | address); | |
9093 | struct type *real_type = type_from_tag (tag); | |
9094 | struct value *obj = | |
9095 | value_from_contents_and_address (fixed_record_type, | |
9096 | valaddr, | |
9097 | address); | |
9f1f738a | 9098 | fixed_record_type = value_type (obj); |
76a01679 | 9099 | if (real_type != NULL) |
b50d69b5 JG |
9100 | return to_fixed_record_type |
9101 | (real_type, NULL, | |
9102 | value_address (ada_tag_value_at_base_address (obj)), NULL); | |
76a01679 | 9103 | } |
4af88198 JB |
9104 | |
9105 | /* Check to see if there is a parallel ___XVZ variable. | |
9106 | If there is, then it provides the actual size of our type. */ | |
9107 | else if (ada_type_name (fixed_record_type) != NULL) | |
9108 | { | |
0d5cff50 | 9109 | const char *name = ada_type_name (fixed_record_type); |
224c3ddb SM |
9110 | char *xvz_name |
9111 | = (char *) alloca (strlen (name) + 7 /* "___XVZ\0" */); | |
eccab96d | 9112 | bool xvz_found = false; |
4af88198 JB |
9113 | LONGEST size; |
9114 | ||
88c15c34 | 9115 | xsnprintf (xvz_name, strlen (name) + 7, "%s___XVZ", name); |
eccab96d JB |
9116 | TRY |
9117 | { | |
9118 | xvz_found = get_int_var_value (xvz_name, size); | |
9119 | } | |
9120 | CATCH (except, RETURN_MASK_ERROR) | |
9121 | { | |
9122 | /* We found the variable, but somehow failed to read | |
9123 | its value. Rethrow the same error, but with a little | |
9124 | bit more information, to help the user understand | |
9125 | what went wrong (Eg: the variable might have been | |
9126 | optimized out). */ | |
9127 | throw_error (except.error, | |
9128 | _("unable to read value of %s (%s)"), | |
9129 | xvz_name, except.message); | |
9130 | } | |
9131 | END_CATCH | |
9132 | ||
9133 | if (xvz_found && TYPE_LENGTH (fixed_record_type) != size) | |
4af88198 JB |
9134 | { |
9135 | fixed_record_type = copy_type (fixed_record_type); | |
9136 | TYPE_LENGTH (fixed_record_type) = size; | |
9137 | ||
9138 | /* The FIXED_RECORD_TYPE may have be a stub. We have | |
9139 | observed this when the debugging info is STABS, and | |
9140 | apparently it is something that is hard to fix. | |
9141 | ||
9142 | In practice, we don't need the actual type definition | |
9143 | at all, because the presence of the XVZ variable allows us | |
9144 | to assume that there must be a XVS type as well, which we | |
9145 | should be able to use later, when we need the actual type | |
9146 | definition. | |
9147 | ||
9148 | In the meantime, pretend that the "fixed" type we are | |
9149 | returning is NOT a stub, because this can cause trouble | |
9150 | when using this type to create new types targeting it. | |
9151 | Indeed, the associated creation routines often check | |
9152 | whether the target type is a stub and will try to replace | |
0963b4bd | 9153 | it, thus using a type with the wrong size. This, in turn, |
4af88198 JB |
9154 | might cause the new type to have the wrong size too. |
9155 | Consider the case of an array, for instance, where the size | |
9156 | of the array is computed from the number of elements in | |
9157 | our array multiplied by the size of its element. */ | |
9158 | TYPE_STUB (fixed_record_type) = 0; | |
9159 | } | |
9160 | } | |
1ed6ede0 | 9161 | return fixed_record_type; |
4c4b4cd2 | 9162 | } |
d2e4a39e | 9163 | case TYPE_CODE_ARRAY: |
4c4b4cd2 | 9164 | return to_fixed_array_type (type, dval, 1); |
d2e4a39e AS |
9165 | case TYPE_CODE_UNION: |
9166 | if (dval == NULL) | |
4c4b4cd2 | 9167 | return type; |
d2e4a39e | 9168 | else |
4c4b4cd2 | 9169 | return to_fixed_variant_branch_type (type, valaddr, address, dval); |
d2e4a39e | 9170 | } |
14f9c5c9 AS |
9171 | } |
9172 | ||
f192137b JB |
9173 | /* The same as ada_to_fixed_type_1, except that it preserves the type |
9174 | if it is a TYPE_CODE_TYPEDEF of a type that is already fixed. | |
96dbd2c1 JB |
9175 | |
9176 | The typedef layer needs be preserved in order to differentiate between | |
9177 | arrays and array pointers when both types are implemented using the same | |
9178 | fat pointer. In the array pointer case, the pointer is encoded as | |
9179 | a typedef of the pointer type. For instance, considering: | |
9180 | ||
9181 | type String_Access is access String; | |
9182 | S1 : String_Access := null; | |
9183 | ||
9184 | To the debugger, S1 is defined as a typedef of type String. But | |
9185 | to the user, it is a pointer. So if the user tries to print S1, | |
9186 | we should not dereference the array, but print the array address | |
9187 | instead. | |
9188 | ||
9189 | If we didn't preserve the typedef layer, we would lose the fact that | |
9190 | the type is to be presented as a pointer (needs de-reference before | |
9191 | being printed). And we would also use the source-level type name. */ | |
f192137b JB |
9192 | |
9193 | struct type * | |
9194 | ada_to_fixed_type (struct type *type, const gdb_byte *valaddr, | |
9195 | CORE_ADDR address, struct value *dval, int check_tag) | |
9196 | ||
9197 | { | |
9198 | struct type *fixed_type = | |
9199 | ada_to_fixed_type_1 (type, valaddr, address, dval, check_tag); | |
9200 | ||
96dbd2c1 JB |
9201 | /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE, |
9202 | then preserve the typedef layer. | |
9203 | ||
9204 | Implementation note: We can only check the main-type portion of | |
9205 | the TYPE and FIXED_TYPE, because eliminating the typedef layer | |
9206 | from TYPE now returns a type that has the same instance flags | |
9207 | as TYPE. For instance, if TYPE is a "typedef const", and its | |
9208 | target type is a "struct", then the typedef elimination will return | |
9209 | a "const" version of the target type. See check_typedef for more | |
9210 | details about how the typedef layer elimination is done. | |
9211 | ||
9212 | brobecker/2010-11-19: It seems to me that the only case where it is | |
9213 | useful to preserve the typedef layer is when dealing with fat pointers. | |
9214 | Perhaps, we could add a check for that and preserve the typedef layer | |
9215 | only in that situation. But this seems unecessary so far, probably | |
9216 | because we call check_typedef/ada_check_typedef pretty much everywhere. | |
9217 | */ | |
f192137b | 9218 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF |
720d1a40 | 9219 | && (TYPE_MAIN_TYPE (ada_typedef_target_type (type)) |
96dbd2c1 | 9220 | == TYPE_MAIN_TYPE (fixed_type))) |
f192137b JB |
9221 | return type; |
9222 | ||
9223 | return fixed_type; | |
9224 | } | |
9225 | ||
14f9c5c9 | 9226 | /* A standard (static-sized) type corresponding as well as possible to |
4c4b4cd2 | 9227 | TYPE0, but based on no runtime data. */ |
14f9c5c9 | 9228 | |
d2e4a39e AS |
9229 | static struct type * |
9230 | to_static_fixed_type (struct type *type0) | |
14f9c5c9 | 9231 | { |
d2e4a39e | 9232 | struct type *type; |
14f9c5c9 AS |
9233 | |
9234 | if (type0 == NULL) | |
9235 | return NULL; | |
9236 | ||
876cecd0 | 9237 | if (TYPE_FIXED_INSTANCE (type0)) |
4c4b4cd2 PH |
9238 | return type0; |
9239 | ||
61ee279c | 9240 | type0 = ada_check_typedef (type0); |
d2e4a39e | 9241 | |
14f9c5c9 AS |
9242 | switch (TYPE_CODE (type0)) |
9243 | { | |
9244 | default: | |
9245 | return type0; | |
9246 | case TYPE_CODE_STRUCT: | |
9247 | type = dynamic_template_type (type0); | |
d2e4a39e | 9248 | if (type != NULL) |
4c4b4cd2 PH |
9249 | return template_to_static_fixed_type (type); |
9250 | else | |
9251 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
9252 | case TYPE_CODE_UNION: |
9253 | type = ada_find_parallel_type (type0, "___XVU"); | |
9254 | if (type != NULL) | |
4c4b4cd2 PH |
9255 | return template_to_static_fixed_type (type); |
9256 | else | |
9257 | return template_to_static_fixed_type (type0); | |
14f9c5c9 AS |
9258 | } |
9259 | } | |
9260 | ||
4c4b4cd2 PH |
9261 | /* A static approximation of TYPE with all type wrappers removed. */ |
9262 | ||
d2e4a39e AS |
9263 | static struct type * |
9264 | static_unwrap_type (struct type *type) | |
14f9c5c9 AS |
9265 | { |
9266 | if (ada_is_aligner_type (type)) | |
9267 | { | |
61ee279c | 9268 | struct type *type1 = TYPE_FIELD_TYPE (ada_check_typedef (type), 0); |
14f9c5c9 | 9269 | if (ada_type_name (type1) == NULL) |
4c4b4cd2 | 9270 | TYPE_NAME (type1) = ada_type_name (type); |
14f9c5c9 AS |
9271 | |
9272 | return static_unwrap_type (type1); | |
9273 | } | |
d2e4a39e | 9274 | else |
14f9c5c9 | 9275 | { |
d2e4a39e | 9276 | struct type *raw_real_type = ada_get_base_type (type); |
5b4ee69b | 9277 | |
d2e4a39e | 9278 | if (raw_real_type == type) |
4c4b4cd2 | 9279 | return type; |
14f9c5c9 | 9280 | else |
4c4b4cd2 | 9281 | return to_static_fixed_type (raw_real_type); |
14f9c5c9 AS |
9282 | } |
9283 | } | |
9284 | ||
9285 | /* In some cases, incomplete and private types require | |
4c4b4cd2 | 9286 | cross-references that are not resolved as records (for example, |
14f9c5c9 AS |
9287 | type Foo; |
9288 | type FooP is access Foo; | |
9289 | V: FooP; | |
9290 | type Foo is array ...; | |
4c4b4cd2 | 9291 | ). In these cases, since there is no mechanism for producing |
14f9c5c9 AS |
9292 | cross-references to such types, we instead substitute for FooP a |
9293 | stub enumeration type that is nowhere resolved, and whose tag is | |
4c4b4cd2 | 9294 | the name of the actual type. Call these types "non-record stubs". */ |
14f9c5c9 AS |
9295 | |
9296 | /* A type equivalent to TYPE that is not a non-record stub, if one | |
4c4b4cd2 PH |
9297 | exists, otherwise TYPE. */ |
9298 | ||
d2e4a39e | 9299 | struct type * |
61ee279c | 9300 | ada_check_typedef (struct type *type) |
14f9c5c9 | 9301 | { |
727e3d2e JB |
9302 | if (type == NULL) |
9303 | return NULL; | |
9304 | ||
720d1a40 JB |
9305 | /* If our type is a typedef type of a fat pointer, then we're done. |
9306 | We don't want to strip the TYPE_CODE_TYPDEF layer, because this is | |
9307 | what allows us to distinguish between fat pointers that represent | |
9308 | array types, and fat pointers that represent array access types | |
9309 | (in both cases, the compiler implements them as fat pointers). */ | |
9310 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF | |
9311 | && is_thick_pntr (ada_typedef_target_type (type))) | |
9312 | return type; | |
9313 | ||
f168693b | 9314 | type = check_typedef (type); |
14f9c5c9 | 9315 | if (type == NULL || TYPE_CODE (type) != TYPE_CODE_ENUM |
529cad9c | 9316 | || !TYPE_STUB (type) |
14f9c5c9 AS |
9317 | || TYPE_TAG_NAME (type) == NULL) |
9318 | return type; | |
d2e4a39e | 9319 | else |
14f9c5c9 | 9320 | { |
0d5cff50 | 9321 | const char *name = TYPE_TAG_NAME (type); |
d2e4a39e | 9322 | struct type *type1 = ada_find_any_type (name); |
5b4ee69b | 9323 | |
05e522ef JB |
9324 | if (type1 == NULL) |
9325 | return type; | |
9326 | ||
9327 | /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with | |
9328 | stubs pointing to arrays, as we don't create symbols for array | |
3a867c22 JB |
9329 | types, only for the typedef-to-array types). If that's the case, |
9330 | strip the typedef layer. */ | |
9331 | if (TYPE_CODE (type1) == TYPE_CODE_TYPEDEF) | |
9332 | type1 = ada_check_typedef (type1); | |
9333 | ||
9334 | return type1; | |
14f9c5c9 AS |
9335 | } |
9336 | } | |
9337 | ||
9338 | /* A value representing the data at VALADDR/ADDRESS as described by | |
9339 | type TYPE0, but with a standard (static-sized) type that correctly | |
9340 | describes it. If VAL0 is not NULL and TYPE0 already is a standard | |
9341 | type, then return VAL0 [this feature is simply to avoid redundant | |
4c4b4cd2 | 9342 | creation of struct values]. */ |
14f9c5c9 | 9343 | |
4c4b4cd2 PH |
9344 | static struct value * |
9345 | ada_to_fixed_value_create (struct type *type0, CORE_ADDR address, | |
9346 | struct value *val0) | |
14f9c5c9 | 9347 | { |
1ed6ede0 | 9348 | struct type *type = ada_to_fixed_type (type0, 0, address, NULL, 1); |
5b4ee69b | 9349 | |
14f9c5c9 AS |
9350 | if (type == type0 && val0 != NULL) |
9351 | return val0; | |
cc0e770c JB |
9352 | |
9353 | if (VALUE_LVAL (val0) != lval_memory) | |
9354 | { | |
9355 | /* Our value does not live in memory; it could be a convenience | |
9356 | variable, for instance. Create a not_lval value using val0's | |
9357 | contents. */ | |
9358 | return value_from_contents (type, value_contents (val0)); | |
9359 | } | |
9360 | ||
9361 | return value_from_contents_and_address (type, 0, address); | |
4c4b4cd2 PH |
9362 | } |
9363 | ||
9364 | /* A value representing VAL, but with a standard (static-sized) type | |
9365 | that correctly describes it. Does not necessarily create a new | |
9366 | value. */ | |
9367 | ||
0c3acc09 | 9368 | struct value * |
4c4b4cd2 PH |
9369 | ada_to_fixed_value (struct value *val) |
9370 | { | |
c48db5ca JB |
9371 | val = unwrap_value (val); |
9372 | val = ada_to_fixed_value_create (value_type (val), | |
9373 | value_address (val), | |
9374 | val); | |
9375 | return val; | |
14f9c5c9 | 9376 | } |
d2e4a39e | 9377 | \f |
14f9c5c9 | 9378 | |
14f9c5c9 AS |
9379 | /* Attributes */ |
9380 | ||
4c4b4cd2 PH |
9381 | /* Table mapping attribute numbers to names. |
9382 | NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */ | |
14f9c5c9 | 9383 | |
d2e4a39e | 9384 | static const char *attribute_names[] = { |
14f9c5c9 AS |
9385 | "<?>", |
9386 | ||
d2e4a39e | 9387 | "first", |
14f9c5c9 AS |
9388 | "last", |
9389 | "length", | |
9390 | "image", | |
14f9c5c9 AS |
9391 | "max", |
9392 | "min", | |
4c4b4cd2 PH |
9393 | "modulus", |
9394 | "pos", | |
9395 | "size", | |
9396 | "tag", | |
14f9c5c9 | 9397 | "val", |
14f9c5c9 AS |
9398 | 0 |
9399 | }; | |
9400 | ||
d2e4a39e | 9401 | const char * |
4c4b4cd2 | 9402 | ada_attribute_name (enum exp_opcode n) |
14f9c5c9 | 9403 | { |
4c4b4cd2 PH |
9404 | if (n >= OP_ATR_FIRST && n <= (int) OP_ATR_VAL) |
9405 | return attribute_names[n - OP_ATR_FIRST + 1]; | |
14f9c5c9 AS |
9406 | else |
9407 | return attribute_names[0]; | |
9408 | } | |
9409 | ||
4c4b4cd2 | 9410 | /* Evaluate the 'POS attribute applied to ARG. */ |
14f9c5c9 | 9411 | |
4c4b4cd2 PH |
9412 | static LONGEST |
9413 | pos_atr (struct value *arg) | |
14f9c5c9 | 9414 | { |
24209737 PH |
9415 | struct value *val = coerce_ref (arg); |
9416 | struct type *type = value_type (val); | |
aa715135 | 9417 | LONGEST result; |
14f9c5c9 | 9418 | |
d2e4a39e | 9419 | if (!discrete_type_p (type)) |
323e0a4a | 9420 | error (_("'POS only defined on discrete types")); |
14f9c5c9 | 9421 | |
aa715135 JG |
9422 | if (!discrete_position (type, value_as_long (val), &result)) |
9423 | error (_("enumeration value is invalid: can't find 'POS")); | |
14f9c5c9 | 9424 | |
aa715135 | 9425 | return result; |
4c4b4cd2 PH |
9426 | } |
9427 | ||
9428 | static struct value * | |
3cb382c9 | 9429 | value_pos_atr (struct type *type, struct value *arg) |
4c4b4cd2 | 9430 | { |
3cb382c9 | 9431 | return value_from_longest (type, pos_atr (arg)); |
14f9c5c9 AS |
9432 | } |
9433 | ||
4c4b4cd2 | 9434 | /* Evaluate the TYPE'VAL attribute applied to ARG. */ |
14f9c5c9 | 9435 | |
d2e4a39e AS |
9436 | static struct value * |
9437 | value_val_atr (struct type *type, struct value *arg) | |
14f9c5c9 | 9438 | { |
d2e4a39e | 9439 | if (!discrete_type_p (type)) |
323e0a4a | 9440 | error (_("'VAL only defined on discrete types")); |
df407dfe | 9441 | if (!integer_type_p (value_type (arg))) |
323e0a4a | 9442 | error (_("'VAL requires integral argument")); |
14f9c5c9 AS |
9443 | |
9444 | if (TYPE_CODE (type) == TYPE_CODE_ENUM) | |
9445 | { | |
9446 | long pos = value_as_long (arg); | |
5b4ee69b | 9447 | |
14f9c5c9 | 9448 | if (pos < 0 || pos >= TYPE_NFIELDS (type)) |
323e0a4a | 9449 | error (_("argument to 'VAL out of range")); |
14e75d8e | 9450 | return value_from_longest (type, TYPE_FIELD_ENUMVAL (type, pos)); |
14f9c5c9 AS |
9451 | } |
9452 | else | |
9453 | return value_from_longest (type, value_as_long (arg)); | |
9454 | } | |
14f9c5c9 | 9455 | \f |
d2e4a39e | 9456 | |
4c4b4cd2 | 9457 | /* Evaluation */ |
14f9c5c9 | 9458 | |
4c4b4cd2 PH |
9459 | /* True if TYPE appears to be an Ada character type. |
9460 | [At the moment, this is true only for Character and Wide_Character; | |
9461 | It is a heuristic test that could stand improvement]. */ | |
14f9c5c9 | 9462 | |
d2e4a39e AS |
9463 | int |
9464 | ada_is_character_type (struct type *type) | |
14f9c5c9 | 9465 | { |
7b9f71f2 JB |
9466 | const char *name; |
9467 | ||
9468 | /* If the type code says it's a character, then assume it really is, | |
9469 | and don't check any further. */ | |
9470 | if (TYPE_CODE (type) == TYPE_CODE_CHAR) | |
9471 | return 1; | |
9472 | ||
9473 | /* Otherwise, assume it's a character type iff it is a discrete type | |
9474 | with a known character type name. */ | |
9475 | name = ada_type_name (type); | |
9476 | return (name != NULL | |
9477 | && (TYPE_CODE (type) == TYPE_CODE_INT | |
9478 | || TYPE_CODE (type) == TYPE_CODE_RANGE) | |
9479 | && (strcmp (name, "character") == 0 | |
9480 | || strcmp (name, "wide_character") == 0 | |
5a517ebd | 9481 | || strcmp (name, "wide_wide_character") == 0 |
7b9f71f2 | 9482 | || strcmp (name, "unsigned char") == 0)); |
14f9c5c9 AS |
9483 | } |
9484 | ||
4c4b4cd2 | 9485 | /* True if TYPE appears to be an Ada string type. */ |
14f9c5c9 AS |
9486 | |
9487 | int | |
ebf56fd3 | 9488 | ada_is_string_type (struct type *type) |
14f9c5c9 | 9489 | { |
61ee279c | 9490 | type = ada_check_typedef (type); |
d2e4a39e | 9491 | if (type != NULL |
14f9c5c9 | 9492 | && TYPE_CODE (type) != TYPE_CODE_PTR |
76a01679 JB |
9493 | && (ada_is_simple_array_type (type) |
9494 | || ada_is_array_descriptor_type (type)) | |
14f9c5c9 AS |
9495 | && ada_array_arity (type) == 1) |
9496 | { | |
9497 | struct type *elttype = ada_array_element_type (type, 1); | |
9498 | ||
9499 | return ada_is_character_type (elttype); | |
9500 | } | |
d2e4a39e | 9501 | else |
14f9c5c9 AS |
9502 | return 0; |
9503 | } | |
9504 | ||
5bf03f13 JB |
9505 | /* The compiler sometimes provides a parallel XVS type for a given |
9506 | PAD type. Normally, it is safe to follow the PAD type directly, | |
9507 | but older versions of the compiler have a bug that causes the offset | |
9508 | of its "F" field to be wrong. Following that field in that case | |
9509 | would lead to incorrect results, but this can be worked around | |
9510 | by ignoring the PAD type and using the associated XVS type instead. | |
9511 | ||
9512 | Set to True if the debugger should trust the contents of PAD types. | |
9513 | Otherwise, ignore the PAD type if there is a parallel XVS type. */ | |
9514 | static int trust_pad_over_xvs = 1; | |
14f9c5c9 AS |
9515 | |
9516 | /* True if TYPE is a struct type introduced by the compiler to force the | |
9517 | alignment of a value. Such types have a single field with a | |
4c4b4cd2 | 9518 | distinctive name. */ |
14f9c5c9 AS |
9519 | |
9520 | int | |
ebf56fd3 | 9521 | ada_is_aligner_type (struct type *type) |
14f9c5c9 | 9522 | { |
61ee279c | 9523 | type = ada_check_typedef (type); |
714e53ab | 9524 | |
5bf03f13 | 9525 | if (!trust_pad_over_xvs && ada_find_parallel_type (type, "___XVS") != NULL) |
714e53ab PH |
9526 | return 0; |
9527 | ||
14f9c5c9 | 9528 | return (TYPE_CODE (type) == TYPE_CODE_STRUCT |
4c4b4cd2 PH |
9529 | && TYPE_NFIELDS (type) == 1 |
9530 | && strcmp (TYPE_FIELD_NAME (type, 0), "F") == 0); | |
14f9c5c9 AS |
9531 | } |
9532 | ||
9533 | /* If there is an ___XVS-convention type parallel to SUBTYPE, return | |
4c4b4cd2 | 9534 | the parallel type. */ |
14f9c5c9 | 9535 | |
d2e4a39e AS |
9536 | struct type * |
9537 | ada_get_base_type (struct type *raw_type) | |
14f9c5c9 | 9538 | { |
d2e4a39e AS |
9539 | struct type *real_type_namer; |
9540 | struct type *raw_real_type; | |
14f9c5c9 AS |
9541 | |
9542 | if (raw_type == NULL || TYPE_CODE (raw_type) != TYPE_CODE_STRUCT) | |
9543 | return raw_type; | |
9544 | ||
284614f0 JB |
9545 | if (ada_is_aligner_type (raw_type)) |
9546 | /* The encoding specifies that we should always use the aligner type. | |
9547 | So, even if this aligner type has an associated XVS type, we should | |
9548 | simply ignore it. | |
9549 | ||
9550 | According to the compiler gurus, an XVS type parallel to an aligner | |
9551 | type may exist because of a stabs limitation. In stabs, aligner | |
9552 | types are empty because the field has a variable-sized type, and | |
9553 | thus cannot actually be used as an aligner type. As a result, | |
9554 | we need the associated parallel XVS type to decode the type. | |
9555 | Since the policy in the compiler is to not change the internal | |
9556 | representation based on the debugging info format, we sometimes | |
9557 | end up having a redundant XVS type parallel to the aligner type. */ | |
9558 | return raw_type; | |
9559 | ||
14f9c5c9 | 9560 | real_type_namer = ada_find_parallel_type (raw_type, "___XVS"); |
d2e4a39e | 9561 | if (real_type_namer == NULL |
14f9c5c9 AS |
9562 | || TYPE_CODE (real_type_namer) != TYPE_CODE_STRUCT |
9563 | || TYPE_NFIELDS (real_type_namer) != 1) | |
9564 | return raw_type; | |
9565 | ||
f80d3ff2 JB |
9566 | if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer, 0)) != TYPE_CODE_REF) |
9567 | { | |
9568 | /* This is an older encoding form where the base type needs to be | |
9569 | looked up by name. We prefer the newer enconding because it is | |
9570 | more efficient. */ | |
9571 | raw_real_type = ada_find_any_type (TYPE_FIELD_NAME (real_type_namer, 0)); | |
9572 | if (raw_real_type == NULL) | |
9573 | return raw_type; | |
9574 | else | |
9575 | return raw_real_type; | |
9576 | } | |
9577 | ||
9578 | /* The field in our XVS type is a reference to the base type. */ | |
9579 | return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer, 0)); | |
d2e4a39e | 9580 | } |
14f9c5c9 | 9581 | |
4c4b4cd2 | 9582 | /* The type of value designated by TYPE, with all aligners removed. */ |
14f9c5c9 | 9583 | |
d2e4a39e AS |
9584 | struct type * |
9585 | ada_aligned_type (struct type *type) | |
14f9c5c9 AS |
9586 | { |
9587 | if (ada_is_aligner_type (type)) | |
9588 | return ada_aligned_type (TYPE_FIELD_TYPE (type, 0)); | |
9589 | else | |
9590 | return ada_get_base_type (type); | |
9591 | } | |
9592 | ||
9593 | ||
9594 | /* The address of the aligned value in an object at address VALADDR | |
4c4b4cd2 | 9595 | having type TYPE. Assumes ada_is_aligner_type (TYPE). */ |
14f9c5c9 | 9596 | |
fc1a4b47 AC |
9597 | const gdb_byte * |
9598 | ada_aligned_value_addr (struct type *type, const gdb_byte *valaddr) | |
14f9c5c9 | 9599 | { |
d2e4a39e | 9600 | if (ada_is_aligner_type (type)) |
14f9c5c9 | 9601 | return ada_aligned_value_addr (TYPE_FIELD_TYPE (type, 0), |
4c4b4cd2 PH |
9602 | valaddr + |
9603 | TYPE_FIELD_BITPOS (type, | |
9604 | 0) / TARGET_CHAR_BIT); | |
14f9c5c9 AS |
9605 | else |
9606 | return valaddr; | |
9607 | } | |
9608 | ||
4c4b4cd2 PH |
9609 | |
9610 | ||
14f9c5c9 | 9611 | /* The printed representation of an enumeration literal with encoded |
4c4b4cd2 | 9612 | name NAME. The value is good to the next call of ada_enum_name. */ |
d2e4a39e AS |
9613 | const char * |
9614 | ada_enum_name (const char *name) | |
14f9c5c9 | 9615 | { |
4c4b4cd2 PH |
9616 | static char *result; |
9617 | static size_t result_len = 0; | |
e6a959d6 | 9618 | const char *tmp; |
14f9c5c9 | 9619 | |
4c4b4cd2 PH |
9620 | /* First, unqualify the enumeration name: |
9621 | 1. Search for the last '.' character. If we find one, then skip | |
177b42fe | 9622 | all the preceding characters, the unqualified name starts |
76a01679 | 9623 | right after that dot. |
4c4b4cd2 | 9624 | 2. Otherwise, we may be debugging on a target where the compiler |
76a01679 JB |
9625 | translates dots into "__". Search forward for double underscores, |
9626 | but stop searching when we hit an overloading suffix, which is | |
9627 | of the form "__" followed by digits. */ | |
4c4b4cd2 | 9628 | |
c3e5cd34 PH |
9629 | tmp = strrchr (name, '.'); |
9630 | if (tmp != NULL) | |
4c4b4cd2 PH |
9631 | name = tmp + 1; |
9632 | else | |
14f9c5c9 | 9633 | { |
4c4b4cd2 PH |
9634 | while ((tmp = strstr (name, "__")) != NULL) |
9635 | { | |
9636 | if (isdigit (tmp[2])) | |
9637 | break; | |
9638 | else | |
9639 | name = tmp + 2; | |
9640 | } | |
14f9c5c9 AS |
9641 | } |
9642 | ||
9643 | if (name[0] == 'Q') | |
9644 | { | |
14f9c5c9 | 9645 | int v; |
5b4ee69b | 9646 | |
14f9c5c9 | 9647 | if (name[1] == 'U' || name[1] == 'W') |
4c4b4cd2 PH |
9648 | { |
9649 | if (sscanf (name + 2, "%x", &v) != 1) | |
9650 | return name; | |
9651 | } | |
14f9c5c9 | 9652 | else |
4c4b4cd2 | 9653 | return name; |
14f9c5c9 | 9654 | |
4c4b4cd2 | 9655 | GROW_VECT (result, result_len, 16); |
14f9c5c9 | 9656 | if (isascii (v) && isprint (v)) |
88c15c34 | 9657 | xsnprintf (result, result_len, "'%c'", v); |
14f9c5c9 | 9658 | else if (name[1] == 'U') |
88c15c34 | 9659 | xsnprintf (result, result_len, "[\"%02x\"]", v); |
14f9c5c9 | 9660 | else |
88c15c34 | 9661 | xsnprintf (result, result_len, "[\"%04x\"]", v); |
14f9c5c9 AS |
9662 | |
9663 | return result; | |
9664 | } | |
d2e4a39e | 9665 | else |
4c4b4cd2 | 9666 | { |
c3e5cd34 PH |
9667 | tmp = strstr (name, "__"); |
9668 | if (tmp == NULL) | |
9669 | tmp = strstr (name, "$"); | |
9670 | if (tmp != NULL) | |
4c4b4cd2 PH |
9671 | { |
9672 | GROW_VECT (result, result_len, tmp - name + 1); | |
9673 | strncpy (result, name, tmp - name); | |
9674 | result[tmp - name] = '\0'; | |
9675 | return result; | |
9676 | } | |
9677 | ||
9678 | return name; | |
9679 | } | |
14f9c5c9 AS |
9680 | } |
9681 | ||
14f9c5c9 AS |
9682 | /* Evaluate the subexpression of EXP starting at *POS as for |
9683 | evaluate_type, updating *POS to point just past the evaluated | |
4c4b4cd2 | 9684 | expression. */ |
14f9c5c9 | 9685 | |
d2e4a39e AS |
9686 | static struct value * |
9687 | evaluate_subexp_type (struct expression *exp, int *pos) | |
14f9c5c9 | 9688 | { |
4b27a620 | 9689 | return evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); |
14f9c5c9 AS |
9690 | } |
9691 | ||
9692 | /* If VAL is wrapped in an aligner or subtype wrapper, return the | |
4c4b4cd2 | 9693 | value it wraps. */ |
14f9c5c9 | 9694 | |
d2e4a39e AS |
9695 | static struct value * |
9696 | unwrap_value (struct value *val) | |
14f9c5c9 | 9697 | { |
df407dfe | 9698 | struct type *type = ada_check_typedef (value_type (val)); |
5b4ee69b | 9699 | |
14f9c5c9 AS |
9700 | if (ada_is_aligner_type (type)) |
9701 | { | |
de4d072f | 9702 | struct value *v = ada_value_struct_elt (val, "F", 0); |
df407dfe | 9703 | struct type *val_type = ada_check_typedef (value_type (v)); |
5b4ee69b | 9704 | |
14f9c5c9 | 9705 | if (ada_type_name (val_type) == NULL) |
4c4b4cd2 | 9706 | TYPE_NAME (val_type) = ada_type_name (type); |
14f9c5c9 AS |
9707 | |
9708 | return unwrap_value (v); | |
9709 | } | |
d2e4a39e | 9710 | else |
14f9c5c9 | 9711 | { |
d2e4a39e | 9712 | struct type *raw_real_type = |
61ee279c | 9713 | ada_check_typedef (ada_get_base_type (type)); |
d2e4a39e | 9714 | |
5bf03f13 JB |
9715 | /* If there is no parallel XVS or XVE type, then the value is |
9716 | already unwrapped. Return it without further modification. */ | |
9717 | if ((type == raw_real_type) | |
9718 | && ada_find_parallel_type (type, "___XVE") == NULL) | |
9719 | return val; | |
14f9c5c9 | 9720 | |
d2e4a39e | 9721 | return |
4c4b4cd2 PH |
9722 | coerce_unspec_val_to_type |
9723 | (val, ada_to_fixed_type (raw_real_type, 0, | |
42ae5230 | 9724 | value_address (val), |
1ed6ede0 | 9725 | NULL, 1)); |
14f9c5c9 AS |
9726 | } |
9727 | } | |
d2e4a39e AS |
9728 | |
9729 | static struct value * | |
50eff16b | 9730 | cast_from_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9731 | { |
50eff16b UW |
9732 | struct value *scale = ada_scaling_factor (value_type (arg)); |
9733 | arg = value_cast (value_type (scale), arg); | |
14f9c5c9 | 9734 | |
50eff16b UW |
9735 | arg = value_binop (arg, scale, BINOP_MUL); |
9736 | return value_cast (type, arg); | |
14f9c5c9 AS |
9737 | } |
9738 | ||
d2e4a39e | 9739 | static struct value * |
50eff16b | 9740 | cast_to_fixed (struct type *type, struct value *arg) |
14f9c5c9 | 9741 | { |
50eff16b UW |
9742 | if (type == value_type (arg)) |
9743 | return arg; | |
5b4ee69b | 9744 | |
50eff16b UW |
9745 | struct value *scale = ada_scaling_factor (type); |
9746 | if (ada_is_fixed_point_type (value_type (arg))) | |
9747 | arg = cast_from_fixed (value_type (scale), arg); | |
9748 | else | |
9749 | arg = value_cast (value_type (scale), arg); | |
9750 | ||
9751 | arg = value_binop (arg, scale, BINOP_DIV); | |
9752 | return value_cast (type, arg); | |
14f9c5c9 AS |
9753 | } |
9754 | ||
d99dcf51 JB |
9755 | /* Given two array types T1 and T2, return nonzero iff both arrays |
9756 | contain the same number of elements. */ | |
9757 | ||
9758 | static int | |
9759 | ada_same_array_size_p (struct type *t1, struct type *t2) | |
9760 | { | |
9761 | LONGEST lo1, hi1, lo2, hi2; | |
9762 | ||
9763 | /* Get the array bounds in order to verify that the size of | |
9764 | the two arrays match. */ | |
9765 | if (!get_array_bounds (t1, &lo1, &hi1) | |
9766 | || !get_array_bounds (t2, &lo2, &hi2)) | |
9767 | error (_("unable to determine array bounds")); | |
9768 | ||
9769 | /* To make things easier for size comparison, normalize a bit | |
9770 | the case of empty arrays by making sure that the difference | |
9771 | between upper bound and lower bound is always -1. */ | |
9772 | if (lo1 > hi1) | |
9773 | hi1 = lo1 - 1; | |
9774 | if (lo2 > hi2) | |
9775 | hi2 = lo2 - 1; | |
9776 | ||
9777 | return (hi1 - lo1 == hi2 - lo2); | |
9778 | } | |
9779 | ||
9780 | /* Assuming that VAL is an array of integrals, and TYPE represents | |
9781 | an array with the same number of elements, but with wider integral | |
9782 | elements, return an array "casted" to TYPE. In practice, this | |
9783 | means that the returned array is built by casting each element | |
9784 | of the original array into TYPE's (wider) element type. */ | |
9785 | ||
9786 | static struct value * | |
9787 | ada_promote_array_of_integrals (struct type *type, struct value *val) | |
9788 | { | |
9789 | struct type *elt_type = TYPE_TARGET_TYPE (type); | |
9790 | LONGEST lo, hi; | |
9791 | struct value *res; | |
9792 | LONGEST i; | |
9793 | ||
9794 | /* Verify that both val and type are arrays of scalars, and | |
9795 | that the size of val's elements is smaller than the size | |
9796 | of type's element. */ | |
9797 | gdb_assert (TYPE_CODE (type) == TYPE_CODE_ARRAY); | |
9798 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (type))); | |
9799 | gdb_assert (TYPE_CODE (value_type (val)) == TYPE_CODE_ARRAY); | |
9800 | gdb_assert (is_integral_type (TYPE_TARGET_TYPE (value_type (val)))); | |
9801 | gdb_assert (TYPE_LENGTH (TYPE_TARGET_TYPE (type)) | |
9802 | > TYPE_LENGTH (TYPE_TARGET_TYPE (value_type (val)))); | |
9803 | ||
9804 | if (!get_array_bounds (type, &lo, &hi)) | |
9805 | error (_("unable to determine array bounds")); | |
9806 | ||
9807 | res = allocate_value (type); | |
9808 | ||
9809 | /* Promote each array element. */ | |
9810 | for (i = 0; i < hi - lo + 1; i++) | |
9811 | { | |
9812 | struct value *elt = value_cast (elt_type, value_subscript (val, lo + i)); | |
9813 | ||
9814 | memcpy (value_contents_writeable (res) + (i * TYPE_LENGTH (elt_type)), | |
9815 | value_contents_all (elt), TYPE_LENGTH (elt_type)); | |
9816 | } | |
9817 | ||
9818 | return res; | |
9819 | } | |
9820 | ||
4c4b4cd2 PH |
9821 | /* Coerce VAL as necessary for assignment to an lval of type TYPE, and |
9822 | return the converted value. */ | |
9823 | ||
d2e4a39e AS |
9824 | static struct value * |
9825 | coerce_for_assign (struct type *type, struct value *val) | |
14f9c5c9 | 9826 | { |
df407dfe | 9827 | struct type *type2 = value_type (val); |
5b4ee69b | 9828 | |
14f9c5c9 AS |
9829 | if (type == type2) |
9830 | return val; | |
9831 | ||
61ee279c PH |
9832 | type2 = ada_check_typedef (type2); |
9833 | type = ada_check_typedef (type); | |
14f9c5c9 | 9834 | |
d2e4a39e AS |
9835 | if (TYPE_CODE (type2) == TYPE_CODE_PTR |
9836 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
14f9c5c9 AS |
9837 | { |
9838 | val = ada_value_ind (val); | |
df407dfe | 9839 | type2 = value_type (val); |
14f9c5c9 AS |
9840 | } |
9841 | ||
d2e4a39e | 9842 | if (TYPE_CODE (type2) == TYPE_CODE_ARRAY |
14f9c5c9 AS |
9843 | && TYPE_CODE (type) == TYPE_CODE_ARRAY) |
9844 | { | |
d99dcf51 JB |
9845 | if (!ada_same_array_size_p (type, type2)) |
9846 | error (_("cannot assign arrays of different length")); | |
9847 | ||
9848 | if (is_integral_type (TYPE_TARGET_TYPE (type)) | |
9849 | && is_integral_type (TYPE_TARGET_TYPE (type2)) | |
9850 | && TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9851 | < TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
9852 | { | |
9853 | /* Allow implicit promotion of the array elements to | |
9854 | a wider type. */ | |
9855 | return ada_promote_array_of_integrals (type, val); | |
9856 | } | |
9857 | ||
9858 | if (TYPE_LENGTH (TYPE_TARGET_TYPE (type2)) | |
9859 | != TYPE_LENGTH (TYPE_TARGET_TYPE (type))) | |
323e0a4a | 9860 | error (_("Incompatible types in assignment")); |
04624583 | 9861 | deprecated_set_value_type (val, type); |
14f9c5c9 | 9862 | } |
d2e4a39e | 9863 | return val; |
14f9c5c9 AS |
9864 | } |
9865 | ||
4c4b4cd2 PH |
9866 | static struct value * |
9867 | ada_value_binop (struct value *arg1, struct value *arg2, enum exp_opcode op) | |
9868 | { | |
9869 | struct value *val; | |
9870 | struct type *type1, *type2; | |
9871 | LONGEST v, v1, v2; | |
9872 | ||
994b9211 AC |
9873 | arg1 = coerce_ref (arg1); |
9874 | arg2 = coerce_ref (arg2); | |
18af8284 JB |
9875 | type1 = get_base_type (ada_check_typedef (value_type (arg1))); |
9876 | type2 = get_base_type (ada_check_typedef (value_type (arg2))); | |
4c4b4cd2 | 9877 | |
76a01679 JB |
9878 | if (TYPE_CODE (type1) != TYPE_CODE_INT |
9879 | || TYPE_CODE (type2) != TYPE_CODE_INT) | |
4c4b4cd2 PH |
9880 | return value_binop (arg1, arg2, op); |
9881 | ||
76a01679 | 9882 | switch (op) |
4c4b4cd2 PH |
9883 | { |
9884 | case BINOP_MOD: | |
9885 | case BINOP_DIV: | |
9886 | case BINOP_REM: | |
9887 | break; | |
9888 | default: | |
9889 | return value_binop (arg1, arg2, op); | |
9890 | } | |
9891 | ||
9892 | v2 = value_as_long (arg2); | |
9893 | if (v2 == 0) | |
323e0a4a | 9894 | error (_("second operand of %s must not be zero."), op_string (op)); |
4c4b4cd2 PH |
9895 | |
9896 | if (TYPE_UNSIGNED (type1) || op == BINOP_MOD) | |
9897 | return value_binop (arg1, arg2, op); | |
9898 | ||
9899 | v1 = value_as_long (arg1); | |
9900 | switch (op) | |
9901 | { | |
9902 | case BINOP_DIV: | |
9903 | v = v1 / v2; | |
76a01679 JB |
9904 | if (!TRUNCATION_TOWARDS_ZERO && v1 * (v1 % v2) < 0) |
9905 | v += v > 0 ? -1 : 1; | |
4c4b4cd2 PH |
9906 | break; |
9907 | case BINOP_REM: | |
9908 | v = v1 % v2; | |
76a01679 JB |
9909 | if (v * v1 < 0) |
9910 | v -= v2; | |
4c4b4cd2 PH |
9911 | break; |
9912 | default: | |
9913 | /* Should not reach this point. */ | |
9914 | v = 0; | |
9915 | } | |
9916 | ||
9917 | val = allocate_value (type1); | |
990a07ab | 9918 | store_unsigned_integer (value_contents_raw (val), |
e17a4113 UW |
9919 | TYPE_LENGTH (value_type (val)), |
9920 | gdbarch_byte_order (get_type_arch (type1)), v); | |
4c4b4cd2 PH |
9921 | return val; |
9922 | } | |
9923 | ||
9924 | static int | |
9925 | ada_value_equal (struct value *arg1, struct value *arg2) | |
9926 | { | |
df407dfe AC |
9927 | if (ada_is_direct_array_type (value_type (arg1)) |
9928 | || ada_is_direct_array_type (value_type (arg2))) | |
4c4b4cd2 | 9929 | { |
79e8fcaa JB |
9930 | struct type *arg1_type, *arg2_type; |
9931 | ||
f58b38bf JB |
9932 | /* Automatically dereference any array reference before |
9933 | we attempt to perform the comparison. */ | |
9934 | arg1 = ada_coerce_ref (arg1); | |
9935 | arg2 = ada_coerce_ref (arg2); | |
79e8fcaa | 9936 | |
4c4b4cd2 PH |
9937 | arg1 = ada_coerce_to_simple_array (arg1); |
9938 | arg2 = ada_coerce_to_simple_array (arg2); | |
79e8fcaa JB |
9939 | |
9940 | arg1_type = ada_check_typedef (value_type (arg1)); | |
9941 | arg2_type = ada_check_typedef (value_type (arg2)); | |
9942 | ||
9943 | if (TYPE_CODE (arg1_type) != TYPE_CODE_ARRAY | |
9944 | || TYPE_CODE (arg2_type) != TYPE_CODE_ARRAY) | |
323e0a4a | 9945 | error (_("Attempt to compare array with non-array")); |
4c4b4cd2 | 9946 | /* FIXME: The following works only for types whose |
76a01679 JB |
9947 | representations use all bits (no padding or undefined bits) |
9948 | and do not have user-defined equality. */ | |
79e8fcaa JB |
9949 | return (TYPE_LENGTH (arg1_type) == TYPE_LENGTH (arg2_type) |
9950 | && memcmp (value_contents (arg1), value_contents (arg2), | |
9951 | TYPE_LENGTH (arg1_type)) == 0); | |
4c4b4cd2 PH |
9952 | } |
9953 | return value_equal (arg1, arg2); | |
9954 | } | |
9955 | ||
52ce6436 PH |
9956 | /* Total number of component associations in the aggregate starting at |
9957 | index PC in EXP. Assumes that index PC is the start of an | |
0963b4bd | 9958 | OP_AGGREGATE. */ |
52ce6436 PH |
9959 | |
9960 | static int | |
9961 | num_component_specs (struct expression *exp, int pc) | |
9962 | { | |
9963 | int n, m, i; | |
5b4ee69b | 9964 | |
52ce6436 PH |
9965 | m = exp->elts[pc + 1].longconst; |
9966 | pc += 3; | |
9967 | n = 0; | |
9968 | for (i = 0; i < m; i += 1) | |
9969 | { | |
9970 | switch (exp->elts[pc].opcode) | |
9971 | { | |
9972 | default: | |
9973 | n += 1; | |
9974 | break; | |
9975 | case OP_CHOICES: | |
9976 | n += exp->elts[pc + 1].longconst; | |
9977 | break; | |
9978 | } | |
9979 | ada_evaluate_subexp (NULL, exp, &pc, EVAL_SKIP); | |
9980 | } | |
9981 | return n; | |
9982 | } | |
9983 | ||
9984 | /* Assign the result of evaluating EXP starting at *POS to the INDEXth | |
9985 | component of LHS (a simple array or a record), updating *POS past | |
9986 | the expression, assuming that LHS is contained in CONTAINER. Does | |
9987 | not modify the inferior's memory, nor does it modify LHS (unless | |
9988 | LHS == CONTAINER). */ | |
9989 | ||
9990 | static void | |
9991 | assign_component (struct value *container, struct value *lhs, LONGEST index, | |
9992 | struct expression *exp, int *pos) | |
9993 | { | |
9994 | struct value *mark = value_mark (); | |
9995 | struct value *elt; | |
0e2da9f0 | 9996 | struct type *lhs_type = check_typedef (value_type (lhs)); |
5b4ee69b | 9997 | |
0e2da9f0 | 9998 | if (TYPE_CODE (lhs_type) == TYPE_CODE_ARRAY) |
52ce6436 | 9999 | { |
22601c15 UW |
10000 | struct type *index_type = builtin_type (exp->gdbarch)->builtin_int; |
10001 | struct value *index_val = value_from_longest (index_type, index); | |
5b4ee69b | 10002 | |
52ce6436 PH |
10003 | elt = unwrap_value (ada_value_subscript (lhs, 1, &index_val)); |
10004 | } | |
10005 | else | |
10006 | { | |
10007 | elt = ada_index_struct_field (index, lhs, 0, value_type (lhs)); | |
c48db5ca | 10008 | elt = ada_to_fixed_value (elt); |
52ce6436 PH |
10009 | } |
10010 | ||
10011 | if (exp->elts[*pos].opcode == OP_AGGREGATE) | |
10012 | assign_aggregate (container, elt, exp, pos, EVAL_NORMAL); | |
10013 | else | |
10014 | value_assign_to_component (container, elt, | |
10015 | ada_evaluate_subexp (NULL, exp, pos, | |
10016 | EVAL_NORMAL)); | |
10017 | ||
10018 | value_free_to_mark (mark); | |
10019 | } | |
10020 | ||
10021 | /* Assuming that LHS represents an lvalue having a record or array | |
10022 | type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment | |
10023 | of that aggregate's value to LHS, advancing *POS past the | |
10024 | aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an | |
10025 | lvalue containing LHS (possibly LHS itself). Does not modify | |
10026 | the inferior's memory, nor does it modify the contents of | |
0963b4bd | 10027 | LHS (unless == CONTAINER). Returns the modified CONTAINER. */ |
52ce6436 PH |
10028 | |
10029 | static struct value * | |
10030 | assign_aggregate (struct value *container, | |
10031 | struct value *lhs, struct expression *exp, | |
10032 | int *pos, enum noside noside) | |
10033 | { | |
10034 | struct type *lhs_type; | |
10035 | int n = exp->elts[*pos+1].longconst; | |
10036 | LONGEST low_index, high_index; | |
10037 | int num_specs; | |
10038 | LONGEST *indices; | |
10039 | int max_indices, num_indices; | |
52ce6436 | 10040 | int i; |
52ce6436 PH |
10041 | |
10042 | *pos += 3; | |
10043 | if (noside != EVAL_NORMAL) | |
10044 | { | |
52ce6436 PH |
10045 | for (i = 0; i < n; i += 1) |
10046 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
10047 | return container; | |
10048 | } | |
10049 | ||
10050 | container = ada_coerce_ref (container); | |
10051 | if (ada_is_direct_array_type (value_type (container))) | |
10052 | container = ada_coerce_to_simple_array (container); | |
10053 | lhs = ada_coerce_ref (lhs); | |
10054 | if (!deprecated_value_modifiable (lhs)) | |
10055 | error (_("Left operand of assignment is not a modifiable lvalue.")); | |
10056 | ||
0e2da9f0 | 10057 | lhs_type = check_typedef (value_type (lhs)); |
52ce6436 PH |
10058 | if (ada_is_direct_array_type (lhs_type)) |
10059 | { | |
10060 | lhs = ada_coerce_to_simple_array (lhs); | |
0e2da9f0 | 10061 | lhs_type = check_typedef (value_type (lhs)); |
52ce6436 PH |
10062 | low_index = TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type); |
10063 | high_index = TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type); | |
52ce6436 PH |
10064 | } |
10065 | else if (TYPE_CODE (lhs_type) == TYPE_CODE_STRUCT) | |
10066 | { | |
10067 | low_index = 0; | |
10068 | high_index = num_visible_fields (lhs_type) - 1; | |
52ce6436 PH |
10069 | } |
10070 | else | |
10071 | error (_("Left-hand side must be array or record.")); | |
10072 | ||
10073 | num_specs = num_component_specs (exp, *pos - 3); | |
10074 | max_indices = 4 * num_specs + 4; | |
8d749320 | 10075 | indices = XALLOCAVEC (LONGEST, max_indices); |
52ce6436 PH |
10076 | indices[0] = indices[1] = low_index - 1; |
10077 | indices[2] = indices[3] = high_index + 1; | |
10078 | num_indices = 4; | |
10079 | ||
10080 | for (i = 0; i < n; i += 1) | |
10081 | { | |
10082 | switch (exp->elts[*pos].opcode) | |
10083 | { | |
1fbf5ada JB |
10084 | case OP_CHOICES: |
10085 | aggregate_assign_from_choices (container, lhs, exp, pos, indices, | |
10086 | &num_indices, max_indices, | |
10087 | low_index, high_index); | |
10088 | break; | |
10089 | case OP_POSITIONAL: | |
10090 | aggregate_assign_positional (container, lhs, exp, pos, indices, | |
52ce6436 PH |
10091 | &num_indices, max_indices, |
10092 | low_index, high_index); | |
1fbf5ada JB |
10093 | break; |
10094 | case OP_OTHERS: | |
10095 | if (i != n-1) | |
10096 | error (_("Misplaced 'others' clause")); | |
10097 | aggregate_assign_others (container, lhs, exp, pos, indices, | |
10098 | num_indices, low_index, high_index); | |
10099 | break; | |
10100 | default: | |
10101 | error (_("Internal error: bad aggregate clause")); | |
52ce6436 PH |
10102 | } |
10103 | } | |
10104 | ||
10105 | return container; | |
10106 | } | |
10107 | ||
10108 | /* Assign into the component of LHS indexed by the OP_POSITIONAL | |
10109 | construct at *POS, updating *POS past the construct, given that | |
10110 | the positions are relative to lower bound LOW, where HIGH is the | |
10111 | upper bound. Record the position in INDICES[0 .. MAX_INDICES-1] | |
10112 | updating *NUM_INDICES as needed. CONTAINER is as for | |
0963b4bd | 10113 | assign_aggregate. */ |
52ce6436 PH |
10114 | static void |
10115 | aggregate_assign_positional (struct value *container, | |
10116 | struct value *lhs, struct expression *exp, | |
10117 | int *pos, LONGEST *indices, int *num_indices, | |
10118 | int max_indices, LONGEST low, LONGEST high) | |
10119 | { | |
10120 | LONGEST ind = longest_to_int (exp->elts[*pos + 1].longconst) + low; | |
10121 | ||
10122 | if (ind - 1 == high) | |
e1d5a0d2 | 10123 | warning (_("Extra components in aggregate ignored.")); |
52ce6436 PH |
10124 | if (ind <= high) |
10125 | { | |
10126 | add_component_interval (ind, ind, indices, num_indices, max_indices); | |
10127 | *pos += 3; | |
10128 | assign_component (container, lhs, ind, exp, pos); | |
10129 | } | |
10130 | else | |
10131 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10132 | } | |
10133 | ||
10134 | /* Assign into the components of LHS indexed by the OP_CHOICES | |
10135 | construct at *POS, updating *POS past the construct, given that | |
10136 | the allowable indices are LOW..HIGH. Record the indices assigned | |
10137 | to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as | |
0963b4bd | 10138 | needed. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
10139 | static void |
10140 | aggregate_assign_from_choices (struct value *container, | |
10141 | struct value *lhs, struct expression *exp, | |
10142 | int *pos, LONGEST *indices, int *num_indices, | |
10143 | int max_indices, LONGEST low, LONGEST high) | |
10144 | { | |
10145 | int j; | |
10146 | int n_choices = longest_to_int (exp->elts[*pos+1].longconst); | |
10147 | int choice_pos, expr_pc; | |
10148 | int is_array = ada_is_direct_array_type (value_type (lhs)); | |
10149 | ||
10150 | choice_pos = *pos += 3; | |
10151 | ||
10152 | for (j = 0; j < n_choices; j += 1) | |
10153 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10154 | expr_pc = *pos; | |
10155 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10156 | ||
10157 | for (j = 0; j < n_choices; j += 1) | |
10158 | { | |
10159 | LONGEST lower, upper; | |
10160 | enum exp_opcode op = exp->elts[choice_pos].opcode; | |
5b4ee69b | 10161 | |
52ce6436 PH |
10162 | if (op == OP_DISCRETE_RANGE) |
10163 | { | |
10164 | choice_pos += 1; | |
10165 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
10166 | EVAL_NORMAL)); | |
10167 | upper = value_as_long (ada_evaluate_subexp (NULL, exp, pos, | |
10168 | EVAL_NORMAL)); | |
10169 | } | |
10170 | else if (is_array) | |
10171 | { | |
10172 | lower = value_as_long (ada_evaluate_subexp (NULL, exp, &choice_pos, | |
10173 | EVAL_NORMAL)); | |
10174 | upper = lower; | |
10175 | } | |
10176 | else | |
10177 | { | |
10178 | int ind; | |
0d5cff50 | 10179 | const char *name; |
5b4ee69b | 10180 | |
52ce6436 PH |
10181 | switch (op) |
10182 | { | |
10183 | case OP_NAME: | |
10184 | name = &exp->elts[choice_pos + 2].string; | |
10185 | break; | |
10186 | case OP_VAR_VALUE: | |
10187 | name = SYMBOL_NATURAL_NAME (exp->elts[choice_pos + 2].symbol); | |
10188 | break; | |
10189 | default: | |
10190 | error (_("Invalid record component association.")); | |
10191 | } | |
10192 | ada_evaluate_subexp (NULL, exp, &choice_pos, EVAL_SKIP); | |
10193 | ind = 0; | |
10194 | if (! find_struct_field (name, value_type (lhs), 0, | |
10195 | NULL, NULL, NULL, NULL, &ind)) | |
10196 | error (_("Unknown component name: %s."), name); | |
10197 | lower = upper = ind; | |
10198 | } | |
10199 | ||
10200 | if (lower <= upper && (lower < low || upper > high)) | |
10201 | error (_("Index in component association out of bounds.")); | |
10202 | ||
10203 | add_component_interval (lower, upper, indices, num_indices, | |
10204 | max_indices); | |
10205 | while (lower <= upper) | |
10206 | { | |
10207 | int pos1; | |
5b4ee69b | 10208 | |
52ce6436 PH |
10209 | pos1 = expr_pc; |
10210 | assign_component (container, lhs, lower, exp, &pos1); | |
10211 | lower += 1; | |
10212 | } | |
10213 | } | |
10214 | } | |
10215 | ||
10216 | /* Assign the value of the expression in the OP_OTHERS construct in | |
10217 | EXP at *POS into the components of LHS indexed from LOW .. HIGH that | |
10218 | have not been previously assigned. The index intervals already assigned | |
10219 | are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the | |
0963b4bd | 10220 | OP_OTHERS clause. CONTAINER is as for assign_aggregate. */ |
52ce6436 PH |
10221 | static void |
10222 | aggregate_assign_others (struct value *container, | |
10223 | struct value *lhs, struct expression *exp, | |
10224 | int *pos, LONGEST *indices, int num_indices, | |
10225 | LONGEST low, LONGEST high) | |
10226 | { | |
10227 | int i; | |
5ce64950 | 10228 | int expr_pc = *pos + 1; |
52ce6436 PH |
10229 | |
10230 | for (i = 0; i < num_indices - 2; i += 2) | |
10231 | { | |
10232 | LONGEST ind; | |
5b4ee69b | 10233 | |
52ce6436 PH |
10234 | for (ind = indices[i + 1] + 1; ind < indices[i + 2]; ind += 1) |
10235 | { | |
5ce64950 | 10236 | int localpos; |
5b4ee69b | 10237 | |
5ce64950 MS |
10238 | localpos = expr_pc; |
10239 | assign_component (container, lhs, ind, exp, &localpos); | |
52ce6436 PH |
10240 | } |
10241 | } | |
10242 | ada_evaluate_subexp (NULL, exp, pos, EVAL_SKIP); | |
10243 | } | |
10244 | ||
10245 | /* Add the interval [LOW .. HIGH] to the sorted set of intervals | |
10246 | [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ], | |
10247 | modifying *SIZE as needed. It is an error if *SIZE exceeds | |
10248 | MAX_SIZE. The resulting intervals do not overlap. */ | |
10249 | static void | |
10250 | add_component_interval (LONGEST low, LONGEST high, | |
10251 | LONGEST* indices, int *size, int max_size) | |
10252 | { | |
10253 | int i, j; | |
5b4ee69b | 10254 | |
52ce6436 PH |
10255 | for (i = 0; i < *size; i += 2) { |
10256 | if (high >= indices[i] && low <= indices[i + 1]) | |
10257 | { | |
10258 | int kh; | |
5b4ee69b | 10259 | |
52ce6436 PH |
10260 | for (kh = i + 2; kh < *size; kh += 2) |
10261 | if (high < indices[kh]) | |
10262 | break; | |
10263 | if (low < indices[i]) | |
10264 | indices[i] = low; | |
10265 | indices[i + 1] = indices[kh - 1]; | |
10266 | if (high > indices[i + 1]) | |
10267 | indices[i + 1] = high; | |
10268 | memcpy (indices + i + 2, indices + kh, *size - kh); | |
10269 | *size -= kh - i - 2; | |
10270 | return; | |
10271 | } | |
10272 | else if (high < indices[i]) | |
10273 | break; | |
10274 | } | |
10275 | ||
10276 | if (*size == max_size) | |
10277 | error (_("Internal error: miscounted aggregate components.")); | |
10278 | *size += 2; | |
10279 | for (j = *size-1; j >= i+2; j -= 1) | |
10280 | indices[j] = indices[j - 2]; | |
10281 | indices[i] = low; | |
10282 | indices[i + 1] = high; | |
10283 | } | |
10284 | ||
6e48bd2c JB |
10285 | /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2 |
10286 | is different. */ | |
10287 | ||
10288 | static struct value * | |
b7e22850 | 10289 | ada_value_cast (struct type *type, struct value *arg2) |
6e48bd2c JB |
10290 | { |
10291 | if (type == ada_check_typedef (value_type (arg2))) | |
10292 | return arg2; | |
10293 | ||
10294 | if (ada_is_fixed_point_type (type)) | |
10295 | return (cast_to_fixed (type, arg2)); | |
10296 | ||
10297 | if (ada_is_fixed_point_type (value_type (arg2))) | |
a53b7a21 | 10298 | return cast_from_fixed (type, arg2); |
6e48bd2c JB |
10299 | |
10300 | return value_cast (type, arg2); | |
10301 | } | |
10302 | ||
284614f0 JB |
10303 | /* Evaluating Ada expressions, and printing their result. |
10304 | ------------------------------------------------------ | |
10305 | ||
21649b50 JB |
10306 | 1. Introduction: |
10307 | ---------------- | |
10308 | ||
284614f0 JB |
10309 | We usually evaluate an Ada expression in order to print its value. |
10310 | We also evaluate an expression in order to print its type, which | |
10311 | happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation, | |
10312 | but we'll focus mostly on the EVAL_NORMAL phase. In practice, the | |
10313 | EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of | |
10314 | the evaluation compared to the EVAL_NORMAL, but is otherwise very | |
10315 | similar. | |
10316 | ||
10317 | Evaluating expressions is a little more complicated for Ada entities | |
10318 | than it is for entities in languages such as C. The main reason for | |
10319 | this is that Ada provides types whose definition might be dynamic. | |
10320 | One example of such types is variant records. Or another example | |
10321 | would be an array whose bounds can only be known at run time. | |
10322 | ||
10323 | The following description is a general guide as to what should be | |
10324 | done (and what should NOT be done) in order to evaluate an expression | |
10325 | involving such types, and when. This does not cover how the semantic | |
10326 | information is encoded by GNAT as this is covered separatly. For the | |
10327 | document used as the reference for the GNAT encoding, see exp_dbug.ads | |
10328 | in the GNAT sources. | |
10329 | ||
10330 | Ideally, we should embed each part of this description next to its | |
10331 | associated code. Unfortunately, the amount of code is so vast right | |
10332 | now that it's hard to see whether the code handling a particular | |
10333 | situation might be duplicated or not. One day, when the code is | |
10334 | cleaned up, this guide might become redundant with the comments | |
10335 | inserted in the code, and we might want to remove it. | |
10336 | ||
21649b50 JB |
10337 | 2. ``Fixing'' an Entity, the Simple Case: |
10338 | ----------------------------------------- | |
10339 | ||
284614f0 JB |
10340 | When evaluating Ada expressions, the tricky issue is that they may |
10341 | reference entities whose type contents and size are not statically | |
10342 | known. Consider for instance a variant record: | |
10343 | ||
10344 | type Rec (Empty : Boolean := True) is record | |
10345 | case Empty is | |
10346 | when True => null; | |
10347 | when False => Value : Integer; | |
10348 | end case; | |
10349 | end record; | |
10350 | Yes : Rec := (Empty => False, Value => 1); | |
10351 | No : Rec := (empty => True); | |
10352 | ||
10353 | The size and contents of that record depends on the value of the | |
10354 | descriminant (Rec.Empty). At this point, neither the debugging | |
10355 | information nor the associated type structure in GDB are able to | |
10356 | express such dynamic types. So what the debugger does is to create | |
10357 | "fixed" versions of the type that applies to the specific object. | |
10358 | We also informally refer to this opperation as "fixing" an object, | |
10359 | which means creating its associated fixed type. | |
10360 | ||
10361 | Example: when printing the value of variable "Yes" above, its fixed | |
10362 | type would look like this: | |
10363 | ||
10364 | type Rec is record | |
10365 | Empty : Boolean; | |
10366 | Value : Integer; | |
10367 | end record; | |
10368 | ||
10369 | On the other hand, if we printed the value of "No", its fixed type | |
10370 | would become: | |
10371 | ||
10372 | type Rec is record | |
10373 | Empty : Boolean; | |
10374 | end record; | |
10375 | ||
10376 | Things become a little more complicated when trying to fix an entity | |
10377 | with a dynamic type that directly contains another dynamic type, | |
10378 | such as an array of variant records, for instance. There are | |
10379 | two possible cases: Arrays, and records. | |
10380 | ||
21649b50 JB |
10381 | 3. ``Fixing'' Arrays: |
10382 | --------------------- | |
10383 | ||
10384 | The type structure in GDB describes an array in terms of its bounds, | |
10385 | and the type of its elements. By design, all elements in the array | |
10386 | have the same type and we cannot represent an array of variant elements | |
10387 | using the current type structure in GDB. When fixing an array, | |
10388 | we cannot fix the array element, as we would potentially need one | |
10389 | fixed type per element of the array. As a result, the best we can do | |
10390 | when fixing an array is to produce an array whose bounds and size | |
10391 | are correct (allowing us to read it from memory), but without having | |
10392 | touched its element type. Fixing each element will be done later, | |
10393 | when (if) necessary. | |
10394 | ||
10395 | Arrays are a little simpler to handle than records, because the same | |
10396 | amount of memory is allocated for each element of the array, even if | |
1b536f04 | 10397 | the amount of space actually used by each element differs from element |
21649b50 | 10398 | to element. Consider for instance the following array of type Rec: |
284614f0 JB |
10399 | |
10400 | type Rec_Array is array (1 .. 2) of Rec; | |
10401 | ||
1b536f04 JB |
10402 | The actual amount of memory occupied by each element might be different |
10403 | from element to element, depending on the value of their discriminant. | |
21649b50 | 10404 | But the amount of space reserved for each element in the array remains |
1b536f04 | 10405 | fixed regardless. So we simply need to compute that size using |
21649b50 JB |
10406 | the debugging information available, from which we can then determine |
10407 | the array size (we multiply the number of elements of the array by | |
10408 | the size of each element). | |
10409 | ||
10410 | The simplest case is when we have an array of a constrained element | |
10411 | type. For instance, consider the following type declarations: | |
10412 | ||
10413 | type Bounded_String (Max_Size : Integer) is | |
10414 | Length : Integer; | |
10415 | Buffer : String (1 .. Max_Size); | |
10416 | end record; | |
10417 | type Bounded_String_Array is array (1 ..2) of Bounded_String (80); | |
10418 | ||
10419 | In this case, the compiler describes the array as an array of | |
10420 | variable-size elements (identified by its XVS suffix) for which | |
10421 | the size can be read in the parallel XVZ variable. | |
10422 | ||
10423 | In the case of an array of an unconstrained element type, the compiler | |
10424 | wraps the array element inside a private PAD type. This type should not | |
10425 | be shown to the user, and must be "unwrap"'ed before printing. Note | |
284614f0 JB |
10426 | that we also use the adjective "aligner" in our code to designate |
10427 | these wrapper types. | |
10428 | ||
1b536f04 | 10429 | In some cases, the size allocated for each element is statically |
21649b50 JB |
10430 | known. In that case, the PAD type already has the correct size, |
10431 | and the array element should remain unfixed. | |
10432 | ||
10433 | But there are cases when this size is not statically known. | |
10434 | For instance, assuming that "Five" is an integer variable: | |
284614f0 JB |
10435 | |
10436 | type Dynamic is array (1 .. Five) of Integer; | |
10437 | type Wrapper (Has_Length : Boolean := False) is record | |
10438 | Data : Dynamic; | |
10439 | case Has_Length is | |
10440 | when True => Length : Integer; | |
10441 | when False => null; | |
10442 | end case; | |
10443 | end record; | |
10444 | type Wrapper_Array is array (1 .. 2) of Wrapper; | |
10445 | ||
10446 | Hello : Wrapper_Array := (others => (Has_Length => True, | |
10447 | Data => (others => 17), | |
10448 | Length => 1)); | |
10449 | ||
10450 | ||
10451 | The debugging info would describe variable Hello as being an | |
10452 | array of a PAD type. The size of that PAD type is not statically | |
10453 | known, but can be determined using a parallel XVZ variable. | |
10454 | In that case, a copy of the PAD type with the correct size should | |
10455 | be used for the fixed array. | |
10456 | ||
21649b50 JB |
10457 | 3. ``Fixing'' record type objects: |
10458 | ---------------------------------- | |
10459 | ||
10460 | Things are slightly different from arrays in the case of dynamic | |
284614f0 JB |
10461 | record types. In this case, in order to compute the associated |
10462 | fixed type, we need to determine the size and offset of each of | |
10463 | its components. This, in turn, requires us to compute the fixed | |
10464 | type of each of these components. | |
10465 | ||
10466 | Consider for instance the example: | |
10467 | ||
10468 | type Bounded_String (Max_Size : Natural) is record | |
10469 | Str : String (1 .. Max_Size); | |
10470 | Length : Natural; | |
10471 | end record; | |
10472 | My_String : Bounded_String (Max_Size => 10); | |
10473 | ||
10474 | In that case, the position of field "Length" depends on the size | |
10475 | of field Str, which itself depends on the value of the Max_Size | |
21649b50 | 10476 | discriminant. In order to fix the type of variable My_String, |
284614f0 JB |
10477 | we need to fix the type of field Str. Therefore, fixing a variant |
10478 | record requires us to fix each of its components. | |
10479 | ||
10480 | However, if a component does not have a dynamic size, the component | |
10481 | should not be fixed. In particular, fields that use a PAD type | |
10482 | should not fixed. Here is an example where this might happen | |
10483 | (assuming type Rec above): | |
10484 | ||
10485 | type Container (Big : Boolean) is record | |
10486 | First : Rec; | |
10487 | After : Integer; | |
10488 | case Big is | |
10489 | when True => Another : Integer; | |
10490 | when False => null; | |
10491 | end case; | |
10492 | end record; | |
10493 | My_Container : Container := (Big => False, | |
10494 | First => (Empty => True), | |
10495 | After => 42); | |
10496 | ||
10497 | In that example, the compiler creates a PAD type for component First, | |
10498 | whose size is constant, and then positions the component After just | |
10499 | right after it. The offset of component After is therefore constant | |
10500 | in this case. | |
10501 | ||
10502 | The debugger computes the position of each field based on an algorithm | |
10503 | that uses, among other things, the actual position and size of the field | |
21649b50 JB |
10504 | preceding it. Let's now imagine that the user is trying to print |
10505 | the value of My_Container. If the type fixing was recursive, we would | |
284614f0 JB |
10506 | end up computing the offset of field After based on the size of the |
10507 | fixed version of field First. And since in our example First has | |
10508 | only one actual field, the size of the fixed type is actually smaller | |
10509 | than the amount of space allocated to that field, and thus we would | |
10510 | compute the wrong offset of field After. | |
10511 | ||
21649b50 JB |
10512 | To make things more complicated, we need to watch out for dynamic |
10513 | components of variant records (identified by the ___XVL suffix in | |
10514 | the component name). Even if the target type is a PAD type, the size | |
10515 | of that type might not be statically known. So the PAD type needs | |
10516 | to be unwrapped and the resulting type needs to be fixed. Otherwise, | |
10517 | we might end up with the wrong size for our component. This can be | |
10518 | observed with the following type declarations: | |
284614f0 JB |
10519 | |
10520 | type Octal is new Integer range 0 .. 7; | |
10521 | type Octal_Array is array (Positive range <>) of Octal; | |
10522 | pragma Pack (Octal_Array); | |
10523 | ||
10524 | type Octal_Buffer (Size : Positive) is record | |
10525 | Buffer : Octal_Array (1 .. Size); | |
10526 | Length : Integer; | |
10527 | end record; | |
10528 | ||
10529 | In that case, Buffer is a PAD type whose size is unset and needs | |
10530 | to be computed by fixing the unwrapped type. | |
10531 | ||
21649b50 JB |
10532 | 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity: |
10533 | ---------------------------------------------------------- | |
10534 | ||
10535 | Lastly, when should the sub-elements of an entity that remained unfixed | |
284614f0 JB |
10536 | thus far, be actually fixed? |
10537 | ||
10538 | The answer is: Only when referencing that element. For instance | |
10539 | when selecting one component of a record, this specific component | |
10540 | should be fixed at that point in time. Or when printing the value | |
10541 | of a record, each component should be fixed before its value gets | |
10542 | printed. Similarly for arrays, the element of the array should be | |
10543 | fixed when printing each element of the array, or when extracting | |
10544 | one element out of that array. On the other hand, fixing should | |
10545 | not be performed on the elements when taking a slice of an array! | |
10546 | ||
31432a67 | 10547 | Note that one of the side effects of miscomputing the offset and |
284614f0 JB |
10548 | size of each field is that we end up also miscomputing the size |
10549 | of the containing type. This can have adverse results when computing | |
10550 | the value of an entity. GDB fetches the value of an entity based | |
10551 | on the size of its type, and thus a wrong size causes GDB to fetch | |
10552 | the wrong amount of memory. In the case where the computed size is | |
10553 | too small, GDB fetches too little data to print the value of our | |
31432a67 | 10554 | entity. Results in this case are unpredictable, as we usually read |
284614f0 JB |
10555 | past the buffer containing the data =:-o. */ |
10556 | ||
ced9779b JB |
10557 | /* Evaluate a subexpression of EXP, at index *POS, and return a value |
10558 | for that subexpression cast to TO_TYPE. Advance *POS over the | |
10559 | subexpression. */ | |
10560 | ||
10561 | static value * | |
10562 | ada_evaluate_subexp_for_cast (expression *exp, int *pos, | |
10563 | enum noside noside, struct type *to_type) | |
10564 | { | |
10565 | int pc = *pos; | |
10566 | ||
10567 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE | |
10568 | || exp->elts[pc].opcode == OP_VAR_VALUE) | |
10569 | { | |
10570 | (*pos) += 4; | |
10571 | ||
10572 | value *val; | |
10573 | if (exp->elts[pc].opcode == OP_VAR_MSYM_VALUE) | |
10574 | { | |
10575 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
10576 | return value_zero (to_type, not_lval); | |
10577 | ||
10578 | val = evaluate_var_msym_value (noside, | |
10579 | exp->elts[pc + 1].objfile, | |
10580 | exp->elts[pc + 2].msymbol); | |
10581 | } | |
10582 | else | |
10583 | val = evaluate_var_value (noside, | |
10584 | exp->elts[pc + 1].block, | |
10585 | exp->elts[pc + 2].symbol); | |
10586 | ||
10587 | if (noside == EVAL_SKIP) | |
10588 | return eval_skip_value (exp); | |
10589 | ||
10590 | val = ada_value_cast (to_type, val); | |
10591 | ||
10592 | /* Follow the Ada language semantics that do not allow taking | |
10593 | an address of the result of a cast (view conversion in Ada). */ | |
10594 | if (VALUE_LVAL (val) == lval_memory) | |
10595 | { | |
10596 | if (value_lazy (val)) | |
10597 | value_fetch_lazy (val); | |
10598 | VALUE_LVAL (val) = not_lval; | |
10599 | } | |
10600 | return val; | |
10601 | } | |
10602 | ||
10603 | value *val = evaluate_subexp (to_type, exp, pos, noside); | |
10604 | if (noside == EVAL_SKIP) | |
10605 | return eval_skip_value (exp); | |
10606 | return ada_value_cast (to_type, val); | |
10607 | } | |
10608 | ||
284614f0 JB |
10609 | /* Implement the evaluate_exp routine in the exp_descriptor structure |
10610 | for the Ada language. */ | |
10611 | ||
52ce6436 | 10612 | static struct value * |
ebf56fd3 | 10613 | ada_evaluate_subexp (struct type *expect_type, struct expression *exp, |
4c4b4cd2 | 10614 | int *pos, enum noside noside) |
14f9c5c9 AS |
10615 | { |
10616 | enum exp_opcode op; | |
b5385fc0 | 10617 | int tem; |
14f9c5c9 | 10618 | int pc; |
5ec18f2b | 10619 | int preeval_pos; |
14f9c5c9 AS |
10620 | struct value *arg1 = NULL, *arg2 = NULL, *arg3; |
10621 | struct type *type; | |
52ce6436 | 10622 | int nargs, oplen; |
d2e4a39e | 10623 | struct value **argvec; |
14f9c5c9 | 10624 | |
d2e4a39e AS |
10625 | pc = *pos; |
10626 | *pos += 1; | |
14f9c5c9 AS |
10627 | op = exp->elts[pc].opcode; |
10628 | ||
d2e4a39e | 10629 | switch (op) |
14f9c5c9 AS |
10630 | { |
10631 | default: | |
10632 | *pos -= 1; | |
6e48bd2c | 10633 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); |
ca1f964d JG |
10634 | |
10635 | if (noside == EVAL_NORMAL) | |
10636 | arg1 = unwrap_value (arg1); | |
6e48bd2c | 10637 | |
edd079d9 | 10638 | /* If evaluating an OP_FLOAT and an EXPECT_TYPE was provided, |
6e48bd2c JB |
10639 | then we need to perform the conversion manually, because |
10640 | evaluate_subexp_standard doesn't do it. This conversion is | |
10641 | necessary in Ada because the different kinds of float/fixed | |
10642 | types in Ada have different representations. | |
10643 | ||
10644 | Similarly, we need to perform the conversion from OP_LONG | |
10645 | ourselves. */ | |
edd079d9 | 10646 | if ((op == OP_FLOAT || op == OP_LONG) && expect_type != NULL) |
b7e22850 | 10647 | arg1 = ada_value_cast (expect_type, arg1); |
6e48bd2c JB |
10648 | |
10649 | return arg1; | |
4c4b4cd2 PH |
10650 | |
10651 | case OP_STRING: | |
10652 | { | |
76a01679 | 10653 | struct value *result; |
5b4ee69b | 10654 | |
76a01679 JB |
10655 | *pos -= 1; |
10656 | result = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10657 | /* The result type will have code OP_STRING, bashed there from | |
10658 | OP_ARRAY. Bash it back. */ | |
df407dfe AC |
10659 | if (TYPE_CODE (value_type (result)) == TYPE_CODE_STRING) |
10660 | TYPE_CODE (value_type (result)) = TYPE_CODE_ARRAY; | |
76a01679 | 10661 | return result; |
4c4b4cd2 | 10662 | } |
14f9c5c9 AS |
10663 | |
10664 | case UNOP_CAST: | |
10665 | (*pos) += 2; | |
10666 | type = exp->elts[pc + 1].type; | |
ced9779b | 10667 | return ada_evaluate_subexp_for_cast (exp, pos, noside, type); |
14f9c5c9 | 10668 | |
4c4b4cd2 PH |
10669 | case UNOP_QUAL: |
10670 | (*pos) += 2; | |
10671 | type = exp->elts[pc + 1].type; | |
10672 | return ada_evaluate_subexp (type, exp, pos, noside); | |
10673 | ||
14f9c5c9 AS |
10674 | case BINOP_ASSIGN: |
10675 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
52ce6436 PH |
10676 | if (exp->elts[*pos].opcode == OP_AGGREGATE) |
10677 | { | |
10678 | arg1 = assign_aggregate (arg1, arg1, exp, pos, noside); | |
10679 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) | |
10680 | return arg1; | |
10681 | return ada_value_assign (arg1, arg1); | |
10682 | } | |
003f3813 JB |
10683 | /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1, |
10684 | except if the lhs of our assignment is a convenience variable. | |
10685 | In the case of assigning to a convenience variable, the lhs | |
10686 | should be exactly the result of the evaluation of the rhs. */ | |
10687 | type = value_type (arg1); | |
10688 | if (VALUE_LVAL (arg1) == lval_internalvar) | |
10689 | type = NULL; | |
10690 | arg2 = evaluate_subexp (type, exp, pos, noside); | |
14f9c5c9 | 10691 | if (noside == EVAL_SKIP || noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 | 10692 | return arg1; |
df407dfe AC |
10693 | if (ada_is_fixed_point_type (value_type (arg1))) |
10694 | arg2 = cast_to_fixed (value_type (arg1), arg2); | |
10695 | else if (ada_is_fixed_point_type (value_type (arg2))) | |
76a01679 | 10696 | error |
323e0a4a | 10697 | (_("Fixed-point values must be assigned to fixed-point variables")); |
d2e4a39e | 10698 | else |
df407dfe | 10699 | arg2 = coerce_for_assign (value_type (arg1), arg2); |
4c4b4cd2 | 10700 | return ada_value_assign (arg1, arg2); |
14f9c5c9 AS |
10701 | |
10702 | case BINOP_ADD: | |
10703 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10704 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10705 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10706 | goto nosideret; |
2ac8a782 JB |
10707 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10708 | return (value_from_longest | |
10709 | (value_type (arg1), | |
10710 | value_as_long (arg1) + value_as_long (arg2))); | |
c40cc657 JB |
10711 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10712 | return (value_from_longest | |
10713 | (value_type (arg2), | |
10714 | value_as_long (arg1) + value_as_long (arg2))); | |
df407dfe AC |
10715 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10716 | || ada_is_fixed_point_type (value_type (arg2))) | |
10717 | && value_type (arg1) != value_type (arg2)) | |
323e0a4a | 10718 | error (_("Operands of fixed-point addition must have the same type")); |
b7789565 JB |
10719 | /* Do the addition, and cast the result to the type of the first |
10720 | argument. We cannot cast the result to a reference type, so if | |
10721 | ARG1 is a reference type, find its underlying type. */ | |
10722 | type = value_type (arg1); | |
10723 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10724 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10725 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10726 | return value_cast (type, value_binop (arg1, arg2, BINOP_ADD)); |
14f9c5c9 AS |
10727 | |
10728 | case BINOP_SUB: | |
10729 | arg1 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10730 | arg2 = evaluate_subexp_with_coercion (exp, pos, noside); | |
10731 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10732 | goto nosideret; |
2ac8a782 JB |
10733 | if (TYPE_CODE (value_type (arg1)) == TYPE_CODE_PTR) |
10734 | return (value_from_longest | |
10735 | (value_type (arg1), | |
10736 | value_as_long (arg1) - value_as_long (arg2))); | |
c40cc657 JB |
10737 | if (TYPE_CODE (value_type (arg2)) == TYPE_CODE_PTR) |
10738 | return (value_from_longest | |
10739 | (value_type (arg2), | |
10740 | value_as_long (arg1) - value_as_long (arg2))); | |
df407dfe AC |
10741 | if ((ada_is_fixed_point_type (value_type (arg1)) |
10742 | || ada_is_fixed_point_type (value_type (arg2))) | |
10743 | && value_type (arg1) != value_type (arg2)) | |
0963b4bd MS |
10744 | error (_("Operands of fixed-point subtraction " |
10745 | "must have the same type")); | |
b7789565 JB |
10746 | /* Do the substraction, and cast the result to the type of the first |
10747 | argument. We cannot cast the result to a reference type, so if | |
10748 | ARG1 is a reference type, find its underlying type. */ | |
10749 | type = value_type (arg1); | |
10750 | while (TYPE_CODE (type) == TYPE_CODE_REF) | |
10751 | type = TYPE_TARGET_TYPE (type); | |
f44316fa | 10752 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
89eef114 | 10753 | return value_cast (type, value_binop (arg1, arg2, BINOP_SUB)); |
14f9c5c9 AS |
10754 | |
10755 | case BINOP_MUL: | |
10756 | case BINOP_DIV: | |
e1578042 JB |
10757 | case BINOP_REM: |
10758 | case BINOP_MOD: | |
14f9c5c9 AS |
10759 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
10760 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10761 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 10762 | goto nosideret; |
e1578042 | 10763 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
9c2be529 JB |
10764 | { |
10765 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10766 | return value_zero (value_type (arg1), not_lval); | |
10767 | } | |
14f9c5c9 | 10768 | else |
4c4b4cd2 | 10769 | { |
a53b7a21 | 10770 | type = builtin_type (exp->gdbarch)->builtin_double; |
df407dfe | 10771 | if (ada_is_fixed_point_type (value_type (arg1))) |
a53b7a21 | 10772 | arg1 = cast_from_fixed (type, arg1); |
df407dfe | 10773 | if (ada_is_fixed_point_type (value_type (arg2))) |
a53b7a21 | 10774 | arg2 = cast_from_fixed (type, arg2); |
f44316fa | 10775 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
4c4b4cd2 PH |
10776 | return ada_value_binop (arg1, arg2, op); |
10777 | } | |
10778 | ||
4c4b4cd2 PH |
10779 | case BINOP_EQUAL: |
10780 | case BINOP_NOTEQUAL: | |
14f9c5c9 | 10781 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
df407dfe | 10782 | arg2 = evaluate_subexp (value_type (arg1), exp, pos, noside); |
14f9c5c9 | 10783 | if (noside == EVAL_SKIP) |
76a01679 | 10784 | goto nosideret; |
4c4b4cd2 | 10785 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 10786 | tem = 0; |
4c4b4cd2 | 10787 | else |
f44316fa UW |
10788 | { |
10789 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
10790 | tem = ada_value_equal (arg1, arg2); | |
10791 | } | |
4c4b4cd2 | 10792 | if (op == BINOP_NOTEQUAL) |
76a01679 | 10793 | tem = !tem; |
fbb06eb1 UW |
10794 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10795 | return value_from_longest (type, (LONGEST) tem); | |
4c4b4cd2 PH |
10796 | |
10797 | case UNOP_NEG: | |
10798 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10799 | if (noside == EVAL_SKIP) | |
10800 | goto nosideret; | |
df407dfe AC |
10801 | else if (ada_is_fixed_point_type (value_type (arg1))) |
10802 | return value_cast (value_type (arg1), value_neg (arg1)); | |
14f9c5c9 | 10803 | else |
f44316fa UW |
10804 | { |
10805 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
10806 | return value_neg (arg1); | |
10807 | } | |
4c4b4cd2 | 10808 | |
2330c6c6 JB |
10809 | case BINOP_LOGICAL_AND: |
10810 | case BINOP_LOGICAL_OR: | |
10811 | case UNOP_LOGICAL_NOT: | |
000d5124 JB |
10812 | { |
10813 | struct value *val; | |
10814 | ||
10815 | *pos -= 1; | |
10816 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
fbb06eb1 UW |
10817 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
10818 | return value_cast (type, val); | |
000d5124 | 10819 | } |
2330c6c6 JB |
10820 | |
10821 | case BINOP_BITWISE_AND: | |
10822 | case BINOP_BITWISE_IOR: | |
10823 | case BINOP_BITWISE_XOR: | |
000d5124 JB |
10824 | { |
10825 | struct value *val; | |
10826 | ||
10827 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_AVOID_SIDE_EFFECTS); | |
10828 | *pos = pc; | |
10829 | val = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10830 | ||
10831 | return value_cast (value_type (arg1), val); | |
10832 | } | |
2330c6c6 | 10833 | |
14f9c5c9 AS |
10834 | case OP_VAR_VALUE: |
10835 | *pos -= 1; | |
6799def4 | 10836 | |
14f9c5c9 | 10837 | if (noside == EVAL_SKIP) |
4c4b4cd2 PH |
10838 | { |
10839 | *pos += 4; | |
10840 | goto nosideret; | |
10841 | } | |
da5c522f JB |
10842 | |
10843 | if (SYMBOL_DOMAIN (exp->elts[pc + 2].symbol) == UNDEF_DOMAIN) | |
76a01679 JB |
10844 | /* Only encountered when an unresolved symbol occurs in a |
10845 | context other than a function call, in which case, it is | |
52ce6436 | 10846 | invalid. */ |
323e0a4a | 10847 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 | 10848 | SYMBOL_PRINT_NAME (exp->elts[pc + 2].symbol)); |
da5c522f JB |
10849 | |
10850 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
4c4b4cd2 | 10851 | { |
0c1f74cf | 10852 | type = static_unwrap_type (SYMBOL_TYPE (exp->elts[pc + 2].symbol)); |
31dbc1c5 JB |
10853 | /* Check to see if this is a tagged type. We also need to handle |
10854 | the case where the type is a reference to a tagged type, but | |
10855 | we have to be careful to exclude pointers to tagged types. | |
10856 | The latter should be shown as usual (as a pointer), whereas | |
10857 | a reference should mostly be transparent to the user. */ | |
10858 | if (ada_is_tagged_type (type, 0) | |
023db19c | 10859 | || (TYPE_CODE (type) == TYPE_CODE_REF |
31dbc1c5 | 10860 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0))) |
0d72a7c3 JB |
10861 | { |
10862 | /* Tagged types are a little special in the fact that the real | |
10863 | type is dynamic and can only be determined by inspecting the | |
10864 | object's tag. This means that we need to get the object's | |
10865 | value first (EVAL_NORMAL) and then extract the actual object | |
10866 | type from its tag. | |
10867 | ||
10868 | Note that we cannot skip the final step where we extract | |
10869 | the object type from its tag, because the EVAL_NORMAL phase | |
10870 | results in dynamic components being resolved into fixed ones. | |
10871 | This can cause problems when trying to print the type | |
10872 | description of tagged types whose parent has a dynamic size: | |
10873 | We use the type name of the "_parent" component in order | |
10874 | to print the name of the ancestor type in the type description. | |
10875 | If that component had a dynamic size, the resolution into | |
10876 | a fixed type would result in the loss of that type name, | |
10877 | thus preventing us from printing the name of the ancestor | |
10878 | type in the type description. */ | |
10879 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, EVAL_NORMAL); | |
10880 | ||
10881 | if (TYPE_CODE (type) != TYPE_CODE_REF) | |
10882 | { | |
10883 | struct type *actual_type; | |
10884 | ||
10885 | actual_type = type_from_tag (ada_value_tag (arg1)); | |
10886 | if (actual_type == NULL) | |
10887 | /* If, for some reason, we were unable to determine | |
10888 | the actual type from the tag, then use the static | |
10889 | approximation that we just computed as a fallback. | |
10890 | This can happen if the debugging information is | |
10891 | incomplete, for instance. */ | |
10892 | actual_type = type; | |
10893 | return value_zero (actual_type, not_lval); | |
10894 | } | |
10895 | else | |
10896 | { | |
10897 | /* In the case of a ref, ada_coerce_ref takes care | |
10898 | of determining the actual type. But the evaluation | |
10899 | should return a ref as it should be valid to ask | |
10900 | for its address; so rebuild a ref after coerce. */ | |
10901 | arg1 = ada_coerce_ref (arg1); | |
a65cfae5 | 10902 | return value_ref (arg1, TYPE_CODE_REF); |
0d72a7c3 JB |
10903 | } |
10904 | } | |
0c1f74cf | 10905 | |
84754697 JB |
10906 | /* Records and unions for which GNAT encodings have been |
10907 | generated need to be statically fixed as well. | |
10908 | Otherwise, non-static fixing produces a type where | |
10909 | all dynamic properties are removed, which prevents "ptype" | |
10910 | from being able to completely describe the type. | |
10911 | For instance, a case statement in a variant record would be | |
10912 | replaced by the relevant components based on the actual | |
10913 | value of the discriminants. */ | |
10914 | if ((TYPE_CODE (type) == TYPE_CODE_STRUCT | |
10915 | && dynamic_template_type (type) != NULL) | |
10916 | || (TYPE_CODE (type) == TYPE_CODE_UNION | |
10917 | && ada_find_parallel_type (type, "___XVU") != NULL)) | |
10918 | { | |
10919 | *pos += 4; | |
10920 | return value_zero (to_static_fixed_type (type), not_lval); | |
10921 | } | |
4c4b4cd2 | 10922 | } |
da5c522f JB |
10923 | |
10924 | arg1 = evaluate_subexp_standard (expect_type, exp, pos, noside); | |
10925 | return ada_to_fixed_value (arg1); | |
4c4b4cd2 PH |
10926 | |
10927 | case OP_FUNCALL: | |
10928 | (*pos) += 2; | |
10929 | ||
10930 | /* Allocate arg vector, including space for the function to be | |
10931 | called in argvec[0] and a terminating NULL. */ | |
10932 | nargs = longest_to_int (exp->elts[pc + 1].longconst); | |
8d749320 | 10933 | argvec = XALLOCAVEC (struct value *, nargs + 2); |
4c4b4cd2 PH |
10934 | |
10935 | if (exp->elts[*pos].opcode == OP_VAR_VALUE | |
76a01679 | 10936 | && SYMBOL_DOMAIN (exp->elts[pc + 5].symbol) == UNDEF_DOMAIN) |
323e0a4a | 10937 | error (_("Unexpected unresolved symbol, %s, during evaluation"), |
4c4b4cd2 PH |
10938 | SYMBOL_PRINT_NAME (exp->elts[pc + 5].symbol)); |
10939 | else | |
10940 | { | |
10941 | for (tem = 0; tem <= nargs; tem += 1) | |
10942 | argvec[tem] = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
10943 | argvec[tem] = 0; | |
10944 | ||
10945 | if (noside == EVAL_SKIP) | |
10946 | goto nosideret; | |
10947 | } | |
10948 | ||
ad82864c JB |
10949 | if (ada_is_constrained_packed_array_type |
10950 | (desc_base_type (value_type (argvec[0])))) | |
4c4b4cd2 | 10951 | argvec[0] = ada_coerce_to_simple_array (argvec[0]); |
284614f0 JB |
10952 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY |
10953 | && TYPE_FIELD_BITSIZE (value_type (argvec[0]), 0) != 0) | |
10954 | /* This is a packed array that has already been fixed, and | |
10955 | therefore already coerced to a simple array. Nothing further | |
10956 | to do. */ | |
10957 | ; | |
e6c2c623 PMR |
10958 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_REF) |
10959 | { | |
10960 | /* Make sure we dereference references so that all the code below | |
10961 | feels like it's really handling the referenced value. Wrapping | |
10962 | types (for alignment) may be there, so make sure we strip them as | |
10963 | well. */ | |
10964 | argvec[0] = ada_to_fixed_value (coerce_ref (argvec[0])); | |
10965 | } | |
10966 | else if (TYPE_CODE (value_type (argvec[0])) == TYPE_CODE_ARRAY | |
10967 | && VALUE_LVAL (argvec[0]) == lval_memory) | |
10968 | argvec[0] = value_addr (argvec[0]); | |
4c4b4cd2 | 10969 | |
df407dfe | 10970 | type = ada_check_typedef (value_type (argvec[0])); |
720d1a40 JB |
10971 | |
10972 | /* Ada allows us to implicitly dereference arrays when subscripting | |
8f465ea7 JB |
10973 | them. So, if this is an array typedef (encoding use for array |
10974 | access types encoded as fat pointers), strip it now. */ | |
720d1a40 JB |
10975 | if (TYPE_CODE (type) == TYPE_CODE_TYPEDEF) |
10976 | type = ada_typedef_target_type (type); | |
10977 | ||
4c4b4cd2 PH |
10978 | if (TYPE_CODE (type) == TYPE_CODE_PTR) |
10979 | { | |
61ee279c | 10980 | switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type)))) |
4c4b4cd2 PH |
10981 | { |
10982 | case TYPE_CODE_FUNC: | |
61ee279c | 10983 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10984 | break; |
10985 | case TYPE_CODE_ARRAY: | |
10986 | break; | |
10987 | case TYPE_CODE_STRUCT: | |
10988 | if (noside != EVAL_AVOID_SIDE_EFFECTS) | |
10989 | argvec[0] = ada_value_ind (argvec[0]); | |
61ee279c | 10990 | type = ada_check_typedef (TYPE_TARGET_TYPE (type)); |
4c4b4cd2 PH |
10991 | break; |
10992 | default: | |
323e0a4a | 10993 | error (_("cannot subscript or call something of type `%s'"), |
df407dfe | 10994 | ada_type_name (value_type (argvec[0]))); |
4c4b4cd2 PH |
10995 | break; |
10996 | } | |
10997 | } | |
10998 | ||
10999 | switch (TYPE_CODE (type)) | |
11000 | { | |
11001 | case TYPE_CODE_FUNC: | |
11002 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
c8ea1972 | 11003 | { |
7022349d PA |
11004 | if (TYPE_TARGET_TYPE (type) == NULL) |
11005 | error_call_unknown_return_type (NULL); | |
11006 | return allocate_value (TYPE_TARGET_TYPE (type)); | |
c8ea1972 | 11007 | } |
7022349d | 11008 | return call_function_by_hand (argvec[0], NULL, nargs, argvec + 1); |
c8ea1972 PH |
11009 | case TYPE_CODE_INTERNAL_FUNCTION: |
11010 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11011 | /* We don't know anything about what the internal | |
11012 | function might return, but we have to return | |
11013 | something. */ | |
11014 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
11015 | not_lval); | |
11016 | else | |
11017 | return call_internal_function (exp->gdbarch, exp->language_defn, | |
11018 | argvec[0], nargs, argvec + 1); | |
11019 | ||
4c4b4cd2 PH |
11020 | case TYPE_CODE_STRUCT: |
11021 | { | |
11022 | int arity; | |
11023 | ||
4c4b4cd2 PH |
11024 | arity = ada_array_arity (type); |
11025 | type = ada_array_element_type (type, nargs); | |
11026 | if (type == NULL) | |
323e0a4a | 11027 | error (_("cannot subscript or call a record")); |
4c4b4cd2 | 11028 | if (arity != nargs) |
323e0a4a | 11029 | error (_("wrong number of subscripts; expecting %d"), arity); |
4c4b4cd2 | 11030 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
0a07e705 | 11031 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
11032 | return |
11033 | unwrap_value (ada_value_subscript | |
11034 | (argvec[0], nargs, argvec + 1)); | |
11035 | } | |
11036 | case TYPE_CODE_ARRAY: | |
11037 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11038 | { | |
11039 | type = ada_array_element_type (type, nargs); | |
11040 | if (type == NULL) | |
323e0a4a | 11041 | error (_("element type of array unknown")); |
4c4b4cd2 | 11042 | else |
0a07e705 | 11043 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
11044 | } |
11045 | return | |
11046 | unwrap_value (ada_value_subscript | |
11047 | (ada_coerce_to_simple_array (argvec[0]), | |
11048 | nargs, argvec + 1)); | |
11049 | case TYPE_CODE_PTR: /* Pointer to array */ | |
4c4b4cd2 PH |
11050 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
11051 | { | |
deede10c | 11052 | type = to_fixed_array_type (TYPE_TARGET_TYPE (type), NULL, 1); |
4c4b4cd2 PH |
11053 | type = ada_array_element_type (type, nargs); |
11054 | if (type == NULL) | |
323e0a4a | 11055 | error (_("element type of array unknown")); |
4c4b4cd2 | 11056 | else |
0a07e705 | 11057 | return value_zero (ada_aligned_type (type), lval_memory); |
4c4b4cd2 PH |
11058 | } |
11059 | return | |
deede10c JB |
11060 | unwrap_value (ada_value_ptr_subscript (argvec[0], |
11061 | nargs, argvec + 1)); | |
4c4b4cd2 PH |
11062 | |
11063 | default: | |
e1d5a0d2 PH |
11064 | error (_("Attempt to index or call something other than an " |
11065 | "array or function")); | |
4c4b4cd2 PH |
11066 | } |
11067 | ||
11068 | case TERNOP_SLICE: | |
11069 | { | |
11070 | struct value *array = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11071 | struct value *low_bound_val = | |
11072 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
714e53ab PH |
11073 | struct value *high_bound_val = |
11074 | evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11075 | LONGEST low_bound; | |
11076 | LONGEST high_bound; | |
5b4ee69b | 11077 | |
994b9211 AC |
11078 | low_bound_val = coerce_ref (low_bound_val); |
11079 | high_bound_val = coerce_ref (high_bound_val); | |
aa715135 JG |
11080 | low_bound = value_as_long (low_bound_val); |
11081 | high_bound = value_as_long (high_bound_val); | |
963a6417 | 11082 | |
4c4b4cd2 PH |
11083 | if (noside == EVAL_SKIP) |
11084 | goto nosideret; | |
11085 | ||
4c4b4cd2 PH |
11086 | /* If this is a reference to an aligner type, then remove all |
11087 | the aligners. */ | |
df407dfe AC |
11088 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
11089 | && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array)))) | |
11090 | TYPE_TARGET_TYPE (value_type (array)) = | |
11091 | ada_aligned_type (TYPE_TARGET_TYPE (value_type (array))); | |
4c4b4cd2 | 11092 | |
ad82864c | 11093 | if (ada_is_constrained_packed_array_type (value_type (array))) |
323e0a4a | 11094 | error (_("cannot slice a packed array")); |
4c4b4cd2 PH |
11095 | |
11096 | /* If this is a reference to an array or an array lvalue, | |
11097 | convert to a pointer. */ | |
df407dfe AC |
11098 | if (TYPE_CODE (value_type (array)) == TYPE_CODE_REF |
11099 | || (TYPE_CODE (value_type (array)) == TYPE_CODE_ARRAY | |
4c4b4cd2 PH |
11100 | && VALUE_LVAL (array) == lval_memory)) |
11101 | array = value_addr (array); | |
11102 | ||
1265e4aa | 11103 | if (noside == EVAL_AVOID_SIDE_EFFECTS |
61ee279c | 11104 | && ada_is_array_descriptor_type (ada_check_typedef |
df407dfe | 11105 | (value_type (array)))) |
0b5d8877 | 11106 | return empty_array (ada_type_of_array (array, 0), low_bound); |
4c4b4cd2 PH |
11107 | |
11108 | array = ada_coerce_to_simple_array_ptr (array); | |
11109 | ||
714e53ab PH |
11110 | /* If we have more than one level of pointer indirection, |
11111 | dereference the value until we get only one level. */ | |
df407dfe AC |
11112 | while (TYPE_CODE (value_type (array)) == TYPE_CODE_PTR |
11113 | && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array))) | |
714e53ab PH |
11114 | == TYPE_CODE_PTR)) |
11115 | array = value_ind (array); | |
11116 | ||
11117 | /* Make sure we really do have an array type before going further, | |
11118 | to avoid a SEGV when trying to get the index type or the target | |
11119 | type later down the road if the debug info generated by | |
11120 | the compiler is incorrect or incomplete. */ | |
df407dfe | 11121 | if (!ada_is_simple_array_type (value_type (array))) |
323e0a4a | 11122 | error (_("cannot take slice of non-array")); |
714e53ab | 11123 | |
828292f2 JB |
11124 | if (TYPE_CODE (ada_check_typedef (value_type (array))) |
11125 | == TYPE_CODE_PTR) | |
4c4b4cd2 | 11126 | { |
828292f2 JB |
11127 | struct type *type0 = ada_check_typedef (value_type (array)); |
11128 | ||
0b5d8877 | 11129 | if (high_bound < low_bound || noside == EVAL_AVOID_SIDE_EFFECTS) |
828292f2 | 11130 | return empty_array (TYPE_TARGET_TYPE (type0), low_bound); |
4c4b4cd2 PH |
11131 | else |
11132 | { | |
11133 | struct type *arr_type0 = | |
828292f2 | 11134 | to_fixed_array_type (TYPE_TARGET_TYPE (type0), NULL, 1); |
5b4ee69b | 11135 | |
f5938064 JG |
11136 | return ada_value_slice_from_ptr (array, arr_type0, |
11137 | longest_to_int (low_bound), | |
11138 | longest_to_int (high_bound)); | |
4c4b4cd2 PH |
11139 | } |
11140 | } | |
11141 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11142 | return array; | |
11143 | else if (high_bound < low_bound) | |
df407dfe | 11144 | return empty_array (value_type (array), low_bound); |
4c4b4cd2 | 11145 | else |
529cad9c PH |
11146 | return ada_value_slice (array, longest_to_int (low_bound), |
11147 | longest_to_int (high_bound)); | |
4c4b4cd2 | 11148 | } |
14f9c5c9 | 11149 | |
4c4b4cd2 PH |
11150 | case UNOP_IN_RANGE: |
11151 | (*pos) += 2; | |
11152 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8008e265 | 11153 | type = check_typedef (exp->elts[pc + 1].type); |
14f9c5c9 | 11154 | |
14f9c5c9 | 11155 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 11156 | goto nosideret; |
14f9c5c9 | 11157 | |
4c4b4cd2 PH |
11158 | switch (TYPE_CODE (type)) |
11159 | { | |
11160 | default: | |
e1d5a0d2 PH |
11161 | lim_warning (_("Membership test incompletely implemented; " |
11162 | "always returns true")); | |
fbb06eb1 UW |
11163 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
11164 | return value_from_longest (type, (LONGEST) 1); | |
4c4b4cd2 PH |
11165 | |
11166 | case TYPE_CODE_RANGE: | |
030b4912 UW |
11167 | arg2 = value_from_longest (type, TYPE_LOW_BOUND (type)); |
11168 | arg3 = value_from_longest (type, TYPE_HIGH_BOUND (type)); | |
f44316fa UW |
11169 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
11170 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 UW |
11171 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
11172 | return | |
11173 | value_from_longest (type, | |
4c4b4cd2 PH |
11174 | (value_less (arg1, arg3) |
11175 | || value_equal (arg1, arg3)) | |
11176 | && (value_less (arg2, arg1) | |
11177 | || value_equal (arg2, arg1))); | |
11178 | } | |
11179 | ||
11180 | case BINOP_IN_BOUNDS: | |
14f9c5c9 | 11181 | (*pos) += 2; |
4c4b4cd2 PH |
11182 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11183 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
14f9c5c9 | 11184 | |
4c4b4cd2 PH |
11185 | if (noside == EVAL_SKIP) |
11186 | goto nosideret; | |
14f9c5c9 | 11187 | |
4c4b4cd2 | 11188 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
fbb06eb1 UW |
11189 | { |
11190 | type = language_bool_type (exp->language_defn, exp->gdbarch); | |
11191 | return value_zero (type, not_lval); | |
11192 | } | |
14f9c5c9 | 11193 | |
4c4b4cd2 | 11194 | tem = longest_to_int (exp->elts[pc + 1].longconst); |
14f9c5c9 | 11195 | |
1eea4ebd UW |
11196 | type = ada_index_type (value_type (arg2), tem, "range"); |
11197 | if (!type) | |
11198 | type = value_type (arg1); | |
14f9c5c9 | 11199 | |
1eea4ebd UW |
11200 | arg3 = value_from_longest (type, ada_array_bound (arg2, tem, 1)); |
11201 | arg2 = value_from_longest (type, ada_array_bound (arg2, tem, 0)); | |
d2e4a39e | 11202 | |
f44316fa UW |
11203 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
11204 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 11205 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 11206 | return |
fbb06eb1 | 11207 | value_from_longest (type, |
4c4b4cd2 PH |
11208 | (value_less (arg1, arg3) |
11209 | || value_equal (arg1, arg3)) | |
11210 | && (value_less (arg2, arg1) | |
11211 | || value_equal (arg2, arg1))); | |
11212 | ||
11213 | case TERNOP_IN_RANGE: | |
11214 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11215 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11216 | arg3 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11217 | ||
11218 | if (noside == EVAL_SKIP) | |
11219 | goto nosideret; | |
11220 | ||
f44316fa UW |
11221 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); |
11222 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg3); | |
fbb06eb1 | 11223 | type = language_bool_type (exp->language_defn, exp->gdbarch); |
4c4b4cd2 | 11224 | return |
fbb06eb1 | 11225 | value_from_longest (type, |
4c4b4cd2 PH |
11226 | (value_less (arg1, arg3) |
11227 | || value_equal (arg1, arg3)) | |
11228 | && (value_less (arg2, arg1) | |
11229 | || value_equal (arg2, arg1))); | |
11230 | ||
11231 | case OP_ATR_FIRST: | |
11232 | case OP_ATR_LAST: | |
11233 | case OP_ATR_LENGTH: | |
11234 | { | |
76a01679 | 11235 | struct type *type_arg; |
5b4ee69b | 11236 | |
76a01679 JB |
11237 | if (exp->elts[*pos].opcode == OP_TYPE) |
11238 | { | |
11239 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
11240 | arg1 = NULL; | |
5bc23cb3 | 11241 | type_arg = check_typedef (exp->elts[pc + 2].type); |
76a01679 JB |
11242 | } |
11243 | else | |
11244 | { | |
11245 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11246 | type_arg = NULL; | |
11247 | } | |
11248 | ||
11249 | if (exp->elts[*pos].opcode != OP_LONG) | |
323e0a4a | 11250 | error (_("Invalid operand to '%s"), ada_attribute_name (op)); |
76a01679 JB |
11251 | tem = longest_to_int (exp->elts[*pos + 2].longconst); |
11252 | *pos += 4; | |
11253 | ||
11254 | if (noside == EVAL_SKIP) | |
11255 | goto nosideret; | |
11256 | ||
11257 | if (type_arg == NULL) | |
11258 | { | |
11259 | arg1 = ada_coerce_ref (arg1); | |
11260 | ||
ad82864c | 11261 | if (ada_is_constrained_packed_array_type (value_type (arg1))) |
76a01679 JB |
11262 | arg1 = ada_coerce_to_simple_array (arg1); |
11263 | ||
aa4fb036 | 11264 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11265 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11266 | else |
11267 | { | |
11268 | type = ada_index_type (value_type (arg1), tem, | |
11269 | ada_attribute_name (op)); | |
11270 | if (type == NULL) | |
11271 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11272 | } | |
76a01679 JB |
11273 | |
11274 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
1eea4ebd | 11275 | return allocate_value (type); |
76a01679 JB |
11276 | |
11277 | switch (op) | |
11278 | { | |
11279 | default: /* Should never happen. */ | |
323e0a4a | 11280 | error (_("unexpected attribute encountered")); |
76a01679 | 11281 | case OP_ATR_FIRST: |
1eea4ebd UW |
11282 | return value_from_longest |
11283 | (type, ada_array_bound (arg1, tem, 0)); | |
76a01679 | 11284 | case OP_ATR_LAST: |
1eea4ebd UW |
11285 | return value_from_longest |
11286 | (type, ada_array_bound (arg1, tem, 1)); | |
76a01679 | 11287 | case OP_ATR_LENGTH: |
1eea4ebd UW |
11288 | return value_from_longest |
11289 | (type, ada_array_length (arg1, tem)); | |
76a01679 JB |
11290 | } |
11291 | } | |
11292 | else if (discrete_type_p (type_arg)) | |
11293 | { | |
11294 | struct type *range_type; | |
0d5cff50 | 11295 | const char *name = ada_type_name (type_arg); |
5b4ee69b | 11296 | |
76a01679 JB |
11297 | range_type = NULL; |
11298 | if (name != NULL && TYPE_CODE (type_arg) != TYPE_CODE_ENUM) | |
28c85d6c | 11299 | range_type = to_fixed_range_type (type_arg, NULL); |
76a01679 JB |
11300 | if (range_type == NULL) |
11301 | range_type = type_arg; | |
11302 | switch (op) | |
11303 | { | |
11304 | default: | |
323e0a4a | 11305 | error (_("unexpected attribute encountered")); |
76a01679 | 11306 | case OP_ATR_FIRST: |
690cc4eb | 11307 | return value_from_longest |
43bbcdc2 | 11308 | (range_type, ada_discrete_type_low_bound (range_type)); |
76a01679 | 11309 | case OP_ATR_LAST: |
690cc4eb | 11310 | return value_from_longest |
43bbcdc2 | 11311 | (range_type, ada_discrete_type_high_bound (range_type)); |
76a01679 | 11312 | case OP_ATR_LENGTH: |
323e0a4a | 11313 | error (_("the 'length attribute applies only to array types")); |
76a01679 JB |
11314 | } |
11315 | } | |
11316 | else if (TYPE_CODE (type_arg) == TYPE_CODE_FLT) | |
323e0a4a | 11317 | error (_("unimplemented type attribute")); |
76a01679 JB |
11318 | else |
11319 | { | |
11320 | LONGEST low, high; | |
11321 | ||
ad82864c JB |
11322 | if (ada_is_constrained_packed_array_type (type_arg)) |
11323 | type_arg = decode_constrained_packed_array_type (type_arg); | |
76a01679 | 11324 | |
aa4fb036 | 11325 | if (op == OP_ATR_LENGTH) |
1eea4ebd | 11326 | type = builtin_type (exp->gdbarch)->builtin_int; |
aa4fb036 JB |
11327 | else |
11328 | { | |
11329 | type = ada_index_type (type_arg, tem, ada_attribute_name (op)); | |
11330 | if (type == NULL) | |
11331 | type = builtin_type (exp->gdbarch)->builtin_int; | |
11332 | } | |
1eea4ebd | 11333 | |
76a01679 JB |
11334 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
11335 | return allocate_value (type); | |
11336 | ||
11337 | switch (op) | |
11338 | { | |
11339 | default: | |
323e0a4a | 11340 | error (_("unexpected attribute encountered")); |
76a01679 | 11341 | case OP_ATR_FIRST: |
1eea4ebd | 11342 | low = ada_array_bound_from_type (type_arg, tem, 0); |
76a01679 JB |
11343 | return value_from_longest (type, low); |
11344 | case OP_ATR_LAST: | |
1eea4ebd | 11345 | high = ada_array_bound_from_type (type_arg, tem, 1); |
76a01679 JB |
11346 | return value_from_longest (type, high); |
11347 | case OP_ATR_LENGTH: | |
1eea4ebd UW |
11348 | low = ada_array_bound_from_type (type_arg, tem, 0); |
11349 | high = ada_array_bound_from_type (type_arg, tem, 1); | |
76a01679 JB |
11350 | return value_from_longest (type, high - low + 1); |
11351 | } | |
11352 | } | |
14f9c5c9 AS |
11353 | } |
11354 | ||
4c4b4cd2 PH |
11355 | case OP_ATR_TAG: |
11356 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11357 | if (noside == EVAL_SKIP) | |
76a01679 | 11358 | goto nosideret; |
4c4b4cd2 PH |
11359 | |
11360 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
76a01679 | 11361 | return value_zero (ada_tag_type (arg1), not_lval); |
4c4b4cd2 PH |
11362 | |
11363 | return ada_value_tag (arg1); | |
11364 | ||
11365 | case OP_ATR_MIN: | |
11366 | case OP_ATR_MAX: | |
11367 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11368 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11369 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11370 | if (noside == EVAL_SKIP) | |
76a01679 | 11371 | goto nosideret; |
d2e4a39e | 11372 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
df407dfe | 11373 | return value_zero (value_type (arg1), not_lval); |
14f9c5c9 | 11374 | else |
f44316fa UW |
11375 | { |
11376 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11377 | return value_binop (arg1, arg2, | |
11378 | op == OP_ATR_MIN ? BINOP_MIN : BINOP_MAX); | |
11379 | } | |
14f9c5c9 | 11380 | |
4c4b4cd2 PH |
11381 | case OP_ATR_MODULUS: |
11382 | { | |
31dedfee | 11383 | struct type *type_arg = check_typedef (exp->elts[pc + 2].type); |
4c4b4cd2 | 11384 | |
5b4ee69b | 11385 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); |
76a01679 JB |
11386 | if (noside == EVAL_SKIP) |
11387 | goto nosideret; | |
4c4b4cd2 | 11388 | |
76a01679 | 11389 | if (!ada_is_modular_type (type_arg)) |
323e0a4a | 11390 | error (_("'modulus must be applied to modular type")); |
4c4b4cd2 | 11391 | |
76a01679 JB |
11392 | return value_from_longest (TYPE_TARGET_TYPE (type_arg), |
11393 | ada_modulus (type_arg)); | |
4c4b4cd2 PH |
11394 | } |
11395 | ||
11396 | ||
11397 | case OP_ATR_POS: | |
11398 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 AS |
11399 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11400 | if (noside == EVAL_SKIP) | |
76a01679 | 11401 | goto nosideret; |
3cb382c9 UW |
11402 | type = builtin_type (exp->gdbarch)->builtin_int; |
11403 | if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
11404 | return value_zero (type, not_lval); | |
14f9c5c9 | 11405 | else |
3cb382c9 | 11406 | return value_pos_atr (type, arg1); |
14f9c5c9 | 11407 | |
4c4b4cd2 PH |
11408 | case OP_ATR_SIZE: |
11409 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
8c1c099f JB |
11410 | type = value_type (arg1); |
11411 | ||
11412 | /* If the argument is a reference, then dereference its type, since | |
11413 | the user is really asking for the size of the actual object, | |
11414 | not the size of the pointer. */ | |
11415 | if (TYPE_CODE (type) == TYPE_CODE_REF) | |
11416 | type = TYPE_TARGET_TYPE (type); | |
11417 | ||
4c4b4cd2 | 11418 | if (noside == EVAL_SKIP) |
76a01679 | 11419 | goto nosideret; |
4c4b4cd2 | 11420 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
22601c15 | 11421 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, not_lval); |
4c4b4cd2 | 11422 | else |
22601c15 | 11423 | return value_from_longest (builtin_type (exp->gdbarch)->builtin_int, |
8c1c099f | 11424 | TARGET_CHAR_BIT * TYPE_LENGTH (type)); |
4c4b4cd2 PH |
11425 | |
11426 | case OP_ATR_VAL: | |
11427 | evaluate_subexp (NULL_TYPE, exp, pos, EVAL_SKIP); | |
14f9c5c9 | 11428 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
4c4b4cd2 | 11429 | type = exp->elts[pc + 2].type; |
14f9c5c9 | 11430 | if (noside == EVAL_SKIP) |
76a01679 | 11431 | goto nosideret; |
4c4b4cd2 | 11432 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11433 | return value_zero (type, not_lval); |
4c4b4cd2 | 11434 | else |
76a01679 | 11435 | return value_val_atr (type, arg1); |
4c4b4cd2 PH |
11436 | |
11437 | case BINOP_EXP: | |
11438 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11439 | arg2 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11440 | if (noside == EVAL_SKIP) | |
11441 | goto nosideret; | |
11442 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) | |
df407dfe | 11443 | return value_zero (value_type (arg1), not_lval); |
4c4b4cd2 | 11444 | else |
f44316fa UW |
11445 | { |
11446 | /* For integer exponentiation operations, | |
11447 | only promote the first argument. */ | |
11448 | if (is_integral_type (value_type (arg2))) | |
11449 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); | |
11450 | else | |
11451 | binop_promote (exp->language_defn, exp->gdbarch, &arg1, &arg2); | |
11452 | ||
11453 | return value_binop (arg1, arg2, op); | |
11454 | } | |
4c4b4cd2 PH |
11455 | |
11456 | case UNOP_PLUS: | |
11457 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11458 | if (noside == EVAL_SKIP) | |
11459 | goto nosideret; | |
11460 | else | |
11461 | return arg1; | |
11462 | ||
11463 | case UNOP_ABS: | |
11464 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); | |
11465 | if (noside == EVAL_SKIP) | |
11466 | goto nosideret; | |
f44316fa | 11467 | unop_promote (exp->language_defn, exp->gdbarch, &arg1); |
df407dfe | 11468 | if (value_less (arg1, value_zero (value_type (arg1), not_lval))) |
4c4b4cd2 | 11469 | return value_neg (arg1); |
14f9c5c9 | 11470 | else |
4c4b4cd2 | 11471 | return arg1; |
14f9c5c9 AS |
11472 | |
11473 | case UNOP_IND: | |
5ec18f2b | 11474 | preeval_pos = *pos; |
6b0d7253 | 11475 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
14f9c5c9 | 11476 | if (noside == EVAL_SKIP) |
4c4b4cd2 | 11477 | goto nosideret; |
df407dfe | 11478 | type = ada_check_typedef (value_type (arg1)); |
14f9c5c9 | 11479 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
4c4b4cd2 PH |
11480 | { |
11481 | if (ada_is_array_descriptor_type (type)) | |
11482 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11483 | { | |
11484 | struct type *arrType = ada_type_of_array (arg1, 0); | |
5b4ee69b | 11485 | |
4c4b4cd2 | 11486 | if (arrType == NULL) |
323e0a4a | 11487 | error (_("Attempt to dereference null array pointer.")); |
00a4c844 | 11488 | return value_at_lazy (arrType, 0); |
4c4b4cd2 PH |
11489 | } |
11490 | else if (TYPE_CODE (type) == TYPE_CODE_PTR | |
11491 | || TYPE_CODE (type) == TYPE_CODE_REF | |
11492 | /* In C you can dereference an array to get the 1st elt. */ | |
11493 | || TYPE_CODE (type) == TYPE_CODE_ARRAY) | |
714e53ab | 11494 | { |
5ec18f2b JG |
11495 | /* As mentioned in the OP_VAR_VALUE case, tagged types can |
11496 | only be determined by inspecting the object's tag. | |
11497 | This means that we need to evaluate completely the | |
11498 | expression in order to get its type. */ | |
11499 | ||
023db19c JB |
11500 | if ((TYPE_CODE (type) == TYPE_CODE_REF |
11501 | || TYPE_CODE (type) == TYPE_CODE_PTR) | |
5ec18f2b JG |
11502 | && ada_is_tagged_type (TYPE_TARGET_TYPE (type), 0)) |
11503 | { | |
11504 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11505 | EVAL_NORMAL); | |
11506 | type = value_type (ada_value_ind (arg1)); | |
11507 | } | |
11508 | else | |
11509 | { | |
11510 | type = to_static_fixed_type | |
11511 | (ada_aligned_type | |
11512 | (ada_check_typedef (TYPE_TARGET_TYPE (type)))); | |
11513 | } | |
c1b5a1a6 | 11514 | ada_ensure_varsize_limit (type); |
714e53ab PH |
11515 | return value_zero (type, lval_memory); |
11516 | } | |
4c4b4cd2 | 11517 | else if (TYPE_CODE (type) == TYPE_CODE_INT) |
6b0d7253 JB |
11518 | { |
11519 | /* GDB allows dereferencing an int. */ | |
11520 | if (expect_type == NULL) | |
11521 | return value_zero (builtin_type (exp->gdbarch)->builtin_int, | |
11522 | lval_memory); | |
11523 | else | |
11524 | { | |
11525 | expect_type = | |
11526 | to_static_fixed_type (ada_aligned_type (expect_type)); | |
11527 | return value_zero (expect_type, lval_memory); | |
11528 | } | |
11529 | } | |
4c4b4cd2 | 11530 | else |
323e0a4a | 11531 | error (_("Attempt to take contents of a non-pointer value.")); |
4c4b4cd2 | 11532 | } |
0963b4bd | 11533 | arg1 = ada_coerce_ref (arg1); /* FIXME: What is this for?? */ |
df407dfe | 11534 | type = ada_check_typedef (value_type (arg1)); |
d2e4a39e | 11535 | |
96967637 JB |
11536 | if (TYPE_CODE (type) == TYPE_CODE_INT) |
11537 | /* GDB allows dereferencing an int. If we were given | |
11538 | the expect_type, then use that as the target type. | |
11539 | Otherwise, assume that the target type is an int. */ | |
11540 | { | |
11541 | if (expect_type != NULL) | |
11542 | return ada_value_ind (value_cast (lookup_pointer_type (expect_type), | |
11543 | arg1)); | |
11544 | else | |
11545 | return value_at_lazy (builtin_type (exp->gdbarch)->builtin_int, | |
11546 | (CORE_ADDR) value_as_address (arg1)); | |
11547 | } | |
6b0d7253 | 11548 | |
4c4b4cd2 PH |
11549 | if (ada_is_array_descriptor_type (type)) |
11550 | /* GDB allows dereferencing GNAT array descriptors. */ | |
11551 | return ada_coerce_to_simple_array (arg1); | |
14f9c5c9 | 11552 | else |
4c4b4cd2 | 11553 | return ada_value_ind (arg1); |
14f9c5c9 AS |
11554 | |
11555 | case STRUCTOP_STRUCT: | |
11556 | tem = longest_to_int (exp->elts[pc + 1].longconst); | |
11557 | (*pos) += 3 + BYTES_TO_EXP_ELEM (tem + 1); | |
5ec18f2b | 11558 | preeval_pos = *pos; |
14f9c5c9 AS |
11559 | arg1 = evaluate_subexp (NULL_TYPE, exp, pos, noside); |
11560 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11561 | goto nosideret; |
14f9c5c9 | 11562 | if (noside == EVAL_AVOID_SIDE_EFFECTS) |
76a01679 | 11563 | { |
df407dfe | 11564 | struct type *type1 = value_type (arg1); |
5b4ee69b | 11565 | |
76a01679 JB |
11566 | if (ada_is_tagged_type (type1, 1)) |
11567 | { | |
11568 | type = ada_lookup_struct_elt_type (type1, | |
11569 | &exp->elts[pc + 2].string, | |
988f6b3d | 11570 | 1, 1); |
5ec18f2b JG |
11571 | |
11572 | /* If the field is not found, check if it exists in the | |
11573 | extension of this object's type. This means that we | |
11574 | need to evaluate completely the expression. */ | |
11575 | ||
76a01679 | 11576 | if (type == NULL) |
5ec18f2b JG |
11577 | { |
11578 | arg1 = evaluate_subexp (NULL_TYPE, exp, &preeval_pos, | |
11579 | EVAL_NORMAL); | |
11580 | arg1 = ada_value_struct_elt (arg1, | |
11581 | &exp->elts[pc + 2].string, | |
11582 | 0); | |
11583 | arg1 = unwrap_value (arg1); | |
11584 | type = value_type (ada_to_fixed_value (arg1)); | |
11585 | } | |
76a01679 JB |
11586 | } |
11587 | else | |
11588 | type = | |
11589 | ada_lookup_struct_elt_type (type1, &exp->elts[pc + 2].string, 1, | |
988f6b3d | 11590 | 0); |
76a01679 JB |
11591 | |
11592 | return value_zero (ada_aligned_type (type), lval_memory); | |
11593 | } | |
14f9c5c9 | 11594 | else |
a579cd9a MW |
11595 | { |
11596 | arg1 = ada_value_struct_elt (arg1, &exp->elts[pc + 2].string, 0); | |
11597 | arg1 = unwrap_value (arg1); | |
11598 | return ada_to_fixed_value (arg1); | |
11599 | } | |
284614f0 | 11600 | |
14f9c5c9 | 11601 | case OP_TYPE: |
4c4b4cd2 PH |
11602 | /* The value is not supposed to be used. This is here to make it |
11603 | easier to accommodate expressions that contain types. */ | |
14f9c5c9 AS |
11604 | (*pos) += 2; |
11605 | if (noside == EVAL_SKIP) | |
4c4b4cd2 | 11606 | goto nosideret; |
14f9c5c9 | 11607 | else if (noside == EVAL_AVOID_SIDE_EFFECTS) |
a6cfbe68 | 11608 | return allocate_value (exp->elts[pc + 1].type); |
14f9c5c9 | 11609 | else |
323e0a4a | 11610 | error (_("Attempt to use a type name as an expression")); |
52ce6436 PH |
11611 | |
11612 | case OP_AGGREGATE: | |
11613 | case OP_CHOICES: | |
11614 | case OP_OTHERS: | |
11615 | case OP_DISCRETE_RANGE: | |
11616 | case OP_POSITIONAL: | |
11617 | case OP_NAME: | |
11618 | if (noside == EVAL_NORMAL) | |
11619 | switch (op) | |
11620 | { | |
11621 | case OP_NAME: | |
11622 | error (_("Undefined name, ambiguous name, or renaming used in " | |
e1d5a0d2 | 11623 | "component association: %s."), &exp->elts[pc+2].string); |
52ce6436 PH |
11624 | case OP_AGGREGATE: |
11625 | error (_("Aggregates only allowed on the right of an assignment")); | |
11626 | default: | |
0963b4bd MS |
11627 | internal_error (__FILE__, __LINE__, |
11628 | _("aggregate apparently mangled")); | |
52ce6436 PH |
11629 | } |
11630 | ||
11631 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
11632 | *pos += oplen - 1; | |
11633 | for (tem = 0; tem < nargs; tem += 1) | |
11634 | ada_evaluate_subexp (NULL, exp, pos, noside); | |
11635 | goto nosideret; | |
14f9c5c9 AS |
11636 | } |
11637 | ||
11638 | nosideret: | |
ced9779b | 11639 | return eval_skip_value (exp); |
14f9c5c9 | 11640 | } |
14f9c5c9 | 11641 | \f |
d2e4a39e | 11642 | |
4c4b4cd2 | 11643 | /* Fixed point */ |
14f9c5c9 AS |
11644 | |
11645 | /* If TYPE encodes an Ada fixed-point type, return the suffix of the | |
11646 | type name that encodes the 'small and 'delta information. | |
4c4b4cd2 | 11647 | Otherwise, return NULL. */ |
14f9c5c9 | 11648 | |
d2e4a39e | 11649 | static const char * |
ebf56fd3 | 11650 | fixed_type_info (struct type *type) |
14f9c5c9 | 11651 | { |
d2e4a39e | 11652 | const char *name = ada_type_name (type); |
14f9c5c9 AS |
11653 | enum type_code code = (type == NULL) ? TYPE_CODE_UNDEF : TYPE_CODE (type); |
11654 | ||
d2e4a39e AS |
11655 | if ((code == TYPE_CODE_INT || code == TYPE_CODE_RANGE) && name != NULL) |
11656 | { | |
14f9c5c9 | 11657 | const char *tail = strstr (name, "___XF_"); |
5b4ee69b | 11658 | |
14f9c5c9 | 11659 | if (tail == NULL) |
4c4b4cd2 | 11660 | return NULL; |
d2e4a39e | 11661 | else |
4c4b4cd2 | 11662 | return tail + 5; |
14f9c5c9 AS |
11663 | } |
11664 | else if (code == TYPE_CODE_RANGE && TYPE_TARGET_TYPE (type) != type) | |
11665 | return fixed_type_info (TYPE_TARGET_TYPE (type)); | |
11666 | else | |
11667 | return NULL; | |
11668 | } | |
11669 | ||
4c4b4cd2 | 11670 | /* Returns non-zero iff TYPE represents an Ada fixed-point type. */ |
14f9c5c9 AS |
11671 | |
11672 | int | |
ebf56fd3 | 11673 | ada_is_fixed_point_type (struct type *type) |
14f9c5c9 AS |
11674 | { |
11675 | return fixed_type_info (type) != NULL; | |
11676 | } | |
11677 | ||
4c4b4cd2 PH |
11678 | /* Return non-zero iff TYPE represents a System.Address type. */ |
11679 | ||
11680 | int | |
11681 | ada_is_system_address_type (struct type *type) | |
11682 | { | |
11683 | return (TYPE_NAME (type) | |
11684 | && strcmp (TYPE_NAME (type), "system__address") == 0); | |
11685 | } | |
11686 | ||
14f9c5c9 | 11687 | /* Assuming that TYPE is the representation of an Ada fixed-point |
50eff16b UW |
11688 | type, return the target floating-point type to be used to represent |
11689 | of this type during internal computation. */ | |
11690 | ||
11691 | static struct type * | |
11692 | ada_scaling_type (struct type *type) | |
11693 | { | |
11694 | return builtin_type (get_type_arch (type))->builtin_long_double; | |
11695 | } | |
11696 | ||
11697 | /* Assuming that TYPE is the representation of an Ada fixed-point | |
11698 | type, return its delta, or NULL if the type is malformed and the | |
4c4b4cd2 | 11699 | delta cannot be determined. */ |
14f9c5c9 | 11700 | |
50eff16b | 11701 | struct value * |
ebf56fd3 | 11702 | ada_delta (struct type *type) |
14f9c5c9 AS |
11703 | { |
11704 | const char *encoding = fixed_type_info (type); | |
50eff16b UW |
11705 | struct type *scale_type = ada_scaling_type (type); |
11706 | ||
11707 | long long num, den; | |
11708 | ||
11709 | if (sscanf (encoding, "_%lld_%lld", &num, &den) < 2) | |
11710 | return nullptr; | |
d2e4a39e | 11711 | else |
50eff16b UW |
11712 | return value_binop (value_from_longest (scale_type, num), |
11713 | value_from_longest (scale_type, den), BINOP_DIV); | |
14f9c5c9 AS |
11714 | } |
11715 | ||
11716 | /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling | |
4c4b4cd2 | 11717 | factor ('SMALL value) associated with the type. */ |
14f9c5c9 | 11718 | |
50eff16b UW |
11719 | struct value * |
11720 | ada_scaling_factor (struct type *type) | |
14f9c5c9 AS |
11721 | { |
11722 | const char *encoding = fixed_type_info (type); | |
50eff16b UW |
11723 | struct type *scale_type = ada_scaling_type (type); |
11724 | ||
11725 | long long num0, den0, num1, den1; | |
14f9c5c9 | 11726 | int n; |
d2e4a39e | 11727 | |
50eff16b | 11728 | n = sscanf (encoding, "_%lld_%lld_%lld_%lld", |
facc390f | 11729 | &num0, &den0, &num1, &den1); |
14f9c5c9 AS |
11730 | |
11731 | if (n < 2) | |
50eff16b | 11732 | return value_from_longest (scale_type, 1); |
14f9c5c9 | 11733 | else if (n == 4) |
50eff16b UW |
11734 | return value_binop (value_from_longest (scale_type, num1), |
11735 | value_from_longest (scale_type, den1), BINOP_DIV); | |
d2e4a39e | 11736 | else |
50eff16b UW |
11737 | return value_binop (value_from_longest (scale_type, num0), |
11738 | value_from_longest (scale_type, den0), BINOP_DIV); | |
14f9c5c9 AS |
11739 | } |
11740 | ||
14f9c5c9 | 11741 | \f |
d2e4a39e | 11742 | |
4c4b4cd2 | 11743 | /* Range types */ |
14f9c5c9 AS |
11744 | |
11745 | /* Scan STR beginning at position K for a discriminant name, and | |
11746 | return the value of that discriminant field of DVAL in *PX. If | |
11747 | PNEW_K is not null, put the position of the character beyond the | |
11748 | name scanned in *PNEW_K. Return 1 if successful; return 0 and do | |
4c4b4cd2 | 11749 | not alter *PX and *PNEW_K if unsuccessful. */ |
14f9c5c9 AS |
11750 | |
11751 | static int | |
108d56a4 | 11752 | scan_discrim_bound (const char *str, int k, struct value *dval, LONGEST * px, |
76a01679 | 11753 | int *pnew_k) |
14f9c5c9 AS |
11754 | { |
11755 | static char *bound_buffer = NULL; | |
11756 | static size_t bound_buffer_len = 0; | |
5da1a4d3 | 11757 | const char *pstart, *pend, *bound; |
d2e4a39e | 11758 | struct value *bound_val; |
14f9c5c9 AS |
11759 | |
11760 | if (dval == NULL || str == NULL || str[k] == '\0') | |
11761 | return 0; | |
11762 | ||
5da1a4d3 SM |
11763 | pstart = str + k; |
11764 | pend = strstr (pstart, "__"); | |
14f9c5c9 AS |
11765 | if (pend == NULL) |
11766 | { | |
5da1a4d3 | 11767 | bound = pstart; |
14f9c5c9 AS |
11768 | k += strlen (bound); |
11769 | } | |
d2e4a39e | 11770 | else |
14f9c5c9 | 11771 | { |
5da1a4d3 SM |
11772 | int len = pend - pstart; |
11773 | ||
11774 | /* Strip __ and beyond. */ | |
11775 | GROW_VECT (bound_buffer, bound_buffer_len, len + 1); | |
11776 | strncpy (bound_buffer, pstart, len); | |
11777 | bound_buffer[len] = '\0'; | |
11778 | ||
14f9c5c9 | 11779 | bound = bound_buffer; |
d2e4a39e | 11780 | k = pend - str; |
14f9c5c9 | 11781 | } |
d2e4a39e | 11782 | |
df407dfe | 11783 | bound_val = ada_search_struct_field (bound, dval, 0, value_type (dval)); |
14f9c5c9 AS |
11784 | if (bound_val == NULL) |
11785 | return 0; | |
11786 | ||
11787 | *px = value_as_long (bound_val); | |
11788 | if (pnew_k != NULL) | |
11789 | *pnew_k = k; | |
11790 | return 1; | |
11791 | } | |
11792 | ||
11793 | /* Value of variable named NAME in the current environment. If | |
11794 | no such variable found, then if ERR_MSG is null, returns 0, and | |
4c4b4cd2 PH |
11795 | otherwise causes an error with message ERR_MSG. */ |
11796 | ||
d2e4a39e | 11797 | static struct value * |
edb0c9cb | 11798 | get_var_value (const char *name, const char *err_msg) |
14f9c5c9 | 11799 | { |
b5ec771e | 11800 | lookup_name_info lookup_name (name, symbol_name_match_type::FULL); |
14f9c5c9 | 11801 | |
b5ec771e PA |
11802 | struct block_symbol *syms; |
11803 | int nsyms = ada_lookup_symbol_list_worker (lookup_name, | |
11804 | get_selected_block (0), | |
11805 | VAR_DOMAIN, &syms, 1); | |
ec6a20c2 | 11806 | struct cleanup *old_chain = make_cleanup (xfree, syms); |
14f9c5c9 AS |
11807 | |
11808 | if (nsyms != 1) | |
11809 | { | |
ec6a20c2 | 11810 | do_cleanups (old_chain); |
14f9c5c9 | 11811 | if (err_msg == NULL) |
4c4b4cd2 | 11812 | return 0; |
14f9c5c9 | 11813 | else |
8a3fe4f8 | 11814 | error (("%s"), err_msg); |
14f9c5c9 AS |
11815 | } |
11816 | ||
ec6a20c2 JB |
11817 | struct value *result = value_of_variable (syms[0].symbol, syms[0].block); |
11818 | do_cleanups (old_chain); | |
11819 | return result; | |
14f9c5c9 | 11820 | } |
d2e4a39e | 11821 | |
edb0c9cb PA |
11822 | /* Value of integer variable named NAME in the current environment. |
11823 | If no such variable is found, returns false. Otherwise, sets VALUE | |
11824 | to the variable's value and returns true. */ | |
4c4b4cd2 | 11825 | |
edb0c9cb PA |
11826 | bool |
11827 | get_int_var_value (const char *name, LONGEST &value) | |
14f9c5c9 | 11828 | { |
4c4b4cd2 | 11829 | struct value *var_val = get_var_value (name, 0); |
d2e4a39e | 11830 | |
14f9c5c9 | 11831 | if (var_val == 0) |
edb0c9cb PA |
11832 | return false; |
11833 | ||
11834 | value = value_as_long (var_val); | |
11835 | return true; | |
14f9c5c9 | 11836 | } |
d2e4a39e | 11837 | |
14f9c5c9 AS |
11838 | |
11839 | /* Return a range type whose base type is that of the range type named | |
11840 | NAME in the current environment, and whose bounds are calculated | |
4c4b4cd2 | 11841 | from NAME according to the GNAT range encoding conventions. |
1ce677a4 UW |
11842 | Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the |
11843 | corresponding range type from debug information; fall back to using it | |
11844 | if symbol lookup fails. If a new type must be created, allocate it | |
11845 | like ORIG_TYPE was. The bounds information, in general, is encoded | |
11846 | in NAME, the base type given in the named range type. */ | |
14f9c5c9 | 11847 | |
d2e4a39e | 11848 | static struct type * |
28c85d6c | 11849 | to_fixed_range_type (struct type *raw_type, struct value *dval) |
14f9c5c9 | 11850 | { |
0d5cff50 | 11851 | const char *name; |
14f9c5c9 | 11852 | struct type *base_type; |
108d56a4 | 11853 | const char *subtype_info; |
14f9c5c9 | 11854 | |
28c85d6c JB |
11855 | gdb_assert (raw_type != NULL); |
11856 | gdb_assert (TYPE_NAME (raw_type) != NULL); | |
dddfab26 | 11857 | |
1ce677a4 | 11858 | if (TYPE_CODE (raw_type) == TYPE_CODE_RANGE) |
14f9c5c9 AS |
11859 | base_type = TYPE_TARGET_TYPE (raw_type); |
11860 | else | |
11861 | base_type = raw_type; | |
11862 | ||
28c85d6c | 11863 | name = TYPE_NAME (raw_type); |
14f9c5c9 AS |
11864 | subtype_info = strstr (name, "___XD"); |
11865 | if (subtype_info == NULL) | |
690cc4eb | 11866 | { |
43bbcdc2 PH |
11867 | LONGEST L = ada_discrete_type_low_bound (raw_type); |
11868 | LONGEST U = ada_discrete_type_high_bound (raw_type); | |
5b4ee69b | 11869 | |
690cc4eb PH |
11870 | if (L < INT_MIN || U > INT_MAX) |
11871 | return raw_type; | |
11872 | else | |
0c9c3474 SA |
11873 | return create_static_range_type (alloc_type_copy (raw_type), raw_type, |
11874 | L, U); | |
690cc4eb | 11875 | } |
14f9c5c9 AS |
11876 | else |
11877 | { | |
11878 | static char *name_buf = NULL; | |
11879 | static size_t name_len = 0; | |
11880 | int prefix_len = subtype_info - name; | |
11881 | LONGEST L, U; | |
11882 | struct type *type; | |
108d56a4 | 11883 | const char *bounds_str; |
14f9c5c9 AS |
11884 | int n; |
11885 | ||
11886 | GROW_VECT (name_buf, name_len, prefix_len + 5); | |
11887 | strncpy (name_buf, name, prefix_len); | |
11888 | name_buf[prefix_len] = '\0'; | |
11889 | ||
11890 | subtype_info += 5; | |
11891 | bounds_str = strchr (subtype_info, '_'); | |
11892 | n = 1; | |
11893 | ||
d2e4a39e | 11894 | if (*subtype_info == 'L') |
4c4b4cd2 PH |
11895 | { |
11896 | if (!ada_scan_number (bounds_str, n, &L, &n) | |
11897 | && !scan_discrim_bound (bounds_str, n, dval, &L, &n)) | |
11898 | return raw_type; | |
11899 | if (bounds_str[n] == '_') | |
11900 | n += 2; | |
0963b4bd | 11901 | else if (bounds_str[n] == '.') /* FIXME? SGI Workshop kludge. */ |
4c4b4cd2 PH |
11902 | n += 1; |
11903 | subtype_info += 1; | |
11904 | } | |
d2e4a39e | 11905 | else |
4c4b4cd2 | 11906 | { |
4c4b4cd2 | 11907 | strcpy (name_buf + prefix_len, "___L"); |
edb0c9cb | 11908 | if (!get_int_var_value (name_buf, L)) |
4c4b4cd2 | 11909 | { |
323e0a4a | 11910 | lim_warning (_("Unknown lower bound, using 1.")); |
4c4b4cd2 PH |
11911 | L = 1; |
11912 | } | |
11913 | } | |
14f9c5c9 | 11914 | |
d2e4a39e | 11915 | if (*subtype_info == 'U') |
4c4b4cd2 PH |
11916 | { |
11917 | if (!ada_scan_number (bounds_str, n, &U, &n) | |
11918 | && !scan_discrim_bound (bounds_str, n, dval, &U, &n)) | |
11919 | return raw_type; | |
11920 | } | |
d2e4a39e | 11921 | else |
4c4b4cd2 | 11922 | { |
4c4b4cd2 | 11923 | strcpy (name_buf + prefix_len, "___U"); |
edb0c9cb | 11924 | if (!get_int_var_value (name_buf, U)) |
4c4b4cd2 | 11925 | { |
323e0a4a | 11926 | lim_warning (_("Unknown upper bound, using %ld."), (long) L); |
4c4b4cd2 PH |
11927 | U = L; |
11928 | } | |
11929 | } | |
14f9c5c9 | 11930 | |
0c9c3474 SA |
11931 | type = create_static_range_type (alloc_type_copy (raw_type), |
11932 | base_type, L, U); | |
f5a91472 JB |
11933 | /* create_static_range_type alters the resulting type's length |
11934 | to match the size of the base_type, which is not what we want. | |
11935 | Set it back to the original range type's length. */ | |
11936 | TYPE_LENGTH (type) = TYPE_LENGTH (raw_type); | |
d2e4a39e | 11937 | TYPE_NAME (type) = name; |
14f9c5c9 AS |
11938 | return type; |
11939 | } | |
11940 | } | |
11941 | ||
4c4b4cd2 PH |
11942 | /* True iff NAME is the name of a range type. */ |
11943 | ||
14f9c5c9 | 11944 | int |
d2e4a39e | 11945 | ada_is_range_type_name (const char *name) |
14f9c5c9 AS |
11946 | { |
11947 | return (name != NULL && strstr (name, "___XD")); | |
d2e4a39e | 11948 | } |
14f9c5c9 | 11949 | \f |
d2e4a39e | 11950 | |
4c4b4cd2 PH |
11951 | /* Modular types */ |
11952 | ||
11953 | /* True iff TYPE is an Ada modular type. */ | |
14f9c5c9 | 11954 | |
14f9c5c9 | 11955 | int |
d2e4a39e | 11956 | ada_is_modular_type (struct type *type) |
14f9c5c9 | 11957 | { |
18af8284 | 11958 | struct type *subranged_type = get_base_type (type); |
14f9c5c9 AS |
11959 | |
11960 | return (subranged_type != NULL && TYPE_CODE (type) == TYPE_CODE_RANGE | |
690cc4eb | 11961 | && TYPE_CODE (subranged_type) == TYPE_CODE_INT |
4c4b4cd2 | 11962 | && TYPE_UNSIGNED (subranged_type)); |
14f9c5c9 AS |
11963 | } |
11964 | ||
4c4b4cd2 PH |
11965 | /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */ |
11966 | ||
61ee279c | 11967 | ULONGEST |
0056e4d5 | 11968 | ada_modulus (struct type *type) |
14f9c5c9 | 11969 | { |
43bbcdc2 | 11970 | return (ULONGEST) TYPE_HIGH_BOUND (type) + 1; |
14f9c5c9 | 11971 | } |
d2e4a39e | 11972 | \f |
f7f9143b JB |
11973 | |
11974 | /* Ada exception catchpoint support: | |
11975 | --------------------------------- | |
11976 | ||
11977 | We support 3 kinds of exception catchpoints: | |
11978 | . catchpoints on Ada exceptions | |
11979 | . catchpoints on unhandled Ada exceptions | |
11980 | . catchpoints on failed assertions | |
11981 | ||
11982 | Exceptions raised during failed assertions, or unhandled exceptions | |
11983 | could perfectly be caught with the general catchpoint on Ada exceptions. | |
11984 | However, we can easily differentiate these two special cases, and having | |
11985 | the option to distinguish these two cases from the rest can be useful | |
11986 | to zero-in on certain situations. | |
11987 | ||
11988 | Exception catchpoints are a specialized form of breakpoint, | |
11989 | since they rely on inserting breakpoints inside known routines | |
11990 | of the GNAT runtime. The implementation therefore uses a standard | |
11991 | breakpoint structure of the BP_BREAKPOINT type, but with its own set | |
11992 | of breakpoint_ops. | |
11993 | ||
0259addd JB |
11994 | Support in the runtime for exception catchpoints have been changed |
11995 | a few times already, and these changes affect the implementation | |
11996 | of these catchpoints. In order to be able to support several | |
11997 | variants of the runtime, we use a sniffer that will determine | |
28010a5d | 11998 | the runtime variant used by the program being debugged. */ |
f7f9143b | 11999 | |
82eacd52 JB |
12000 | /* Ada's standard exceptions. |
12001 | ||
12002 | The Ada 83 standard also defined Numeric_Error. But there so many | |
12003 | situations where it was unclear from the Ada 83 Reference Manual | |
12004 | (RM) whether Constraint_Error or Numeric_Error should be raised, | |
12005 | that the ARG (Ada Rapporteur Group) eventually issued a Binding | |
12006 | Interpretation saying that anytime the RM says that Numeric_Error | |
12007 | should be raised, the implementation may raise Constraint_Error. | |
12008 | Ada 95 went one step further and pretty much removed Numeric_Error | |
12009 | from the list of standard exceptions (it made it a renaming of | |
12010 | Constraint_Error, to help preserve compatibility when compiling | |
12011 | an Ada83 compiler). As such, we do not include Numeric_Error from | |
12012 | this list of standard exceptions. */ | |
3d0b0fa3 | 12013 | |
a121b7c1 | 12014 | static const char *standard_exc[] = { |
3d0b0fa3 JB |
12015 | "constraint_error", |
12016 | "program_error", | |
12017 | "storage_error", | |
12018 | "tasking_error" | |
12019 | }; | |
12020 | ||
0259addd JB |
12021 | typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype) (void); |
12022 | ||
12023 | /* A structure that describes how to support exception catchpoints | |
12024 | for a given executable. */ | |
12025 | ||
12026 | struct exception_support_info | |
12027 | { | |
12028 | /* The name of the symbol to break on in order to insert | |
12029 | a catchpoint on exceptions. */ | |
12030 | const char *catch_exception_sym; | |
12031 | ||
12032 | /* The name of the symbol to break on in order to insert | |
12033 | a catchpoint on unhandled exceptions. */ | |
12034 | const char *catch_exception_unhandled_sym; | |
12035 | ||
12036 | /* The name of the symbol to break on in order to insert | |
12037 | a catchpoint on failed assertions. */ | |
12038 | const char *catch_assert_sym; | |
12039 | ||
9f757bf7 XR |
12040 | /* The name of the symbol to break on in order to insert |
12041 | a catchpoint on exception handling. */ | |
12042 | const char *catch_handlers_sym; | |
12043 | ||
0259addd JB |
12044 | /* Assuming that the inferior just triggered an unhandled exception |
12045 | catchpoint, this function is responsible for returning the address | |
12046 | in inferior memory where the name of that exception is stored. | |
12047 | Return zero if the address could not be computed. */ | |
12048 | ada_unhandled_exception_name_addr_ftype *unhandled_exception_name_addr; | |
12049 | }; | |
12050 | ||
12051 | static CORE_ADDR ada_unhandled_exception_name_addr (void); | |
12052 | static CORE_ADDR ada_unhandled_exception_name_addr_from_raise (void); | |
12053 | ||
12054 | /* The following exception support info structure describes how to | |
12055 | implement exception catchpoints with the latest version of the | |
12056 | Ada runtime (as of 2007-03-06). */ | |
12057 | ||
12058 | static const struct exception_support_info default_exception_support_info = | |
12059 | { | |
12060 | "__gnat_debug_raise_exception", /* catch_exception_sym */ | |
12061 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
12062 | "__gnat_debug_raise_assert_failure", /* catch_assert_sym */ | |
9f757bf7 | 12063 | "__gnat_begin_handler", /* catch_handlers_sym */ |
0259addd JB |
12064 | ada_unhandled_exception_name_addr |
12065 | }; | |
12066 | ||
12067 | /* The following exception support info structure describes how to | |
12068 | implement exception catchpoints with a slightly older version | |
12069 | of the Ada runtime. */ | |
12070 | ||
12071 | static const struct exception_support_info exception_support_info_fallback = | |
12072 | { | |
12073 | "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */ | |
12074 | "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */ | |
12075 | "system__assertions__raise_assert_failure", /* catch_assert_sym */ | |
9f757bf7 | 12076 | "__gnat_begin_handler", /* catch_handlers_sym */ |
0259addd JB |
12077 | ada_unhandled_exception_name_addr_from_raise |
12078 | }; | |
12079 | ||
f17011e0 JB |
12080 | /* Return nonzero if we can detect the exception support routines |
12081 | described in EINFO. | |
12082 | ||
12083 | This function errors out if an abnormal situation is detected | |
12084 | (for instance, if we find the exception support routines, but | |
12085 | that support is found to be incomplete). */ | |
12086 | ||
12087 | static int | |
12088 | ada_has_this_exception_support (const struct exception_support_info *einfo) | |
12089 | { | |
12090 | struct symbol *sym; | |
12091 | ||
12092 | /* The symbol we're looking up is provided by a unit in the GNAT runtime | |
12093 | that should be compiled with debugging information. As a result, we | |
12094 | expect to find that symbol in the symtabs. */ | |
12095 | ||
12096 | sym = standard_lookup (einfo->catch_exception_sym, NULL, VAR_DOMAIN); | |
12097 | if (sym == NULL) | |
a6af7abe JB |
12098 | { |
12099 | /* Perhaps we did not find our symbol because the Ada runtime was | |
12100 | compiled without debugging info, or simply stripped of it. | |
12101 | It happens on some GNU/Linux distributions for instance, where | |
12102 | users have to install a separate debug package in order to get | |
12103 | the runtime's debugging info. In that situation, let the user | |
12104 | know why we cannot insert an Ada exception catchpoint. | |
12105 | ||
12106 | Note: Just for the purpose of inserting our Ada exception | |
12107 | catchpoint, we could rely purely on the associated minimal symbol. | |
12108 | But we would be operating in degraded mode anyway, since we are | |
12109 | still lacking the debugging info needed later on to extract | |
12110 | the name of the exception being raised (this name is printed in | |
12111 | the catchpoint message, and is also used when trying to catch | |
12112 | a specific exception). We do not handle this case for now. */ | |
3b7344d5 | 12113 | struct bound_minimal_symbol msym |
1c8e84b0 JB |
12114 | = lookup_minimal_symbol (einfo->catch_exception_sym, NULL, NULL); |
12115 | ||
3b7344d5 | 12116 | if (msym.minsym && MSYMBOL_TYPE (msym.minsym) != mst_solib_trampoline) |
a6af7abe JB |
12117 | error (_("Your Ada runtime appears to be missing some debugging " |
12118 | "information.\nCannot insert Ada exception catchpoint " | |
12119 | "in this configuration.")); | |
12120 | ||
12121 | return 0; | |
12122 | } | |
f17011e0 JB |
12123 | |
12124 | /* Make sure that the symbol we found corresponds to a function. */ | |
12125 | ||
12126 | if (SYMBOL_CLASS (sym) != LOC_BLOCK) | |
12127 | error (_("Symbol \"%s\" is not a function (class = %d)"), | |
12128 | SYMBOL_LINKAGE_NAME (sym), SYMBOL_CLASS (sym)); | |
12129 | ||
12130 | return 1; | |
12131 | } | |
12132 | ||
0259addd JB |
12133 | /* Inspect the Ada runtime and determine which exception info structure |
12134 | should be used to provide support for exception catchpoints. | |
12135 | ||
3eecfa55 JB |
12136 | This function will always set the per-inferior exception_info, |
12137 | or raise an error. */ | |
0259addd JB |
12138 | |
12139 | static void | |
12140 | ada_exception_support_info_sniffer (void) | |
12141 | { | |
3eecfa55 | 12142 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
0259addd JB |
12143 | |
12144 | /* If the exception info is already known, then no need to recompute it. */ | |
3eecfa55 | 12145 | if (data->exception_info != NULL) |
0259addd JB |
12146 | return; |
12147 | ||
12148 | /* Check the latest (default) exception support info. */ | |
f17011e0 | 12149 | if (ada_has_this_exception_support (&default_exception_support_info)) |
0259addd | 12150 | { |
3eecfa55 | 12151 | data->exception_info = &default_exception_support_info; |
0259addd JB |
12152 | return; |
12153 | } | |
12154 | ||
12155 | /* Try our fallback exception suport info. */ | |
f17011e0 | 12156 | if (ada_has_this_exception_support (&exception_support_info_fallback)) |
0259addd | 12157 | { |
3eecfa55 | 12158 | data->exception_info = &exception_support_info_fallback; |
0259addd JB |
12159 | return; |
12160 | } | |
12161 | ||
12162 | /* Sometimes, it is normal for us to not be able to find the routine | |
12163 | we are looking for. This happens when the program is linked with | |
12164 | the shared version of the GNAT runtime, and the program has not been | |
12165 | started yet. Inform the user of these two possible causes if | |
12166 | applicable. */ | |
12167 | ||
ccefe4c4 | 12168 | if (ada_update_initial_language (language_unknown) != language_ada) |
0259addd JB |
12169 | error (_("Unable to insert catchpoint. Is this an Ada main program?")); |
12170 | ||
12171 | /* If the symbol does not exist, then check that the program is | |
12172 | already started, to make sure that shared libraries have been | |
12173 | loaded. If it is not started, this may mean that the symbol is | |
12174 | in a shared library. */ | |
12175 | ||
12176 | if (ptid_get_pid (inferior_ptid) == 0) | |
12177 | error (_("Unable to insert catchpoint. Try to start the program first.")); | |
12178 | ||
12179 | /* At this point, we know that we are debugging an Ada program and | |
12180 | that the inferior has been started, but we still are not able to | |
0963b4bd | 12181 | find the run-time symbols. That can mean that we are in |
0259addd JB |
12182 | configurable run time mode, or that a-except as been optimized |
12183 | out by the linker... In any case, at this point it is not worth | |
12184 | supporting this feature. */ | |
12185 | ||
7dda8cff | 12186 | error (_("Cannot insert Ada exception catchpoints in this configuration.")); |
0259addd JB |
12187 | } |
12188 | ||
f7f9143b JB |
12189 | /* True iff FRAME is very likely to be that of a function that is |
12190 | part of the runtime system. This is all very heuristic, but is | |
12191 | intended to be used as advice as to what frames are uninteresting | |
12192 | to most users. */ | |
12193 | ||
12194 | static int | |
12195 | is_known_support_routine (struct frame_info *frame) | |
12196 | { | |
692465f1 | 12197 | enum language func_lang; |
f7f9143b | 12198 | int i; |
f35a17b5 | 12199 | const char *fullname; |
f7f9143b | 12200 | |
4ed6b5be JB |
12201 | /* If this code does not have any debugging information (no symtab), |
12202 | This cannot be any user code. */ | |
f7f9143b | 12203 | |
51abb421 | 12204 | symtab_and_line sal = find_frame_sal (frame); |
f7f9143b JB |
12205 | if (sal.symtab == NULL) |
12206 | return 1; | |
12207 | ||
4ed6b5be JB |
12208 | /* If there is a symtab, but the associated source file cannot be |
12209 | located, then assume this is not user code: Selecting a frame | |
12210 | for which we cannot display the code would not be very helpful | |
12211 | for the user. This should also take care of case such as VxWorks | |
12212 | where the kernel has some debugging info provided for a few units. */ | |
f7f9143b | 12213 | |
f35a17b5 JK |
12214 | fullname = symtab_to_fullname (sal.symtab); |
12215 | if (access (fullname, R_OK) != 0) | |
f7f9143b JB |
12216 | return 1; |
12217 | ||
4ed6b5be JB |
12218 | /* Check the unit filename againt the Ada runtime file naming. |
12219 | We also check the name of the objfile against the name of some | |
12220 | known system libraries that sometimes come with debugging info | |
12221 | too. */ | |
12222 | ||
f7f9143b JB |
12223 | for (i = 0; known_runtime_file_name_patterns[i] != NULL; i += 1) |
12224 | { | |
12225 | re_comp (known_runtime_file_name_patterns[i]); | |
f69c91ad | 12226 | if (re_exec (lbasename (sal.symtab->filename))) |
f7f9143b | 12227 | return 1; |
eb822aa6 DE |
12228 | if (SYMTAB_OBJFILE (sal.symtab) != NULL |
12229 | && re_exec (objfile_name (SYMTAB_OBJFILE (sal.symtab)))) | |
4ed6b5be | 12230 | return 1; |
f7f9143b JB |
12231 | } |
12232 | ||
4ed6b5be | 12233 | /* Check whether the function is a GNAT-generated entity. */ |
f7f9143b | 12234 | |
c6dc63a1 TT |
12235 | gdb::unique_xmalloc_ptr<char> func_name |
12236 | = find_frame_funname (frame, &func_lang, NULL); | |
f7f9143b JB |
12237 | if (func_name == NULL) |
12238 | return 1; | |
12239 | ||
12240 | for (i = 0; known_auxiliary_function_name_patterns[i] != NULL; i += 1) | |
12241 | { | |
12242 | re_comp (known_auxiliary_function_name_patterns[i]); | |
c6dc63a1 TT |
12243 | if (re_exec (func_name.get ())) |
12244 | return 1; | |
f7f9143b JB |
12245 | } |
12246 | ||
12247 | return 0; | |
12248 | } | |
12249 | ||
12250 | /* Find the first frame that contains debugging information and that is not | |
12251 | part of the Ada run-time, starting from FI and moving upward. */ | |
12252 | ||
0ef643c8 | 12253 | void |
f7f9143b JB |
12254 | ada_find_printable_frame (struct frame_info *fi) |
12255 | { | |
12256 | for (; fi != NULL; fi = get_prev_frame (fi)) | |
12257 | { | |
12258 | if (!is_known_support_routine (fi)) | |
12259 | { | |
12260 | select_frame (fi); | |
12261 | break; | |
12262 | } | |
12263 | } | |
12264 | ||
12265 | } | |
12266 | ||
12267 | /* Assuming that the inferior just triggered an unhandled exception | |
12268 | catchpoint, return the address in inferior memory where the name | |
12269 | of the exception is stored. | |
12270 | ||
12271 | Return zero if the address could not be computed. */ | |
12272 | ||
12273 | static CORE_ADDR | |
12274 | ada_unhandled_exception_name_addr (void) | |
0259addd JB |
12275 | { |
12276 | return parse_and_eval_address ("e.full_name"); | |
12277 | } | |
12278 | ||
12279 | /* Same as ada_unhandled_exception_name_addr, except that this function | |
12280 | should be used when the inferior uses an older version of the runtime, | |
12281 | where the exception name needs to be extracted from a specific frame | |
12282 | several frames up in the callstack. */ | |
12283 | ||
12284 | static CORE_ADDR | |
12285 | ada_unhandled_exception_name_addr_from_raise (void) | |
f7f9143b JB |
12286 | { |
12287 | int frame_level; | |
12288 | struct frame_info *fi; | |
3eecfa55 | 12289 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
f7f9143b JB |
12290 | |
12291 | /* To determine the name of this exception, we need to select | |
12292 | the frame corresponding to RAISE_SYM_NAME. This frame is | |
12293 | at least 3 levels up, so we simply skip the first 3 frames | |
12294 | without checking the name of their associated function. */ | |
12295 | fi = get_current_frame (); | |
12296 | for (frame_level = 0; frame_level < 3; frame_level += 1) | |
12297 | if (fi != NULL) | |
12298 | fi = get_prev_frame (fi); | |
12299 | ||
12300 | while (fi != NULL) | |
12301 | { | |
692465f1 JB |
12302 | enum language func_lang; |
12303 | ||
c6dc63a1 TT |
12304 | gdb::unique_xmalloc_ptr<char> func_name |
12305 | = find_frame_funname (fi, &func_lang, NULL); | |
55b87a52 KS |
12306 | if (func_name != NULL) |
12307 | { | |
c6dc63a1 | 12308 | if (strcmp (func_name.get (), |
55b87a52 KS |
12309 | data->exception_info->catch_exception_sym) == 0) |
12310 | break; /* We found the frame we were looking for... */ | |
12311 | fi = get_prev_frame (fi); | |
12312 | } | |
f7f9143b JB |
12313 | } |
12314 | ||
12315 | if (fi == NULL) | |
12316 | return 0; | |
12317 | ||
12318 | select_frame (fi); | |
12319 | return parse_and_eval_address ("id.full_name"); | |
12320 | } | |
12321 | ||
12322 | /* Assuming the inferior just triggered an Ada exception catchpoint | |
12323 | (of any type), return the address in inferior memory where the name | |
12324 | of the exception is stored, if applicable. | |
12325 | ||
45db7c09 PA |
12326 | Assumes the selected frame is the current frame. |
12327 | ||
f7f9143b JB |
12328 | Return zero if the address could not be computed, or if not relevant. */ |
12329 | ||
12330 | static CORE_ADDR | |
761269c8 | 12331 | ada_exception_name_addr_1 (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12332 | struct breakpoint *b) |
12333 | { | |
3eecfa55 JB |
12334 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
12335 | ||
f7f9143b JB |
12336 | switch (ex) |
12337 | { | |
761269c8 | 12338 | case ada_catch_exception: |
f7f9143b JB |
12339 | return (parse_and_eval_address ("e.full_name")); |
12340 | break; | |
12341 | ||
761269c8 | 12342 | case ada_catch_exception_unhandled: |
3eecfa55 | 12343 | return data->exception_info->unhandled_exception_name_addr (); |
f7f9143b | 12344 | break; |
9f757bf7 XR |
12345 | |
12346 | case ada_catch_handlers: | |
12347 | return 0; /* The runtimes does not provide access to the exception | |
12348 | name. */ | |
12349 | break; | |
12350 | ||
761269c8 | 12351 | case ada_catch_assert: |
f7f9143b JB |
12352 | return 0; /* Exception name is not relevant in this case. */ |
12353 | break; | |
12354 | ||
12355 | default: | |
12356 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12357 | break; | |
12358 | } | |
12359 | ||
12360 | return 0; /* Should never be reached. */ | |
12361 | } | |
12362 | ||
e547c119 JB |
12363 | /* Assuming the inferior is stopped at an exception catchpoint, |
12364 | return the message which was associated to the exception, if | |
12365 | available. Return NULL if the message could not be retrieved. | |
12366 | ||
12367 | The caller must xfree the string after use. | |
12368 | ||
12369 | Note: The exception message can be associated to an exception | |
12370 | either through the use of the Raise_Exception function, or | |
12371 | more simply (Ada 2005 and later), via: | |
12372 | ||
12373 | raise Exception_Name with "exception message"; | |
12374 | ||
12375 | */ | |
12376 | ||
12377 | static char * | |
12378 | ada_exception_message_1 (void) | |
12379 | { | |
12380 | struct value *e_msg_val; | |
12381 | char *e_msg = NULL; | |
12382 | int e_msg_len; | |
12383 | struct cleanup *cleanups; | |
12384 | ||
12385 | /* For runtimes that support this feature, the exception message | |
12386 | is passed as an unbounded string argument called "message". */ | |
12387 | e_msg_val = parse_and_eval ("message"); | |
12388 | if (e_msg_val == NULL) | |
12389 | return NULL; /* Exception message not supported. */ | |
12390 | ||
12391 | e_msg_val = ada_coerce_to_simple_array (e_msg_val); | |
12392 | gdb_assert (e_msg_val != NULL); | |
12393 | e_msg_len = TYPE_LENGTH (value_type (e_msg_val)); | |
12394 | ||
12395 | /* If the message string is empty, then treat it as if there was | |
12396 | no exception message. */ | |
12397 | if (e_msg_len <= 0) | |
12398 | return NULL; | |
12399 | ||
12400 | e_msg = (char *) xmalloc (e_msg_len + 1); | |
12401 | cleanups = make_cleanup (xfree, e_msg); | |
12402 | read_memory_string (value_address (e_msg_val), e_msg, e_msg_len + 1); | |
12403 | e_msg[e_msg_len] = '\0'; | |
12404 | ||
12405 | discard_cleanups (cleanups); | |
12406 | return e_msg; | |
12407 | } | |
12408 | ||
12409 | /* Same as ada_exception_message_1, except that all exceptions are | |
12410 | contained here (returning NULL instead). */ | |
12411 | ||
12412 | static char * | |
12413 | ada_exception_message (void) | |
12414 | { | |
12415 | char *e_msg = NULL; /* Avoid a spurious uninitialized warning. */ | |
12416 | ||
12417 | TRY | |
12418 | { | |
12419 | e_msg = ada_exception_message_1 (); | |
12420 | } | |
12421 | CATCH (e, RETURN_MASK_ERROR) | |
12422 | { | |
12423 | e_msg = NULL; | |
12424 | } | |
12425 | END_CATCH | |
12426 | ||
12427 | return e_msg; | |
12428 | } | |
12429 | ||
f7f9143b JB |
12430 | /* Same as ada_exception_name_addr_1, except that it intercepts and contains |
12431 | any error that ada_exception_name_addr_1 might cause to be thrown. | |
12432 | When an error is intercepted, a warning with the error message is printed, | |
12433 | and zero is returned. */ | |
12434 | ||
12435 | static CORE_ADDR | |
761269c8 | 12436 | ada_exception_name_addr (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12437 | struct breakpoint *b) |
12438 | { | |
f7f9143b JB |
12439 | CORE_ADDR result = 0; |
12440 | ||
492d29ea | 12441 | TRY |
f7f9143b JB |
12442 | { |
12443 | result = ada_exception_name_addr_1 (ex, b); | |
12444 | } | |
12445 | ||
492d29ea | 12446 | CATCH (e, RETURN_MASK_ERROR) |
f7f9143b JB |
12447 | { |
12448 | warning (_("failed to get exception name: %s"), e.message); | |
12449 | return 0; | |
12450 | } | |
492d29ea | 12451 | END_CATCH |
f7f9143b JB |
12452 | |
12453 | return result; | |
12454 | } | |
12455 | ||
9f757bf7 XR |
12456 | static char *ada_exception_catchpoint_cond_string |
12457 | (const char *excep_string, | |
12458 | enum ada_exception_catchpoint_kind ex); | |
28010a5d PA |
12459 | |
12460 | /* Ada catchpoints. | |
12461 | ||
12462 | In the case of catchpoints on Ada exceptions, the catchpoint will | |
12463 | stop the target on every exception the program throws. When a user | |
12464 | specifies the name of a specific exception, we translate this | |
12465 | request into a condition expression (in text form), and then parse | |
12466 | it into an expression stored in each of the catchpoint's locations. | |
12467 | We then use this condition to check whether the exception that was | |
12468 | raised is the one the user is interested in. If not, then the | |
12469 | target is resumed again. We store the name of the requested | |
12470 | exception, in order to be able to re-set the condition expression | |
12471 | when symbols change. */ | |
12472 | ||
12473 | /* An instance of this type is used to represent an Ada catchpoint | |
5625a286 | 12474 | breakpoint location. */ |
28010a5d | 12475 | |
5625a286 | 12476 | class ada_catchpoint_location : public bp_location |
28010a5d | 12477 | { |
5625a286 PA |
12478 | public: |
12479 | ada_catchpoint_location (const bp_location_ops *ops, breakpoint *owner) | |
12480 | : bp_location (ops, owner) | |
12481 | {} | |
28010a5d PA |
12482 | |
12483 | /* The condition that checks whether the exception that was raised | |
12484 | is the specific exception the user specified on catchpoint | |
12485 | creation. */ | |
4d01a485 | 12486 | expression_up excep_cond_expr; |
28010a5d PA |
12487 | }; |
12488 | ||
12489 | /* Implement the DTOR method in the bp_location_ops structure for all | |
12490 | Ada exception catchpoint kinds. */ | |
12491 | ||
12492 | static void | |
12493 | ada_catchpoint_location_dtor (struct bp_location *bl) | |
12494 | { | |
12495 | struct ada_catchpoint_location *al = (struct ada_catchpoint_location *) bl; | |
12496 | ||
4d01a485 | 12497 | al->excep_cond_expr.reset (); |
28010a5d PA |
12498 | } |
12499 | ||
12500 | /* The vtable to be used in Ada catchpoint locations. */ | |
12501 | ||
12502 | static const struct bp_location_ops ada_catchpoint_location_ops = | |
12503 | { | |
12504 | ada_catchpoint_location_dtor | |
12505 | }; | |
12506 | ||
c1fc2657 | 12507 | /* An instance of this type is used to represent an Ada catchpoint. */ |
28010a5d | 12508 | |
c1fc2657 | 12509 | struct ada_catchpoint : public breakpoint |
28010a5d | 12510 | { |
c1fc2657 | 12511 | ~ada_catchpoint () override; |
28010a5d PA |
12512 | |
12513 | /* The name of the specific exception the user specified. */ | |
12514 | char *excep_string; | |
12515 | }; | |
12516 | ||
12517 | /* Parse the exception condition string in the context of each of the | |
12518 | catchpoint's locations, and store them for later evaluation. */ | |
12519 | ||
12520 | static void | |
9f757bf7 XR |
12521 | create_excep_cond_exprs (struct ada_catchpoint *c, |
12522 | enum ada_exception_catchpoint_kind ex) | |
28010a5d PA |
12523 | { |
12524 | struct cleanup *old_chain; | |
12525 | struct bp_location *bl; | |
12526 | char *cond_string; | |
12527 | ||
12528 | /* Nothing to do if there's no specific exception to catch. */ | |
12529 | if (c->excep_string == NULL) | |
12530 | return; | |
12531 | ||
12532 | /* Same if there are no locations... */ | |
c1fc2657 | 12533 | if (c->loc == NULL) |
28010a5d PA |
12534 | return; |
12535 | ||
12536 | /* Compute the condition expression in text form, from the specific | |
12537 | expection we want to catch. */ | |
9f757bf7 | 12538 | cond_string = ada_exception_catchpoint_cond_string (c->excep_string, ex); |
28010a5d PA |
12539 | old_chain = make_cleanup (xfree, cond_string); |
12540 | ||
12541 | /* Iterate over all the catchpoint's locations, and parse an | |
12542 | expression for each. */ | |
c1fc2657 | 12543 | for (bl = c->loc; bl != NULL; bl = bl->next) |
28010a5d PA |
12544 | { |
12545 | struct ada_catchpoint_location *ada_loc | |
12546 | = (struct ada_catchpoint_location *) bl; | |
4d01a485 | 12547 | expression_up exp; |
28010a5d PA |
12548 | |
12549 | if (!bl->shlib_disabled) | |
12550 | { | |
bbc13ae3 | 12551 | const char *s; |
28010a5d PA |
12552 | |
12553 | s = cond_string; | |
492d29ea | 12554 | TRY |
28010a5d | 12555 | { |
036e657b JB |
12556 | exp = parse_exp_1 (&s, bl->address, |
12557 | block_for_pc (bl->address), | |
12558 | 0); | |
28010a5d | 12559 | } |
492d29ea | 12560 | CATCH (e, RETURN_MASK_ERROR) |
849f2b52 JB |
12561 | { |
12562 | warning (_("failed to reevaluate internal exception condition " | |
12563 | "for catchpoint %d: %s"), | |
c1fc2657 | 12564 | c->number, e.message); |
849f2b52 | 12565 | } |
492d29ea | 12566 | END_CATCH |
28010a5d PA |
12567 | } |
12568 | ||
b22e99fd | 12569 | ada_loc->excep_cond_expr = std::move (exp); |
28010a5d PA |
12570 | } |
12571 | ||
12572 | do_cleanups (old_chain); | |
12573 | } | |
12574 | ||
c1fc2657 | 12575 | /* ada_catchpoint destructor. */ |
28010a5d | 12576 | |
c1fc2657 | 12577 | ada_catchpoint::~ada_catchpoint () |
28010a5d | 12578 | { |
c1fc2657 | 12579 | xfree (this->excep_string); |
28010a5d PA |
12580 | } |
12581 | ||
12582 | /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops | |
12583 | structure for all exception catchpoint kinds. */ | |
12584 | ||
12585 | static struct bp_location * | |
761269c8 | 12586 | allocate_location_exception (enum ada_exception_catchpoint_kind ex, |
28010a5d PA |
12587 | struct breakpoint *self) |
12588 | { | |
5625a286 | 12589 | return new ada_catchpoint_location (&ada_catchpoint_location_ops, self); |
28010a5d PA |
12590 | } |
12591 | ||
12592 | /* Implement the RE_SET method in the breakpoint_ops structure for all | |
12593 | exception catchpoint kinds. */ | |
12594 | ||
12595 | static void | |
761269c8 | 12596 | re_set_exception (enum ada_exception_catchpoint_kind ex, struct breakpoint *b) |
28010a5d PA |
12597 | { |
12598 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; | |
12599 | ||
12600 | /* Call the base class's method. This updates the catchpoint's | |
12601 | locations. */ | |
2060206e | 12602 | bkpt_breakpoint_ops.re_set (b); |
28010a5d PA |
12603 | |
12604 | /* Reparse the exception conditional expressions. One for each | |
12605 | location. */ | |
9f757bf7 | 12606 | create_excep_cond_exprs (c, ex); |
28010a5d PA |
12607 | } |
12608 | ||
12609 | /* Returns true if we should stop for this breakpoint hit. If the | |
12610 | user specified a specific exception, we only want to cause a stop | |
12611 | if the program thrown that exception. */ | |
12612 | ||
12613 | static int | |
12614 | should_stop_exception (const struct bp_location *bl) | |
12615 | { | |
12616 | struct ada_catchpoint *c = (struct ada_catchpoint *) bl->owner; | |
12617 | const struct ada_catchpoint_location *ada_loc | |
12618 | = (const struct ada_catchpoint_location *) bl; | |
28010a5d PA |
12619 | int stop; |
12620 | ||
12621 | /* With no specific exception, should always stop. */ | |
12622 | if (c->excep_string == NULL) | |
12623 | return 1; | |
12624 | ||
12625 | if (ada_loc->excep_cond_expr == NULL) | |
12626 | { | |
12627 | /* We will have a NULL expression if back when we were creating | |
12628 | the expressions, this location's had failed to parse. */ | |
12629 | return 1; | |
12630 | } | |
12631 | ||
12632 | stop = 1; | |
492d29ea | 12633 | TRY |
28010a5d PA |
12634 | { |
12635 | struct value *mark; | |
12636 | ||
12637 | mark = value_mark (); | |
4d01a485 | 12638 | stop = value_true (evaluate_expression (ada_loc->excep_cond_expr.get ())); |
28010a5d PA |
12639 | value_free_to_mark (mark); |
12640 | } | |
492d29ea PA |
12641 | CATCH (ex, RETURN_MASK_ALL) |
12642 | { | |
12643 | exception_fprintf (gdb_stderr, ex, | |
12644 | _("Error in testing exception condition:\n")); | |
12645 | } | |
12646 | END_CATCH | |
12647 | ||
28010a5d PA |
12648 | return stop; |
12649 | } | |
12650 | ||
12651 | /* Implement the CHECK_STATUS method in the breakpoint_ops structure | |
12652 | for all exception catchpoint kinds. */ | |
12653 | ||
12654 | static void | |
761269c8 | 12655 | check_status_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
28010a5d PA |
12656 | { |
12657 | bs->stop = should_stop_exception (bs->bp_location_at); | |
12658 | } | |
12659 | ||
f7f9143b JB |
12660 | /* Implement the PRINT_IT method in the breakpoint_ops structure |
12661 | for all exception catchpoint kinds. */ | |
12662 | ||
12663 | static enum print_stop_action | |
761269c8 | 12664 | print_it_exception (enum ada_exception_catchpoint_kind ex, bpstat bs) |
f7f9143b | 12665 | { |
79a45e25 | 12666 | struct ui_out *uiout = current_uiout; |
348d480f | 12667 | struct breakpoint *b = bs->breakpoint_at; |
e547c119 | 12668 | char *exception_message; |
348d480f | 12669 | |
956a9fb9 | 12670 | annotate_catchpoint (b->number); |
f7f9143b | 12671 | |
112e8700 | 12672 | if (uiout->is_mi_like_p ()) |
f7f9143b | 12673 | { |
112e8700 | 12674 | uiout->field_string ("reason", |
956a9fb9 | 12675 | async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT)); |
112e8700 | 12676 | uiout->field_string ("disp", bpdisp_text (b->disposition)); |
f7f9143b JB |
12677 | } |
12678 | ||
112e8700 SM |
12679 | uiout->text (b->disposition == disp_del |
12680 | ? "\nTemporary catchpoint " : "\nCatchpoint "); | |
12681 | uiout->field_int ("bkptno", b->number); | |
12682 | uiout->text (", "); | |
f7f9143b | 12683 | |
45db7c09 PA |
12684 | /* ada_exception_name_addr relies on the selected frame being the |
12685 | current frame. Need to do this here because this function may be | |
12686 | called more than once when printing a stop, and below, we'll | |
12687 | select the first frame past the Ada run-time (see | |
12688 | ada_find_printable_frame). */ | |
12689 | select_frame (get_current_frame ()); | |
12690 | ||
f7f9143b JB |
12691 | switch (ex) |
12692 | { | |
761269c8 JB |
12693 | case ada_catch_exception: |
12694 | case ada_catch_exception_unhandled: | |
9f757bf7 | 12695 | case ada_catch_handlers: |
956a9fb9 JB |
12696 | { |
12697 | const CORE_ADDR addr = ada_exception_name_addr (ex, b); | |
12698 | char exception_name[256]; | |
12699 | ||
12700 | if (addr != 0) | |
12701 | { | |
c714b426 PA |
12702 | read_memory (addr, (gdb_byte *) exception_name, |
12703 | sizeof (exception_name) - 1); | |
956a9fb9 JB |
12704 | exception_name [sizeof (exception_name) - 1] = '\0'; |
12705 | } | |
12706 | else | |
12707 | { | |
12708 | /* For some reason, we were unable to read the exception | |
12709 | name. This could happen if the Runtime was compiled | |
12710 | without debugging info, for instance. In that case, | |
12711 | just replace the exception name by the generic string | |
12712 | "exception" - it will read as "an exception" in the | |
12713 | notification we are about to print. */ | |
967cff16 | 12714 | memcpy (exception_name, "exception", sizeof ("exception")); |
956a9fb9 JB |
12715 | } |
12716 | /* In the case of unhandled exception breakpoints, we print | |
12717 | the exception name as "unhandled EXCEPTION_NAME", to make | |
12718 | it clearer to the user which kind of catchpoint just got | |
12719 | hit. We used ui_out_text to make sure that this extra | |
12720 | info does not pollute the exception name in the MI case. */ | |
761269c8 | 12721 | if (ex == ada_catch_exception_unhandled) |
112e8700 SM |
12722 | uiout->text ("unhandled "); |
12723 | uiout->field_string ("exception-name", exception_name); | |
956a9fb9 JB |
12724 | } |
12725 | break; | |
761269c8 | 12726 | case ada_catch_assert: |
956a9fb9 JB |
12727 | /* In this case, the name of the exception is not really |
12728 | important. Just print "failed assertion" to make it clearer | |
12729 | that his program just hit an assertion-failure catchpoint. | |
12730 | We used ui_out_text because this info does not belong in | |
12731 | the MI output. */ | |
112e8700 | 12732 | uiout->text ("failed assertion"); |
956a9fb9 | 12733 | break; |
f7f9143b | 12734 | } |
e547c119 JB |
12735 | |
12736 | exception_message = ada_exception_message (); | |
12737 | if (exception_message != NULL) | |
12738 | { | |
12739 | struct cleanup *cleanups = make_cleanup (xfree, exception_message); | |
12740 | ||
12741 | uiout->text (" ("); | |
12742 | uiout->field_string ("exception-message", exception_message); | |
12743 | uiout->text (")"); | |
12744 | ||
12745 | do_cleanups (cleanups); | |
12746 | } | |
12747 | ||
112e8700 | 12748 | uiout->text (" at "); |
956a9fb9 | 12749 | ada_find_printable_frame (get_current_frame ()); |
f7f9143b JB |
12750 | |
12751 | return PRINT_SRC_AND_LOC; | |
12752 | } | |
12753 | ||
12754 | /* Implement the PRINT_ONE method in the breakpoint_ops structure | |
12755 | for all exception catchpoint kinds. */ | |
12756 | ||
12757 | static void | |
761269c8 | 12758 | print_one_exception (enum ada_exception_catchpoint_kind ex, |
a6d9a66e | 12759 | struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12760 | { |
79a45e25 | 12761 | struct ui_out *uiout = current_uiout; |
28010a5d | 12762 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45b7d TT |
12763 | struct value_print_options opts; |
12764 | ||
12765 | get_user_print_options (&opts); | |
12766 | if (opts.addressprint) | |
f7f9143b JB |
12767 | { |
12768 | annotate_field (4); | |
112e8700 | 12769 | uiout->field_core_addr ("addr", b->loc->gdbarch, b->loc->address); |
f7f9143b JB |
12770 | } |
12771 | ||
12772 | annotate_field (5); | |
a6d9a66e | 12773 | *last_loc = b->loc; |
f7f9143b JB |
12774 | switch (ex) |
12775 | { | |
761269c8 | 12776 | case ada_catch_exception: |
28010a5d | 12777 | if (c->excep_string != NULL) |
f7f9143b | 12778 | { |
28010a5d PA |
12779 | char *msg = xstrprintf (_("`%s' Ada exception"), c->excep_string); |
12780 | ||
112e8700 | 12781 | uiout->field_string ("what", msg); |
f7f9143b JB |
12782 | xfree (msg); |
12783 | } | |
12784 | else | |
112e8700 | 12785 | uiout->field_string ("what", "all Ada exceptions"); |
f7f9143b JB |
12786 | |
12787 | break; | |
12788 | ||
761269c8 | 12789 | case ada_catch_exception_unhandled: |
112e8700 | 12790 | uiout->field_string ("what", "unhandled Ada exceptions"); |
f7f9143b JB |
12791 | break; |
12792 | ||
9f757bf7 XR |
12793 | case ada_catch_handlers: |
12794 | if (c->excep_string != NULL) | |
12795 | { | |
12796 | uiout->field_fmt ("what", | |
12797 | _("`%s' Ada exception handlers"), | |
12798 | c->excep_string); | |
12799 | } | |
12800 | else | |
12801 | uiout->field_string ("what", "all Ada exceptions handlers"); | |
12802 | break; | |
12803 | ||
761269c8 | 12804 | case ada_catch_assert: |
112e8700 | 12805 | uiout->field_string ("what", "failed Ada assertions"); |
f7f9143b JB |
12806 | break; |
12807 | ||
12808 | default: | |
12809 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12810 | break; | |
12811 | } | |
12812 | } | |
12813 | ||
12814 | /* Implement the PRINT_MENTION method in the breakpoint_ops structure | |
12815 | for all exception catchpoint kinds. */ | |
12816 | ||
12817 | static void | |
761269c8 | 12818 | print_mention_exception (enum ada_exception_catchpoint_kind ex, |
f7f9143b JB |
12819 | struct breakpoint *b) |
12820 | { | |
28010a5d | 12821 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
79a45e25 | 12822 | struct ui_out *uiout = current_uiout; |
28010a5d | 12823 | |
112e8700 | 12824 | uiout->text (b->disposition == disp_del ? _("Temporary catchpoint ") |
00eb2c4a | 12825 | : _("Catchpoint ")); |
112e8700 SM |
12826 | uiout->field_int ("bkptno", b->number); |
12827 | uiout->text (": "); | |
00eb2c4a | 12828 | |
f7f9143b JB |
12829 | switch (ex) |
12830 | { | |
761269c8 | 12831 | case ada_catch_exception: |
28010a5d | 12832 | if (c->excep_string != NULL) |
00eb2c4a JB |
12833 | { |
12834 | char *info = xstrprintf (_("`%s' Ada exception"), c->excep_string); | |
12835 | struct cleanup *old_chain = make_cleanup (xfree, info); | |
12836 | ||
112e8700 | 12837 | uiout->text (info); |
00eb2c4a JB |
12838 | do_cleanups (old_chain); |
12839 | } | |
f7f9143b | 12840 | else |
112e8700 | 12841 | uiout->text (_("all Ada exceptions")); |
f7f9143b JB |
12842 | break; |
12843 | ||
761269c8 | 12844 | case ada_catch_exception_unhandled: |
112e8700 | 12845 | uiout->text (_("unhandled Ada exceptions")); |
f7f9143b | 12846 | break; |
9f757bf7 XR |
12847 | |
12848 | case ada_catch_handlers: | |
12849 | if (c->excep_string != NULL) | |
12850 | { | |
12851 | std::string info | |
12852 | = string_printf (_("`%s' Ada exception handlers"), | |
12853 | c->excep_string); | |
12854 | uiout->text (info.c_str ()); | |
12855 | } | |
12856 | else | |
12857 | uiout->text (_("all Ada exceptions handlers")); | |
12858 | break; | |
12859 | ||
761269c8 | 12860 | case ada_catch_assert: |
112e8700 | 12861 | uiout->text (_("failed Ada assertions")); |
f7f9143b JB |
12862 | break; |
12863 | ||
12864 | default: | |
12865 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12866 | break; | |
12867 | } | |
12868 | } | |
12869 | ||
6149aea9 PA |
12870 | /* Implement the PRINT_RECREATE method in the breakpoint_ops structure |
12871 | for all exception catchpoint kinds. */ | |
12872 | ||
12873 | static void | |
761269c8 | 12874 | print_recreate_exception (enum ada_exception_catchpoint_kind ex, |
6149aea9 PA |
12875 | struct breakpoint *b, struct ui_file *fp) |
12876 | { | |
28010a5d PA |
12877 | struct ada_catchpoint *c = (struct ada_catchpoint *) b; |
12878 | ||
6149aea9 PA |
12879 | switch (ex) |
12880 | { | |
761269c8 | 12881 | case ada_catch_exception: |
6149aea9 | 12882 | fprintf_filtered (fp, "catch exception"); |
28010a5d PA |
12883 | if (c->excep_string != NULL) |
12884 | fprintf_filtered (fp, " %s", c->excep_string); | |
6149aea9 PA |
12885 | break; |
12886 | ||
761269c8 | 12887 | case ada_catch_exception_unhandled: |
78076abc | 12888 | fprintf_filtered (fp, "catch exception unhandled"); |
6149aea9 PA |
12889 | break; |
12890 | ||
9f757bf7 XR |
12891 | case ada_catch_handlers: |
12892 | fprintf_filtered (fp, "catch handlers"); | |
12893 | break; | |
12894 | ||
761269c8 | 12895 | case ada_catch_assert: |
6149aea9 PA |
12896 | fprintf_filtered (fp, "catch assert"); |
12897 | break; | |
12898 | ||
12899 | default: | |
12900 | internal_error (__FILE__, __LINE__, _("unexpected catchpoint type")); | |
12901 | } | |
d9b3f62e | 12902 | print_recreate_thread (b, fp); |
6149aea9 PA |
12903 | } |
12904 | ||
f7f9143b JB |
12905 | /* Virtual table for "catch exception" breakpoints. */ |
12906 | ||
28010a5d PA |
12907 | static struct bp_location * |
12908 | allocate_location_catch_exception (struct breakpoint *self) | |
12909 | { | |
761269c8 | 12910 | return allocate_location_exception (ada_catch_exception, self); |
28010a5d PA |
12911 | } |
12912 | ||
12913 | static void | |
12914 | re_set_catch_exception (struct breakpoint *b) | |
12915 | { | |
761269c8 | 12916 | re_set_exception (ada_catch_exception, b); |
28010a5d PA |
12917 | } |
12918 | ||
12919 | static void | |
12920 | check_status_catch_exception (bpstat bs) | |
12921 | { | |
761269c8 | 12922 | check_status_exception (ada_catch_exception, bs); |
28010a5d PA |
12923 | } |
12924 | ||
f7f9143b | 12925 | static enum print_stop_action |
348d480f | 12926 | print_it_catch_exception (bpstat bs) |
f7f9143b | 12927 | { |
761269c8 | 12928 | return print_it_exception (ada_catch_exception, bs); |
f7f9143b JB |
12929 | } |
12930 | ||
12931 | static void | |
a6d9a66e | 12932 | print_one_catch_exception (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 12933 | { |
761269c8 | 12934 | print_one_exception (ada_catch_exception, b, last_loc); |
f7f9143b JB |
12935 | } |
12936 | ||
12937 | static void | |
12938 | print_mention_catch_exception (struct breakpoint *b) | |
12939 | { | |
761269c8 | 12940 | print_mention_exception (ada_catch_exception, b); |
f7f9143b JB |
12941 | } |
12942 | ||
6149aea9 PA |
12943 | static void |
12944 | print_recreate_catch_exception (struct breakpoint *b, struct ui_file *fp) | |
12945 | { | |
761269c8 | 12946 | print_recreate_exception (ada_catch_exception, b, fp); |
6149aea9 PA |
12947 | } |
12948 | ||
2060206e | 12949 | static struct breakpoint_ops catch_exception_breakpoint_ops; |
f7f9143b JB |
12950 | |
12951 | /* Virtual table for "catch exception unhandled" breakpoints. */ | |
12952 | ||
28010a5d PA |
12953 | static struct bp_location * |
12954 | allocate_location_catch_exception_unhandled (struct breakpoint *self) | |
12955 | { | |
761269c8 | 12956 | return allocate_location_exception (ada_catch_exception_unhandled, self); |
28010a5d PA |
12957 | } |
12958 | ||
12959 | static void | |
12960 | re_set_catch_exception_unhandled (struct breakpoint *b) | |
12961 | { | |
761269c8 | 12962 | re_set_exception (ada_catch_exception_unhandled, b); |
28010a5d PA |
12963 | } |
12964 | ||
12965 | static void | |
12966 | check_status_catch_exception_unhandled (bpstat bs) | |
12967 | { | |
761269c8 | 12968 | check_status_exception (ada_catch_exception_unhandled, bs); |
28010a5d PA |
12969 | } |
12970 | ||
f7f9143b | 12971 | static enum print_stop_action |
348d480f | 12972 | print_it_catch_exception_unhandled (bpstat bs) |
f7f9143b | 12973 | { |
761269c8 | 12974 | return print_it_exception (ada_catch_exception_unhandled, bs); |
f7f9143b JB |
12975 | } |
12976 | ||
12977 | static void | |
a6d9a66e UW |
12978 | print_one_catch_exception_unhandled (struct breakpoint *b, |
12979 | struct bp_location **last_loc) | |
f7f9143b | 12980 | { |
761269c8 | 12981 | print_one_exception (ada_catch_exception_unhandled, b, last_loc); |
f7f9143b JB |
12982 | } |
12983 | ||
12984 | static void | |
12985 | print_mention_catch_exception_unhandled (struct breakpoint *b) | |
12986 | { | |
761269c8 | 12987 | print_mention_exception (ada_catch_exception_unhandled, b); |
f7f9143b JB |
12988 | } |
12989 | ||
6149aea9 PA |
12990 | static void |
12991 | print_recreate_catch_exception_unhandled (struct breakpoint *b, | |
12992 | struct ui_file *fp) | |
12993 | { | |
761269c8 | 12994 | print_recreate_exception (ada_catch_exception_unhandled, b, fp); |
6149aea9 PA |
12995 | } |
12996 | ||
2060206e | 12997 | static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops; |
f7f9143b JB |
12998 | |
12999 | /* Virtual table for "catch assert" breakpoints. */ | |
13000 | ||
28010a5d PA |
13001 | static struct bp_location * |
13002 | allocate_location_catch_assert (struct breakpoint *self) | |
13003 | { | |
761269c8 | 13004 | return allocate_location_exception (ada_catch_assert, self); |
28010a5d PA |
13005 | } |
13006 | ||
13007 | static void | |
13008 | re_set_catch_assert (struct breakpoint *b) | |
13009 | { | |
761269c8 | 13010 | re_set_exception (ada_catch_assert, b); |
28010a5d PA |
13011 | } |
13012 | ||
13013 | static void | |
13014 | check_status_catch_assert (bpstat bs) | |
13015 | { | |
761269c8 | 13016 | check_status_exception (ada_catch_assert, bs); |
28010a5d PA |
13017 | } |
13018 | ||
f7f9143b | 13019 | static enum print_stop_action |
348d480f | 13020 | print_it_catch_assert (bpstat bs) |
f7f9143b | 13021 | { |
761269c8 | 13022 | return print_it_exception (ada_catch_assert, bs); |
f7f9143b JB |
13023 | } |
13024 | ||
13025 | static void | |
a6d9a66e | 13026 | print_one_catch_assert (struct breakpoint *b, struct bp_location **last_loc) |
f7f9143b | 13027 | { |
761269c8 | 13028 | print_one_exception (ada_catch_assert, b, last_loc); |
f7f9143b JB |
13029 | } |
13030 | ||
13031 | static void | |
13032 | print_mention_catch_assert (struct breakpoint *b) | |
13033 | { | |
761269c8 | 13034 | print_mention_exception (ada_catch_assert, b); |
f7f9143b JB |
13035 | } |
13036 | ||
6149aea9 PA |
13037 | static void |
13038 | print_recreate_catch_assert (struct breakpoint *b, struct ui_file *fp) | |
13039 | { | |
761269c8 | 13040 | print_recreate_exception (ada_catch_assert, b, fp); |
6149aea9 PA |
13041 | } |
13042 | ||
2060206e | 13043 | static struct breakpoint_ops catch_assert_breakpoint_ops; |
f7f9143b | 13044 | |
9f757bf7 XR |
13045 | /* Virtual table for "catch handlers" breakpoints. */ |
13046 | ||
13047 | static struct bp_location * | |
13048 | allocate_location_catch_handlers (struct breakpoint *self) | |
13049 | { | |
13050 | return allocate_location_exception (ada_catch_handlers, self); | |
13051 | } | |
13052 | ||
13053 | static void | |
13054 | re_set_catch_handlers (struct breakpoint *b) | |
13055 | { | |
13056 | re_set_exception (ada_catch_handlers, b); | |
13057 | } | |
13058 | ||
13059 | static void | |
13060 | check_status_catch_handlers (bpstat bs) | |
13061 | { | |
13062 | check_status_exception (ada_catch_handlers, bs); | |
13063 | } | |
13064 | ||
13065 | static enum print_stop_action | |
13066 | print_it_catch_handlers (bpstat bs) | |
13067 | { | |
13068 | return print_it_exception (ada_catch_handlers, bs); | |
13069 | } | |
13070 | ||
13071 | static void | |
13072 | print_one_catch_handlers (struct breakpoint *b, | |
13073 | struct bp_location **last_loc) | |
13074 | { | |
13075 | print_one_exception (ada_catch_handlers, b, last_loc); | |
13076 | } | |
13077 | ||
13078 | static void | |
13079 | print_mention_catch_handlers (struct breakpoint *b) | |
13080 | { | |
13081 | print_mention_exception (ada_catch_handlers, b); | |
13082 | } | |
13083 | ||
13084 | static void | |
13085 | print_recreate_catch_handlers (struct breakpoint *b, | |
13086 | struct ui_file *fp) | |
13087 | { | |
13088 | print_recreate_exception (ada_catch_handlers, b, fp); | |
13089 | } | |
13090 | ||
13091 | static struct breakpoint_ops catch_handlers_breakpoint_ops; | |
13092 | ||
f7f9143b JB |
13093 | /* Return a newly allocated copy of the first space-separated token |
13094 | in ARGSP, and then adjust ARGSP to point immediately after that | |
13095 | token. | |
13096 | ||
13097 | Return NULL if ARGPS does not contain any more tokens. */ | |
13098 | ||
13099 | static char * | |
a121b7c1 | 13100 | ada_get_next_arg (const char **argsp) |
f7f9143b | 13101 | { |
a121b7c1 PA |
13102 | const char *args = *argsp; |
13103 | const char *end; | |
f7f9143b JB |
13104 | char *result; |
13105 | ||
f1735a53 | 13106 | args = skip_spaces (args); |
f7f9143b JB |
13107 | if (args[0] == '\0') |
13108 | return NULL; /* No more arguments. */ | |
13109 | ||
13110 | /* Find the end of the current argument. */ | |
13111 | ||
f1735a53 | 13112 | end = skip_to_space (args); |
f7f9143b JB |
13113 | |
13114 | /* Adjust ARGSP to point to the start of the next argument. */ | |
13115 | ||
13116 | *argsp = end; | |
13117 | ||
13118 | /* Make a copy of the current argument and return it. */ | |
13119 | ||
224c3ddb | 13120 | result = (char *) xmalloc (end - args + 1); |
f7f9143b JB |
13121 | strncpy (result, args, end - args); |
13122 | result[end - args] = '\0'; | |
13123 | ||
13124 | return result; | |
13125 | } | |
13126 | ||
13127 | /* Split the arguments specified in a "catch exception" command. | |
13128 | Set EX to the appropriate catchpoint type. | |
28010a5d | 13129 | Set EXCEP_STRING to the name of the specific exception if |
5845583d | 13130 | specified by the user. |
9f757bf7 XR |
13131 | IS_CATCH_HANDLERS_CMD: True if the arguments are for a |
13132 | "catch handlers" command. False otherwise. | |
5845583d JB |
13133 | If a condition is found at the end of the arguments, the condition |
13134 | expression is stored in COND_STRING (memory must be deallocated | |
13135 | after use). Otherwise COND_STRING is set to NULL. */ | |
f7f9143b JB |
13136 | |
13137 | static void | |
a121b7c1 | 13138 | catch_ada_exception_command_split (const char *args, |
9f757bf7 | 13139 | bool is_catch_handlers_cmd, |
761269c8 | 13140 | enum ada_exception_catchpoint_kind *ex, |
5845583d | 13141 | char **excep_string, |
56ecd069 | 13142 | std::string &cond_string) |
f7f9143b JB |
13143 | { |
13144 | struct cleanup *old_chain = make_cleanup (null_cleanup, NULL); | |
13145 | char *exception_name; | |
5845583d | 13146 | char *cond = NULL; |
f7f9143b JB |
13147 | |
13148 | exception_name = ada_get_next_arg (&args); | |
5845583d JB |
13149 | if (exception_name != NULL && strcmp (exception_name, "if") == 0) |
13150 | { | |
13151 | /* This is not an exception name; this is the start of a condition | |
13152 | expression for a catchpoint on all exceptions. So, "un-get" | |
13153 | this token, and set exception_name to NULL. */ | |
13154 | xfree (exception_name); | |
13155 | exception_name = NULL; | |
13156 | args -= 2; | |
13157 | } | |
f7f9143b JB |
13158 | make_cleanup (xfree, exception_name); |
13159 | ||
5845583d | 13160 | /* Check to see if we have a condition. */ |
f7f9143b | 13161 | |
f1735a53 | 13162 | args = skip_spaces (args); |
61012eef | 13163 | if (startswith (args, "if") |
5845583d JB |
13164 | && (isspace (args[2]) || args[2] == '\0')) |
13165 | { | |
13166 | args += 2; | |
f1735a53 | 13167 | args = skip_spaces (args); |
5845583d JB |
13168 | |
13169 | if (args[0] == '\0') | |
13170 | error (_("Condition missing after `if' keyword")); | |
13171 | cond = xstrdup (args); | |
13172 | make_cleanup (xfree, cond); | |
13173 | ||
13174 | args += strlen (args); | |
13175 | } | |
13176 | ||
13177 | /* Check that we do not have any more arguments. Anything else | |
13178 | is unexpected. */ | |
f7f9143b JB |
13179 | |
13180 | if (args[0] != '\0') | |
13181 | error (_("Junk at end of expression")); | |
13182 | ||
13183 | discard_cleanups (old_chain); | |
13184 | ||
9f757bf7 XR |
13185 | if (is_catch_handlers_cmd) |
13186 | { | |
13187 | /* Catch handling of exceptions. */ | |
13188 | *ex = ada_catch_handlers; | |
13189 | *excep_string = exception_name; | |
13190 | } | |
13191 | else if (exception_name == NULL) | |
f7f9143b JB |
13192 | { |
13193 | /* Catch all exceptions. */ | |
761269c8 | 13194 | *ex = ada_catch_exception; |
28010a5d | 13195 | *excep_string = NULL; |
f7f9143b JB |
13196 | } |
13197 | else if (strcmp (exception_name, "unhandled") == 0) | |
13198 | { | |
13199 | /* Catch unhandled exceptions. */ | |
761269c8 | 13200 | *ex = ada_catch_exception_unhandled; |
28010a5d | 13201 | *excep_string = NULL; |
f7f9143b JB |
13202 | } |
13203 | else | |
13204 | { | |
13205 | /* Catch a specific exception. */ | |
761269c8 | 13206 | *ex = ada_catch_exception; |
28010a5d | 13207 | *excep_string = exception_name; |
f7f9143b | 13208 | } |
56ecd069 XR |
13209 | if (cond != NULL) |
13210 | cond_string.assign (cond); | |
f7f9143b JB |
13211 | } |
13212 | ||
13213 | /* Return the name of the symbol on which we should break in order to | |
13214 | implement a catchpoint of the EX kind. */ | |
13215 | ||
13216 | static const char * | |
761269c8 | 13217 | ada_exception_sym_name (enum ada_exception_catchpoint_kind ex) |
f7f9143b | 13218 | { |
3eecfa55 JB |
13219 | struct ada_inferior_data *data = get_ada_inferior_data (current_inferior ()); |
13220 | ||
13221 | gdb_assert (data->exception_info != NULL); | |
0259addd | 13222 | |
f7f9143b JB |
13223 | switch (ex) |
13224 | { | |
761269c8 | 13225 | case ada_catch_exception: |
3eecfa55 | 13226 | return (data->exception_info->catch_exception_sym); |
f7f9143b | 13227 | break; |
761269c8 | 13228 | case ada_catch_exception_unhandled: |
3eecfa55 | 13229 | return (data->exception_info->catch_exception_unhandled_sym); |
f7f9143b | 13230 | break; |
761269c8 | 13231 | case ada_catch_assert: |
3eecfa55 | 13232 | return (data->exception_info->catch_assert_sym); |
f7f9143b | 13233 | break; |
9f757bf7 XR |
13234 | case ada_catch_handlers: |
13235 | return (data->exception_info->catch_handlers_sym); | |
13236 | break; | |
f7f9143b JB |
13237 | default: |
13238 | internal_error (__FILE__, __LINE__, | |
13239 | _("unexpected catchpoint kind (%d)"), ex); | |
13240 | } | |
13241 | } | |
13242 | ||
13243 | /* Return the breakpoint ops "virtual table" used for catchpoints | |
13244 | of the EX kind. */ | |
13245 | ||
c0a91b2b | 13246 | static const struct breakpoint_ops * |
761269c8 | 13247 | ada_exception_breakpoint_ops (enum ada_exception_catchpoint_kind ex) |
f7f9143b JB |
13248 | { |
13249 | switch (ex) | |
13250 | { | |
761269c8 | 13251 | case ada_catch_exception: |
f7f9143b JB |
13252 | return (&catch_exception_breakpoint_ops); |
13253 | break; | |
761269c8 | 13254 | case ada_catch_exception_unhandled: |
f7f9143b JB |
13255 | return (&catch_exception_unhandled_breakpoint_ops); |
13256 | break; | |
761269c8 | 13257 | case ada_catch_assert: |
f7f9143b JB |
13258 | return (&catch_assert_breakpoint_ops); |
13259 | break; | |
9f757bf7 XR |
13260 | case ada_catch_handlers: |
13261 | return (&catch_handlers_breakpoint_ops); | |
13262 | break; | |
f7f9143b JB |
13263 | default: |
13264 | internal_error (__FILE__, __LINE__, | |
13265 | _("unexpected catchpoint kind (%d)"), ex); | |
13266 | } | |
13267 | } | |
13268 | ||
13269 | /* Return the condition that will be used to match the current exception | |
13270 | being raised with the exception that the user wants to catch. This | |
13271 | assumes that this condition is used when the inferior just triggered | |
13272 | an exception catchpoint. | |
9f757bf7 | 13273 | EX: the type of catchpoints used for catching Ada exceptions. |
f7f9143b JB |
13274 | |
13275 | The string returned is a newly allocated string that needs to be | |
13276 | deallocated later. */ | |
13277 | ||
13278 | static char * | |
9f757bf7 XR |
13279 | ada_exception_catchpoint_cond_string (const char *excep_string, |
13280 | enum ada_exception_catchpoint_kind ex) | |
f7f9143b | 13281 | { |
3d0b0fa3 | 13282 | int i; |
9f757bf7 XR |
13283 | bool is_standard_exc = false; |
13284 | const char *actual_exc_expr; | |
13285 | char *ref_exc_expr; | |
13286 | ||
13287 | if (ex == ada_catch_handlers) | |
13288 | { | |
13289 | /* For exception handlers catchpoints, the condition string does | |
13290 | not use the same parameter as for the other exceptions. */ | |
13291 | actual_exc_expr = ("long_integer (GNAT_GCC_exception_Access" | |
13292 | "(gcc_exception).all.occurrence.id)"); | |
13293 | } | |
13294 | else | |
13295 | actual_exc_expr = "long_integer (e)"; | |
3d0b0fa3 | 13296 | |
0963b4bd | 13297 | /* The standard exceptions are a special case. They are defined in |
3d0b0fa3 | 13298 | runtime units that have been compiled without debugging info; if |
28010a5d | 13299 | EXCEP_STRING is the not-fully-qualified name of a standard |
3d0b0fa3 JB |
13300 | exception (e.g. "constraint_error") then, during the evaluation |
13301 | of the condition expression, the symbol lookup on this name would | |
0963b4bd | 13302 | *not* return this standard exception. The catchpoint condition |
3d0b0fa3 JB |
13303 | may then be set only on user-defined exceptions which have the |
13304 | same not-fully-qualified name (e.g. my_package.constraint_error). | |
13305 | ||
13306 | To avoid this unexcepted behavior, these standard exceptions are | |
0963b4bd | 13307 | systematically prefixed by "standard". This means that "catch |
3d0b0fa3 JB |
13308 | exception constraint_error" is rewritten into "catch exception |
13309 | standard.constraint_error". | |
13310 | ||
13311 | If an exception named contraint_error is defined in another package of | |
13312 | the inferior program, then the only way to specify this exception as a | |
13313 | breakpoint condition is to use its fully-qualified named: | |
13314 | e.g. my_package.constraint_error. */ | |
13315 | ||
13316 | for (i = 0; i < sizeof (standard_exc) / sizeof (char *); i++) | |
13317 | { | |
28010a5d | 13318 | if (strcmp (standard_exc [i], excep_string) == 0) |
3d0b0fa3 | 13319 | { |
9f757bf7 XR |
13320 | is_standard_exc = true; |
13321 | break; | |
3d0b0fa3 JB |
13322 | } |
13323 | } | |
9f757bf7 XR |
13324 | |
13325 | if (is_standard_exc) | |
13326 | ref_exc_expr = xstrprintf ("long_integer (&standard.%s)", excep_string); | |
13327 | else | |
13328 | ref_exc_expr = xstrprintf ("long_integer (&%s)", excep_string); | |
13329 | ||
13330 | char *result = xstrprintf ("%s = %s", actual_exc_expr, ref_exc_expr); | |
13331 | xfree (ref_exc_expr); | |
13332 | return result; | |
f7f9143b JB |
13333 | } |
13334 | ||
13335 | /* Return the symtab_and_line that should be used to insert an exception | |
13336 | catchpoint of the TYPE kind. | |
13337 | ||
28010a5d PA |
13338 | EXCEP_STRING should contain the name of a specific exception that |
13339 | the catchpoint should catch, or NULL otherwise. | |
f7f9143b | 13340 | |
28010a5d PA |
13341 | ADDR_STRING returns the name of the function where the real |
13342 | breakpoint that implements the catchpoints is set, depending on the | |
13343 | type of catchpoint we need to create. */ | |
f7f9143b JB |
13344 | |
13345 | static struct symtab_and_line | |
761269c8 | 13346 | ada_exception_sal (enum ada_exception_catchpoint_kind ex, char *excep_string, |
f2fc3015 | 13347 | const char **addr_string, const struct breakpoint_ops **ops) |
f7f9143b JB |
13348 | { |
13349 | const char *sym_name; | |
13350 | struct symbol *sym; | |
f7f9143b | 13351 | |
0259addd JB |
13352 | /* First, find out which exception support info to use. */ |
13353 | ada_exception_support_info_sniffer (); | |
13354 | ||
13355 | /* Then lookup the function on which we will break in order to catch | |
f7f9143b | 13356 | the Ada exceptions requested by the user. */ |
f7f9143b JB |
13357 | sym_name = ada_exception_sym_name (ex); |
13358 | sym = standard_lookup (sym_name, NULL, VAR_DOMAIN); | |
13359 | ||
f17011e0 JB |
13360 | /* We can assume that SYM is not NULL at this stage. If the symbol |
13361 | did not exist, ada_exception_support_info_sniffer would have | |
13362 | raised an exception. | |
f7f9143b | 13363 | |
f17011e0 JB |
13364 | Also, ada_exception_support_info_sniffer should have already |
13365 | verified that SYM is a function symbol. */ | |
13366 | gdb_assert (sym != NULL); | |
13367 | gdb_assert (SYMBOL_CLASS (sym) == LOC_BLOCK); | |
f7f9143b JB |
13368 | |
13369 | /* Set ADDR_STRING. */ | |
f7f9143b JB |
13370 | *addr_string = xstrdup (sym_name); |
13371 | ||
f7f9143b | 13372 | /* Set OPS. */ |
4b9eee8c | 13373 | *ops = ada_exception_breakpoint_ops (ex); |
f7f9143b | 13374 | |
f17011e0 | 13375 | return find_function_start_sal (sym, 1); |
f7f9143b JB |
13376 | } |
13377 | ||
b4a5b78b | 13378 | /* Create an Ada exception catchpoint. |
f7f9143b | 13379 | |
b4a5b78b | 13380 | EX_KIND is the kind of exception catchpoint to be created. |
5845583d | 13381 | |
2df4d1d5 JB |
13382 | If EXCEPT_STRING is NULL, this catchpoint is expected to trigger |
13383 | for all exceptions. Otherwise, EXCEPT_STRING indicates the name | |
13384 | of the exception to which this catchpoint applies. When not NULL, | |
13385 | the string must be allocated on the heap, and its deallocation | |
13386 | is no longer the responsibility of the caller. | |
13387 | ||
13388 | COND_STRING, if not NULL, is the catchpoint condition. This string | |
13389 | must be allocated on the heap, and its deallocation is no longer | |
13390 | the responsibility of the caller. | |
f7f9143b | 13391 | |
b4a5b78b JB |
13392 | TEMPFLAG, if nonzero, means that the underlying breakpoint |
13393 | should be temporary. | |
28010a5d | 13394 | |
b4a5b78b | 13395 | FROM_TTY is the usual argument passed to all commands implementations. */ |
28010a5d | 13396 | |
349774ef | 13397 | void |
28010a5d | 13398 | create_ada_exception_catchpoint (struct gdbarch *gdbarch, |
761269c8 | 13399 | enum ada_exception_catchpoint_kind ex_kind, |
28010a5d | 13400 | char *excep_string, |
56ecd069 | 13401 | const std::string &cond_string, |
28010a5d | 13402 | int tempflag, |
349774ef | 13403 | int disabled, |
28010a5d PA |
13404 | int from_tty) |
13405 | { | |
f2fc3015 | 13406 | const char *addr_string = NULL; |
b4a5b78b JB |
13407 | const struct breakpoint_ops *ops = NULL; |
13408 | struct symtab_and_line sal | |
13409 | = ada_exception_sal (ex_kind, excep_string, &addr_string, &ops); | |
28010a5d | 13410 | |
b270e6f9 TT |
13411 | std::unique_ptr<ada_catchpoint> c (new ada_catchpoint ()); |
13412 | init_ada_exception_breakpoint (c.get (), gdbarch, sal, addr_string, | |
349774ef | 13413 | ops, tempflag, disabled, from_tty); |
28010a5d | 13414 | c->excep_string = excep_string; |
9f757bf7 | 13415 | create_excep_cond_exprs (c.get (), ex_kind); |
56ecd069 XR |
13416 | if (!cond_string.empty ()) |
13417 | set_breakpoint_condition (c.get (), cond_string.c_str (), from_tty); | |
b270e6f9 | 13418 | install_breakpoint (0, std::move (c), 1); |
f7f9143b JB |
13419 | } |
13420 | ||
9ac4176b PA |
13421 | /* Implement the "catch exception" command. */ |
13422 | ||
13423 | static void | |
eb4c3f4a | 13424 | catch_ada_exception_command (const char *arg_entry, int from_tty, |
9ac4176b PA |
13425 | struct cmd_list_element *command) |
13426 | { | |
a121b7c1 | 13427 | const char *arg = arg_entry; |
9ac4176b PA |
13428 | struct gdbarch *gdbarch = get_current_arch (); |
13429 | int tempflag; | |
761269c8 | 13430 | enum ada_exception_catchpoint_kind ex_kind; |
28010a5d | 13431 | char *excep_string = NULL; |
56ecd069 | 13432 | std::string cond_string; |
9ac4176b PA |
13433 | |
13434 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13435 | ||
13436 | if (!arg) | |
13437 | arg = ""; | |
9f757bf7 | 13438 | catch_ada_exception_command_split (arg, false, &ex_kind, &excep_string, |
56ecd069 | 13439 | cond_string); |
9f757bf7 XR |
13440 | create_ada_exception_catchpoint (gdbarch, ex_kind, |
13441 | excep_string, cond_string, | |
13442 | tempflag, 1 /* enabled */, | |
13443 | from_tty); | |
13444 | } | |
13445 | ||
13446 | /* Implement the "catch handlers" command. */ | |
13447 | ||
13448 | static void | |
13449 | catch_ada_handlers_command (const char *arg_entry, int from_tty, | |
13450 | struct cmd_list_element *command) | |
13451 | { | |
13452 | const char *arg = arg_entry; | |
13453 | struct gdbarch *gdbarch = get_current_arch (); | |
13454 | int tempflag; | |
13455 | enum ada_exception_catchpoint_kind ex_kind; | |
13456 | char *excep_string = NULL; | |
56ecd069 | 13457 | std::string cond_string; |
9f757bf7 XR |
13458 | |
13459 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13460 | ||
13461 | if (!arg) | |
13462 | arg = ""; | |
13463 | catch_ada_exception_command_split (arg, true, &ex_kind, &excep_string, | |
56ecd069 | 13464 | cond_string); |
b4a5b78b JB |
13465 | create_ada_exception_catchpoint (gdbarch, ex_kind, |
13466 | excep_string, cond_string, | |
349774ef JB |
13467 | tempflag, 1 /* enabled */, |
13468 | from_tty); | |
9ac4176b PA |
13469 | } |
13470 | ||
b4a5b78b | 13471 | /* Split the arguments specified in a "catch assert" command. |
5845583d | 13472 | |
b4a5b78b JB |
13473 | ARGS contains the command's arguments (or the empty string if |
13474 | no arguments were passed). | |
5845583d JB |
13475 | |
13476 | If ARGS contains a condition, set COND_STRING to that condition | |
b4a5b78b | 13477 | (the memory needs to be deallocated after use). */ |
5845583d | 13478 | |
b4a5b78b | 13479 | static void |
56ecd069 | 13480 | catch_ada_assert_command_split (const char *args, std::string &cond_string) |
f7f9143b | 13481 | { |
f1735a53 | 13482 | args = skip_spaces (args); |
f7f9143b | 13483 | |
5845583d | 13484 | /* Check whether a condition was provided. */ |
61012eef | 13485 | if (startswith (args, "if") |
5845583d | 13486 | && (isspace (args[2]) || args[2] == '\0')) |
f7f9143b | 13487 | { |
5845583d | 13488 | args += 2; |
f1735a53 | 13489 | args = skip_spaces (args); |
5845583d JB |
13490 | if (args[0] == '\0') |
13491 | error (_("condition missing after `if' keyword")); | |
56ecd069 | 13492 | cond_string.assign (args); |
f7f9143b JB |
13493 | } |
13494 | ||
5845583d JB |
13495 | /* Otherwise, there should be no other argument at the end of |
13496 | the command. */ | |
13497 | else if (args[0] != '\0') | |
13498 | error (_("Junk at end of arguments.")); | |
f7f9143b JB |
13499 | } |
13500 | ||
9ac4176b PA |
13501 | /* Implement the "catch assert" command. */ |
13502 | ||
13503 | static void | |
eb4c3f4a | 13504 | catch_assert_command (const char *arg_entry, int from_tty, |
9ac4176b PA |
13505 | struct cmd_list_element *command) |
13506 | { | |
a121b7c1 | 13507 | const char *arg = arg_entry; |
9ac4176b PA |
13508 | struct gdbarch *gdbarch = get_current_arch (); |
13509 | int tempflag; | |
56ecd069 | 13510 | std::string cond_string; |
9ac4176b PA |
13511 | |
13512 | tempflag = get_cmd_context (command) == CATCH_TEMPORARY; | |
13513 | ||
13514 | if (!arg) | |
13515 | arg = ""; | |
56ecd069 | 13516 | catch_ada_assert_command_split (arg, cond_string); |
761269c8 | 13517 | create_ada_exception_catchpoint (gdbarch, ada_catch_assert, |
b4a5b78b | 13518 | NULL, cond_string, |
349774ef JB |
13519 | tempflag, 1 /* enabled */, |
13520 | from_tty); | |
9ac4176b | 13521 | } |
778865d3 JB |
13522 | |
13523 | /* Return non-zero if the symbol SYM is an Ada exception object. */ | |
13524 | ||
13525 | static int | |
13526 | ada_is_exception_sym (struct symbol *sym) | |
13527 | { | |
13528 | const char *type_name = type_name_no_tag (SYMBOL_TYPE (sym)); | |
13529 | ||
13530 | return (SYMBOL_CLASS (sym) != LOC_TYPEDEF | |
13531 | && SYMBOL_CLASS (sym) != LOC_BLOCK | |
13532 | && SYMBOL_CLASS (sym) != LOC_CONST | |
13533 | && SYMBOL_CLASS (sym) != LOC_UNRESOLVED | |
13534 | && type_name != NULL && strcmp (type_name, "exception") == 0); | |
13535 | } | |
13536 | ||
13537 | /* Given a global symbol SYM, return non-zero iff SYM is a non-standard | |
13538 | Ada exception object. This matches all exceptions except the ones | |
13539 | defined by the Ada language. */ | |
13540 | ||
13541 | static int | |
13542 | ada_is_non_standard_exception_sym (struct symbol *sym) | |
13543 | { | |
13544 | int i; | |
13545 | ||
13546 | if (!ada_is_exception_sym (sym)) | |
13547 | return 0; | |
13548 | ||
13549 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13550 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), standard_exc[i]) == 0) | |
13551 | return 0; /* A standard exception. */ | |
13552 | ||
13553 | /* Numeric_Error is also a standard exception, so exclude it. | |
13554 | See the STANDARD_EXC description for more details as to why | |
13555 | this exception is not listed in that array. */ | |
13556 | if (strcmp (SYMBOL_LINKAGE_NAME (sym), "numeric_error") == 0) | |
13557 | return 0; | |
13558 | ||
13559 | return 1; | |
13560 | } | |
13561 | ||
ab816a27 | 13562 | /* A helper function for std::sort, comparing two struct ada_exc_info |
778865d3 JB |
13563 | objects. |
13564 | ||
13565 | The comparison is determined first by exception name, and then | |
13566 | by exception address. */ | |
13567 | ||
ab816a27 | 13568 | bool |
cc536b21 | 13569 | ada_exc_info::operator< (const ada_exc_info &other) const |
778865d3 | 13570 | { |
778865d3 JB |
13571 | int result; |
13572 | ||
ab816a27 TT |
13573 | result = strcmp (name, other.name); |
13574 | if (result < 0) | |
13575 | return true; | |
13576 | if (result == 0 && addr < other.addr) | |
13577 | return true; | |
13578 | return false; | |
13579 | } | |
778865d3 | 13580 | |
ab816a27 | 13581 | bool |
cc536b21 | 13582 | ada_exc_info::operator== (const ada_exc_info &other) const |
ab816a27 TT |
13583 | { |
13584 | return addr == other.addr && strcmp (name, other.name) == 0; | |
778865d3 JB |
13585 | } |
13586 | ||
13587 | /* Sort EXCEPTIONS using compare_ada_exception_info as the comparison | |
13588 | routine, but keeping the first SKIP elements untouched. | |
13589 | ||
13590 | All duplicates are also removed. */ | |
13591 | ||
13592 | static void | |
ab816a27 | 13593 | sort_remove_dups_ada_exceptions_list (std::vector<ada_exc_info> *exceptions, |
778865d3 JB |
13594 | int skip) |
13595 | { | |
ab816a27 TT |
13596 | std::sort (exceptions->begin () + skip, exceptions->end ()); |
13597 | exceptions->erase (std::unique (exceptions->begin () + skip, exceptions->end ()), | |
13598 | exceptions->end ()); | |
778865d3 JB |
13599 | } |
13600 | ||
778865d3 JB |
13601 | /* Add all exceptions defined by the Ada standard whose name match |
13602 | a regular expression. | |
13603 | ||
13604 | If PREG is not NULL, then this regexp_t object is used to | |
13605 | perform the symbol name matching. Otherwise, no name-based | |
13606 | filtering is performed. | |
13607 | ||
13608 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13609 | gets pushed. */ | |
13610 | ||
13611 | static void | |
2d7cc5c7 | 13612 | ada_add_standard_exceptions (compiled_regex *preg, |
ab816a27 | 13613 | std::vector<ada_exc_info> *exceptions) |
778865d3 JB |
13614 | { |
13615 | int i; | |
13616 | ||
13617 | for (i = 0; i < ARRAY_SIZE (standard_exc); i++) | |
13618 | { | |
13619 | if (preg == NULL | |
2d7cc5c7 | 13620 | || preg->exec (standard_exc[i], 0, NULL, 0) == 0) |
778865d3 JB |
13621 | { |
13622 | struct bound_minimal_symbol msymbol | |
13623 | = ada_lookup_simple_minsym (standard_exc[i]); | |
13624 | ||
13625 | if (msymbol.minsym != NULL) | |
13626 | { | |
13627 | struct ada_exc_info info | |
77e371c0 | 13628 | = {standard_exc[i], BMSYMBOL_VALUE_ADDRESS (msymbol)}; |
778865d3 | 13629 | |
ab816a27 | 13630 | exceptions->push_back (info); |
778865d3 JB |
13631 | } |
13632 | } | |
13633 | } | |
13634 | } | |
13635 | ||
13636 | /* Add all Ada exceptions defined locally and accessible from the given | |
13637 | FRAME. | |
13638 | ||
13639 | If PREG is not NULL, then this regexp_t object is used to | |
13640 | perform the symbol name matching. Otherwise, no name-based | |
13641 | filtering is performed. | |
13642 | ||
13643 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13644 | gets pushed. */ | |
13645 | ||
13646 | static void | |
2d7cc5c7 PA |
13647 | ada_add_exceptions_from_frame (compiled_regex *preg, |
13648 | struct frame_info *frame, | |
ab816a27 | 13649 | std::vector<ada_exc_info> *exceptions) |
778865d3 | 13650 | { |
3977b71f | 13651 | const struct block *block = get_frame_block (frame, 0); |
778865d3 JB |
13652 | |
13653 | while (block != 0) | |
13654 | { | |
13655 | struct block_iterator iter; | |
13656 | struct symbol *sym; | |
13657 | ||
13658 | ALL_BLOCK_SYMBOLS (block, iter, sym) | |
13659 | { | |
13660 | switch (SYMBOL_CLASS (sym)) | |
13661 | { | |
13662 | case LOC_TYPEDEF: | |
13663 | case LOC_BLOCK: | |
13664 | case LOC_CONST: | |
13665 | break; | |
13666 | default: | |
13667 | if (ada_is_exception_sym (sym)) | |
13668 | { | |
13669 | struct ada_exc_info info = {SYMBOL_PRINT_NAME (sym), | |
13670 | SYMBOL_VALUE_ADDRESS (sym)}; | |
13671 | ||
ab816a27 | 13672 | exceptions->push_back (info); |
778865d3 JB |
13673 | } |
13674 | } | |
13675 | } | |
13676 | if (BLOCK_FUNCTION (block) != NULL) | |
13677 | break; | |
13678 | block = BLOCK_SUPERBLOCK (block); | |
13679 | } | |
13680 | } | |
13681 | ||
14bc53a8 PA |
13682 | /* Return true if NAME matches PREG or if PREG is NULL. */ |
13683 | ||
13684 | static bool | |
2d7cc5c7 | 13685 | name_matches_regex (const char *name, compiled_regex *preg) |
14bc53a8 PA |
13686 | { |
13687 | return (preg == NULL | |
2d7cc5c7 | 13688 | || preg->exec (ada_decode (name), 0, NULL, 0) == 0); |
14bc53a8 PA |
13689 | } |
13690 | ||
778865d3 JB |
13691 | /* Add all exceptions defined globally whose name name match |
13692 | a regular expression, excluding standard exceptions. | |
13693 | ||
13694 | The reason we exclude standard exceptions is that they need | |
13695 | to be handled separately: Standard exceptions are defined inside | |
13696 | a runtime unit which is normally not compiled with debugging info, | |
13697 | and thus usually do not show up in our symbol search. However, | |
13698 | if the unit was in fact built with debugging info, we need to | |
13699 | exclude them because they would duplicate the entry we found | |
13700 | during the special loop that specifically searches for those | |
13701 | standard exceptions. | |
13702 | ||
13703 | If PREG is not NULL, then this regexp_t object is used to | |
13704 | perform the symbol name matching. Otherwise, no name-based | |
13705 | filtering is performed. | |
13706 | ||
13707 | EXCEPTIONS is a vector of exceptions to which matching exceptions | |
13708 | gets pushed. */ | |
13709 | ||
13710 | static void | |
2d7cc5c7 | 13711 | ada_add_global_exceptions (compiled_regex *preg, |
ab816a27 | 13712 | std::vector<ada_exc_info> *exceptions) |
778865d3 JB |
13713 | { |
13714 | struct objfile *objfile; | |
43f3e411 | 13715 | struct compunit_symtab *s; |
778865d3 | 13716 | |
14bc53a8 PA |
13717 | /* In Ada, the symbol "search name" is a linkage name, whereas the |
13718 | regular expression used to do the matching refers to the natural | |
13719 | name. So match against the decoded name. */ | |
13720 | expand_symtabs_matching (NULL, | |
b5ec771e | 13721 | lookup_name_info::match_any (), |
14bc53a8 PA |
13722 | [&] (const char *search_name) |
13723 | { | |
13724 | const char *decoded = ada_decode (search_name); | |
13725 | return name_matches_regex (decoded, preg); | |
13726 | }, | |
13727 | NULL, | |
13728 | VARIABLES_DOMAIN); | |
778865d3 | 13729 | |
43f3e411 | 13730 | ALL_COMPUNITS (objfile, s) |
778865d3 | 13731 | { |
43f3e411 | 13732 | const struct blockvector *bv = COMPUNIT_BLOCKVECTOR (s); |
778865d3 JB |
13733 | int i; |
13734 | ||
13735 | for (i = GLOBAL_BLOCK; i <= STATIC_BLOCK; i++) | |
13736 | { | |
13737 | struct block *b = BLOCKVECTOR_BLOCK (bv, i); | |
13738 | struct block_iterator iter; | |
13739 | struct symbol *sym; | |
13740 | ||
13741 | ALL_BLOCK_SYMBOLS (b, iter, sym) | |
13742 | if (ada_is_non_standard_exception_sym (sym) | |
14bc53a8 | 13743 | && name_matches_regex (SYMBOL_NATURAL_NAME (sym), preg)) |
778865d3 JB |
13744 | { |
13745 | struct ada_exc_info info | |
13746 | = {SYMBOL_PRINT_NAME (sym), SYMBOL_VALUE_ADDRESS (sym)}; | |
13747 | ||
ab816a27 | 13748 | exceptions->push_back (info); |
778865d3 JB |
13749 | } |
13750 | } | |
13751 | } | |
13752 | } | |
13753 | ||
13754 | /* Implements ada_exceptions_list with the regular expression passed | |
13755 | as a regex_t, rather than a string. | |
13756 | ||
13757 | If not NULL, PREG is used to filter out exceptions whose names | |
13758 | do not match. Otherwise, all exceptions are listed. */ | |
13759 | ||
ab816a27 | 13760 | static std::vector<ada_exc_info> |
2d7cc5c7 | 13761 | ada_exceptions_list_1 (compiled_regex *preg) |
778865d3 | 13762 | { |
ab816a27 | 13763 | std::vector<ada_exc_info> result; |
778865d3 JB |
13764 | int prev_len; |
13765 | ||
13766 | /* First, list the known standard exceptions. These exceptions | |
13767 | need to be handled separately, as they are usually defined in | |
13768 | runtime units that have been compiled without debugging info. */ | |
13769 | ||
13770 | ada_add_standard_exceptions (preg, &result); | |
13771 | ||
13772 | /* Next, find all exceptions whose scope is local and accessible | |
13773 | from the currently selected frame. */ | |
13774 | ||
13775 | if (has_stack_frames ()) | |
13776 | { | |
ab816a27 | 13777 | prev_len = result.size (); |
778865d3 JB |
13778 | ada_add_exceptions_from_frame (preg, get_selected_frame (NULL), |
13779 | &result); | |
ab816a27 | 13780 | if (result.size () > prev_len) |
778865d3 JB |
13781 | sort_remove_dups_ada_exceptions_list (&result, prev_len); |
13782 | } | |
13783 | ||
13784 | /* Add all exceptions whose scope is global. */ | |
13785 | ||
ab816a27 | 13786 | prev_len = result.size (); |
778865d3 | 13787 | ada_add_global_exceptions (preg, &result); |
ab816a27 | 13788 | if (result.size () > prev_len) |
778865d3 JB |
13789 | sort_remove_dups_ada_exceptions_list (&result, prev_len); |
13790 | ||
778865d3 JB |
13791 | return result; |
13792 | } | |
13793 | ||
13794 | /* Return a vector of ada_exc_info. | |
13795 | ||
13796 | If REGEXP is NULL, all exceptions are included in the result. | |
13797 | Otherwise, it should contain a valid regular expression, | |
13798 | and only the exceptions whose names match that regular expression | |
13799 | are included in the result. | |
13800 | ||
13801 | The exceptions are sorted in the following order: | |
13802 | - Standard exceptions (defined by the Ada language), in | |
13803 | alphabetical order; | |
13804 | - Exceptions only visible from the current frame, in | |
13805 | alphabetical order; | |
13806 | - Exceptions whose scope is global, in alphabetical order. */ | |
13807 | ||
ab816a27 | 13808 | std::vector<ada_exc_info> |
778865d3 JB |
13809 | ada_exceptions_list (const char *regexp) |
13810 | { | |
2d7cc5c7 PA |
13811 | if (regexp == NULL) |
13812 | return ada_exceptions_list_1 (NULL); | |
778865d3 | 13813 | |
2d7cc5c7 PA |
13814 | compiled_regex reg (regexp, REG_NOSUB, _("invalid regular expression")); |
13815 | return ada_exceptions_list_1 (®); | |
778865d3 JB |
13816 | } |
13817 | ||
13818 | /* Implement the "info exceptions" command. */ | |
13819 | ||
13820 | static void | |
1d12d88f | 13821 | info_exceptions_command (const char *regexp, int from_tty) |
778865d3 | 13822 | { |
778865d3 | 13823 | struct gdbarch *gdbarch = get_current_arch (); |
778865d3 | 13824 | |
ab816a27 | 13825 | std::vector<ada_exc_info> exceptions = ada_exceptions_list (regexp); |
778865d3 JB |
13826 | |
13827 | if (regexp != NULL) | |
13828 | printf_filtered | |
13829 | (_("All Ada exceptions matching regular expression \"%s\":\n"), regexp); | |
13830 | else | |
13831 | printf_filtered (_("All defined Ada exceptions:\n")); | |
13832 | ||
ab816a27 TT |
13833 | for (const ada_exc_info &info : exceptions) |
13834 | printf_filtered ("%s: %s\n", info.name, paddress (gdbarch, info.addr)); | |
778865d3 JB |
13835 | } |
13836 | ||
4c4b4cd2 PH |
13837 | /* Operators */ |
13838 | /* Information about operators given special treatment in functions | |
13839 | below. */ | |
13840 | /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */ | |
13841 | ||
13842 | #define ADA_OPERATORS \ | |
13843 | OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \ | |
13844 | OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \ | |
13845 | OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \ | |
13846 | OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \ | |
13847 | OP_DEFN (OP_ATR_LAST, 1, 2, 0) \ | |
13848 | OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \ | |
13849 | OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \ | |
13850 | OP_DEFN (OP_ATR_MAX, 1, 3, 0) \ | |
13851 | OP_DEFN (OP_ATR_MIN, 1, 3, 0) \ | |
13852 | OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \ | |
13853 | OP_DEFN (OP_ATR_POS, 1, 2, 0) \ | |
13854 | OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \ | |
13855 | OP_DEFN (OP_ATR_TAG, 1, 1, 0) \ | |
13856 | OP_DEFN (OP_ATR_VAL, 1, 2, 0) \ | |
13857 | OP_DEFN (UNOP_QUAL, 3, 1, 0) \ | |
52ce6436 PH |
13858 | OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \ |
13859 | OP_DEFN (OP_OTHERS, 1, 1, 0) \ | |
13860 | OP_DEFN (OP_POSITIONAL, 3, 1, 0) \ | |
13861 | OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0) | |
4c4b4cd2 PH |
13862 | |
13863 | static void | |
554794dc SDJ |
13864 | ada_operator_length (const struct expression *exp, int pc, int *oplenp, |
13865 | int *argsp) | |
4c4b4cd2 PH |
13866 | { |
13867 | switch (exp->elts[pc - 1].opcode) | |
13868 | { | |
76a01679 | 13869 | default: |
4c4b4cd2 PH |
13870 | operator_length_standard (exp, pc, oplenp, argsp); |
13871 | break; | |
13872 | ||
13873 | #define OP_DEFN(op, len, args, binop) \ | |
13874 | case op: *oplenp = len; *argsp = args; break; | |
13875 | ADA_OPERATORS; | |
13876 | #undef OP_DEFN | |
52ce6436 PH |
13877 | |
13878 | case OP_AGGREGATE: | |
13879 | *oplenp = 3; | |
13880 | *argsp = longest_to_int (exp->elts[pc - 2].longconst); | |
13881 | break; | |
13882 | ||
13883 | case OP_CHOICES: | |
13884 | *oplenp = 3; | |
13885 | *argsp = longest_to_int (exp->elts[pc - 2].longconst) + 1; | |
13886 | break; | |
4c4b4cd2 PH |
13887 | } |
13888 | } | |
13889 | ||
c0201579 JK |
13890 | /* Implementation of the exp_descriptor method operator_check. */ |
13891 | ||
13892 | static int | |
13893 | ada_operator_check (struct expression *exp, int pos, | |
13894 | int (*objfile_func) (struct objfile *objfile, void *data), | |
13895 | void *data) | |
13896 | { | |
13897 | const union exp_element *const elts = exp->elts; | |
13898 | struct type *type = NULL; | |
13899 | ||
13900 | switch (elts[pos].opcode) | |
13901 | { | |
13902 | case UNOP_IN_RANGE: | |
13903 | case UNOP_QUAL: | |
13904 | type = elts[pos + 1].type; | |
13905 | break; | |
13906 | ||
13907 | default: | |
13908 | return operator_check_standard (exp, pos, objfile_func, data); | |
13909 | } | |
13910 | ||
13911 | /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */ | |
13912 | ||
13913 | if (type && TYPE_OBJFILE (type) | |
13914 | && (*objfile_func) (TYPE_OBJFILE (type), data)) | |
13915 | return 1; | |
13916 | ||
13917 | return 0; | |
13918 | } | |
13919 | ||
a121b7c1 | 13920 | static const char * |
4c4b4cd2 PH |
13921 | ada_op_name (enum exp_opcode opcode) |
13922 | { | |
13923 | switch (opcode) | |
13924 | { | |
76a01679 | 13925 | default: |
4c4b4cd2 | 13926 | return op_name_standard (opcode); |
52ce6436 | 13927 | |
4c4b4cd2 PH |
13928 | #define OP_DEFN(op, len, args, binop) case op: return #op; |
13929 | ADA_OPERATORS; | |
13930 | #undef OP_DEFN | |
52ce6436 PH |
13931 | |
13932 | case OP_AGGREGATE: | |
13933 | return "OP_AGGREGATE"; | |
13934 | case OP_CHOICES: | |
13935 | return "OP_CHOICES"; | |
13936 | case OP_NAME: | |
13937 | return "OP_NAME"; | |
4c4b4cd2 PH |
13938 | } |
13939 | } | |
13940 | ||
13941 | /* As for operator_length, but assumes PC is pointing at the first | |
13942 | element of the operator, and gives meaningful results only for the | |
52ce6436 | 13943 | Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */ |
4c4b4cd2 PH |
13944 | |
13945 | static void | |
76a01679 JB |
13946 | ada_forward_operator_length (struct expression *exp, int pc, |
13947 | int *oplenp, int *argsp) | |
4c4b4cd2 | 13948 | { |
76a01679 | 13949 | switch (exp->elts[pc].opcode) |
4c4b4cd2 PH |
13950 | { |
13951 | default: | |
13952 | *oplenp = *argsp = 0; | |
13953 | break; | |
52ce6436 | 13954 | |
4c4b4cd2 PH |
13955 | #define OP_DEFN(op, len, args, binop) \ |
13956 | case op: *oplenp = len; *argsp = args; break; | |
13957 | ADA_OPERATORS; | |
13958 | #undef OP_DEFN | |
52ce6436 PH |
13959 | |
13960 | case OP_AGGREGATE: | |
13961 | *oplenp = 3; | |
13962 | *argsp = longest_to_int (exp->elts[pc + 1].longconst); | |
13963 | break; | |
13964 | ||
13965 | case OP_CHOICES: | |
13966 | *oplenp = 3; | |
13967 | *argsp = longest_to_int (exp->elts[pc + 1].longconst) + 1; | |
13968 | break; | |
13969 | ||
13970 | case OP_STRING: | |
13971 | case OP_NAME: | |
13972 | { | |
13973 | int len = longest_to_int (exp->elts[pc + 1].longconst); | |
5b4ee69b | 13974 | |
52ce6436 PH |
13975 | *oplenp = 4 + BYTES_TO_EXP_ELEM (len + 1); |
13976 | *argsp = 0; | |
13977 | break; | |
13978 | } | |
4c4b4cd2 PH |
13979 | } |
13980 | } | |
13981 | ||
13982 | static int | |
13983 | ada_dump_subexp_body (struct expression *exp, struct ui_file *stream, int elt) | |
13984 | { | |
13985 | enum exp_opcode op = exp->elts[elt].opcode; | |
13986 | int oplen, nargs; | |
13987 | int pc = elt; | |
13988 | int i; | |
76a01679 | 13989 | |
4c4b4cd2 PH |
13990 | ada_forward_operator_length (exp, elt, &oplen, &nargs); |
13991 | ||
76a01679 | 13992 | switch (op) |
4c4b4cd2 | 13993 | { |
76a01679 | 13994 | /* Ada attributes ('Foo). */ |
4c4b4cd2 PH |
13995 | case OP_ATR_FIRST: |
13996 | case OP_ATR_LAST: | |
13997 | case OP_ATR_LENGTH: | |
13998 | case OP_ATR_IMAGE: | |
13999 | case OP_ATR_MAX: | |
14000 | case OP_ATR_MIN: | |
14001 | case OP_ATR_MODULUS: | |
14002 | case OP_ATR_POS: | |
14003 | case OP_ATR_SIZE: | |
14004 | case OP_ATR_TAG: | |
14005 | case OP_ATR_VAL: | |
14006 | break; | |
14007 | ||
14008 | case UNOP_IN_RANGE: | |
14009 | case UNOP_QUAL: | |
323e0a4a AC |
14010 | /* XXX: gdb_sprint_host_address, type_sprint */ |
14011 | fprintf_filtered (stream, _("Type @")); | |
4c4b4cd2 PH |
14012 | gdb_print_host_address (exp->elts[pc + 1].type, stream); |
14013 | fprintf_filtered (stream, " ("); | |
14014 | type_print (exp->elts[pc + 1].type, NULL, stream, 0); | |
14015 | fprintf_filtered (stream, ")"); | |
14016 | break; | |
14017 | case BINOP_IN_BOUNDS: | |
52ce6436 PH |
14018 | fprintf_filtered (stream, " (%d)", |
14019 | longest_to_int (exp->elts[pc + 2].longconst)); | |
4c4b4cd2 PH |
14020 | break; |
14021 | case TERNOP_IN_RANGE: | |
14022 | break; | |
14023 | ||
52ce6436 PH |
14024 | case OP_AGGREGATE: |
14025 | case OP_OTHERS: | |
14026 | case OP_DISCRETE_RANGE: | |
14027 | case OP_POSITIONAL: | |
14028 | case OP_CHOICES: | |
14029 | break; | |
14030 | ||
14031 | case OP_NAME: | |
14032 | case OP_STRING: | |
14033 | { | |
14034 | char *name = &exp->elts[elt + 2].string; | |
14035 | int len = longest_to_int (exp->elts[elt + 1].longconst); | |
5b4ee69b | 14036 | |
52ce6436 PH |
14037 | fprintf_filtered (stream, "Text: `%.*s'", len, name); |
14038 | break; | |
14039 | } | |
14040 | ||
4c4b4cd2 PH |
14041 | default: |
14042 | return dump_subexp_body_standard (exp, stream, elt); | |
14043 | } | |
14044 | ||
14045 | elt += oplen; | |
14046 | for (i = 0; i < nargs; i += 1) | |
14047 | elt = dump_subexp (exp, stream, elt); | |
14048 | ||
14049 | return elt; | |
14050 | } | |
14051 | ||
14052 | /* The Ada extension of print_subexp (q.v.). */ | |
14053 | ||
76a01679 JB |
14054 | static void |
14055 | ada_print_subexp (struct expression *exp, int *pos, | |
14056 | struct ui_file *stream, enum precedence prec) | |
4c4b4cd2 | 14057 | { |
52ce6436 | 14058 | int oplen, nargs, i; |
4c4b4cd2 PH |
14059 | int pc = *pos; |
14060 | enum exp_opcode op = exp->elts[pc].opcode; | |
14061 | ||
14062 | ada_forward_operator_length (exp, pc, &oplen, &nargs); | |
14063 | ||
52ce6436 | 14064 | *pos += oplen; |
4c4b4cd2 PH |
14065 | switch (op) |
14066 | { | |
14067 | default: | |
52ce6436 | 14068 | *pos -= oplen; |
4c4b4cd2 PH |
14069 | print_subexp_standard (exp, pos, stream, prec); |
14070 | return; | |
14071 | ||
14072 | case OP_VAR_VALUE: | |
4c4b4cd2 PH |
14073 | fputs_filtered (SYMBOL_NATURAL_NAME (exp->elts[pc + 2].symbol), stream); |
14074 | return; | |
14075 | ||
14076 | case BINOP_IN_BOUNDS: | |
323e0a4a | 14077 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 14078 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 14079 | fputs_filtered (" in ", stream); |
4c4b4cd2 | 14080 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 14081 | fputs_filtered ("'range", stream); |
4c4b4cd2 | 14082 | if (exp->elts[pc + 1].longconst > 1) |
76a01679 JB |
14083 | fprintf_filtered (stream, "(%ld)", |
14084 | (long) exp->elts[pc + 1].longconst); | |
4c4b4cd2 PH |
14085 | return; |
14086 | ||
14087 | case TERNOP_IN_RANGE: | |
4c4b4cd2 | 14088 | if (prec >= PREC_EQUAL) |
76a01679 | 14089 | fputs_filtered ("(", stream); |
323e0a4a | 14090 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 14091 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 14092 | fputs_filtered (" in ", stream); |
4c4b4cd2 PH |
14093 | print_subexp (exp, pos, stream, PREC_EQUAL); |
14094 | fputs_filtered (" .. ", stream); | |
14095 | print_subexp (exp, pos, stream, PREC_EQUAL); | |
14096 | if (prec >= PREC_EQUAL) | |
76a01679 JB |
14097 | fputs_filtered (")", stream); |
14098 | return; | |
4c4b4cd2 PH |
14099 | |
14100 | case OP_ATR_FIRST: | |
14101 | case OP_ATR_LAST: | |
14102 | case OP_ATR_LENGTH: | |
14103 | case OP_ATR_IMAGE: | |
14104 | case OP_ATR_MAX: | |
14105 | case OP_ATR_MIN: | |
14106 | case OP_ATR_MODULUS: | |
14107 | case OP_ATR_POS: | |
14108 | case OP_ATR_SIZE: | |
14109 | case OP_ATR_TAG: | |
14110 | case OP_ATR_VAL: | |
4c4b4cd2 | 14111 | if (exp->elts[*pos].opcode == OP_TYPE) |
76a01679 JB |
14112 | { |
14113 | if (TYPE_CODE (exp->elts[*pos + 1].type) != TYPE_CODE_VOID) | |
79d43c61 TT |
14114 | LA_PRINT_TYPE (exp->elts[*pos + 1].type, "", stream, 0, 0, |
14115 | &type_print_raw_options); | |
76a01679 JB |
14116 | *pos += 3; |
14117 | } | |
4c4b4cd2 | 14118 | else |
76a01679 | 14119 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
4c4b4cd2 PH |
14120 | fprintf_filtered (stream, "'%s", ada_attribute_name (op)); |
14121 | if (nargs > 1) | |
76a01679 JB |
14122 | { |
14123 | int tem; | |
5b4ee69b | 14124 | |
76a01679 JB |
14125 | for (tem = 1; tem < nargs; tem += 1) |
14126 | { | |
14127 | fputs_filtered ((tem == 1) ? " (" : ", ", stream); | |
14128 | print_subexp (exp, pos, stream, PREC_ABOVE_COMMA); | |
14129 | } | |
14130 | fputs_filtered (")", stream); | |
14131 | } | |
4c4b4cd2 | 14132 | return; |
14f9c5c9 | 14133 | |
4c4b4cd2 | 14134 | case UNOP_QUAL: |
4c4b4cd2 PH |
14135 | type_print (exp->elts[pc + 1].type, "", stream, 0); |
14136 | fputs_filtered ("'(", stream); | |
14137 | print_subexp (exp, pos, stream, PREC_PREFIX); | |
14138 | fputs_filtered (")", stream); | |
14139 | return; | |
14f9c5c9 | 14140 | |
4c4b4cd2 | 14141 | case UNOP_IN_RANGE: |
323e0a4a | 14142 | /* XXX: sprint_subexp */ |
4c4b4cd2 | 14143 | print_subexp (exp, pos, stream, PREC_SUFFIX); |
0b48a291 | 14144 | fputs_filtered (" in ", stream); |
79d43c61 TT |
14145 | LA_PRINT_TYPE (exp->elts[pc + 1].type, "", stream, 1, 0, |
14146 | &type_print_raw_options); | |
4c4b4cd2 | 14147 | return; |
52ce6436 PH |
14148 | |
14149 | case OP_DISCRETE_RANGE: | |
14150 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14151 | fputs_filtered ("..", stream); | |
14152 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14153 | return; | |
14154 | ||
14155 | case OP_OTHERS: | |
14156 | fputs_filtered ("others => ", stream); | |
14157 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14158 | return; | |
14159 | ||
14160 | case OP_CHOICES: | |
14161 | for (i = 0; i < nargs-1; i += 1) | |
14162 | { | |
14163 | if (i > 0) | |
14164 | fputs_filtered ("|", stream); | |
14165 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14166 | } | |
14167 | fputs_filtered (" => ", stream); | |
14168 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14169 | return; | |
14170 | ||
14171 | case OP_POSITIONAL: | |
14172 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14173 | return; | |
14174 | ||
14175 | case OP_AGGREGATE: | |
14176 | fputs_filtered ("(", stream); | |
14177 | for (i = 0; i < nargs; i += 1) | |
14178 | { | |
14179 | if (i > 0) | |
14180 | fputs_filtered (", ", stream); | |
14181 | print_subexp (exp, pos, stream, PREC_SUFFIX); | |
14182 | } | |
14183 | fputs_filtered (")", stream); | |
14184 | return; | |
4c4b4cd2 PH |
14185 | } |
14186 | } | |
14f9c5c9 AS |
14187 | |
14188 | /* Table mapping opcodes into strings for printing operators | |
14189 | and precedences of the operators. */ | |
14190 | ||
d2e4a39e AS |
14191 | static const struct op_print ada_op_print_tab[] = { |
14192 | {":=", BINOP_ASSIGN, PREC_ASSIGN, 1}, | |
14193 | {"or else", BINOP_LOGICAL_OR, PREC_LOGICAL_OR, 0}, | |
14194 | {"and then", BINOP_LOGICAL_AND, PREC_LOGICAL_AND, 0}, | |
14195 | {"or", BINOP_BITWISE_IOR, PREC_BITWISE_IOR, 0}, | |
14196 | {"xor", BINOP_BITWISE_XOR, PREC_BITWISE_XOR, 0}, | |
14197 | {"and", BINOP_BITWISE_AND, PREC_BITWISE_AND, 0}, | |
14198 | {"=", BINOP_EQUAL, PREC_EQUAL, 0}, | |
14199 | {"/=", BINOP_NOTEQUAL, PREC_EQUAL, 0}, | |
14200 | {"<=", BINOP_LEQ, PREC_ORDER, 0}, | |
14201 | {">=", BINOP_GEQ, PREC_ORDER, 0}, | |
14202 | {">", BINOP_GTR, PREC_ORDER, 0}, | |
14203 | {"<", BINOP_LESS, PREC_ORDER, 0}, | |
14204 | {">>", BINOP_RSH, PREC_SHIFT, 0}, | |
14205 | {"<<", BINOP_LSH, PREC_SHIFT, 0}, | |
14206 | {"+", BINOP_ADD, PREC_ADD, 0}, | |
14207 | {"-", BINOP_SUB, PREC_ADD, 0}, | |
14208 | {"&", BINOP_CONCAT, PREC_ADD, 0}, | |
14209 | {"*", BINOP_MUL, PREC_MUL, 0}, | |
14210 | {"/", BINOP_DIV, PREC_MUL, 0}, | |
14211 | {"rem", BINOP_REM, PREC_MUL, 0}, | |
14212 | {"mod", BINOP_MOD, PREC_MUL, 0}, | |
14213 | {"**", BINOP_EXP, PREC_REPEAT, 0}, | |
14214 | {"@", BINOP_REPEAT, PREC_REPEAT, 0}, | |
14215 | {"-", UNOP_NEG, PREC_PREFIX, 0}, | |
14216 | {"+", UNOP_PLUS, PREC_PREFIX, 0}, | |
14217 | {"not ", UNOP_LOGICAL_NOT, PREC_PREFIX, 0}, | |
14218 | {"not ", UNOP_COMPLEMENT, PREC_PREFIX, 0}, | |
14219 | {"abs ", UNOP_ABS, PREC_PREFIX, 0}, | |
4c4b4cd2 PH |
14220 | {".all", UNOP_IND, PREC_SUFFIX, 1}, |
14221 | {"'access", UNOP_ADDR, PREC_SUFFIX, 1}, | |
14222 | {"'size", OP_ATR_SIZE, PREC_SUFFIX, 1}, | |
f486487f | 14223 | {NULL, OP_NULL, PREC_SUFFIX, 0} |
14f9c5c9 AS |
14224 | }; |
14225 | \f | |
72d5681a PH |
14226 | enum ada_primitive_types { |
14227 | ada_primitive_type_int, | |
14228 | ada_primitive_type_long, | |
14229 | ada_primitive_type_short, | |
14230 | ada_primitive_type_char, | |
14231 | ada_primitive_type_float, | |
14232 | ada_primitive_type_double, | |
14233 | ada_primitive_type_void, | |
14234 | ada_primitive_type_long_long, | |
14235 | ada_primitive_type_long_double, | |
14236 | ada_primitive_type_natural, | |
14237 | ada_primitive_type_positive, | |
14238 | ada_primitive_type_system_address, | |
08f49010 | 14239 | ada_primitive_type_storage_offset, |
72d5681a PH |
14240 | nr_ada_primitive_types |
14241 | }; | |
6c038f32 PH |
14242 | |
14243 | static void | |
d4a9a881 | 14244 | ada_language_arch_info (struct gdbarch *gdbarch, |
72d5681a PH |
14245 | struct language_arch_info *lai) |
14246 | { | |
d4a9a881 | 14247 | const struct builtin_type *builtin = builtin_type (gdbarch); |
5b4ee69b | 14248 | |
72d5681a | 14249 | lai->primitive_type_vector |
d4a9a881 | 14250 | = GDBARCH_OBSTACK_CALLOC (gdbarch, nr_ada_primitive_types + 1, |
72d5681a | 14251 | struct type *); |
e9bb382b UW |
14252 | |
14253 | lai->primitive_type_vector [ada_primitive_type_int] | |
14254 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14255 | 0, "integer"); | |
14256 | lai->primitive_type_vector [ada_primitive_type_long] | |
14257 | = arch_integer_type (gdbarch, gdbarch_long_bit (gdbarch), | |
14258 | 0, "long_integer"); | |
14259 | lai->primitive_type_vector [ada_primitive_type_short] | |
14260 | = arch_integer_type (gdbarch, gdbarch_short_bit (gdbarch), | |
14261 | 0, "short_integer"); | |
14262 | lai->string_char_type | |
14263 | = lai->primitive_type_vector [ada_primitive_type_char] | |
cd7c1778 | 14264 | = arch_character_type (gdbarch, TARGET_CHAR_BIT, 0, "character"); |
e9bb382b UW |
14265 | lai->primitive_type_vector [ada_primitive_type_float] |
14266 | = arch_float_type (gdbarch, gdbarch_float_bit (gdbarch), | |
49f190bc | 14267 | "float", gdbarch_float_format (gdbarch)); |
e9bb382b UW |
14268 | lai->primitive_type_vector [ada_primitive_type_double] |
14269 | = arch_float_type (gdbarch, gdbarch_double_bit (gdbarch), | |
49f190bc | 14270 | "long_float", gdbarch_double_format (gdbarch)); |
e9bb382b UW |
14271 | lai->primitive_type_vector [ada_primitive_type_long_long] |
14272 | = arch_integer_type (gdbarch, gdbarch_long_long_bit (gdbarch), | |
14273 | 0, "long_long_integer"); | |
14274 | lai->primitive_type_vector [ada_primitive_type_long_double] | |
5f3bceb6 | 14275 | = arch_float_type (gdbarch, gdbarch_long_double_bit (gdbarch), |
49f190bc | 14276 | "long_long_float", gdbarch_long_double_format (gdbarch)); |
e9bb382b UW |
14277 | lai->primitive_type_vector [ada_primitive_type_natural] |
14278 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14279 | 0, "natural"); | |
14280 | lai->primitive_type_vector [ada_primitive_type_positive] | |
14281 | = arch_integer_type (gdbarch, gdbarch_int_bit (gdbarch), | |
14282 | 0, "positive"); | |
14283 | lai->primitive_type_vector [ada_primitive_type_void] | |
14284 | = builtin->builtin_void; | |
14285 | ||
14286 | lai->primitive_type_vector [ada_primitive_type_system_address] | |
77b7c781 UW |
14287 | = lookup_pointer_type (arch_type (gdbarch, TYPE_CODE_VOID, TARGET_CHAR_BIT, |
14288 | "void")); | |
72d5681a PH |
14289 | TYPE_NAME (lai->primitive_type_vector [ada_primitive_type_system_address]) |
14290 | = "system__address"; | |
fbb06eb1 | 14291 | |
08f49010 XR |
14292 | /* Create the equivalent of the System.Storage_Elements.Storage_Offset |
14293 | type. This is a signed integral type whose size is the same as | |
14294 | the size of addresses. */ | |
14295 | { | |
14296 | unsigned int addr_length = TYPE_LENGTH | |
14297 | (lai->primitive_type_vector [ada_primitive_type_system_address]); | |
14298 | ||
14299 | lai->primitive_type_vector [ada_primitive_type_storage_offset] | |
14300 | = arch_integer_type (gdbarch, addr_length * HOST_CHAR_BIT, 0, | |
14301 | "storage_offset"); | |
14302 | } | |
14303 | ||
47e729a8 | 14304 | lai->bool_type_symbol = NULL; |
fbb06eb1 | 14305 | lai->bool_type_default = builtin->builtin_bool; |
6c038f32 | 14306 | } |
6c038f32 PH |
14307 | \f |
14308 | /* Language vector */ | |
14309 | ||
14310 | /* Not really used, but needed in the ada_language_defn. */ | |
14311 | ||
14312 | static void | |
6c7a06a3 | 14313 | emit_char (int c, struct type *type, struct ui_file *stream, int quoter) |
6c038f32 | 14314 | { |
6c7a06a3 | 14315 | ada_emit_char (c, type, stream, quoter, 1); |
6c038f32 PH |
14316 | } |
14317 | ||
14318 | static int | |
410a0ff2 | 14319 | parse (struct parser_state *ps) |
6c038f32 PH |
14320 | { |
14321 | warnings_issued = 0; | |
410a0ff2 | 14322 | return ada_parse (ps); |
6c038f32 PH |
14323 | } |
14324 | ||
14325 | static const struct exp_descriptor ada_exp_descriptor = { | |
14326 | ada_print_subexp, | |
14327 | ada_operator_length, | |
c0201579 | 14328 | ada_operator_check, |
6c038f32 PH |
14329 | ada_op_name, |
14330 | ada_dump_subexp_body, | |
14331 | ada_evaluate_subexp | |
14332 | }; | |
14333 | ||
b5ec771e PA |
14334 | /* symbol_name_matcher_ftype adapter for wild_match. */ |
14335 | ||
14336 | static bool | |
14337 | do_wild_match (const char *symbol_search_name, | |
14338 | const lookup_name_info &lookup_name, | |
a207cff2 | 14339 | completion_match_result *comp_match_res) |
b5ec771e PA |
14340 | { |
14341 | return wild_match (symbol_search_name, ada_lookup_name (lookup_name)); | |
14342 | } | |
14343 | ||
14344 | /* symbol_name_matcher_ftype adapter for full_match. */ | |
14345 | ||
14346 | static bool | |
14347 | do_full_match (const char *symbol_search_name, | |
14348 | const lookup_name_info &lookup_name, | |
a207cff2 | 14349 | completion_match_result *comp_match_res) |
b5ec771e PA |
14350 | { |
14351 | return full_match (symbol_search_name, ada_lookup_name (lookup_name)); | |
14352 | } | |
14353 | ||
14354 | /* Build the Ada lookup name for LOOKUP_NAME. */ | |
14355 | ||
14356 | ada_lookup_name_info::ada_lookup_name_info (const lookup_name_info &lookup_name) | |
14357 | { | |
14358 | const std::string &user_name = lookup_name.name (); | |
14359 | ||
14360 | if (user_name[0] == '<') | |
14361 | { | |
14362 | if (user_name.back () == '>') | |
14363 | m_encoded_name = user_name.substr (1, user_name.size () - 2); | |
14364 | else | |
14365 | m_encoded_name = user_name.substr (1, user_name.size () - 1); | |
14366 | m_encoded_p = true; | |
14367 | m_verbatim_p = true; | |
14368 | m_wild_match_p = false; | |
14369 | m_standard_p = false; | |
14370 | } | |
14371 | else | |
14372 | { | |
14373 | m_verbatim_p = false; | |
14374 | ||
14375 | m_encoded_p = user_name.find ("__") != std::string::npos; | |
14376 | ||
14377 | if (!m_encoded_p) | |
14378 | { | |
14379 | const char *folded = ada_fold_name (user_name.c_str ()); | |
14380 | const char *encoded = ada_encode_1 (folded, false); | |
14381 | if (encoded != NULL) | |
14382 | m_encoded_name = encoded; | |
14383 | else | |
14384 | m_encoded_name = user_name; | |
14385 | } | |
14386 | else | |
14387 | m_encoded_name = user_name; | |
14388 | ||
14389 | /* Handle the 'package Standard' special case. See description | |
14390 | of m_standard_p. */ | |
14391 | if (startswith (m_encoded_name.c_str (), "standard__")) | |
14392 | { | |
14393 | m_encoded_name = m_encoded_name.substr (sizeof ("standard__") - 1); | |
14394 | m_standard_p = true; | |
14395 | } | |
14396 | else | |
14397 | m_standard_p = false; | |
74ccd7f5 | 14398 | |
b5ec771e PA |
14399 | /* If the name contains a ".", then the user is entering a fully |
14400 | qualified entity name, and the match must not be done in wild | |
14401 | mode. Similarly, if the user wants to complete what looks | |
14402 | like an encoded name, the match must not be done in wild | |
14403 | mode. Also, in the standard__ special case always do | |
14404 | non-wild matching. */ | |
14405 | m_wild_match_p | |
14406 | = (lookup_name.match_type () != symbol_name_match_type::FULL | |
14407 | && !m_encoded_p | |
14408 | && !m_standard_p | |
14409 | && user_name.find ('.') == std::string::npos); | |
14410 | } | |
14411 | } | |
14412 | ||
14413 | /* symbol_name_matcher_ftype method for Ada. This only handles | |
14414 | completion mode. */ | |
14415 | ||
14416 | static bool | |
14417 | ada_symbol_name_matches (const char *symbol_search_name, | |
14418 | const lookup_name_info &lookup_name, | |
a207cff2 | 14419 | completion_match_result *comp_match_res) |
74ccd7f5 | 14420 | { |
b5ec771e PA |
14421 | return lookup_name.ada ().matches (symbol_search_name, |
14422 | lookup_name.match_type (), | |
a207cff2 | 14423 | comp_match_res); |
b5ec771e PA |
14424 | } |
14425 | ||
de63c46b PA |
14426 | /* A name matcher that matches the symbol name exactly, with |
14427 | strcmp. */ | |
14428 | ||
14429 | static bool | |
14430 | literal_symbol_name_matcher (const char *symbol_search_name, | |
14431 | const lookup_name_info &lookup_name, | |
14432 | completion_match_result *comp_match_res) | |
14433 | { | |
14434 | const std::string &name = lookup_name.name (); | |
14435 | ||
14436 | int cmp = (lookup_name.completion_mode () | |
14437 | ? strncmp (symbol_search_name, name.c_str (), name.size ()) | |
14438 | : strcmp (symbol_search_name, name.c_str ())); | |
14439 | if (cmp == 0) | |
14440 | { | |
14441 | if (comp_match_res != NULL) | |
14442 | comp_match_res->set_match (symbol_search_name); | |
14443 | return true; | |
14444 | } | |
14445 | else | |
14446 | return false; | |
14447 | } | |
14448 | ||
b5ec771e PA |
14449 | /* Implement the "la_get_symbol_name_matcher" language_defn method for |
14450 | Ada. */ | |
14451 | ||
14452 | static symbol_name_matcher_ftype * | |
14453 | ada_get_symbol_name_matcher (const lookup_name_info &lookup_name) | |
14454 | { | |
de63c46b PA |
14455 | if (lookup_name.match_type () == symbol_name_match_type::SEARCH_NAME) |
14456 | return literal_symbol_name_matcher; | |
14457 | ||
b5ec771e PA |
14458 | if (lookup_name.completion_mode ()) |
14459 | return ada_symbol_name_matches; | |
74ccd7f5 | 14460 | else |
b5ec771e PA |
14461 | { |
14462 | if (lookup_name.ada ().wild_match_p ()) | |
14463 | return do_wild_match; | |
14464 | else | |
14465 | return do_full_match; | |
14466 | } | |
74ccd7f5 JB |
14467 | } |
14468 | ||
a5ee536b JB |
14469 | /* Implement the "la_read_var_value" language_defn method for Ada. */ |
14470 | ||
14471 | static struct value * | |
63e43d3a PMR |
14472 | ada_read_var_value (struct symbol *var, const struct block *var_block, |
14473 | struct frame_info *frame) | |
a5ee536b | 14474 | { |
3977b71f | 14475 | const struct block *frame_block = NULL; |
a5ee536b JB |
14476 | struct symbol *renaming_sym = NULL; |
14477 | ||
14478 | /* The only case where default_read_var_value is not sufficient | |
14479 | is when VAR is a renaming... */ | |
14480 | if (frame) | |
14481 | frame_block = get_frame_block (frame, NULL); | |
14482 | if (frame_block) | |
14483 | renaming_sym = ada_find_renaming_symbol (var, frame_block); | |
14484 | if (renaming_sym != NULL) | |
14485 | return ada_read_renaming_var_value (renaming_sym, frame_block); | |
14486 | ||
14487 | /* This is a typical case where we expect the default_read_var_value | |
14488 | function to work. */ | |
63e43d3a | 14489 | return default_read_var_value (var, var_block, frame); |
a5ee536b JB |
14490 | } |
14491 | ||
56618e20 TT |
14492 | static const char *ada_extensions[] = |
14493 | { | |
14494 | ".adb", ".ads", ".a", ".ada", ".dg", NULL | |
14495 | }; | |
14496 | ||
47e77640 | 14497 | extern const struct language_defn ada_language_defn = { |
6c038f32 | 14498 | "ada", /* Language name */ |
6abde28f | 14499 | "Ada", |
6c038f32 | 14500 | language_ada, |
6c038f32 | 14501 | range_check_off, |
6c038f32 PH |
14502 | case_sensitive_on, /* Yes, Ada is case-insensitive, but |
14503 | that's not quite what this means. */ | |
6c038f32 | 14504 | array_row_major, |
9a044a89 | 14505 | macro_expansion_no, |
56618e20 | 14506 | ada_extensions, |
6c038f32 PH |
14507 | &ada_exp_descriptor, |
14508 | parse, | |
b3f11165 | 14509 | ada_yyerror, |
6c038f32 PH |
14510 | resolve, |
14511 | ada_printchar, /* Print a character constant */ | |
14512 | ada_printstr, /* Function to print string constant */ | |
14513 | emit_char, /* Function to print single char (not used) */ | |
6c038f32 | 14514 | ada_print_type, /* Print a type using appropriate syntax */ |
be942545 | 14515 | ada_print_typedef, /* Print a typedef using appropriate syntax */ |
6c038f32 PH |
14516 | ada_val_print, /* Print a value using appropriate syntax */ |
14517 | ada_value_print, /* Print a top-level value */ | |
a5ee536b | 14518 | ada_read_var_value, /* la_read_var_value */ |
6c038f32 | 14519 | NULL, /* Language specific skip_trampoline */ |
2b2d9e11 | 14520 | NULL, /* name_of_this */ |
6c038f32 PH |
14521 | ada_lookup_symbol_nonlocal, /* Looking up non-local symbols. */ |
14522 | basic_lookup_transparent_type, /* lookup_transparent_type */ | |
14523 | ada_la_decode, /* Language specific symbol demangler */ | |
8b302db8 | 14524 | ada_sniff_from_mangled_name, |
0963b4bd MS |
14525 | NULL, /* Language specific |
14526 | class_name_from_physname */ | |
6c038f32 PH |
14527 | ada_op_print_tab, /* expression operators for printing */ |
14528 | 0, /* c-style arrays */ | |
14529 | 1, /* String lower bound */ | |
6c038f32 | 14530 | ada_get_gdb_completer_word_break_characters, |
eb3ff9a5 | 14531 | ada_collect_symbol_completion_matches, |
72d5681a | 14532 | ada_language_arch_info, |
e79af960 | 14533 | ada_print_array_index, |
41f1b697 | 14534 | default_pass_by_reference, |
ae6a3a4c | 14535 | c_get_string, |
43cc5389 | 14536 | c_watch_location_expression, |
b5ec771e | 14537 | ada_get_symbol_name_matcher, /* la_get_symbol_name_matcher */ |
f8eba3c6 | 14538 | ada_iterate_over_symbols, |
5ffa0793 | 14539 | default_search_name_hash, |
a53b64ea | 14540 | &ada_varobj_ops, |
bb2ec1b3 TT |
14541 | NULL, |
14542 | NULL, | |
6c038f32 PH |
14543 | LANG_MAGIC |
14544 | }; | |
14545 | ||
5bf03f13 JB |
14546 | /* Command-list for the "set/show ada" prefix command. */ |
14547 | static struct cmd_list_element *set_ada_list; | |
14548 | static struct cmd_list_element *show_ada_list; | |
14549 | ||
14550 | /* Implement the "set ada" prefix command. */ | |
14551 | ||
14552 | static void | |
981a3fb3 | 14553 | set_ada_command (const char *arg, int from_tty) |
5bf03f13 JB |
14554 | { |
14555 | printf_unfiltered (_(\ | |
14556 | "\"set ada\" must be followed by the name of a setting.\n")); | |
635c7e8a | 14557 | help_list (set_ada_list, "set ada ", all_commands, gdb_stdout); |
5bf03f13 JB |
14558 | } |
14559 | ||
14560 | /* Implement the "show ada" prefix command. */ | |
14561 | ||
14562 | static void | |
981a3fb3 | 14563 | show_ada_command (const char *args, int from_tty) |
5bf03f13 JB |
14564 | { |
14565 | cmd_show_list (show_ada_list, from_tty, ""); | |
14566 | } | |
14567 | ||
2060206e PA |
14568 | static void |
14569 | initialize_ada_catchpoint_ops (void) | |
14570 | { | |
14571 | struct breakpoint_ops *ops; | |
14572 | ||
14573 | initialize_breakpoint_ops (); | |
14574 | ||
14575 | ops = &catch_exception_breakpoint_ops; | |
14576 | *ops = bkpt_breakpoint_ops; | |
2060206e PA |
14577 | ops->allocate_location = allocate_location_catch_exception; |
14578 | ops->re_set = re_set_catch_exception; | |
14579 | ops->check_status = check_status_catch_exception; | |
14580 | ops->print_it = print_it_catch_exception; | |
14581 | ops->print_one = print_one_catch_exception; | |
14582 | ops->print_mention = print_mention_catch_exception; | |
14583 | ops->print_recreate = print_recreate_catch_exception; | |
14584 | ||
14585 | ops = &catch_exception_unhandled_breakpoint_ops; | |
14586 | *ops = bkpt_breakpoint_ops; | |
2060206e PA |
14587 | ops->allocate_location = allocate_location_catch_exception_unhandled; |
14588 | ops->re_set = re_set_catch_exception_unhandled; | |
14589 | ops->check_status = check_status_catch_exception_unhandled; | |
14590 | ops->print_it = print_it_catch_exception_unhandled; | |
14591 | ops->print_one = print_one_catch_exception_unhandled; | |
14592 | ops->print_mention = print_mention_catch_exception_unhandled; | |
14593 | ops->print_recreate = print_recreate_catch_exception_unhandled; | |
14594 | ||
14595 | ops = &catch_assert_breakpoint_ops; | |
14596 | *ops = bkpt_breakpoint_ops; | |
2060206e PA |
14597 | ops->allocate_location = allocate_location_catch_assert; |
14598 | ops->re_set = re_set_catch_assert; | |
14599 | ops->check_status = check_status_catch_assert; | |
14600 | ops->print_it = print_it_catch_assert; | |
14601 | ops->print_one = print_one_catch_assert; | |
14602 | ops->print_mention = print_mention_catch_assert; | |
14603 | ops->print_recreate = print_recreate_catch_assert; | |
9f757bf7 XR |
14604 | |
14605 | ops = &catch_handlers_breakpoint_ops; | |
14606 | *ops = bkpt_breakpoint_ops; | |
14607 | ops->allocate_location = allocate_location_catch_handlers; | |
14608 | ops->re_set = re_set_catch_handlers; | |
14609 | ops->check_status = check_status_catch_handlers; | |
14610 | ops->print_it = print_it_catch_handlers; | |
14611 | ops->print_one = print_one_catch_handlers; | |
14612 | ops->print_mention = print_mention_catch_handlers; | |
14613 | ops->print_recreate = print_recreate_catch_handlers; | |
2060206e PA |
14614 | } |
14615 | ||
3d9434b5 JB |
14616 | /* This module's 'new_objfile' observer. */ |
14617 | ||
14618 | static void | |
14619 | ada_new_objfile_observer (struct objfile *objfile) | |
14620 | { | |
14621 | ada_clear_symbol_cache (); | |
14622 | } | |
14623 | ||
14624 | /* This module's 'free_objfile' observer. */ | |
14625 | ||
14626 | static void | |
14627 | ada_free_objfile_observer (struct objfile *objfile) | |
14628 | { | |
14629 | ada_clear_symbol_cache (); | |
14630 | } | |
14631 | ||
d2e4a39e | 14632 | void |
6c038f32 | 14633 | _initialize_ada_language (void) |
14f9c5c9 | 14634 | { |
2060206e PA |
14635 | initialize_ada_catchpoint_ops (); |
14636 | ||
5bf03f13 JB |
14637 | add_prefix_cmd ("ada", no_class, set_ada_command, |
14638 | _("Prefix command for changing Ada-specfic settings"), | |
14639 | &set_ada_list, "set ada ", 0, &setlist); | |
14640 | ||
14641 | add_prefix_cmd ("ada", no_class, show_ada_command, | |
14642 | _("Generic command for showing Ada-specific settings."), | |
14643 | &show_ada_list, "show ada ", 0, &showlist); | |
14644 | ||
14645 | add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure, | |
14646 | &trust_pad_over_xvs, _("\ | |
14647 | Enable or disable an optimization trusting PAD types over XVS types"), _("\ | |
14648 | Show whether an optimization trusting PAD types over XVS types is activated"), | |
14649 | _("\ | |
14650 | This is related to the encoding used by the GNAT compiler. The debugger\n\ | |
14651 | should normally trust the contents of PAD types, but certain older versions\n\ | |
14652 | of GNAT have a bug that sometimes causes the information in the PAD type\n\ | |
14653 | to be incorrect. Turning this setting \"off\" allows the debugger to\n\ | |
14654 | work around this bug. It is always safe to turn this option \"off\", but\n\ | |
14655 | this incurs a slight performance penalty, so it is recommended to NOT change\n\ | |
14656 | this option to \"off\" unless necessary."), | |
14657 | NULL, NULL, &set_ada_list, &show_ada_list); | |
14658 | ||
d72413e6 PMR |
14659 | add_setshow_boolean_cmd ("print-signatures", class_vars, |
14660 | &print_signatures, _("\ | |
14661 | Enable or disable the output of formal and return types for functions in the \ | |
14662 | overloads selection menu"), _("\ | |
14663 | Show whether the output of formal and return types for functions in the \ | |
14664 | overloads selection menu is activated"), | |
14665 | NULL, NULL, NULL, &set_ada_list, &show_ada_list); | |
14666 | ||
9ac4176b PA |
14667 | add_catch_command ("exception", _("\ |
14668 | Catch Ada exceptions, when raised.\n\ | |
14669 | With an argument, catch only exceptions with the given name."), | |
14670 | catch_ada_exception_command, | |
14671 | NULL, | |
14672 | CATCH_PERMANENT, | |
14673 | CATCH_TEMPORARY); | |
9f757bf7 XR |
14674 | |
14675 | add_catch_command ("handlers", _("\ | |
14676 | Catch Ada exceptions, when handled.\n\ | |
14677 | With an argument, catch only exceptions with the given name."), | |
14678 | catch_ada_handlers_command, | |
14679 | NULL, | |
14680 | CATCH_PERMANENT, | |
14681 | CATCH_TEMPORARY); | |
9ac4176b PA |
14682 | add_catch_command ("assert", _("\ |
14683 | Catch failed Ada assertions, when raised.\n\ | |
14684 | With an argument, catch only exceptions with the given name."), | |
14685 | catch_assert_command, | |
14686 | NULL, | |
14687 | CATCH_PERMANENT, | |
14688 | CATCH_TEMPORARY); | |
14689 | ||
6c038f32 | 14690 | varsize_limit = 65536; |
6c038f32 | 14691 | |
778865d3 JB |
14692 | add_info ("exceptions", info_exceptions_command, |
14693 | _("\ | |
14694 | List all Ada exception names.\n\ | |
14695 | If a regular expression is passed as an argument, only those matching\n\ | |
14696 | the regular expression are listed.")); | |
14697 | ||
c6044dd1 JB |
14698 | add_prefix_cmd ("ada", class_maintenance, maint_set_ada_cmd, |
14699 | _("Set Ada maintenance-related variables."), | |
14700 | &maint_set_ada_cmdlist, "maintenance set ada ", | |
14701 | 0/*allow-unknown*/, &maintenance_set_cmdlist); | |
14702 | ||
14703 | add_prefix_cmd ("ada", class_maintenance, maint_show_ada_cmd, | |
14704 | _("Show Ada maintenance-related variables"), | |
14705 | &maint_show_ada_cmdlist, "maintenance show ada ", | |
14706 | 0/*allow-unknown*/, &maintenance_show_cmdlist); | |
14707 | ||
14708 | add_setshow_boolean_cmd | |
14709 | ("ignore-descriptive-types", class_maintenance, | |
14710 | &ada_ignore_descriptive_types_p, | |
14711 | _("Set whether descriptive types generated by GNAT should be ignored."), | |
14712 | _("Show whether descriptive types generated by GNAT should be ignored."), | |
14713 | _("\ | |
14714 | When enabled, the debugger will stop using the DW_AT_GNAT_descriptive_type\n\ | |
14715 | DWARF attribute."), | |
14716 | NULL, NULL, &maint_set_ada_cmdlist, &maint_show_ada_cmdlist); | |
14717 | ||
6c038f32 PH |
14718 | decoded_names_store = htab_create_alloc |
14719 | (256, htab_hash_string, (int (*)(const void *, const void *)) streq, | |
14720 | NULL, xcalloc, xfree); | |
6b69afc4 | 14721 | |
3d9434b5 JB |
14722 | /* The ada-lang observers. */ |
14723 | observer_attach_new_objfile (ada_new_objfile_observer); | |
14724 | observer_attach_free_objfile (ada_free_objfile_observer); | |
e802dbe0 | 14725 | observer_attach_inferior_exit (ada_inferior_exit); |
ee01b665 JB |
14726 | |
14727 | /* Setup various context-specific data. */ | |
e802dbe0 | 14728 | ada_inferior_data |
8e260fc0 | 14729 | = register_inferior_data_with_cleanup (NULL, ada_inferior_data_cleanup); |
ee01b665 JB |
14730 | ada_pspace_data_handle |
14731 | = register_program_space_data_with_cleanup (NULL, ada_pspace_data_cleanup); | |
14f9c5c9 | 14732 | } |